URL
stringlengths
15
1.68k
text_list
sequencelengths
1
199
image_list
sequencelengths
1
199
metadata
stringlengths
1.19k
3.08k
https://mathoverflow.net/questions/35127/why-does-the-algebraic-condition-of-flatness-on-the-structure-sheaves-give-a-go
[ "# Why does the algebraic condition of flatness on the structure sheaves give a good definition of family?\n\nHartshorne remarks that is is something of a mystery as to why the algebraic condition of flatness on the structure sheaves gives a good definition of a family (see below). Are there any known enlightening explanations that help serve to unravel this mystery? Below is Hartshorne's introductory motivation to flat families containing said remark:\n\nFor many reasons it is important to have a good notion of an algebraic family of varieties or schemes. The most naive definition would be just to take the fibres of a morphism. To get a good notion, however, we should require that certain numerical invariants remain constant in a family, such as the dimension of the fibres. It turns out that if we are dealing with non- singular (or even normal) varieties over a field, then the naive definition is already a good one. Evidence for this is the theorem (9.13) that in such a family, the arithmetic genus is constant.\n\nOn the other hand, if we deal with nonnormal varieties, or more general schemes, the naive definition will not do. So we consider a flat family of schemes, which means the fibres of a flat morphism, and this is a very good notion. Why the algebraic condition of flatness on the structure sheaves should give a good definition of a family is something of a mystery. But at least we will justify this choice by showing that flat families have many good properties, and by giving necessary and sufficient conditions for flatness in some special cases. In particular, we will show that a family of closed subschemes of projective space (over an integral scheme) is flat if and only if the Hilbert polynomials of the fibres are the same. -- Hartshorne, Algebraic Geometry, 1977, III.9.5, p. 256\n\n• Here's something \"technically useful\" (& underlies Hilbert schemes, ur-example of flatness for moduli problems): if $X \\rightarrow S$ is map of schemes and $j:Z \\hookrightarrow X$ is closed immersion defined by q-coh ideal $I$ such that $Z$ is flat over $S$, then for any $f:S' \\rightarrow S$ the exact sequence $0 \\rightarrow I \\rightarrow O_X \\rightarrow j_{\\ast}O_Z \\rightarrow 0$ has $S$-flat right term, so $f^{\\ast}I \\rightarrow O_{X'}$ is injective. Thus, ideal of $Z' \\hookrightarrow X'$ is the \"abstract\" pullback $f^{\\ast}I$ treating $I$ as \"abstract\" $O_X$-module. This is important. – BCnrd Aug 10 '10 at 16:11\n• To \"explain\" ubiquity of flatness, use Theorem 23.1 in Matsumura's Commutative Ring Theory book: if $f:X \\rightarrow Y$ is map from regular scheme to Cohen-Macaulay scheme (e.g., smooth varieties over field) then \"dimension formula\" ${\\rm{dim}} O_ {X,x} = {\\rm{dim}} O_ {Y,f(x)} + {\\rm{dim}} O_ {X_ {f(x)}, x}$ is equivalent to flatness of $f$ at $x$. A great non-trivial example is q-finite map between smooth varieties of same dimension. Serre told me that the geometric significance of flatness was entirely due to Grothendieck (Serre invented it as a purely algebraic device for GAGA). – BCnrd Aug 10 '10 at 16:18\n• Correction: in 2nd comment above, $Y$ should be regular, and $X$ Cohen-Macalay (or just assume both regular so can save memory for other things...but the CM case is useful for surfaces...) – BCnrd Aug 10 '10 at 16:19\n• Section II.3.4 in Eisenbud/Harris contains an elaborate introduction to flat families of schemes. Especially Proposition II.29 might help you. It says roughly that for a flat family + other conditions the fiber of a closed point 0 is the limit of the fibers of points b where b goes to 0. – C. Jost Aug 11 '10 at 8:25\n• Thanks to all for the many interesting remarks, here and below. – Bill Dubuque Aug 17 '10 at 18:54\n\nHere is an elementary and intuitive explanation. The fiber of a map is locally a tensor product: if $X=\\text{Spec} S$ and $Y=\\text{Spec} R$ and the ring map is $R \\to S$, then the fiber at a point $p \\in Y$ is the Spec of $R_p/pR_p \\otimes_R S$.\n\nFlatness is exactly the condition that makes tensor products behave like a dream (almost by definition), it preserves a lot of useful structures. Many algebraic results with geometric consequences go like this: let $(P)$ be a reasonable property and $f: R\\to S$ a flat local homomorphism. Then $S$ satisfies $(P)$ if and only if $R$ and the fiber at the closed point satisfy $(P)$ (these are called Grothendieck localization problem).\n\nI am not a historian, but I suspect that was how flatness arised: people wanted certain nice things to be true, and were naturally lead to flatness (see BCnrd's comment below for the precise history).\n\n• Hailong, the history is that for his GAGA theorems, Serre needed an algebraic mechanism to explain how passing from algebraic to analytic settings (such as for vector bundles, coherent sheaves, etc.) preserved various exactness properties. In this case the algebraic and analytic local rings at a common point were known to be noetherian with the same completion, and completion was known to be preserve exactness under tensoring (Artin-Rees). This led Serre to isolate flatness as an interesting algebraic concept (incorporating exactness of localization), and then it took on a life of its own. – BCnrd Aug 10 '10 at 19:12\n• Dear Brian, thanks for the precise history. – Hailong Dao Aug 10 '10 at 19:27\n• $Quot(R/p) \\otimes_R S$, right? – Martin Brandenburg Aug 25 '10 at 9:39\n• Oh, I forgot to localize! – Hailong Dao Aug 26 '10 at 19:36\n• I think the following precise statement holds: Let $\\phi : A \\to B$ be a morphism of noetherian rings then $B$ is flat iff the preimage $Spec A/ \\mathfrak{p}A \\otimes_A B$ coincides with $Spec B/\\phi(\\mathfrak{p})B$ for every $\\mathfrak{p}\\in SpecA$ . Which means that the two possible ways of taking preimages of closed subsets coincide (first is the usual pullback as schemes and the second is pulling back the ideal and looking at the closed subscheme defined by it). Strangely enough, I have never contemplated this subtle point about preimages. – Saal Hardali Jun 6 '16 at 23:55\n\nThere is also the following (probably unhistorical) point of view (it is a version of Hailong Dao's answer). Namely, you don't have to work with flat families at all, so if you want, you can just declare all morphisms to be families'. The problem with this approach is that this is a family ofderived' objects. Here's an example:\n\nLet $S$ be a scheme, and let $F$ be a coherent sheaf on S. When is it a `family' of its fibers? If it is flat, it definitely deserves to be called a family of vector spaces (a vector bundle). But even if it is not flat, you can still view it as a family, but the family of what? The (derived) fibers of $F$ are no longer vector spaces, they are complexes of vector spaces (precisely because $F$ fails to be flat), so we can view $F$ as a nice family of complexes of vector spaces, even though $F$ itself is a sheaf, not a complex.\n\nTo summarize: by all means, let's forget about flatness and declare any morphism to be a family... of some kind of derived objects. If we now want members of the family to be actual objects (schemes, vector spaces, sheaves, or whatever it is we are trying to include in a family), flatness is forced on you more or less by definition.\n\nThere is a nice computational perspective in Bayer and Mumford's What Can Be Computed in Algebraic Geometry? pages 4,5." ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.9488219,"math_prob":0.98149824,"size":1704,"snap":"2019-51-2020-05","text_gpt3_token_len":370,"char_repetition_ratio":0.12411765,"word_repetition_ratio":0.048442908,"special_character_ratio":0.20481221,"punctuation_ratio":0.10060976,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99524146,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-12-15T11:31:46Z\",\"WARC-Record-ID\":\"<urn:uuid:916f6d4d-be1a-434d-9677-af8c03c635b3>\",\"Content-Length\":\"139067\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:c8bdcfb8-6436-4de7-9cd9-6f04369fdcc3>\",\"WARC-Concurrent-To\":\"<urn:uuid:2e4c074a-562d-4597-bd76-b6a1676650ff>\",\"WARC-IP-Address\":\"151.101.1.69\",\"WARC-Target-URI\":\"https://mathoverflow.net/questions/35127/why-does-the-algebraic-condition-of-flatness-on-the-structure-sheaves-give-a-go\",\"WARC-Payload-Digest\":\"sha1:QNB7LD2MH5F7CYU3Z3AZGPZRDEDRHGBN\",\"WARC-Block-Digest\":\"sha1:6C3B573A4YUSJA7QJLEOVWAGGG5OG6ID\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-51/CC-MAIN-2019-51_segments_1575541307813.73_warc_CC-MAIN-20191215094447-20191215122447-00142.warc.gz\"}"}
https://solvedlib.com/n/activity-6-3-4-consider-a-thimbar-of-length-20-cm-whose,19293825
[ "# Activity 6.3.4. Consider a thimbar of length 20 cm whose density is distributed according to the function (r) = 4+0.lz,\n\n###### Question:\n\nActivity 6.3.4. Consider a thimbar of length 20 cm whose density is distributed according to the function (r) = 4+0.lz, where z = 0 represents the left end of the bar, Assume that p is measured in g/cm and z is measured in cm_ Find the total mass, M, of the bar; Without doing any calculations, do you expect the center of mass of the bar to be equal to 10, less than 10,or greater than 10? Why? Compute the exact center of mass of the bar. What is the average density of the bar? Now consider a different density function, given by plz) = 4e0.0207322,also for a bar of Tlength 20 cm whose left end is at z = 0. Plot both e(z) and p(z) on the same axes. Without doing any calculations, which bar do you expect to have the greater center of mass? Why? Compute the exact center of mass of the bar described in (e) whose density function iS p(c) 0207321 Check the result against the prediction you made in (e): prt SC delete home nunt Toc 8 Dacaadeca", null, "", null, "#### Similar Solved Questions\n\n##### 72sin (0) lecnaov ;WnmibenceebNoial IYou want\n72 sin (0) le cnaov ; Wnmibenceeb Noial IYou want...\n##### Write a program that reads the integer numbers in a text file (numbers.txt) and stores the...\nWrite a program that reads the integer numbers in a text file (numbers.txt) and stores the numbers to a binary file (binaryNumber.dat). (5 pts) The number.txt file contains the following numbers: 1 2 3 4 5 6 7 8 9 0 7. Write a program that reads the integer numbers in a text file (numbers.txt) and ...\n##### A 400.0-N sign hangs from the end of uniform strut The strut is 4.0 long and weighs 600.0 N. The strut is supported by hinge at the wall and by cable whose other end is tied t0 the wall at point 3.0 m above the left end of the stut: (A) Draw all the forces acting on the strut: Find the tension in the supporting cable: Find the force (magnitude and direction) that the hinge puts on the strul50m#om40in\nA 400.0-N sign hangs from the end of uniform strut The strut is 4.0 long and weighs 600.0 N. The strut is supported by hinge at the wall and by cable whose other end is tied t0 the wall at point 3.0 m above the left end of the stut: (A) Draw all the forces acting on the strut: Find the tension in th...\n##### Uantdaam _ mcticn?NcolercrdinStem EgWSua5 47^iloneEegte caI10 ajonznarticim |ude058-17\nuantda am _ mcticn?Ncoler crdin Stem Eg WSua 5 47^ ilone Eegte caI 10 ajonz narticim | ude 058-17..." ]
[ null, "https://cdn.numerade.com/ask_images/f3111260624b4fa78404ac70e0021483.jpg ", null, "https://cdn.numerade.com/previews/704057c1-ed1a-4d55-a8b5-9c271a103a84_large.jpg", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.94795567,"math_prob":0.9565998,"size":8055,"snap":"2023-14-2023-23","text_gpt3_token_len":1968,"char_repetition_ratio":0.17749348,"word_repetition_ratio":0.015253203,"special_character_ratio":0.23985103,"punctuation_ratio":0.13114753,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9833604,"pos_list":[0,1,2,3,4],"im_url_duplicate_count":[null,1,null,1,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-06-08T12:26:52Z\",\"WARC-Record-ID\":\"<urn:uuid:d890634e-9f8b-46b4-b3a2-5e74c9edc9e8>\",\"Content-Length\":\"124601\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:d7faf97e-9661-43c5-9ac9-f32a4c00fd58>\",\"WARC-Concurrent-To\":\"<urn:uuid:2a037790-bc9e-497b-b910-eac0b54804be>\",\"WARC-IP-Address\":\"172.67.132.66\",\"WARC-Target-URI\":\"https://solvedlib.com/n/activity-6-3-4-consider-a-thimbar-of-length-20-cm-whose,19293825\",\"WARC-Payload-Digest\":\"sha1:YKJ7KQVUNY3IQHOU3YOZZLAQZT2XXCQ4\",\"WARC-Block-Digest\":\"sha1:37NLYC2DTF7B7FEZMMAOAZ7AT5ZDMVQF\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-23/CC-MAIN-2023-23_segments_1685224654871.97_warc_CC-MAIN-20230608103815-20230608133815-00079.warc.gz\"}"}
http://math.rwinters.com/18012A/calendar.htm
[ "Math 18.01A-18.02A Concourse – Calendar of topics and HW assignments -- Fall 2018 and IAP 2019\nlast updated Tuesday, February 5, 2019 9:35 AM\nThe topics and assignments will change as the course proceeds!! Check back frequently.\n\nN Date Topics Assignments & References [Solutions]\n1 Wed, Sept 5 Review of differentiation [Simmons Chapters 1-3]\nLinear and quadratic approximations.\n\nRead: SN-A (Approximation);\nRead text: 2.6 (through pg. 77);\nRead SN-MVT (Mean Value Theorem).\nRead text: 12.2, 12.3 (examples 1-3, remark 1).\n\nProblem Set #1 (due Thurs, Sept 13)\n\n2 Thurs, Sept 6 Higher order (Taylor and Maclaurin) polynomial approximations.\n3 Mon, Sept 10 Extended Mean Value Theorem and error estimation.\n4 Tues, Sept 11 Indeterminate forms, L'Hospital's rule, growth rate of functions.\n5 Wed, Sept 12 Definite integral; summation notation. First Fundamental Theorem of Calculus, Second Fundamental Theorem, ln x as an integral, Leibnitz' Rule.\n\nRead: SN-PI (Properties of Integrals)\nRead: SN-FT (Second Fundamental Theorem).\nRead text: 6.3-6.7; 7.1-7.6\nRead SN-AV (Average Value).\n\nProblem Set #2 (due Fri, Sept 21)\n\n6 Thurs, Sept 13 Problem set questions; functions defined by integrals. Geometric applications: area, signed area, average value of a function; area between curves.\n7 Mon, Sept 17 Integral applications: volumes, volumes of solids of revolution, arclength, surface area.\n8 Tues, Sept 18 Examples of volumes, surface area, arclength using integration.\n9 Wed, Sept 19 Integral applications: work, mass, pumping. Integration techniques: basic integrals, substitution, trig. integrals,\n\nReferences: Text sections 7.7 (work and energy); 10.1-10.6 (Integration: substitution, trig. integrals, completing the square, partial fractions and rational functions.)\n\nProblem Set #3 (due Fri, Sept 28)\n\n10 Thurs, Sept 20 Problem set questions; Integration techniques: basic integrals, substitution, trig. integrals, powers and products of trig. functions.\n11 Mon, Sept 24 Integration techniques: powers and products of trig. functions; dealing with quadratic expressions in integrals (trigonometric substitutions), completing the square; integration of rational functions via partial fractions.\n12 Tues, Sept 25 Integration techniques: partial fractions.\n13 Wed, Sept 26 Integration techniques: partial fractions, integration by parts, reduction formulas.\n\nRead text: 10.7-10.9 (integration by parts, miscellaneous other methods, numerical integration); SN: F; 12.4 (improper integrals); Read SN-INT (Improper Integrals)\n\nProblem Set #4 (due Fri, Oct 5)\n\n14 Thurs, Sept 27 Numerical integration; improper integrals (infinite domain, discontinuous integrands), comparison test, limit comparison test, p-test for integrals. Problem set questions.\n15 Mon, Oct 1 Numerical integration; improper integrals (infinite domain, discontinuous integrands), comparison test, limit comparison test, p-test for integrals.\n\nExam 1 Practice Questions    Solutions\n(use same username/password as solutions)\n\n16 Tues, Oct 2\n\nExam 1 - Topics covered may include:     Solutions\n\n1) Linear, quadratic, Taylor (nth order) approximations and series: a) by formula; b) by manipulating known series;\n\n2) L'Hôpital's Rule and indeterminate forms (limits);\n\n3) Definite integrals in the calculation of area, volume, arclength, average value, work;\n\n4) First and Second Fundamental Theorems of Calculus, and Leibnitz' Rule\n\n5) Integration techniques: a) substitution; b) trig. substitutions; c) powers and products of trig. functions; partial fractions; integration by parts; reduction formulas.\n\n17 Wed, Oct 3 Sequences of real numbers, convergence of a sequence. Infinite series, geometric series\n\nRead relevant portions of text: 13.1 – 13.8 (sequences and series).\n\nSupplement on Integral Test and Comparison Tests\n\nProblem Set #5 (due Mon, Oct 15)\n\n18 Thurs, Oct 4 Problem Set questions\n19 Wed, Oct 10 Harmonic series, convergence tests (divergence test, p-test, comparison test, integral test, limit comparison test, ratio test); Alternating series, absolute vs. conditional convergence.\n20 Thurs, Oct 11\n21 Mon, Oct 15 Ratio Test for absolute convergence. Power series, radius and interval of convergence.\n\nRead relevant portions of text: 14.1-14.5\n\nProblem Set #6 (due Monday, Oct 22)\n\n22 Tues, Oct 16 Taylor series revisited.\n23 Wed, Oct 17\n\nError estimation using Taylor's Theorem with Remainder.\n\nPractice Questions for 18.01A Final Exam (Exam #2)\n\nSolutions to 18.01A Exam #2 Practice Questions\n\n24 Thurs, Oct 18\n\nTaylor's Theorem with Remainder, continued.\n\n25 Mon, Oct 22\n\nCoordinates, vectors (start of 18.02A); coordinate-free vector proofs, parameterized lines.\n\nLecture Notes #1\n\nRead text: 17.3, 18.1, 18.2, 18.3, 18.4.\nRW-Vectors (Supplement on Vectors, dot product, projections, cross product)\n\nProblem Set #7 (due Wednesday, Oct 31)\n\n26 Tues, Oct 23 18.01A Final Exam, a 2-hour exam\n27 Wed, Oct 24\n\nCoordinates, vectors; coordinate-free vector proofs, parameterized lines; dot product.\n[Lecture Notes on Coordinates & Vectors]\n\n28 Thurs, Oct 25 Dot product, scalar and vector projection, equation of a plane; introduction to cross-product.\n[Lecture Notes on Dot Product, Cross Product, Planes, Area, and Volumes]\n\nLecture Notes #2\n\nRead text: 17.1, 17.2, 17.4, 17.5; 18.02 Supplementary Notes: SN-D (Determinants), SN-M (Matrices and Linear Algebra)\n\nRW-Vectors (Supplement on Vectors, dot product, projections, cross product)\n\nSupplement on Solving Systems of Linear Equations via Row Reduction\n\nSupplement: Vector and matrix forms of a system of linear equations, matrix algebra, inverse matrices, and related facts\n\nProblem Set #8 (due Thurs, Nov 8)\n\n29 Mon, Oct 29\n\nCross product; lines and planes; determinants, distance, area, volume.\n\n30 Tues, Oct 30\n31 Wed, Oct 31\n\nMatrix methods, row reduction, inverse matrices.\n[Lecture Notes on vector and matrix forms of a system of linear equations, matrix algebra, inverse matrices, and related facts]\n\n32 Thurs, Nov 1\n33 Mon, Nov 5\n\nParametric equations and vector derivatives; velocity vector, acceleration vector, speed, unit tangent vector, curvature.\n[Lecture Notes on Parameterized Curves and Vector-Valued Functions]\n\nLecture Notes #3\n\nRead text: 17.1-17.2, 17.4-17.6; RW-ParamCurves (Supplement on parametrized curves and vector-valued functions); SN-K (Kepler's 2nd Law)\n\nProblem Set #9 (due Thurs, Nov 15)\n\nExam 3 Practice Questions     Solutions\n\n34 Tues, Nov 6\n\nParametric equations, continued.\nKepler's second law (read the supplement, not covered in class)\n\n35 Wed, Nov 7\n\nGraphs of surfaces, cross-sections. Functions of several variables, graph vs. level sets (contours). [Lecture Notes on Paramaterized Surfaces, Tangent Vectors, Partial Derivatives]\n\nLecture Notes #4\n\n36 Thurs, Nov 8\n\nFunctions of several variables, level curves and surfaces. Limits and continuity, differentiability, and partial derivatives. Tangent plane, linear approximation.\n\n37 Mon, Nov 12\n(to be rescheduled)\n\nTangent plane, linear approximation, increments and differentials, rate of change of a function along a parameterized curve: basic Chain Rule. Gradient and directional derivative. [Notes on limits, continuity, differentiability and linear approximation]\n\nLecture Notes #5\n\nRead 19.1, 19.2 (Partial Derivatives)\nSN-TA (Tangent Approximation)\n19.6 (Chain Rule)\n\nNotes on Gradients, Chain Rule, Implicit Differentiation, and Higher Order Derivatives\n\nProblem Set #10 (due Thurs, Nov 29)\n\n38 Tues, Nov 13 Chain Rule, gradient vector, directional derivatives. Find normal vectors using the gradient vector.\n39 Wed, Nov 14\n\nImplicit differentiation.\n[Lecture Notes on Differentials, the Chain Rule, Gradients, Directional Derivative, and Normal Vectors]\n\nLecture Notes #6\n\n40 Thurs, Nov 15 Exam 3\nTopics include: Coordinates, vectors, vector operations and tools (adding, scaling, dot product, cross product), lines, planes, intersections, distance, area, volume; matrix methods for solving systems of linear equations, row reduction, parameterization, matrix inverse; parameterized curves, velocity, acceleration, unit tangent vector, unit normal vector, curvature, differentiation of vector-valued functions.\n41 Mon, Nov 19\n\nGeneral Chain Rule, implicit differentiation, higher order derivatives, equality of mixed partials (Clairaut's Theorem).\n\n42 Tues, Nov 20\n\nQuadratic approximation; critical points, second derivative test; unconstrained optimization.\n\nLecture Notes #7\n\n43 Mon, Nov 26\n\nLecture Notes on Extrema of Functions of Several Variables\n\nRead:\n19.7 (Maximum and Minimum Problems)\n19.8 (Constrained Maxima and Minima, Lagrange Multipliers)\n19.10 (Implicit Functions)\nRW-Chain Rule and Implicit Differentiation\nSN-LS (Least Squares Interpolation)\nSN-N (Non-independent Variables, sections 1-3)\n\nProblem Set #11 (due Thurs, Dec 6)\n\n44 Tues, Nov 27\n\nQuestions\n\n45 Wed, Nov 28\n\nMax-min problems, Method of Least Squares. Constrained optimization, Method of Lagrange Multipliers.\n\nLecture Notes #8\n\n46 Thurs, Nov 29\n\nMethod of Lagrange Multipliers, continued - economics applications.\n\n47 Mon, Dec 3\n\nConstrained optimization w/multiple constraints; Non-independent variables.\n\nPractice Exam #4 Questions     Solutions\n48 Tues, Dec 4\n\nDouble integrals and their applications - volume, mass, area, averaging, centroid. Evaluation of double integrals via iterated single integrals, the Fubini Theorem.\n\nLecture Notes #9\n\nRead 20.1 (Volumes)\n20.2 (Double Integrals and Iterated Integrals)\nSN-I (Limits in Iterated Integrals)\n20.3 (Applications of Double Integrals)\n16.1 (Polar Coordinates)\n16.2 (Graphs of Polar Equations)\n20.4 (Double Integrals in Polar Coordinates)\nSN-CV (Change of Variables in Double Integrals)\n\nProblem Set #12 (due 1st week IAP)\n\n49 Wed, Dec 5\n\nPolar coordinates, double integrals in polar coordinates; additional applications. Weighted averages, center of mass; change of variables in double integrals.\n\n50 Thurs, Dec 6 Exam 4: Topics may include partial derivatives, linear approximation, differentials, gradient vector, normal vectors to curves and surfaces, directional derivative, the Chain Rule, implicit differentiation, stationary points, second derivative test, optimization, Method of Lagrange Multipliers, constrained optimization with one or more constraints, partial derivatives in the case of non-independent (constrained) variables.\n51 Mon, Dec 10 Polar coordinates, double integrals in polar coordinates; additional applications. Weighted averages, center of mass; change of variables in double integrals.\n\nLecture #10 Notes\n\n52 Tues, Dec 11 Examples and techniques for change of variables; problem set questions\n53 Wed, Dec 12\n\nWeighted averages, center of mass; change of variables in double integrals.\n\nLecture #11 Notes (first part re: change of variables in double integrals)\n\nHoliday Break\n*\n\nIAP Schedule (starting Monday, January 7):\nLecture/Recitation: Mon, Wed 12:00pm to 1:00pm; Tues, Thurs, 1:00pm to 2:30pm in 16-160.\nAdditional recitation time informally afternoons in Concourse Lounge or the classroom.\n\nIAP Schedule (Mon, Jan 14 onward):\nLecture: Mon, Wed 12:00pm to 1:30pm; Tues 1:00pm to 3:00pm; Recitation: Thurs 1:00pm to 2:30pm.\nAdditional recitation time informally afternoons in Concourse Lounge or the classroom.\n\nPset 13: Vector fields, integration along curves, line integrals, work, conservative vector fields, and work.\n\nNotes V1 (Plane Vector Fields)\nNotes V8 (Vector Fields in Space)\nNotes V11 (Line Integrals in Space)\nNotes V2 (Gradient Fields and Exact Differentials)\nNotes V12 (Gradient Fields in Space)\n\nSimmons text, sections 21.1 and 21.2\nand posted Lecture Notes.\n\nProblem Set #13 (due Fri, Jan 11)\n\n54 Mon, Jan 7\n\nVector fields; integration along curves in R2 and R3. Line integrals and work.\n\nLecture #11 Notes\n\nHere's a website that has a good java-based tool for showing vector fields and flows: http://math.rice.edu/~dfield/dfpp.html. The current version requires you to download a Java executable file to your own computer and to run it locally on your own machine. You can customize various options. You can also print the graphs. [How Java is called varies on computer and operating system, so we may have to provide some additional documentation.]\n55 Tues, Jan 8 Gradient and conservative fields.\n56 Wed, Jan 9\n\nPotential functions; test for exactness; algebraic definitions of curl and divergence.\n\nPset 14: Green's Theorem (ordinary and normal form), its corollaries and applications; algebraic definitions of divergence and curl of a vector field.\n\nSimmons text, section 21.3\nNotes V3 (Two-dimensional Flux)\nNotes V4 (Green's Theorem in Normal Form)\n\nProblem Set #14 (due Wed, Jan 16)\n\n57 Thurs, Jan 10 Green's Theorem; corollaries and applications of Green's Theorem.\n\n2D-Flux: normal form of Green's Theorem.\n\nLecture #12 Notes\n\n58 Mon, Jan 14 Review of double integrals; introduction to triple integrals and applications.\nTriple integrals in rectangular, cylindrical, and spherical coordinates.\n\nLecture #10 Notes\n\nPset 15: Integration of functions over regions in space using Cartesian, cylindrical, and spherical coordinates; applications in physics.\n\nSimmons text, sections 20.5, 20.6, and 20.7\nNotes CV (Changing Variables in Multiple Integrals)\nNotes G (Gravitational Attraction)\n\nProblem Set #15 (due Tues, Jan 22)\n\n59 Tues, Jan 15 Triple integrals (again) in rectangular, cylindrical, and spherical coordinates.\n\nExam #5 Topics & Practice Questions (18.02A - IAP)      Solutions\n\n60 Wed, Jan 16\n\nTriple integrals applications - moment of intertia; gravitational attraction.\nApplications, continued. Change of variable in triple integrals and Jacobian determinants.\n\nLecture #11 Notes\n\n61 Thurs, Jan 17 Exam 5 covering vector fields, curl and divergence of a vector field; integration along curves, line integrals, Green's Theorem; triple integrals in Cartesian, cylindrical, and spherical coordinates; applications of integration (area, volume, mass, average value, weighted averages, centroids, center of mass, moment of inertia, etc.).\n\nPset 16: Parameterized surfaces, surface area, surface integrals and their applications, flux of a vector field through a surface, Divergence Theorem.\n\nNotes V7 (Laplace's Equation and Harmonic Functions)\n15.5 (Surface Integrals)\nNotes V9 (Surface Integrals)\nRW-Supplement on surface integrals\nNotes V10 (The Divergence Theorem)\n\nProblem Set #16 (due Tues, Jan 29)\n\n62 Tues, Jan 22 Parameterization of surfaces; surface integrals; flux of a vector field through a surface.\nSupplement on surface integrals\n\nLecture #13 Notes\n\n63 Wed, Jan 23 Surface integrals, continued; Divergence Theorem.\n64 Thurs, Jan 24 Applications and interpretations of the Divergence Theorem. Stokes' Theorem.\n\nLecture #14 Notes\n\nPset 17: Divergence Theorem, Stokes' Theorem, applications to physics.\n\nNotes V10 (The Divergence Theorem)\nNotes V13 (Stokes' Theorem)\nNotes V14 (Some Topological Questions)\nNotes V15 (Relations to Physics)\nRW-Orthogonal Curvilinear Coordinates - Div, grad, curl, and Laplacian\n\nProblem Set #17 (due Thurs, Jan 31)\n\n65 Mon, Jan 28 More Stokes' Theorem.\n66 Tues, Jan 29 Applications and interpretations of Stokes' Theorem.\n67 Wed, Jan 30 Div, grad, curl, and Laplacian in curvilinear coordinates\n68 Thurs, Jan 31 Generalized Stokes' Theorem in terms of forms; Final Exam review.\n\n Practice exams from mainstream 18.02: Practice Final Exam A Solutions to Practice Final Exam A Practice Final Exam B Solutions to Practice Final Exam B\n\n(Some topics on these practice exams might not appear on Friday's exam, but they are a reasonable approximation.)\n\nFri, Feb 1 Final Exam - Friday, February 1 in 16-160 from 9:00am to 12:00pm\n\nReturn to main Math 18.01A-02A Concourse page" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.785847,"math_prob":0.8485129,"size":12973,"snap":"2019-13-2019-22","text_gpt3_token_len":3313,"char_repetition_ratio":0.14604056,"word_repetition_ratio":0.04703367,"special_character_ratio":0.2606182,"punctuation_ratio":0.22181222,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.982983,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-05-21T23:46:34Z\",\"WARC-Record-ID\":\"<urn:uuid:af315ab9-f332-4dab-a233-3395c4bff411>\",\"Content-Length\":\"36601\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:5f598958-daf8-4b73-ba44-011c1ebfc5b2>\",\"WARC-Concurrent-To\":\"<urn:uuid:4923d596-4486-4dcc-b7a2-360716331c68>\",\"WARC-IP-Address\":\"143.95.79.223\",\"WARC-Target-URI\":\"http://math.rwinters.com/18012A/calendar.htm\",\"WARC-Payload-Digest\":\"sha1:3JTCA3PBOAPAHYTZLA7QMVRRLFUWSQYC\",\"WARC-Block-Digest\":\"sha1:T4F6LY5XTZYZEQ2NC6BYSN2Y3H3XKMVN\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-22/CC-MAIN-2019-22_segments_1558232256586.62_warc_CC-MAIN-20190521222812-20190522004812-00462.warc.gz\"}"}
https://artofproblemsolving.com/wiki/index.php/1989_USAMO_Problems/Problem_5
[ "# 1989 USAMO Problems/Problem 5\n\n## Problem\n\nLet", null, "$u$ and", null, "$v$ be real numbers such that", null, "$$(u + u^2 + u^3 + \\cdots + u^8) + 10u^9 = (v + v^2 + v^3 + \\cdots + v^{10}) + 10v^{11} = 8.$$ Determine, with proof, which of the two numbers,", null, "$u$ or", null, "$v$, is larger.\n\n## Solution\n\nThe answer is", null, "$v$.\n\nWe define real functions", null, "$U$ and", null, "$V$ as follows:", null, "\\begin{align*} U(x) &= (x+x^2 + \\dotsb + x^8) + 10x^9 = \\frac{x^{10}-x}{x-1} + 9x^9 \\\\ V(x) &= (x+x^2 + \\dotsb + x^{10}) + 10x^{11} = \\frac{x^{12}-x}{x-1} + 9x^{11} . \\end{align*} We wish to show that if", null, "$U(u)=V(v)=8$, then", null, "$u .\n\nWe first note that when", null, "$x \\le 0$,", null, "$x^{12}-x \\ge 0$,", null, "$x-1 < 0$, and", null, "$9x^9 \\le 0$, so", null, "$$U(x) = \\frac{x^{10}-x}{x-1} + 9x^9 \\le 0 < 8 .$$ Similarly,", null, "$V(x) \\le 0 < 8$.\n\nWe also note that if", null, "$x \\ge 9/10$, then", null, "\\begin{align*} U(x) &= \\frac{x-x^{10}}{1-x} + 9x^9 \\ge \\frac{9/10 - 9^9/10^9}{1/10} + 9 \\cdot \\frac{9^{9}}{10^9} \\\\ &= 9 - 10 \\cdot \\frac{9^9}{10^9} + 9 \\cdot \\frac{9^9}{10^9} = 9 - \\frac{9^9}{10^9} > 8. \\end{align*} Similarly", null, "$V(x) > 8$. It then follows that", null, "$u, v \\in (0,9/10)$.\n\nNow, for all", null, "$x \\in (0,9/10)$,", null, "\\begin{align*} V(x) &= U(x) + V(x)-U(x) = U(x) + 10x^{11}+x^{10} -9x^9 \\\\ &= U(x) + x^9 (10x -9) (x+1) < U(x) . \\end{align*} Since", null, "$V$ and", null, "$U$ are both strictly increasing functions over the nonnegative reals, it then follows that", null, "$$V(u) < U(u) = 8 = V(v),$$ so", null, "$u, as desired.", null, "$\\blacksquare$\n\nThe problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.", null, "" ]
[ null, "https://latex.artofproblemsolving.com/9/a/d/9ad99798ec4c38e165cf517cb9e02b1c9e824103.png ", null, "https://latex.artofproblemsolving.com/a/9/f/a9f23bf124b6b2b2a993eb313c72e678664ac74a.png ", null, "https://latex.artofproblemsolving.com/7/4/7/747d227c5c93ab38b45ffe98794d68ac188986dd.png ", null, "https://latex.artofproblemsolving.com/9/a/d/9ad99798ec4c38e165cf517cb9e02b1c9e824103.png ", null, "https://latex.artofproblemsolving.com/a/9/f/a9f23bf124b6b2b2a993eb313c72e678664ac74a.png ", null, "https://latex.artofproblemsolving.com/a/9/f/a9f23bf124b6b2b2a993eb313c72e678664ac74a.png ", null, "https://latex.artofproblemsolving.com/e/2/b/e2bbebb3bd73f1ae5c64098ab0244f739abf7ca4.png ", null, "https://latex.artofproblemsolving.com/1/2/d/12d58aa29201da09d8e620f8698e3a37547f6b4a.png ", null, "https://latex.artofproblemsolving.com/1/f/5/1f5ec8e2b4de4d798c17a6493147af0a3b272f47.png ", null, "https://latex.artofproblemsolving.com/7/0/7/7074ae0a95013a4f6045ac1b928149f0110af38e.png ", null, "https://latex.artofproblemsolving.com/e/d/7/ed7ffe0563c6df8b378ba45bf11c11e0c3f79c42.png ", null, "https://latex.artofproblemsolving.com/1/b/6/1b667f99b88cc4dd636e45b0cdf1bf965992738a.png ", null, "https://latex.artofproblemsolving.com/c/c/e/cce24baa4db0ce59b69d97c7576c0120f35ad1af.png ", null, "https://latex.artofproblemsolving.com/1/4/d/14dd5bcd5d074df8011693f56cd0faa1362fe9bd.png ", null, "https://latex.artofproblemsolving.com/4/3/0/43018098f9a03499b21d8adcc101ba68e7dbf3bc.png ", null, "https://latex.artofproblemsolving.com/a/1/b/a1b8d3aedf346b5aa699546e25156e20d990103d.png ", null, "https://latex.artofproblemsolving.com/6/4/4/6445c800f83d07dc795bce8f22b5a0970f2b8829.png ", null, "https://latex.artofproblemsolving.com/c/d/e/cdef99f026ca46b44a997cf5f8d85076428f2118.png ", null, "https://latex.artofproblemsolving.com/7/b/8/7b801995147880225d6c060cc681c033d06a980b.png ", null, "https://latex.artofproblemsolving.com/a/f/1/af1fdd1c9c151d28f320d685ba8e804116434177.png ", null, "https://latex.artofproblemsolving.com/e/3/7/e375fcb7506e388abd2d43bbe2e5720165362463.png ", null, "https://latex.artofproblemsolving.com/f/2/8/f2814c6f6ef5bcdca44e299fbe3286f96eb48a6a.png ", null, "https://latex.artofproblemsolving.com/7/b/0/7b0965a08065dd3d4b7c4e1a8589d1da595cd56c.png ", null, "https://latex.artofproblemsolving.com/1/2/d/12d58aa29201da09d8e620f8698e3a37547f6b4a.png ", null, "https://latex.artofproblemsolving.com/e/2/b/e2bbebb3bd73f1ae5c64098ab0244f739abf7ca4.png ", null, "https://latex.artofproblemsolving.com/d/d/e/ddeb36defeb65d2a05aa127bdc978a2ec1a4ef25.png ", null, "https://latex.artofproblemsolving.com/9/a/c/9ac520c83016d5022c055f0fe3089af59adba0cd.png ", null, "https://latex.artofproblemsolving.com/3/b/b/3bbb9e25e5be095e317771a9c5d00877ee9c8012.png ", null, "https://wiki-images.artofproblemsolving.com//8/8b/AMC_logo.png", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.8400274,"math_prob":1.0000091,"size":749,"snap":"2023-40-2023-50","text_gpt3_token_len":191,"char_repetition_ratio":0.12885906,"word_repetition_ratio":0.0,"special_character_ratio":0.2563418,"punctuation_ratio":0.16438356,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":1.0000093,"pos_list":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58],"im_url_duplicate_count":[null,null,null,null,null,10,null,null,null,null,null,null,null,null,null,null,null,10,null,10,null,10,null,null,null,10,null,null,null,10,null,10,null,10,null,10,null,10,null,10,null,10,null,10,null,10,null,null,null,null,null,10,null,10,null,null,null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-09-22T22:01:48Z\",\"WARC-Record-ID\":\"<urn:uuid:143c57ee-d112-43db-8f5e-4d324f843da0>\",\"Content-Length\":\"39676\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:2cda4c5b-9298-4dd7-9c4d-d4306c1675b4>\",\"WARC-Concurrent-To\":\"<urn:uuid:6430b625-92d2-4649-b99a-2a08d6b12755>\",\"WARC-IP-Address\":\"104.26.11.229\",\"WARC-Target-URI\":\"https://artofproblemsolving.com/wiki/index.php/1989_USAMO_Problems/Problem_5\",\"WARC-Payload-Digest\":\"sha1:4O4GWJFPWEGQDXQTPYQMAP632MC64RCF\",\"WARC-Block-Digest\":\"sha1:P54VQASDP5532BNBVC36DHKZBLDLQGNK\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-40/CC-MAIN-2023-40_segments_1695233506423.70_warc_CC-MAIN-20230922202444-20230922232444-00161.warc.gz\"}"}
https://www.neetprep.com/question/69463-following-data-ofH-following-reactionsCsOCOgHkJCsHOCOgHgHkJWhat-mole-composition-mixture-steam-oxygen-passedover-coke--K-keeping-temperature-constant------------/54-Chemistry--Thermodynamics/650-Thermodynamics
[ "From the following data of $∆H$, of the following reactions,\n\nWhat is the mole composition of the mixture of steam and oxygen on being passed over coke at 1273 K, keeping temperature constant.\n\n1. 0.5 : 1\n\n2. 0.6 : 1\n\n3. 0.8 : 1\n\n4. 1 : 1\n\nConcept Questions :-\n\nEnthalpy and It's Type\nHigh Yielding Test Series + Question Bank - NEET 2020\n\nDifficulty Level:\n\nState which of the following statements is true ?\n\n1. First law of thermodynamics is not adequate in predicting the direction of the process.\n\n2. In an exothermic reaction, the total enthalpy of the products is greater than that of reactants.\n\n3. The standard enthalpy of diamond is zero at 298 K and 1 atm pressure.\n\n4. It is possible to calculate the value of $∆H$ for the reaction ${H}_{2}\\left(g\\right)+B{r}_{2}\\left(l\\right)\\to 2HBr\\left(g\\right)$ from the bond enthalpy data.\n\nConcept Questions :-\n\nFirst Law of Thermodynamics\nHigh Yielding Test Series + Question Bank - NEET 2020\n\nDifficulty Level:\n\nIf $∆H$ of a reaction is 100 kJ mol-1, then the activation energy for forward reaction must be-\n\n1. Greater than 100 kJ mol-1\n\n2. Less than 100 kJ mol-1\n\n3. Equal to 100 kJ mol-1\n\n4. None is correct\n\nConcept Questions :-\n\nEnthalpy and It's Type\nHigh Yielding Test Series + Question Bank - NEET 2020\n\nDifficulty Level:\n\nThe intermediate SiH2 is formed in the thermal decomposition of silicon hydrides. Calculate $∆{H}_{f}^{\\circ }$ of SiH2 given the following reactions\n\n1. 353 kJ/mol\n\n2. 321 kJ/mol\n\n3. 198 kJ/mol\n\n4. 274 kJ/mol\n\nConcept Questions :-\n\nThermochemistry\nHigh Yielding Test Series + Question Bank - NEET 2020\n\nDifficulty Level:\n\nA certain vessel X has water and nitrogen gas at a total pressure of 2 atm. and 300 K. All the contents of the vessel are transferred to another vessel Y having half the capacity of the vessel X. The pressiure of N2 in this vessel was 3.8 atm. at 300 K. The vessel Y is heated to 320 K and the total pressure observed was 4.32 atm. Calculate the enthalpy of vapourisation of water assuming it to be independent of temperature. Also assume the volume occupied by the gases in a vessel is equal to the volume of the vessel.\n\n1. 39.637 kJ mol-1\n\n2. 19.531 kJ mol-1\n\n3. 396.37 kJ mol-1\n\n4. 3.9127 kJ mol-1\n\nConcept Questions :-\n\nEnthalpy and It's Type\nHigh Yielding Test Series + Question Bank - NEET 2020\n\nDifficulty Level:\n\nFor a reaction,  is given by the equation  in the temperature range 300-600 K. The enthalpy of the reaction at 300 K -s -25.0 KJ. Calculate the enthalpy of the reaction at 450 K.\n\nAlso\n\n1. -10.12 kJ\n\n2. -28.32 kJ\n\n3. -18.72 kJ\n\n4. -8.21 kJ\n\nConcept Questions :-\n\nEnthalpy and It's Type\nHigh Yielding Test Series + Question Bank - NEET 2020\n\nDifficulty Level:\n\nThe heat of combustion of ethylene at ${17}^{\\circ }C$ and at constant volume is -332.19 kcals. What is the value at constant pressure, given that water is in liquid state ?\n\n1. -131.25 k cals\n\n2. -412.23 k cals\n\n3. -534.12 k cals\n\n4. -333.35 k cals\n\nConcept Questions :-\n\nEnthalpy and It's Type\nHigh Yielding Test Series + Question Bank - NEET 2020\n\nDifficulty Level:\n\nThe enthalpies of the following reactions are shown alongwith.\n\nCalculate the O-H bond energies for the hydroxyl radical.\n\n1. 223.18 kJ mol-1\n\n2. 423.38 kJ mol-1\n\n3. 513.28 kJ mol-1\n\n4. 113.38 kJ mol-1\n\nConcept Questions :-\n\nThermochemistry\nHigh Yielding Test Series + Question Bank - NEET 2020\n\nDifficulty Level:\n\nThe bond dissociation enthalpy of gaseous H2, Cl2 and HCl are 435, 243 and 431 kJ mol-1, respectively. Calculate the enthalpy of formation of HCl gas.\n\n1. -92 kJ mol-1\n\n2. -82 kJ mol-1\n\n3. -21 kJ mol-1\n\n4. -55 kJ mol-1\n\nConcept Questions :-\n\nEnthalpy and It's Type\nHigh Yielding Test Series + Question Bank - NEET 2020\n\nDifficulty Level:\n\nThe standard enthalpy of combustion at ${25}^{\\circ }C$ of hydrogen, cyclohexene (C6H10) and cyclohexane (C6H12) are -241, -3800 and -3920 kJ mol-1, respectively. Calculate the standard enthalpy of hydrogenation of cyclohexene.\n\n1. -131 kJ mol-1\n\n2. -155 kJ mol-1\n\n3. -167 kJ mol-1\n\n4. -121 kJ mol-1\n\nConcept Questions :-\n\nThermochemistry" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.8003565,"math_prob":0.96518546,"size":2961,"snap":"2020-24-2020-29","text_gpt3_token_len":936,"char_repetition_ratio":0.1795739,"word_repetition_ratio":0.011090573,"special_character_ratio":0.33198243,"punctuation_ratio":0.16595745,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99273187,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-05-25T07:01:05Z\",\"WARC-Record-ID\":\"<urn:uuid:c600bdf2-a75a-475e-9069-863bafb7790c>\",\"Content-Length\":\"457127\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:b5491998-e57f-44a6-af53-dd61232a9654>\",\"WARC-Concurrent-To\":\"<urn:uuid:9ed038b4-a817-486f-b161-1639973562d0>\",\"WARC-IP-Address\":\"13.235.211.187\",\"WARC-Target-URI\":\"https://www.neetprep.com/question/69463-following-data-ofH-following-reactionsCsOCOgHkJCsHOCOgHgHkJWhat-mole-composition-mixture-steam-oxygen-passedover-coke--K-keeping-temperature-constant------------/54-Chemistry--Thermodynamics/650-Thermodynamics\",\"WARC-Payload-Digest\":\"sha1:APSOT6OZYAHITD3WJEOB2LARM5Q3HBOC\",\"WARC-Block-Digest\":\"sha1:IXC3USTEGRIOBUEQ6FQQRZ6H63432DOB\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-24/CC-MAIN-2020-24_segments_1590347388012.14_warc_CC-MAIN-20200525063708-20200525093708-00475.warc.gz\"}"}
http://dannevang.net/wp-content/uploads/2020/boom-boom-mxpkejf/page.php?110780=6th-grade-math-word-problems
[ "", null, "", null, "## 6th grade math word problems\n\nR.15 Ratios and rates: word problems. 0 Time elapsed Time. share to google . Some of the worksheets for this concept are Word problem practice workbook, Decimals work, Multiplying decimals word problems, Fraction and decimal word problems no problem, Grade 5 decimals word problems, 8 fractions, 501 math word problems, Exercise work. Our team Don't Pass on to third parties any identifiable information about mathskills4kids.com users. 6th Grade Math Common Core Math Task Cards include SKILLS PRACTICE and real-world WORD PROBLEMSWhat is Included:This resource includes 9 sets (360 task cards) of 6th Grade Common Core skills practice and real-world word problems, student answer sheets, and answer keys. These sixth grade math worksheets cover most of the core math topics previous grades, including conversion worksheets, measurement worksheets, mean, median and range worksheets, number patterns, exponents and a variety of topics expressed as word problems. We feature a series of word problems from beginner to more advanced. Full curriculum of exercises and videos. 6th grade English Learner ... Thoughtfully paced outlines help when teaching children how to solve math word problems from simple equations to multi-step word problems requiring conversions. The word problems are solved with the help of tape diagrams, block diagrams or bar model (Singapore Math) Related Topics: More Math Word Problems Algebra Word Problems More Singapore Math Word Problems Example: These sixth grade math worksheets cover most of the core math topics previous grades, including conversion worksheets, measurement worksheets, mean, median and range worksheets, number patterns, exponents and a variety of topics expressed as word problems. Sixth Grade Math Word Problems Worksheets - Multi-Step Math Word Problems Worksheet #6 Teacher Resources made by Other Teachers: Differentiated Multi-Step Math Word Problems 5th Grade … PRINTABLE MATH WORKSHEETS FOR GRADE 6. Before working through the worksheets, discuss with your children any phrases or vocabulary that they may be unsure of. For example, the fraction word problems 6th grade students often have to tackle will challenge even the most competent adult. GRADE 6 MATH WORD PROBLEMS WITH ANSWERS. If your kids can vividly estimate reasonably, then there’ll be no doubt that their accuracy in math will increase, thus math experts. This totals over 900 pages and includes over 250 resource That is the reason that these worksheets are generally published out and distributed in … Free worksheets for ratio word problems Find here an unlimited supply of worksheets with simple word problems involving ratios, meant for 6th-8th grade math. Enjoy these math word problem packets. Math Word Problem Worksheets Read, explore, and solve over 1000 math word problems based on addition, subtraction, multiplication, division, fraction, decimal, ratio and more. Estimate recipes when cooking, baking, etc. If your child has entered the world of fraction word problems and is looking for a challenge, try to stump him with these problems… share to google . Solving math problems can intimidate sixth-graders but it shouldn't. ... Word problems on sum of the angles of a triangle is 180 degree. 6th Grade Math Skill Practice. and \"You have 15 yards of ribbon for your gift boxes. For the second answer, the solution is simpler: First, convert 20% to a decimal to get 0.20. So each box gets 0.75 yards of ribbon. (b) What is the ratio of the number of blue pencils to the total number of pencils? Some of the worksheets for this concept are Word problem practice workbook, Decimals work, Multiplying decimals word problems, Fraction and decimal word problems no problem, Grade 5 decimals word problems, 8 fractions, 501 math word problems, Exercise work. Worksheets > Math > Grade 5 > Word problems. Grade 6 Percents Word Problems Name: _____ Class: _____ Question 1 Father gave me some money. Printable Math Worksheets for Grade 6. Estimate the number of people you’ll invite for your coming event, depending on the budget available. Word Problem Worksheets. These word problems help children hone their reading and analytical skills; understand the real-life application of math operations and other math topics. Worksheet - 2. grade 6 math word problem worksheets with answers, Solving multi step word problems exercises with answers, Word problems with extra or missing information, Distance word problems with different directions. Learn sixth grade math for free—ratios, exponents, long division, negative numbers, geometry, statistics, and more. Free worksheets for ratio word problems Find here an unlimited supply of worksheets with simple word problems involving ratios, meant for 6th-8th grade math. The worksheets on this page combine the skills necessary to solve all four types of problems covered previously (addition word problems, subtraction word problems, multiplication word problems and division word problems) and they require students to determine which operation is appropriate for solving the each problem. Grade 6 Math Word Problems with Answers. Whether at home, in the market, on the street or among friends, our activities will always be surrounded around estimation. Great stuff and not boring! Estimate and know how to manage or spend your precious time. Share skill. Let's pick 6 as a possible greatest common multiple because it's the largest factor of 12 other than 12. Word problems are an important part of math practice at nearly every grade level. How much ribbon will each of your 20 gift boxes get? Worksheet - 4. Math problems for sixth-grade students should be read to them. I could choose between 15% of 1,500\\$ or 25% of 1,000\\$. 1 Solutions. Improve your math knowledge with free questions in \"Multi-step word problems\" and thousands of other math skills. On worksheet No. Some of the worksheets for this concept are Word problem practice workbook, Sample work from, Decimals practice booklet table of contents, Grade 6 math word problems with percents, Grade 3 mixed math problems and word problems work, Fractionwordproblems, Percent word problems, 501 math word problems. This zip file includes every resource I have created for sixth grade math in five complete year bundles: 70 assessments, 58 stick-n-solve foldables + 68 vocab diagrams, 67 math stations, 13 choice boards, and 6 bingo games for the whole year. In a significant way, our super amazing problem solving and estimation worksheets will help your young math learners to quickly understand the relevance of estimation skills in math concepts and real life. Similar: Proportions word problems - using decimals Ratio word problems You would set up the problem as follows: 0.20 x 50 marbles = 10 blue marbles. Six can go into 36 six times (6 x 6), 12 can go into 36 three times (12 x 3), and 18 can go into 36 twice (18 x 2), but 24 cannot. Middle school brings challenging math concepts. 6th Grade Math Skill Practice. Worksheet - 1. ... Word problems on sum of the angles of a triangle is 180 degree. ... Sixth grade . You're suppose to protect downloaded contents and take it for personal or classroom use.Special rule : Teachers can use our contents to teach in class. Students apply their knowledge of GCF and LCM to solve word problems. But before we begin solving these word problems, we need to; Finally, check the reasonableness of your answer by comparing it with the one you estimated above. Your email address and other information will NEVER be given or sold to a third party. In this lesson, we will learn how to solve percent word problems • using block diagrams or bar models or tape diagrams \", Other problems require only a basic knowledge of percentages, as well as how to convert percentages to decimals, such as: \"Jasmine has 50 marbles in a bag. Some of the worksheets displayed are 501 math word problems, Addition word problems, Proportions word problems, Math mammoth south african version grade 6 sample, Word problems involving discount, All decimal operations with word problems, Word problem practice workbook, Cc 1st grade word problems. What then are those peculiar strategies to consider when faced with situations of problem solving and estimation? Peter had 12 pencils. Using a few simple formulas and a bit of logic can help students quickly calculate answers to seemingly intractable problems. The worksheets provide a great and simple way to do quick formative assessments for an entire math class. https://www.thoughtco.com/6th-grade-math-word-problems-2312642 ZB9. It should be noted that, not only are these problem solving and estimation skills a key part in math concepts, but are equally an important approach to boast your kid’s mental math skills, logical and creative thinking abilities. What’s the other number I’m thinking of? The multiples of 6 are 6, 12, 18, 24, 30, and 36. I could choose between 15% of 1,500\\$ or 25% of 1,000\\$. Please click the following links to get math printable math worksheets for grade 6. The following are some examples of 6th Grade Math Word Problems that deals with ratio and proportions. Carefully read the entire problem, twice, in order to better understand its key words. How many meters will it travel in 12 minutes. Learn sixth grade math for free—ratios, exponents, long division, negative numbers, geometry, statistics, and more. On this PDF, your students will solve problems such as: \"Your brother traveled 117 miles in 2.25 hours to come home for school break. Integer Worksheets Unit Rate Word Problem Worksheet 1 (Integers) - This 13 problem worksheet features word problems where you will calculate the unit rate for everyday situations like … Full curriculum of exercises and videos. ThoughtCo uses cookies to provide you with a great user experience. ... Word problems : GCF and LCM 6.NS.B.4 - Find the greatest common factor of two whole numbers less than or equal to 100 and the least common multiple of two whole numbers less than or equal to 12. These worksheets provide students with real world word problems that students can solve with grade 5 math concepts. 7 of them were blue and the rest were red. (You stop at 36 because the problem says that this number is the least common multiple.) Printable 6th Grade Math Word Problem Worksheets – The 6th grade Math worksheet is among the most demanded worksheets among secondary school trainees since it helps them learn to be issue solvers. 6th Grade > CCSS 6th Grade Math > Word problems : ratios. You will now find grade leveled problems in sets and skill based word problems as well. ... Word problems : ratios. \", Print PDF Solutions: Worksheet No. 6th Grade Math Word Problems - Displaying top 8 worksheets found for this concept.. Enjoy. This is true as we keep on using the phrase “Let’s say…….”. Along with the word problems are mixed review materials. These worksheets are pdf files.. Moreover, with estimation skills, they can quickly determine whether their answer is within a reasonable range or not. The worksheets on this page combine the skills necessary to solve all four types of problems covered previously (addition word problems, subtraction word problems, multiplication word problems and division word problems) and they require students to determine which operation is appropriate for solving the each problem. He had 45 blue pencils. Given that estimation skill enhances kid’s mental math competency, your 6th grader will be able to arrive at reasonable or concrete answers within a twinkle of an eye. Math Word Problem Worksheets Read, explore, and solve over 1000 math word problems based on addition, subtraction, multiplication, division, fraction, decimal, ratio and more. Count on our printable 6th grade math worksheets with answer keys for a thorough practice. She teaches fifth-grade math and is the Kindergarten-6th Grade Math Department Chair at St. Anne’s-Belfield School in Charlottesville, Virginia. These word problems help children hone their reading and analytical skills; understand the real-life application of math operations and other math topics. Improve your math knowledge with free questions in \"Multiply and divide decimals: word problems\" and thousands of other math skills. So, problem solving and estimation skills will help your kids to easily; Our grade 6 math word problem worksheets with answers are a perfect example for kids to grab vital strategies, best for solving estimation word problems for 6th grade. Worksheet - 3. Word Problems 6th Grade Worksheet 6th Grade Math Worksheets with ... #196026 That is the reason that these worksheets are generally published out and distributed in … Deb Russell is a school principal and teacher with over 25 years of experience teaching mathematics at all levels. These word problems worksheets are appropriate for 4th Grade, 5th Grade, 6th Grade, and 7th Grade. Download these sixth grade word problems books. In level 1 , the problems ask for a specific ratio (such as, \" Noah drew 9 hearts, 6 stars, and 12 circles. He had 45 blue pencils. Isolate the variable by dividing \"r\" from each side of the equation to yield the revised formula, r = t ÷ d. Plug in the numbers to get: r = 117 ÷ 2.25, yielding r = 52 mph. Which amount did I choose? The answers for each worksheet are provided in the next slide right after each worksheet. For the first problem on this worksheet, you need to know that the factors of 12 are 1, 2, 3, 4, 6, and 12; and the multiples of 12 are 12, 24, 36. Most importantly, these problem solving and estimation skills will not only strengthen kid’s skills on basic math operations, but will prepare them for areas of advanced math, such as probability, statistics, geometry and algebra. Having understood the problem well, endeavor to estimate the answer before solving. A good book on problem solving with very varied word problems and strategies on how to solve problems. PRINTABLE MATH WORKSHEETS FOR GRADE 6. If the dentist fills any cavities, an additional charge of \\$100 per cavity gets added to the bill If the dentist finds v cavities, what will the cost of the visit be? The Word Problem Worksheets listed below will provide help for students who need to practice solving math word problems. 6th Grade Word Problems With Fractions And Decimal - Displaying top 8 worksheets found for this concept.. Grade 6 maths word problems with answers are presented. 20% of the marbles are blue. Math Worksheets with Word Problems for Every Grade and Skill Level On this page, you'll find worksheets for 1st to 6th Grade, Middle School, and High School. Each grade has weekly word problems for kids to solve. Worksheet - 4. (a ) What is the ratio of the number of blue pencils to the number of reds? See more ideas about word problem worksheets, math word problems, math words. Most at times, math word problems require a step-by-step solving procedure. To the Teacher These worksheets are the same ones found in the Chapter Resource Masters for Glencoe Math Connects, Course 1 .The answers to these worksheets are available at the end Showing top 8 worksheets in the category - 6th Grade Math Word Problems. the completed Word Problem Practice Workbookcan help you in reviewing for quizzes and tests. You simply use the basic formula: rate times the time equals distance, or r * t = d (where \"*\" is the symbol for multiplication.). Then, multiply the number of marbles (50) by 0.20. All these exercises have been created to generate interest and eagerness for more math word problems operations. Math worksheets: Proportions word problems. Sixth Grade Math Word Problems Worksheets - Multi-Step Math Word Problems Worksheet #6 Teacher Resources made by Other Teachers: Differentiated Multi-Step Math Word Problems 5th Grade … These books combine mixed work with a few word problems so kids are engaged. Problem-Solving: The Heart of Singapore Math When I was in school, my math classes were typical of what one would expect a “traditional” math … Improve your math knowledge with free questions in \"Ratios and rates: word problems\" and thousands of other math skills. Grade 6 Ratios Word Problems Name: _____ Class: _____ 1. Word Problems 6th Grade Worksheet 6th Grade Math Worksheets with ... #196026 If you're seeing this message, it means we're having trouble loading external resources on our website. Example 1: The price of a visit to the dentist is \\$50. Showing top 8 worksheets in the category - Grade 6 Math Word Problems. Therefore the answer is 18, as 18 is the largest common multiple that can go into 36. Grade 6 Algebra Word Problems How to write algebraic expressions from word problems? How many marbles are blue? Worksheets > Math > Grade 6 > Proportions > Proportions word problems. Count on our printable 6th grade math worksheets with answer keys for a thorough practice. Printable 6th Grade Math Word Problem Worksheets – The 6th grade Math worksheet is among the most demanded worksheets among secondary school trainees since it helps them learn to be issue solvers. Plan your 60-minute lesson in Math or Number Sense and Operations with helpful tips from Andrea Palmer. Primary Grade Challenge Math by Edward Zaccaro. Sixth Grade Math Worksheets for January : Math for Week of January 6: Math for Week of January 13: Math for Week of January 20: Math for Week of January 27: Free Math Worksheets; Addition : Division: Hundreds Charts : Multiplication : Word Problems : Subtraction : Place Value : Feedback or Contact Us; Have students work the problems, fill in their answers in the provided blank spaces, then explain how they would arrive at the solutions for questions where they are having difficulty. For the second problem, you don't even need to use a formula—just basic math and some common sense. 12 and my other number have a greatest common factor of 6 and their least common multiple is 36. Conversely, if you know the speed (rate) that a person is traveling as well as the distance, you can calculate the time he traveled. Sixth Grade Math Word Problems. Worksheet - 1. If the dentist fills any cavities, an additional charge of \\$100 per cavity gets added to the bill If the dentist finds v cavities, what will the cost of the visit be? Math Word Problems Made Easy: Grade 6 is designed to help you help students sharpen their problem-solving abilities (and share a chuckle or two along the way). Example 1: The price of a visit to the dentist is \\$50. This is mathskills4kids.coma premium math quality website with original Math activities and other contents for math practice.We provide 100% free Math ressources for kids from Preschool to Grade 6 to improve children skills. share to facebook share to twitter Questions. The problem involves simple division: 15 yards of ribbon divided by 20 boxes, can be shortened as 15 ÷ 20 = 0.75. Problem 1 : A train travels 18 km/hr. This is relevant to our multi steps word problems exercise. Grade 6 Math Word Problems with Answers. Rates & Ratios Word problems : ratios Write a ratio Word problems : unit rates Question 2 Mike had 180 blue and red pencils. To solve the first equation on the worksheet, use the basic formula: rate times the time = distance, or r * t = d. In this case, r = the unknown variable, t = 2.25 hours, and d = 117 miles. Worksheet - 2. This book is divided into three main sections to help you: The Fantastic Five-Step Process The first section describes a simple five-step problem … (A) 3600 (B) 4200 (C) 5100. Showing top 8 worksheets in the category - Grade 6 Math Word Problems. 2 Solution. Grade 6 math word problem worksheets with answers - Estimation word problems for 6th Grade are made of the following Math skills for kids: estimate to solve word problems, multi steps word problems, identifying word problems with extra or missing information, distance direction to starting point word problems, using logical reasoning to find the order, guest and check word problems. Worksheet - 3. A good book on problem solving with very varied word problems and strategies on how to solve problems. GRADE 6 MATH WORD PROBLEMS WITH ANSWERS. In sixth grade, completing word problems can help students apply the new math concepts they're learning, like proportions and statistics, to real-life situations. When solving, show a step-by-step calculation, making visible diverse operation signs where necessary. Rates & Ratios Word problems : ratios Write a ratio Word problems : unit rates What percentage of his pencils was red? Some of these problems are challenging and need more time to solve. Also detailed solutions and full explanations are included. By using ThoughtCo, you accept our, Quiz 8th-Graders With These Math Word Problems, Subtraction of Fractions With Common Denominators, Free Math Word Problem Worksheets for Fifth-Graders, Halloween Math Worksheets & Printable Activities, Thanksgiving Math Worksheets and Activities for Kids, Multiplication Word Problems With Printable Worksheets, Math Glossary: Mathematics Terms and Definitions, Find the Equivalent Fractions - Worksheets. The following math word problems are specific for children in the sixth grade and are divided into the main math categories: Number Concepts, Patterns and Algebra, Geometry and … Jul 31, 2017 - Explore BodyGlam HeadtoToe's board \"6th grade worksheets\" on Pinterest. This will prevent careless distractions and as well encourage you to accomplish your task. Problem 1 : A train travels 18 km/hr. Includes chapters on: Sequences, Problem-solving, Money, Percents, Algebraic Thinking, Negative Numbers, Logic, Ratios, Probability, Measurements, Fractions, Division. Includes chapters on: Sequences, Problem-solving, Money, Percents, Algebraic Thinking, Negative Numbers, Logic, Ratios, Probability, Measurements, Fractions, Division. The free, printable worksheets below involve problems such as these, as well as other important problems, such as determining the largest common factor, calculating percentages, and more. What percentage of his pencils was red? mathskills4kids.com uses cookies to ensure we give you the best experience on our website. Two numbers N and 16 have LCM = 48 and GCF = 8. ... First Math Word Problems 1st Grade Word Problems 2nd Grade Word Problems 3rd Grade Word Problems 4th Grade Word Problems 5th Grade Word Problems 6th Grade Word Problems. Not boring! \", Print Solutions PDF: Worksheet No. 4th grade share to facebook share to twitter Questions. ... Sixth grade . Each box gets the same amount of ribbon. At this point, they will be required to apply logical reasoning and estimation skills. Math Worksheets with Word Problems for Every Grade and Skill Level On this page, you'll find worksheets for 1st to 6th Grade, Middle School, and High School. Printable Math Worksheets for Grade 6. Sixth Grade Word Problems 6th Grade Math Worksheets With Answers September 20, 2020 by admin 21 Posts Related to Sixth Grade Word Problems 6th Grade Math … What’s the average speed that he was traveling?\" Below are three versions of our grade 6 math worksheet on solving proportions word problems. Which amount did I choose? Some of the worksheets displayed are Word problem practice workbook, Sample work from, Decimals practice booklet table of contents, Grade 6 math word problems with percents, Grade 3 mixed math problems and word problems work, Fractionwordproblems, Percent word problems, 501 math word problems. EdHelper's huge library of math worksheets, math puzzles, and word problems is a resource for teachers and parents. I would recommend these exercise for 5th grade, 6th grade, and 7th grade math students. if you want to stay within a budget. Each lesson plan includes an outline for introducing the lesson, teacher modeling, guided practice, and materials and preparation lists to support learning (A) 3600 (B) 4200 (C) 5100. Grade 6 Algebra Word Problems How to write algebraic expressions from word problems? On this page you will find a selection of Christmas math worksheets and regular math worksheets decorated with Christmas ornaments.. Some of the Christmas math worksheets may be fairly large due to the number of images included. The following are some examples of 6th Grade Math Word Problems that deals with percentages. 2, students solve problems that involve a little bit of logic and a knowledge of factors, such as: \"I’m thinking of two numbers, 12 and another number. Find out more about cookies. 6th Grade Word Problems With Fractions And Decimal - Displaying top 8 worksheets found for this concept.. 0 … © Copyright 2018mathskills4kids.com - All rights reserved. Percent Word Problems can be solved using different methods. EdHelper's huge library of math worksheets, math puzzles, and word problems is a resource for teachers and parents. Primary Grade Challenge Math by Edward Zaccaro. Some of the worksheets displayed are Word problem practice workbook, Sample work from, Decimals practice booklet table of contents, Grade 6 math word problems with percents, Grade 3 mixed math problems and word problems work, Fractionwordproblems, Percent word problems, 501 math word problems. Word Problem Assessment: Flying Through Fourth Grade In this assessment, your students will flex their math muscles as they use all four operations to solve a series of word problems. 6th Grade > CCSS 6th Grade Math > Word problems : GCF and LCM. Please click the following links to get math printable math worksheets for grade 6. Merry Christmas from Math-Drills.Com where our gift to you is a page of Christmas math worksheets! Explain to students that you can find the rate (or speed) that someone is traveling if you know the distance and time that she traveled. Grade 6 math word problem worksheets with answers - Estimation word problems for 6th Grade are made of the following Math skills for kids: estimate to solve word problems, multi steps word problems, identifying word problems with extra or missing information, distance direction to starting point word problems, using logical reasoning to find the order, guest and check word problems." ]
[ null, "http://www.dannevang.com/wp-content/uploads/2016/03/bord.jpg", null, "http://www.dannevang.com/wp-content/themes/Lamoon/images/placeholders/940x220.gif", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.91570765,"math_prob":0.8821669,"size":26449,"snap":"2021-04-2021-17","text_gpt3_token_len":5605,"char_repetition_ratio":0.2161089,"word_repetition_ratio":0.30139536,"special_character_ratio":0.21426141,"punctuation_ratio":0.13051434,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9946307,"pos_list":[0,1,2,3,4],"im_url_duplicate_count":[null,10,null,10,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-04-16T08:52:22Z\",\"WARC-Record-ID\":\"<urn:uuid:54402584-30eb-4cde-85d5-fb9a174211e1>\",\"Content-Length\":\"54212\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:86d1ba90-c11d-45ff-b971-f5d943f72095>\",\"WARC-Concurrent-To\":\"<urn:uuid:9b8ed49b-c938-4e10-93d6-1cd60f0a3ff6>\",\"WARC-IP-Address\":\"94.231.97.39\",\"WARC-Target-URI\":\"http://dannevang.net/wp-content/uploads/2020/boom-boom-mxpkejf/page.php?110780=6th-grade-math-word-problems\",\"WARC-Payload-Digest\":\"sha1:SABJNLB4CUQ2EUYG6OE5HCB6Q6NJEKT2\",\"WARC-Block-Digest\":\"sha1:HTZH6SSJ5LBGUYTHT3U36U2LUCFW3OIY\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-17/CC-MAIN-2021-17_segments_1618038088731.42_warc_CC-MAIN-20210416065116-20210416095116-00488.warc.gz\"}"}
https://beautyfll.com/is-1-7-oz-equal-50ml/
[ "# Is 1.7 oz equal 50ml?", null, "50 ml equals 1.69 ounces, or there are 1.69 ounces in 50 milliliters.\n\nAlso , How many cups does 4 oz equal? U.S. Standard to Metric\n\nSpoon & Cups Fluid Oz. Metric\n1/2 cup 4 ounces 120 mL\n3/4 cup 6 ounces 180 mL\n1 cup 8 ounces or 1/2 pint 240 mL\n1 1/2 cups 12 ounces 350 mL\n\nIs 1 oz the same as 30ml?\n\noz) use 1 fl. oz. = 30 mL to convert.\n\nAlso to know is, Is 50ml 1.5 oz? Liquid Volume Unit Conversion Table\n\nMilliliter or CC Ounce (Approx.) mL or CC (Approx.)\n15 mL 0.51 oz (1/2 oz) 15 mL\n30 mL 1 oz 30 mL\n50 mL 1.7 oz 48 mL\n60 mL 2 oz 60 mL\n\nIs 50 mg the same as 50ml?\n\nThere are no ml in 50 mg. ml is a measure of volume, 1/1000 of a liter. This is a finite amount of SPACE (Volume).\n\n## How much is 4 oz of meat?\n\n4 oz of raw, lean meat is about 3 ounces after cooking. 3 oz of grilled fish is the size of a checkbook. A medium apple, peach, or orange is about the size of a tennis ball.\n\n## How many cups does 10 ounces equal?\n\n10 oz = 1.25 cups\n\nThus, you can take 12.5 percent of 10 oz to get the same answer.\n\n## How many cups is 10 and 3/4 oz?\n\noz: [US customary cups] = [10 3/4] / 8 = 1.344.\n\n## How do you measure 1 oz?\n\nDetermining How Much Is an Ounce\n\n1. 1 oz = 2 tablespoons.\n2. 8 fl oz = 1 cup.\n3. 32 ounces = 1 quart.\n4. 16 tablespoons = 1 cup.\n5. 1 gram = . 035 oz.\n6. 100 grams = 3.5 oz.\n\n## Does 2 tbsp equal 1 oz?\n\nHow Many Tablespoons are in a Fluid Ounce? There are 2 tablespoons in a fluid ounce, which is why we use this value in the formula above.\n\n## Which unit of measure is equivalent to 1 oz?\n\nDifferences between the U.S. and Imperial Systems\n\nUnit of Measurement Imperial System Metric Equivalent\n1 ounce 1 (fluid) oz. 28.41 mL\n1 gill 5 (fluid) oz. 142.07 mL\n1 cup Not commonly used\n1 pint 20 (fluid) oz. 568.26 mL\n\n## What is 500ml in ounces?\n\nConvert 500 Milliliters to Ounces\n\n500 Milliliters (ml) 17.637 Ounces (oz)\n1 ml = 0.035274 oz 1 oz = 28.350 ml\n\n## Is oz or mL bigger?\n\n1 Fluid ounce (oz) is equal to 29.5735296 milliliters (ml). … For example, to find out how many ml there are in 16 fluid ounces, multiply 29.5735296 by 16, that makes 473.176473 ml in 16 fluid ounces.\n\n## Is 40ml 2 oz?\n\nMilliliters to US Fluid Ounces table\n\nMilliliters US Fluid Ounces\n40 mL 1.35 us fl oz\n41 mL 1.39 us fl oz\n42 mL 1.42 us fl oz\n43 mL 1.45 us fl oz\n\n• 22 juil. 2018\n\n## Is 10mg the same as 10 ml?\n\nA Milliliter (mL) is a unit of measure for a very small amount of fluid. It means that for every 1 milliliter of a substance , there are 10 milligrams of something else in that milliliter.\n\nWhat percent is 10 mg ml?\n\n10 mg = 0.01 ml 210 mg = 0.21 ml 700 mg = 0.7 ml\n80 mg = 0.08 ml 280 mg = 0.28 ml 1400 mg = 1.4 ml\n\n• 27 mars 2020\n\n## Is 5mL the same as 5mg?\n\nIn respect to this, is 5ml the same as 5mg? mL is a measurement of volume, while mg is a measurement of mass. For instance, if you have a solution that contains 10mg of medication in 5mL and you want to give 5mg of medication, then “give over have” or 5/10 or one half, so half of 5mL is 2.5 mL.\n\n## How much is a milligram of liquid?\n\nOne milliliter (British spelling: millilitre) (ml) is 1/1000 of a liter and is a unit of volume. 1 milligram (mg) is 1/1000 of a gram and is a unit of mass/weight.\n\nWhat is 10 mg converted to ML?\n\n10 mg = 0.01 ml 210 mg = 0.21 ml 700 mg = 0.7 ml\n20 mg = 0.02 ml 220 mg = 0.22 ml 800 mg = 0.8 ml\n\n• 16 mars 2020\n\n## How can I measure 3 ounces of meat without a scale?\n\nYou can also use your hand to measure food portions of meat and produce. For example, a single 3-ounce serving of chicken, beef, or fish is roughly the size of your palm. A 1-cup serving of fruit or vegetables is roughly the size of your closed fist. A single serving of cheese is about the size of your thumb.\n\n## How much is 3 oz of meat in cups?\n\n3 oz to cups = 0.375 cup in 3 oz. 4 oz to cups = 0.5 cup in 4 oz.\n\n## How much is 3 oz of meat?\n\nTwo servings, or 6 oz., of lean meat (poultry, fish, shellfish, beef) should be a part of a daily diet. Measure the right amount with your palm. One palm size portion equals 3 oz., or one serving.\n\n## How do you measure fl oz?\n\nDetermining How Much Is an Ounce\n\n1. 1 oz = 2 tablespoons.\n2. 8 fl oz = 1 cup.\n3. 32 ounces = 1 quart.\n4. 16 tablespoons = 1 cup.\n5. 1 gram = . 035 oz.\n6. 100 grams = 3.5 oz.\n\n## How many cups is 8 fl ounces?\n\n8 oz equals 1.00 cups. 1 ounce is equivalent to 0.125 cups, and there are 1.00 cups in 8 ounces.\n\n## Is 10 ounces bigger than 2 cups?\n\nFor basic culinary purposes, a cup is 8 fluid ounces, so 10 ounces would be one and one quarter cups.\n\nWe will be happy to hear your thoughts", null, "Enable registration in settings - general" ]
[ null, "https://beautyfll.com/wp-content/themes/rehub-theme/images/default/noimage_450_350.png", null, "https://beautyfll.com/wp-content/uploads/2021/02/Logo-beautyfll.png", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.8377559,"math_prob":0.99367535,"size":4467,"snap":"2022-27-2022-33","text_gpt3_token_len":1575,"char_repetition_ratio":0.124355815,"word_repetition_ratio":0.12058212,"special_character_ratio":0.38459817,"punctuation_ratio":0.14120781,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99161637,"pos_list":[0,1,2,3,4],"im_url_duplicate_count":[null,null,null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-07-02T14:09:06Z\",\"WARC-Record-ID\":\"<urn:uuid:96df4942-3eb7-4dd6-ba52-3bd11f6a049e>\",\"Content-Length\":\"105100\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:e8c6e66f-78c3-4dd8-8d98-dd5728b0def1>\",\"WARC-Concurrent-To\":\"<urn:uuid:3eade23f-7406-4e16-9f6d-b44de93d2d7b>\",\"WARC-IP-Address\":\"79.137.36.139\",\"WARC-Target-URI\":\"https://beautyfll.com/is-1-7-oz-equal-50ml/\",\"WARC-Payload-Digest\":\"sha1:EPKYD3BTNQ3WOT7EMBA6INEKU6I55NXW\",\"WARC-Block-Digest\":\"sha1:QQTH4XYOHYOIT6YT2NVLT2OWQTCCHJRQ\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-27/CC-MAIN-2022-27_segments_1656104141372.60_warc_CC-MAIN-20220702131941-20220702161941-00269.warc.gz\"}"}
https://dubbsong.github.io/dev/2019/10/02/codewars-6kyu-10/
[ "# likes.js\n\n### Problem\n\n• You probably know the ‘like’ system from Facebook.\n• Facebook의 ‘like’ 시스템을 알고 있을 것이다.\n• We want to create the text that should be displayed next to such an item.\n• 옆에 표시할 텍스트를 작성하려고 한다.\n• Implement a function, which must take in input array, containing the names of people who like an item.\n• like를 누른 사람들의 이름을 포함하는 배열을 가져오는 함수를 작성한다.\n• For 4 more names, the number in ‘and 2 others’ simply increases.\n• 이름이 4개 이상인 경우, ‘and 2 others’와 같이 단순히 증가시킨다.\n\n#### For example\n\nlikes([]) => `no one likes this`\n\nlikes([‘Sam’]) => `Sam likes this`\n\nlikes([‘Ralph’, ‘Lauren’]) => `Ralph and Lauren like this`\n\nlikes([‘Ralph’, ‘Lauren’, ‘Leo’]) => `Ralph, Lauren and Leo like this`\n\nlikes([‘Sam’, ‘Ralph’, ‘Lauren’, ‘Leo’]) => `Sam, Ralph and 2 others like this`\n\n### Solution 01\n\n``````function likes(arr) {\nif (arr.length === 0) return 'no one likes this';\nif (arr.length === 1) return arr + ' likes this';\nif (arr.length === 2) return arr + ' and ' + arr + ' like this';\nif (arr.length === 3) return arr + ', ' + arr + ' and ' + arr + ' like this';\nreturn arr + ', ' + arr + ' and ' + (arr.length - 2) + ' others like this';\n}\n\nlikes([]); // no one likes this\nlikes(['Sam']); // Sam likes this\nlikes(['Ralph', 'Lauren']); // Ralph and Lauren like this\nlikes(['Ralph', 'Lauren', 'Leo']); // Ralph, Lauren and Leo like this\nlikes(['Sam', 'Ralph', 'Lauren', 'Leo']); // Sam, Ralph and 2 others like this\n``````\n\n### Solution 02\n\n``````function likes(arr) {\nswitch(arr.length) {\ncase 0:\nreturn 'no one likes this';\ncase 1:\nreturn `\\${arr} likes this`;\ncase 2:\nreturn `\\${arr} and \\${arr} like this`;\ncase 3:\nreturn `\\${arr}, \\${arr} and \\${arr} like this`;\ndefault:\nreturn `\\${arr}, \\${arr} and \\${arr.length - 2} others like this`;\n}\n}\n\nlikes([]); // no one likes this\nlikes(['Sam']); // Sam likes this\nlikes(['Ralph', 'Lauren']); // Ralph and Lauren like this\nlikes(['Ralph', 'Lauren', 'Leo']); // Ralph, Lauren and Leo like this\nlikes(['Sam', 'Ralph', 'Lauren', 'Leo']); // Sam, Ralph and 2 others like this\n``````\n\n### Solution 03\n\n``````function likes(arr) {\nreturn {\n0: 'no one likes this',\n1: `\\${arr} likes this`,\n2: `\\${arr} and \\${arr} like this`,\n3: `\\${arr}, \\${arr} and \\${arr} like this`,\n4: `\\${arr}, \\${arr} and \\${arr.length - 2} others like this`,\n}[Math.min(4, arr.length)];\n}\n\nlikes([]); // no one likes this\nlikes(['Sam']); // Sam likes this\nlikes(['Ralph', 'Lauren']); // Ralph and Lauren like this\nlikes(['Ralph', 'Lauren', 'Leo']); // Ralph, Lauren and Leo like this\nlikes(['Sam', 'Ralph', 'Lauren', 'Leo']); // Sam, Ralph and 2 others like this\n``````\n\n` 오 많 배`" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.5680997,"math_prob":0.955218,"size":2567,"snap":"2020-45-2020-50","text_gpt3_token_len":876,"char_repetition_ratio":0.22863832,"word_repetition_ratio":0.36214954,"special_character_ratio":0.39267626,"punctuation_ratio":0.19144982,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9833013,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-10-22T03:44:21Z\",\"WARC-Record-ID\":\"<urn:uuid:58c754cd-03b6-42ab-847a-e52382e82c95>\",\"Content-Length\":\"35769\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:f71ae993-b46e-4b90-bb75-776b4ee396bb>\",\"WARC-Concurrent-To\":\"<urn:uuid:40394aea-dcdd-48bc-b0cf-fab98afdc865>\",\"WARC-IP-Address\":\"185.199.109.153\",\"WARC-Target-URI\":\"https://dubbsong.github.io/dev/2019/10/02/codewars-6kyu-10/\",\"WARC-Payload-Digest\":\"sha1:PRSB5FFVWSI6L5VJ2S3L44ODGVUYGP4L\",\"WARC-Block-Digest\":\"sha1:V2HWNUTRZHXWUCFIPTFSZM62NOKGFAKN\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-45/CC-MAIN-2020-45_segments_1603107878879.33_warc_CC-MAIN-20201022024236-20201022054236-00227.warc.gz\"}"}
https://iccl.inf.tu-dresden.de/web/LATPub366
[ "# Pinpointing in the Description Logic EL\n\nFranz Baader, Rafael Peñaloza, Boontawee Suntisrivaraporn\nPinpointing in the Description Logic EL\nProceedings of the 30th German Conference on Artificial Intelligence (KI2007), volume 4667 of Lecture Notes in Artificial Intelligence, 52-67, 2007. Springer\n• KurzfassungAbstract\nAxiom pinpointing has been introduced in description logics (DLs) to help the user understand the reasons why consequences hold by computing minimal subsets of the knowledge base that have the consequence in question. Until now, the pinpointing approach has only been applied to the DL ALC and some of its extensions. This paper considers axiom pinpointing in the less expressive DL EL+, for which subsumption can be decided in polynomial time. More precisely, we consider an extension of the pinpointing problem where the knowledge base is divided into a static part, which is always present, and a refutable part, of which subsets are taken. We describe an extension of the subsumption algorithm for EL+ that can be used to compute all minimal subsets of (the refutable part of) a given TBox that imply a certain subsumption relationship. The worst-case complexity of this algorithm turns out to be exponential. This is not surprising since we can show that a given TBox may have exponentially many such minimal subsets. However, we can also show that the problem is not even output polynomial, i.e., unless P=NP, there cannot be an algorithm computing all such minimal sets that is polynomial in the size of its input and output. In addition, we show that finding out whether there is such a minimal subset within a given cardinality bound is an NP-complete problem. In contrast to these negative results, we also show that one such minimal subset can be computed in polynomial time. Finally, we provide some encouraging experimental results regarding the performance of a practical algorithm that computes one (small, but not necessarily minimal) subset that has a given subsumption relation as consequence.\n• Forschungsgruppe:Research Group: Automatentheorie\nThe final publication is available at Springer.\n@inproceedings{ BaaPenSun-KI-07,\ntitle = {Pinpointing in the Description Logic $\\mathcal{EL}$}," ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.88159955,"math_prob":0.9203517,"size":2926,"snap":"2022-05-2022-21","text_gpt3_token_len":687,"char_repetition_ratio":0.11156742,"word_repetition_ratio":0.12765957,"special_character_ratio":0.20813397,"punctuation_ratio":0.10788382,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.98170936,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-05-20T04:27:26Z\",\"WARC-Record-ID\":\"<urn:uuid:9ddc93d4-6523-44c6-bdda-d24d296ffe59>\",\"Content-Length\":\"38085\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:06a1b3f9-2e4b-4436-89d1-c8e4d4a19d25>\",\"WARC-Concurrent-To\":\"<urn:uuid:b34260bf-0d76-43d1-9869-10c3df10fe66>\",\"WARC-IP-Address\":\"141.76.16.67\",\"WARC-Target-URI\":\"https://iccl.inf.tu-dresden.de/web/LATPub366\",\"WARC-Payload-Digest\":\"sha1:3ZU4KEJ5LPKH7LLOTU4F62YG5G5DVH52\",\"WARC-Block-Digest\":\"sha1:VAWAF3L7NMJRR3YQAORQVYWP5VZYCKHL\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-21/CC-MAIN-2022-21_segments_1652662531352.50_warc_CC-MAIN-20220520030533-20220520060533-00589.warc.gz\"}"}
https://goprep.co/q23-the-differential-equation-which-represents-the-family-of-i-1nlo3s
[ "Q. 23\n\n# Mark the correct alternative in each of the following:The differential equation which represents the family of curves y = eCx isA. y1 = C2 yB. xy1 – ln y = 0C. x ln y = yy1D. y ln y = xy1\n\ny = eCx\n\nTaking log both sides we get,\n\nlog y = log eCx\n\nlog y = Cx log e log ax = x log a\n\nlog y = Cx --(1) log e = 1\n\nDifferentiate w.r.t x we get,", null, "Put value of C in (1) we get,", null, "", null, "Which is y ln y = xy1 = (D)\n\nRate this question :\n\nHow useful is this solution?\nWe strive to provide quality solutions. Please rate us to serve you better.\nRelated Videos", null, "", null, "Interactive Quiz on DIfferential Calculus50 mins", null, "", null, "Functional Equations - JEE with ease48 mins\nTry our Mini CourseMaster Important Topics in 7 DaysLearn from IITians, NITians, Doctors & Academic Experts\nDedicated counsellor for each student\n24X7 Doubt Resolution\nDaily Report Card\nDetailed Performance Evaluation", null, "view all courses", null, "" ]
[ null, "https://gradeup-question-images.grdp.co/liveData/PROJ32365/1559797512725274.png", null, "https://gradeup-question-images.grdp.co/liveData/PROJ32365/1559797513477560.png", null, "https://gradeup-question-images.grdp.co/liveData/PROJ32365/1559797514183544.png", null, "https://grdp.co/cdn-cgi/image/quality=90,fit=contain,width=350,f=auto/https://gs-post-images.grdp.co/2020/10/022186a09c6921f3f0da0b5e239e205d17cd077ef35f87398aef5bde9a634516poster-high-webp.png", null, "https://gs-post-images.grdp.co/2020/8/group-2x-img1598864374422-78.png-rs-high-webp.png", null, "https://grdp.co/cdn-cgi/image/quality=90,fit=contain,width=350,f=auto/https://gs-post-images.grdp.co/2020/10/4a9234fcadab3795f046a4663a99560b295e60494b8cfa70d2f2f9dde60e787dposter-high-webp.png", null, "https://gs-post-images.grdp.co/2020/8/group-2x-img1598864374422-78.png-rs-high-webp.png", null, "https://grdp.co/cdn-cgi/image/height=128,quality=80,f=auto/https://gs-post-images.grdp.co/2020/8/group-7-3x-img1597928525711-15.png-rs-high-webp.png", null, "https://gs-post-images.grdp.co/2020/8/group-img1597139979159-33.png-rs-high-webp.png", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.79035324,"math_prob":0.9824484,"size":1523,"snap":"2020-45-2020-50","text_gpt3_token_len":412,"char_repetition_ratio":0.16129032,"word_repetition_ratio":0.021505376,"special_character_ratio":0.24097176,"punctuation_ratio":0.08791209,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.952257,"pos_list":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18],"im_url_duplicate_count":[null,1,null,1,null,1,null,null,null,null,null,null,null,null,null,null,null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-10-28T09:09:18Z\",\"WARC-Record-ID\":\"<urn:uuid:5fdf11df-ba8a-43b5-b296-837d1d60bb84>\",\"Content-Length\":\"632703\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:5912b777-a1a9-4a00-a6c8-56c7ce403856>\",\"WARC-Concurrent-To\":\"<urn:uuid:6600d7fa-317d-4301-a103-d3b44d5512a9>\",\"WARC-IP-Address\":\"104.18.25.35\",\"WARC-Target-URI\":\"https://goprep.co/q23-the-differential-equation-which-represents-the-family-of-i-1nlo3s\",\"WARC-Payload-Digest\":\"sha1:L5WKU7XFCANYO5BBXE5F5RTSPE6KMMO3\",\"WARC-Block-Digest\":\"sha1:RPJORJWBQSFRZM6Z6JCVM5BP4CCTQVKE\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-45/CC-MAIN-2020-45_segments_1603107897022.61_warc_CC-MAIN-20201028073614-20201028103614-00239.warc.gz\"}"}
https://nanoscalereslett.springeropen.com/articles/10.1186/1556-276X-8-30
[ "# Displacing, squeezing, and time evolution of quantum states for nanoelectronic circuits\n\n## Abstract\n\nThe time behavior of DSN (displaced squeezed number state) for a two-dimensional electronic circuit composed of nanoscale elements is investigated using unitary transformation approach. The original Hamiltonian of the system is somewhat complicated. However, through unitary transformation, the Hamiltonian became very simple enough that we can easily treat it. By executing inverse transformation for the wave function obtained in the transformed system, we derived the exact wave function associated to the DSN in the original system. The time evolution of the DSN is described in detail, and its corresponding probability density is illustrated. We confirmed that the probability density oscillates with time like that of a classical state. There are two factors that drive the probability density to oscillate: One is the initial amplitude of complementary functions, and the other is the external power source. The oscillation associated with the initial amplitude gradually disappears with time due to the dissipation raised by resistances of the system. These analyses exactly coincide with those obtained from classical state. The characteristics of quantum fluctuations and uncertainty relations for charges and currents are also addressed.\n\n## Background\n\nThe technical range of nanoscale is 1 to 999 nm, but people often refer to nanosize when an element is smaller than about 100 nm, where quantum effects are dominant instead of classical ones. Nanophysics and nanoelectronics have been rapidly developed thanks to the advancement of relevant technologies such as crystal growth and lithography, which facilitate sophisticated experiments for nanosystems [1, 2]. A recent conspicuous trend in the community of electronic device is that the integrated circuits and components are miniaturized towards atomic-scale dimensions . We can confirm from many experiments and theories associated with nanoscale elements that the quantum effects become prominent when the transport dimension reaches a critical value which is the Fermi wavelength, while at the same situation, the classical theory for the motion of charges and currents is invalid. Not only quantum dot and quantum wire but also the quantum characteristics of electronic circuits involving nanoscale elements are important as a supporting theory for nanometer electronic technology and quantum information technology. For this reason, quantum effects in electronic circuits with nanoscale elements have been widely studied in recent years.\n\nThe simple quantum model of a lossless inductor-capacitor (LC) circuit have been suggested firstly by Louisell . Zhang et al. investigated the quantum properties of two-dimensional electronic circuits which have no power source . The quantum behavior of charges and currents for an LC circuit and a resistor-inductor-capacitor (RLC) linear circuit driven by a power source have been studied by several researchers. If a circuit contains resistance, the electronic energy of the system dissipates with time. In this case, the system is described by a time-dependent Hamiltonian. Another example of the systems described by time-dependent Hamiltonian is electronic circuits driven by time-varying power sources. The quantum problem of time-dependent Hamiltonian systems attracted great concern in the community of theoretical physics and chemistry for several decades [4, 6, 7].\n\nThe study of electronic characteristics of charge carriers in nanoelectronic circuits is basically pertained to a physical problem. There are plentiful reports associated with the physical properties of miniaturized two-loop (or two-dimensional) circuits and more high multi-loop circuits including their diverse variants. Various applications which use two-loop circuits include a switch-level resistor-capacitor (RC) model of an n-transistor (see Figure 3 of ), a design of a prototype of current-mode leapfrog ladder filters (Sect. 3 of ), and a port-Hamiltonian system , whereas higher loop circuits can be used as a transmission line model for multiwall carbon nanotube and a filter circuit for electronic signals (Sect. 5 of ).\n\nIn this paper, we derive quantum solutions of a two-dimensional circuit coupled via RL and investigate its displaced squeezed number state (DSN) . We suppose that the system is composed of nanoscale elements and driven by a time-varying power source. The unitary transformation method which is very useful when treating time-dependent Hamiltonian systems in cases like this will be used. We can obtain the wave functions of DSN by first applying the squeezing operator in those of the number state and then applying the unitary displacement operator. Under displaced quantum states of circuit electrodynamics, conducting charges (or currents) exhibit collective classical-like oscillation. The fluctuations and uncertainty relations for charges and currents will be evaluated in the DSN without approximation.\n\nDisplaced squeezed number states, which are the main topic in this work, belong to nonclassical states that have been objects of many investigations. The statistical properties of these states exhibit several pure quantum effects which have no classical analogues, including the interference in the phase space , the revival/collapse phenomenon , and sub-Poissonian statistics . The position representation of these states with overall phases is derived by Moller et al. for the simple harmonic oscillator by employing geometric operations in phase space . The effects of quantum interference between two distinct DSNs prepared to be out of phase with respect to each other are investigated by Faisal et. al., discussing various nonclassical properties in connection with quantum number distribution, purity, quadrature squeezing, W-function, etc. .\n\n## Methods and results\n\n### Simplification via unitary transformation\n\nLet us consider two loops of RLC circuit, whose elements are nanosized, that are coupled with each other via inductance and resistance as shown in Figure 1. Using Kirchhoff’s law, we obtain the classical equations of motion for charges of the system :\n\n$L 1 d 2 q 1 d t 2 + R 1 d q 1 dt + q 1 C 1 + L 0 d 2 q 1 d t 2 − d 2 q 2 d t 2 + R 0 d q 1 dt − d q 2 dt = E ( t ) ,$\n(1)\n$L 2 d 2 q 2 d t 2 + R 2 d q 2 dt + q 2 C 2 − L 0 d 2 q 1 d t 2 − d 2 q 2 d t 2 − R 0 d q 1 dt − d q 2 dt = 0 ,$\n(2)\n\nwhere q j (j=1,2; hereafter, this convention will be used for all j) are charges stored in the capacitances C j , respectively, and $E(t)$ is an arbitrary time-varying voltage source connected in loop 1. If we consider not only the existence of $E(t)$ but also the mixed appearance of q1 and q2 in these two equations, it may be not an easy task to treat the system directly. If the scale of resistances are sufficiently large, the system is described by an overdamped harmonic oscillator, whereas the system becomes an underdamped harmonic oscillator in the case of small resistances. In this paper, we consider only the underdamped case.\n\nFor convenience, we suppose that R0/L0=R1/L1=R2/L2β. Then, the classical Hamiltonian of the system can be written as\n\n$H = e − βt p 1 2 2 L 1 + p 2 2 2 L 2 − 1 2 ( k 1 p 1 − k 2 p 2 ) 2 + e βt q 1 2 2 C 1 + q 2 2 2 C 2 − E ( t ) q 1 ,$\n(3)\n\nwhere p j are canonical currents of the system, and k j =(1/L j )(1/L0+1/L1+1/L2)−1/2. From Hamilton’s equations, we can easily see that p j are given by\n\n$p 1 = e βt [( L 0 + L 1 ) q ̇ 1 − L 0 q ̇ 2 ],$\n(4)\n$p 2 = e βt [( L 0 + L 2 ) q ̇ 2 − L 0 q ̇ 1 ].$\n(5)\n\nIf we replace classical variables q j and p j in Equation 3 with their corresponding operators, $q ̂ j$ and $p ̂ j$, the classical Hamiltonian becomes quantum Hamiltonian:\n\n$Ĥ = e − βt p ̂ 1 2 2 L 1 + p ̂ 2 2 2 L 2 − 1 2 ( k 1 p ̂ 1 − k 2 p ̂ 2 ) 2 + e βt q ̂ 1 2 2 C 1 + q ̂ 2 2 2 C 2 − E ( t ) q ̂ 1 ,$\n(6)\n\nwhere $p ̂ j =−iℏ∂/∂ q j$. Now, we are going to transform $H ̂$ into a simple form using the unitary transformation method, developed in for a two-loop LC circuit, in order to simplify the problem. Let us first introduce a unitary operator\n\n$Û A = Û A 1 Û A 2 ,$\n(7)\n\nwhere\n\n$Û A 1 = exp i ℏ ln C 2 C 1 1 / 8 + i β 4 ℏ t ( p ̂ 1 q ̂ 1 + q ̂ 1 p ̂ 1 ) × exp i ℏ ln C 1 C 2 1 / 8 + i β 4 ℏ t ( p ̂ 2 q ̂ 2 + q ̂ 2 p ̂ 2 ) ,$\n(8)\n$Û A 2 = exp − iφ ℏ ( p ̂ 1 q ̂ 2 − p ̂ 2 q ̂ 1 ) ,$\n(9)\n\nwith\n\n$φ = 1 2 tan − 1 2 k 1 k 2 C 2 C 1 k 1 2 − 1 L 1 − C 1 C 2 k 2 2 − 1 L 2 − 1 .$\n(10)\n\nUsing Equation 7, we can transform the Hamiltonian such that\n\n$Ĥ A = Û A − 1 Ĥ Û A −iℏ Û A − 1 ∂ Û A ∂t .$\n(11)\n\nA straightforward algebra after inserting Equation 6 into the above equation gives\n\n$Ĥ A ( q ̂ 1 , p ̂ 1 , q ̂ 2 , p ̂ 2 ,t)= Ĥ A 1 ( q ̂ 1 , p ̂ 1 ,t)+ Ĥ A 2 ( q ̂ 2 , p ̂ 2 ,t),$\n(12)\n\nwhere\n\n$Ĥ Aj ( q ̂ j , p ̂ j , t ) = p ̂ j 2 2 μ j + β 4 ( q ̂ j p ̂ j + p ̂ j q ̂ j ) + 1 2 C 1 C 2 q ̂ j 2 − q ̂ j E ( t ) C 1 C 2 1 / 4 e βt / 2 cos φ − Π 2 δ j , 2 ,$\n(13)\n\nwith\n\n(14)\n(15)\n\nOne can see from Equation 13 that the coupled term involving $q ̂ 1 q ̂ 2$ in the original Hamiltonian is decoupled through this transformation. However, the Hamiltonian still contains linear terms that are expressed in terms of $q ̂ j E(t)$, which are hard to handle when developing a quantum theory of the system. To remove these terms, we introduce another unitary operator of the form\n\n$Û B = Û B 1 Û B 2 ,$\n(16)\n$Û B 1 = exp i ℏ [ p 1 p ( t ) q ̂ 1 + p 2 p ( t ) q ̂ 2 ] × exp − i ℏ [ q 1 p ( t ) p ̂ 1 + q 2 p ( t ) p ̂ 2 ] ,$\n(17)\n$Û B 2 =exp − iβ 4 ℏ ( μ 1 q ̂ 1 2 + μ 2 q ̂ 2 2 ) ,$\n(18)\n\nwhere q j p (t) and p j p (t) are classical particular solutions of the firstly transformed system described by $Ĥ A$ in the charge and the current spaces, respectively. From basic Hamiltonian dynamics with the use of Equation 12, we see that q j p (t) and p j p (t) satisfy the time-dependent classical equations that are given by\n\n$q ̈ jp (t)+ ω j 2 q jp (t)− E ( t ) μ j C 1 C 2 4 e βt / 2 cos φ − Π 2 δ j , 2 =0,$\n(19)\n$p ̈ jp (t)+ ω j 2 p jp (t)− E ̇ (t) C 1 C 2 4 e βt / 2 cos φ − Π 2 δ j , 2 =0,$\n(20)\n\nwhere\n\n$ω j = 1 μ j C 1 C 2 − β 2 4 1 / 2 .$\n(21)\n\nThen, the second transformation yields\n\n$Ĥ B ( q ̂ 1 , p ̂ 1 , q ̂ 2 , p ̂ 2 , t ) = Û B − 1 Ĥ A Û B − iℏ Û B − 1 ∂ Û B ∂t = Ĥ B 1 ( q ̂ 1 , p ̂ 1 , t ) + Ĥ B 2 ( q ̂ 2 , p ̂ 2 , t ) ,$\n(22)\n\nwhere\n\n$Ĥ Bj ( q ̂ j , p ̂ j ,t)= p ̂ j 2 2 μ j + 1 2 μ j ω j 2 q ̂ j 2 + L jp (t),$\n(23)\n\nwith\n\n$L jp (t)= 1 2 μ j q ̇ jp 2 (t)− 1 2 C 1 C 2 q jp 2 (t).$\n(24)\n\nThe finally transformed Hamiltonian, Equation 22, is very simple and no longer involves linear terms that contain $E(t)$. If we neglect $L jp (t)$, this is exactly the same as that of the two-dimensional simple harmonic oscillator of frequencies ω j . We will use this formula in order to develop DSN, which is a typical nonclassical quantum state.\n\nIf we regard that the transformed Hamiltonian is very simple, the quantum dynamics in the transformed system may be easily developed. Let us write the Schrödinger equations for elements of the transformed Hamiltonian as\n\n$iℏ ∂ ψ n j B ( q j , t ) ∂t = Ĥ Bj ψ n j B ( q j ,t),$\n(25)\n\nwhere $ψ n j B ( q j ,t)$ represent number state wave functions for each component of the decoupled systems described by $Ĥ Bj$.\n\nBy means of the usual annihilation operator,\n\n$â j = μ j ω j 2 ℏ q ̂ j + i p ̂ j 2 ℏ μ j ω j ,$\n(26)\n\nand the creation operator $â j ‡$ defined as the Hermitian adjoint of $â j$, one can identify the initial wave functions of the transformed system in number state such that\n\n$ψ n 1 , n 2 B ( q 1 , q 2 ,0)= ψ n 1 B ( q 1 ,0) ψ n 2 B ( q 2 ,0),$\n(27)\n\nwhere\n\n$ψ n j B ( q j , 0 ) = μ j ω j ℏΠ 1 / 4 1 2 n j n j ! H n j μ j ω j ℏ 1 / 2 q j × exp − μ j ω j 2 ℏ q j 2 .$\n(28)\n\nThis formula of wave functions will be used in the next section in order to derive the DSN of the system.\n\n### Displaced squeezed number state\n\nThe DSNs are defined by first squeezing the number states and then displacing them. Like squeezed states, DSNs exhibit nonclassical properties of the quantum field in which the fluctuation of a certain observable can be less than that in the vacuum state. This state is a generalized quantum state for dynamical systems and, in fact, equivalent to excited two-photon coherent states in quantum optics. If we consider that DSNs generalize and combine the features of well-known important states such as displaced number states (DNs) , squeezed number states , and two-photon coherent states (non-excited) , the study of DSNs may be very interesting. Different aspects of these states, including quantal statistics, entropy, entanglement, and position space representation with the correct overall phase, have been investigated in [17, 23, 25].\n\nTo obtain the DSN in the original system, we first derive the DSN in the transformed system according to its exact definition. Then, we will transform it inversely into that of the original system. The squeeze operator in the transformed system is given by\n\n$Ŝ j ( z j )=exp − 1 2 ( z j ∗ â j 2 − z j â j ‡ 2 ) ,$\n(29)\n\nwhere\n\n$z j = r j e i ϕ j .$\n(30)\n\nUsing the Baker-Campbell-Hausdorff relation that is given by \n\n$exp 1 2 ℏ [ a q ̂ 2 + ic ( q ̂ p ̂ + p ̂ q ̂ ) − b p ̂ 2 ] = 1 cosh θ − c θ sinh θ × exp a 2 θℏ sinh θ cosh θ − c θ sinh θ − 1 q ̂ 2 × exp − i ℏ ln cosh θ − c θ sinh θ q ̂ p ̂ × exp − b 2 θℏ sinh θ cosh θ − c θ sinh θ − 1 p ̂ 2 ,$\n(31)\n\nwhere $θ= c 2 − ab$, the squeeze operator can be rewritten as\n\n$Ŝ j ( z j ) = 1 cosh r j + cos ϕ j sinh r j × exp i μ j ω j 2 ℏ sin ϕ j sinh r j cosh r j + cos ϕ j sinh r j q ̂ j 2 × exp − i ℏ ln cosh r j + cos ϕ j sinh r j q ̂ j p ̂ j × exp − i 2 μ j ω j ℏ sin ϕ j sinh r j cosh r j + cos ϕ j sinh r j p ̂ j 2 .$\n(32)\n\nLet us express the DSN in the transformed system in the form\n\n$ψ s , n 1 , n 2 B ( q 1 , q 2 ,t)= ψ s , n 1 B ( q 1 ,t) ψ s , n 2 B ( q 2 ,t),$\n(33)\n\nwhere $ψ s , n j B ( q j ,t)$ represent two decoupled states which are drivable from\n\n$ψ s , n j B ( q j ,t)= T ̂ Bj ( q ̂ j , p ̂ j ,t) D ̂ j ( α j ) Ŝ j ( z j ) ψ n j B ( q j ,0).$\n(34)\n\nHere, $D ̂ j ( α j )$ are displacement operators in the transformed system, which are given by\n\n$D ̂ j ( α j )=exp( α j â j ‡ − α j ∗ â j ),$\n(35)\n\nwhere α j is an eigenvalue of $â j$ at initial time. By considering Equation 26, we can confirm that\n\n$α j = μ j ω j 2 ℏ q jc (0)+ i p jc ( 0 ) 2 ℏ μ j ω j ,$\n(36)\n\nwhere q j c (t) and p j c (t) are classical solutions of the equation of motion in charge and current spaces, respectively, for the finally transformed system. If we regard that the complementary functions of the equation of motion in the firstly transformed system are the same as the classical solutions of the finally transformed system, q j c (t) and p j c (t) can also be complementary functions of the firstly transformed system. The other operators $T ̂ Bj ( q ̂ j , p ̂ j ,t)$ are time-displacement operators:\n\n$T ̂ Bj ( q ̂ j , p ̂ j ,t)=exp − i ℏ ∫ 0 t Ĥ Bj ( q ̂ j , p ̂ j , t ′ ) d t ′ .$\n(37)\n\nAt first, the action of squeezing operator in wave functions of the initial number state gives\n\n$Ŝ j ( z j ) ψ n j B ( q j , 0 ) = μ j ω j ℏΠ 1 / 4 1 2 n j n j ! G bj n j G aj H n j μ j ω j ℏ G cj 1 / 2 q j × exp − μ j ω j 2 ℏ G dj q j 2 ,$\n(38)\n\nwhere\n\n$G aj =cosh r j + e i ϕ j sinh r j ,$\n(39)\n$G bj = cosh r j + e − i ϕ j sinh r j cosh r j + e i ϕ j sinh r j ,$\n(40)\n$G cj = cosh 2 r j + sinh 2 r j +2cos ϕ j cosh r j sinh r j ,$\n(41)\n$G dj = 1 − i sin ϕ j sinh r j ( cosh r j + e i ϕ j sinh r j ) ( cosh r j + cos ϕ j sinh r j ) ( cosh r j + e i ϕ j sinh r j ) .$\n(42)\n\nThe evaluation of the other actions of the operators in Equation 34 may be easily performed using Equation 31 and the relation \n\n$exp c ℏ 2 ∂ 2 ∂ q 2 h ( q ) = 1 4 Π ℏ 2 c ∫ − ∞ ∞ exp − ( y − q ) 2 4 c ℏ 2 h ( y ) dy ,$\n(43)\n\ntogether with the eighth formula of 7.374 in (see Appendix Appendix 1), yielding\n\n(44)\n\nwhere\n\n$h aj =cos( ω j t)+i G dj sin( ω j t),$\n(45)\n$h bj =1− 2 i sin ( ω j t ) h aj G cj .$\n(46)\n\nHere, the time evolution of complementary functions are\n\n$q jc (t)= q jc (0)cos( ω j t)+ p jc ( 0 ) μ j ω j sin( ω j t),$\n(47)\n$p jc (t)= p jc (0)cos( ω j t)− μ j ω j q jc (0)sin( ω j t).$\n(48)\n\nThe transformed system reduces to a two-dimensional undriven simple harmonic oscillator in the limit $E(t)=0$. Our result in Equation 44 is exact, and in this limit, we can easily confirm that some errors in Equation 45 in are corrected (see Appendix Appendix 2).\n\nThe wave function associated to the DSN in the transformed system will be transformed inversely to that of the original system in order to facilitate full study in the original system. This is our basic strategy. Thus, we evaluate the DSN in the original system from\n\n$ψ s , n , m ( q 1 , q 2 ,t)= Û A Û B ψ s , n , m B ( q 1 , q 2 ,t).$\n(49)\n\nUsing the unitary operators given in Equations 7 and 16, we derive\n\n$ψ s , n 1 , n 2 ( q 1 , q 2 , t ) = μ 1 μ 2 ω 1 ω 2 ℏ 2 Π 2 4 1 2 n 1 + n 2 n 1 ! n 2 ! ( h b 1 G b 1 ) n 1 ( h b 2 G b 2 ) n 2 h a 1 G a 1 h a 2 G a 2 e βt / 2 × exp i ℏ e βt / 2 [ p 1 p ( t ) Q 1 + p 2 p ( t ) Q 2 ] H n 1 μ 1 ω 1 ℏ h a 1 2 h b 1 G c 1 [ e βt / 2 Q 1 − q 1 p ( t ) − q 1 c ( t ) ] × H n 2 μ 2 ω 2 ℏ h a 2 2 h b 2 G c 2 [ e βt / 2 Q 2 − q 2 p ( t ) − q 2 c ( t ) ] × exp − ∑ j = 1 2 μ j 2 ℏ ω j h aj [ G dj cos ( ω j t ) + i sin ( ω j t ) ] + iβ 2 [ e βt / 2 Q j − q jp ( t ) ] 2 × exp ∑ j = 1 2 μ j ω j 2 ℏ h aj 2 [ e βt / 2 Q j − q jp ( t ) ] G dj q jc ( 0 ) + i p jc ( 0 ) ω j μ j − q jc 2 ( 0 ) G dj cos ( ω j t ) × exp − ∑ j = 1 2 i p jc 2 ( 0 ) sin ( ω j t ) 2 μ j ω j h aj ℏ + i q jc ( 0 ) p jc ( 0 ) ℏ 1 2 − i G dj sin ( ω j t ) h aj × exp − i ℏ ∫ 0 t [ L 1 p ( t ′ ) + L 2 p ( t ′ ) ] d t ′ .$\n(50)\n\nThis is the full expression of the time evolution of wave functions for the DSN. If we let r→0, the squeezing effects disappear, and consequently, the system becomes DN. Of course the above equation reduces, in this limit, to that of the DN.\n\nTo see the time behavior of this state, we take a sinusoidal signal as a power source, which is represented as\n\n$E(t)= E 0 cos(Ωt+δ).$\n(51)\n\nThen, the solution of Equations 19 and 20 is given by\n\n(52)\n(53)\n(54)\n(55)\n\nwhere\n\n$M j (t)= C 1 C 2 4 4 E 0 e βt / 2 β 4 + 16 ( Ω 2 − ω j 2 ) 2 + 8 β 2 ( Ω 2 + ω j 2 ) .$\n(56)\n\nThe probability densities $| ψ s , n 1 , n 2 ( q 1 , q 2 ,t) | 2$ are plotted in Figures 2 and 3 as a function of q1 and t under this circumstance. As time goes by, the overall probability densities gradually converge to the origin where q1=0 due to the dissipation of energy caused by the existence of resistances in the circuit. If there are no resistances in the circuit, the probability densities no longer converge with time. An electronic system in general loses energy by the resistances, and the lost energy changes to thermal energy. Actually, Figure 2 belongs to DN due to the condition r1=r2=0 supposed in it. The wave function used in Figure 2a is not displaced and is consequently the same as that of the number state. Figure 2b is distorted by the effect of displacement. From Figure 2c,d, you can see that the exertion of a sinusoidal power source gives additional distortion. The frequency of $E(t)$ is relatively large for Figure 2c whereas it is small for Figure 2d.\n\nYou can see the effects of squeezing from Figure 3. The probability densities in the DSN are more significantly distorted than those of the DN. We can see from Figure 3b,c that the time behavior of probability densities is highly affected by external power source. If there is no power source in the circuit, the displacement of charge, specified with an initial condition, may gradually disappear according to its dissipation induced by resistances in the circuit. This is the same as that interpreted from the DN and exactly coincides with classical analysis of the system.\n\nWhile various means and technologies to generate squeezed and/or displaced light are developed in the context of quantum optics after the seminal work of Slusher et al. for observing squeezed light in the mid 1980s, (displaced) squeezed number state with sufficient degree of squeezing for charges and currents in a circuit quantum electrodynamics is first realized not long ago by Marthaler et al. as far as we know. The circuit they designed not only undergoes sufficiently low dissipation but its potential energy also contains a positive quartic term that leads to achieving strong squeezing. Another method to squeeze quantum states of mechanical oscillation of charge carriers in a circuit is to use the technique of back-action evasion [33, 34] that is originally devised in order to measure one of two arbitrary conjugate quadratures with high precision beyond the standard quantum limit.\n\nThough it is out of the scope of this work, the superpositions of any two DSNs may also be interesting topics to study, thanks to their nonclassical features that have no classical analogues. The quantum properties such as quadrature squeezing, quantum number distribution, purity, and the Mandel Q parameter for the superposition of two DSNs out of phase with respect to each other are studied in the literatures (see, for example, ).\n\n### Quantum fluctuations\n\nNow let us see the quantum fluctuations and uncertainty relations for charges and currents in the DSN for the original system. It is well known that quantum energy and any physical observables are temporarily changed due to their quantum fluctuations. The theoretical study for the origin and background physics of quantum fluctuations have been performed in by introducing stochastic and microcanonical quantizations.\n\nIf we consider the method of consecutive unitary transformation, the expectation value for an arbitrary operator $O ̂ j$ in the original system can be evaluated from\n\n$〈 ψ s , n 1 , n 2 ( t ) | O ̂ j | ψ s , n 1 , n 2 ( t ) 〉 = 〈 ψ n 1 , n 2 B ( 0 ) | Ŝ j ‡ D ̂ j ‡ T ̂ Bj ‡ Û B ‡ Û A ‡ O ̂ j Û A Û B T ̂ Bj D ̂ j Ŝ j | ψ n 1 , n 2 B ( 0 ) 〉 .$\n(57)\n\nUsing this relation, the expectation value of charges $q ̂ j$ and currents $p ̂ j$ is derived to be\n\n$〈 ψ s , n 1 , n 2 ( t ) | q ̂ 1 | ψ s , n 1 , n 2 ( t ) 〉 = C 1 C 2 4 e − βt / 2 [ Y 1 ( t ) cos φ + Y 2 ( t ) sin φ ] ,$\n(58)\n$〈 ψ s , n 1 , n 2 ( t ) | q ̂ 2 | ψ s , n 1 , n 2 ( t ) 〉 = C 2 C 1 4 e − βt / 2 [ − Y 1 ( t ) sin φ + Y 2 ( t ) cos φ ] ,$\n(59)\n$〈 ψ s , n 1 , n 2 ( t ) | p ̂ 1 | ψ s , n 1 , n 2 ( t ) 〉 = − C 2 C 1 4 e βt / 2 [ Y 1 ( t ) cos φ + Y 2 ( t ) sin φ ] ,$\n(60)\n$〈 ψ s , n 1 , n 2 ( t ) | p ̂ 2 | ψ s , n 1 , n 2 ( t ) 〉 = C 1 C 2 4 e βt / 2 [ Y 1 ( t ) sin φ − Y 2 ( t ) cos φ ] ,$\n(61)\n\nwhere\n\n$Y j (t)= ℏ 2 μ j ω j ( α j e − i ω j t + α j ∗ e i ω j t )+ q jp (t),$\n(62)\n$Y j ( t ) = μ j ℏ 2 ω j α j e − i ω j t ( β / 2 + i ω j ) + α j ∗ e i ω j t ( β / 2 − i ω j ) − p jp ( t ) .$\n(63)\n\nThe expectation value of square of $q ̂ j$ and $p ̂ j$ can also be obtained form the same method, and we listed them in Appendix Appendix 3. In fact, Equations 58 and 59 are the same as the classically predicted amount of charges qcl,1 and qcl,2 in C1 and C2 in the original system, respectively. If we consider that α j are given by Equation 36, qcl,1 and qcl,2 can be rewritten, after a little evaluation, in the form\n\n$q cl , 1 = C 1 C 2 4 e − βt / 2 { [ q 1 c ( t ) + q 1 p ( t ) ] cos φ + [ q 2 c ( t ) + q 2 p ( t ) ] sin φ } ,$\n(64)\n$q cl , 2 = C 2 C 1 4 e − βt / 2 { [ q 2 c ( t ) + q 2 p ( t ) ] cos φ − [ q 1 c ( t ) + q 1 p ( t ) ] sin φ } .$\n(65)\n\nWe illustrated qcl,1 and qcl,2 in Figure 4 as a function of time. To understand the time behavior of these quantities, it may be worth to recall that complementary functions, q j c (t), and particular solutions, q j p (t), are not associated to the original system but to the firstly transformed system. We can also easily confirm from similar evaluation that the time behavior of canonical conjugate currents pcl,j are represented in terms of q j c (t), p j c (t), and p j p (t) (see Appendix Appendix 4).\n\nThe definition of quantum fluctuations for any quantum operator $O ̂ j$ in the DSN is given by\n\n(66)\n\nUsing this, we obtain the fluctuations of charges and currents as\n\n(67)\n(68)\n(69)\n(70)\n\nAs we have seen before, the expectation values associated to charges and currents are represented in terms of complementary functions, q j c (t) and p j c (t), and particular solutions q j p (t) and p j p (t). The amplitude of complementary functions is determined from the strength of displacements, whereas the particular solutions are determined by the power source $E(t)$ (see Equations 19 and 20). However, all of the fluctuations do not involve such solutions. This means that the displacement and the electric power source do not affect to the fluctuations of charges and currents.\n\nThe uncertainty products $( Δ q ̂ j ) s ( Δ p ̂ j ) s$ between charges and their conjugate currents can be easily identified by means of Equations 67 to 70. For the case of the DN that are given from the limit r1=r2→0, we have F1=F2=0 and $F j = ω j 2 + β 2 /4$. Then, the uncertainty products become\n\n(71)\n(72)\n\nThese are the same as the uncertainty products in the number states and are always larger than $ℏ/2$, preserving the uncertainty principle. Thus, we can conclude that the uncertainty products in the DN are the same as those of the ordinary number states. Evidently, the uncertainty principle is inherent in quantum mechanical context described by canonical variables. The results, Equations 71 and 72 with n1=n2=0, are exactly the same as Equations 29 and 30 of , respectively. Moreover, for R1=R2=R3→0 (i.e., β→0), the above two equations reduce to Equations 52 and 53 in , which are evaluated in ordinary number state. Hence, this work includes all the results of both (no power source) and (no resistances) as special cases. The fluctuations and uncertainty product in the DN and in the DSN are plotted in Figure 5. We can adjust the uncertainty (or fluctuation) of a quadrature to be small at the expense of broadening that of another quadrature, or vice versa. The uncertainty $( Δ q ̂ 1 ) s$ in the case of this figure is larger than $( Δ q ̂ 1 ) c$, while $( Δ p ̂ 1 ) s$ is smaller than $( Δ p ̂ 1 ) c$ due to the squeezing effect. Therefore, it is relatively difficult for us to know the precise value of charge q1, while we can find out the conjugate current p1 more precisely. However, the relevant uncertainty product in the DSN is nearly unaltered from that in the DN.\n\n## Conclusions\n\nIn summary, the time evolution of the DSN for the two-dimensional electronic circuit composed of nanoscale elements and driven by a power source is investigated using unitary transformation method. Two steps of the unitary transformation are executed: We removed the cross term involving $p ̂ 1 p ̂ 2$ in the original Hamiltonian from the first step, and the linear terms represented in terms of $q ̂ j E(t)$ in the firstly transformed Hamiltonian are eliminated by second unitary transformation.\n\nWe can see from Equation 6 that the original Hamiltonian is time-dependent. When treating a time-dependent Hamiltonian system dynamically, one usually employs classical solutions of the equation of motion for a given system (or for a system similar to a given system) [6, 7]. We also introduced such classical solutions in Equations 19 to 20 and in Equations 47 to 48. Among them, particular solutions q j p and p j p are important in developing quantum theory of the system involving external power source since they are crucial factors that lead the transformed Hamiltonian to be simple so that we can easily treat it.\n\nSince the transformed system is just the same as the one that consists of two independent simple harmonic oscillators, provided that we can neglect the trivial terms $L jp (t)$ in the transformed Hamiltonian, we easily identified the complete quantum solutions in the DSN in the transformed system. We also obtained the wave functions of the DSN in the original system via the technique of inverse transformation, as shown in Equation 50. If we regard the fact that the probability does not reflect the phase of a wave function, the overall phase of these states is relatively unimportant for many cases. However, in some applications such as the computation of expectation values using generating or characteristic functions given in , the exact knowledge of overall phase is crucial. For r1=r2=0, the wave function in the DSN exactly reduces to that of the DN.\n\nWe analyzed the probability densities in the DN and in the DSN from Figures 2 and 3, respectively, with the choice of sinusoidal signal source. The probability densities in the DN given in Figure 2b,c,d oscillate with time. Moreover, their time behaviors are more or less distorted. The probability density, however, does not oscillate when there are no displacement and no signal of power source (see Figure 2a). The probability densities in the DSN are distorted much more significantly than those of the DN.\n\nThe time behavior of probability densities of quantum states, both the DN and the DSN, is highly affected by external driving power source. When there is no external power source($E(t)$=0), the displacement of charges, specified with a certain initial condition, gradually disappears as time goes by like a classical state.\n\nThe fluctuations and uncertainty products of charges and currents are derived in the DSN, and it is shown that their value is independent of the size of the particular solutions q j p (t) and p j p (t). From this, together with the fact that q j p (t) and p j p (t) are determined by the characteristics of $E(t)$, it is clear that the electric power source does not affect on the fluctuation of canonical variables. If we ignore the time dependence of F j (t) and $F j (t)$, $( Δ q ̂ j ) s$ decrease exponentially with time, whereas $( Δ p ̂ j ) s$ increase exponentially.\n\nFrom Equations 64 and 65, we can see that the time behavior of q j is determined by two factors: One is displacement and the other is the signal of power source. For better understanding of this, recall that the amplitude of complementary functions gives displacement of the system, and the particular solutions are closely related to external driving force (i.e., in this case, the power source).\n\nIn this paper, we did not consider thermal effects for the system. The thermal effects, as well as dissipation, may be worth to be considered in the studies of quantum fluctuations of electronic circuits with nanosize elements because the practical circuits are always working in thermal states with the presence of damping. It may therefore be a good theme to investigate DSNs with thermalization as a next task, and we plan to investigate it in the near future.\n\n## Appendix 1\n\n### The eighth formula of 7.374 in \n\n$∫ − ∞ ∞ e − ( x − y ) 2 H n ( ax ) dx = Π 1 / 2 ( 1 − a 2 ) n / 2 H n ay ( 1 − a 2 ) 1 / 2 .$\n(73)\n\n## Appendix 2\n\n### Correction of Equation 45 of \n\nThe second line of Equation 45 of needs to be corrected as\n\n$exp ⋯ + x ( x 0 F 2 + i p 0 ) cos t B − ⋯ → exp ⋯ + x x 0 F 2 + i p 0 B − ⋯ .$\n(74)\n\nBesides, among various functions that appeared in Equation 45 of , $F 3$ (Equation 23) and A (Equation 46) should be altered as\n\n$F 3 = cosh r + e − iϕ sin ϕ sinh r cosh r + e iϕ sin ϕ sinh r → F 3 = cosh r + e − iϕ sinh r cosh r + e iϕ sinh r ,$\n(75)\n$A = 1 − 2 i sin t F 4 2 B B − 2 i sin t / F 4 2 B → A = 1 − 2 i sin t F 4 2 B .$\n(76)\n\nFor the convenience of comparison, we provide a list of correspondences between our notations and the notations used in :\n\n$G aj ⇔ F 1 , G bj ⇔ F 3 , G cj ⇔ ( F 4 ) 2 , G dj ⇔ F 2 , h aj ⇔ B , h bj ⇔ A.$\n(77)\n\n## Appendix 3\n\n### Expectation value of $q ̂ j 2$ and $p ̂ j 2$\n\nAccording to the rule, Equation 57, for evaluating expectation values, we also have the expectation value of square of charges and currents as\n\n(78)\n(79)\n(80)\n(81)\n\nwhere\n\n$F j (t)=cosh(2 r j )+sinh(2 r j )cos( ϕ j −2 ω j t),$\n(82)\n$F j ( t ) = ( β 2 / 4 + ω j 2 ) cosh ( 2 r j ) + [ ( β 2 / 4 − ω j 2 ) cos ( ϕ j − 2 ω j t ) − β ω j sin ( ϕ j − 2 ω j t ) ] sinh ( 2 r j ) .$\n(83)\n\n## Appendix 4\n\n### Classical currents\n\nThrough the same vein as that of the calculation of qcl,1 and qcl,2 given in Equations 64 and 65, we can evaluate classical currents pcl,1 and pcl,2 from their quantum expectation value given in Equations 60 and 61. Thus, we have\n\n$p cl , 1 = C 2 C 1 4 e βt / 2 { [ p 1 c ( t ) − μ 1 β q 1 c ( t ) / 2 + p 1 p ( t ) ] cos φ + [ p 2 c ( t ) − μ 2 β q 2 c ( t ) / 2 + p 2 p ( t ) ] sin φ } ,$\n(84)\n$p cl , 2 = C 1 C 2 4 e βt / 2 { [ p 2 c ( t ) − μ 2 β q 2 c ( t ) / 2 + p 2 p ( t ) ] cos φ − [ p 1 c ( t ) − μ 1 β q 1 c ( t ) / 2 + p 1 p ( t ) ] sin φ } .$\n(85)\n\n## Abbreviations\n\nDN:\n\ndisplaced number state.\n\n## References\n\n1. 1.\n\nSohn LL, Kouwenhoven LP, Schön G: Mesoscopic Electron Transport. Kluwer: Dordrecht; 1997.\n\n2. 2.\n\nAndo T, Arakawa Y, Furuya K, Komiyama S, Nakashima H: Mesoscopic Physics and Electronics. Springer: Berlin; 1998.\n\n3. 3.\n\nLouisell WH: Quantum Statistical Properties of Radiation. New York: Wiley; 1973.\n\n4. 4.\n\nZhang S, Choi JR, Um CI, Yeon KH: Quantum uncertainties of mesoscopic inductance-resistance coupled circuit. J Korean Phys Soc 2002, 40: 325–329.\n\n5. 5.\n\nBaseia B, De Brito AL: Quantum noise reduction in an electrical circuit having a time dependent parameter. Physica A 1993, 197: 364–370. 10.1016/0378-4371(93)90590-Z\n\n6. 6.\n\nChoi JR: Exact solution of a quantized LC circuit coupled to a power source. Phys Scr 2006, 73: 587–595. 10.1088/0031-8949/73/6/010\n\n7. 7.\n\nPark TJ: Canonical transformations for time-dependent harmonic oscillators. Bull Korean Chem Soc 2004, 25: 285–288.\n\n8. 8.\n\nCong J, He L, Koh CK, Madden PH: Performance optimization of VLSI interconnect layout. Integration-VLSI J 1996, 21: 1–94. 10.1016/S0167-9260(96)00008-9\n\n9. 9.\n\nAyten UE, Sagbas M, Sedef H: Current mode leapfrog ladder filters using a new active block. Int J Electron Commun 2010, 64: 503–511. 10.1016/j.aeue.2009.03.012\n\n10. 10.\n\nJeltsema D, Scherpen JMA: A dual relation between port-Hamiltonian systems and the Brayton-Moser equations for nonlinear switched RLC circuits. Automatica 2003, 39: 969–979. 10.1016/S0005-1098(03)00070-0\n\n11. 11.\n\nPaulson EK, Martin RW, Zilm KW: Cross polarization, radio frequency field homogeneity, and circuit balancing in high field solid state NMR probes. J Magn Reson 2004, 171: 314–323. 10.1016/j.jmr.2004.09.009\n\n12. 12.\n\nBabič M, Vertechy R, Berselli G, Lenarčič J, Castelli VP, Vassura G: An electronic driver for improving the open and closed loop electro-mechanical response of dielectric elastomer actuators. Mechatronics 2010, 20: 201–212. 10.1016/j.mechatronics.2009.11.006\n\n13. 13.\n\nHaji-Nasiri S, Faez R, Moravvej-Farshi MK: Stability analysis in multiwall carbon nanotube bundle interconnects. Microelectron Reliab 2012, 52: 3026–3034. 10.1016/j.microrel.2012.06.147\n\n14. 14.\n\nAlioto M: Modeling strategies of the input admittance of RC interconnects for VLSI CAD tools. Microelectron J 2011, 42: 63–73. 10.1016/j.mejo.2010.09.003\n\n15. 15.\n\nParthasarathy S, Loganthurai P, Selvakumaran S, Rajasekaran DV: Harmonic mitigation in UPS system using PLL. Energy Procedia 2012, 14: 873–879.\n\n16. 16.\n\nFathabadi H: Stability analysis of circuits including BJT differential pairs. Microelectron J 2010, 41: 834–839. 10.1016/j.mejo.2010.07.008\n\n17. 17.\n\nMoller KB, Jorgensen TG, Dahl JP: Displaced squeezed number states: position space representation, inner product, and some applications. Phys Rev A 1996, 54: 5378–5385. 10.1103/PhysRevA.54.5378\n\n18. 18.\n\nMarchiolli MA, da Silva LF, Melo PS, Dantas CMA: Quantum-interference effects on the superposition of N displaced number states. Physica A 2001, 291: 449–466. 10.1016/S0378-4371(00)00529-X\n\n19. 19.\n\nNarozhny NB, Sanchez-Mondragon JJ, Eberly JH: Coherence versus incoherence: collapse and revival in a simple quantum model. Phys Rev A 1981, 23: 236–247. 10.1103/PhysRevA.23.236\n\n20. 20.\n\nKim MS: Dissipation and amplification of Jaynes-Cummings superposition states. J Mod Opt 1993, 40: 1331–1350. 10.1080/09500349314551391\n\n21. 21.\n\nEl-Orany FAA, Obada A-S: On the evolution of superposition of squeezed displaced number states with the multiphoton Jaynes-Cummings model. J Opt B: Quant Semiclass Opt 2003, 5: 60–72. 10.1088/1464-4266/5/1/309\n\n22. 22.\n\nMoya-Cessa H, Knight PL: Series representation of quantum-field quasiprobabilities. Phys Rev A 1993, 48: 2479–2481. 10.1103/PhysRevA.48.2479\n\n23. 23.\n\nSatyanarayana MV: Generalized coherent states and generalized squeezed coherent states. Phys Rev D 1985, 32: 400–404. 10.1103/PhysRevD.32.400\n\n24. 24.\n\nLoudon R, Knight PL: Squeezed light. J Mod Opt 1987, 34: 709–759. 10.1080/09500348714550721\n\n25. 25.\n\nAbdel-Aty M, Abd Al-Kader GM, Obada A-SF: Entropy and entanglement of an effective two-level atom interacting with two quantized field modes in squeezed displaced fock states. Chaos, Solitons Fractals 2001, 12: 2455–2470. 10.1016/S0960-0779(00)00215-0\n\n26. 26.\n\nWang X-b, Oh CH, Kwek LC: General approach to functional forms for the exponential quadratic operators in coordinate-momentum space. J Phys A: Math Gen 1998, 31: 4329–4336. 10.1088/0305-4470/31/18/020\n\n27. 27.\n\nThornton ST, Marion JB: Classical Dynamics of Particles and Systems. Belmont: Brooks/Cole; 2004.\n\n28. 28.\n\nNieto MM: Functional forms for the squeeze and the time-displacement operators. Quantum Semiclass Opt 1996, 8: 1061–1066. 10.1088/1355-5111/8/5/011\n\n29. 29.\n\nGradshteyn IS, Ryzhik IM: Tables of Integrals, Series, and Products. San Diego: Academic; 1994:. 804 804\n\n30. 30.\n\nNieto MM: Displaced and squeezed number states. Phys Lett A 1997, 229: 135–143. [Equation 45] [Equation 45] 10.1016/S0375-9601(97)00183-7\n\n31. 31.\n\nSlusher RE, Hollberg LW, Yurke B, Mertz JC, Valley JF: Observation of squeezed states generated by four-wave mixing in an optical cavity. Phys Rev Lett 1985, 55: 2409–2412. 10.1103/PhysRevLett.55.2409\n\n32. 32.\n\nMarthaler M, Schön G, Shnirman A: Photon-number squeezing in circuit quantum electrodynamics. Phys Rev Lett 2008, 101: 147001.\n\n33. 33.\n\nSzorkovszky A, Doherty AC, Harris GI, Bowen WP: Mechanical squeezing via parametric amplification and weak measurement. Phys Rev Lett 2011, 107: 213603.\n\n34. 34.\n\nClerk AA, Marquardt F, Jacobs K: Back-action evasion and squeezing of a mechanical resonator using a cavity detector. New J Phys 2008, 10: 095010. 10.1088/1367-2630/10/9/095010\n\n35. 35.\n\nObada A-SF, Abd Al-Kader GM: Superpositions of squeezed displaced Fock states: properties and generation. J Mod Opt 1999, 46: 263–278.\n\n36. 36.\n\nKanenaga M: The origin of quantum fluctuations in microcanonical quantization. Phys Lett A 2004, 324: 145–151. 10.1016/j.physleta.2004.02.074\n\n## Author information\n\nAuthors\n\n### Corresponding author\n\nCorrespondence to Jeong Ryeol Choi." ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.8972423,"math_prob":0.99133795,"size":30574,"snap":"2021-43-2021-49","text_gpt3_token_len":7123,"char_repetition_ratio":0.15155381,"word_repetition_ratio":0.040987033,"special_character_ratio":0.23448028,"punctuation_ratio":0.1266217,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99837285,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-12-05T18:22:41Z\",\"WARC-Record-ID\":\"<urn:uuid:570bb720-42d0-40e4-a4ae-fd9981dcd9ac>\",\"Content-Length\":\"1049576\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:331d3d20-7532-4b4d-afe3-8f537986c2e6>\",\"WARC-Concurrent-To\":\"<urn:uuid:7c237949-e9a8-4086-b428-1c039f02911f>\",\"WARC-IP-Address\":\"146.75.32.95\",\"WARC-Target-URI\":\"https://nanoscalereslett.springeropen.com/articles/10.1186/1556-276X-8-30\",\"WARC-Payload-Digest\":\"sha1:6BKKLKGBFWH3FGE62HP7MDO5YRC76ZSJ\",\"WARC-Block-Digest\":\"sha1:AVSW7ZTL7XFLVC544MIACX3V6SDEEORP\",\"WARC-Truncated\":\"length\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-49/CC-MAIN-2021-49_segments_1637964363215.8_warc_CC-MAIN-20211205160950-20211205190950-00007.warc.gz\"}"}
https://springerplus.springeropen.com/articles/10.1186/s40064-016-2068-x
[ "# Dynamics of almost periodic Schoener’s competition model with time delays and impulses\n\n## Abstract\n\nIn real world, the ecological systems are usually perturbed by human exploitation activities such as planting and harvesting and so on. In order to obtain a more accurate description for such phenomenon, the impulsive differential equations play an important role. This paper is concerned with a kind of almost periodic Schoener’s competition model with pure-delays and impulsive effects. By using the comparison theorem and the Lyapunov functional method of the impulsive differential equations, some sufficient conditions are obtained for the persistence and existence of a unique uniformly asymptotically stable positive almost periodic solution in a class of impulsive Schoener’s competition model with pure-delays. The main results in this paper improve some results in recent years. And the method used in this paper provides a possible and effective method to study the permanence and existence of a unique uniformly asymptotically stable positive almost periodic solution of the models with impulsive perturbations in biological populations. Finally, an example and numerical simulations are given to illustrate the feasibility and effectiveness of our main results.\n\n## Background\n\nOne of the most interest topics in mathematics ecology concerns the uniform persistence, almost periodic oscillations and global stability of ecology system. It is well known that a lot of Lotka–Volterra competitive systems have been discussed. Chen (1988) proposed and discussed a more practical competitive model as follows:\n\n\\begin{aligned} \\left\\{ \\begin{array}{lll} \\dot{x}_{1}(t)=x_{1}(t)\\bigg [\\frac{a_{10}(t)}{x_{1}(t)+m_{1}(t)} -a_{11}(t)x_{1}(t)-a_{12}(t)x_{2}(t)-c_{1}(t)\\bigg ],\\\\ \\dot{x}_{2}(t)=x_{2}(t)\\bigg [\\frac{a_{20}(t)}{x_{2}(t)+m_{2}(t)}-a_{21}(t)x_{1}(t) -a_{22}(t)x_{2}(t)-c_{2}(t)\\bigg ]. \\end{array}\\qquad \\right. \\end{aligned}\n(1)\n\nIn biological terms, $$x_1$$ and $$x_2$$ stand for the spatial densities of each species and $$c_1$$ and $$c_2$$ are their respective net death rate. The coefficients $$a_{11}$$ and $$a_{22}$$ are intra-specific competition rates whereas $$a_{12}$$ and $$a_{21}$$ are inter-specific competition rates. The asymptotic behaviors of the solution to the system (1) have been studied in Liu et al. (2006).\n\nIt is well known that the assumption of almost periodicity of the coefficients in systems is a way of incorporating the time-dependent variability of the environment, especially when the various components of the environment are periodic with not necessary commensurate periods (e.g., climate change, food supplies, mating habits and harvesting). For this reason, the assumption of almost periodicity is more realistic, more important and more general when we consider the effects of the environmental factors. In recent years, there are many scholars concerning with the Schoener’s competition system. Topics such as existence, uniqueness and global attractivity of positive periodic solutions or almost periodic solutions of the system were extensively investigated, and many excellent results have been derived (see Xue et al. 2015; Tian et al. 2015; Zhang et al. 2015; Liu and Xu 2004; Liu et al. 2006; Li and Yang 2009; Gan and Lin 2012; Wu et al. 2009; Zhang et al. 2012 and the references cited therein).\n\nOn the other hand, many evolution processes are characterized by the fact that at certain moments of time they experience a change of state abruptly. These processes are subject to short-term perturbations whose duration is negligible in comparison with the duration of the process. Consequently, it is natural to assume that these perturbations act instantaneously, that is, in the form of impulses. Thus impulsive differential equations, that is, differential equations involving impulse effects, appear as a natural description of observed evolution phenomena of real world problems. The ecological systems are often deeply perturbed by human exploitation activities such as planting and harvesting and so on, which makes them unsuitable to be considered continually. In recent years, the impulsive problems in ecological systems have been intensively investigated (see Lakshmikantham et al. 1989; Stamov 2012; Samoilenko and Perestyuk 1995; Bainov and Simeonov 1993; Jin et al. 2005; Stamov 2009; Liu and Chen 2007; He et al. 2010; Zhang et al. 2014; Zhang and Li 2011 for more detail). For instance, Zhang et al. (2012) studied the following almost periodic Schoener’s competition model with pure-delays and impulsive effects:\n\n\\begin{aligned} \\left\\{ \\begin{array}{lll} \\dot{x}_{1}(t)=x_{1}(t)\\bigg [\\frac{a_{10}(t)}{x_{1}(t-\\tau _{10})+m_{1}(t)} -a_{11}(t)x_{1}(t-\\tau _{11})-a_{12}(t)x_{2}(t-\\tau _{12})-c_{1}(t)\\bigg ],\\\\ \\dot{x}_{2}(t)=x_{2}(t)\\bigg [\\frac{a_{20}(t)}{x_{2}(t-\\tau _{20})+m_{2}(t)}-a_{21}(t)x_{1}(t-\\tau _{21}) -a_{22}(t)x_{2}(t-\\tau _{22})-c_{2}(t)\\bigg ],\\quad t\\ne \\tau _k,\\\\ \\Delta x_1(\\tau _k)=h_{1k}x_1(\\tau _k),\\\\ \\Delta x_2(\\tau _k)=h_{2k}x_2(\\tau _k),\\quad k\\in {\\mathbb {Z}}^+:=\\{0,1,\\ldots \\}, \\end{array} \\right. \\end{aligned}\n(2)\n\nwhere $$x_{1}(t)$$, $$x_{2}(t)$$ are population densities of species $$x_{1}$$, $$x_{2}$$ at time t, respectively, $$\\tau _{ij}$$ are all nonnegative integers, $$a_{ij}$$, $$m_{i}$$ and $$c_{i}$$, are all positive almost periodic functions, $$i=1,2$$, $$j=0,1,2$$, $$h_{1k}, h_{2k}\\ge 0$$ are almost periodic sequences, $$0=\\tau _0<\\tau _1< \\tau _2< \\cdots< \\tau _k< \\tau _{k+1} < \\cdots$$, are impulse points with $$\\lim _{k\\rightarrow +\\infty }\\tau _k=+\\infty$$, and the set of sequences $$\\{\\tau _{k}^{j}\\}, \\tau _{k}^{j} =\\tau _{k+j}-\\tau _{k}, k\\in {\\mathbb {Z}}^+, j\\in {\\mathbb {Z}}$$ is uniformly almost periodic (see Definition 1 in “Preliminaries” section).\n\nThe permanence and almost periodicity of all species in multispecies community are very important in biological populations. In recent years, the permanence and almost periodic solution of the models in biological populations has been studied by many authors (see Zhang 2013, 2014; Du and Lv 2013; Meng and Chen 2006; Lin and Chen 2009; Zhou et al. 2013; Zhang et al. 2014; Xia et al. 2008; Xia 2013; Liao and Zhang 2012; Liao and Xu 2014 and the references cited therein). In these cases, the comparison theorems and the Liapunov functional method of differential equations have been applied to obtain the permanence and almost periodic solutions. However, we find few papers referring to the discontinuous systems (i.e., impulsive systems).\n\nRecently, there are some scholars concerning with the permanence and almost periodic solution of the impulsive models in biological populations, see Zhang et al. (2012, 2014), He et al. (2010). For example, He et al. (2010) considered the following impulsive differential equation model of plankton allelopathy\n\n\\begin{aligned} \\left\\{ \\begin{array}{lll} \\dot{x}_{1}(t)=x_{1}(t)\\bigg [r_1(t) -a_{11}(t)x_{1}(t)-a_{12}(t)x_{1}(t)-b_{1}(t)x_{1}(t)x_2(t)\\bigg ],\\\\ \\dot{x}_{2}(t)=x_{2}(t)\\bigg [r_1(t) -a_{21}(t)x_{1}(t)-a_{22}(t)x_{2}(t)-b_{2}(t)x_{1}(t)x_2(t)\\bigg ],\\quad t\\ne t_k,\\\\ \\Delta x_1(t_k)=h_{1k}x_1(t_k),\\\\ \\Delta x_2(t_k)=h_{2k}x_2(t_k),\\quad k\\in {\\mathbb {Z}}^+. \\end{array} \\right. \\end{aligned}\n(3)\n\nBy using the relation between the solutions of impulsive system and the corresponding non-impulsive system, the authors transformed impulsive system (3) into a continuous system. Further, by means of the comparison theorems and the Liapunov functional method of differential equations without impulses, the authors obtained some sufficient conditions ensuring the existence of a unique uniformly asymptotically stable positive almost periodic solution of system (3).\n\nNext, by using a similar method as that in He et al. (2010), the authors in Zhang et al. (2012, 2014) studied the permanence and almost periodic solution of system (2) and the following impulsive multispecies mutualism system:\n\n\\begin{aligned} \\left\\{ \\begin{array}{ll} \\dot{x}_{i}(t)=x_{i}(t)\\bigg [r_i(t) -a_{i}(t)x_{i}(t-\\tau _i(t))+\\sum \\nolimits _{j=1,j\\ne i}^nb_{ij}(t)\\frac{x_j(t)}{1+x_j(t)}\\bigg ],\\quad t\\ne t_{k},\\\\ \\Delta x_i(t_k)=h_{ik}x_i(t_k),\\quad k\\in {\\mathbb {Z}}^+,\\quad i=1,2,\\ldots ,n. \\end{array} \\right. \\end{aligned}\n(4)\n\nIt is worthwhile to note that the main results of paper (Zhang et al. 2012, 2014; He et al. 2010) indicates the impulsive coefficients $$h_{ik}$$ in system (2)–(4) satisfying the following condition:\n\n(F) :\n\n$$H_{i}(t):=\\prod _{0<t_{k}<t}(1+h_{ik})$$, $$i=1,2$$ or $$i=1,2,\\ldots ,n\\,$$ (for system (4)), $$k\\in {\\mathbb {Z}}^+$$ is almost periodic function and there exist positive constants $$H_{i}^{u}$$ and $$H_{i}^{l}$$ such that $$H_{i}^{l}\\le H_{i}(t)\\le H_{i}^{u}$$.\n\n### Remark 1\n\nObviously, condition (F) is too harsh. For example, if the impulse coefficient $$h_{ik}\\equiv 0.3\\,(i=1,2)$$ in system (2)–(4), then (F) is invalid. Therefore, the main results in papers (Zhang et al. 2012, 2014; He et al. 2010) are difficult to apply to more extensive model with impulsive effects.\n\nIn Zhang et al. (2012, 2014), He et al. (2010), although the authors considered the impulsive system, but still used the research method of continuous systems. Stimulated by this, by means of the comparison theorem and the Lyapunov functional method of the impulsive differential equations (Lakshmikantham et al. 1989; Stamov 2012), the main purpose of this paper is to establish some sufficient conditions which guarantee the permanence and existence of a unique uniformly asymptotically stable positive almost periodic solution of system (2). The main results obtained in this paper remove the harsh condition (F) and provide a possible and effective method to study the permanence and existence of a unique uniformly asymptotically stable positive almost periodic solution of the models with impulsive perturbations in biological populations.\n\nLet $${\\mathbb {R}}$$ and $${\\mathbb {Z}}$$ denote the sets of real numbers and integers integers, respectively. Related to a continuous function f, we use the following notations:\n\n$$f^l=\\inf _{s\\in {\\mathbb {R}}}f(s),\\quad f^u=\\sup _{s\\in {\\mathbb {R}}}f(s).$$\n\nThe organization of this paper is as follows. In “Preliminaries” section, we give some basic definitions and necessary lemmas which will be used in later sections. In “Permanence” section, by using the comparison theorem of the impulsive differential equations (Lakshmikantham et al. 1989), we give the permanence of system (2). In “Almost periodic solution” section, we study the existence of a unique uniformly asymptotically stable positive almost periodic solution of system (2) by applying the Lyapunov method of the impulsive differential equations (Stamov 2012). Finally, an example and numerical simulations are given to illustrate that our results are feasible.\n\n## Preliminaries\n\nNow, let us state the following definitions and lemmas, which will be useful in proving our main result.\n\nBy $${\\mathbb {I}}$$, $${\\mathbb {I}}=\\{\\{\\tau _{k}\\}\\in {\\mathbb {R}}: \\tau _{k}<\\tau _{k+1}$$, $$k\\in {\\mathbb {Z}}$$, $$\\lim _{k\\rightarrow \\pm \\infty }\\tau _{k}=\\pm \\infty \\}$$, we denote the set of all sequences that are unbounded and strictly increasing. Let $$\\Omega \\subset {\\mathbb {R}}$$, $$\\Omega \\ne \\emptyset$$, $$\\tau =\\max \\{2\\tau _{ij}, i=1,2, j=0,1,2\\}$$, $$\\xi _{0}\\in {\\mathbb {R}}$$, introduce the following notations:\n\n$$PC(\\xi _{0})$$ is the space of all functions $$\\phi :[\\xi _{0}-\\tau ,\\xi _{0}]\\rightarrow \\Omega$$ having points of discontinuity at $$\\mu _{1},\\mu _{2},\\ldots \\in [\\xi _{0}-\\tau ,\\xi _{0}]$$ of the first kind and left continuous at these points.\n\nFor $$J\\subset {\\mathbb {R}}$$, $$PC(J, {\\mathbb {R}})$$ is the space of all piecewise continuous functions from J to $${\\mathbb {R}}$$ with points of discontinuity of the first kind $$\\tau _{k}$$, at which it is left continuous.\n\nLet $$\\phi _{1}, \\phi _{2}\\in PC(0)$$. Denote by $$x_{i}(t)=x_{i}(t;0,\\phi _{i})$$, $$x_{i}\\in \\Omega$$, $$i=1,2$$ the solution of system (2) satisfying the initial conditions\n\n$$0\\le x_{i}(s;0,\\phi _{i})=\\phi _{i}(s)<+\\infty ,\\quad s\\in [-\\tau ,0],\\quad x_{i}(0+0;0,\\phi _{i})=\\phi _{i}(0)>0.$$\n(5)\n\nBy the basic theories of impulsive differential equations with delay in Stamov (2012), system (2) and (5) has a unique solution. Since the solution of system (2) and (5) is a piecewise continuous function with points of discontinuity of the first kind $$\\tau _{k}$$, $$k\\in {\\mathbb {Z}}$$ we adopt the following definitions for almost periodicity.\n\n### Definition 1\n\n(Stamov 2012) The integer number p is said to be an $$\\epsilon$$-almost period of $$\\{\\tau _k\\}$$, if for $$k\\in {\\mathbb {Z}}$$, $$|\\tau _{k+p}-\\tau _k|<\\epsilon .$$\n\n### Definition 2\n\n(Stamov 2012) The set of sequences $$\\{\\tau _{k}^{j}\\}, \\tau _{k}^{j} =\\tau _{k+j}-\\tau _{k}, k\\in {\\mathbb {Z}}, j\\in {\\mathbb {Z}}, \\{\\tau _{k}\\}\\in {\\mathbb {I}}$$ is said to be uniformly almost periodic if for arbitrary $$\\epsilon >0$$ there exists a relatively dense set of $$\\epsilon$$-almost periods common for any sequences.\n\n### Definition 3\n\n(Stamov 2012) The function $$\\varphi \\in PC({\\mathbb {R}},{\\mathbb {R}})$$ is said to be almost periodic, if the following hold:\n\n1. (1)\n\nThe set of sequences $$\\{\\tau _{k}^{j}\\}, \\tau _{k}^{j}=\\tau _{k+j}- \\tau _{k}, k\\in {\\mathbb {Z}}, j\\in {\\mathbb {Z}}, \\{\\tau _{k}\\}\\in {\\mathbb {I}}$$ is uniformly almost periodic.\n\n2. (2)\n\nFor any $$\\epsilon >0$$ there exists a real number $$\\delta >0$$ such that if the points $$t'$$ and $$t''$$ belong to one and the same interval of continuity of $$\\varphi (t)$$ and satisfy the inequality $$|t'-t''|<\\delta$$, then $$|\\varphi (t')-\\varphi (t'')|<\\epsilon$$.\n\n3. (3)\n\nFor any $$\\epsilon >0$$ there exists a relatively dense set T such that if $$\\eta \\in T$$ , then $$|\\varphi (t+\\eta )-\\varphi (t)|<\\epsilon$$ for all $$t\\in {\\mathbb {R}}$$ satisfying the condition $$|t-\\tau _{k}|>\\epsilon$$, $$k\\in {\\mathbb {Z}}$$. The elements of T are called $$\\epsilon$$-almost periods.\n\n### Lemma 1\n\n(Stamov 2012) Let $$\\{\\tau _{k}\\}\\in {\\mathbb {I}}$$ Then there exists a positive integer. A such that on each interval of length 1, we have no more than A elements of the sequence $$\\{\\tau _{k}\\}$$ , i.e.,\n\n$$i(s,t)\\le A(t-s)+A,$$\n\nwhere i(st) is the number of the points $$\\tau _{k}$$ in the interval (st).\n\nTheoretically, one can investigate the existence, uniqueness and stability of almost periodic solution for functional differential equations by using Lyapunov functional as follows (Stamov 2012, $$\\mathrm {P}_{109}$$):\n\nLet $${\\mathbb {R}}^{n}$$ be the n-dimensional Euclidean space with elements $$x=(x_{1},\\ldots ,x_{n})^{T}$$ and norm $$|x|_{0}=\\sum _{i=1}^{n}|x_{i}|$$, $$C=C([-\\tau ,0],{\\mathbb {R}}^{n})$$, $${\\mathbb {B}}\\in {\\mathbb {R}}^+$$. Denote $$C_{\\mathbb {B}}=\\{\\varphi \\in C:\\Vert \\varphi \\Vert <{\\mathbb {B}}\\}$$, with $$\\Vert \\varphi \\Vert =\\sup _{s\\in [-\\tau ,0]}|\\varphi (s)|_{0}$$.\n\nConsider the system of impulsive differential equations with delay:\n\n\\begin{aligned} \\left\\{ \\begin{array}{lll} \\dot{x}(t)=f(t,x_t),\\quad t\\ne \\tau _k,\\\\ \\Delta x(\\tau _k)=I_{k}(x(\\tau _k)), \\end{array} \\right. \\end{aligned}\n(6)\n\nwhere $$t\\in {\\mathbb {R}}$$, $$\\{\\tau _k\\}\\in {\\mathbb {I}}$$, $$f(t,\\varphi )$$ is continuous in $$(t,\\varphi )\\in {\\mathbb {R}}\\times C_{\\mathbb {B}}$$ and almost periodic in t uniformly for $$\\varphi \\in C_{\\mathbb {B}}$$, $$\\forall \\rho >0$$, $$\\exists M(\\rho )>0$$ such that $$|f(t,\\varphi )|\\le M(\\rho )$$ as $$t\\in {\\mathbb {R}}$$, $$\\varphi \\in C_{\\mathbb {\\rho }}$$, while $$x_{t}\\in C_{\\mathbb {B}}$$ is defined as $$x_{t}(s)=x(t+s)$$ for $$s\\in [-\\tau ,0]$$, $$I_k: D\\rightarrow {\\mathbb {R}}^n$$, $$k\\in {\\mathbb {Z}}$$, D is an open set in $${\\mathbb {R}}^n$$.\n\nIntroduce the following conditions:\n\n$$(C_1)$$ :\n\nThe sequence $$\\{I_k(x)\\}$$, $$k\\in {\\mathbb {Z}}$$ is almost periodic uniformly with respect to $$x\\in D$$.\n\n### Lemma 2\n\n(Stamov 2012, $${\\mathrm {P}}_{109}$$) Suppose that there exists a Lyapunov functional $$V(t,\\phi ,\\psi )$$ defined on $${\\mathbb {R}}\\times C_{{\\mathbb {B}}}\\times C_{\\mathbb {B}}$$ satisfying the following conditions:\n\n1. (1)\n\n$$u(\\Vert \\phi -\\psi \\Vert )\\le V(t,\\phi ,\\psi )\\le v(\\Vert \\phi -\\psi \\Vert )$$, where $$u, v\\in {\\mathcal {P}}$$ with $${\\mathcal {P}}=\\{u:{\\mathbb {R}}^{+}\\rightarrow {\\mathbb {R}}^{+}|u$$ is continuous increasing function and $$u(s)\\rightarrow 0$$ as $$s\\rightarrow 0\\}$$.\n\n2. (2)\n\n$$|V(t,\\bar{\\phi },\\bar{\\psi })-V(t,\\hat{\\phi },\\hat{\\psi })|\\le {\\mathrm {L}}(\\Vert \\bar{\\phi }-\\hat{\\phi }\\Vert +\\Vert \\bar{\\psi }-\\hat{\\psi }\\Vert )$$, where $${\\mathrm {L}}>0$$ is a constant.\n\n3. (3)\n\nFor $$t=\\tau _k$$, $$V(t^+,\\phi +I_k(\\phi ),\\psi +I_k(\\psi ))\\le V(t,\\phi ,\\psi )$$; For $$t\\ne \\tau _k$$, $$\\dot{V}_{(2.2)}(t,\\phi ,\\psi )\\le -\\gamma V(t,\\phi ,\\psi )$$, $$\\forall k\\in {\\mathbb {Z}}$$, where $$\\gamma >0$$ is a constant.\n\nMoreover, one assumes that system (6) has a solution that remains in a compact set $$S\\subset D$$. Then system (6) has a unique almost periodic solution which is uniformly asymptotically stable.\n\n### Remark 2\n\nFrom the proof of Lemma 2, it is not difficult to prove that condition (1) of Lemma 2 can be replaced by the following condition:\n\n1. (1)′\n\n$$u(|\\phi (0)-\\psi (0)|_{0})\\le V(t,\\phi ,\\psi )\\le v(\\Vert \\phi -\\psi \\Vert )$$, where $$u, v\\in {\\mathcal {P}}$$ with $${\\mathcal {P}}=\\{u:{\\mathbb {R}}^{+}\\rightarrow {\\mathbb {R}}^{+}|u$$ is continuous increasing function and $$u(s)\\rightarrow 0$$ as $$s\\rightarrow 0\\}$$.\n\n## Permanence\n\nIn this section, we establish a permanence result for system (2).\n\n### Lemma 3\n\n(Lakshmikantham et al. 1989) Assume that $$x\\in PC({\\mathbb {R}})$$ with points of discontinuity at $$t=\\tau _k$$ and is left continuous at $$t=\\tau _k$$ for $$k\\in {\\mathbb {Z}}^+$$, and\n\n$$\\left\\{ \\begin{array}{lll} \\dot{x}(t)\\le f(t,x(t)), &\\quad t\\ne \\tau _k,\\\\ x(\\tau _k^+)\\le I_{k}(x(\\tau _k)), &\\quad k\\in {\\mathbb {Z}}^+, \\end{array} \\right.$$\n(7)\n\nwhere $$f\\in C({\\mathbb {R}}\\times {\\mathbb {R}},{\\mathbb {R}})$$, $$I_k\\in C({\\mathbb {R}},{\\mathbb {R}})$$ and $$I_k(x)$$ is nondecreasing in x for $$k\\in {\\mathbb {Z}}^+$$. Let $$u^*(t)$$ be the maximal solution of the scalar impulsive differential equation\n\n$$\\left\\{ \\begin{array}{lll} \\dot{u}(t)=f(t,u(t)),&\\quad t\\ne \\tau _k,\\\\ u(\\tau _k^+)=I_{k}(u(\\tau _k))\\ge 0, &\\quad k\\in {\\mathbb {Z}}^+,\\\\ u(t_0^+)=u_0 \\end{array} \\right.$$\n(8)\n\nexisting on $$[t_0,\\infty )$$. Then $$x(t_0^+)\\le u_0$$ implies $$x(t)\\le u^*(t)$$ for $$t\\ge t_0$$.\n\n### Remark 3\n\nIf the inequalities (7) in Lemma 3 is reversed and $$u_*(t)$$ is the minimal solution of system (8) existing on $$[t_0,\\infty )$$, then $$x(t_0^+)\\ge u_0$$ implies $$x(t)\\ge u_*(t)$$ for $$t\\ge t_0$$.\n\nFor arbitrary $$a, b>0$$, $$h_k\\ge 0$$, we give the following notations:\n\n\\begin{aligned} \\xi: &= \\ln \\sup _{k\\in {\\mathbb {Z}}}\\frac{1}{1+h_k},\\quad \\alpha :=a-\\xi A,\\quad \\theta :=\\inf _{k\\in {\\mathbb {Z}}}\\tau _k^1,\\quad \\eta :=\\inf _{k\\in {\\mathbb {Z}}}\\bigg \\{\\prod _{j=0}^1\\frac{1}{1+h_{j+k}},1\\bigg \\},\\\\ W(t,s) &=\\left\\{ \\begin{array}{ll} e^{-a(t-s)}, &{}\\tau _{k-1}<s<t<\\tau _{k}; \\\\ \\prod \\nolimits _{j=m}^{k+1}\\frac{1}{1+h_j} e^{-a(t-s)}, \\qquad &{}\\tau _{m-1}<s\\le \\tau _{m}<\\tau _{k}<t\\le \\tau _{k+1}, \\end{array} \\right. \\end{aligned}\n\nwhere A is defined as that in Lemma 1, $$\\tau _k^1=\\tau _{k+1}-\\tau _k$$ is defined as that in Definition 2.\n\n### Lemma 4\n\nAssume that $$a, b>0$$, $$h_k\\ge 0$$, then the following impulsive logistic equation\n\n\\begin{aligned} \\left\\{ \\begin{array}{lll} \\dot{x}(t)=x(t)\\big [ a-bx(t)\\big ],\\quad t\\ne \\tau _k,\\\\ \\Delta x(\\tau _k)=h_{k}x(\\tau _k),\\quad k\\in {\\mathbb {Z}}^+ \\end{array} \\right. \\end{aligned}\n(9)\n\nhas a unique globally asymptotically stable positive almost periodic solution $$x^*$$ , which can be expressed as follows:\n\n$$\\frac{\\alpha }{e^{\\xi A}b}\\le x^*(t)=\\bigg [b\\int _{-\\infty }^{t}W(t,s)\\,{\\mathrm {d}}s\\bigg ]^{-1}\\le \\frac{a}{\\eta b(1-e^{-a\\theta })}.$$\n(10)\n\n### Proof\n\nLet $$u=\\frac{1}{x}$$, then system (9) changes to\n\n$$\\left\\{ \\begin{array}{lll} \\frac{{\\mathrm {d}}u(t)}{{\\mathrm {d}}t}= -au(t)+b,&\\quad t\\ne \\tau _k,\\\\ \\Delta u(\\tau _k)=-\\frac{h_k}{1+h_{k}}u(\\tau _k),&\\quad k\\in {\\mathbb {Z}}^+. \\end{array} \\right.$$\n(11)\n\nTogether with the system (11) we consider the linear system\n\n$$\\left\\{ \\begin{array}{lll} \\frac{{\\mathrm {d}}u(t)}{{\\mathrm {d}}t}= -au(t),&\\quad t\\ne \\tau _k,\\\\ \\Delta u(\\tau _k)=-\\frac{h_k}{1+h_{k}}u(\\tau _k),&\\quad k\\in {\\mathbb {Z}}^+. \\end{array} \\right.$$\n(12)\n\nNow let us consider the equation\n\n$$\\frac{{\\mathrm {d}}u(t)}{{\\mathrm {d}}t}= -au(t),\\quad \\tau _{k-1}< t\\le \\tau _{k}$$\n\nand its solution\n\n$$u(t)=u(s)e^{-a(t-s)},\\quad \\tau _{k-1}<s<t\\le \\tau _{k}.$$\n\nThen from Stamov (2012), the Cauchy matrix of the linear system (12) is\n\n$$W(t,s)=\\left\\{ \\begin{array}{ll} e^{-a(t-s)}, &{}\\tau _{k-1}<s<t<\\tau _{k}; \\\\ \\prod \\nolimits _{j=m}^{k+1}\\frac{1}{1+h_j} e^{-a(t-s)}, \\quad &{}\\tau _{m-1}<s\\le \\tau _{m}<\\tau _{k}<t\\le \\tau _{k+1} \\end{array} \\right.$$\n\nand the solution of system (12) is in the form\n\n$$u(t;t_{0};u(t_{0}))=W(t,t_{0}) u(t_{0}),\\quad t_{0}\\in {\\mathbb {R}}.$$\n\nTherefore, system (11) has a solution\n\n$$u(t;t_{0};u(t_{0}))=W(t,t_0)u(t_0)+b\\int _{t_0}^{t}W(t,s)\\,{\\mathrm {d}}s.$$\n\nLetting $$t_0\\rightarrow -\\infty$$ in the above equation ($$W(t,t_0)u(t_0)\\rightarrow 0$$), then by Stamov (2012) we have\n\n$$u(t)=b\\int _{-\\infty }^{t}W(t,s)\\,{\\mathrm {d}}s$$\n\nis a solution of system (11) and is almost periodic. Then system (9) has a almost periodic solution $$x^*(t)$$ which can be expressed by (10). By Lemma 1, we have from (10) that\n\n\\begin{aligned} x^*(t) \\ge \\bigg [b\\int _{-\\infty }^{t}e^{i(s,t)\\xi }e^{-a(t-s)}\\,{\\mathrm {d}}s\\bigg ]^{-1} \\ge \\bigg [b\\int _{-\\infty }^{t}e^{\\xi A}e^{-\\alpha (t-s)}\\,{\\mathrm {d}}s\\bigg ]^{-1} =\\frac{\\alpha }{e^{\\xi A}b}. \\end{aligned}\n\nOn the other hand,\n\n\\begin{aligned} x^*(t) \\le \\bigg [b\\int _{t-\\theta }^{t}W(t,s)\\,{\\mathrm {d}}s\\bigg ]^{-1} \\le \\bigg [b\\int _{t-\\theta }^{t}\\eta e^{-a(t-s)}\\,{\\mathrm {d}}s\\bigg ]^{-1} =\\frac{a}{\\eta b(1-e^{-a\\theta })}. \\end{aligned}\n\nNext, we shall prove that the uniqueness and stability of $$x^*(t)$$ of system (9). Suppose that x(t) is another positive solution of system (9). Define a function\n\n$$V(t)=|\\ln x^*(t)-\\ln x(t)|, \\quad \\forall t\\in {\\mathbb {R}}.$$\n\nFor $$t\\ne \\tau _k$$, $$k\\in {\\mathbb {Z}}^+$$, calculating the upper right derivative of V(t) along the solution of system (9), we have\n\n$$D^+V(t)={\\mathrm {sgn}}[x^*(t)-x(t)]\\bigg [\\frac{\\dot{x}^*(t)}{x^*(t)}-\\frac{\\dot{x}(t)}{x(t)}\\bigg ] =-b|x^*(t)-x(t)|.$$\n(13)\n\nFor $$t=\\tau _k$$, $$k\\in {\\mathbb {Z}}^+$$, we have\n\n\\begin{aligned} V(\\tau _k^+) &= |\\ln x^*(\\tau _k^+)-\\ln x(\\tau _k^+)|\\\\&= \\left| \\ln \\frac{(1+h_{k})x^*(\\tau _k)}{(1+h_{k})x(\\tau _k)}\\right| =|\\ln x^*(\\tau _k)-\\ln x(\\tau _k)|=V(\\tau _k). \\end{aligned}\n\nTherefore, V is non-increasing. Integrating (13) from 0 to t leads to\n\n$$V(t)+b\\int _{0}^t|x(s)-x^*(s)|\\,{\\mathrm {d}}s \\le V(0)<+\\infty , \\quad \\forall t\\ge 0,$$\n\nthat is,\n\n$$\\int _{0}^{+\\infty }|x(s)-x^*(s)|\\,{\\mathrm {d}}s<+\\infty ,$$\n\nwhich implies that\n\n$$\\lim _{s\\rightarrow +\\infty }|x(s)-x^*(s)|=0.$$\n\nThus, the almost periodic solution of system (9) is globally asymptotically stable. This completes the proof.\n\n### Lemma 5\n\nAssume that $$a, b>0$$, $$h_k\\ge 0$$, then every solution x of the following system with delay\n\n$$\\left\\{ \\begin{array}{lll} \\dot{x}(t)\\le x(t)\\big [ a-bx(t-\\tau )\\big ],\\quad t\\ne \\tau _k,\\\\ \\Delta x(\\tau _k)= h_{k}x(\\tau _k),\\quad k\\in {\\mathbb {Z}}^+ \\end{array} \\right.$$\n(14)\n\nsatisfies\n\n$$\\lim \\sup _{t\\rightarrow \\infty }x(t)\\le M:=\\frac{a}{\\eta B(1-e^{-a\\theta })},$$\n\nwhere $$B=\\inf _{t\\in {\\mathbb {R}}}b\\prod _{\\tau _k\\in [t-\\tau ,t)}(1+h_k)^{-1}e^{-a\\tau }$$, $$\\theta :=\\inf \\nolimits_{k\\in {\\mathbb {Z}}}\\tau_k^1$$ and $$\\eta :=\\inf \\nolimits _{k\\in {\\mathbb {Z}}}\\prod _{j=1}^2\\frac{1}{1+h_{j+k}}$$.\n\n### Proof\n\nFrom system (14), we have\n\n\\begin{aligned} \\left\\{ \\begin{array}{lll} \\dot{x}(t)\\le ax(t),\\quad t\\ne \\tau _k,\\\\ \\Delta x(\\tau _k)=h_{k}x(\\tau _k),\\quad k\\in {\\mathbb {Z}}^+ \\end{array} \\right. \\end{aligned}\n\nis equivalent to\n\n\\begin{aligned} \\left\\{ \\begin{array}{lll} \\frac{{\\mathrm {d}}}{{\\mathrm {dt}}}[x(t)e^{-at}]\\le 0,\\quad t\\ne \\tau _k,\\\\ \\Delta x(\\tau _k)=h_{k}x(\\tau _k),\\quad k\\in {\\mathbb {Z}}^+. \\end{array} \\right. \\end{aligned}\n(15)\n\nFor some $$t\\in [0,+\\infty )$$ and $$t\\ne \\tau _k$$, $$k\\in {\\mathbb {Z}}^+$$, consider interval $$[t-\\tau ,t)$$. Assume that $$\\tau _1<\\tau _2<\\cdots <\\tau _j$$ are the impulse points in $$[t-\\tau ,t)$$. Integrating the first inequality of system (15) from $$t-\\tau$$ to $$\\tau _1$$ leads to\n\n$$x(\\tau _1)e^{-a\\tau _1}\\le x(t-\\tau )e^{-a(t-\\tau )}.$$\n\nIntegrating the first inequality of system (15) from $$\\tau _{1}$$ to $$\\tau _2$$ leads to\n\n$$x(\\tau _{2})e^{-a\\tau _{2}}\\le x(\\tau _{1}^+)e^{-a\\tau _{1}}=(1+h_{1})x(\\tau _{1})e^{-a\\tau _{1}} \\le (1+h_{1})x(t-\\tau )e^{-a(t-\\tau )}.$$\n\nIntegrating the first inequality of system (15) from $$\\tau _{2}$$ to $$\\tau _3$$ leads to\n\n$$x(\\tau _{3})e^{-a\\tau _{3}}\\le x(\\tau _{2}^+)e^{-a\\tau _{2}}=(1+h_{2})x(\\tau _{2})e^{-a\\tau _{2}} \\le (1+h_{1})(1+h_{2})x(t-\\tau )e^{-a(t-\\tau )}.$$\n\nRepeating the above process, integrating the first inequality of system (15) from $$\\tau _j$$ to t leads to\n\n$$x(t)e^{-at}\\le x(\\tau _j^+)e^{-a\\tau _j}=(1+h_j)x(\\tau _j)e^{-a\\tau _j}\\le \\prod _{\\tau _k\\in [t-\\tau ,t)}(1+h_k)x(t-\\tau )e^{-a(t-\\tau )}.$$\n\nThen\n\n$$x(t-\\tau )\\ge \\prod _{\\tau _k\\in [t-\\tau ,t)}(1+h_k)^{-1}e^{-a\\tau }x(t).$$\n(16)\n\nSubstituting (16) into system (14) leads to\n\n\\begin{aligned} \\left\\{ \\begin{array}{lll} \\dot{x}(t)\\le x(t)\\big [ a-Bx(t)\\big ],\\quad t\\ne \\tau _k,\\\\ \\Delta x(\\tau _k)=h_{k}x(\\tau _k),\\quad k\\in {\\mathbb {Z}}^+. \\end{array} \\right. \\end{aligned}\n\nConsider the auxiliary system\n\n\\begin{aligned} \\left\\{ \\begin{array}{lll} \\dot{z}(t)=z(t)\\big [ a-Bz(t) \\big ],\\quad t\\ne \\tau _k,\\\\ z(\\tau _k^+)=(1+h_{k})z(\\tau _k),\\quad k\\in {\\mathbb {Z}}^+. \\end{array} \\right. \\end{aligned}\n(17)\n\nBy Lemma 3, $$x(t)\\le z(t)$$, where z(t) is the solution of system (17) with $$z(0^+)=x(0^+)$$. By Lemma 4, system (17) has a unique globally asymptotically stable positive almost periodic solution $$z^*$$ which can be expressed as follows:\n\n\\begin{aligned} z^*(t)=\\bigg [B\\int _{-\\infty }^{t}W(t,s)\\,{\\mathrm {d}}s\\bigg ]^{-1} \\le \\bigg [B\\int _{t-\\theta }^{t}W(t,s)\\,{\\mathrm {d}}s\\bigg ]^{-1} \\le \\frac{a}{\\eta B(1-e^{-a\\theta })}:=M. \\end{aligned}\n\nThen for any constant $$\\epsilon >0$$, there exists $$T_1>0$$ such that $$x(t)\\le z(t)<z^*(t)+\\epsilon \\le M+\\epsilon$$ for $$t>T_1$$. So\n\n$$\\lim \\sup _{t\\rightarrow \\infty }x(t)\\le M.$$\n\nThis completes the proof. $$\\square$$\n\n### Lemma 6\n\nAssume that $$a, b>0$$, $$h_k\\ge 0$$, then every solution x of the following system with delay\n\n\\begin{aligned} \\left\\{ \\begin{array}{lll} \\dot{x}(t)\\ge x(t)\\big [ a-bx(t-\\tau )\\big ],\\quad t\\ne \\tau _k,\\\\ \\Delta x(\\tau _k)=h_{k}x(\\tau _k),\\quad k\\in {\\mathbb {Z}}^+ \\end{array} \\right. \\end{aligned}\n(18)\n\nsatisfies\n\n$$\\lim \\inf _{t\\rightarrow \\infty }x(t)\\ge N:=\\frac{a-\\xi A}{e^{\\xi A}D},$$\n\nwhere $$D=\\sup _{t\\in {\\mathbb {R}}}b\\prod _{\\tau _k\\in [t-\\tau ,t)}(1+h_k)^{-1}e^{-(a-bM)\\tau }$$, $$\\xi :=\\ln \\sup \\nolimits _{k\\in {\\mathbb {Z}}}\\frac{1}{1+h_k}$$ and A is defined as that in Lemma 1.\n\n### Proof\n\nAccording to Lemma 5, there exist $$\\epsilon >0$$ and $$T_2>0$$ such that\n\n$$x(t)\\le M+\\epsilon \\quad \\text { for } t\\ge T_{2}.$$\n\nFrom system (18), we have\n\n\\begin{aligned} \\left\\{ \\begin{array}{lll} \\dot{x}(t)\\ge [a-b(M+\\epsilon )]x(t),\\quad t\\ne \\tau _k,\\quad t\\ge T_{2},\\\\ \\Delta x(\\tau _k)=h_{k}x(\\tau _k),\\quad k\\in {\\mathbb {Z}}^+ \\end{array} \\right. \\end{aligned}\n\nis equivalent to\n\n\\begin{aligned} \\left\\{ \\begin{array}{lll} \\frac{{\\mathrm {d}}}{\\mathrm {dt}}[x(t)e^{-[a-b(M+\\epsilon )]t}]\\ge 0,\\quad t\\ne \\tau _k\\quad t\\ge T_{2},\\\\ \\Delta x(\\tau _k)=h_{k}x(\\tau _k),\\quad k\\in {\\mathbb {Z}}^+. \\end{array} \\right. \\end{aligned}\n\nSimilar to the argument as that in (16), we have\n\n$$bx(t-\\tau )\\le b\\prod _{\\tau _k\\in [t-\\tau ,t)}(1+h_k)^{-1}e^{-[a-b(M+\\epsilon )]\\tau }x(t):=D_\\epsilon x(t),\\quad t\\ge T_{2}.$$\n(19)\n\nSubstituting (19) into system (18) leads to\n\n\\begin{aligned} \\left\\{ \\begin{array}{lll} \\dot{x}(t)\\ge x(t)\\big [ a-D_\\epsilon x(t)\\big ],\\quad t\\ne \\tau _k,\\quad t\\ge T_{2},\\\\ \\Delta x(\\tau _k)=h_{k}x(\\tau _k),\\quad k\\in {\\mathbb {Z}}^+. \\end{array} \\right. \\end{aligned}\n\nConsider the auxiliary system\n\n\\begin{aligned} \\left\\{ \\begin{array}{lll} \\dot{z}(t)=z(t)\\big [ a-D_\\epsilon z(t) \\big ],\\quad t\\ne \\tau _k,\\quad t\\ge T_{2},\\\\ z(\\tau _k^+)=(1+h_{k})z(\\tau _k),\\quad k\\in {\\mathbb {Z}}^+. \\end{array} \\right. \\end{aligned}\n(20)\n\nBy Remark 3, $$x(t)\\ge z(t)$$, where z(t) is the solution of system (20) with $$z(0^+)=x(0^+)$$. By Lemma 4, system (20) has a unique globally asymptotically stable positive almost periodic solution $$z^*$$ which can be expressed as follows:\n\n\\begin{aligned} z^*(t)=\\bigg [D_\\epsilon \\int _{-\\infty }^{t}W(t,s)\\,{\\mathrm {d}}s\\bigg ]^{-1} \\ge \\bigg [D_\\epsilon \\int _{t-\\theta }^{t}W(t,s)\\,{\\mathrm {d}}s\\bigg ]^{-1} \\ge \\frac{a-\\xi A}{e^{\\xi A}D_\\epsilon }. \\end{aligned}\n\nLetting $$\\epsilon \\rightarrow 0$$ in the above inequality leads to\n\n$$z^*(t) \\ge \\frac{a-\\xi A}{e^{\\xi A}D}:=N.$$\n\nSimilar to the argument as that in Lemma 5, it follows that\n\n$$\\lim \\inf _{t\\rightarrow \\infty }x(t)\\ge N.$$\n\nThis completes the proof. $$\\square$$\n\n### Remark 4\n\nWhen $$h_{ik}(i=1,2)\\equiv 0$$ in systems (14) and (18), then Lemmas 5, 6 change to the corresponding results in Nakata and Muroya (2010). So Lemmas  5, 6 extend the corresponding result in Nakata and Muroya (2010).\n\nLet\n\n$$\\eta _i:=\\inf _{k\\in {\\mathbb {Z}}}\\prod _{j=0}^1\\frac{1}{1+h_{i(j+k)}},\\quad \\xi _i:=\\ln \\sup _{k\\in {\\mathbb {Z}}}\\frac{1}{1+h_{ik}},\\quad i=1,2.$$\n\n### Proposition 1\n\nEvery solution $$(x_1,x_2)^T$$ of system (2) satisfies\n\n$$\\lim \\sup \\limits _{t\\rightarrow \\infty }x_i(t)\\le M_i,\\quad i=1,2,$$\n\nwhere $$M_1$$ and $$M_2$$ are defined as that in (21) and (22), respectively.\n\n### Proof\n\nFrom system (1), we have\n\n\\begin{aligned} \\left\\{ \\begin{array}{lll} \\dot{x}_{1}(t)\\le x_{1}(t)\\big [r_1^u -a_{11}^lx_{1}(t-\\tau _{11})\\big ],\\quad t\\ne \\tau _k,\\\\ x_1(\\tau _k^+)=(1+h_{1k})x_1(\\tau _k),\\quad k\\in {\\mathbb {Z}}^+, \\end{array} \\right. \\end{aligned}\n\nwhere $$r_1^u:=\\sup _{t\\in {\\mathbb {R}}}\\big |\\frac{a_{10}(t)}{m_{1}(t)}-c_{1}(t)\\big |$$. By Lemma  5, we have\n\n$$\\lim \\sup _{t\\rightarrow \\infty }x_1(t)\\le M_1:=\\frac{r_1^u}{\\eta _1 B_1(1-e^{-r_1^u\\theta })},$$\n(21)\n\nwhere $$B_1=\\inf _{t\\in {\\mathbb {R}}}a_{11}^l\\prod _{\\tau _k\\in [t-\\tau _{11},t)}(1+h_{1k})^{-1}e^{-r_1^u\\tau _{11}}$$. Similarly, ones obtain that\n\n$$\\lim \\sup _{t\\rightarrow \\infty }x_2(t)\\le M_2:=\\frac{r_2^u}{\\eta _2 B_2(1-e^{-r_2^u\\theta })},$$\n(22)\n\nwhere $$r_2^u:=\\sup _{t\\in {\\mathbb {R}}}\\big |\\frac{a_{20}(t)}{m_{2}(t)}-c_{2}(t)\\big |$$, $$B_2=\\inf _{t\\in {\\mathbb {R}}}a_{22}^l\\prod _{\\tau _k\\in [t-\\tau _{22},t)}(1+h_{2k})^{-1}e^{-r_2^u\\tau _{22}}$$. This completes the proof. $$\\square$$\n\n### Proposition 2\n\nLet $$N_1$$ and $$N_2$$ are defined as that in (23) and (24), respectively. Then every solution $$(x_1,x_2)^T$$ of system (2) satisfies\n\n$$\\lim \\inf \\limits _{t\\rightarrow \\infty }x_i(t)\\ge N_i,\\quad i=1,2,$$\n\nif the following condition holds:\n\n$$(H_{1})$$ :\n\n$$r_1^l:=\\inf _{t\\in {\\mathbb {R}}}\\big [\\frac{a_{10}(t)}{M_1+m_{1}(t)} -a_{12}(t)M_2-c_{1}(t)\\big ]\\ge \\xi _1A$$, $$r_2^l:=\\inf _{t\\in {\\mathbb {R}}}\\big [\\frac{a_{20}(t)}{M_2+m_{2}(t)} -a_{21}(t)M_1-c_{2}(t)\\big ]\\ge \\xi _2A.$$\n\n### Proof\n\nAccording to Proposition 1 and $$(H_1)$$, there exist $$\\epsilon >0$$ and $$T_3>0$$ such that\n\n\\begin{aligned}&x_i(t)\\le M_i+\\epsilon \\quad \\text { for } t\\ge T_{3},\\quad i=1,2,\\\\&r_1^l(\\epsilon ):=\\inf _{t\\in {\\mathbb {R}}}\\bigg [\\frac{a_{10}(t)}{(M_1+\\epsilon )+m_{1}(t)} -a_{12}(t)(M_2+\\epsilon )-c_{1}(t)\\bigg ]\\ge \\xi _1A,\\\\&r_2^l(\\epsilon ):=\\inf _{t\\in {\\mathbb {R}}}\\bigg [\\frac{a_{20}(t)}{(M_2+\\epsilon )+m_{2}(t)} -a_{21}(t)(M_1+\\epsilon )-c_{2}(t)\\bigg ]\\ge \\xi _2A. \\end{aligned}\n\nFrom system (1), we have\n\n\\begin{aligned} \\left\\{ \\begin{array}{lll} \\dot{x}_{1}(t)\\ge x_{1}(t)\\big [r_{1}^l(\\epsilon ) -a_{11}^ux_{1}(t-\\tau _{11})\\big ],\\quad t\\ne \\tau _k, \\; t>T_3,\\\\ x_1(\\tau _k^+)=(1+h_{1k})x_1(\\tau _k),\\quad k\\in {\\mathbb {Z}}^+. \\end{array} \\right. \\end{aligned}\n\nBy Lemma 6 and the arbitrariness of $$\\epsilon$$, one has\n\n$$\\lim \\inf _{t\\rightarrow \\infty }x_1(t)\\ge N_1:=\\frac{r_{1}^l-\\xi _1 A}{e^{\\xi _1 A}D_1},$$\n(23)\n\nwhere $$D_1:=\\sup _{t\\in {\\mathbb {R}}}a_{11}^u\\prod _{\\tau _k\\in [t-\\tau _{11},t)}(1+h_{1k})^{-1}e^{-(r_1^l-a_{11}^uM_1)\\tau _{11}}$$. Similarly, we have\n\n$$\\lim \\inf _{t\\rightarrow \\infty }x_2(t)\\ge N_2:=\\frac{r_{2}^l-\\xi _2 A}{e^{\\xi _2 A}D_2},$$\n(24)\n\nwhere $$D_2:=\\sup _{t\\in {\\mathbb {R}}}a_{22}^u\\prod _{\\tau _k\\in [t-\\tau _{22},t)}(1+h_{2k})^{-1}e^{-(r_2^l-a_{22}^uM_2)\\tau _{22}}$$. This completes the proof. $$\\square$$\n\n### Remark 5\n\nIn view of $$(H_1)$$ in Proposition 2, the values of impulse coefficients $$h_{ik}\\,(i=1,2)$$ and the number of the impulse points $$\\tau _k$$ in each interval of length 1 have negative effect on the permanence of system (2).\n\nBy Propositions 1, 2, we have\n\n### Theorem 1\n\nAssume that $$(H_1)$$ holds, then system (2) is permanent.\n\n### Remark 6\n\nTheorem 1 is a permanence result of system (2) without (F). So Theorem 1 improves the corresponding result in Zhang et al. (2012). Further, Theorem 1 provides a possible and effective method to study the permanence of the models with impulsive perturbations and pure-delays in biological populations.\n\n### Remark 7\n\nFrom the proof of Propositions 1, 2, we know that under the conditions of Theorem 1, the set $$S=\\{(x_1,x_2)^T\\in {\\mathbb {R}}^2:N_i\\le x_i\\le M_i, i=1,2\\}$$ is an invariant set of system (2).\n\n## Almost periodic solution\n\nThe main result of this paper concerns the existence of a unique uniformly asymptotically stable positive almost periodic solution for system (2).\n\nFor convenience, we introduce some notations as follows:\n\n\\begin{aligned} \\alpha _{1} &= {} \\frac{a_{10}^{l}N_{1}}{\\big (M_{1}+m_{1}^{u}\\big )^{2}}+a_{11}^{l}N_{1} -\\bigg (\\frac{\\sqrt{\\tau _{10}}a_{10}^{u}M_{1}}{\\big (N_{1}+m_{1}^{l}\\big )^{2}}\\bigg )^{2} -\\frac{(\\tau _{10}+\\tau _{11})a_{10}^{u}a_{11}^{u}M_{1}^{2}}{\\big (N_{1}+m_{1}^{l}\\big )^{2}} -\\tau _{11}a_{11}^{u2}M_{1}^{2},\\\\ \\alpha _{2} &= \\frac{a_{20}^{l}N_{2}}{\\big (M_{2}+m_{2}^{u}\\big )^{2}}+a_{22}^{l}N_{2} -\\bigg [\\frac{\\sqrt{\\tau _{20}}a_{20}^{u}M_{2}}{\\big (N_{2}+m_{2}^{l}\\big )^{2}}\\bigg ]^{2} -\\frac{(\\tau _{20}+\\tau _{22})a_{20}^{u}a_{22}^{u}M_{2}^{2}}{\\big (N_{2}+m_{2}^{l}\\big )^{2}} -\\tau _{22}a_{22}^{u2}M_{2}^{2},\\\\ \\beta _{1} &= \\frac{\\tau _{20}a_{20}^{u}a_{21}^{u}M_{1}M_{2}}{\\big (N_{2}+m_{2}^{l}\\big )^{2}}+\\tau _{22}a_{21}^{u}a_{22}^{u}M_{1}M_{2} +a_{21}^{u}M_{1},\\\\ \\beta _{2} &= \\frac{\\tau _{10}a_{10}^{u}a_{12}^{u}M_{1}M_{2}}{\\big (N_{1}+m_{1}^{l}\\big )^{2}} +\\tau _{11}a_{11}^{u}a_{12}^{u}M_{1}M_{2}+a_{12}^{u}M_{2}, \\end{aligned}\n\nwhere $$M_1$$, $$M_2$$, $$N_1$$ and $$N_2$$ are defined as that in “Permanence” section.\n\n### Theorem 2\n\nAssume that $$(H_1)$$ holds. Suppose further that\n\n$$(H_2)$$ :\n\nThere exist two positive constants $$\\lambda _{1}$$ and $$\\lambda _{2}$$ such that $$\\lambda _{1}\\alpha _{1}>\\lambda _{2}\\beta _{1}$$ and $$\\lambda _{2}\\alpha _{2}>\\lambda _{1}\\beta _{2}$$.\n\nThen system (2) admits a unique uniformly asymptotically stable almost periodic solution.\n\n### Proof\n\nLet $$x_{i}(t)=e^{z_{i}(t)}$$, $$i=1, 2$$, then system (2) is transformed into\n\n\\begin{aligned} \\left\\{ \\begin{array}{lll} \\dot{z}_{1}(t)=\\frac{a_{10}(t)}{e^{z_{1}(t-\\tau _{10})}+m_{1}(t)} -a_{11}(t)e^{z_{1}(t-\\tau _{11})}-a_{12}(t)e^{z_{2}(t-\\tau _{12})}-c_{1}(t),\\\\ \\dot{z}_{2}(t)=\\frac{a_{20}(t)}{e^{z_{2}(t-\\tau _{20})}+m_{2}(t)}-a_{21}(t)e^{z_{1}(t-\\tau _{21})} -a_{22}(t)e^{z_{2}(t-\\tau _{22})}-c_{2}(t),\\quad t\\ne \\tau _k,\\\\ e^{z_1(\\tau _k^+)}=(1+h_{1k})e^{z_1(\\tau _k)},\\\\ e^{z_2(\\tau _k^+)}=(1+h_{2k})e^{z_2(\\tau _k)},\\quad k\\in {\\mathbb {Z}}^+. \\end{array} \\right. \\end{aligned}\n(25)\n\nSuppose that $$Z(t)=(z_{1}(t),z_{2}(t))^{T}$$ and $$Z^{*}(t)=(z_{1}^{*}(t),z_{2}^{*}(t))^{T}$$ are any two solutions of system (25). Consider the product system of system (25)\n\n\\begin{aligned} \\left\\{ \\begin{array}{lll} \\dot{z}_{1}(t)=\\frac{a_{10}(t)}{e^{z_{1}(t-\\tau _{10})}+m_{1}(t)} -a_{11}(t)e^{z_{1}(t-\\tau _{11})}-a_{12}(t)e^{z_{2}(t-\\tau _{12})}-c_{1}(t),\\\\ \\dot{z}_{2}(t)=\\frac{a_{20}(t)}{e^{z_{2}(t-\\tau _{20})}+m_{2}(t)}-a_{21}(t)e^{z_{1}(t-\\tau _{21})} -a_{22}(t)e^{z_{2}(t-\\tau _{22})}-c_{2}(t),\\\\ \\dot{z}_{1}^*(t)=\\frac{a_{10}(t)}{e^{z_{1}^*(t-\\tau _{10})}+m_{1}(t)} -a_{11}(t)e^{z_{1}^*(t-\\tau _{11})}-a_{12}(t)e^{z_{2}^*(t-\\tau _{12})}-c_{1}(t),\\\\ \\dot{z}_{2}^*(t)=\\frac{a_{20}(t)}{e^{z_{2}^*(t-\\tau _{20})}+m_{2}(t)}-a_{21}(t)e^{z_{1}^*(t-\\tau _{21})} -a_{22}(t)e^{z_{2}^*(t-\\tau _{22})}-c_{2}(t),\\quad t\\ne \\tau _k,\\\\ e^{z_1(\\tau _k^+)}=(1+h_{1k})e^{z_1(\\tau _k)},\\\\ e^{z_2(\\tau _k^+)}=(1+h_{2k})e^{z_2(\\tau _k)},\\\\ e^{z_1^*(\\tau _k^+)}=(1+h_{1k})e^{z_1^*(\\tau _k)},\\\\ e^{z_2^*(\\tau _k^+)}=(1+h_{2k})e^{z_2^*(\\tau _k)},\\quad k\\in {\\mathbb {Z}}^+. \\end{array} \\right. \\end{aligned}\n(26)\n\nSet $$S_1=\\{\\phi =(z_{1t},z_{2t})^{T}\\in C([-\\tau ,0],{\\mathbb {R}}^{2}):\\ln N_i\\le z_{it}\\le \\ln M_i, t\\in {\\mathbb {R}}^{+}, i=1,2\\}$$, which is an invariant set of system (26) directly from Remark 7.\n\nConstruct a Lyapunov functional $$V(t)=V(t,\\phi ,\\psi )=V\\big (t,(z_{1t},z_{2t})^{T},(z_{1t}^{*},z_{2t}^{*})^{T}\\big )$$ defined on $${\\mathbb {R}}^{+}\\times S_1\\times S_1$$ as follows:\n\n$$V(t,\\phi ,\\psi )= V_{1}(t,\\phi ,\\psi )+V_{2}(t,\\phi ,\\psi )+V_{3}(t,\\phi ,\\psi )+V_{4}(t,\\phi ,\\psi ),$$\n\nwhere\n\n\\begin{aligned} V_{1}(t,\\phi ,\\psi ) &= \\lambda _{1}|z_{1}(t)-z_{1}^{*}(t)|+\\lambda _{2}|z_{2}(t)-z_{2}^{*}(t)|,\\\\ V_{2}(t,\\phi ,\\psi )&= \\lambda _{1}\\bigg (\\frac{a_{10}^{u}M_{1}}{\\big (N_{1}+m_{1}^{l}\\big )^{2}}\\bigg )^{2} \\int _{-2\\tau _{10}}^{-\\tau _{10}}\\int _{t+s}^{t}\\big |z_{1}(r)-z_{1}^{*}(r)\\big |\\,{\\mathrm {d}}r\\,{\\mathrm {d}}s\\\\&\\quad+\\,\\lambda _{1}\\frac{a_{10}^{u}a_{11}^{u}M_{1}^{2}}{\\big (N_{1}+m_{1}^{l}\\big )^{2}} \\int _{-\\tau _{11}-\\tau _{10}}^{-\\tau _{11}}\\int _{t+s}^{t}\\big |z_{1}(r)-z_{1}^{*}(r)\\big |\\,{\\mathrm {d}}r\\,{\\mathrm {d}}s\\\\&\\quad+\\,\\lambda _{1}\\frac{a_{10}^{u}a_{11}^{u}M_{1}^{2}}{\\big (N_{1}+m_{1}^{l}\\big )^{2}}\\int _{-\\tau _{10}-\\tau _{11}}^{-\\tau _{10}}\\int _{t+s}^{t}\\big |z_{1}(r)-z_{1}^{*}(r)\\big |\\,{\\mathrm {d}}r\\,{\\mathrm {d}}s\\\\&\\quad+\\,\\lambda _{1}a_{11}^{u2}M_{1}^{2}\\int _{-2\\tau _{11}}^{-\\tau _{11}}\\int _{t+s}^{t}\\big |z_{1}(r)-z_{1}^{*}(r)\\big |\\,{\\mathrm {d}}r\\,{\\mathrm {d}}s\\\\&\\quad+\\,\\lambda _{2}\\frac{a_{20}^{u}a_{21}^{u}M_{1}M_{2}}{\\big (N_{2}+m_{2}^{l}\\big )^{2}}\\int _{-\\tau _{21}-\\tau _{20}}^{-\\tau _{21}}\\int _{t+s}^{t}\\big |z_{1}(r)-z_{1}^{*}(r)\\big |\\,{\\mathrm {d}}r\\,{\\mathrm {d}}s\\\\&\\quad+\\,\\lambda _{2}a_{21}^{u}a_{22}^{u}M_{1}M_{2}\\int _{-\\tau _{21}-\\tau _{22}}^{-\\tau _{21}}\\int _{t+s}^{t}\\big |z_{1}(r)-z_{1}^{*}(r)\\big |\\,{\\mathrm {d}}r\\,{\\mathrm {d}}s,\\\\ V_{3}(t,\\phi ,\\psi )&= \\lambda _{1}\\frac{a_{10}^{u}a_{12}^{u}M_{1}M_{2}}{\\big (N_{1}+m_{1}^{l}\\big )^{2}} \\int _{-\\tau _{12}-\\tau _{10}}^{-\\tau _{12}}\\int _{t+s}^{t}\\big |z_{2}(r)-z_{2}^{*}(r)\\big |\\,{\\mathrm {d}}r\\,{\\mathrm {d}}s\\\\&\\quad+\\,\\lambda _{1}a_{11}^{u}a_{12}^{u}M_{1}M_{2}\\int _{-\\tau _{12}-\\tau _{11}}^{-\\tau _{12}}\\int _{t+s}^{t}\\big |z_{2}(r)-z_{2}^{*}(r)\\big |\\,{\\mathrm {d}}r\\,{\\mathrm {d}}s\\\\&\\quad+\\,\\lambda _{2}\\bigg (\\frac{a_{20}^{u}M_{2}}{\\big (N_{2}+m_{2}^{l}\\big )^{2}}\\bigg )^{2}\\int _{-2\\tau _{20}}^{-\\tau _{20}}\\int _{t+s}^{t}\\big |z_{2}(r)-z_{2}^{*}(r)\\big |\\,{\\mathrm {d}}r\\,{\\mathrm {d}}s\\\\&\\quad+\\,\\lambda _{2}\\frac{a_{20}^{u}a_{22}^{u}M_{2}^{2}}{\\big (N_{2}+m_{2}^{l}\\big )^{2}}\\int _{-\\tau _{22}-\\tau _{20}}^{-\\tau _{22}}\\int _{t+s}^{t}\\big |z_{2}(r)-z_{2}^{*}(r)\\big |\\,{\\mathrm {d}}r\\,{\\mathrm {d}}s\\\\&\\quad+\\,\\lambda _{2}\\frac{a_{20}^{u}a_{22}^{u}M_{2}^{2}}{\\big (N_{2}+m_{2}^{l}\\big )^{2}}\\int _{-\\tau _{20}-\\tau _{22}}^{-\\tau _{20}}\\int _{t+s}^{t}\\big |z_{2}(r)-z_{2}^{*}(r)\\big |\\,{\\mathrm {d}}r\\,{\\mathrm {d}}s\\\\&\\quad+\\,\\lambda _{2}a_{22}^{u2}M_{2}^{2}\\int _{-2\\tau _{22}}^{-\\tau _{22}}\\int _{t+s}^{t}\\big |z_{2}(r)-z_{2}^{*}(r)\\big |\\,{\\mathrm {d}}r\\,{\\mathrm {d}}s,\\\\ V_{4}(t,\\phi ,\\psi )&= \\lambda _{2}a_{21}^{u}M_{1}\\int _{t-\\tau _{21}}^{t}\\big |z_{1}(s)-z_{1}^{*}(s)\\big |\\,{\\mathrm {d}}s +\\lambda _{1}a_{12}^{u}M_{2}\\int _{t-\\tau _{12}}^{t}\\big |z_{2}(s)-z_{2}^{*}(s)\\big |\\,{\\mathrm {d}}s. \\end{aligned}\n\nBy the definitions of $$S_1$$ and V, there is some large enough positive constant K such that\n\n$$V(t,\\phi ,\\psi )\\le K.$$\n\nSimilar to the argument as that in Zhang et al. (2012), we have\n\n$$V(t,\\phi ,\\psi )\\ge \\underline{\\lambda }|\\phi (0)-\\psi (0)|_{0},$$\n(27)\n\nwhere $$\\underline{\\lambda }:=\\min \\{\\lambda _{1},\\lambda _{2}\\}$$,\n\n$$V(t,\\phi ,\\psi )\\le \\overline{\\lambda }\\Vert \\phi -\\psi \\Vert ,$$\n(28)\n\nwhere\n\n\\begin{aligned} \\overline{\\lambda }:&= \\lambda _{1}+\\lambda _{2}+2\\lambda _{1}\\tau ^{2}\\bigg (\\frac{a_{10}^{u}M_{1}}{\\big (N_{1}+m_{1}^{l}\\big )^{2}}\\bigg )^{2} +2\\lambda _{1}\\tau ^{2}\\frac{a_{10}^{u}a_{11}^{u}M_{1}^{2}}{\\big (N_{1}+m_{1}^{l}\\big )^{2}}\\\\&\\quad+\\,2\\lambda _{1}\\tau ^{2}\\frac{a_{10}^{u}a_{11}^{u}M_{1}^{2}}{\\big (N_{1}+m_{1}^{l}\\big )^{2}}+2\\lambda _{1}\\tau ^{2}a_{11}^{u2}M_{1}^{2} +2\\lambda _{2}\\tau ^{2}\\frac{a_{20}^{u}a_{21}^{u}M_{1}M_{2}}{\\big (N_{2}+m_{2}^{l}\\big )^{2}}\\\\&\\quad+\\,2\\lambda _{2}\\tau ^{2}a_{21}^{u}a_{22}^{u}M_{1}M_{2} +2\\lambda _{1}\\tau ^{2}\\frac{a_{10}^{u}a_{12}^{u}M_{1}M_{2}}{\\big (N_{1}+m_{1}^{l}\\big )^{2}} +2\\lambda _{1}\\tau ^{2}a_{11}^{u}a_{12}^{u}M_{1}M_{2}\\\\&\\quad+\\,2\\lambda _{2}\\tau ^{2}\\bigg (\\frac{a_{20}^{u}M_{2}}{\\big (N_{2}+m_{2}^{l}\\big )^{2}}\\bigg )^{2} +2\\lambda _{2}\\tau ^{2}\\frac{a_{20}^{u}a_{22}^{u}M_{2}}{\\big (N_{2}+m_{2}^{l}\\big )^{2}} +2\\lambda _{2}\\tau ^{2}\\frac{a_{20}^{u}a_{22}^{u}M_{2}^{2}}{\\big (N_{2}+m_{2}^{l}\\big )^{2}}\\\\&\\quad+\\,2\\lambda _{2}\\tau ^{2}a_{22}^{u2}M_{2}^{2} +\\lambda _{2}\\tau a_{21}^{u}M_{1} +\\lambda _{1}\\tau a_{12}^{u}M_{2}, \\end{aligned}\n\nand for $$\\forall \\,\\bar{\\phi }=(\\bar{z}_{1t},\\bar{z}_{2t})^{T}, \\bar{\\psi }=(\\bar{z}_{1t}^{*},\\bar{z}_{2t}^{*})^{T}, \\hat{\\phi }=(\\hat{z}_{1t},\\hat{z}_{2t})^{T}, \\hat{\\psi }=(\\hat{z}_{1t}^{*},\\hat{z}_{2t}^{*})^{T}\\in S_1$$, it follows that\n\n$$\\big |V(t,\\bar{\\phi },\\bar{\\psi })-V(t,\\hat{\\phi },\\hat{\\psi })\\big | \\le \\overline{\\lambda }(\\Vert \\bar{\\phi }-\\hat{\\phi }\\Vert +\\Vert \\bar{\\psi }-\\hat{\\psi }\\Vert ).$$\n\nSo condition (2) in Lemma 2 is satisfied. In view of (27)–(28), let $$u, v\\in C({\\mathbb {R}}^{+},\\,{\\mathbb {R}}^{+})$$, $$u(s)=\\underline{\\lambda }s$$, $$v(s)=\\overline{\\lambda }s$$, thus condition (1) $$'$$ in Remark 2 is satisfied.\n\nFrom article Zhang et al. (2012), for $$t\\ne \\tau _k$$, $$k\\in {\\mathbb {Z}}^+$$, calculating the upper right derivative of V along the solution of system (26), we have\n\n$$D^{+}V(t,\\phi ,\\psi )\\le -\\gamma V(t,\\phi ,\\psi ),$$\n(29)\n\nwhere $$\\gamma :=\\frac{\\chi \\underline{\\lambda }|\\phi (0)-\\psi (0)|_0}{K}$$, $$\\chi :=\\min \\{\\frac{\\Theta }{\\lambda _1},\\frac{\\Theta }{\\lambda _2}\\}$$ and $$\\Theta :=\\min \\{\\lambda _{1}\\alpha _{1}-\\lambda _{2}\\beta _{1},\\lambda _{2}\\alpha _{2}-\\lambda _{1}\\beta _{2}\\}$$.\n\nFor $$t=\\tau _k$$, $$k\\in {\\mathbb {Z}}^+$$, we have\n\n\\begin{aligned} V(\\tau _k^+,\\phi ,\\psi )&= V_{1}(\\tau _k^+,\\phi ,\\psi )+V_{2}(\\tau _k^+,\\phi ,\\psi )+V_{3}(\\tau _k^+,\\phi ,\\psi )+V_{4}(\\tau _k^+,\\phi ,\\psi ) \\\\&= V_{1}(\\tau _k^+,\\phi ,\\psi )+V_{2}(\\tau _k,\\phi ,\\psi )+V_{3}(\\tau _k,\\phi ,\\psi )+V_{4}(\\tau _k,\\phi ,\\psi ) \\\\&= \\sum _{i=1}^2\\lambda _{i}|z_{i}(\\tau _k^+)-z_{i}^{*}(\\tau _k^+)|+V_{2}(\\tau _k,\\phi ,\\psi )+V_{3}(\\tau _k,\\phi ,\\psi )+V_{4}(\\tau _k,\\phi ,\\psi ) \\\\&= \\sum _{i=1}^2\\lambda _{i}|z_{i}(\\tau _k)-z_{i}^{*}(\\tau _k)|+V_{2}(\\tau _k,\\phi ,\\psi )+V_{3}(\\tau _k,\\phi ,\\psi )+V_{4}(\\tau _k,\\phi ,\\psi ) \\\\&= V_{1}(\\tau _k,\\phi ,\\psi )+V_{2}(\\tau _k,\\phi ,\\psi )+V_{3}(\\tau _k,\\phi ,\\psi )+V_{4}(\\tau _k,\\phi ,\\psi ) \\\\&= V(\\tau _k,\\phi ,\\psi ). \\end{aligned}\n(30)\n\nIn view of (29)–(30), condition (3) in Lemma 2 is satisfied.\n\nBy Lemma 2, system (2) admits a unique uniformly asymptotically stable positive almost periodic solution $$(z_{1}(t),z_{2}(t))^{T}$$. This completes the proof. $$\\square$$\n\n### Remark 8\n\nWithout (F), system (2) also admits a unique uniformly asymptotically stable positive almost periodic solution. So Theorem  2 extends the corresponding result in Zhang et al. (2012). Further, Theorem 2 gives the sufficient conditions for the uniform asymptotical stability of a unique positive almost periodic solution of system (2). Therefore, Theorem 2 provides a possible method to study the existence, uniqueness and stability of positive almost periodic solution of the models with impulsive perturbations and pure-delays in biological populations.\n\n### Remark 9\n\nIn the last two decades, the method of constructing a Lyapunov functional has been extensively used in the study of stability of the deterministic models (Xue et al. 2015; Tian et al. 2015; Zhang et al. 2015; Liu and Xu 2004; Liu et al. 2006; Li and Yang 2009; Gan and Lin 2012; Wu et al. 2009; Zhang et al. 2012). However, there have been numerous relevant works using the Lyapunov functional method in stochastic systems, see Shang (2014, 2015, 2016). The methods used in this paper can be extended to study the permanence and existence of a unique uniformly asymptotically stable positive almost periodic solution of the stochastic models with impulsive perturbations in biological populations.\n\n## An example and numerical simulations\n\n### Example 1\n\nConsider the following Schoener’s competition model with pure-delays and impulsive effects:\n\n\\begin{aligned} \\left\\{ \\begin{array}{ll} \\dot{x}_{1}(t)=x_{1}(t)\\bigg \\{\\frac{1}{x_{1}(t-0.0001)+2}-a_{11}(t)x_{1}(t-0.0001)-a_{12}(t)x_{2}(t-0.0002)-c_{1}(t)\\bigg \\},\\\\ \\dot{x}_{2}(t)=x_{2}(t)\\bigg \\{\\frac{1}{x_{2}(t-0.0001)+2}-a_{21}(t)x_{1}(t-0.0002)-a_{22}(t)x_{2}(t-0.0001)-c_{2}(t)\\bigg \\},\\quad t\\ne \\tau _{k},\\\\ \\Delta x_{1}(\\tau _{k})=0.5x_{1}(\\tau _{k}),\\\\ \\Delta x_{2}(\\tau _{k})=0.4x_{2}(\\tau _{k}),\\quad \\{\\tau _{k}:k\\in {\\mathbb {Z}}\\}\\subset \\{5k:k\\in {\\mathbb {Z}}\\}, \\end{array} \\right. \\end{aligned}\n\nwhere $$a_{11}(t)=a_{22}(t)=0.35+0.05\\cos (\\sqrt{3}t)$$, $$a_{12}(t)=a_{21}(t)\\equiv 0.0001$$, $$c_{1}(t)=0.30005+0.00005\\sin (\\sqrt{2}t)$$, $$c_{2}(t)=0.30005+0.00005\\cos (\\sqrt{2}t)$$, $$t\\in {\\mathbb {R}}$$. Then the above system is permanent and has a unique uniformly asymptotically stable almost periodic solution.\n\n### Proof\n\nObviously, $$a_{10}^{u}=a_{20}^{u}=1$$, $$a_{10}^{l}=a_{20}^{l}=1$$, $$a_{11}^{u}=a_{22}^{u}=0.4$$, $$a_{11}^{l}=a_{22}^{l}=0.3$$, $$a_{12}^{u}=a_{21}^{u}=0.0001$$, $$a_{12}^{l}=a_{21}^{l}=0.0001$$, $$c_{1}^{u}=c_{2}^{u}=0.3001$$, $$c_{1}^{l}=c_{2}^{l}=0.3$$, $$\\theta =2$$, $$\\eta _1\\approx 0.4$$, $$\\eta _2=4$$, $$\\xi _1\\approx 0.3$$, $$\\xi _2\\approx 0.7$$, $$A=1$$. By calculation, we obtain that $$y_{1}^{*}\\approx 0.7256$$, $$y_{2}^{*}\\approx 0.5421$$, $$\\min \\{r_{1}^{l},r_{2}^{l}\\}\\ge 0.03>0$$, $$y_{1*}=y_{2*}\\ge 0.01$$. So $$(H_1)$$ holds. Further, we also get that\n\n$$\\alpha _{1}\\ge 0.03,\\quad \\alpha _{2}\\ge 0.02,\\quad \\max \\{\\beta _{1},\\beta _{2}\\}\\le 0.00007,$$\n\nwhich implies that $$(H_2)$$ is satisfied for $$\\lambda _{1}=\\lambda _{2}=1$$. It is easy to verify that $$(H_1)$$$$(H_2)$$ are satisfied and the result follows from Theorems  1 and 2 (see Figs. 1, 2, 3). This completes the proof. $$\\square$$\n\n### Remark 10\n\nIn Example 1, the impulse coefficients ($$h_{1k}=0.5$$ and $$h_{2k}=0.6$$) do not satisfy (F). So it is impossible to obtain the permanence and existence of a unique uniformly asymptotically stable positive almost periodic solution of system (1) by the result in Zhang et al. (2012). Therefore, the work in this paper improves the results in paper Zhang et al. (2012).\n\n## Conclusion\n\nBy using the comparison theorem and the Lyapunov method of the impulsive differential equations, sufficient conditions are obtained for the permanence and existence of a unique uniformly asymptotically stable positive almost periodic solution in a class of impulsive Schoener’s competition model with pure-delays. Proposition 2 and Theorem 2 imply that the values of impulse coefficients $$h_{ik}\\,(i=1,2,3)$$ and the number of the impulse points $$\\tau _k$$ in each interval of length 1 are harm for the permanence and existence of a unique uniformly asymptotically stable positive almost periodic solution for a class of impulsive Schoener’s competition model with pure-delays. The main results obtained in this paper are completely new and the method used in this paper provides a possible method to study the permanence and existence of a unique uniformly asymptotically stable positive almost periodic solution of the models with impulsive perturbations and pure-delays in biological populations.\n\n## References\n\n• Bainov DD, Simeonov PS (1993) Impulsive differential equations: periodic solutions and applications. Longman Scientific and Technical, New York\n\n• Chen LS (1988) Mathematical ecology modelling and research methods. Science Press, Beijing (in Chinese)\n\n• Du ZJ, Lv YS (2013) Permanence and almost periodic solution of a Lotka–Volterra model with mutual interference and time delays. Appl Math Model 37:1054–1068\n\n• Gan WZ, Lin ZG (2012) The asymptotic periodicity in a Schoener’s competitive model. Appl Math Model 36:989–996\n\n• He MX, Chen FD, Li Z (2010) Almost periodic solution of an impulsive differential equation model of plankton allelopathy. Nonlinear Anal Real World Appl 11:2296–2301\n\n• Jin Z, Han MA, Li GH (2005) The persistence in a Lotka–Volterra competition systems with impulsive. Chaos Solitons Fractals 24:1105–1117\n\n• Lakshmikantham V, Bainov DD, Simeonov PS (1989) Theory of impulsive differential equations. World Scientific, Singapore\n\n• Li XP, Yang WS (2009) Permanence of a discrete $$n$$-species schoener competition system with time delays and feedback controls. Adv Differ Equ 2009:1–10\n\n• Liao YZ, Zhang TW (2012) Almost periodic solutions of a discrete mutualism model with variable delays. Discrete Dyn Nat Soc 2012:1–27\n\n• Liao YZ, Xu LJ (2014) Almost periodic solution for a delayed Lotka-Volterra system on time scales. Adv Differ Equ 2014:1–19\n\n• Lin X, Chen FD (2009) Almost periodic solution for a Volterra model with mutual interference and Beddington–DeAngelis functional response. Appl Math Comput 214:548–556\n\n• Liu ZJ, Chen LS (2007) Periodic solution of a two-species competitive system with toxicant and birth pulse. Chaos Solitons Fractals 32:1703–1712\n\n• Liu QM, Xu R (2004) Periodic solutions of Schoener’s competitive model with delays. J Biomath 19:385–394 (in Chinese)\n\n• Liu QM, Xu R, Wang WG (2006) Global asymptotic stability of Schoener’s competitive model with time delays. J Biomath 21:147–152\n\n• Liu QM, Xu R, Wang WG (2006) Global asymptotic stability of Schoener’s competitive model with delays. J Biomath 21:147–152 (in Chinese)\n\n• Meng XZ, Chen LS (2006) Almost periodic solution of non-autonomous Lotka–Volterra predator-prey dispersal system with delays. J Theor Biol 243:562–574\n\n• Nakata Y, Muroya Y (2010) Permanence for nonautonomous Lotka–Volterra cooperative systems with delays. Nonlinear Anal Real World Appl 11:528–534\n\n• Samoilenko AM, Perestyuk NA (1995) Impulsive differential equations. World Scientific, Singapore\n\n• Shang YL (2014) Group pinning consensus under fixed and randomly switching topologies with acyclic partition. Netw Heterog Media 9:553–573\n\n• Shang YL (2015) Global stability of disease-free equilibria in a two-group SI model with feedback control. Nonlinear Anal Model Control 20:501–508\n\n• Shang YL (2016) Consensus seeking over Markovian switching networks with time-varying delays and uncertain topologies. Appl Math Comput 273:1234–1245\n\n• Stamov GT (2009) On the existence of almost periodic solutions for the impulsive Lasota–Wazewska model. Appl Math Lett 22:516–520\n\n• Stamov GT (2012) Almost periodic solutions of impulsive differential equations. In: Lecture notes in mathematics. Springer, Berlin\n\n• Tian BD, Chen N, Qiu YH (2015) Almost periodic solution for an epidemic prey-predator system with impulsive effects and multiple delays. Discrete Dyn Nat Soc 2015:1–15\n\n• Wu LP, Chen FD, Li Z (2009) Permanence and global attractivity of a discrete Schoener’s competition model with delays. Math Comput Model 49:1607–1617\n\n• Xia YH, Han MA, Huang ZK (2008) Global attractivity of an almost periodic $$N$$-species nonlinear ecological competitive model. J Math Anal Appl 337:144–168\n\n• Xia YH (2013) Theory and applications of periodic solutions and almost periodic solutions. Discrete Dyn Nat Soc 2013:1–2\n\n• Xue YL, Xie XD, Chen FD, Han RY (2015) Almost periodic solution of a discrete commensalism system. Discrete Dyn Nat Soc 2015:1–11\n\n• Zhang TW (2013) Multiplicity of positive almost periodic solutions in a delayed Hassell–Varleytype predator–prey model with harvesting on prey. Math Methods Appl Sci 37:686–697\n\n• Zhang TW (2014) Almost periodic oscillations in a generalized Mackey–Glass model of respiratory dynamics with several delays. Int J Biomath 7:1–22\n\n• Zhang TW, Li YK (2011) Positive periodic solutions for a generalized impulsive $$n$$-species Gilpin–Ayala competition system with continuously distributed delays on time scales. Int J Biomath 4:23–34\n\n• Zhang H, Li YQ, Jing B (2014) Global attractivity and almost periodic solution of a discrete mutualism model with delays. Math Methods Appl Sci 37:3013–3025\n\n• Zhang H, Li YQ, Jing B, Zhao WZ (2014) Global stability of almost periodic solution of multispecies mutualism system with time delays and impulsive effects. Appl Math Comput 232:1138–1150\n\n• Zhang TW, Li YK, Ye Y (2012) On the existence and stability of a unique almost periodic solution of Schoener’s competition model with pure-delays and impulsive effects. Commun Nonlinear Sci Numer Simul 17:1408–1422\n\n• Zhang H, Feng F, Jing B, Li YQ (2015) Almost periodic solution of a multispecies discrete mutualism system with feedback controls. Discrete Dyn Nat Soc 2015:1–14\n\n• Zhou H, Wang J, Zhou Z (2013) Positive almost periodic solution for impulsive Nicholson’s blowflies model with multiple linear harvesting terms. Math Methods Appl Sci 36:456–461\n\n## Authors' contributions\n\nCL, ZGG and ZYZ collectively carried out this study, collected data, and analyzed them. CL and ZGG wrote the manuscript. ZYZ helped to draft the manuscript. All authors read and approved the final manuscript.\n\n### Acknowledgements\n\nThis work are supported by the Natural Science Foundation of Shanxi Province under Grant 2011011002-3, the Project of University Educational Reform in Shanxi Province under Grant J2015118 and the Education Science Foundation of Shanxi Province under Grant GH-13118. The authors thank the referee for his/her careful reading of the original manuscript and valuable comments and suggestions that greatly improved the presentation of this work.\n\n### Competing interests\n\nThe authors declare that they have no competing interests.\n\n## Author information\n\nAuthors\n\n### Corresponding author\n\nCorrespondence to Zhiyu Zhang.\n\n## Rights and permissions", null, "" ]
[ null, "https://springerplus.springeropen.com/track/article/10.1186/s40064-016-2068-x", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.8133757,"math_prob":0.9999627,"size":36842,"snap":"2022-27-2022-33","text_gpt3_token_len":11253,"char_repetition_ratio":0.16724578,"word_repetition_ratio":0.18001525,"special_character_ratio":0.3311438,"punctuation_ratio":0.11867267,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":1.0000042,"pos_list":[0,1,2],"im_url_duplicate_count":[null,1,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-07-01T20:06:05Z\",\"WARC-Record-ID\":\"<urn:uuid:358ae06a-0dbf-44ec-a456-efd2b225faad>\",\"Content-Length\":\"353439\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:5b908ca5-1360-4559-820b-37bbe73d5f09>\",\"WARC-Concurrent-To\":\"<urn:uuid:4a00f942-e5ee-48ff-a3bd-96994f25868d>\",\"WARC-IP-Address\":\"146.75.36.95\",\"WARC-Target-URI\":\"https://springerplus.springeropen.com/articles/10.1186/s40064-016-2068-x\",\"WARC-Payload-Digest\":\"sha1:HXTRR7T5NXD2PP5BFYVDQNUJJ762MD74\",\"WARC-Block-Digest\":\"sha1:WW3XNCDNN526N4KXJOPSGZJ2KRKC5DSY\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-27/CC-MAIN-2022-27_segments_1656103945490.54_warc_CC-MAIN-20220701185955-20220701215955-00235.warc.gz\"}"}
https://math.stackexchange.com/questions/2946510/solving-simple-equations-for-two-variables
[ "# Solving simple equations for two variables\n\n$$\\begin{cases} x + y = 0\\\\ \\displaystyle\\left(\\frac{1+\\sqrt{5}}{2}\\right)x + \\left(\\frac{1 - \\sqrt{5}}{2}\\right)y = 1 \\end{cases}$$\n\nHow can I solve for $$x$$ and $$y$$?\n\nI can't seem to solve this so that when I plug the values back in, they satisfy both equations. Seems like elementary math but...does anyone have any tips on how to solve this?\n\n• Do you happen to know how to use a coefficient matrix to solve a system of linear equations? – 高田航 Oct 8 '18 at 0:47\n• Let $x=-y$, therefore $1=\\frac {1+\\sqrt 5}2x+\\frac {-1+\\sqrt 5}2x \\implies \\sqrt 5x=1 \\implies x=\\frac {\\sqrt 5}5$ – Mohammad Zuhair Khan Oct 8 '18 at 0:48\n• It would help a lot if you showed us what you have so far. We are much more willing to show you what you did wrong than we are to tell you what the answer is. – steven gregory Oct 8 '18 at 1:07\n\nLet $$\\phi=\\frac{1+\\sqrt{5}}{2}$$, $$\\psi=\\frac{1-\\sqrt{5}}{2}$$. Thus the system becomes $$S=\\{(x,y)\\in \\Bbb R^2|(x+y=0),(\\phi x+\\psi y=1) \\}$$ To find this, do the following\nGiven: $$x+y=0$$ $$\\phi x+\\psi y=1$$ Then: $$y=-x$$ $$\\phi x+\\psi y-1=0$$ Note: $$0=0$$ Therefore: $$\\phi x+\\psi y-1=x+y$$ $$\\phi x-x +\\psi y-y=1$$ Recall: $$y=-x$$\nTherefore: $$-x(\\psi-1)+x(\\phi-1)=1$$ $$x(\\phi-1+1-\\psi)=1$$ $$x=\\frac{1}{\\phi-\\psi}$$ $$x=\\frac{\\sqrt{5}}{5}$$ $$y=-\\frac{\\sqrt{5}}{5}$$ $$S=\\{(\\frac{\\sqrt{5}}{5},-\\frac{\\sqrt{5}}{5})\\}$$" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.8062784,"math_prob":1.000009,"size":338,"snap":"2021-21-2021-25","text_gpt3_token_len":109,"char_repetition_ratio":0.11077844,"word_repetition_ratio":0.0,"special_character_ratio":0.33431953,"punctuation_ratio":0.0945946,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":1.0000099,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-05-14T23:19:15Z\",\"WARC-Record-ID\":\"<urn:uuid:2609eeb2-1f32-4708-85c7-e9fd426e66ba>\",\"Content-Length\":\"165790\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:e3c0fbb2-517f-4f96-bda5-0091f5b6a3dd>\",\"WARC-Concurrent-To\":\"<urn:uuid:612f9b60-1401-491c-ab31-4755519a38d7>\",\"WARC-IP-Address\":\"151.101.65.69\",\"WARC-Target-URI\":\"https://math.stackexchange.com/questions/2946510/solving-simple-equations-for-two-variables\",\"WARC-Payload-Digest\":\"sha1:Y5RIJHT3SYF5NB6CL5O5JRD5DNXG5RGF\",\"WARC-Block-Digest\":\"sha1:KSWGJZPDQZIUXGLSJDLZ4MVU7FCQSUEN\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-21/CC-MAIN-2021-21_segments_1620243991829.45_warc_CC-MAIN-20210514214157-20210515004157-00463.warc.gz\"}"}
https://forums.wolfram.com/mathgroup/archive/2000/Oct/msg00275.html
[ "", null, "", null, "", null, "", null, "", null, "", null, "", null, "Re: Bugs in Abs and Sign !?\n\n• To: mathgroup at smc.vnet.net\n• Subject: [mg25705] Re: [mg25674] Bugs in Abs and Sign !?\n• From: Tomas Garza <tgarza01 at prodigy.net.mx>\n• Date: Thu, 19 Oct 2000 04:35:30 -0400 (EDT)\n• Sender: owner-wri-mathgroup at wolfram.com\n\n```I guess it's just a matter of how Abs[] works. Take\n\nIn:=\nAbs[x^2] // FullForm\nOut//FullForm=\nPower[Abs[x], 2]\n\nThis says that the calculation of Abs[x^2] proceeds by taking first the\nabsolute value of x, and then squaring it. This procedure gives the\nright result. However, for an arbitrary function g,\n\nIn:=\ng[x^2] // FullForm\nOut//FullForm=\ng[Power[x, 2]]\n\ni.e., first square the argument and then apply g, which is what one\nmight expect. Why does Abs[] goes in a different way? That is why one\ngets\n\nIn:=\nAbs[x^2] /. Abs[u_] -> fnt[u]\nOut=\nfnt[x]^2\n\ninstead of fnt[x^2]. But I wouldn't call it a bug - it's just the way\nAbs[] calculates, and it gives the right result.\n\nTomas Garza\nMexico City\n\nJack Goldberg <jackgold at umich.edu> wrote:\n\n> Try,\n>\n> Abs[x^2] /. Abs[u_] -> fnt[u]\n>\n> and\n>\n> Sign[x^2] /. Sign[u_] -> fnt[u]\n>\n> In each case I get fnt[x]^2. Shouldn't I get fnt[x^2]? After all,\n> g[x^2] /. g[u_] -> fnt[u] returns fnt[x^2] which is what I have been\nled\n> to expect from Mathematica. I am using ver 4.01 on a PowerMac.\n>\n> These peculiarities are driving me crazy. This is the fourth \"bug\" I\nhave\n> found in just 2 weeks. Please tell me I'm wrong.\n\n```\n\n• Prev by Date: Re: Mathematica -> \"AI\"\n• Next by Date: Re: Associated Legendre Definition\n• Previous by thread: Re: Bugs in Abs and Sign !?\n• Next by thread: Re: Bugs in Abs and Sign !?" ]
[ null, "https://forums.wolfram.com/mathgroup/images/head_mathgroup.gif", null, "https://forums.wolfram.com/mathgroup/images/head_archive.gif", null, "https://forums.wolfram.com/mathgroup/images/numbers/2.gif", null, "https://forums.wolfram.com/mathgroup/images/numbers/0.gif", null, "https://forums.wolfram.com/mathgroup/images/numbers/0.gif", null, "https://forums.wolfram.com/mathgroup/images/numbers/0.gif", null, "https://forums.wolfram.com/mathgroup/images/search_archive.gif", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.8759604,"math_prob":0.60019475,"size":1436,"snap":"2022-27-2022-33","text_gpt3_token_len":469,"char_repetition_ratio":0.11033519,"word_repetition_ratio":0.031620555,"special_character_ratio":0.3558496,"punctuation_ratio":0.16369048,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.98197275,"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\":\"2022-07-05T03:13:42Z\",\"WARC-Record-ID\":\"<urn:uuid:d5378896-0e8b-4603-9810-e1892e5ae6af>\",\"Content-Length\":\"44974\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:e58841fe-8be1-4bbb-bbf5-2fef417acb97>\",\"WARC-Concurrent-To\":\"<urn:uuid:72b1ddc9-0824-483e-9600-3055c2ce6946>\",\"WARC-IP-Address\":\"140.177.205.73\",\"WARC-Target-URI\":\"https://forums.wolfram.com/mathgroup/archive/2000/Oct/msg00275.html\",\"WARC-Payload-Digest\":\"sha1:EDSRDP4ZRM7G45QGXRHMRKFCKSAPKYCG\",\"WARC-Block-Digest\":\"sha1:3Z4SWU63GJMLDT5S32LUH367BBUOP7DT\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-27/CC-MAIN-2022-27_segments_1656104512702.80_warc_CC-MAIN-20220705022909-20220705052909-00235.warc.gz\"}"}
https://convertwizard.com/186-carats-to-kilograms
[ "# 186 Carats to Kilograms (186 ct to kg)\n\nConvert 186 Carats to Kilograms (ct to kg) with our conversion calculator and conversion tables. To convert 186 ct to kg use direct conversion formula below.\n186 ct = 0.0372 kg.\nYou also can convert 186 Carats to other Weight (popular) units.\n\n186 CARATS\n\n=\n\n0.0372 KILOGRAMS\n\nDirect conversion formula: 1 Carats * 5000 = 1 Kilograms\n\nOpposite conversion: 186 Kilograms to Carats\n\nCheck out conversion of 186 ct to most popular weight units:\n\n186 ct to Pounds\n186 ct to Grams\n186 ct to Ounces\n186 ct to Milligrams\n186 ct to Tons (metric)\n\n## 186 ct from similar units:\n\nCarat 0.0381665579838\n\n## Conversion table: Carats to Kilograms\n\nCARATS   KILOGRAMS\n1 = 0.0002\n2 = 0.0004\n3 = 0.0006\n4 = 0.0008\n5 = 0.001\n7 = 0.0014\n8 = 0.0016\n9 = 0.0018\n10 = 0.002\nKILOGRAMS   CARATS\n1 = 5000\n2 = 10000\n3 = 15000\n4 = 20000\n5 = 25000\n7 = 35000\n8 = 40000\n9 = 45000\n10 = 50000\n\n## Nearest numbers for 186 Carats\n\nCARATS   KILOGRAMS\n186.66 ct = 0.037332 kg\n187.5 ct = 0.0375 kg\n192.6 ct = 0.03852 kg\n196 ct = 0.0392 kg\n200 ct = 0.04 kg\n210 ct = 0.042 kg\n217.45 ct = 0.04349 kg\n222.95 ct = 0.04459 kg\n223.5 ct = 0.0447 kg\n235 ct = 0.047 kg\n238 ct = 0.0476 kg\n240 ct = 0.048 kg\n250 ct = 0.05 kg\n255.6 ct = 0.05112 kg\n260 ct = 0.052 kg\n280.2 ct = 0.05604 kg\n282 ct = 0.0564 kg\n297.3 ct = 0.05946 kg\n300 ct = 0.06 kg\n305 ct = 0.061 kg" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.5104304,"math_prob":0.99987304,"size":1241,"snap":"2021-31-2021-39","text_gpt3_token_len":529,"char_repetition_ratio":0.26919967,"word_repetition_ratio":0.0,"special_character_ratio":0.6253022,"punctuation_ratio":0.16724738,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9989454,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-08-04T21:36:22Z\",\"WARC-Record-ID\":\"<urn:uuid:44e3c984-10fe-45f0-b73b-3f12d65c3766>\",\"Content-Length\":\"107861\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:653c4a6f-0db0-46f1-bf64-78578ab163ef>\",\"WARC-Concurrent-To\":\"<urn:uuid:1fc2dd32-e58e-44e4-b974-a52f1e17c1b6>\",\"WARC-IP-Address\":\"18.232.245.187\",\"WARC-Target-URI\":\"https://convertwizard.com/186-carats-to-kilograms\",\"WARC-Payload-Digest\":\"sha1:PDZD7PGIN3RLVKSV5USWTPQJ52ERA3QK\",\"WARC-Block-Digest\":\"sha1:NZXGQPS7I66FAZWBTWRNYAJPITXPOAYF\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-31/CC-MAIN-2021-31_segments_1627046155188.79_warc_CC-MAIN-20210804205700-20210804235700-00366.warc.gz\"}"}
https://bazargoods.com/what-is-electric-current-what-are-the-types-of-electric-current/
[ "1. Home\n2. /\n3. ITI Course\n4. /\n5. What is electric current? What are the types of electric current?\n\n# What is electric current? What are the types of electric current?\n\nFriends, welcome to my website, today I will show you Electric current What is? And what are its types? What is its unit, I will tell you about it. So let’s start\n\n### What is electric current?\n\nflow of electrons in an electric circuit electric current it is said.\n\nthis one scalar is, its units ampere it happens. english alphabets ‘i’ is displayed by\n\nto measure electric current ammeter is used.\n\nto measure electric current ammeter always in the circuit hierarchy is added to.\n\nThe direction of flow of electric current and electron are always opposite to each other. Where electric current flows from positive charge to negative charge, electrons flow from negative charge to positive charge.\n\nThe value of current flow in any electric circuit always depends on the resistance of the load to be added to the circuit and the voltage to be supplied in the circuit.\n\nThe value of electric current is proportional to voltage. When the value of voltage is high in the circuit, then the value of current is also high. When the value of voltage in the circuit is small, then the value of current is also low.\n\n### Types of electric current\n\nIt is of two types-\n\n#### 1. AC Current\n\nSuch an electric current whose direction and value keeps on changing or changing is called AC Current it is said. of this electric current Frequency 50Hz it occurs.\nFriends, the light coming from the headlight in our homes is only alternating current. this stream us alternator, oscillator etc. is obtained.\n\n#### 2.DC Current\n\nSuch an electric current whose direction and value does not change or change is called DC Current it is said. of this electric current Frequency 0 (zero) Hz it occurs.\nthis stream us Mobile Battery, Inverter, Cell, DC Generator and Rectifier etc. is obtained.\n\n### How do you measure electric current?\n\nto electric current ammeter measure from.\n\n### What are the types of electric current?\n\nIt is of two types-\n1.alternating current\n2.Direct current\n\n### What is the frequency of alternating current?\n\nhis Frequency 50 Hz it occurs.\n\n### What is the frequency of direct current?\n\nFriends, if you like this post of mine, then comment and share. post reading Of Thank you!" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.91929466,"math_prob":0.9792574,"size":2990,"snap":"2022-40-2023-06","text_gpt3_token_len":646,"char_repetition_ratio":0.21232417,"word_repetition_ratio":0.11023622,"special_character_ratio":0.20468228,"punctuation_ratio":0.12627986,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9568167,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-02-08T17:55:14Z\",\"WARC-Record-ID\":\"<urn:uuid:3eb5f902-d1b5-4167-b928-2de0b5473839>\",\"Content-Length\":\"83472\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:844c86cd-5f13-4952-a6c4-e85b6fb812da>\",\"WARC-Concurrent-To\":\"<urn:uuid:1c72fff4-f17e-4266-b169-c3121fc47346>\",\"WARC-IP-Address\":\"82.180.166.138\",\"WARC-Target-URI\":\"https://bazargoods.com/what-is-electric-current-what-are-the-types-of-electric-current/\",\"WARC-Payload-Digest\":\"sha1:UV4UKHP7JU3QD7ZLNKXYSTYNHFE4RTHI\",\"WARC-Block-Digest\":\"sha1:MVDJ2V6QBEIC77PUVXK7QE2XVLOPVUG5\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-06/CC-MAIN-2023-06_segments_1674764500837.65_warc_CC-MAIN-20230208155417-20230208185417-00234.warc.gz\"}"}
https://patents.justia.com/patent/10834368
[ "# Kind of partially reliable transmission method based on hidden Markov model\n\n- SICHUAN UNIVERSITY\n\nThis invention discloses a kind of reliable data transmission method based on hidden Markov model that specific to video transmission quality enhancement over lossy satellite links. It uses HMM model to forecast retransmission rate and adopts the network packet loss rate to reflect the network performance. The underlying network packet loss rate is used as the hidden state of HMM model and the retransmission rate is used as the observation state. By analyzing the historically transmitted data sessions, APRT establishes the relationship between the hidden state transition probability and the emission probability. Then, a robust and efficient retransmission rate prediction is obtained. This invention takes into full consideration of high BER in satellite network channels and adjusts the reliable level according to the satellite network channel characteristics so as to make tradeoff between instantaneity and quality. Consequently, it guarantee the QoS and QoE of video stream.\n\n## Latest SICHUAN UNIVERSITY Patents:\n\nDescription\nFIELD OF TECHNOLOGY\n\nThis invention involves the end-to-end partially reliable transmission field, which involves a kind of transmission method based on hidden Markov model that specific to video transmission quality enhancement over lossy satellite links.\n\nBACKGROUND TECHNOLOGY\n\nMultimedia applications play an important role in satellite networks and High-Definition (HD) video dominated streaming applications increasingly, providing these applications with good QoS and QoE continues to be a critical problem. For the delay-sensitive type of applications, the conventional transmission policy cannot be adopted with the limited bandwidth and high bit error rate (BER) of satellite channel. Therefore, how to design efficient transfer protocol with guaranteed QoS and QoE for video transfer in satellite network is one of the key issues.\n\nReliable transmission control protocol (e.g., TCP and its variants) and unreliable user datagram protocol (e.g., UDP) are widely used for video transmission at the transport layer. TCP is widely used as the primary data transmission protocol, which can enable firewall penetration throughout the network and keep friendliness between different flows. In many papers, video is transferred with TCP protocol at the transport layer. For example, the existing work proposed the CS2P protocol by analyzing the throughput characteristics of different session data. CS2P can predict the initial throughput, and then use the hidden Markov model (HMM) to establish the medium flow forecasting model. Finally, using throughput rate control, CS2P can achieve adaptable for video transmission control. PATON improves the quality of real-time video streams by using the technologies, i.e., forward error correction (FEC), video frame priority selection, and adaptive redundancy. However, because satellite network has a high bit error rate environment, video applications directly use TCP protocol as the underlying protocol for data transmission may cause many problems. First, the reliable transport mechanism of TCP protocol will cause multiple retransmits until the lost packets are correctly received. For delay-sensitive applications, the retransmitted packets are likely to be invalid for video playout before they are received. Furthermore, when packet loss events occur, the congestion control and congestion avoidance mechanism of TCP protocol can result in low bandwidth occupation of video streams and cannot obtain higher bandwidth occupation when competing with UDP flow. In summary, reliable transmission strategies cannot guarantee QoS of video flows over satellite networks.\n\nNowadays, most multimedia applications are based on unreliable transmission protocols, such as UDP protocol and RTP protocol. Many well-known applications are based on UDP protocol (i.e., Skype and WebRTC). For example, GCC performs rate control based on RTP/RTCP protocol, and then uses the Kalman filter algorithm to estimate the delay gradient of packets in the networks, which can indicate the network congestion level. GCC is used for Google Hangouts and Chrome WebRTC protocol stack in reality. An existing work proposed the DCCP protocol which uses the principle of incremental sequence number. Moreover, by assessing whether the packet exceeds its scheduled life cycle, DCCP determines whether to retransmit the lost packet. However, transmission method of unreliable transmission protocol also has some disadvantages. First, UDP and RTP protocol without congestion control mechanism flood data packets into network, which may deteriorate the overall network performance. In addition, unreliable transmission protocol does not guarantee data transmission reliability. When the satellite network is in good condition but has large amount of stochastic packet losses, unreliable transfer methods will greatly influence the QoS of HD video.\n\nCONTENTS OF THE INVENTION\n\nThis invention aims to solve the technical problem which offers a kind of reliable transmission method based on hidden Markov model (hereafter referred to as APRT protocol) to handle the quality and real-time problem of delay-sensitive video service over lossy satellite links.\n\nTo solve the technical problem mentioned above, the technical program adopted by this invention is:\n\nStep 1: Present the specification definition of HMM model.\n\nThis method uses HMM model to forecast retransmission rate. The underlying network packet loss rate is used as the hidden state of HMM model and the retransmission rate is used as the observation state. By analyzing the historically transmitted data sessions, it establishes the relationship between the hidden state transition probability and the emission probability. Then, a robust and efficient retransmission rate prediction is obtained.\n\nRandom variables Wt is defined as the retransmission rate of APRT protocol in time period t. wt is defined as the actual retransmission rate measured in the network. Ŵt indicates the predicted value of random variable Wt. Assume that the retransmission rate of the strategy Wt is changing with the variation of some hidden state variables Xt∈χ, where χ∈{x1, x2, . . . , xN} represents a set of possible discrete state sequences and N=|χ| indicates the number of states. State variables Xt is a random variable and the probability distribution is defined as the vector π=(P(Xt=x1), . . . , P(Xt=xN)).\n\nThe HMM model assumes that the state varies with the Markov process, where the probability distribution of the current state is determined by the state of its previous period, that is P(Xt|Xt−1, . . . , X1)=P(Xt|Xt−1). The defined transition probability matrix is P={Pij}, where Pij=P(Xt=xi|Xt−1=xj). According to Markov properties, it can be concluded that πt+τ tPτ. When a hidden state Xt is given, we assume that the probability distribution function (pdf) of network packet loss rate follows the following Gaussian distribution function: Wt|Xt=x˜N (μx, σx2).\n\nStep 2: Offline training phase.\n\nWhen the number of states N is given, and the training data set is Set(Ms*, s), utilize the maximum likelihood estimation algorithm to calculate the parameters of HMM model, which can be expressed by the equation θHMM={π0, P, {(μx, σx2), x∈χ}}.\n\nStep 3: Online prediction stage.\n\n• 1) Prediction initialization: Set(Ms*, s) is the most matching feature for the transmission of flow s, which is defined as Ŵ1=Median(Set(Ms*, s)), where Set(Ms*, s) is the mean value of the data set and as the initial network packet loss rate.\n• 2) Forecast phase. In the period t, the updated pdf of the HMM model is given. Then, according to Markov feature, the pdf of current time period can be calculated by the equation πt|1:t−1t−1|1:t−1P. The predicted retransmission rate Ŵt can also be calculated.\n• 3) Parameter update of HMM model. When the actual network packet loss rate Wt=wt and πt|1:t−1 are given, Baum-Welch algorithm is used to update the parameters of HMM model. πt|1:t−1 is updated as πt|1:t−1, and Pij is updated as Pij.\n\nStep 4: Congestion Control.\n\n• 1) Rate control for video flow. When the receiver uses the HMM model to determine the retransmission rate of the video, it returns the adaptive ACK feedback packet. When the sender receives the ACK packets, the APRT protocol congestion window control adopts the loss based congestion indicators, and the cubic window growth function, which is defined in Cubic TCP, so as to update the congestion window increase quickly and discreetly.\n• 2) Fast retransmission. When the network is in a non-congested state, the receiver side returns almost all the ACK feedbacks of all received data, and the sender performs fast retransmission after receiving duplicated ACKs or timeout as traditional transport protocol. When the network is predicted in a poor or a congested state, the receiver retransmits the acknowledgment feedback partially, and the sender only performs fast retransmission for the confirmed lost packets. For extreme conditions, such as if the network is in idle time, the APRT protocol is regarded as a completely reliable transmission protocol as the TCP protocol.\n\nAccording to the program mentioned above, in Step 3, the formula to calculate in Step 3 is defined as follows:\n\n$W ^ t = μ x$ $x = arg ⁢ ⁢ max x ∈ χ ⁢ ⁢ P ⁡ ( ∑ j n ⁢ X N ⁡ ( j ) )$ $X t + 1 ⁡ ( j ) = ∑ i = 1 , ⁢ … ⁢ , N ⁢ X t ⁡ ( i ) ⁢ P ij · W t + 1 ❘ X j$\n\nAccording to the program mentioned above, in Step 3, the formula to calculate πt|1:t−1 and Pij in Step 3 is defined as follows:\n\n$π _ t ❘ 1 ⁢ : ⁢ t - 1 = P ⁡ ( W 1 , W 2 , … ⁢ , W t , X t = x i ❘ W 1 ⁢ : ⁢ t ) · P ⁡ ( W t + 1 ❘ X t = x i , W 1 ⁢ : ⁢ t ) ∑ i = 1 N ⁢ ⁢ P ⁡ ( W 1 , W 2 , … ⁢ , W t , X t = x i ❘ W 1 ⁢ : ⁢ t ) · P ⁡ ( W t + 1 ❘ X t = x i , W 1 ⁢ : ⁢ t )$ $⁢ P _ ij = P ⁡ ( W 1 , W 2 , … ⁢ , W t , X t = x i ❘ W 1 ⁢ : ⁢ t ) ⁢ P ij · W t + 1 ❘ X j · P ⁡ ( W t + 1 , W t + 2 ❘ X t + 1 = x i + 1 , W 1 ⁢ : ⁢ t + 1 ) ∑ i = 1 N ⁢ ⁢ P ⁡ ( W 1 , W 2 , ⁢ … ⁢ , W t , X t = x i ❘ W 1 ⁢ : ⁢ t ) · P ⁡ ( W t + 1 ❘ X t = x i , W 1 ⁢ : ⁢ t )$\n\nBeing compared with the current technology, the beneficial effects of this invention are: 1) It employ HMM model to depict reliable level of the transfer strategy, which can make tradeoffs between the quality of the video application and the real-time performance of video transfer. Through offline training initialization and online prediction, the relationship between the packet loss and the reliability of the transmission is established, which can represent good video quality and minimum packet delay. 2) It can retransmit the lost packets as the network changing without losing of key frames. It is compatible with the existing TCP congestion control scheme for rate control, and takes the video frame priority into consideration for partial reliability transmission. Comparing with other video transfer strategies, APRT achieves higher throughput while ensuring lower packet delay. Consequently, the proposed protocol can guarantee the video stream QoS for satellite network.\n\nSPECIFICATION OF THE ATTACHED FIGURES\n\nFIG. 1 shows the overview of HMM model.\n\nFIG. 2 shows the simulation topology.\n\nFIG. 3 shows the average throughput of each protocol under different link error rates when the bottleneck link bandwidth is 10 Mbps.\n\nFIG. 4 shows the average throughput of each protocol under different link error rates when the bottleneck link bandwidth is 200 Kbps.\n\nFIG. 5 shows the changing of RTT of different single flow over time when the link error rate is 10−5 in scenario A.\n\nFIG. 6 shows the changing of RTT of different single flow over time when the link error rate is 10−5 in scenario B.\n\nFIG. 7 shows the changing of delay jitter of different single flows over time in scenario A and scenario B.\n\nFIG. 8 shows the changing of delay jitter of different single flows over time in scenario B.\n\nFIG. 9 shows the subjective video quality of different single protocols using different video test sequence, when the bandwidth is 10 Mb/s and BER is 10−7 (1).\n\nFIG. 10 shows the subjective video quality of different single protocols using different video test sequence, when the bandwidth is 10 Mb/s and BER is 10−7 (2).\n\nFIG. 11 shows the subjective video quality of different single protocols using different video test sequence, when the bandwidth is 10 Mb/s and BER is 10−7 (3).\n\nFIG. 12 shows the subjective video quality of different single protocols using different video test sequence, when the bandwidth is 10 Mb/s and BER is 10−7 (4).\n\nFIG. 13 shows the subjective video quality of different single protocols using different video test sequence, when the bandwidth is 200 Kb/s and BER is 10−6 (1).\n\nFIG. 14 shows the subjective video quality of different single protocols using different video test sequence, when the bandwidth is 200 Kb/s and BER is 10−6 (2).\n\nFIG. 15 shows the subjective video quality of different single protocols using different video test sequence, when the bandwidth is 200 Kb/s and BER is 10−6 (3).\n\nFIG. 16 shows the impact of different playout buffer sizes on the quality of APRT protocol.\n\nFIG. 17 shows the average throughput of three video flows under different link BERs when the bottleneck link bandwidth is 10 Mbps.\n\nFIG. 18 shows the average throughput of three video flows under different link BERs when the bottleneck link bandwidth is 200 Kbps.\n\nFIG. 19 shows the changing of RTT of different concurrent flows over time in scenario A.\n\nFIG. 20 shows the changing of RTT of different concurrent flows over time in scenario B.\n\nFIG. 21 shows the changing of delay jitter of different concurrent flows over time in scenario A.\n\nFIG. 22 shows the changing of delay jitter of different concurrent flows over time in scenario B.\n\nFIG. 23 shows subjective video quality of different concurrent protocols using different video test sequence, when the bandwidth is 10 Mb/s and BER is 10−7 (1).\n\nFIG. 24 shows subjective video quality of different concurrent protocols using different video test sequence, when the bandwidth is 10 Mb/s and BER is 10−7 (2).\n\nFIG. 25 shows subjective video quality of different concurrent protocols using different video test sequence, when the bandwidth is 200 Kb/s and BER is 10−6 (1).\n\nFIG. 26 shows subjective video quality of different concurrent protocols using different video test sequence, when the bandwidth is 200 Kb/s and BER is 10−6 (2).\n\nSPECIFIC IMPLEMENTATION METHOD\n\nFurther specific specification is given as follows by combining the attached figures and the implementation case in detail.\n\nSimulation topology is shown in FIG. 2, which includes the senders, the receivers and the satellite networks. The following two main scenarios are simulated:\n\n• Scenario A: bandwidth of the bottleneck link is 10 Mb/s with varied round trip time (RTT), which represents broadband MEO satellite networks;\n• Scenario B: bandwidth of the bottleneck link is 200 Kb/s with varied RTT, which represents narrowband LEO satellite networks.\n\nThe APRT protocol is compared with different types of protocols, which include various reliability and order. Therein, variable ξ, denote the reliability degree of the transport service provided. A reliable service is 100% reliable. A partially reliable service is the service with ξ∈[0%, 100%], variable Ω defines the orderliness of the strategy, where Ω∈[0%, 100%]. P1 represents APRT protocol, P2 represents the protocol with ξ=1, Ω=1, P3 represents the protocol with ξ≤1, Ω=1, P4 represents the protocol with ξ≤1, Ω=1∘\n\nIt can be concluded from both FIGS. 3 and 4 that the average throughput of all protocols reduces with the increase of link error rate. As shown in FIG. 3, when the bottleneck link bandwidth is 10 Mbps, all protocols cannot take full advantage of the link bandwidth, so that the network is in a state of no congestion. When the BER is from 10−9 to 10−6, the network is in good state. The average throughput of APRT and p2 strategies are higher than p3 and p4 strategies. This is because the throughput of unreliable strategies (i.e., p3 and p4) is limited by the transfer speed of video encoded frames from the application layer to the transport layer at the sender side. Nevertheless, there is a reliable confirmation component in p2 strategy and APRT protocol, which produces part of the retransmission packets. When the link error rate is greater than 2.0×10−6, the average throughput of p3 and p4 strategies start to larger than that of reliable p2 strategy, while the APRT protocol begins to perform a similar performance to p4 strategy. The reason for this is that p2 strategy is based on the ACK acknowledgment to assure reliability while APRT adopts partially reliable transfer mechanism.\n\nAs shown in FIG. 4, when the bottleneck link bandwidth is 200 Kbps, the bottleneck link has been saturated, and is in a moderate congestion state. For different BER, p4 strategy always maintains the highest average throughput of about 200 Kbps, followed by p3 strategy. When the link error rate is from 10−9 to 10−6, average throughput of APRT protocol is slightly higher than of p2 strategy. When the BER is larger than 10−6, p2 strategy has an obvious performance degradation, the reason is that p3 and p4 strategies have no packet transmission control mechanism, so that the throughput is large. Therein, p3 strategy applies a packet in-order guarantee mechanism, so that the throughput of p3 is slightly smaller than that of p4 strategy, in which Ω=1. For APRT protocol, it will determine the state of the network according to the HMM model. When approaching the saturation bandwidth occupancy, APRT utilizes partially reliable transmission mechanism. When the network packet loss rate is large, APRT reduces the reliability of the protocol for real-time transmission. Thus, the proposed protocol can make trade-offs between high-quality and playback continuity.\n\nIt can be seen from FIG. 5 that the RTT of APRT protocol changes between [52.5 ms, 53 ms], the RTT of p2 strategy varies between [52.5 ms, 53.5 ms], and that of p3 and p4 strategies changes between [50 ms, 53 ms]. This is because that when the network bandwidth is not fully utilized, the reliable mechanism of p2 strategy will cause network routers cache a certain amount of data packets, so that the packet has a queuing delay. This will result in RTT increase. While for protocols without guaranteeing reliability, the more the protocol is unreliable, the lower the RTT is. Combining the jitter result shown in FIG. 7, p2 strategy has a high delay jitter. The larger the delay jitter is, the less stable queueing produced in the bottleneck routers.\n\nIt can be seen from FIG. 6 that RTT of different protocols has big difference. Therein, the RTT of p2 is much higher than the other three protocols. This is caused by the congestion control of p2 strategy; whose window changes regularly. At this time, the network utilization is high with high random BER in satellite networks, which results in a large number of packets buffered in routers. When the network has free bandwidth, the growth of the window is slow. Once packet loss events occur, congestion window of p2 turns into the congestion avoidance stage. The RTT of p4 packet is less than that of p2 strategy packet. Because of the high utilization of the network at this time, and that p4 strategy does not have congestion control mechanism, the routers of bottleneck link also buffer a large number of data packets. Because of p3 strategy guarantees the packet order and will discard the out-of-order packet at the receiver side, most RTT of p3 packets are less than 150 ms delay. APRT protocol also has a smaller round-trip delay APRT also represents a ladder curve characteristics, which is doe to the HMM model network prediction. APRT carries out an adaptive reliability and avoids unnecessary congestion window reduction so as to maintain the congestion window in a relatively stable state. According to the corresponding delay jitter in FIG. 8, it can be seen that the delay jitter range of p2 strategy is between [0,0.5], which is violent, and the APRT protocol is around 0.1, except that some individual points reach 0.3. p4 and p3 strategies achieve minimal delay jitter, which are all less than 0.06.\n\nTable 1 examines the packet loss results in different network states. Overall, it can be seen that for different BERs, packet loss rate of different protocols is: packet loss rate of p4>packet loss rate of p3>packet loss rate of APRT>packet loss rate of p2. When the bandwidth of 200 Kbps, the performance of p4 strategy and p3 strategy are affected greatly, and the total number of dropped frames are 452 and 314, respectively. The total number of dropped frames of APRT protocol is 178 at most.\n\nTABLE 1 Lost Frames of Different Protocols under Single Flow Scenarios with Different Bandwidths and BERs. Bandwidth protocol BER Packet loss rate Lost frame 10 Mb/s P1 10−7 0.0065 17 10−5 0.1215 52 P2 10−7 0.0062 16 10−5 0.1375 40 P3 10−7 0.068 18 10−5 0.1198 286 P4 10−7 0.0074 19 10−5 0.1166 299 200 Kb/s P1 10−7 0.0471 83 10−5 0.1409 178 P2 10−7 0.0285 24 10−5 0.1341 24 P3 10−7 0.1638 303 10−5 0.1364 314 P4 10−7 0.1762 452 10−5 0.1567 402\n\nThe PSNR results are shown in Table 2. The upper part of Table 2 shows a good state of the network, where the bandwidth is not fully utilized and the link BER is 10−8. The four protocols achieve a higher. PSNR value and the corresponding MOS value is 5, while the reliable protocol has higher video transmission quality than the unreliability protocol. The PSNR of the APRT protocol is 11.62% higher than that of the p4 strategy. The lower part of Table 2 shows a poor network status, where the bandwidth low and link BER of 10−5. Therein, PSNR of p2 strategy is 0, indicating that the video cannot be decoded and reconstruction. The video quality based on p3 strategy and p4 strategy is fair and poor, respectively. The APRT protocol with a certain reliability guarantee can reach 32.89, which ensures a better video transmission quality.\n\nTABLE 2 Video Quality of Different Protocols under Single Flow Scenarios with Different Bandwidths and BERs. Bandwidth MOS protocol BER PSNR MOS evaluation 10 Mb/s P1 10−8 41.525381 5 Excellent P2 41.623857 5 Excellent P3 37.296478 5 Excellent P4 37.202516 5 Excellent 200 Kb/s P1 10−5 32.889131 4 Good P2 0 1 Bad P3 29.525154 3 Fair P4 24.092692 2 Poor\n\nFIG. 9-12 and FIG. 13-15 show the video quality comparison of different video test sequences in different network states. By comparing with the source video image, it can be seen that the video quality of the APRT protocol and p2 strategy of the second and third columns is almost as clear as the source video image, and the video quality of p4 strategy is slightly worse, especially for dynamic image. In FIG. 13-15, due to this network state, p2 strategy is unable to carry out video decoding and reconstruction work, so we only show the quality of two compared video transfer protocols, i.e., p3 and p4. It can be seen that the quality of APRT protocol video is significantly better than that of p4 protocol.\n\nFIG. 16 shows that the bigger the playout buffer is, the better the video quality are. When the link error rate is 10−7 and the playout buffer size is less than 150, video quality only achieve fair quality. When the playout buffer size is higher than 150, the video quality is good. When the link error rate of 10−5 and the playout buffer size is less than 110, the video quality is poor, while the playout buffer size is higher than 240, the video quality is good. After the playout buffer size is higher than 350, continue to increase the size of the playout buffer does not improve the quality of the video any more. Overall, we can see that for a playout buffer with 150 to 300 packets, APRT can achieve a good quality of video playback. Moreover, because the poor satellite networks environment, larger playout buffer size is not necessary.\n\nIt can be seen from FIGS. 17 and 18 that the results are almost the same as the single flow experiments, that is, the average throughput of all protocols decrease as the link BER increases. As shown in FIG. 17, the bottleneck link bandwidth is 10 Mbps and the link error rate is 4.5×10−6, average throughput of APRT, p2 and p4 strategy are around 560 Kbps. The results of FIG. 18 differ from the single flow scenario, the average throughput of APRT protocol holds between the performance of p2 and p4 strategy. When the BER is 10−5, the average throughput of APRT protocol is higher than that of p2 strategy.\n\nThe evaluation of round trip delay and delay jitter is also similar to the result of a single flow scenario. FIG. 19 shows the delay curve changing over time when the link BER is 10−5 in scenario A. It can be seen from the figure that RTT of APRT protocol packet changes in the interval of [52.5 ms, 55 ms]. When p2 becomes stable, its RTT changes in the interval of [52 ms, 65 ms]. The RTT of p3 strategy and p4 strategy are between the interval of [52.5 ms, 60 ms]. The corresponding delay jitter results are given in FIG. 21, which shows that the APRT protocol has a larger round trip delay and can maintain a smaller queuing delay in the router:\n\nFIG. 20 shows the RTT curve varying over time when link BER is 10−5 in scenario B. It can be seen from the figure that when the network data flow increases, the round trip delay increases from 150 ms to 400 ms comparing with when there is only a single flow in the network. The overall round trip delay of APRT protocol is the smallest. However, as shown in FIG. 22, APRT has a large delay jitter like p2.\n\nTable 3 is used to check the coexistence of multiple data strip in different network state under different packet loss situation. It can be seen that in the case of multiple flow coexisting situations, all of the protocols have a high packet loss rate, especially when the bandwidth is 200 Kbps. The packet loss rate of APRT reduced by 77.69% and 55.05% comparing with the p4 strategy.\n\nTABLE 3 Lost Frames of Different Protocols under Concurrent Flow Scenarios with Different Bandwidths and BERs. Bandwidth Protocol BER Packet loss rate Lost frame 10 Mb/s P1 10−7 0.0173 48 10−5 0.1475 71 P2 10−7 0.0158 41 10−5 0.2198 87 P3 10−7 0.0672 54 10−5 0.1340 69 P4 10−7 0.0677 55 10−5 0.1093 74 200 Kb/s P1 10−7 0.1982 54 10−5 0.2981 64 P2 10−7 0.2068 55 10−5 0.3301 69 P3 10−7 0.8885 6814 10−5 0.8885 6791 P4 10−7 0.8885 6814 10−5 0.8867 6800\n\nFor the upper part of Table 4, when the network state is better, the four protocols can reach a higher PSNR value, and the MOS value is 4. The PSNR of difference protocol is not significant. However, when the network gets worse, the performance of APRT protocol is significantly better than the other three protocols. It can be concluded that APRT ensures a better video transmission quality.\n\nTABLE 4 Video Quality of Different Protocols under Concurrent Flow Scenarios with Different Bandwidths and BERs. Bandwidth MOS Protocol BER PSNR MOS evaluation 10 Mb/s P1 10−8 33.032264 4 Good P2 33.146254 4 Good P3 32.484776 4 Good P4 32.440097 4 Good 200 Kb/s P1 10−6 30.652149 3 Fair P2 0 1 Bad P3 27.088844 3 Fair P4 22.441292 2 Poor\n\nIt can be seen from FIGS. 23 and 24 that the video quality of the APRT protocol and the p2 strategy is almost as well as the source video image, while the video quality transmitted by the p4 strategy is slightly worse, especially for the dynamic images. For FIGS. 25 and 26, because in this network state, p2 strategy transmission of data has been unable to carry out video decoding and reconstruction work, so only shows the quality of other two comparing transmission protocol. It can be seen that video quality based on APRT protocol is significantly better than that of p4 strategy. Because the first sequence images are relatively static, so the quality is better than that of the second row. For second row, the transfer of p4 strategy represents a serious discontinuous phenomenon.\n\n## Claims\n\n1. A reliable transmission method based on a hidden Markov model (HMM model) to handle a quality and a real-time problem of a delay-sensitive video service over lossy satellite links, the method comprising:\n\nStep 1: Presenting a specification definition of the HMM model, including\nusing the HMM model to forecast a retransmission rate; using an underlying network packet loss rate as a hidden state of the HMM model; using the retransmission rate as an observation state; by analyzing historically transmitted data sessions, establishing a relationship between a hidden state transition probability and an emission probability, and obtaining a robust and efficient retransmission rate prediction, such that: a random variable Wt is defined as the retransmission rate in a time period t; wt is defined as an actual retransmission rate measured in a network; Ŵt indicates a predicted value of the random variable Wt; a retransmission rate of a strategy Wt is changing with a variation of hidden state variables Xt∈χ, where χ∈{x1, x2,..., xN} represents a set of possible discrete state sequences and N=|χ| indicates a number of states; the hidden state variables Xt are a random variable and a probability distribution is defined as a vector π=(P(Xt=x1),..., P(Xt=xN));\na current state varies with a Markov process, where a probability distribution of the current state is determined by a state of a previous period, expressed as P(Xt|Xt−1,..., X1)=P(Xt|Xt−1); a defined transition probability matrix is P={Pij}, where Pij=P(Xt=xi|Xt−1=xj), and πt+τ =πtPτ; and when a hidden state Xt is given, a probability distribution function (pdf) of the network packet loss rate follows the Gaussian distribution function: Wt|Xt=x˜N(μx, σx2);\nStep 2: Executing an offline training phase, including, when the number of states N is given and a training data set is Set (Ms*, s), utilizing a maximum likelihood estimation algorithm to calculate the parameters of the HMM model, which can be expressed by the equation θHMM={π0, P, {(μx, σx2), x∈χ}};\nStep 3: Executing an online prediction stage, including a prediction initialization including: providing a Set (Ms*, s) as a most matching feature for a transmission of flow s, which is defined as Ŵ1=Median (Set (Ms*, s)), where Set(Ms*, s) is a mean value of a data set and an initial network packet loss rate; a forecast phase including: in the time period t, providing an updated pdf of the HMM model, then according to a Markov feature, calculating the pdf of a current time period using the equation πt|1:t−1=πt−1|1:t−1P, and calculating the predicted retransmission rate Ŵt; and a parameter update of the HMM model including: when the network packet loss rate Wt=wt, and πt|1:t−1 are provided, using a Baum-Welch algorithm to update the parameters of the HMM model, such that πt|1:t−1 is updated as πt|1:t−1, and Pij is updated as Pij;\n\n2. The method of claim 1, wherein the formula to calculate Ŵt in Step 3 is defined as follows: W ^ t = μ x x = arg ⁢ ⁢ max x ∈ χ ⁢ ⁢ P ⁡ ( ∑ j n ⁢ X N ⁡ ( j ) ) X t + 1 ⁡ ( j ) = ∑ i = 1, ⁢ … ⁢, N ⁢ X t ⁡ ( i ) ⁢ P ij · W t + 1 ❘ X j.\n\n3. The method of claim 1, wherein the formulas to calculate πt|1:t−1 and Pij in Step 3 are defined as follows: π _ t ❘ 1 ⁢: ⁢ t - 1 = P ⁡ ( W 1, W 2, … ⁢, W t, X t = x i ❘ W 1 ⁢: ⁢ t ) · P ⁡ ( W t + 1 ❘ X t = x i, W 1 ⁢: ⁢ t ) ∑ i = 1 N ⁢ ⁢ P ⁡ ( W 1, W 2, … ⁢, W t, X t = x i ❘ W 1 ⁢: ⁢ t ) · P ⁡ ( W t + 1 ❘ X t = x i, W 1 ⁢: ⁢ t ) ⁢ P _ ij = P ⁡ ( W 1, W 2, … ⁢, W t, X t = x i ❘ W 1 ⁢: ⁢ t ) ⁢ P ij · W t + 1 ❘ X j · P ⁡ ( W t + 1, W t + 2 ❘ X t + 1 = x i + 1, W 1 ⁢: ⁢ t + 1 ) ∑ i = 1 N ⁢ ⁢ P ⁡ ( W 1, W 2, … ⁢, W t, X t = x i ❘ W 1 ⁢: ⁢ t ) · P ⁡ ( W t + 1 ❘ X t = x i, W 1 ⁢: ⁢ t ).\n\nPatent History\nPatent number: 10834368\nType: Grant\nFiled: Dec 13, 2018\nDate of Patent: Nov 10, 2020\nPatent Publication Number: 20190191130\nAssignee: SICHUAN UNIVERSITY (Chengdu)\nInventors: Junfeng Wang (Chengdu), Qin Luo (Chengdu), Ying Liu (Chengdu), Hao Niu (Chengdu), Xiaohui Li (Chengdu)\nPrimary Examiner: Jeffrey M Rutkowski\nAssistant Examiner: Mehedi S Aley\nApplication Number: 16/219,844\nClassifications\nCurrent U.S. Class: Determination Of Communication Parameters (370/252)\nInternational Classification: H04N 7/20 (20060101); H04B 17/391 (20150101); H04N 21/647 (20110101); H04N 21/643 (20110101); H04L 25/03 (20060101); H04N 21/24 (20110101); H04N 21/6375 (20110101); H04N 21/238 (20110101); H04N 21/2343 (20110101); H04N 21/2381 (20110101); H04N 21/61 (20110101);" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.884672,"math_prob":0.94441795,"size":19709,"snap":"2021-04-2021-17","text_gpt3_token_len":4626,"char_repetition_ratio":0.15833545,"word_repetition_ratio":0.17048268,"special_character_ratio":0.22918464,"punctuation_ratio":0.11962365,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.96008277,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-01-17T20:09:56Z\",\"WARC-Record-ID\":\"<urn:uuid:add67229-249e-4db9-aab8-8747d0d4ef88>\",\"Content-Length\":\"103481\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:abbac678-b072-48d1-ab1c-f017a762233e>\",\"WARC-Concurrent-To\":\"<urn:uuid:db753bf0-6580-493b-b225-0da80861120a>\",\"WARC-IP-Address\":\"3.223.160.239\",\"WARC-Target-URI\":\"https://patents.justia.com/patent/10834368\",\"WARC-Payload-Digest\":\"sha1:MTFJYDEKW2AWAM35CQTKU2O2MDLDTKP5\",\"WARC-Block-Digest\":\"sha1:NWJI7VT3XHKGTGUFWTQUES66JOGIOVXJ\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-04/CC-MAIN-2021-04_segments_1610703513144.48_warc_CC-MAIN-20210117174558-20210117204558-00573.warc.gz\"}"}
https://calculator.name/area/square-rod/square-meter/0.99
[ "Amount\nFrom\nTo\n\n# 0.99 square rods to square meters\n\nHow many square meters in 0.99 square rods? 0.99 square rods is equal to 25.039924114 square meters.\n\nThis page provides you how to convert between square rods and square meters with conversion factor.\n\n# How to convert 0.99 square rods to m2?\n\nTo convert 0.99 square rods into m2, follow these steps:\n\nWe know that, 1 square rods = 25.29285264 m2\n\nHence, to convert the value of 0.99 square rods into square meters, multiply both sides by 0.99 and we get:\n\n1 square rods = 25.29285264 m2\n\n(1 * 0.99) square rods = (25.29285264 * 0.99) m2\n\n0.99 square rods = 25.039924114 m2\n\n### Thus, 0.99 square rods equals to 25.039924114 m2\n\nSquare Rods Conversion of Square Rods to Square Meters\n0.98 square rods 0.98 square rods = 24.786995587 m2\n0.89 square rods 0.89 square rods = 22.51063885 m2\n0.99 square rods 0.99 square rods = 25.039924114 m2\n1.99 square rods 1.99 square rods = 50.332776754 m2" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.7631905,"math_prob":0.999899,"size":797,"snap":"2023-40-2023-50","text_gpt3_token_len":272,"char_repetition_ratio":0.31651956,"word_repetition_ratio":0.044444446,"special_character_ratio":0.4404015,"punctuation_ratio":0.18085106,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9997602,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-11-28T12:31:35Z\",\"WARC-Record-ID\":\"<urn:uuid:cc76e82c-67ff-47d9-b5ba-e64a434e40e4>\",\"Content-Length\":\"132236\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:c51e1667-9564-4045-b7e3-a4ddf670adfb>\",\"WARC-Concurrent-To\":\"<urn:uuid:2d83f011-8d35-4e15-bbfd-ffe08604b72a>\",\"WARC-IP-Address\":\"68.178.147.160\",\"WARC-Target-URI\":\"https://calculator.name/area/square-rod/square-meter/0.99\",\"WARC-Payload-Digest\":\"sha1:EXWM22KEVEVLXAY5AHZH7SAM7HEYJLG7\",\"WARC-Block-Digest\":\"sha1:FGMAJA2WXAKEQI6FQ2LPCCZMZCWHSCAT\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-50/CC-MAIN-2023-50_segments_1700679099514.72_warc_CC-MAIN-20231128115347-20231128145347-00294.warc.gz\"}"}
http://ntour.ntou.edu.tw:8080/ir/handle/987654321/50482
[ "", null, "English  |  正體中文  |  简体中文  |  Items with full text/Total items : 27314/39158 Visitors : 2473805      Online Users : 94\n Scope All of NTOUR 工學院    河海工程學系       --期刊論文 Adv. Search\n National Taiwan Ocean University Institutional Repository > 工學院 > 河海工程學系 > 期刊論文 >  Item 987654321/50482\n\n Please use this identifier to cite or link to this item: `http://ntour.ntou.edu.tw:8080/ir/handle/987654321/50482`\n\n Title: A Scalar Homotopy Method for Solving an Over/Under-Determined System of Non-Linear Algebraic Equations Authors: Chein-Shan LiuWeichung YeihChung-Lun KuoSatya N. Atluri Contributors: 國立臺灣海洋大學:河海工程學系 Keywords: Nonlinear algebraic equationsIterative methodOrdinary differential equationsScalar homotopy method (SHM) Date: 2009-12 Issue Date: 2018-10-12T03:24:20Z Publisher: CMES: Computer Modeling in Engineering & Science Abstract: Abstract: Iterative algorithms for solving a system of nonlinear algebraic equations (NAEs): Fi(xj) = 0, i, j= 1,. . . ,n date back to the seminal work of Issac Newton. Nowadays a Newton-like algorithm is still the most popular one to solve the NAEs, due to the ease of its numerical implementation. However, this type of algorithm is sensitive to the initial guess of solution, and is expensive in terms of the computations of the Jacobian matrix ∂Fi/∂ xj and its inverse at each iterative step. In addition, the Newton-like methods restrict one to construct an iteration procedure for n-variables by using n-equations, which is not a necessary condition for the existence of a solution for underdetermined or overdetermined system of equations. In this paper, a natural system of first-order nonlinear Ordinary Differential Equations (ODEs) is derived from the given system of Nonlinear Algebraic Equations (NAEs), by introducing a scalar homotopy function gauging the total residual error of the system of equations. The iterative equations are obtained by numerically integrating the resultant ODEs, which does not need the inverse of ∂Fi/∂ xj . The new method keeps the merit of homotopy method, such as the global convergence, but it does not involve the complicated computation of the inverse of the Jacobian matrix. Numerical examples given confirm that this Scalar Homotopy Method (SHM) is highly efficient to find the true solutions with residual errors being much smaller. Relation: 53(1) pp.47-71 URI: http://ntour.ntou.edu.tw:8080/ir/handle/987654321/50482 Appears in Collections: [河海工程學系] 期刊論文\n\nFiles in This Item:\n\nFile Description SizeFormat\nindex.html0KbHTML25View/Open" ]
[ null, "http://ntour.ntou.edu.tw:8080/ir/image/logo.gif", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.80542964,"math_prob":0.773238,"size":2378,"snap":"2019-51-2020-05","text_gpt3_token_len":638,"char_repetition_ratio":0.10488627,"word_repetition_ratio":0.0,"special_character_ratio":0.23675357,"punctuation_ratio":0.14285715,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9684252,"pos_list":[0,1,2],"im_url_duplicate_count":[null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-12-13T00:24:56Z\",\"WARC-Record-ID\":\"<urn:uuid:ec4f2537-496f-4aac-8677-23d1469835a3>\",\"Content-Length\":\"27440\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:22083248-54c0-4029-8a76-25b82fae9f69>\",\"WARC-Concurrent-To\":\"<urn:uuid:e0b2012e-889e-48a1-b194-3efeee313bd5>\",\"WARC-IP-Address\":\"140.121.140.13\",\"WARC-Target-URI\":\"http://ntour.ntou.edu.tw:8080/ir/handle/987654321/50482\",\"WARC-Payload-Digest\":\"sha1:L5IOFLURN4F7KHYTCZJQUKVSIB7ZSGXJ\",\"WARC-Block-Digest\":\"sha1:WDGNNULCJNQ3NWBRSOICM7A64K5AEYT4\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-51/CC-MAIN-2019-51_segments_1575540547536.49_warc_CC-MAIN-20191212232450-20191213020450-00047.warc.gz\"}"}
https://www.geeksforgeeks.org/circles/
[ "Open In App\nRelated Articles\n• CBSE Class 9 Maths Revision Notes\n• CBSE Class 9 Maths Formulas\n• NCERT Solutions for Class 9 Maths\n• RD Sharma Class 9 Solutions\n\n# Circle\n\nIn maths, a circle is a 2-D closed shape. It is the basic shape that we observed a lot in our daily life. In maths, a circle is defined as a curve in which all the points on the curve are equal distances from a fixed point. The fixed point is called the centre of the circle and the fixed distance is the radius of the circle. We came across various objects that resemble the circle in real life such as coins, CDs, DVDs, Bangles, etc all resemble circular shapes.\n\nThe circle has various formulas including the area of circle and the circumference of circle. Area of the circle is defined as the space occupied inside the boundary of the circle that the circumference of the circle is the length of the boundary of the circle.\n\nLet us more about what is a circle, circle formulas, and important terms along with examples and FAQs in detail in this article.", null, "Table of Content\n\n## What is Circle in maths?\n\nA circle is a two-dimensional closed figure formed by joining all the points which are at a fixed distance from a fixed point. It is also defined as the locus of the point which is always at a constant distance from a fixed point. The fixed point is called the origin or the centre of the circle and the fixed distance of the points from the origin is called the radius of the circle. We can have an infinite radius of a circle. All the lines passing through the centre of the circle divide the circle into two equal parts that are mirror images of each other. The equation of the circle in the cartesian plane with centre at (h, k) and radius r is,\n\n(x-h)2 + (y-k)2 = r2\n\n### Definition of Circle:\n\nA circle is a two-dimensional geometric shape that consists of all points in a plane that are equidistant (at the same distance) from a fixed point called the center. The distance from the center to any point on the circle is called the radius of the circle\n\n## Circle Shaped Objects\n\nVarious objects that we observe in real life are circular shapes. Some examples of circular-shaped objects are,\n\n• Chapattis\n• Coins\n• Wheels\n• Rings\n• Buttons\n• CDs / DVDs\n• Bangles\n• Plates\n\nApart from these many more objects from day-to-day life resembles circular objects. The image added below show some real example of the circle,", null, "## How to Draw a Circle?\n\nDrawing a circle is the most basic construction problem that is taught to students. Construction a circle requires some basic tools such as,\n\n• Pencil\n• Compass\n• Scale or Ruler\n\nTo draw a circle follow the steps below,\n\nStep 1: Attach the pencil to the compass and make sure the tip of the compass and pencil are aligned properly.\n\nStep 2: Mark a point on the paper and call it the centre of the circle.\n\nStep 3: Measure the radius of the circle using the ruler and adjust the compass accordingly.\n\nStep 4: Draw the circle using the compass from the centre point marked in Step 2.\n\n## Parts of a Circle\n\nA circle has various parts and some of the important parts of the circle that are used to study the properties and theorems of the circle are,\n\nCentre of Circle: It is defined as the point from which any point on the circumference of the circle is at a fixed distance.\n\nRadius of Circle: The distance between any point on the circumference of the circle and the fixed point called the centre is called the radius of the circle. It is denoted using the letter ‘r’. A circle can have an infinite radius.\n\nDiameter of Circle: We define the diameter of the circle as the straight line passing through the centre of the circle and connecting any two points on the boundary of the circle. It is denoted by the letter ‘D’. The relation between the radius and the centre is,\n\nD = 2r\n\nChord of a Circle: Any line which touches the circle at two points on its circumference is the chord of the circle. The diameter is also a chord of the circle. The longest chord of the circle is the diameter of the circle.\n\nTangent: A line that touches the circle only at one point on its circumference is called the tangent of the circle. It is always perpendicular to the radius of the circle at the point of tangency.\n\nSecant: A line intersecting the circumference of the circle is called the secant on the circle. We also call it the extended chord.\n\nArc of a Circle: Any portion of the circumference of the circle is called the arc of the circle.\n\nSegment in a Circle: The chord divides the circle into two parts and each part is called the segment of the circle. There are two segments formed by a chord that is,\n\n• Major Segment.\n• Minor Segment\n\nSector of a Circle: The area between two radii and the corresponding arc in a circle is called the sector of the circle. There are two types of sectors\n\n• Major Sector\n• Minor Sector\n\nThe image added below shows the parts of a circle.", null, "The fixed point is named the centre of the circle and therefore the fixed distance is named the radius of the circle. The constant distance between any point on the circle and its centre is called the radius. Note that the line segment joining the centre and any point on the circle is additionally called a radius of the circle.\n\nr = D/2", null, "### Diameter of Circle (D)\n\nA chord passing through the centre of the circle is called the diameter of the circle. Two radii at 180 degrees angle are the diameter of the circle. Diameter is the largest chord of the circle and every diameter has an equivalent length, which is adequate to twice the radius.\n\nD = 2r", null, "## Interior and Exterior of Circle\n\nIf we draw a circle it divides the 2-D plane into three parts which are,\n\n• Inside the Circle: A point lying in the plane of the circle such that its distance from its centre is less than the radius of the circle is known as the interior point.\n• On the Circle: Points lying in the plane of the circle such that its distance from its centre is equal to the radius of a circle. In simple words, a set of points lying on the circle are points on the circumference of a circle.\n• Outside the Circle: Points lying in the plane of the circle such that its distance from its centre is greater than the radius of the circle are exterior points.\n\n## Circle Formulas\n\nThere are various formulas related to the circle. Let the radius of the circle is ‘r’ then some of the important formulas related to the circle are,\n\nParts\n\nFormulae\n\nArea of Circleπr2\nCircumference of Circle2πr\nLength of Arc\n\nθ × r\n\nwhere,\n‘θ’ is the angle subtended by the arc in radian\n‘r’ is the radius of the arc\n\nArea of Sector of Circle\n\n(θ × r2) / 2\n\nwhere,\n‘θ’ is the angle subtended by the arc in radian\n‘r’ is the radius of the arc\n\nLength of Chord\n\n2 r sin(θ/2)\n\nwhere,\n\nArea of Segment\n\nr2(θ − sinθ)/2\n\nwhere,\n\nThe value of π is taken to be 3.14 or 22/7.\n\n## Properties of Circle\n\nA circle is the most common 2-D shape and some of the properties of the circle are,\n\n• Circle with the same radii are called the congruent circle.\n• Equal chords are equidistant from the centre of the circle.\n• Equidistant chords from the centre of the circle are always equal.\n• The perpendicular drawn from the centre of the circle to the chord always bisects the chord.\n• We can draw two tangents from an external point to a circle.\n• Tangents drawn from the endpoints of the diameter are always parallel to each other.\n\n## Area of a Circle Proof\n\nWe can easily prove the formula for the area of the circle using the area of the triangle formula. For this first, we have to draw various concentric circles inside the given circle. Then open all the concentric circles to form a right-angled triangle.", null, "If the radius of the given circle is r, then the outer circle would form the base of the right triangle having length 2πr.\n\nThe height of the triangle is ‘r’\n\nThe area of the right-angled triangle so formed is equal to the area of a circle.\n\nArea of a circle = Area of triangle = (1/2) × base × height\n\n= (1/2) × 2π r  × r\n\nTherefore,\n\nArea of a Circle = πr2\n\nRelated Resources:\n\n## Solved Examples on Circles\n\nExample 1: If the diameter of a circle is 142.8 mm, then what is the radius of the circle?\n\nSolution:\n\nDiameter = 142.8 mm\n\nBy Formula,\n\n= 71.4 mm\n\nThus, the radius of the circle is 71.4 mm\n\nExample 2: The distance around a park is 21.98 yd. What is the radius of the park?\n\nSolution:\n\nCircumference of the Park = 21.98 yd\n\nWe know that,\n\n= 3.5\n\nThus, the radius of the circle is 3.5 yd\n\nExample 3: The inner circumference of a circular track is 440 m, and the track is 14 m wide. Calculate the cost of levelling the track at 25 rupees/m2.\n\nSolution:\n\nLet the radius of the inner circle be r m.\n\nNow,\n\nInner Circumference = 440 m\n\n2πr = 440\n\n2 × 22/7 × r = 440\n\nr = 440 × 744\n\nWidth of track = 14 m\n\n= (70 + 14) = 84 m\n\nArea of the Track = π(R2− r2)\n\n= π (842 – 702)\n\n= 22/7 × (7056 – 4900)\n\n= 6776 m2\n\nCost of levelling at 25 rupees per square meter =  6676 × 25\n= 169400 Rupees\n\nThus, the cost of leveling the track is 169400 Rupees\n\nExample 4: Find the length of the chord of a circle where the radius is 7 cm and the perpendicular distance from the chord to the centre is 4 cm.\n\nSolution:\n\nGiven,\n\nDistance of the chord to the centre, d = 3 cm\n\nChord length = 2√(r2 – d2\n\n= 2√(82 – 32\n\n= 2√(64 – 9)\n\n= 2√55\n\n= 2 × 7.416\n\nChord length = 14.83 cm\n\nThus, the length of the chord is 14.83 cm\n\nExample 5: If the radius of a circle is 5 cm and the measure of the angle of the arc is 110˚, what is the length of the arc?\n\nSolution:\n\nArc Length = (2 × π × r) × angle / 360°\n\n= 2 × 3.14 × 5 × 110/360°\n\n= 9.6 cm\n\nThus, the length of the arc is 9.6 cm.\n\nExample 6: If the area of a sector with a radius of 6 cm is 35.4 cm2. Calculate the angle of the sector.\n\nSolution:\n\nArea of Sector = Angle/360°  × (π × r × r)\n\nAngle/360° × (π × 6 × 6) = 35.4\n\nAngle = (35.4/36π) × 360°\n\n= 112.67°\n\nThus, the angle of the sector is, 112.67°\n\n## FAQs on Circles\n\n### 1. What is a Circle in Geometry?\n\nWe define a circle in geometry as the locus of the point which is always at a fixed distance from a fixed point, called the centre of the circle.\n\n### 2. What are the formulas of a Circle?\n\nA circle has various formulas but the important formulas for the circle are,\n\n• Area of Circle(A) = πr2\n• Circumference of Circle(C) = 2πr\n\n### 3. What is the Chord in a Circle?\n\nA line segment joining two points of the circumference of the circle is called the chord of the circle. A chord passing through the centre of the circle is called the radius of the circle.\n\n### 4. What is the Difference between Chord and Secant in a Circle?\n\nA chord is a line segment which joints any two points on the circumference of the circle, whereas the secant is a line joining any two points on the circumference of the circle, it is also called as extended chord.\n\n### 5. What is the Circumference of a Circle?\n\nThe length of the boundary of the circle is called the circumference of the circle. It is calculated using the formula,\n\nC = 2πr\n\n### 6. What is the Area of a Circle?\n\nThe space occupied inside the circumference of the circle is called Area of the area of the circle. It is calculated using the formula,\n\nA = πr2\n\n### 7. What are the Properties of Circles?\n\nThe properties of the circle are,\n\n• It has the infinite number of radii.\n• The radius of the circle is always perpendicular to the tangent of the circle.\n• Diameter is the longest chord of the circle\n\n### 8. What are Types of Circles in maths?\n\nWe can categorize circles into various categories but the important types of circles are\n\n• Concentric Circles: Circles having different radii but the same centre are called concentric circles.\n• Congruent Circles: Circles having the same radius but different centres are called congruent circles." ]
[ null, "https://media.geeksforgeeks.org/wp-content/uploads/20230822111030/Cicle.png", null, "https://media.geeksforgeeks.org/wp-content/uploads/20230427100511/Circumference-of-Circle-3.jpg", null, "https://media.geeksforgeeks.org/wp-content/uploads/20230606132937/Area-Related-to-Circle-Extra-1.png", null, "https://media.geeksforgeeks.org/wp-content/uploads/20230606135050/Rdius.PNG", null, "https://media.geeksforgeeks.org/wp-content/uploads/20230606134955/Diameter.PNG", null, "https://media.geeksforgeeks.org/wp-content/uploads/20230606131601/Circle-area-using-triangle.PNG", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.91572946,"math_prob":0.9887497,"size":11661,"snap":"2023-40-2023-50","text_gpt3_token_len":2960,"char_repetition_ratio":0.25349575,"word_repetition_ratio":0.13442768,"special_character_ratio":0.2575251,"punctuation_ratio":0.08728179,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99956065,"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\":\"2023-09-27T15:33:33Z\",\"WARC-Record-ID\":\"<urn:uuid:b492f098-3c40-4874-b778-b9e0993060c3>\",\"Content-Length\":\"291817\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:c99ac03c-bae6-4672-a9d9-043fee3e1782>\",\"WARC-Concurrent-To\":\"<urn:uuid:be4c11bb-637c-493c-8109-030ddab1b984>\",\"WARC-IP-Address\":\"23.218.218.77\",\"WARC-Target-URI\":\"https://www.geeksforgeeks.org/circles/\",\"WARC-Payload-Digest\":\"sha1:OH76U6JANJVLFPD6S336AVRGRQNMKRJB\",\"WARC-Block-Digest\":\"sha1:E7OFQCJTRBXP6O5OKJBD666XZ4G7TKZC\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-40/CC-MAIN-2023-40_segments_1695233510300.41_warc_CC-MAIN-20230927135227-20230927165227-00039.warc.gz\"}"}
https://au.mathworks.com/matlabcentral/cody/problems/42940-modulus-of-a-number/solutions/2202564
[ "Cody\n\n# Problem 42940. modulus of a number\n\nSolution 2202564\n\nSubmitted on 9 Apr 2020 by Jamal Nasir\nThis solution is locked. To view this solution, you need to provide a solution of the same size or smaller.\n\n### Test Suite\n\nTest Status Code Input and Output\n1   Pass\nx = 1; y_correct = 1; assert(isequal(your_fcn_name(x),y_correct))\n\n2   Pass\nx = -1; y_correct = 1; assert(isequal(your_fcn_name(x),y_correct))\n\n3   Pass\nx = -3; y_correct = 3; assert(isequal(your_fcn_name(x),y_correct))\n\n### Community Treasure Hunt\n\nFind the treasures in MATLAB Central and discover how the community can help you!\n\nStart Hunting!" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.7092015,"math_prob":0.94997084,"size":688,"snap":"2020-45-2020-50","text_gpt3_token_len":193,"char_repetition_ratio":0.14035088,"word_repetition_ratio":0.018867925,"special_character_ratio":0.2863372,"punctuation_ratio":0.103174604,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9741278,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-12-02T19:54:38Z\",\"WARC-Record-ID\":\"<urn:uuid:ed875355-1865-4c7f-b220-6f06dbd9b96e>\",\"Content-Length\":\"80302\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:cfdf56ae-0555-4495-a0ee-73ac2cd982a2>\",\"WARC-Concurrent-To\":\"<urn:uuid:2e75f595-3897-4c0a-b2af-6004d517e649>\",\"WARC-IP-Address\":\"23.32.68.178\",\"WARC-Target-URI\":\"https://au.mathworks.com/matlabcentral/cody/problems/42940-modulus-of-a-number/solutions/2202564\",\"WARC-Payload-Digest\":\"sha1:OESRSRKK5ZLQCQHYUEI7XTRQBTZDCOIL\",\"WARC-Block-Digest\":\"sha1:GIA3EPYWPPNGUJGDSCDXBJWZEDTU6WH7\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-50/CC-MAIN-2020-50_segments_1606141715252.96_warc_CC-MAIN-20201202175113-20201202205113-00028.warc.gz\"}"}
https://samritchie.io/optics-and-the-principle-of-least-time/
[ "# Optics and the Principle of Least Time\n\n(This is a writeup of Exercise 1.3 from Sussman and Wisdom's \"Structure and Interpretation of Classical Mechanics\". See the solutions repository for more.)\n\nThe problem explores some consequences for optics of the principle of least time. The exercise states:\n\nFermat observed that the laws of reflection and refraction could be accounted for by the following facts: Light travels in a straight line in any particular medium with a velocity that depends upon the medium. The path taken by a ray from a source to a destination through any sequence of media is a path of least total time, compared to neighboring paths. Show that these facts imply the laws of reflection and refraction.\n\n## Law of Reflection\n\nThe law of reflection is described in the footnote:\n\nFor reflection the angle of incidence is equal to the angle of reflection.\n\nHere's the setup. The horizontal line is a mirror. The law states that $$\\theta_1 = \\theta_2$$.", null, "We have to show that if we consider all possible paths from a given starting point to a given endpoint, the path of minimum time will give us the law of reflection.\n\nThe actual path of minimum time is the straight line that avoids the mirror, of course. If we force the light to bounce off of the mirror, then we have to figure out where it will hit, where $$x_p$$ is, to minimize the time between the start and end points.\n\nThere are two ways to solve this problem. We can use geometry and visual intuition, or we can use calculus.\n\n### Geometry\n\nFirst, recall this fact from the problem text:\n\nLight travels in a straight line in any particular medium with a velocity that depends upon the medium.\n\nThere's no medium change, so if there were no mirror in its path, the light beam would continue in a straight line. Instead of figuring out what the beam will do when it hits the mirror, reflect the endpoint across the mirror and draw a straight line between the start and \"end\" points:", null, "The angle that the beam makes with the plane of the mirror is the same on both sides of the mirror.\n\nNow reflect the the \"end\" point and the segment of the beam that's crossed the mirror back up. By symmetry, $$\\theta_1 = \\theta_2$$, and we've proved the law of reflection.\n\n### Calculus\n\nWe can also solve this with calculus. Because the beam doesn't change media, its speed $$v$$ stays constant, so minimizing the total distance $$d$$ is equivalent to minimizing the time $$t = {d \\over v}$$.\n\nSet $$x_1 = 0$$ for convenience, and write the total distance the light travels as a function of $$x_p$$:\n\n\\begin{equation}\nd(x_p) = \\sqrt{y_1^2 + x_p^2} + \\sqrt{(x_2 - x_p)^2 + y_2^2}\n\\end{equation}\n\nFor practice, we can also define this function in Scheme.\n\n(define ((total-distance x1 y1 x2 y2) xp)\n(+ (sqrt (+ (square (+ x1 xp))\n(square y1)))\n(sqrt (+ (square (- x2 (+ x1 xp)))\n(square y2)))))\n\n\nHere's the function again, generated from code, with general $$t_1$$:\n\n(->tex-equation\n((total-distance 'x_1 'y_1 'x_2 'y_2) 'x_p))\n\n\n\\begin{equation}\n\\sqrt{{{x}_{1}}^{2} + 2 {x}_{1} {x}_{p} + {{x}_{p}}^{2} + {{y}_{1}}^{2}} + \\sqrt{{{x}_{1}}^{2} - 2 {x}_{1} {x}_{2} + 2 {x}_{1} {x}_{p} + {{x}_{2}}^{2} - 2 {x}_{2} {x}_{p} + {{x}_{p}}^{2} + {{y}_{2}}^{2}}\n\\end{equation}\n\nTo find the $$x_p$$ that minimizes the total distance,\n\n• take the derivative with respect to $$x_p$$,\n• set it equal to 0 and\n• solve for $$x_p$$.\n\nThe derivative will look cleaner in code if we keep the components of the sum separate and prevent Scheme from \"simplifying\". Redefine the function to return a tuple:\n\n(define ((total-distance* x1 y1 x2 y2) xp)\n(up (sqrt (+ (square (+ x1 xp))\n(square y1)))\n(sqrt (+ (square (- x2 (+ x1 xp)))\n(square y2)))))\n\n\nHere are the sum components:\n\n(->tex-equation\n((total-distance* 0 'y_1 'x_2 'y_2) 'x_p))\n\n\n\\begin{equation}\n\\begin{pmatrix} \\displaystyle{ \\sqrt{{{x}_{p}}^{2} + {{y}_{1}}^{2}}} \\cr \\cr \\displaystyle{ \\sqrt{{{x}_{2}}^{2} - 2 {x}_{2} {x}_{p} + {{x}_{p}}^{2} + {{y}_{2}}^{2}}}\\end{pmatrix}\n\\end{equation}\n\nTaking a derivative is easy with scmutils. Just wrap the function in D:\n\n(let* ((distance-fn (total-distance* 0 'y_1 'x_2 'y_2))\n(derivative (D distance-fn)))\n(->tex-equation\n(derivative 'x_p)))\n\n\n\\begin{equation}\n\\begin{pmatrix} \\displaystyle{ {{{x}_{p}}\\over {\\sqrt{{{x}_{p}}^{2} + {{y}_{1}}^{2}}}}} \\cr \\cr \\displaystyle{ {{ - {x}_{2} + {x}_{p}}\\over {\\sqrt{{{x}_{2}}^{2} - 2 {x}_{2} {x}_{p} + {{x}_{p}}^{2} + {{y}_{2}}^{2}}}}}\\end{pmatrix}\n\\end{equation}\n\nThe first component is the base of base $$x_p$$ of the left triangle over the total length. This ratio is equal to $$\\cos \\theta_1$$:", null, "The bottom component is $$-\\cos \\theta_2$$, or $${- (x_2 - x_p)}$$ over the length of the right segment. Add these terms together, set them equal to 0 and rearrange:\n\n\\begin{equation}\n\\label{eq:reflect-laws}\n\\cos \\theta_1 = \\cos \\theta_2 \\implies \\theta_1 = \\theta_2\n\\end{equation}\n\nThis description in terms of the two incident angles isn't so obvious from the Scheme code. Still, you can use Scheme to check this result.\n\nIf the two angles are equal, then the left and right triangles are similar, and the ratio of each base to height is equal:\n\n\\begin{equation}\n\\label{eq:reflect-ratio}\n{x_p \\over y_1} = {{x_2 - x_p} \\over y_2}\n\\end{equation}\n\nSolve for $$x_p$$ and rearrange:\n\n\\begin{equation}\n\\label{eq:reflect-ratio2}\nx_p = {{y_1 x_2} \\over {y_1 + y_2}}\n\\end{equation}\n\nPlug this in to the derivative of the original total-distance function, and we find that the derivative equals 0, as expected:\n\n(let* ((distance-fn (total-distance 0 'y_1 'x_2 'y_2))\n(derivative (D distance-fn)))\n(->tex-equation\n(derivative (/ (* 'y_1 'x_2) (+ 'y_1 'y_2)))))\n\n\n\\begin{equation}\n0\n\\end{equation}\n\nIf a beam of light travels in a way that minimizes total distance (and therefore time in a constant medium), then it will reflect off of a mirror with the same angle at which it arrived. The law of reflection holds.\n\n## Law of Refraction\n\nThe law of refraction is also called Snell's law. Here's the description from the footnote:\n\nRefraction is described by Snell's law: when light passes from one medium to another, the ratio of the sines of the angles made to the normal to the interface is the inverse of the ratio of the refractive indices of the media. The refractive index is the ratio of the speed of light in the vacuum to the speed of light in the medium.\n\nFirst we'll tackle this with calculus.\n\n### Calculus\n\nThe setup here is slightly different. We have a light beam traveling from one medium to another and changing speeds at a boundary located $$a$$ to the right of the starting point. The goal is to figure out the point where the light will hit the boundary, if we assume that the light will take the path of least time.", null, "The refractive index $$n_i = {c \\over v_i}$$, the speed of light $$c$$ in a vacuum over the speed in the material. Rearranging, $$v_i = {c \\over n_i}$$.\n\nTime is distance over speed, so the total time that the beam spends between the start and end points as a function of $$y_p$$, the point of contact with the boundary, is:\n\n\\begin{equation}\n\\begin{split}\nt(y_p) & = {c \\sqrt{a^2 + y_p^2}\\over v_1} + {c \\sqrt{(x_2 - x_p)^2 + y_2^2} \\over v_2} \\\n& = {n_1 \\over c} \\sqrt{a^2 + y_p^2} + {n_2 \\over c} \\sqrt{(x_2 - x_p)^2 + y_2^2}\n\\end{split}\n\\end{equation}\n\nTake the derivative:\n\n\\begin{equation}\nDt(y_p) = {1 \\over c} \\left({n_1 y_p \\over \\sqrt{a^2 + y_p^2}} - {n_2 (x_2 - x_p) \\over \\sqrt{(x_2 - x_p)^2 + y_2^2}}\\right)\n\\end{equation}\n\nSet the derivative equal to 0 and split terms:\n\n\\begin{equation}\n\\label{eq:almost-snell}\n{n_1 y_p \\over \\sqrt{a^2 + y_p^2}} = {n_2 (x_2 - x_p) \\over \\sqrt{(x_2 - x_p)^2 + y_2^2}}\n\\end{equation}\n\nSimilar to the law of reflection's result, each term (up to its $$n_i$$ multiple) is equal to the height of the left or right triangle over the length of the beam's path on the left or right of the boundary.\n\nEquation \\eqref{eq:almost-snell} simplifies to:\n\n\\begin{equation}\nn_1 \\sin \\theta_1 = n_2 \\sin \\theta_2\n\\end{equation}\n\nRearranging yields Snell's law:\n\n\\begin{equation}\n{n_1 \\over n_2} = {\\sin \\theta_2 \\over \\sin \\theta_1}\n\\end{equation}\n\n### Geometry\n\nI won't recreate this here, but the Feynman Lectures on Physics, in Lecture 26, has a fantastic discussion about, and derivation of, the law of refraction using no calculus, just geometry. I highly recommend you check out that lecture. Feynman lays out a number of examples of how the principle of least time is not just a restatement of the optical rules we already knew.\n\nYou can use the idea to guess what shape of mirror you'd want to build to focus many light rays on a single point (a parabola), or how you might force all light rays coming out of a single point to meet up again at another point (build a converging lens).\n\nThis whole area of optics and least time has obsessed scientists for hundreds of years. Spend a few minutes poking around and see what you find." ]
[ null, "https://github.com/sritchie/sicm/raw/master/images/Lagrangian_Mechanics/2020-06-10_10-31-24_screenshot.png", null, "https://github.com/sritchie/sicm/raw/master/images/Lagrangian_Mechanics/2020-06-10_10-36-53_screenshot.png", null, "https://github.com/sritchie/sicm/raw/master/images/Lagrangian_Mechanics/2020-06-10_10-36-53_screenshot.png", null, "https://github.com/sritchie/sicm/raw/master/images/Lagrangian_Mechanics/2020-06-10_12-03-11_screenshot.png", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.8281164,"math_prob":0.9997863,"size":8785,"snap":"2023-14-2023-23","text_gpt3_token_len":2591,"char_repetition_ratio":0.13939187,"word_repetition_ratio":0.0734072,"special_character_ratio":0.31485486,"punctuation_ratio":0.07164179,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9999833,"pos_list":[0,1,2,3,4,5,6,7,8],"im_url_duplicate_count":[null,4,null,8,null,8,null,4,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-06-06T13:36:10Z\",\"WARC-Record-ID\":\"<urn:uuid:f1c8ed0c-c512-4cef-a0da-342e40317ae7>\",\"Content-Length\":\"29041\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:2ca1aee7-5d27-4d83-a554-17ac6d4d4e70>\",\"WARC-Concurrent-To\":\"<urn:uuid:c276e72b-ee8b-4fe1-8b9d-25981d0a1efa>\",\"WARC-IP-Address\":\"151.101.195.7\",\"WARC-Target-URI\":\"https://samritchie.io/optics-and-the-principle-of-least-time/\",\"WARC-Payload-Digest\":\"sha1:2EWK6Q2W2T6YTDIPBMWDLXVO7JQZQTKA\",\"WARC-Block-Digest\":\"sha1:UY4KP4GVIA7A3DOJSMJAATRVDIEBQCJQ\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-23/CC-MAIN-2023-23_segments_1685224652569.73_warc_CC-MAIN-20230606114156-20230606144156-00296.warc.gz\"}"}
https://instrumentationtools.com/how-to-read-gauge-analog-scales/
[ " How to Read Gauge Analog Scales - Inst Tools\n\n# How to Read Gauge Analog Scales\n\n#### 1. Interpret the pressure measurement displayed by this gauge mechanism, assuming a gauge accuracy of ± 1% full scale:", null, "#### How low and how high could this pressure actually be, given the stated accuracy of this gauge?\n\nPressure = 3750 PSI ± 60 PSI\n\nThis means the actual pressure could be as low as 3690 PSI or as high as 3810 PSI\n\n#### 2. Interpret the pressure measurement displayed by this gauge mechanism, assuming a gauge accuracy of ± 2% full scale:", null, "#### How low and how high could this pressure actually be, given the stated accuracy of this gauge?\n\nPressure = 7800 PSI ± 400 PSI\n\nThis means the actual pressure could be as low as 7400 PSI or as high as 8200 PSI\n\n#### 3. Interpret the pressure measurement displayed by this gauge mechanism, assuming a gauge accuracy of ± 0.5% full scale:", null, "#### How low and how high could this pressure actually be, given the stated accuracy of this gauge?\n\nPressure = 560 PSI ± 5 PSI\n\nThis means the actual pressure could be as low as 555 PSI or as high as 565 PSI.\n\n#### 4. Interpret the pressure measurement displayed by this gauge mechanism, assuming a gauge accuracy of ± 2% full scale:", null, "#### How low and how high could this pressure actually be, given the stated accuracy of this gauge?\n\nPressure = 2.5 ”H2O ± 0.6 ”H2O. This means the actual pressure could be as low as 1.9 ”H2O or as high as 3.1 ”H2O.\n\nIf you look closely at the photograph, you can see that the camera’s angle to the gauge face is not straight-on, and therefore there will be some parallax error in reading this gauge’s face.\n\nIf we were to lower the camera’s view to get a more direct look at the gauge, we might see the needle pointing between the 2.5 and 3 divisions, which would mean a pressure of 2.75 ”H2O ±0.6 ”H2O.\n\n#### 5. Interpret the pressure measurement displayed by this gauge mechanism, assuming a gauge accuracy of ± 2% full scale:", null, "#### How low and how high could this pressure actually be, given the stated accuracy of this gauge?\n\nPressure = 14 PSI ± 2 PSI\n\nThis means the actual pressure could be as low as 12 PSI or as high as 16 PSI.\n\n#### 6. Interpret the temperature measurement displayed by this gauge mechanism, and also identify the meaning of the other pointer:", null, "The current temperature is 40 degrees Celsius (red pointer), and the other pointer is a low-temperature capture. In this case, the “capture” pointer shows that the temperature went down as low as 20 degrees Celsius (or perhaps a bit lower, since parallax error is making that pointer appear to read higher than it actually is).\n\n#### 7. Interpret the measurement displayed by this Level Indicator :", null, "The red pointer shows 61% process level. The setpoint is a few percent less than that.\n\n#### 8. Interpret the air flow measurement displayed by this rotameter:", null, "Rounding to the nearest half-division, we see the center of the ball-plummet nearest the “1” mark. No units of measurement are specified on the scale (from this viewing angle, anyway), and so we cannot say if this is 1 SCFH, 1 SCFM, or anything else.\n\n#### 9. Interpret the pressure measurement displayed by this U-tube manometer, recalling that the pressure will be equal to the difference in heights between the two liquid columns:", null, "" ]
[ null, "https://cdn.instrumentationtools.com/wp-content/uploads/2017/09/instrumentationtools.com_pressure-gauge-analog-scale.png", null, "https://cdn.instrumentationtools.com/wp-content/uploads/2017/09/instrumentationtools.com_pressure-gauge-scale.png", null, "https://cdn.instrumentationtools.com/wp-content/uploads/2017/09/instrumentationtools.com_pressure-gauge-measurement.png", null, "https://cdn.instrumentationtools.com/wp-content/uploads/2017/09/instrumentationtools.com_pressure-gauge-reading.png", null, "https://cdn.instrumentationtools.com/wp-content/uploads/2017/09/instrumentationtools.com_gauge-display-scale.png", null, "https://cdn.instrumentationtools.com/wp-content/uploads/2017/09/instrumentationtools.com_temperature-gauge-reading.png", null, "https://cdn.instrumentationtools.com/wp-content/uploads/2017/09/instrumentationtools.com_level-indicator-display-scale.png", null, "https://cdn.instrumentationtools.com/wp-content/uploads/2017/09/instrumentationtools.com_rotameter-scale-reading.png", null, "https://cdn.instrumentationtools.com/wp-content/uploads/2017/09/instrumentationtools.com_level-gauge-using-manometer.png", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.92544234,"math_prob":0.92587674,"size":3402,"snap":"2021-31-2021-39","text_gpt3_token_len":812,"char_repetition_ratio":0.16421424,"word_repetition_ratio":0.33496732,"special_character_ratio":0.2489712,"punctuation_ratio":0.1125731,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9896863,"pos_list":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18],"im_url_duplicate_count":[null,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\":\"2021-08-03T03:49:25Z\",\"WARC-Record-ID\":\"<urn:uuid:bb6af3e9-fc98-4f5d-91f5-d41c8ebd5694>\",\"Content-Length\":\"136302\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:8195bed6-81c7-4555-8363-98b2631232f5>\",\"WARC-Concurrent-To\":\"<urn:uuid:005407dc-614d-49f1-9216-c6e5265f52b7>\",\"WARC-IP-Address\":\"172.67.218.42\",\"WARC-Target-URI\":\"https://instrumentationtools.com/how-to-read-gauge-analog-scales/\",\"WARC-Payload-Digest\":\"sha1:MHIFQ3XPNUP5ZAMTYKTBF6H2DXMTGA5H\",\"WARC-Block-Digest\":\"sha1:GVIIBYD7QTSQHTPD6ZYRFOUGZCVGYQRA\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-31/CC-MAIN-2021-31_segments_1627046154420.77_warc_CC-MAIN-20210803030201-20210803060201-00686.warc.gz\"}"}
https://www.scribd.com/document/317792191/20PCoordFull-pdf
[ "You are on page 1of 27\n\n# CoordinateGeometry\n\nNotes\nFullSet\n\nstandard form is\n\ny = mx + b\n\n## 3. Complete the square and find the vertex.\n\nTo 1 decimal place, find the coordinates of the point(s) of intersection of the graphs\nof\n\n## a) what point is the center of the circle? _________________\n\nb) what is the radius of the circle? ____________________\nc) use the distance formula to find the equation of the circle.\n\n## a) what point is the center of the circle? _________________\n\nb) what is the radius of the circle? ____________________\nc) use the distance formula to find the equation of the circle.\n\n(3,-2)\n\n(-5,3)\n\n(5,-2)\n\n(0,3)\n\nstandard form\n\ngeneral form\n\n## Put the equation of the circle in general form:\n\n10\n\nWrite these circles in standard form by completing the squares in both x and y. Give the\n\n11\n\n12\n\n## Equation of the Tangent Line to a Circle\n\n1. Give the equation of the circle. Then find the equations of the vertical and horizontal\ntangent lines to the cirle graphed below.\n\n2. Find the equations of the horizontal and vertical tangents to the circle given by\n\n13\n\n## For all \"slanted\" tangents follow these steps:\n\nsketch\nfind slope of tangent line\nuse y = mx + b to find the equation of the tangent line\n3. Find the equation of the tangent to\n\nat (4,-5).\n\n## For all \"slanted\" tangents follow these steps:\n\nsketch\nfind slope of tangent line\nuse y = mx + b to find the equation of the tangent line\n4. Find the equation of the tangent to\n\nat (2,-1).\n\n14\n\n15\n\n16\n\n17\n\n## Splitting a Segment into Equal Smaller Segments\n\nFind the points that split (-10,5) to (6,1) into four equal smaller segments.\n\n18\n\n## Calculating the Distance between Points and Lines\n\n1. Calculate the shortest distance between the point and each of the lines pictured in\nthe following graph.\n\n2. Calculate the shortest distance between the point and the line.\n\n## The line y = -2x + 3 and the point (-5,1).\n\nThe steps.\nfind the slope of the line\nfind the slope of the\nperpendicular line through\nthe point\nfind the equation of the\nperpendicular line\nsolve the system to get\nthe closest point\nfind the distance\n\n19\n\n3. Calculate the shortest distance between the point and the line.\n\n## The line 2x + 3y - 6 = 0 and the point (5,4).\n\nThe steps.\nfind the slope of the line\nfind the slope of the\nperpendicular line through\nthe point\nfind the equation of the\nperpendicular line\nsolve the system to get\nthe closest point\nfind the distance\n\n20\n\n## 2. Find the distance between the two vertical lines.\n\n3. Find the horizontal distance, the vertical distance and the shortest distance between\nthe two parallel lines. y = 2x - 6 and y = 2x + 4\n\n21\n\n4. Find the horizontal distance, the vertical distance and the shortest distance between\nthe two parallel lines. 2x + 3y -6 = 0 and 2x + 3y + 12 = 0.\n\nVerifying Conjectures\n\n## Consider triangle A(-1,3), B(1,7) and\n\nC(5,5).\na) verify that triangle ABC is a right\ntriangle\n\nparallel to BC.\n\n22\n\n## A line segment has endpoints M(8,6) and N(-6,8).\n\na) verify that the endpoints are on the circle.\n\nb) determine the equation of the line through the center of the circle and the midpoint\nof the chord MN\n\n## c) verify that the new line\n\nand MN are perpendicular\n\nProving Conjectures\nProve that the diagonals of a square are perpendicular.\n\n23\n\n## Coordinate Geometry - unit review\n\nCalculate the length, the slope and the midpoint of the segment below.\n\nSeparate the segment from (-8,6) to (22,-6) into six smaller segments of equal\nlength.\n\n24\n\nFind\n\ncenter\ndomain\nrange\nx intercepts\nvertical tangents\n\n## Calculate the equation of the tangent to\n\nat (4,-1) .\n\n25\n\nFind the shortest distance from the point (1,3) to the line 4x - 3y - 12 = 0.\n\n26\n\n27" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.86159956,"math_prob":0.99915636,"size":1951,"snap":"2019-43-2019-47","text_gpt3_token_len":509,"char_repetition_ratio":0.16692348,"word_repetition_ratio":0.16766468,"special_character_ratio":0.26089185,"punctuation_ratio":0.11640212,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99990916,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-11-13T04:48:12Z\",\"WARC-Record-ID\":\"<urn:uuid:99d63be3-3b2d-4a9a-b9e0-438e392f1ee7>\",\"Content-Length\":\"283983\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:98f46fff-b785-4b34-920d-0b35771602da>\",\"WARC-Concurrent-To\":\"<urn:uuid:9459390d-48cf-471b-a7bb-e967d9c343f9>\",\"WARC-IP-Address\":\"151.101.202.152\",\"WARC-Target-URI\":\"https://www.scribd.com/document/317792191/20PCoordFull-pdf\",\"WARC-Payload-Digest\":\"sha1:4R6VRDX73UGWU65CMJ2OLT55UY4ZVH33\",\"WARC-Block-Digest\":\"sha1:DCI5CWBT3ZYRVM5KOA46E4ZRPWBAC3MV\",\"WARC-Identified-Payload-Type\":\"application/xhtml+xml\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-47/CC-MAIN-2019-47_segments_1573496665985.40_warc_CC-MAIN-20191113035916-20191113063916-00172.warc.gz\"}"}
https://pdglive.lbl.gov/DataBlock.action?node=B024RS3&home=BXXX005
[ "# ${{\\boldsymbol N}{(2120)}}$ INELASTIC POLE RESIDUE\n\nThe normalized residue'' is the residue divided by $\\Gamma _{pole}$/2.\n\n# Normalized residue in ${{\\boldsymbol N}}$ ${{\\boldsymbol \\pi}}$ $\\rightarrow$ ${{\\boldsymbol N}{(2120)}}$ $\\rightarrow$ ${{\\boldsymbol N}{(1535)}}{{\\boldsymbol \\pi}}$ INSPIRE search\n\nMODULUS PHASE ($^\\circ{}$) DOCUMENT ID TECN  COMMENT\n$0.15 \\pm0.08$ -90+-40\n 2014\nDPWA Multichannel\nReferences:\n GUTZ 2014\nEPJ A50 74 High Statistics Study of the Reaction" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.5683319,"math_prob":0.9985361,"size":415,"snap":"2020-45-2020-50","text_gpt3_token_len":144,"char_repetition_ratio":0.20924574,"word_repetition_ratio":0.0,"special_character_ratio":0.41686746,"punctuation_ratio":0.06896552,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9950774,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-10-22T18:50:44Z\",\"WARC-Record-ID\":\"<urn:uuid:3ed0b6ed-cc95-4efa-a60e-1bce3877dc83>\",\"Content-Length\":\"17985\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:5b67261b-95fa-4ace-ad64-fc77a4716588>\",\"WARC-Concurrent-To\":\"<urn:uuid:abde4034-b273-46b2-aa61-79e1edc07ed2>\",\"WARC-IP-Address\":\"54.212.177.198\",\"WARC-Target-URI\":\"https://pdglive.lbl.gov/DataBlock.action?node=B024RS3&home=BXXX005\",\"WARC-Payload-Digest\":\"sha1:E6JCDCWLLE47OGVZ3GZRWWZK4BOPT5VL\",\"WARC-Block-Digest\":\"sha1:Z3V6ZPVQQVBKK2N2E5UE6VXEBHC4M4GE\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-45/CC-MAIN-2020-45_segments_1603107880014.26_warc_CC-MAIN-20201022170349-20201022200349-00170.warc.gz\"}"}
https://www.weegy.com/?ConversationId=255EKXJH&Link=i&ModeType=2
[ "Solve for c. ab - c = 9\nUpdated 4/30/2015 6:59:20 PM\ns\nOriginal conversation\nUser: Solve for c. ab - c = 9\n\nWeegy: Q - 7 5/6 = 6 1/2\n\nQ = 6 1/2 + 7 5/6\n\n= ((13 X 6) + (47 X 2)) / (2 X 6)\n\n= (78 + 94) / 12\n\n= 172/12\n\n= 43/3\n\n= 14 1/3\n\nUser: Use the listing method to write the following set. {x | x N, x < 3} {1, 2, 3} {0, 1, 2, 3} {1, 2}\n\nWeegy: I assume you mean divided by and the answer would be 1\ndebnjerry|Points 68770|\n\nUser: The length of a rectangle is 3 inches more than its width, and its perimeter is 22 inches. Find the width of the rectangle.\n\nWeegy: Let x be its width, then its length is (x + 3). perimeter = 2x + 2(x + 3) = 22, solve the equation we get x = 4. Its width is 4 inches.\nyeswey|Points 29277|\n\nUser: Given the line 2x - 3y - 5 = 0, find the slope of a line that is perpendicular to this line.\n\nWeegy: Given the line 2x - 3y - 5 = 0, the slope of a line that is perpendicular to this line is -3/2.\n\nUser: A man invests a certain amount of money at 2% interest and \\$800 more than that amount in another account at 4% interest. At the end of one year, he earned \\$92 in interest. How much money was invested in each account?\n\nWeegy: Let the man invest an amount x at 2% interest. Then, [ he invests an amount (x+800) at 4% interest. Total simple interest for one year is x*2/100 + (x+800)*4/100 = 92 2x+4x+3200 = 9200 6x = 9200-3200 6x = 6000 x = 1000 So the man invested \\$ 1000 at 2% interest and \\$ 1800 at 4% interest. ]\nsweet25|Points 90|\n\nUser: What is the algebraic expression for \"the difference between seven times a number and three times that number\"?\n\nUser: Describe the location of the point that has the following coordinates. positive abscissa, positive ordinate\n\na_dgzmn|Points 96|\n\nUpdated 4/30/2015 6:59:20 PM\nRating\n3\nab - c = 9\n- c = 9 - ab\nc = -9 + ab\n\nSolve for c. ab - c = 9\nWeegy: ab - c = 9; c = ab - 9 User: Solve 2(4x + 3) Weegy: 2(4x + 3) User: What is the equation of the line, in standard form, that passes through (4, -3) and is parallel to the line whose equation is 4x + y - 2 = 0? (More)\nUpdated 5/4/2015 12:44:56 PM\nThe equation of the line, in standard form, that passes through (4, -3) and is parallel to the line whose equation is 4x + y - 2 = 0 is 4x + y = 13\nConfirmed by Andrew. [5/4/2015 12:45:19 PM]\nWhat is the purpose of a thesis? It protects you against plagiarism. It completes your outline. It states what your paper will prove. It organizes your first paragraph.\nWeegy: The purpose of a thesis is that it states what your paper will prove. User: Select whether the following citation is done correctly: . . . discovered that cheetahs were the fastest animals on earth (J. Bogart, p.33). (More)\nUpdated 4/24/2015 4:08:09 PM\nSimplify 18 - 2[x + (x - 5)]. 8 - 4x 28 - 4x 28 - 2x\nWeegy: 18 - 2[x + (x - 5)] =(-2x + -2x) + (18 + 10) = -4x + 28 (More)\nUpdated 4/30/2015 12:56:14 PM\nA speech given at a graduation ceremony attended by the city mayor should be _____ in style. semi-formal formal informal\nWeegy: A speech given at a graduation ceremony attended by the city mayor should be formal in style. (More)\nUpdated 11/8/2015 1:46:00 AM\nSolve for x. 3(2x - 3) + 4(2 - x) = 0\nWeegy: 3(2x - 3) + 4(2 - x) = 0 6x - 9 + 8 - 4x = 0 2x - 1 = 0 2x = 1 x = 1/2 User: Given: y varies directly with x and has a constant rate of change of 7. When the value of y is 12, then the value of x would be _____. (More)\nUpdated 5/4/2015 10:14:47 AM\nGiven: y varies directly with x and has a constant rate of change of 7. When the value of y is 12, then the value of x would be 12/7 .\nIf y = 7x\nwhen y = 12\nx = 12/7\nConfirmed by Andrew. [5/4/2015 10:15:15 AM]\n32,009,014\nGET\nGET THE APP.\nweegy*", null, "*\nGet answers from Weegy and a team of really smart live experts.\nPopular Conversations\nWhich NIMS Management Characteristic helps to eliminate confusion ...\nWeegy: The National Incident Management System (NIMS) is a standardized approach to incident management developed by ...\nCharts can either be embedded in a worksheet or placed in a separate ...\nWeegy: Charts can either be embedded in a worksheet or placed in a separate chart sheet. User: A relative cell ...\nThe Incident Command System (ICS) is only applicable to large, ...\nWeegy: The incident command system ICS is only applicable to large complex incidents. FALSE. User: . Which type of ...\nThe Eighteenth Amendment, \"Prohibition,\" was reversed by the _______ ...\nWeegy: The Eighteenth Amendment, \"Prohibition,\" was reversed by the TWENTY-FIRST Amendment. User: Under Article ...\nWhich one of the following is a requirement when becoming a US ...\nWeegy: A requirement when becoming a US citizen is You must live in the United States for at least one year.\nS\nL\nP\nL\nP\nPoints 1013 [Total 7036] Ratings 1 Comments 1003 Invitations 0 Online\nS\nL\nPoints 926 [Total 3923] Ratings 2 Comments 906 Invitations 0 Offline\nS\nL\nP\nR\nP\nR\nL\nP\nP\nC\nR\nP\nR\nL\nP\nR\nPoints 850 [Total 12941] Ratings 1 Comments 580 Invitations 26 Online\nS\nL\nP\n1\nPoints 729 [Total 3585] Ratings 3 Comments 699 Invitations 0 Offline\nS\nL\nPoints 413 [Total 1906] Ratings 1 Comments 403 Invitations 0 Offline\nS\nL\nPoints 318 [Total 4702] Ratings 1 Comments 308 Invitations 0 Offline\nS\nL\n1\nPoints 187 [Total 3498] Ratings 3 Comments 157 Invitations 0 Online\nS\nL\nPoints 172 [Total 323] Ratings 4 Comments 132 Invitations 0 Offline\nS\nL\nL\nPoints 111 [Total 5399] Ratings 2 Comments 91 Invitations 0 Offline\nS\nL\nPoints 85 [Total 244] Ratings 0 Comments 85 Invitations 0 Offline\n* Excludes moderators and previous\nwinners (Include)\nHome | Contact | Blog | About | Terms | Privacy | © Purple Inc." ]
[ null, "https://www.weegy.com/img/ad-appstore-4.png", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.8554591,"math_prob":0.98718834,"size":8042,"snap":"2020-34-2020-40","text_gpt3_token_len":2791,"char_repetition_ratio":0.118188605,"word_repetition_ratio":0.17882971,"special_character_ratio":0.3582442,"punctuation_ratio":0.13587873,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.96965003,"pos_list":[0,1,2],"im_url_duplicate_count":[null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-08-12T03:36:11Z\",\"WARC-Record-ID\":\"<urn:uuid:c4dc8396-1f55-4481-9e2a-6bcebb3197b2>\",\"Content-Length\":\"52186\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:b6c51835-8615-419c-a4b8-846cd404d993>\",\"WARC-Concurrent-To\":\"<urn:uuid:34667961-6ebe-4927-83f4-ee6c09467341>\",\"WARC-IP-Address\":\"107.155.67.98\",\"WARC-Target-URI\":\"https://www.weegy.com/?ConversationId=255EKXJH&Link=i&ModeType=2\",\"WARC-Payload-Digest\":\"sha1:AHOHAGZLIEQPHHKYTFCOKSDRG6UNMCM6\",\"WARC-Block-Digest\":\"sha1:SGIXDXOBUMLI4DRJWVYVF5CPTA6V4I7X\",\"WARC-Identified-Payload-Type\":\"application/xhtml+xml\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-34/CC-MAIN-2020-34_segments_1596439738864.9_warc_CC-MAIN-20200812024530-20200812054530-00052.warc.gz\"}"}
http://jabsto.com/Tutorial/topic-98/Microsoft-Office-2013-550.html
[ "Microsoft Office Tutorials and References\nIn Depth Information\nSummary\nRANDBETWEEN function to create a set of random numbers and you don’t want Excel to\nrecalculate those random numbers each time you press Enter, you can convert the\nformulas to values. Just follow these steps:\n1. Select A1:A20.\n2. Choose Home\nClipboard\nCopy (or press Ctrl+C).\n3. Choose Home Clipboard Paste arrow Paste Values (V).\n4. Press Esc to cancel Copy mode.\nSummary\nThis chapter taught you the key details about entering formulas to perform calculations in\ncells. The chapter taught you how to:\nEnter formulas using operators.\nUse the order of precedence along with parentheses to ensure a formula calculates\ncorrectly.\nInclude functions in formulas to perform more sophisticated calculations.\nUse various methods to include ranges and functions in formulas.\nMake changes to formulas.\nUse relative and absolute references.\nUse formulas with a table.\nSee and fi x formula errors.", 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, "Search JabSto ::\n\nCustom Search" ]
[ null, "http://jabsto.com/Tutorial/topic-98/Microsoft-Office-2013-Bible_images/img-gen17199.png", null, "http://jabsto.com/Tutorial/topic-98/Microsoft-Office-2013-Bible_images/img-gen17200.png", null, "http://jabsto.com/Tutorial/topic-98/Microsoft-Office-2013-Bible_images/img-gen17201.png", null, "http://jabsto.com/Tutorial/topic-98/Microsoft-Office-2013-Bible_images/img-gen17202.png", null, "http://jabsto.com/Tutorial/topic-98/Microsoft-Office-2013-Bible_images/img-gen17203.png", null, "http://jabsto.com/Tutorial/topic-98/Microsoft-Office-2013-Bible_images/img-gen17204.png", null, "http://jabsto.com/Tutorial/topic-98/Microsoft-Office-2013-Bible_images/img-gen17205.png", null, "http://jabsto.com/Tutorial/topic-98/Microsoft-Office-2013-Bible_images/img-gen17206.png", null, "http://jabsto.com/Tutorial/topic-98/Microsoft-Office-2013-Bible_images/img-gen17207.png", null, "http://jabsto.com/Tutorial/topic-98/Microsoft-Office-2013-Bible_images/img-gen17208.png", null, "http://jabsto.com/Tutorial/topic-98/Microsoft-Office-2013-Bible_images/img-gen17209.png", null, "http://jabsto.com/Tutorial/topic-98/Microsoft-Office-2013-Bible_images/img-gen17210.png", null, "http://jabsto.com/Tutorial/topic-98/Microsoft-Office-2013-Bible_images/img-gen17211.png", null, "http://jabsto.com/Tutorial/topic-98/Microsoft-Office-2013-Bible_images/img-gen17212.png", null, "http://jabsto.com/Tutorial/topic-98/Microsoft-Office-2013-Bible_images/img-gen17213.png", null, "http://jabsto.com/Tutorial/topic-98/Microsoft-Office-2013-Bible_images/img-gen17214.png", null, "http://jabsto.com/Tutorial/topic-98/Microsoft-Office-2013-Bible_images/img-gen17215.png", null, "http://jabsto.com/Tutorial/topic-98/Microsoft-Office-2013-Bible_images/img-gen17216.png", null, "http://jabsto.com/Tutorial/topic-98/Microsoft-Office-2013-Bible_images/img-gen17217.png", null, "http://jabsto.com/Tutorial/topic-98/Microsoft-Office-2013-Bible_images/img-gen17218.png", null, "http://jabsto.com/Tutorial/topic-98/Microsoft-Office-2013-Bible_images/img-gen17219.png", null, "http://jabsto.com/Tutorial/topic-98/Microsoft-Office-2013-Bible_images/img-gen17220.png", null, "http://jabsto.com/Tutorial/topic-98/Microsoft-Office-2013-Bible_images/img-gen17221.png", null, "http://jabsto.com/Tutorial/topic-98/Microsoft-Office-2013-Bible_images/img-gen17222.png", null, "http://jabsto.com/Tutorial/topic-98/Microsoft-Office-2013-Bible_images/img-gen17223.png", null, "http://jabsto.com/Tutorial/topic-98/Microsoft-Office-2013-Bible_images/img-gen17224.png", null, "http://jabsto.com/Tutorial/topic-98/Microsoft-Office-2013-Bible_images/img-gen17225.png", null, "http://jabsto.com/Tutorial/topic-98/Microsoft-Office-2013-Bible_images/img-gen17226.png", null, "http://jabsto.com/Tutorial/topic-98/Microsoft-Office-2013-Bible_images/img-gen17227.png", null, "http://jabsto.com/Tutorial/topic-98/Microsoft-Office-2013-Bible_images/img-gen17228.png", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.66048855,"math_prob":0.8879731,"size":1011,"snap":"2019-13-2019-22","text_gpt3_token_len":239,"char_repetition_ratio":0.12810327,"word_repetition_ratio":0.0121951215,"special_character_ratio":0.20969337,"punctuation_ratio":0.13259669,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.96819496,"pos_list":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60],"im_url_duplicate_count":[null,1,null,1,null,1,null,1,null,1,null,1,null,1,null,1,null,1,null,1,null,1,null,1,null,1,null,1,null,1,null,1,null,1,null,1,null,1,null,1,null,1,null,1,null,1,null,1,null,1,null,1,null,1,null,1,null,1,null,1,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-03-19T21:53:22Z\",\"WARC-Record-ID\":\"<urn:uuid:85791c0c-4d6c-45a9-8600-21c6ec38ceeb>\",\"Content-Length\":\"28581\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:7b84d2dd-5b88-4307-b663-61fbcda9ecb2>\",\"WARC-Concurrent-To\":\"<urn:uuid:4dbbdb16-b6dd-48ba-a079-fa609884ccc9>\",\"WARC-IP-Address\":\"192.163.238.55\",\"WARC-Target-URI\":\"http://jabsto.com/Tutorial/topic-98/Microsoft-Office-2013-550.html\",\"WARC-Payload-Digest\":\"sha1:Z2RTEBFPU3LWUIMIYS7HKZJPNWSURKL7\",\"WARC-Block-Digest\":\"sha1:DPJEVTU24XGJN6YNIZ2B5LB3UHSRDMJY\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-13/CC-MAIN-2019-13_segments_1552912202131.54_warc_CC-MAIN-20190319203912-20190319225912-00301.warc.gz\"}"}
https://useful_english.enacademic.com/133230/theory_of_gravitation
[ "\n\n# theory of gravitation\n\nnoun\n(physics) the theory that any two particles of matter attract one another with a force directly proportional to the product of their masses and inversely proportional to the square of the distance between them\nTopics: ↑physics, ↑natural philosophy\nHypernyms: ↑scientific theory\n\nUseful english dictionary. 2012.\n\n### Look at other dictionaries:\n\n• Nordström's theory of gravitation — In theoretical physics, Nordström s theory of gravitation was a predecessor of general relativity. Strictly speaking, there were actually two distinct theories proposed by the Finnish theoretical physicist Gunnar Nordström, in 1912 and 1913… …   Wikipedia\n\n• Le Sage's theory of gravitation — is the most common name for the kinetic theory of gravity originally proposed by Nicolas Fatio de Duillier in 1690 and later by Georges Louis Le Sage in 1748. The theory proposed a mechanical explanation for Newton s gravitational force in terms… …   Wikipedia\n\n• Yilmaz theory of gravitation — The Yilmaz theory of gravitation is an attempt by Huseyin Yilmaz (Turkish: Hüseyin Yılmaz ) and a handful of coworkers to formulate a classical field theory of gravitation which closely mimics general relativity in weak field conditions, but in… …   Wikipedia\n\n• Whitehead's theory of gravitation — In theoretical physics, Whitehead s theory of gravitation was introduced by the distinguished mathematician and philosopher Alfred North Whitehead in 1922. Principal features of the theoryWhitehead s theory is said to feature a prior geometry .… …   Wikipedia\n\n• Newton's theory of gravitation — noun (physics) the theory that any two particles of matter attract one another with a force directly proportional to the product of their masses and inversely proportional to the square of the distance between them • Syn: ↑theory of gravitation,… …   Useful english dictionary\n\n• quantum theory of gravitation — kvantinė gravitacijos teorija statusas T sritis fizika atitikmenys: angl. quantum theory of gravitation vok. Quantentheorie der Gravitation, f rus. квантовая теория гравитации, f pranc. théorie quantique de la gravitation, f …   Fizikos terminų žodynas\n\n• Gravitation — is a natural phenomenon by which objects with mass attract one another [http://math.ucr.edu/home/baez/physics/Relativity/GR/grav speed.html Does Gravity Travel at the Speed of Light?] , UCR Mathematics . 1998. Retrieved 3 July 2008] . In everyday …   Wikipedia\n\n• Gravitation — hält die Planeten auf ihren Bahnen um die Sonne (nicht maßstabsgetreu) Die Gravitation (von lateinisch gravitas, Schwere), ist eine der vier Grundkräfte der Physik. Sie bewirkt die gegenseitige Anziehung von Massen. Gravitation besitzt… …   Deutsch Wikipedia\n\n• gravitation — gravitational, adj. gravitationally, adv. /grav i tay sheuhn/, n. 1. Physics. a. the force of attraction between any two masses. Cf. law of gravitation. b. an act or process caused by this force. 2. a sinking or falling …   Universalium\n\n• Theory of relativity — This article is about the scientific concept. For philosophical or sociological theories about relativity, see Relativism. For the silent film, see The Einstein Theory of Relativity. Two dimensional projection of a three dimensional analogy of… …   Wikipedia" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.70839095,"math_prob":0.82825494,"size":3264,"snap":"2019-51-2020-05","text_gpt3_token_len":776,"char_repetition_ratio":0.1898773,"word_repetition_ratio":0.13195877,"special_character_ratio":0.19944853,"punctuation_ratio":0.11423221,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9827072,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-01-21T18:37:44Z\",\"WARC-Record-ID\":\"<urn:uuid:5868d16f-3b73-4b3f-9425-5d564f3f198f>\",\"Content-Length\":\"41454\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:91eb3ba0-f862-403b-b24f-31b93488e5f5>\",\"WARC-Concurrent-To\":\"<urn:uuid:0888d171-854e-4ac0-a203-25dd3c2e12e2>\",\"WARC-IP-Address\":\"84.16.246.89\",\"WARC-Target-URI\":\"https://useful_english.enacademic.com/133230/theory_of_gravitation\",\"WARC-Payload-Digest\":\"sha1:FBI7VH72QLSBLJ7QD6JIUFVUZ2VIZLSU\",\"WARC-Block-Digest\":\"sha1:Y2WFOLOGYRDSAGSDBHJGYOCQLNCRRW5J\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-05/CC-MAIN-2020-05_segments_1579250604849.31_warc_CC-MAIN-20200121162615-20200121191615-00528.warc.gz\"}"}
https://scholars.hkbu.edu.hk/en/publications/a-volumetric-integral-radial-basis-function-method-for-time-depen-2
[ "# A volumetric integral radial basis function method for time-dependent partial differential equations. I. Formulation\n\nE. J. Kansa*, H. Power, G. E. Fasshauer, Leevan LING\n\n*Corresponding author for this work\n\nResearch output: Contribution to journalArticlepeer-review\n\n62 Citations (Scopus)\n\n## Abstract\n\nA strictly conservative volume integral formulation of the time dependent conservation equations in terms of meshless radial basis functions (RBFs) is presented. Rotational and translational transformations are considered that simplify the partial differential equations (PDEs) to be solved. As a result, the solutions that are represented at a finite sample of knots, x ∈ Ω/∂Ω ⊂ ℝd, are permitted to move as the system of equations evolves in time. Knots are inserted, deleted, or rearranged in such a manner to conserve the extensive physical quantities of mass, momentum components, and total energy. Our study consists of the following parts: (A) Local rotational and Galilean translational transformations can be obtained to reduce the conservation equations into steady-state forms for the inviscid Euler equations or Navier-Stokes equations. (B) The entire set of PDEs are transformed into the method of lines approach yielding a set of coupled ordinary differential equations whose homogeneous solution is exact in time. (C) The spatial components are approximated by expansions of meshless RBFs; each individual RBF is volumetrically integrated at one of the sampling knots x i, yielding a collocation formulation of the method of lines structure of the ODEs. (D) Because the volume integrated RBFs increase more rapidly away from the data center than the commonly used RBFs, we use a higher order preconditioner to counter-act the ill-conditioning problem. Domain decomposition is used over each piecewise continuous subdomain.\n\nOriginal language English 1191-1206 16 Engineering Analysis with Boundary Elements 28 10 SPEC. ISS. https://doi.org/10.1016/j.enganabound.2004.01.004 Published - Oct 2004\n\n## Scopus Subject Areas\n\n• Analysis\n• Engineering(all)\n• Computational Mathematics\n• Applied Mathematics\n\n## User-Defined Keywords\n\n• Galilean transformations\n• Momentum component transformations\n• Shock waves\n• Volumetric formulation\n\n## Fingerprint\n\nDive into the research topics of 'A volumetric integral radial basis function method for time-dependent partial differential equations. I. Formulation'. Together they form a unique fingerprint." ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.8726882,"math_prob":0.85946465,"size":1992,"snap":"2022-40-2023-06","text_gpt3_token_len":429,"char_repetition_ratio":0.120221324,"word_repetition_ratio":0.0,"special_character_ratio":0.18975903,"punctuation_ratio":0.07096774,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.97074753,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-01-31T10:46:16Z\",\"WARC-Record-ID\":\"<urn:uuid:497f77e5-1e71-4e11-9702-ec6c37054e09>\",\"Content-Length\":\"56994\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:b3e586b7-491d-4e1f-a1fd-bb7d6384771e>\",\"WARC-Concurrent-To\":\"<urn:uuid:73ea7017-e968-4a35-bd9e-481e1e63c812>\",\"WARC-IP-Address\":\"18.139.148.124\",\"WARC-Target-URI\":\"https://scholars.hkbu.edu.hk/en/publications/a-volumetric-integral-radial-basis-function-method-for-time-depen-2\",\"WARC-Payload-Digest\":\"sha1:PZZLM63SG3G3DFTSENNIP7ZUUIRI7BDF\",\"WARC-Block-Digest\":\"sha1:6YDKFAL3LH7GFYSB4WDXI6QHABIWNNXG\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-06/CC-MAIN-2023-06_segments_1674764499857.57_warc_CC-MAIN-20230131091122-20230131121122-00708.warc.gz\"}"}
https://ashwinnarayan.blogspot.com/2014/07/inverse-kinematics-for-2dof-arm.html
[ "## Friday, 11 July 2014\n\n### Inverse Kinematics for 2DOF Arm\n\nWhen I first came across the problem of inverse kinematics I thought - quite naively - that it would be a simple matter to find a solution to the problem because the forward kinematics problem was so simple to solve. I decided to start out with a 2 link arm and see if I could work out the solution on my own from scratch without having any initial knowledge about inverse kinematics. After filling pages and pages with calculations that didn't quite seem to be going anywhere I realized why it was such a difficult problem.\n\nOf course a 2 link arm had a complete close form solution. After a bit of online research I found the solution. However, the solution for arms with more than 2 degrees of freedom turns out to be not so simple. It requires using numerical methods to slowly converge on a solution. This approach doesn't solve everything either. There's still the problem of choosing the right set of angles because there are often multiple solutions for a particular location of the end of the arm and some of these solutions are invalid because they are outside the range of motion of the motors at the joints of the arm.\n\nI've decided to slowly familiarize myself with all the different ways of finding inverse kinematics solutions. I think I'll make blogposts each with a higher degree of freedom and eventually I'll talk about the solution for the 6DOF arm. Why stop at 6? Because it turns out that in 3D space, you don't need more than 6DOF to reach a particular location/orientation. Any more than that and your arm becomes redundant. 3DOF for location in space plus 3DOF for orientation in space are all we need from an arm.\n\nSo in this post I'll talk about the solution to 2 link robotic arm. And this arm will have hinge type joints only. I think that the technical term used is \"revolute joint\".\n\nA 2 link planar robotic arm looks like this:\n\nThe forward kinematics equations for this arrangement are simple enough.\n$x = l_1 cos(\\theta_1) + l_2 cos(\\theta_1 + \\theta_2)$\n$y = l_1 sin(\\theta_1) + l_2 sin(\\theta_1 + \\theta_2)$\n\nThe inverse kinematics equations are quite monstrous. The full derivation is given in this fantastic pdf. I'll just write down the final equations here.\n\nGiven a value of x and y, the inverse kinematics equations are:\nLet\n$k_1 = l_1 + l_2 cos(\\theta_2)$\n$k_2 = l_2 sin(\\theta_2)$\n$\\gamma = atan2(k_2, k_1)$\n\n$\\theta_2 = atan2(\\sqrt{1 - (\\frac{x^2 + y^2 - l_1^2 - l_2^2}{2l_1 l_2})^2}, \\frac{x^2 + y^2 - l_1^2 - l_2^2}{2l_1 l_2})$\n$\\theta_1 = atan2(y, x) - \\gamma$\n\nI wrote a simple python script to calculate the values of theta. You can get the code here. The invkin2() function calculates the values of $\\theta_1$ and $\\theta_2$ for an arm with 2 links.\n\nIt was a bit difficult to test the code this way though. Can't see if I'm right or wrong in most cases. So I wrote this processing sketch to visualize the calculations so I can easily verify their correctness.\n\nYou can view the processing simulation here: http://rationalash.github.io/invkin/" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.8951896,"math_prob":0.98972076,"size":4111,"snap":"2019-43-2019-47","text_gpt3_token_len":1128,"char_repetition_ratio":0.12247383,"word_repetition_ratio":0.50282484,"special_character_ratio":0.2821698,"punctuation_ratio":0.07643312,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99689114,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-11-16T01:17:39Z\",\"WARC-Record-ID\":\"<urn:uuid:f1b228a7-42c0-47f3-ba81-5b89098a1f30>\",\"Content-Length\":\"98697\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:481d03eb-734a-4e83-917a-6ac673cea33c>\",\"WARC-Concurrent-To\":\"<urn:uuid:11ea0207-88fe-4b9a-9f16-af553f05d4ce>\",\"WARC-IP-Address\":\"172.217.13.225\",\"WARC-Target-URI\":\"https://ashwinnarayan.blogspot.com/2014/07/inverse-kinematics-for-2dof-arm.html\",\"WARC-Payload-Digest\":\"sha1:K7TEOBNOVOLGVBSENVJWJF4FWU6SP7G7\",\"WARC-Block-Digest\":\"sha1:PNTXER3ARBYQNRE23DDDEMLHPC6LGNR6\",\"WARC-Identified-Payload-Type\":\"application/xhtml+xml\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-47/CC-MAIN-2019-47_segments_1573496668716.69_warc_CC-MAIN-20191116005339-20191116033339-00221.warc.gz\"}"}
https://zims-en.kiwix.campusafrica.gos.orange.com/wikipedia_en_all_nopic/A/Maximal_torus
[ "# Maximal torus\n\nIn the mathematical theory of compact Lie groups a special role is played by torus subgroups, in particular by the maximal torus subgroups.\n\nA torus in a compact Lie group G is a compact, connected, abelian Lie subgroup of G (and therefore isomorphic to the standard torus Tn). A maximal torus is one which is maximal among such subgroups. That is, T is a maximal torus if for any torus T containing T we have T = T. Every torus is contained in a maximal torus simply by dimensional considerations. A noncompact Lie group need not have any nontrivial tori (e.g. Rn).\n\nThe dimension of a maximal torus in G is called the rank of G. The rank is well-defined since all maximal tori turn out to be conjugate. For semisimple groups the rank is equal to the number of nodes in the associated Dynkin diagram.\n\n## Examples\n\nThe unitary group U(n) has as a maximal torus the subgroup of all diagonal matrices. That is,\n\n$T=\\left\\{\\operatorname {diag} \\left(e^{i\\theta _{1}},e^{i\\theta _{2}},\\dots ,e^{i\\theta _{n}}\\right):\\forall j,\\theta _{j}\\in \\mathbb {R} \\right\\}.$", null, "T is clearly isomorphic to the product of n circles, so the unitary group U(n) has rank n. A maximal torus in the special unitary group SU(n) ⊂ U(n) is just the intersection of T and SU(n) which is a torus of dimension n  1.\n\nA maximal torus in the special orthogonal group SO(2n) is given by the set of all simultaneous rotations in any fixed choice of n pairwise orthogonal planes (i.e., two dimensional vector spaces). Concretely, the maximal torus consists of all block-diagonal matrices with $2\\times 2$", null, "diagonal blocks, where each diagonal block is a rotation matrix. This is also a maximal torus in the group SO(2n+1) where the action fixes the remaining direction. Thus both SO(2n) and SO(2n+1) have rank n. For example, in the rotation group SO(3) the maximal tori are given by rotations about a fixed axis.\n\nThe symplectic group Sp(n) has rank n. A maximal torus is given by the set of all diagonal matrices whose entries all lie in a fixed complex subalgebra of H.\n\n## Properties\n\nLet G be a compact, connected Lie group and let ${\\mathfrak {g}}$", null, "be the Lie algebra of G. The first main result is the torus theorem, which may be formulated as follows:\n\nTorus theorem: If T is one fixed maximal torus in G, then every element of G is conjugate to an element of T.\n\nThis theorem has the following consequences:\n\n• All maximal tori in G are conjugate.\n• All maximal tori have the same dimension, known as the rank of G.\n• A maximal torus in G is a maximal abelian subgroup, but the converse need not hold.\n• The maximal tori in G are exactly the Lie subgroups corresponding to the maximal abelian subalgebras of ${\\mathfrak {g}}$", null, "(cf. Cartan subalgebra)\n• Every element of G lies in some maximal torus; thus, the exponential map for G is surjective.\n• If G has dimension n and rank r then n r is even.\n\n## Root system\n\nIf T is a maximal torus in a compact Lie group G, one can define a root system as follows. The roots are the weights for the adjoint action of T on the complexified Lie algebra of G. To be more explicit, let ${\\mathfrak {t}}$", null, "denote the Lie algebra of T, let ${\\mathfrak {g}}$", null, "denote the Lie algebra of $G$", null, ", and let ${\\mathfrak {g}}_{\\mathbb {C} }:={\\mathfrak {g}}\\oplus i{\\mathfrak {g}}$", null, "denote the complexification of ${\\mathfrak {g}}$", null, ". Then we say that an element $\\alpha \\in {\\mathfrak {t}}$", null, "is a root for G relative to T if $\\alpha \\neq 0$", null, "and there exists a nonzero $X\\in {\\mathfrak {g}}_{\\mathbb {C} }$", null, "such that\n\n$\\mathrm {Ad} _{e^{H}}(X)=e^{i\\langle \\alpha ,H\\rangle }X$", null, "for all $H\\in {\\mathfrak {t}}$", null, ". Here $\\langle \\cdot ,\\cdot \\rangle$", null, "is a fixed inner product on ${\\mathfrak {g}}$", null, "that is invariant under the adjoint action of connected compact Lie groups.\n\nThe root system, as a subset of the Lie algebra ${\\mathfrak {t}}$", null, "of T, has all the usual properties of a root system, except that the roots may not span ${\\mathfrak {t}}$", null, ". The root system is a key tool in understanding the classification and representation theory of G.\n\n## Weyl group\n\nGiven a torus T (not necessarily maximal), the Weyl group of G with respect to T can be defined as the normalizer of T modulo the centralizer of T. That is,\n\n$W(T,G):=N_{G}(T)/C_{G}(T).$", null, "Fix a maximal torus $T=T_{0}$", null, "in G; then the corresponding Weyl group is called the Weyl group of G (it depends up to isomorphism on the choice of T).\n\nThe first two major results about the Weyl group are as follows.\n\n• The centralizer of T in G is equal to T, so the Weyl group is equal to N(T)/T.\n• The Weyl group is generated by reflections about the roots of the associated Lie algebra. Thus, the Weyl group of T is isomorphic to the Weyl group of the root system of the Lie algebra of G.\n\nWe now list some consequences of these main results.\n\n• Two elements in T are conjugate if and only if they are conjugate by an element of W. That is, each conjugacy class of G intersects T in exactly one Weyl orbit. In fact, the space of conjugacy classes in G is homeomorphic to the orbit space T/W.\n• The Weyl group acts by (outer) automorphisms on T (and its Lie algebra).\n• The identity component of the normalizer of T is also equal to T. The Weyl group is therefore equal to the component group of N(T).\n• The Weyl group is finite.\n\nThe representation theory of G is essentially determined by T and W.\n\nAs an example, consider the case $G=SU(n)$", null, "with $T$", null, "being the diagonal subgroup of $G$", null, ". Then $x\\in G$", null, "belongs to $N(T)$", null, "if and only if $x$", null, "maps each standard basis element $e_{i}$", null, "to a multiple of some other standard basis element $e_{j}$", null, ", that is, if and only if $x$", null, "permutes the standard basis elements, up to multiplication by some constants. The Weyl group in this case is then the permutation group on $n$", null, "elements.\n\n## Weyl integral formula\n\nSuppose f is a continuous function on G. Then the integral over G of f with respect to the normalized Haar measure dg may be computed as follows:\n\n$\\displaystyle {\\int _{G}f(g)\\,dg=|W|^{-1}\\int _{T}|\\Delta (t)|^{2}\\int _{G/T}f\\left(yty^{-1}\\right)\\,d[y]\\,dt,}$", null, "where $d[y]$", null, "is the normalized volume measure on the quotient manifold $G/T$", null, "and $dt$", null, "is the normalized Haar measure on T. Here Δ is given by the Weyl denominator formula and $|W|$", null, "is the order of the Weyl group. An important special case of this result occurs when f is a class function, that is, a function invariant under conjugation. In that case, we have\n\n$\\displaystyle {\\int _{G}f(g)\\,dg=|W|^{-1}\\int _{T}f(t)|\\Delta (t)|^{2}\\,dt.}$", null, "Consider as an example the case $G=SU(2)$", null, ", with $T$", null, "being the diagonal subgroup. Then the Weyl integral formula for class functions takes the following explicit form:\n\n$\\displaystyle {\\int _{SU(2)}f(g)\\,dg={\\frac {1}{2}}\\int _{0}^{2\\pi }f\\left(\\mathrm {diag} \\left(e^{i\\theta },e^{-i\\theta }\\right)\\right)\\,4\\,\\mathrm {sin} ^{2}(\\theta )\\,{\\frac {d\\theta }{2\\pi }}.}$", null, "Here $|W|=2$", null, ", the normalized Haar measure on $T$", null, "is ${\\frac {d\\theta }{2\\pi }}$", null, ", and $\\mathrm {diag} \\left(e^{i\\theta },e^{-i\\theta }\\right)$", null, "denotes the diagonal matrix with diagonal entries $e^{i\\theta }$", null, "and $e^{-i\\theta }$", null, ".\n\n## See also\n\nThis article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files." ]
[ null, "https://zims-en.kiwix.campusafrica.gos.orange.com/wikipedia_en_all_nopic/I/m/7cbc901a6ac1b56a0f6c279503dc6d5ed1ae2bbd.svg", null, "https://zims-en.kiwix.campusafrica.gos.orange.com/wikipedia_en_all_nopic/I/m/f8a0e3400ffb97d67c00267ed50cddfe824cbe80.svg", null, "https://zims-en.kiwix.campusafrica.gos.orange.com/wikipedia_en_all_nopic/I/m/40a913b1503ed9ec94361b99f7fd59ef60705c28.svg", null, "https://zims-en.kiwix.campusafrica.gos.orange.com/wikipedia_en_all_nopic/I/m/40a913b1503ed9ec94361b99f7fd59ef60705c28.svg", null, "https://zims-en.kiwix.campusafrica.gos.orange.com/wikipedia_en_all_nopic/I/m/7aabd0d28bc7f5b43a8b64d2a529308ca100e8ac.svg", null, "https://zims-en.kiwix.campusafrica.gos.orange.com/wikipedia_en_all_nopic/I/m/40a913b1503ed9ec94361b99f7fd59ef60705c28.svg", null, "https://zims-en.kiwix.campusafrica.gos.orange.com/wikipedia_en_all_nopic/I/m/f5f3c8921a3b352de45446a6789b104458c9f90b.svg", null, "https://zims-en.kiwix.campusafrica.gos.orange.com/wikipedia_en_all_nopic/I/m/c0c862544e23911e296feb3e5ddb50d54cd2d6bc.svg", null, "https://zims-en.kiwix.campusafrica.gos.orange.com/wikipedia_en_all_nopic/I/m/40a913b1503ed9ec94361b99f7fd59ef60705c28.svg", null, "https://zims-en.kiwix.campusafrica.gos.orange.com/wikipedia_en_all_nopic/I/m/6ecb41356981039b8a4b3505661b2ed8e06ca3ba.svg", null, "https://zims-en.kiwix.campusafrica.gos.orange.com/wikipedia_en_all_nopic/I/m/5770f8ec95300cbfde18eb59c49a11f12adbcd91.svg", null, "https://zims-en.kiwix.campusafrica.gos.orange.com/wikipedia_en_all_nopic/I/m/ee1a75bdfa17f663c8e9c3ab2622b9e3f0d36624.svg", null, "https://zims-en.kiwix.campusafrica.gos.orange.com/wikipedia_en_all_nopic/I/m/9f2c52ff3547e885027862bd3f0c863f5a00db37.svg", null, "https://zims-en.kiwix.campusafrica.gos.orange.com/wikipedia_en_all_nopic/I/m/6d03904987af95e06306813d742f0efea8b74216.svg", null, "https://zims-en.kiwix.campusafrica.gos.orange.com/wikipedia_en_all_nopic/I/m/9a50080b735975d8001c9552ac2134b49ad534c0.svg", null, "https://zims-en.kiwix.campusafrica.gos.orange.com/wikipedia_en_all_nopic/I/m/40a913b1503ed9ec94361b99f7fd59ef60705c28.svg", null, "https://zims-en.kiwix.campusafrica.gos.orange.com/wikipedia_en_all_nopic/I/m/7aabd0d28bc7f5b43a8b64d2a529308ca100e8ac.svg", null, "https://zims-en.kiwix.campusafrica.gos.orange.com/wikipedia_en_all_nopic/I/m/7aabd0d28bc7f5b43a8b64d2a529308ca100e8ac.svg", null, "https://zims-en.kiwix.campusafrica.gos.orange.com/wikipedia_en_all_nopic/I/m/25dc46d45f692daa2173074ca193f21666aa53ab.svg", null, "https://zims-en.kiwix.campusafrica.gos.orange.com/wikipedia_en_all_nopic/I/m/ed837f1758b02ae3912d00544954a950d76be7ca.svg", null, "https://zims-en.kiwix.campusafrica.gos.orange.com/wikipedia_en_all_nopic/I/m/45b7e4ea2eb581c2691084eb716b01d794365d45.svg", null, "https://zims-en.kiwix.campusafrica.gos.orange.com/wikipedia_en_all_nopic/I/m/ec7200acd984a1d3a3d7dc455e262fbe54f7f6e0.svg", null, "https://zims-en.kiwix.campusafrica.gos.orange.com/wikipedia_en_all_nopic/I/m/f5f3c8921a3b352de45446a6789b104458c9f90b.svg", null, "https://zims-en.kiwix.campusafrica.gos.orange.com/wikipedia_en_all_nopic/I/m/6d7e0b51bd905f35d11790939139d18014f8b017.svg", null, "https://zims-en.kiwix.campusafrica.gos.orange.com/wikipedia_en_all_nopic/I/m/891f08bfa8e782f2db0a06b00aa11668b1614537.svg", null, "https://zims-en.kiwix.campusafrica.gos.orange.com/wikipedia_en_all_nopic/I/m/87f9e315fd7e2ba406057a97300593c4802b53e4.svg", null, "https://zims-en.kiwix.campusafrica.gos.orange.com/wikipedia_en_all_nopic/I/m/ebdc3a9cb1583d3204eff8918b558c293e0d2cf3.svg", null, "https://zims-en.kiwix.campusafrica.gos.orange.com/wikipedia_en_all_nopic/I/m/64afd228cf00e5024b9cdd277462d24ab97b6d3e.svg", null, "https://zims-en.kiwix.campusafrica.gos.orange.com/wikipedia_en_all_nopic/I/m/87f9e315fd7e2ba406057a97300593c4802b53e4.svg", null, "https://zims-en.kiwix.campusafrica.gos.orange.com/wikipedia_en_all_nopic/I/m/a601995d55609f2d9f5e233e36fbe9ea26011b3b.svg", null, "https://zims-en.kiwix.campusafrica.gos.orange.com/wikipedia_en_all_nopic/I/m/b00ad401d0ba06e0b839ccd2b27267c35161b566.svg", null, "https://zims-en.kiwix.campusafrica.gos.orange.com/wikipedia_en_all_nopic/I/m/81558ffccd1a3dc8835b1f19f2d21322b1a79daa.svg", null, "https://zims-en.kiwix.campusafrica.gos.orange.com/wikipedia_en_all_nopic/I/m/46d97d0dba48ad9251aab27fa45d4ee402a89786.svg", null, "https://zims-en.kiwix.campusafrica.gos.orange.com/wikipedia_en_all_nopic/I/m/ebee76a835701fd1f26047a09855f2ea36bb08fc.svg", null, "https://zims-en.kiwix.campusafrica.gos.orange.com/wikipedia_en_all_nopic/I/m/9a58a82c22975e2758d9b217fce7aaa8ee02eb1a.svg", null, "https://zims-en.kiwix.campusafrica.gos.orange.com/wikipedia_en_all_nopic/I/m/d817d3285f312e649fc13acd8d237f97b3d455aa.svg", null, "https://zims-en.kiwix.campusafrica.gos.orange.com/wikipedia_en_all_nopic/I/m/c7411e364dcf2262c8f7d253c87daeced59fae05.svg", null, "https://zims-en.kiwix.campusafrica.gos.orange.com/wikipedia_en_all_nopic/I/m/ec7200acd984a1d3a3d7dc455e262fbe54f7f6e0.svg", null, "https://zims-en.kiwix.campusafrica.gos.orange.com/wikipedia_en_all_nopic/I/m/79af5e0dbe250d2d34f0b9e1cb6cdcee40cbf453.svg", null, "https://zims-en.kiwix.campusafrica.gos.orange.com/wikipedia_en_all_nopic/I/m/3ac13ebeffeff9ad8ecf214b2d4ebb6676bc7782.svg", null, "https://zims-en.kiwix.campusafrica.gos.orange.com/wikipedia_en_all_nopic/I/m/ec7200acd984a1d3a3d7dc455e262fbe54f7f6e0.svg", null, "https://zims-en.kiwix.campusafrica.gos.orange.com/wikipedia_en_all_nopic/I/m/95aaa65dd30008e4fdd0c23823566c5d4179977b.svg", null, "https://zims-en.kiwix.campusafrica.gos.orange.com/wikipedia_en_all_nopic/I/m/37ba37800414cbeb9cef04c5826776510fb69280.svg", null, "https://zims-en.kiwix.campusafrica.gos.orange.com/wikipedia_en_all_nopic/I/m/7b4b8e67ee479d68e0e5040aaf87eff99214c90f.svg", null, "https://zims-en.kiwix.campusafrica.gos.orange.com/wikipedia_en_all_nopic/I/m/67097ebd760f0d3e2f8ba7eb611653d3dec2a84e.svg", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.833736,"math_prob":0.9988962,"size":7003,"snap":"2021-21-2021-25","text_gpt3_token_len":1811,"char_repetition_ratio":0.14916417,"word_repetition_ratio":0.040252566,"special_character_ratio":0.2534628,"punctuation_ratio":0.11903114,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9999548,"pos_list":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90],"im_url_duplicate_count":[null,2,null,9,null,null,null,null,null,null,null,null,null,null,null,2,null,null,null,2,null,4,null,2,null,2,null,2,null,null,null,null,null,null,null,null,null,2,null,2,null,2,null,null,null,null,null,2,null,2,null,null,null,null,null,4,null,null,null,null,null,2,null,2,null,2,null,3,null,2,null,2,null,2,null,null,null,2,null,2,null,null,null,2,null,2,null,2,null,2,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-06-22T01:31:29Z\",\"WARC-Record-ID\":\"<urn:uuid:b7f32a18-de66-4e55-b1e9-39797b3d5858>\",\"Content-Length\":\"72209\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:c65c7832-f6aa-4d5f-a45b-ab594eea1081>\",\"WARC-Concurrent-To\":\"<urn:uuid:1e1269f2-6d8e-407e-8a88-698d2acc3549>\",\"WARC-IP-Address\":\"41.66.34.68\",\"WARC-Target-URI\":\"https://zims-en.kiwix.campusafrica.gos.orange.com/wikipedia_en_all_nopic/A/Maximal_torus\",\"WARC-Payload-Digest\":\"sha1:FP74RGCSG6ZXFK3PAZ4NYQWVVPJX64Y3\",\"WARC-Block-Digest\":\"sha1:5FDGLBP4YJEAXX4P7YJLGQDF7PK3BH24\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-25/CC-MAIN-2021-25_segments_1623488504969.64_warc_CC-MAIN-20210622002655-20210622032655-00034.warc.gz\"}"}
https://discourse.elm-lang.org/t/json-encode-value-equality/898
[ "# Json.Encode.Value equality\n\nI was surprised by the following test results. I had expected all five tests to fail. Instead, `{a:1} == {a:1, b:2}` is `True`, and `Expect.equal {a:1, b:2} {a:1}` passes; where `{a:1}` stands for a `Json.Encode.Value` created by `Json.Encode.object`. (Note that there only three test failures, instead of five.)\n\nIs this expected? I don’t see anything in the docs for `Json.Encode.Value` or `Expect.Equal` that indicate this. The docs for `(==)` do list `Json.Encode.Value` as a “problematic type”, but the context suggests that this is because a `Value` might contain a function, not that `(==)` also returns false positives even when the properties have non-function types.\n\n(This came up while writing tests for my Encoder, to verify that it didn’t create any unexpected object properties in a case where a programming error could lead it to do so.)\n\n``````module JsonValueTests exposing (..)\n\nimport Expect exposing (Expectation)\nimport Json.Encode as Encode\nimport Test exposing (..)\n\nsuite : Test\nsuite =\nlet\nobj1 =\nEncode.object [ ( \"a\", Encode.int 1 ) ]\n\nobj2 =\nEncode.object [ ( \"a\", Encode.int 1 ), ( \"b\", Encode.int 2 ) ]\nin\ndescribe \"Json.Encode.Value\"\n[ test \"Expect.equal {a:1} {a:1, b:2}\" <|\n\\_ ->\nExpect.equal obj1 obj2\n, test \"Expect.equal {a:1, b:2} {a:1}\" <|\n\\_ ->\nExpect.equal obj2 obj1\n, test \"{a:1} == {a:1, b:2}\" <|\n\\_ ->\nExpect.equal (obj1 == obj2) True\n, test \"{a:1, b:2} == {a:1}\" <|\n\\_ ->\nExpect.equal (obj2 == obj1) True\n, test \"encode {a:1} == encode {a:1,b:2}\" <|\n\\_ ->\nEncode.encode 0 obj1\n|> Expect.equal (Encode.encode 0 obj2)\n]\n``````\n``````❯ elm-test tests/JsonValueTests.elm\nSuccess! Compiled 0 modules.\nSuccessfully generated /dev/null\nSuccess! Compiled 1 module.\nSuccessfully generated /Users/osteele/code/banyan/elm-stuff/generated-code/elm-community/elm-test/elmTestOutput.js\n\nelm-test 0.18.12\n----------------\n\nRunning 5 tests. To reproduce these results, run: elm-test --fuzz 100 --seed 2079329333 tests/JsonValueTests.elm\n\n↓ JsonValueTests\n↓ Json.Encode.Value\n✗ Expect.equal {a:1} {a:1, b:2}\n\n{ a = 1, b = 2 }\n╷\n│ Expect.equal\n╵\n{ a = 1 }\n\n↓ JsonValueTests\n↓ Json.Encode.Value\n✗ {a:1, b:2} == {a:1}\n\nTrue\n╷\n│ Expect.equal\n╵\nFalse\n\n↓ JsonValueTests\n↓ Json.Encode.Value\n✗ encode {a:1} == encode {a:1,b:2}\n\n\"{\\\"a\\\":1}\"\n╷\n│ Expect.equal\n╵\n\"{\\\"a\\\":1,\\\"b\\\":2}\"\n\nTEST RUN FAILED\n\nDuration: 285 ms\nPassed: 2\nFailed: 3\n``````\n\nThere are more cases than just function values where `Value` is a problematic type for equality, and this happens to be one of them. There’s no way for the equality kernel function to distinguish between the JavaScript representations of the Elm types it has to work on and anything you can represent as a `Value`. Eventually it falls through to the comparison case for record types, where it tries to check every key in the lefthand value against the key in the righthand value. This is why it only fails in the cases where the record with two keys is the lefthand value. It tries to find `b` in the object that has no `b`. In the reversed situation, it stops checking after `a` because it’s making an assumption that it’s comparing records and the keys will always match.\n\n2 Likes\n\nI ended up using the following in my tests:\n\n``````expectJsonEqual : Encode.Value -> Encode.Value -> Expectation\nexpectJsonEqual a =\nExpect.all\n[ Expect.equal a\n, flip Expect.equal a\n]\n``````\n\nWhen it reports an error, it’s not consistent about the order of the value and the expectation (it depends on which side has the extra key), but it’s good enough for my purposes for now.\n\nThis PR attempts to improve the documentation." ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.60587883,"math_prob":0.87094563,"size":2294,"snap":"2022-05-2022-21","text_gpt3_token_len":733,"char_repetition_ratio":0.17510916,"word_repetition_ratio":0.042372882,"special_character_ratio":0.3435048,"punctuation_ratio":0.24513619,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9716361,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-05-20T03:42:37Z\",\"WARC-Record-ID\":\"<urn:uuid:84eb7835-c6fb-42c8-baee-f32655cebea4>\",\"Content-Length\":\"23739\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:1bd4ef2c-a093-49c1-a4e4-bc409e557b7a>\",\"WARC-Concurrent-To\":\"<urn:uuid:55f9c8f2-b049-4d82-8c8c-cba3dfc74cc4>\",\"WARC-IP-Address\":\"64.62.250.111\",\"WARC-Target-URI\":\"https://discourse.elm-lang.org/t/json-encode-value-equality/898\",\"WARC-Payload-Digest\":\"sha1:WLG3KU5RAIG65QFMHQSSKHHQRKZK3GBN\",\"WARC-Block-Digest\":\"sha1:FKZ4LBDRYW3IONERYR2WTIFZ4NTFCT32\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-21/CC-MAIN-2022-21_segments_1652662531352.50_warc_CC-MAIN-20220520030533-20220520060533-00602.warc.gz\"}"}
https://www.datasciencesociety.net/the-curious-case-of-household-budget-surveyhbs/
[ "# Datathon NSI Solution – The curious case of ‘Household Budget Survey(HBS)’\n\nThe National Statistical Institute of Bulgaria (NSI) conducts annually a Household Budget Survey (HBS) with an objective to get reliable and scientifically founded data on the income, expenditure, consumption and other elements of the living standard of the population as well as changes, which have occurred during the years. NSI is considering a change in the periodicity of the Household Budget Survey from yearly to once on every five years,In order to optimize the cost of carrying out the survey. Hence We are creating a model which will predict household expenditure for the next four years using linear regression model and time series. The algorithms that we will be taking help from are linear regression model & Autoregressive integrated moving average(ARIMA). So lets not waste any time and move on with it !\n\n2", null, "### The Curious Case Of ‘House Budget Survey’\n\n#### STEP I : Understanding the data.\n\nThe Household Budget Survey is a sample survey by implementation of two-stage cluster. The general population from which the sample for the survey is formed comprises all the households in the country. Institutional households are not studied by the household budget survey. The unit of observation is every randomly chosen ordinary household irrespective of the number of members and their material and personal status. The sample size since 2010 is 3060 households each quarter spread into three sub-samples for 1 020 households. Each sub-sample is monitored for one month from each quarter, based on the rotation sample model. In this way, each household in the sample participates in the survey four months during a twelve-month period. The data provided is from 2010-2017.\n\nDatasets provided :\n\n• Data for total expenditure average per capita by COICOP.\n• Monetary income by source of income.\n• Population by 5 years for age, group & sex.\n• Annual average wages and salaries of employees under labor contract.\n• Population, employed & unemployed count of labor force.\n\nThe following packages have been used-\n\n• dplyr\n• ggplot2\n• psych\n• tidyr\n• plotly\n• forecast\n• tseries\n• lubridate\n\nThe Algorithms that have been used are-\n\nApproach 1:\n\n• Linear regression : Linear regression is used to explain the relationship between one dependent variable and one or more independent variables.\n• Time Series Linear Model : To fit the linear model with multiple independent variables, in time series.\n\nApproach 2:\n\n• Time Series Linear Model : To fit the linear model with multiple independent variables, in time series.\n\nApproach 3:\n\n• Time series :Time series is a sequence of numerical data points in successive order. Time series tracks the movement of the chosen data points, such as a expenditure, over a specified period of time with data points recorded at regular intervals.\n\n#### STEP III: Exploratory Data Analysis (EDA)\n\nWe have used linear regression to find the significant relation between expenditure and other parameters such as income, age,sex,population,pension etc. We have also taken the help of various charts to dig deep into the data.\n\n• Some main observation are as follows:\n• The income of a person highly affects the expenditure.\n• Non-labor force affects the expenditure significantly.\n• Expenditure does not depend greatly over unemployment benefits.\n• People spend twice as much money  on food and non alcoholic beverages as they do on their housing.\n• On an average citizens are earning almost 60% more than what they were earning in 2010 yet somehow the expenditure rate has not relatively increased.\n• There is no significant rise in earnings unless you are an employee under labor contract.\n\nWe have used three different approaches to predict the household values.\n\nApproach I: Using time series linear model\n\nThe provided data is in quarters but the expected prediction is supposed to be in years.  Hence the first step is to transform data into years.\n\n1: Taken all the independent columns which highly affect the total expenditure(Consumer Expenditure, Non-Consumer Expenditure), into a dataset.\n\n2: Divided the data into test and train data.\n\n3: Used Time Series Linear Model to train the data based on the multiple significant columns identified and predict total expenditure.\n\n4: Then used test data to forecast data.\n\n[Note: Given values for the significant independent columns , we can predict the expenditure for future years]\n\n#### Codes and Graphs for prediction on yearly basis\n\nTrain Dataset: 2010-2015\n\nTest Dataset: 2016-2017\n\nPredicted Features:\n\n• Total Expenditure\n• Consumer Expenditure\n• Non-Consumer Expenditure\n\nSignificant Features:\n\n• Average pension of one pensioner-BGN\n• Wages and salaries\n• Self-employment income\n• Pensions\n• Other social benefits\n• Regular transfers from other households\n• Persons not in the labour force\n• Annual Average wages and salaries of the employees under labour contract\n\n#### Approach 2: Prediction using Linear model time series on quarterly basis\n\nHere are some predicted graphs that we performed on our test and train data.\n(Train data from 2010-2015 ; Test data 2016-2017).\nFrom this here are some following observations which is given below.\n\n1. The following graph represents Total expenditure against yearly Quarters.\na. The Q1 (Quarter-1) of every year shows less expenditure compared to Q4 (Quarter-4) which represents seasonality.\nb. This is because of the Christmas and New year’s eve that comes under Q4, where people celebrate on a larger scale.\n\nTrain Dataset: 2010-2015\n\nTest Dataset: 2016-2017\n\nPredicted Features:\n\n• Total Expenditure\n• Consumer Expenditure\n• Non-Consumer Expenditure\n• Food and non-alcoholic beverages\n• Housing, water, electricity, gas and other fuels\n• Taxes_and_social_insurance_contributions\n\nSignificant Features:\n\n• Average pension of one pensioner-BGN\n• Wages and salaries\n• Self-employment income\n• Pensions\n• Other social benefits\n• Regular transfers from other households\n\n2. The following graph represents Total consumer expenditure against yearly Quarters.\na. It represents the linearity in trend that people’s expenditure is always high during the 4th Quarter of the year w.r.t to first 3 Quarters.\nb. The expenditure in 3rd Quarter is comparatively high because of the SOFIA Restaurant week in September, as the expenditure on food and non – beverages is more as compared to Alcoholic beverages.\n\n3. The following graph represents Total Non-Consumer expenditure against yearly Quarters.\na. Non-consumer expenditure includes expenditures such as Taxes and social insurance contributions, which is linear and proportional.\nb. It also shows that there is not much increment in taxes and social insurance expenditure.\n\n• 4. The following graph represents Total Food and non-alcoholic expenditure against yearly Quarters.\na. The following graph represents that the expenditure on food and non-alcoholic beverages increases gradually from Q1 (Quarter-1) to Q4 (Quarter -4).\nb. And the alcoholic beverages expenditure is less as compared to food and non-alcoholic beverages.\n\n6. The following graph represents Total Taxes expenditure against yearly Quarters.\na. It shows the linearity in the graph that with every year the taxes are increased by the government , which also contributes in the non-consumer expenditure\n\nApproach 3: Prediction using AUTO ARIMA.\n\nWe have used auto-arima to forcast the household expenditure for next four years with reference to the historical household data from 2010.\n\n## STEP V: Conclusion\n\nWe would recommend to go with approach one and two which is ‘Time series linear model’ to predict expenditure to build on few significant factors that are mentioned in above approach descriptions.\n\nThank-you. 🙂\n\n#### 6 thoughts on “Datathon NSI Solution – The curious case of ‘Household Budget Survey(HBS)’”\n\n1.", null, "laura says:\n0\n\nIn the case of the linear regression model that you described: can you make it more clear, which were the observations in the train set, which were the observations in the test set? Which were the features and which were the predicted variables?\nCan you also comment on the main difference between using a classical linear Regression and the ARIMA model? Which is more appropriate?\n\n2.", null, "svetro says:\n0\n\nThank you for working on the NSI case!\nYou are saying that the TS linear model is better but for example from the “food and non-alcoholic expenditures” graph it can be seen a lost of seasonality which can be crucial when calculating consumer price indicies. It would be better if you provided predicted vs expected values for some kind of error estimation. Otherwise the article is readable, friendly and shows dedication and understanding of a certain level of the subject.\n\n1.", null, "omki says:\n0\n\nWe have thought of seasonality in the data and found also that.\nHowever, we tried to incorporate as many variables for prediction in the model to get as good fit as possible. As the time was less, we could not deal with the seasonality in an effective manner. We will further work on this to get a better model.\nWe have seen the R-square value which seemed to be good comparing the original and predicted and so for the time-constraints we have omitted presenting that however those were plotted in the graph. We will further update our article.\n\n3.", null, "apoorvakesarwani says:\n0\n\nEDA: We used linear regression model to identify the most significant factors on which the change in expenditure is dependent.\nModel: We used time series linear regression model to predict the household expenditure based on the above identified significant factors. Made model on both yearly basis and quarterly basis and predicted.\nUsed Auto Arima as another approach to make predictions.\nDetails of Training data, test data, predicted variables and features have been mentioned in the article now.\nIn Linear model we identify the linearity between the variables and in ARIMA model we use historical data to predict the future values.\n\n4.", null, "junior says:\n0\n1.", null, "omki says:" ]
[ null, "https://dss-www-production.s3.amazonaws.com/uploads/2018/09/Word-Art.jpeg", null, "https://dss-www-production.s3.amazonaws.com/uploads/avatars/30/5a79914a6e164-bpfull.png", null, "https://www.gravatar.com/avatar/c9d1a094eb0e656f14773f6a450aa088", null, "https://www.gravatar.com/avatar/518be455f39e987010cc409b66b4ce80", null, "https://www.gravatar.com/avatar/8aa922e38b9f4dd0bce1df273fec9e65", null, "https://dss-www-production.s3.amazonaws.com/uploads/avatars/11/5a7b646b1153c-bpfull.png", null, "https://www.gravatar.com/avatar/518be455f39e987010cc409b66b4ce80", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.94066876,"math_prob":0.83000785,"size":8762,"snap":"2022-05-2022-21","text_gpt3_token_len":1809,"char_repetition_ratio":0.13245033,"word_repetition_ratio":0.08250356,"special_character_ratio":0.20235106,"punctuation_ratio":0.09915748,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.95155936,"pos_list":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"im_url_duplicate_count":[null,3,null,null,null,null,null,null,null,null,null,null,null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-05-20T10:33:09Z\",\"WARC-Record-ID\":\"<urn:uuid:6d5fa42a-51b9-4c75-b232-59cf2a2f4f3d>\",\"Content-Length\":\"127566\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:34a41d90-50a3-4785-811f-8ac982e48211>\",\"WARC-Concurrent-To\":\"<urn:uuid:7f384182-b963-4e9d-92d4-729274e2271d>\",\"WARC-IP-Address\":\"104.21.26.14\",\"WARC-Target-URI\":\"https://www.datasciencesociety.net/the-curious-case-of-household-budget-surveyhbs/\",\"WARC-Payload-Digest\":\"sha1:IQUI6L272ICWKULOD5DSU7OAFDOSRHVI\",\"WARC-Block-Digest\":\"sha1:67OXZEII4DHPJAK7Q2UAOJ4QCULWNLAT\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-21/CC-MAIN-2022-21_segments_1652662531779.10_warc_CC-MAIN-20220520093441-20220520123441-00481.warc.gz\"}"}
https://pyautolens.readthedocs.io/en/latest/advanced/database.html
[ "# Database#\n\nThe default behaviour of PyAutoLens is for model-fitting results to be output to hard-disc in folders, which are straight forward to navigate and manually check the lens modeling results. For small samples of lenses this is sufficient, however many users have a need to perform many model fits to large lens datasets, making the manual inspection of results time consuming.\n\nPyAutoLens’s database feature outputs all model-fitting results as a sqlite3 (https://docs.python.org/3/library/sqlite3.html) relational database, such that all results can be efficiently loaded into a Jupyter notebook or Python script for inspection, analysis and interpretation. This database supports advanced querying, so that specific model-fits (e.g., which fit a certain lens model or dataset) can be loaded.\n\nTo make it so that results are output to an .sqlite database we simply open a database session and pass this session to the non-linear search:\n\n```session = af.db.open_database(\"database.sqlite\")\n\nemcee = af.Emcee(\nsession=session, # This instructs the search to write to the .sqlite database.\n)\n```\n\nWhen a model-fit is performed, a unique identifier is generated based on the model and non-linear search. However, if we were to fit many different lens datasets with the same model and non-linear search, they would all use the same unique identifier and not be distinguishable by the database.\n\nWe can overcome this by using the name of the dataset as the `unique_tag` passed to the search, which is used alongside the model and search to create the unique identifier:\n\n```session = af.db.open_database(\"database.sqlite\")\n\ndataset_name = \"lens_dataset_0\"\n\nemcee = af.Emcee(\npath_prefix=path.join(\"features\", \"database\"),\nunique_tag=dataset_name, # This makes the unique identifier use the dataset name\nsession=session, # This instructs the search to write to the .sqlite database.\n)\n```\n\nLets suppose that we have performed 100 model-fits to 100 strong lenses, and when we ran PyAutoLens we told it to write to the `.sqlite` database file. We can load these results in a Python script or Jupyter notebook using the `Aggregator`:\n\n```agg = Aggregator.from_database(\"path/to/output/database.sqlite\")\n```\n\nWe can now use the `Aggregator` to inspect the results of all model-fits. For example, we can load the `Samples` object of all 100 model-fits, which contains information on the best-fit model, posterior, Bayesian evidence, etc.\n\nBelow, we use the samples generator to create a list of the maximum log likelihood of every model-fit and print it:\n\n```for samples in agg.values(\"samples\"):\n\nprint(max(samples.log_likelihood))\n```\n\nThis object (and all objects loaded by the `Aggregator`) are returned as a generator (as opposed to a list, dictionary or other Python type). This is because generators do not store large arrays or classes in memory until they are used, ensuring that when we are manipulating large sets of results we do not run out of memory!\n\nWe can iterate over the samples to print the maximum log likelihood lens model of every fit:\n\n```for samps in agg.values(\"samples\"):\n\ninstance = samps.max_log_likelihood()\n\nprint(\"Maximum Likelihood Model-fit \\n\")\nprint(instance)\n```\n\nThe `Aggregator` contains tools for querying the database for certain results, for example to load subsets of model-fits. This can be done in many different ways, depending on what information you want.\n\nBelow, we query based on the model fitted. For example, we can load all results which fitted an `Isothermal` mass model (note that when we performed the model fit, we composed the lens model using a lens galaxy name `lens` and mass component named `mass`):\n\n```lens = agg.model.galaxies.lens\nagg_query = agg.query(lens.mass == al.Isothermal)\n\nsamples_gen = agg_query.values(\"samples\")\n```\n\nQueries using the results of model-fitting are also supported. Below, we query the database to find all fits where the inferred value of the `einstein_radius` for the `Isothermal` is above 1.0:\n\n```lens = agg.model.galaxies.lens\n```\n\nAdvanced queries can be constructed using logic, for example we below we combine the two queries above to find all results which fitted an `Isothermal` AND (using the & symbol) inferred a value of sigma less than 3.0.\n\nThe OR logical clause is also supported via the symbol |.\n\n```agg_query = agg.query((lens.mass == al.Isothermal) & (lens.mass.einstein_radius > 1.0))\n```\n\nWe can query using the `unique_tag` to load the model-fit to a specific dataset:\n\n```agg_query = agg.query(agg.unique_tag == \"example_dataset_0\")\n```\n\nAn `info` dictionary can be passed into a model-fit, which contains information on the model-fit. The example below creates an `info` dictionary which is passed to the model-fit, which is then loaded via the database.\n\n```info = {\"example_key\": \"example_value\"}\n\nemcee.fit(model=model, analysis=analysis, info=info)\n\nagg = Aggregator.from_database(\"path/to/output/database.sqlite\")\n\ninfo_gen = agg.values(\"info\")\n```\n\nDatabases are an extremely powerful feature for users tasked with fitting extremely large datasets as well as fitting many different models, where the scale of the problem can make the management of the large quantity of results produced prohibitive. This is especially true on high performance computing facilities, which often have restrictions on the number of files that a user can store on the machine.\n\nFurthermore, if you are using the SLaM pipelines, non-linear grid searches or sensitivity mapping features you’ll be aware that one can easily start generating thousands or millions of model-fits. There is no way to manage this large library of results other than the database!\n\nA complete description of the database is given in the database folder on the autolens_workspace." ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.8287063,"math_prob":0.8509381,"size":5668,"snap":"2022-40-2023-06","text_gpt3_token_len":1231,"char_repetition_ratio":0.13259181,"word_repetition_ratio":0.03448276,"special_character_ratio":0.21030346,"punctuation_ratio":0.12369172,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.96450585,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-01-29T13:31:55Z\",\"WARC-Record-ID\":\"<urn:uuid:490c4b42-f0e3-48bd-99f1-f963bdd2a599>\",\"Content-Length\":\"69995\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:ab11746f-0d1a-49e4-8923-02ebc24d43cf>\",\"WARC-Concurrent-To\":\"<urn:uuid:67d19ded-1ac3-4dcd-be6d-54cce6e8fba0>\",\"WARC-IP-Address\":\"104.17.33.82\",\"WARC-Target-URI\":\"https://pyautolens.readthedocs.io/en/latest/advanced/database.html\",\"WARC-Payload-Digest\":\"sha1:H7KAJV6CFOAT76VCVCDPYLEGY6UQOG76\",\"WARC-Block-Digest\":\"sha1:5LGU2ANGEKPHUOLXDGS6D2GUFR7FXGQK\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-06/CC-MAIN-2023-06_segments_1674764499713.50_warc_CC-MAIN-20230129112153-20230129142153-00332.warc.gz\"}"}
https://tex.stackexchange.com/questions/181141/automatic-tikz-coordinate-calculations
[ "# automatic tikz coordinate calculations\n\nRight now I have these defined:\n\n\\coordinate (Z1) at (0.9,0.5);\n\\coordinate (Z2) at (0.816,-0.112);\n\\coordinate (Z3) at (0.46848,-0.46336);\n\n\nBut I would really like to automate this to be:", null, "so that I can just specify Z1 and then vary the α factor easily to get Z2 and Z3. (Right now α = 0.8)\n\nWhat's the simplest way to do this? I know how to do some coordinate calculations but this is beyond my skillset right now.\n\nedit: FWIW(For what it's worth) this can also be expressed as a coordinate transformation H = [1 alpha; -alpha 1]/(1+alpha^2) so maybe that's something worth using. I don't know how to force tikz to compute transformed coordinates.\n\n• Do you need to generalise this to any k, or will k be no larger than 3? – Torbjørn T. May 29 '14 at 22:43\n• I don't need to generalize, just get Z2 and Z3. – Jason S May 29 '14 at 22:57\n• It looks like a complex numbers calculation. Does tikz can do calculations directly with complex numbers ? – Tarass May 31 '14 at 11:05\n\n## 5 Answers\n\nYou could do something like this:\n\n\\documentclass[border=3mm,tikz]{standalone}\n\\begin{document}\n\\begin{tikzpicture}\n\\pgfmathsetmacro{\\Xi}{0.9}\n\\pgfmathsetmacro{\\Yi}{0.5}\n\\pgfmathsetmacro{\\Coeff}{0.8}\n\n\\pgfmathsetmacro{\\Xii}{(\\Xi+\\Coeff*\\Yi)/(1+\\Coeff^2)}\n\\pgfmathsetmacro{\\Yii}{(\\Yi-\\Coeff*\\Xi)/(1+\\Coeff^2)}\n\\pgfmathsetmacro{\\Xiii}{(\\Xii+\\Coeff*\\Yii)/(1+\\Coeff^2)}\n\\pgfmathsetmacro{\\Yiii}{(\\Yii-\\Coeff*\\Xii)/(1+\\Coeff^2)}\n\n\\coordinate (Z1) at (\\Xi,\\Yi);\n\\coordinate (Z2) at (\\Xii,\\Yii);\n\\coordinate (Z3) at (\\Xiii,\\Yiii);\n\n\\draw (Z1) -- (Z2) -- (Z3);\n\n\\end{tikzpicture}\n\\end{document}\n\n\nVersion with 4-argument macro:\n\n\\documentclass[tikz,border=2mm]{standalone}\n\\newcommand{\\defcoords}[Z]{%\n\\pgfmathsetmacro{\\Xi}{#2}\n\\pgfmathsetmacro{\\Yi}{#3}\n\\pgfmathsetmacro{\\Coeff}{#4}\n\n\\pgfmathsetmacro{\\Xii}{(\\Xi+\\Coeff*\\Yi)/(1+\\Coeff^2)}\n\\pgfmathsetmacro{\\Yii}{(\\Yi-\\Coeff*\\Xi)/(1+\\Coeff^2)}\n\\pgfmathsetmacro{\\Xiii}{(\\Xii+\\Coeff*\\Yii)/(1+\\Coeff^2)}\n\\pgfmathsetmacro{\\Yiii}{(\\Yii-\\Coeff*\\Xii)/(1+\\Coeff^2)}\n\n\\coordinate (#11) at (\\Xi,\\Yi);\n\\coordinate (#12) at (\\Xii,\\Yii);\n\\coordinate (#13) at (\\Xiii,\\Yiii);\n}\n\n\\begin{document}\n\\begin{tikzpicture}\n\\defcoords{0.9}{0.5}{0.8}\n\\draw (Z1) -- (Z2) -- (Z3);\n\n\\defcoords[C]{0.9}{0.5}{2}\n\\draw (C1) -- (C2) -- (C3);\n\\end{tikzpicture}\n\\end{document}\n\n• is there any way to do this, given Z1 as an input? (get its x and y coordinates and compute the Z2 and Z3 coordinates) – Jason S May 30 '14 at 22:04\n• @JasonS I updated my answer, was it something like that you had in mind? – Torbjørn T. May 30 '14 at 22:18\n\nA solution using TikZ powerful let...in syntax, which produces a code short and readable:\n\n\\documentclass{standalone}\n\\usepackage{tikz}\n\\usetikzlibrary{calc}\n\n\\begin{document}\n\\def\\nextZ#1{\n\\path let\n\\p1 = (Z#1),\n\\n1 = {(\\x1+\\coeff*\\y1)/(1+\\coeff^2)},\n\\n2 = {(\\y1-\\coeff*\\x1)/(1+\\coeff^2)},\n\\n3 = {int(#1+1)},\n\\p2 = (\\n1,\\n2)\nin\n(\\p2) coordinate (Z\\n3);\n}\n\n\\begin{tikzpicture}[scale=2]\n\\coordinate (Z1) at (0.9,0.5);\n\\def\\coeff{0.8}\n\n\\foreach \\z in {1,2,3,4,5} {\n\\fill[red] (Z\\z) circle(2pt) node[black,above]{$Z_\\z$};\n\\nextZ\\z\n}\n\n\\end{tikzpicture}\n\\end{document}", null, "A solution with Lua and LuaLaTeX:\n\n\\documentclass{article}\n\\usepackage{luacode}\n\\usepackage{tikz}\n\n\\begin{document}\n\\luaexec{\ntp = tex.print\nlocal alfa = 0.8\nlocal k = 1 + (0.8 * 0.8)\nx = {}\ny = {}\nx = 0.9\ny = 0.5\nfor i = 2, 3 do\nx[i] = (x[i-1] + alfa * y[i-1]) / k\ny[i] = (y[i-1] - alfa * x[i-1]) / k\nend\ntp(\"\\\\begin{tikzpicture}[scale=3]\")\ntp(\"\\\\coordinate (Z1) at (\"..x..\",\"..y..\");\")\ntp(\"\\\\coordinate (Z2) at (\"..x..\",\"..y..\");\")\ntp(\"\\\\coordinate (Z3) at (\"..x..\",\"..y..\");\")\ntp(\"\\\\draw[-latex] (Z1)node[left]{$Z1$}--(Z2) node[right]{$Z2$};\")\ntp(\"\\\\draw[-latex] (Z2)--(Z3) node[right]{$Z3$};\")\ntp(\"\\\\end{tikzpicture}\")\n}\n\n\\end{document}", null, "For more then 3 coordinate calculations, say 10:\n\n\\documentclass{article}\n\\usepackage{luacode}\n\\usepackage{tikz}\n\n\\begin{document}\n\\luaexec{\ntp = tex.print\ntp(\"\\\\begin{tikzpicture}[scale=3]\")\nlocal n = 10\nlocal alfa = 0.8\nlocal k = 1 + (0.8 * 0.8)\nx = {}\ny = {}\nx = 0.9\ny = 0.5\nfor i = 2, n do\nx[i] = (x[i-1] + alfa * y[i-1]) / k\ny[i] = (y[i-1] - alfa * x[i-1]) / k\ntp(\"\\\\draw[-latex] (\"..x[i-1]..\",\"..y[i-1]..\"])--(\"..x[i]..\",\"..y[i]..\");\")\nend\ntp(\"\\\\end{tikzpicture}\")\n}\n\n\\end{document}", null, "Another possibility:\n\n\\documentclass[tikz,margin=5mm,convert=false]{standalone}\n\\newlength\\px%\n\\newlength\\py%\n\n\\newcommand\\morecoords{%\n\\foreach[count=\\j] \\i in {2,...,#1}{%\n% get the coordinates of the previous point (unit: pt)\n\\pgfextractx{\\px}{\\pgfpointanchor{#2\\j}{center}}\n\\pgfextracty{\\py}{\\pgfpointanchor{#2\\j}{center}}\n% calculate the coordinates of the next point (unit: pt)\n\\pgfmathsetmacro\\nx{(\\px+#3*\\py)/(1+#3*#3)}\n\\pgfmathsetmacro\\ny{(\\py-#3*\\px)/(1+#3*#3)}\n% define the new coordinate\n\\coordinate(#2\\i)at(\\nx pt,\\ny pt);\n}\n}\n\\begin{document}\n\\begin{tikzpicture}\n\\draw[help lines,step=0.5](-1,-1) grid (1,1);\n\\draw(0,-1)--(0,1)(-1,0)--(1,0);\n%\n\\coordinate(Z1)at(.9,.5);% define Z1\n\\morecoords{Z}{.8}% calculate Z2 and Z3\n\\foreach[count=\\i start=2] \\j in {2,3}\\draw[red,-latex](Z\\i)--(Z\\j);\n%\n\\coordinate(P1)at(-.8,.8);% define P1\n\\morecoords{P}{.7}% calculate P2,...,P10\n\\foreach[count=\\i start=2] \\j in {2,...,10}\\draw[blue,-latex](P\\i)--(P\\j);\n%\n\\coordinate(C1)at(-60:0.9);% define C1\n\\morecoords{C}{.9}% calculate C2,...,C6\n\\foreach[count=\\i start=2] \\j in {2,...,6}\\draw[green,-latex](C\\i)--(C\\j);\n\\end{tikzpicture}\n\\end{document}", null, "I think a recursive formula needs a recursion :P\n\n\\documentclass[tikz]{standalone}\n\n\\def\\myrecursion#1#2#3#4{%\n\\ifnum#4>0\\relax%\n\\pgfmathsetmacro{\\tempx}{(#1+#3*#2)/(1+(#3)^2)}\n\\pgfmathsetmacro{\\tempy}{(#2-#3*#1)/(1+(#3)^2)}\n\\pgfmathtruncatemacro{\\tempc}{(#4-1)}\n\\draw[line cap=round,->,very thin] (#1 cm,#2 cm)--(\\tempx cm,\\tempy cm);\n\\edef\\temp{\\noexpand\\myrecursion{\\tempx}{\\tempy}{#3}{\\tempc}}\\temp%\n\\fi%\n}\n\n\\begin{document}\n\\begin{tikzpicture}\n\\myrecursion{0.9}{0.5}{0.8}{10}\n\\end{tikzpicture}\n\\end{document}", null, "" ]
[ null, "https://i.stack.imgur.com/5c1ak.png", null, "https://i.stack.imgur.com/sGogq.png", null, "https://i.stack.imgur.com/q8Wcd.png", null, "https://i.stack.imgur.com/CMZoO.png", null, "https://i.stack.imgur.com/HE9Re.png", null, "https://i.stack.imgur.com/7VmXW.png", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.9373327,"math_prob":0.99866736,"size":644,"snap":"2019-35-2019-39","text_gpt3_token_len":188,"char_repetition_ratio":0.140625,"word_repetition_ratio":0.0,"special_character_ratio":0.3167702,"punctuation_ratio":0.15068494,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9997844,"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-08-22T11:13:25Z\",\"WARC-Record-ID\":\"<urn:uuid:55f34e72-c9a5-4a27-9548-9d80c98ee599>\",\"Content-Length\":\"165199\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:65da8a82-c9ee-4431-8062-c567d9381423>\",\"WARC-Concurrent-To\":\"<urn:uuid:88ae3227-7223-411a-8c73-942d79531570>\",\"WARC-IP-Address\":\"151.101.129.69\",\"WARC-Target-URI\":\"https://tex.stackexchange.com/questions/181141/automatic-tikz-coordinate-calculations\",\"WARC-Payload-Digest\":\"sha1:HOPB2IP73T6BPIK7WMXH65WDYIZN3O6A\",\"WARC-Block-Digest\":\"sha1:NWAK6YROBXBTMMKWOQ75JVE3NCXOWGTU\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-35/CC-MAIN-2019-35_segments_1566027317113.27_warc_CC-MAIN-20190822110215-20190822132215-00185.warc.gz\"}"}
https://www.delftstack.com/zh/howto/arduino/arduino-char-to-int/
[ "# Arduino 的字符转换为整型\n\n## 使用 Arduino 中的简单方法将 `char` 转换为 `int`\n\n``````void loop{\nchar someChar = '2'; // variable to store char\nint someInt = someChar - '0';\n}\n``````\n\n## 在 Arduino 中使用 `toInt()` 函数将 `char` 转换为 `int`\n\n``````void loop(){\nchar someChar = '123';\nString stringOne = String('a');// converting a constant char into a String\nstringOne.toInt();\n}\n``````\n\n## 使用 Arduino 中的 `Serial.parseInt()` 函数将 `char` 转换为 `int`\n\n``````void loop(){\n\nif (Serial.available()>0){\nint valA = Serial.parseInt();\n}\n}\n``````\n\n## 相关文章 - Arduino Integer\n\n• 在 Arduino 中将整数转换为字符串" ]
[ null ]
{"ft_lang_label":"__label__zh","ft_lang_prob":0.9223705,"math_prob":0.8041455,"size":1193,"snap":"2021-21-2021-25","text_gpt3_token_len":583,"char_repetition_ratio":0.18923464,"word_repetition_ratio":0.0,"special_character_ratio":0.23470244,"punctuation_ratio":0.07446808,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.98481244,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-05-11T03:59:15Z\",\"WARC-Record-ID\":\"<urn:uuid:c8b9b8ca-1d0b-48b3-9605-d72b727ec14d>\",\"Content-Length\":\"38186\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:7b9f0417-69dc-4eb8-ba98-5081a8d44ab1>\",\"WARC-Concurrent-To\":\"<urn:uuid:c19e694d-50d9-461f-9d30-f6edfb341e65>\",\"WARC-IP-Address\":\"50.16.49.81\",\"WARC-Target-URI\":\"https://www.delftstack.com/zh/howto/arduino/arduino-char-to-int/\",\"WARC-Payload-Digest\":\"sha1:H3GVEXJUFLJQVKZYG5HV4FIJ2XYXUPJD\",\"WARC-Block-Digest\":\"sha1:RK7UL7FETYUKZWFYHYNYWQBMIUTEEQGD\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-21/CC-MAIN-2021-21_segments_1620243991641.5_warc_CC-MAIN-20210511025739-20210511055739-00550.warc.gz\"}"}
https://www.slideserve.com/zeph-jensen/anova-overview-of-major-designs
[ "# ANOVA Overview of Major Designs - PowerPoint PPT Presentation", null, "Download Presentation", null, "ANOVA Overview of Major Designs\n\nANOVA Overview of Major Designs", null, "Download Presentation", null, "## ANOVA Overview of Major Designs\n\n- - - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - - -\n##### Presentation Transcript\n\n1. ANOVA Overview of Major Designs\n\n2. Between or Within Subjects • Between-subjects (completely randomized) designs • Subjects are nested within treatment conditions • By nested we mean that subjects are observed under only a single condition of the study • Within-subjects (randomized block) designs • Subjects are crossed by treatment conditions • By crossed we mean that subjects are observed under two or more conditions of the study\n\n3. When to Use Repeated Measures • Within-subjects designs are an advantage when • Scores under one condition are correlated with scores under another condition • When examining the effects of practice on performance of a learning task, or the effects of age in a longitudinal study of development • That in which a series of tests or subtests is to be administered to a group of subjects\n\n4. Randomized Block ANOVA\n\n5. Fixed Effects • Fixed factors are those in which we have selected particular levels of the factor in question not by random sampling but on the basis of our interest in those particular effects. • Cannot view these levels as representative • Cannot generalize to other levels • Examples: most manipulated variables, organismic variables, time, sessions, subtests\n\n6. Random Effects • Random factors are those in which we view the levels of the factor as having been randomly sampled from a larger population of such levels. • The most common random factor is subjects. • If subjects are not randomized we cannot generalize to others\n\n7. Error Terms in Four Designs • The appropriate choice of an error term in a repeated measures design depends on the fixed and random effects of within sampling units and between sampling units. • The effects (fixed or random) we want to test are properly tested by dividing the MS for that effect by the MS for a random source of variation.\n\n8. Aggregating Error Terms • When the number of df per error term is small, insignificant interactions can be aggregated with the error term to produce a pooled error term with more df. • Once we compute an aggregated (pooled) error term, it replaces all the individual error terms that contributed to its computation.\n\n9. Assumptions • Independence of errors • Normality • Homogeneity of variance including the sphericity assumption (homogeneity-of-variance-of-differences)\n\n10. What’s in a Name? • Choosing the appropriate statistic or design involves an understanding of • The number of independent variables and levels • The nature of assignment of subjects to treatment levels • The number of dependent variables • The source table for an analysis of variance describes the partition of the total sum of squares\n\n11. Between Subjects Completely Randomized ANOVA • One independent variable with two or more levels • Subjects completely randomly assigned to treatment levels • Also called • One-Way ANOVA\n\n12. Completely Randomized Analysis of Variance\n\n13. Within SubjectsRandomized Block ANOVA • One independent variable with two or more levels • Uses repeated measures of matching • Also called • One-Way with Repeated Measures ANOVA\n\n14. Randomized BlockAnalysis of Variance\n\n15. Between SubjectsCompletely Randomized Factorial ANOVA • Two or more independent variables each with two or more levels • Subjects are completely randomly assigned to all treatment combinations • Also called • Two-Way or Higher Order Analysis of Variance\n\n16. Two-Way Analysis of Variance\n\n17. Within Subjects Randomized Block Factorial Analysis of Variance • Two or more independent variables each with two or more levels • All treatment combinations use repeated measures or matching. • Also called • Two-Way or Higher Order Repeated Measures Analysis of Variance\n\n18. Randomized Block Factorial Analysis of Variance\n\n19. Mixed Analysis of Variance Split-Plot Factorial • Two or more independent variables each with two or more levels • At least one variable is completely randomized (between subjects) • At least one variable is randomized block (within subjects).\n\n20. Split Plot Factorials - Mixed Designs" ]
[ null, "https://www.slideserve.com/img/replay.png", null, "https://thumbs.slideserve.com/1_6556445.jpg", null, "https://www.slideserve.com/photo/205759.jpeg", null, "https://www.slideserve.com/img/output_cBjjdt.gif", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.8946704,"math_prob":0.7693415,"size":3694,"snap":"2021-04-2021-17","text_gpt3_token_len":703,"char_repetition_ratio":0.13604335,"word_repetition_ratio":0.11336718,"special_character_ratio":0.18597727,"punctuation_ratio":0.031141868,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9733473,"pos_list":[0,1,2,3,4,5,6,7,8],"im_url_duplicate_count":[null,null,null,1,null,1,null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-04-23T17:10:03Z\",\"WARC-Record-ID\":\"<urn:uuid:e154f04d-ca6e-4bce-b9aa-5f576802857a>\",\"Content-Length\":\"90801\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:b6cda4e0-a08b-477a-b459-b399dc08ac04>\",\"WARC-Concurrent-To\":\"<urn:uuid:64659afa-9e94-4744-becc-64e9d9c31e5d>\",\"WARC-IP-Address\":\"44.236.52.34\",\"WARC-Target-URI\":\"https://www.slideserve.com/zeph-jensen/anova-overview-of-major-designs\",\"WARC-Payload-Digest\":\"sha1:GJGHIO3UB7U4KVHRULDGJ3DW4NWWDWW5\",\"WARC-Block-Digest\":\"sha1:D4KL7HNMILZJLIJM6JUBEIQ6MG3C22D4\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-17/CC-MAIN-2021-17_segments_1618039596883.98_warc_CC-MAIN-20210423161713-20210423191713-00140.warc.gz\"}"}
https://globaltest.com/shop/sensors/vibration-transducer/acceleration/with-voltage-output/industrial-with-voltage-output/one-axial-industrial-with-voltage-output/
[ "# One-axial\n\n• Conversion factor: 1 mV/m/s²\n• Relative coefficient of transverse conversion (less than): 0,05\n• Operating frequency range: 0,5 ... 8000 Hz\n...\nGet price\n• Conversion factor: 1 mV/m/s²\n• Relative coefficient of transverse conversion (less than): 0,05\n• Operating frequency range: 0,5 ... 8000 Hz\n...\nGet price\n• Conversion factor: 1 mV/m/s²\n• Relative coefficient of transverse conversion (less than): 0,05\n• Operating frequency range: 0,5 ... 5000 Hz\n...\nGet price\n• Conversion factor: 10 mV/m/s²\n• Relative coefficient of transverse conversion (less than): 0,05\n• Operating frequency range: 0,5 ... 8000 Hz\n...\nGet price\n• Conversion factor: 10 mV/m/s²\n• Relative coefficient of transverse conversion (less than): 0,05\n• Operating frequency range: 0,5 ... 8000 Hz\n...\nGet price\n• Conversion factor: 10 mV/m/s²\n• Relative coefficient of transverse conversion (less than): 0,05\n• Operating frequency range: 0,5 ... 5000 Hz\n...\nGet price\n• Conversion factor: 3 mV/m/s²\n• Relative coefficient of transverse conversion (less than): 0,05\n• Operating frequency range: 0,5 ... 8000 Hz\n...\nGet price\n• Conversion factor: 3 mV/m/s²\n• Relative coefficient of transverse conversion (less than): 0,05\n• Operating frequency range: 0,5 ... 8000 Hz\n...\nGet price\n• Conversion factor: 3 mV/m/s²\n• Relative coefficient of transverse conversion (less than): 0,05\n• Operating frequency range: 0,5 ... 5000 Hz\n...\nGet price\n• Conversion factor: 5 mV/m/s²\n• Relative coefficient of transverse conversion (less than): 0,05\n• Operating frequency range: 0,5 ... 8000 Hz\n...\nGet price\nSUBMIT A REQUEST" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.54392105,"math_prob":0.9743512,"size":3255,"snap":"2020-10-2020-16","text_gpt3_token_len":928,"char_repetition_ratio":0.16364196,"word_repetition_ratio":0.5154867,"special_character_ratio":0.2596006,"punctuation_ratio":0.18438539,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9892479,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-04-08T11:51:05Z\",\"WARC-Record-ID\":\"<urn:uuid:f9562fc5-61dd-443a-931e-97b661c6968e>\",\"Content-Length\":\"150640\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:cba39b1b-a64f-4a63-8356-b36aa3b8175e>\",\"WARC-Concurrent-To\":\"<urn:uuid:58ce5c24-6290-4a8c-a2f4-a8c14d16f3d8>\",\"WARC-IP-Address\":\"82.146.58.29\",\"WARC-Target-URI\":\"https://globaltest.com/shop/sensors/vibration-transducer/acceleration/with-voltage-output/industrial-with-voltage-output/one-axial-industrial-with-voltage-output/\",\"WARC-Payload-Digest\":\"sha1:Q43CVYDJMLQDZJRSLOBD7CWY2A7G6MNV\",\"WARC-Block-Digest\":\"sha1:DBWUTCFPWJBVVEJK7FTP7CZYVIVMP7HT\",\"WARC-Identified-Payload-Type\":\"application/xhtml+xml\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-16/CC-MAIN-2020-16_segments_1585371813538.73_warc_CC-MAIN-20200408104113-20200408134613-00299.warc.gz\"}"}
https://www.mathworks.com/matlabcentral/cody/problems/43-subset-sum/solutions/180199
[ "Cody\n\nProblem 43. Subset Sum\n\nSolution 180199\n\nSubmitted on 20 Dec 2012\nThis solution is locked. To view this solution, you need to provide a solution of the same size or smaller.\n\nTest Suite\n\nTest Status Code Input and Output\n1   Fail\n%% v = [2, 3, 5]; n = 8; correct = [2, 3]; actual = subset_sum(v, n); assert(isequal(actual, correct))\n\nError: You may not use the command(s) str2func in your code\n\n2   Fail\n%% v = [5, 3, 2]; n = 2; correct = 3; actual = subset_sum(v, n); assert(isequal(actual, correct))\n\nError: You may not use the command(s) str2func in your code\n\n3   Fail\n%% v = [2, 3, 5]; n = 4; correct = []; actual = subset_sum(v, n); assert(isequal(actual, correct))\n\nError: You may not use the command(s) str2func in your code\n\n4   Fail\n%% v = [1, 1, 1, 1, 1]; n = 5; correct = [1, 2, 3, 4, 5]; actual = subset_sum(v, n); assert(isequal(actual, correct))\n\nError: You may not use the command(s) str2func in your code\n\n5   Fail\n%% v = [1, 2, 3, 4, 100]; n = 100; correct = 5; actual = subset_sum(v, n); assert(isequal(actual, correct))\n\nError: You may not use the command(s) str2func in your code\n\n6   Fail\n%% v = [-7, -3, -2, 8, 5]; n = 0; correct = [2, 3, 5]; actual = subset_sum(v, n); assert(isequal(actual, correct))\n\nError: You may not use the command(s) str2func in your code" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.5392727,"math_prob":0.9978827,"size":1383,"snap":"2019-43-2019-47","text_gpt3_token_len":479,"char_repetition_ratio":0.12255257,"word_repetition_ratio":0.39215687,"special_character_ratio":0.3933478,"punctuation_ratio":0.22712934,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.997011,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-10-20T13:59:29Z\",\"WARC-Record-ID\":\"<urn:uuid:241883d0-fc05-4a4b-96c5-999d5ee0cb06>\",\"Content-Length\":\"73424\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:0e618b92-128f-455a-b79b-fc3a2612e8e0>\",\"WARC-Concurrent-To\":\"<urn:uuid:7a872387-ae5e-4651-abd4-1233acc1a121>\",\"WARC-IP-Address\":\"104.110.193.39\",\"WARC-Target-URI\":\"https://www.mathworks.com/matlabcentral/cody/problems/43-subset-sum/solutions/180199\",\"WARC-Payload-Digest\":\"sha1:FE2255OW3MAXUMV4DBMH4YF2UIWXMVIJ\",\"WARC-Block-Digest\":\"sha1:6Q5CU226KPI23IU2HZUFTEUBJMUKMAF5\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-43/CC-MAIN-2019-43_segments_1570986710773.68_warc_CC-MAIN-20191020132840-20191020160340-00379.warc.gz\"}"}
https://noteshunt.com/downloads/me2202-engineering-thermodynamics-important-questions/
[ "# ME2202 Engineering Thermodynamics Important Questions\n\nAnna University, Chennai\nDepartment of Mechanical Engineering\nME2202 Engineering Thermodynamics Important Questions\n\n1. A paddle wheel fixed to a shaft of an engine revolves in a closed hollow vessel containing water. This closed vessel is connected freely on the shaft and restraint to its turning moment is proved by mass attached to its side. Find the temperature rise for the following observations.\nEngine rpm = 650,\nLoad applied = 60 kg at a leverage of 1.2m,\nQuantity of water = 200 kg\nDuration of test\n\n2. A cylinder contains 0.45 m3 of gas at 1 x 105 N/m2 and 80oC. The gas is compressed to a volume of 0.13 m3, the final pressure being 5 X 105 N/m2  Determine i) The mass of gas ii) The value of index ‘n’ for compression The increase in internal energy of the gas and iv) The heat received or rejected by the gas during compression. Take γ = 1.4 R = 294.2 J/kg K\n\n3. A turbine operates under steady flow condition receives steam at the following state pressure = 1.2Mpa, Temperature =1880C, Enthalpy = 2785 kJ/kg, velocity = 33.3m/sec and elevation = 3m. The steam leaves the turbine at the following state: pressure = 20Kpa, Enthalpy = 2512 kJ/kg, velocity = 100m/sec and elevation = 0m. Heat is lost to the surrounding at the rate of 0.29kJ/sec. If the rate steam flow to the turbine is 0.42kg/sec what is the power output of the turbine in KW\n\n4. Three grams of nitrogen gas at 6atm and 160°c is expanded adiabatically to double its initial volume, then compressed at constant pressure to its initial volume and then compressed again at constant volume to its initial state. Calculate the net work done on the gas. Draw P-V diagram for the process. Specific heat ratio of nitrogen is 1.4.\n\n5. One litre of hydrogen at 273 K is adiabatically compressed to one-half of its initial volume. Find the change in temperature of the gas, if the ratio of two specific heats for hydrogen is 1.4\n\n6. An Engine-working on Otto cycle has a volume of 0.45 m3 , pressure 1 bar and temperature 30o,C at the beginning of compression stroke. At the end of compression stroke, the pressure is 11 bar and 210 KJ of heat is added at constant volume. Determine (i) Pressure, temperature and volumes at salient points in the cycle.’ (ii) Efficiency\n\n7. Derive the expression for thermal efficiency of a Carnot cycle with its p-V and Ts Diagram?\n\n8. A Carnot engine takes heat from an infinite reservoir at 5500C and rejects it to a sink 2750C. Half of the work delivered by the engine is used to run generator and the other half is used to run heat pump which takes heat at 2750C and rejects it at 4400C. Express the heat rejected at 4400C by the heat pump as {7bda82c1e6998b9ed8f6e0f52f1ca5ed9d6da876adcfbd0d890c6e0d88340190} of heat supplied to the engine at 5500C. If the operation of the generator is 500W, Find the heat rejected/hour by the heat pump at 4400C?\n\n9. Establish the inequality of Clausius and express Entropy change in irreversible process.\n\n10. 1 kg of steam initially dry saturated at 1.1 MPa expands in a cylinder following the law PV113 = C. The pressure at the end of expansion is 0.1 MPa. Determine (i) The final volume (ii) Final dryness fraction (hi) Work done (iv) The change in internal energy (v) The heat transferred\n\n11. Draw the p-V diagram of pure substance and explain its various regions of the diagram in details?\n\n12. with help of T-s diagram explain the various process of ideal Rankine’s cycle and derive the efficiency in terms of enthalpy?\n\n13. Steam at a pressure of 15 bar and 250°C expands according to the law PV1.25 = C to a pressure of 1.5 bar. Find the final conditions, work done, heat transfer and change in entropy. The mass is 0.8 kg\n\n14. Derive clausius-claperyon equation\n\n15. Deduce the Maxwell relations from thermodynamic property relations?\n\n16. Using Clausius Cleperyon’s equation, Estimate the enthalpy of vaporization at 2200C saturation temperature. Take the following data Ts = 2200C; vg = 0.08603m3/kg; vf =0.00119m3/kg.\n\n17. 2kg of air at 300C, 65{7bda82c1e6998b9ed8f6e0f52f1ca5ed9d6da876adcfbd0d890c6e0d88340190} RH is mixed adiabatically with 5kg of air at 200C, 10{7bda82c1e6998b9ed8f6e0f52f1ca5ed9d6da876adcfbd0d890c6e0d88340190}RH. Determine final condition of the mixture?\n\n18. Give short notes on following (a) Specific humidity (b) Relative humidity (c) Dew point temperature (d) Wet bulb depression\n\n19. Air has a dry bulb temperature of 250C and wet bulb temperature of 150C. If\n(a) Vapour pressure\n(b) Specific humidity\n(c) Saturation ratio\n(d) Relative humidity\n(e) Dew point temperature\n(f) Vapour density\n(g) Enthalpy of mixture\n\n0 reviews\n5 stars\n0\n4 stars\n0\n3 stars\n0\n2 stars\n0\n1 star\n0" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.86677694,"math_prob":0.9252631,"size":4661,"snap":"2021-31-2021-39","text_gpt3_token_len":1304,"char_repetition_ratio":0.1112304,"word_repetition_ratio":0.0,"special_character_ratio":0.28041193,"punctuation_ratio":0.105320305,"nsfw_num_words":1,"has_unicode_error":false,"math_prob_llama3":0.98372084,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-09-21T13:38:54Z\",\"WARC-Record-ID\":\"<urn:uuid:0bd85e6e-ef9b-4175-9bc1-f85a0ebba8ab>\",\"Content-Length\":\"135564\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:aa1084b2-1430-40d2-9dfe-7eb815def3b6>\",\"WARC-Concurrent-To\":\"<urn:uuid:1a468557-27ea-4891-998f-76fad424655b>\",\"WARC-IP-Address\":\"172.67.132.58\",\"WARC-Target-URI\":\"https://noteshunt.com/downloads/me2202-engineering-thermodynamics-important-questions/\",\"WARC-Payload-Digest\":\"sha1:GEJ6PBQYMTRZ6FXPCQUY465SW7Z5UALB\",\"WARC-Block-Digest\":\"sha1:EVZVU3NP55TBHLPRNM3FB55NPMOUISKL\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-39/CC-MAIN-2021-39_segments_1631780057225.38_warc_CC-MAIN-20210921131252-20210921161252-00674.warc.gz\"}"}
https://math.libretexts.org/Bookshelves/Calculus/Map%3A_Calculus__Early_Transcendentals_(Stewart)/17%3A_SecondOrder_Differential_Equations/17.01%3A_Second-Order_Linear_Equations
[ "# 17.1: Second-Order Linear Equations\n\n$$\\newcommand{\\vecs}{\\overset { \\rightharpoonup} {\\mathbf{#1}} }$$ $$\\newcommand{\\vecd}{\\overset{-\\!-\\!\\rightharpoonup}{\\vphantom{a}\\smash {#1}}}$$$$\\newcommand{\\id}{\\mathrm{id}}$$ $$\\newcommand{\\Span}{\\mathrm{span}}$$ $$\\newcommand{\\kernel}{\\mathrm{null}\\,}$$ $$\\newcommand{\\range}{\\mathrm{range}\\,}$$ $$\\newcommand{\\RealPart}{\\mathrm{Re}}$$ $$\\newcommand{\\ImaginaryPart}{\\mathrm{Im}}$$ $$\\newcommand{\\Argument}{\\mathrm{Arg}}$$ $$\\newcommand{\\norm}{\\| #1 \\|}$$ $$\\newcommand{\\inner}{\\langle #1, #2 \\rangle}$$ $$\\newcommand{\\Span}{\\mathrm{span}}$$ $$\\newcommand{\\id}{\\mathrm{id}}$$ $$\\newcommand{\\Span}{\\mathrm{span}}$$ $$\\newcommand{\\kernel}{\\mathrm{null}\\,}$$ $$\\newcommand{\\range}{\\mathrm{range}\\,}$$ $$\\newcommand{\\RealPart}{\\mathrm{Re}}$$ $$\\newcommand{\\ImaginaryPart}{\\mathrm{Im}}$$ $$\\newcommand{\\Argument}{\\mathrm{Arg}}$$ $$\\newcommand{\\norm}{\\| #1 \\|}$$ $$\\newcommand{\\inner}{\\langle #1, #2 \\rangle}$$ $$\\newcommand{\\Span}{\\mathrm{span}}$$$$\\newcommand{\\AA}{\\unicode[.8,0]{x212B}}$$\n\n##### Learning Objectives\n• Recognize homogeneous and nonhomogeneous linear differential equations.\n• Determine the characteristic equation of a homogeneous linear equation.\n• Use the roots of the characteristic equation to find the solution to a homogeneous linear equation.\n• Solve initial-value and boundary-value problems involving linear differential equations.\n\nWhen working with differential equations, usually the goal is to find a solution. In other words, we want to find a function (or functions) that satisfies the differential equation. The technique we use to find these solutions varies, depending on the form of the differential equation with which we are working. Second-order differential equations have several important characteristics that can help us determine which solution method to use. In this section, we examine some of these characteristics and the associated terminology.\n\n## Homogeneous Linear Equations\n\nConsider the second-order differential equation\n\n$xy''+2x^2y'+5x^3y=0.\\nonumber$\n\nNotice that $$y$$ and its derivatives appear in a relatively simple form. They are multiplied by functions of $$x$$, but are not raised to any powers themselves, nor are they multiplied together. As discussed in previously, first-order equations with similar characteristics are said to be linear. The same is true of second-order equations. Also note that all the terms in this differential equation involve either $$y$$ or one of its derivatives. There are no terms involving only functions of $$x$$. Equations like this, in which every term contains $$y$$ or one of its derivatives, are called homogeneous.\n\nNot all differential equations are homogeneous. Consider the differential equation\n\n$xy''+2x^2y'+5x^3y=x^2.\\nonumber$\n\nThe $$x^2$$ term on the right side of the equal sign does not contain $$y$$ or any of its derivatives. Therefore, this differential equation is nonhomogeneous.\n\n##### Definition: Homogeneous and Nonhomogeneous Linear Equations\n\nA second-order differential equation is linear if it can be written in the form\n\n$a_{2}(x)y''+a){1}(x)y'+a_{0}(x)y=r(x), \\label{17.1}$\n\nwhere $$a_{2}(x), a_{1}(x), a_{0}(x),$$ and $$r(x)$$ are real-valued functions and $$a_{2}(x)$$ is not identically zero. If $$r(x) \\equiv 0$$—in other words, if $$r(x)=0$$ for every value of $$x$$—the equation is said to be a homogeneous linear equation. If $$r(x) \\neq 0$$ for some value of $$x,$$ the equation is said to be a nonhomogeneous linear equation.\n\nIn linear differential equations, $$y$$ and its derivatives can be raised only to the first power and they may not be multiplied by one another. Terms involving $$y^2$$ or $$\\sqrt{y'}$$ make the equation nonlinear. Functions of $$y$$ and its derivatives, such as $$\\sin y$$ or $$e^{y'}$$, are similarly prohibited in linear differential equations.\n\nNote that equations may not always be given in standard form (the form shown in the definition). It can be helpful to rewrite them in that form to decide whether they are linear, or whether a linear equation is homogeneous.\n\n##### Example $$\\PageIndex{1}$$: Classifying Second-Order Equations\n\nClassify each of the following equations as linear or nonlinear. If the equation is linear, determine further whether it is homogeneous or nonhomogeneous.\n\n1. $$y''+3x^4y'+x^2y^2=x^3$$\n2. $$(\\sin x)y''+(\\cos x)y'+3y=0$$\n3. $$4t^2x''+3txx'+4x=0$$\n4. $$5y''+y=4x^5$$\n5. $$( \\cos x)y''- \\sin y'+( \\sin x)y- \\cos x=0$$\n6. $$8ty''-6t^2y'+4ty-3t^2=0$$\n7. $$\\sin(x^2)y''-( \\cos x)y'+x^2y=y'-3$$\n8. $$y''+5xy'-3y= \\cos y$$\n\nSolution\n\n1. This equation is nonlinear because of the $$y^2$$ term.\n2. This equation is linear. There is no term involving a power or function of $$y,$$ and the coefficients are all functions of $$x$$.The equation is already written in standard form, and $$r(x)$$ is identically zero, so the equation is homogeneous.\n3. This equation is nonlinear. Note that, in this case, $$x$$ is the dependent variable and $$t$$is the independent variable. The second term involves the product of $$x$$ and $$x'$$, so the equation is nonlinear.\n4. This equation is linear. Since $$r(x)=4x^5,$$ the equation is nonhomogeneous.\n5. This equation is nonlinear, because of the $$\\sin y'$$ term.\n6. This equation is linear. Rewriting it in standard form gives\n\n$8t^2y''-6t^2y'+4ty=3t^2. \\nonumber$\n\nWith the equation in standard form, we can see that $$r(t)=3t^2,$$so the equation is nonhomogeneous.\n7. This equation looks like it’s linear, but we should rewrite it in standard form to be sure. We get\n\n$\\sin(x^2)y''-(\\cos x+1)y'+x^2y=-3. \\nonumber$\n\nThis equation is, indeed, linear. With $$r(x)=-3,$$ it is nonhomogeneous.\n8. This equation is nonlinear because of the $$\\cos y$$ term.\n##### Exercise $$\\PageIndex{1}$$\n\nClassify each of the following equations as linear or nonlinear. If the equation is linear, determine further whether it is homogeneous or nonhomogeneous.\n\n1. $$(y'')2-y'+8x^3y=0$$\n2. $$(\\sin t)y''+ \\cos t-3ty'=0$$\nHint\n\nWrite the equation in standard form (Equation \\ref{17.1}) if necessary. Check for powers or functions of $$y$$ and its derivatives.\n\nNonlinear Linear\n\nnonhomogeneous\n\nLater in this section, we will see some techniques for solving specific types of differential equations. Before we get to that, however, let’s get a feel for how solutions to linear differential equations behave. In many cases, solving differential equations depends on making educated guesses about what the solution might look like. Knowing how various types of solutions behave will be helpful.\n\n##### Example $$\\PageIndex{2}$$: Verifying a Solution\n\nConsider the linear, homogeneous differential equation\n\n$x^2y''-xy′-3y=0. \\nonumber$\n\nLooking at this equation, notice that the coefficient functions are polynomials, with higher powers of $$x$$ associated with higher-order derivatives of $$y$$. Show that $$y=x^3$$ is a solution to this differential equation.\n\nSolution\n\nLet $$y=x^3.$$ Then $$y'=3x^2$$ and $$y''=6x.$$ Substituting into the differential equation, we see that\n\n\\begin{align*} x^2y''-xy'-3y &=x^2(6x)-x(3x^2)-3(x^3) \\\\[4pt] &=6x^3-3x^3-3x^3 \\\\[4pt] &=0. \\end{align*}\n\n##### Exercise $$\\PageIndex{2}$$\n\nShow that $$y=2x^2$$ is a solution to the differential equation\n\n$\\dfrac{1}{2}x^2y''-xy'+y=0. \\label{ex2}$\n\nHint\n\nCalculate the derivatives and substitute them into the differential equation.\n\nThis requires calculating $$y'$$ and $$y''$$.\n\n$y' = \\dfrac{dy}{dx} = 4x \\nonumber$\n\nand\n\n$y'' = \\dfrac{dy'}{dx} = 4 \\nonumber$\n\nInserting these derivatives along with $$y=2x^2$$ into Equation \\ref{ex2}.\n\n\\begin{align*} \\dfrac{1}{2}x^2y''-xy'+y &\\overset{?}{=} 0 \\\\[4pt] \\dfrac{1}{2}x^2(4) - x (4x) + 2x^2 &\\overset{?}{=} 0 \\\\[4pt] 2x^2 - 4x^2 + 2x^2 &\\overset{\\checkmark}{=} 0 \\end{align*} \\nonumber\n\nYes, this is a solution to the differential equation in Equation \\ref{ex2}.\n\nAlthough simply finding any solution to a differential equation is important, mathematicians and engineers often want to go beyond finding one solution to a differential equation to finding all solutions to a differential equation. In other words, we want to find a general solution. Just as with first-order differential equations, a general solution (or family of solutions) gives the entire set of solutions to a differential equation. An important difference between first-order and second-order equations is that, with second-order equations, we typically need to find two different solutions to the equation to find the general solution. If we find two solutions, then any linear combination of these solutions is also a solution. We state this fact as the following theorem.\n\n##### Theorem: SUPERPOSITION PRINCIPLE\n\nIf $$y_1(x)$$ and $$y_2(x)$$ are solutions to a linear homogeneous differential equation, then the function\n\n$y(x)=c_1y_1(x)+c_2y_2(x), \\label{super}$\n\nwhere $$c_1$$ and $$c_2$$ are constants, is also a solution.\n\nThe proof of this superposition principle theorem is left as an exercise.\n\n##### Example $$\\PageIndex{3}$$: Verifying the Superposition Principle\n\nConsider the differential equation\n\n$y''-4y'-5y=0.\\nonumber$\n\nGiven that $$e^{-x}$$ and $$e^{5x}$$ are solutions to this differential equation, show that $$4e^{-x}+e^{5x}$$ is a solution.\n\nSolution\n\nAlthough this can be done through a simple application of the Superposition principle (Equation \\ref{super}), but we can also confirm it is a solution via an approach like in Example $$\\PageIndex{2}$$. We have\n\n\\begin{align*} y(x) &=4e^{-x}+e^{5x} \\\\[4pt] y'(x) &= -4e^{-x} + 5e^{5x} \\\\[4pt] y''(x) &=4e^{-x}+25e^{5x}. \\end{align*}\n\nThen\n\n\\begin{align*} y''-4y'-5y &\\overset{?}{=} (4e^{-x}+25e^{5x})-4(-4e^{-x}+5e^{5x})-5(4e^{-x}+e^{5x}) \\\\[4pt] &\\overset{?}{=} 4e^{-x}+25e^{5x}+16e^{-x}-20e^{5x}-20e^{-x}-5e^{5x} \\\\[4pt] &\\overset{\\checkmark}{=}0. \\end{align*} \\nonumber\n\nThus, $$y(x)=4e^{-x}+e^{5x}$$ is a solution.\n\n##### Exercise $$\\PageIndex{3}$$\n\nConsider the differential equation\n\n$y''+5y'+6y=0. \\nonumber$\n\nGiven that $$e^{-2x}$$ and $$e^{-3x}$$ are solutions to this differential equation, show that $$3e^{-2x}+6e^{-3x}$$ is a solution.\n\nHint\n\nDifferentiate the function and substitute into the differential equation.\n\nAlthough this can be a simple application of the Superposition principle (Equation \\ref{super}), we can also set through it like in Example $$\\PageIndex{2}$$. We have\n\n\\begin{align*} y(x) &=3e^{-2x}+6e^{-3x} \\\\[4pt] y'(x) &= -6 e^{-2x} - 18e^{-3x} \\\\[4pt] y''(x) &= 12e^{-2x} + 54e^{3x}. \\end{align*}\n\nThen\n\n\\begin{align*} y''+5y'+6y &= (12e^{-2x} + 54e^{3x}) + 5( -6 e^{-2x} - 18e^{-3x} ) + 6( 3e^{-2x} + 6e^{3x}) \\\\[4pt] &\\overset{?}{=} \\cancel{12e^{-2x}} + \\bcancel{54e^{3x}} - \\cancel{30e^{-2x}} - \\bcancel{90e^{3x}} + \\cancel{18e^{-2x}} + \\bcancel{36e^{3x}} \\\\[4pt] &\\overset{\\checkmark}{=}0. \\end{align*} \\nonumber\n\nThus, $$3e^{-2x}+6e^{-3x}$$ is a solution to the differential equation\n\nUnfortunately, to find the general solution to a second-order differential equation, it is not enough to find any two solutions and then combine them. Consider the differential equation\n\n$x''+7x'+12x=0.\\nonumber$\n\nBoth $$e^{-3t}$$ and $$2e^{-3t}$$ are solutions (you can check this). However,\n\n$x(t)=c_1e^{-3t}+c_2(2e^{-3t})\\nonumber$\n\nis not the general solution. This expression does not account for all solutions to the differential equation. In particular, it fails to account for the function $$e^{-4t},$$ which is also a solution to the differential equation. It turns out that to find the general solution to a second-order differential equation, we must find two linearly independent solutions. We define that terminology here.\n\n##### Definition: Linearly Dependent functions\n\nA set of functions $$f_1(x),\\, f_2(x), \\ldots ,f_n(x)$$ is said to be linearly dependent if there are constants $$c_1,\\, c_2, \\ldots c_n,$$, not all zero, such that\n\n$c_1f_1(x)+c_2f_2(x)+ \\cdots +c_nf_n(x)=0 \\nonumber$\n\nfor all $$x$$ over the interval of interest. A set of functions that is not linearly dependent is said to be linearly independent.\n\nIn this chapter, we usually test sets of only two functions for linear independence, which allows us to simplify this definition. From a practical perspective, we see that two functions are linearly dependent if either one of them is identically zero or if they are constant multiples of each other.\n\nFirst we show that if the functions meet the conditions given previously, then they are linearly dependent. If one of the functions is identically zero—say, $$f_2(x) \\equiv 0$$—then choose $$c_1=0$$ and $$c_2=1,$$ and the condition for linear dependence is satisfied. If, on the other hand, neither $$f_1(x)$$ nor $$f_2(x)$$ is identically zero, but $$f_1(x)=Cf_2(x)$$ for some constant $$C,$$ then choose $$c_1=C$$ and $$c_2=-1,$$ and again, the condition is satisfied.\n\nNext, we show that if two functions are linearly dependent, then either one is identically zero or they are constant multiples of one another. Assume $$f_1(x)$$ and $$f_2(x)$$ are linearly independent. Then, there are constants, $$c_1$$ and $$c_2,$$ not both zero, such that\n\n$c_1f_1(x)+c_2f_2(x)=0 \\nonumber$\n\nfor all $$x$$ over the interval of interest. Then,\n\n$c_1f_1(x)=-c_2f_2(x). \\nonumber$\n\nNow, since we stated that $$c_1$$ and $$c_2$$ can’t both be zero, assume $$c_2 \\neq 0.$$ Then, there are two cases: either $$c_1=0$$ or $$c_1\\neq 0.$$ If $$c_1=0,$$ then\n\n\\begin{align*} 0 &=-c_2f_2(x) \\\\[4pt] 0 &=f_2(x), \\end{align*}\n\nso one of the functions is identically zero. Now suppose $$c_1 \\neq 0.$$ Then,\n\n$f_1(x)=\\left(- \\dfrac{c_2}{c_1}\\right)f_2(x) \\nonumber$\n\nand we see that the functions are constant multiples of one another.\n\n##### Theorem: Linear Dependence of Two Functions\n\nTwo functions, $$f_1(x)$$ and $$f_2(x),$$ are said to be linearly dependent if either one of them is identically zero or if $$f_1(x)=Cf_2(x)$$ for some constant $$C$$ and for all $$x$$ over the interval of interest. Functions that are not linearly dependent are said to be linearly independent.\n\n##### Example $$\\PageIndex{4}$$: Testing for Linear Dependence\n\nDetermine whether the following pairs of functions are linearly dependent or linearly independent.\n\n1. $$f_1(x)=x^2$$ and $$f_2(x)=5x^2$$\n2. $$f_1(x)= \\sin x$$ and $$f_2(x)= \\cos x$$\n3. $$f_1(x)=e^{3x}$$ and $$f_2(x)=e^{-3x}$$\n4. $$f_1(x)=3x$$ and $$f_2(x)=3x+1$$\n\nSolution\n\n1. $$f_2(x)=5f_1(x),$$ so the functions are linearly dependent.\n2. There is no constant $$C$$ such that $$f_1(x)=Cf_2(x),$$ so the functions are linearly independent.\n3. There is no constant $$C$$ such that $$f_1(x)=Cf_2(x),$$ so the functions are linearly independent. Don’t get confused by the fact that the exponents are constant multiples of each other. With two exponential functions, unless the exponents are equal, the functions are linearly independent.\n4. There is no constant $$C$$ such that $$f_1(x)=Cf_2(x),$$ so the functions are linearly independent.\n##### Exercise $$\\PageIndex{4}$$\n\nDetermine whether the following pairs of functions are linearly dependent or linearly independent: $$f_1(x)=e^{x}$$ and $$f_2(x)=3e^{3x}.$$\n\nHint\n\nAre the functions constant multiples of one another?\n\nLinearly independent\n\nIf we are able to find two linearly independent solutions to a second-order differential equation, then we can combine them to find the general solution. This result is formally stated in the following theorem.\n\n##### Theorem: General Solution to a Homogeneous Equation\n\nIf $$y_1(x)$$ and $$y_2(x)$$ are linearly independent solutions to a second-order, linear, homogeneous differential equation, then the general solution is given by\n\n$y(x)=c_1y_1(x)+c_2y_2(x), \\nonumber$\n\nwhere $$c_1$$ and $$c_2$$ are constants.\n\nWhen we say a family of functions is the general solution to a differential equation, we mean that\n\n1. every expression of that form is a solution and\n2. every solution to the differential equation can be written in that form, which makes this theorem extremely powerful.\n\nIf we can find two linearly independent solutions to a second order differential equation, we have, effectively, found all solutions to the second order differential equation—quite a remarkable statement. The proof of this theorem is beyond the scope of this text.\n\n##### Example $$\\PageIndex{5}$$: Writing the General Solution\n\nIf $$y_1(t)=e^{3t}$$ and $$y_2(t)=e^{-3t}$$ are solutions to $$y''-9y=0,$$ what is the general solution?\n\nSolution\n\nNote that $$y_1$$ and $$y_2$$ are not constant multiples of one another, so they are linearly independent. Then, the general solution to the differential equation is\n\n$$y(t)=c_1e^{3t}+c_2e^{-3t}.$$\n\n##### Exercise $$\\PageIndex{5}$$\n\nIf $$y_1(x)=e^{3x}$$ and $$y_2(x)=xe^{3x}$$ are solutions to $$y''-6y'+9y=0,$$ what is the general solution?\n\nHint\n\nCheck for linear independence first.\n\n$$y(x)=c_1e^{3x}+c_2xe^{3x}$$\n\n## Second-Order Equations with Constant Coefficients\n\nNow that we have a better feel for linear differential equations, we are going to concentrate on solving second-order equations of the form\n\n$ay''+by'+cy=0, \\tag{17.2}$\n\nwhere $$a, b,$$ and $$c$$ are constants.\n\nSince all the coefficients are constants, the solutions are probably going to be functions with derivatives that are constant multiples of themselves. We need all the terms to cancel out, and if taking a derivative introduces a term that is not a constant multiple of the original function, it is difficult to see how that term cancels out. Exponential functions have derivatives that are constant multiples of the original function, so let’s see what happens when we try a solution of the form $$y(x)=e^{ \\lambda x}$$, where $$\\lambda$$ (the lowercase Greek letter lambda) is some constant.\n\nIf $$y(x)=e^{ \\lambda x}$$, then $$y'(x)= \\lambda e^{ \\lambda x}$$ and $$y''= \\lambda^2 e^{ \\lambda x}.$$ Substituting these expressions into Equation \\ref{17.1}, we get\n\n\\begin{align*} ay''+by'+cy &= a(\\lambda^2e^{\\lambda x})+b(\\lambda e^{\\lambda x})+ce^{\\lambda x} \\\\[4pt] &=e^{\\lambda x}(a \\lambda^2+b \\lambda +c). \\end{align*}\n\nSince $$e^{\\lambda x}$$ is never zero, this expression can be equal to zero for all $$x$$ only if\n\n$a\\lambda^2+b\\lambda +c=0. \\nonumber$\n\nWe call this the characteristic equation of the differential equation.\n\n##### Definition: characteristic equation\n\nThe characteristic equation of the second order differential equation $$ay''+by'+cy=0$$ is\n\n$a\\lambda^2+b\\lambda +c=0. \\nonumber$\n\nThe characteristic equation is very important in finding solutions to differential equations of this form. We can solve the characteristic equation either by factoring or by using the quadratic formula\n\n$\\lambda = \\dfrac{-b \\pm \\sqrt{b^2-4ac}}{2a}. \\nonumber$\n\nThis gives three cases. The characteristic equation has\n\n1. distinct real roots;\n2. a single, repeated real root; or\n3. complex conjugate roots.\n\nWe consider each of these cases separately.\n\n##### Case 1: Distinct Real Roots\n\nIf the characteristic equation has distinct real roots $$\\lambda_1$$ and $$\\lambda_2$$, then $$e^{\\lambda_1x}$$ and $$e^{\\lambda_2x}$$ are linearly independent solutions to Example \\ref{17.1}, and the general solution is given by\n\n$y(x)=c_1e^{\\lambda_1x}+c_2e^{\\lambda_2x}, \\nonumber$\n\nwhere $$c_1$$ and $$c_2$$ are constants.\n\nFor example, the differential equation $$y''+9y'+14y=0$$ has the associated characteristic equation $$\\lambda^2+9\\lambda+14=0.$$ This factors into $$(\\lambda +2)(\\lambda +7)=0,$$ which has roots $$\\lambda_1=-2$$ and $$\\lambda_2=-7.$$ Therefore, the general solution to this differential equation is\n\n$y(x)=c_1e^{-2x}+c_2e^{-7x}. \\nonumber$\n\n##### Case 2: Single Repeated Real Root\n\nThings are a little more complicated if the characteristic equation has a repeated real root, $$\\lambda$$. In this case, we know $$e^{\\lambda x}$$ is a solution to Equation \\ref{17.1}, but it is only one solution and we need two linearly independent solutions to determine the general solution. We might be tempted to try a function of the form $$ke^{\\lambda x},$$ where $$k$$ is some constant, but it would not be linearly independent of $$e^{\\lambda x}.$$ Therefore, let’s try $$xe^{\\lambda x}$$ as the second solution. First, note that by the quadratic formula,\n\n$\\lambda = \\frac{-b \\pm \\sqrt{b^2-4ac}}{2a}. \\nonumber$\n\nBut, $$\\lambda$$ is a repeated root, so the discriminate ($$b^2-4ac$$) is zero and $$\\lambda = \\frac{-b}{2a}$$. Thus, if $$y=xe^{\\lambda x}$$, we have\n\n\\begin{align*} y' =e^{\\lambda x}+ \\lambda xe^{\\lambda x} \\\\[4pt] y'' =2\\lambda e^{\\lambda x}+\\lambda^2xe^{\\lambda x}. \\end{align*}\n\nSubstituting both expressions into Equation \\ref{17.1}, we see that\n\n\\begin{align*} ay''+by′+cy &=a(2λe^{λx}+λ^2xe^{λx})+b(e^{λx}+λxe^{λx})+cxe^{λx} \\\\[4pt] &=xe^{λx}(aλ^2+bλ+c)+e^{λx}(2aλ+b) \\\\[4pt] &=xe^{λx}(0)+e^{λx}(2a(−b2a)+b)\\\\[4pt] &=0+e^{λx}(0) \\\\[4pt] &\\overset{\\checkmark}{=}0. \\end{align*}\n\nThis shows that $$xe^{\\lambda x}$$ is a solution to Equation \\ref{17.1}. Since $$e^{\\lambda x}$$ and $$xe^{\\lambda x}$$ are linearly independent, when the characteristic equation has a repeated root $$\\lambda$$, the general solution to Equation \\ref{17.1} is given by\n\n$y(x)=c_1e^{\\lambda x}+c_2xe^{\\lambda x}, \\nonumber$\n\nwhere $$c_1$$ and $$c_2$$ are constants.\n\nFor example, the differential equation $$y''+12y'+36y=0$$ has the associated characteristic equation\n\n$\\lambda^2+12 \\lambda +36=0.\\nonumber$\n\nThis factors into $$(\\lambda +6)^2=0,$$ which has a repeated root $$\\lambda =-6$$. Therefore, the general solution to this differential equation is\n\n$y(x)=c_1e^{-6x}+c_2xe^{-6x}.\\nonumber$\n\n##### Case 3: Complex Conjugate Roots\n\nThe third case we must consider is when $$b^2-4ac <0.$$ In this case, when we apply the quadratic formula, we are taking the square root of a negative number. We must use the imaginary number $$i= \\sqrt{-1}$$ to find the roots, which take the form $$\\lambda_1= \\alpha + \\beta i$$ and $$\\lambda _2=\\alpha -\\beta i.$$ The complex number $$\\alpha +\\beta i$$ is called the conjugate of $$\\alpha -\\beta i$$. Thus, we see that when the discriminate $$b^2-4ac$$ is negative, the roots of our characteristic equation are always complex conjugates.\n\nThis creates a little bit of a problem for us. If we follow the same process we used for distinct real roots—using the roots of the characteristic equation as the coefficients in the exponents of exponential functions—we get the functions $$e^{(\\alpha + \\beta i)x}$$ and $$e^{(\\alpha - \\beta i)x}$$ as our solutions. However, there are problems with this approach. First, these functions take on complex (imaginary) values, and a complete discussion of such functions is beyond the scope of this text. Second, even if we were comfortable with complex-value functions, in this course we do not address the idea of a derivative for such functions. So, if possible, we’d like to find two linearly independent real-value solutions to the differential equation. For purposes of this development, we are going to manipulate and differentiate the functions $$e^{(\\alpha + \\beta i)x}$$ and $$e^{(\\alpha - \\beta i)x}$$ as if they were real-value functions. For these particular functions, this approach is valid mathematically, but be aware that there are other instances when complex-value functions do not follow the same rules as real-value functions. Those of you interested in a more in-depth discussion of complex-value functions should consult a complex analysis text.\n\nBased on the roots $$\\alpha \\pm \\beta i$$ of the characteristic equation, the functions $$e^{(\\alpha + \\beta i)x}$$ and $$e^{(\\alpha - \\beta i)x}$$ are linearly independent solutions to the differential equation and the general solution is given by\n\n$y(x)=c_1e^{(\\alpha +\\beta i)x}+c_2e^{(\\alpha - \\beta i)x}. \\nonumber$\n\nUsing some smart choices for $$c_1$$ and $$c_2$$, and a little bit of algebraic manipulation, we can find two linearly independent, real-value solutions to Equation \\ref{17.1} and express our general solution in those terms.\n\nWe encountered exponential functions with complex exponents earlier. One of the key tools we used to express these exponential functions in terms of sines and cosines was Euler’s formula, which tells us that\n\n$\\underbrace{e^{i \\theta }= \\cos \\theta+ i \\sin \\theta}_{\\text{Euler’s formula}} \\label{Euler}$\n\nfor all real numbers $$\\theta$$.\n\nGoing back to the general solution, we have\n\n\\begin{align*} y(x) &=c_1e^{( \\alpha+ \\beta i)x}+c_2e^{(\\alpha - \\beta i)x} \\\\[4pt] &=c_1e^{\\alpha x}e^{\\beta ix}+c_2e^{\\alpha x}e^{- \\beta ix} \\\\[4pt] &=e^{\\alpha x}(c_1e^{\\beta ix}+c_2e^{-\\beta ix}).\\end{align*}\n\nApplying Euler’s formula (Equation \\ref{Euler}) together with the identities $$\\cos(-x)=\\cos x$$ and $$\\sin(-x)=- \\sin x,$$ we get\n\n\\begin{align} y(x) &=e^{\\alpha x}[c_1(\\cos \\beta x+i \\sin \\beta x)+c_2(\\cos(- \\beta x)+i \\sin(- \\beta x))] \\nonumber \\\\[4pt] &=e^{\\alpha x}[(c_1+c_2)\\cos \\beta x+(c_1-c_2)i \\sin \\beta x]. \\label{E1}\\end{align}\n\nNow, if we choose $$c_1=c_2= \\frac{1}{2},$$ the second term is zero and we get\n\n$y(x)=e^{\\alpha x} \\cos \\beta x \\nonumber$\n\nas a real-value solution to Equation \\ref{17.1}. Similarly, if we choose $$c_1=−\\frac{i}{2}$$ and $$c_2=\\frac{i}{2}$$, the first term of Equation \\ref{E1} is zero and we get\n\n$y(x)=e^{\\alpha x} \\sin \\beta x \\nonumber$\n\nas a second, linearly independent, real-value solution to Equation \\ref{17.1}.\n\nBased on this, we see that if the characteristic equation has complex conjugate roots $$\\alpha \\pm \\beta i,$$ then the general solution to Equation \\ref{17.1} is given by\n\n\\begin{align*} y(x) &=c_1e^{\\alpha x} \\cos \\beta x+c_2e^{\\alpha x} \\sin \\beta x \\\\[4pt] &=e^{\\alpha x}(c_1 \\cos \\beta x+c_2 \\sin \\beta x),\\end{align*}\n\nwhere $$c_1$$ and $$c_2$$ are constants.\n\nFor example, the differential equation $$y''-2y'+5y=0$$ has the associated characteristic equation $$\\lambda ^2-2 \\lambda +5=0.$$ By the quadratic formula, the roots of the characteristic equation are $$1\\pm 2i.$$ Therefore, the general solution to this differential equation is\n\n$y(x)=e^{x}(c_1 \\cos 2x+c_2 \\sin 2x).\\nonumber$\n\n### Summary of Results\n\nWe can solve second-order, linear, homogeneous differential equations with constant coefficients by finding the roots of the associated characteristic equation. The form of the general solution varies, depending on whether the characteristic equation has distinct, real roots; a single, repeated real root; or complex conjugate roots. The three cases are summarized in Table $$\\PageIndex{1}$$.\n\nTable $$\\PageIndex{1}$$: Summary of Characteristic Equation Cases\nCharacteristic Equation Roots General Solution to the Differential Equation\nDistinct real roots, $$\\lambda_1$$ and $$\\lambda_2$$ $$y(x)=c_1e^{\\lambda_1x}+c_2e^{\\lambda_2x}$$\nA repeated real root, $$\\lambda$$ $$y(x)=c_1e^{\\lambda x}+c_2xe^{\\lambda x}$$\nComplex conjugate roots $$\\alpha \\pm \\beta i$$ $$y(x)=e^{\\alpha x}(c_1 \\cos \\beta x+c_2 \\sin \\beta x)$$\n##### PROBLEM-SOLVING STRATEGY: USING THE CHARACTERISTIC EQUATION TO SOLVE SECOND-ORDER DIFFERENTIAL EQUATIONS WITH CONSTANT COEFFICIENTS\n1. Write the differential equation in the form $$a''+by'+cy=0.$$\n2. Find the corresponding characteristic equation $$a\\lambda^2+b\\lambda +c=0.$$\n3. Either factor the characteristic equation or use the quadratic formula to find the roots.\n4. Determine the form of the general solution based on whether the characteristic equation has distinct, real roots; a single, repeated real root; or complex conjugate roots.\n##### Example $$\\PageIndex{6}$$: Solving Second-Order Equations with Constant Coefficients\n\nFind the general solution to the following differential equations. Give your answers as functions of $$x$$.\n\n1. $$y''+3y'-4y=0$$\n2. $$y''+6y'+13y=0$$\n3. $$y''+2y'+y=0$$\n4. $$y''-5y'=0$$\n5. $$y''-16y=0$$\n6. $$y''+16y=0$$\n\nSolution\n\nNote that all these equations are already given in standard form (step 1).\n\n1. The characteristic equation is $$\\lambda^2+3\\lambda -4=0$$ (step 2). This factors into $$(\\lambda +4)(\\lambda -1)=0$$, so the roots of the characteristic equation are $$\\lambda_1=-4$$ and $$\\lambda_2=1$$ (step 3). Then the general solution to the differential equation is\n\n$y(x)=c_1e^{-4x}+c_2e^{x}. \\tag{step 1}$\n\n2. The characteristic equation is $$\\lambda^2+6\\lambda+13=0$$ (step 2). Applying the quadratic formula, we see this equation has complex conjugate roots $$-3\\pm 2i$$ (step 3). Then the general solution to the differential equation is\n\n$y(t)=e^{-3t}(c_1 \\cos 2t+c_2 \\sin 2t). \\tag{step 2}$\n\n3. The characteristic equation is $$\\lambda^2+2\\lambda+1=0$$ (step 2). This factors into $$(\\lambda+1)2=0,$$ so the characteristic equation has a repeated real root $$\\lambda =-1$$ (step 3). Then the general solution to the differential equation is\n\n$y(t)=c_1e^{-t}+c_2te^{-t}. \\tag{step 3}$\n\n4. The characteristic equation is $$\\lambda^2-5\\lambda$$ (step 2). This factors into $$\\lambda(\\lambda -5)=0,$$ so the roots of the characteristic equation are $$\\lambda_1=0$$ and $$\\lambda_2=5$$ (step 3). Note that $$e^{0x}=e^{0}=1$$, so our first solution is just a constant. Then the general solution to the differential equation is\n\n$y(x)=c_1+c_2e^{5x}. \\tag{step 4}$\n\n5. The characteristic equation is $$\\lambda^2-16=0$$ (step 2). This factors into $$(\\lambda+4)(\\lambda -4)=0,$$ so the roots of the characteristic equation are $$\\lambda_1=4$$ and $$\\lambda_2=-4$$ (step 3). Then the general solution to the differential equation is\n\n$y(x)=c_1e^{4x}+c_2e^{-4x}. \\tag{step 5}$\n\n6. The characteristic equation is $$\\lambda^2+16=0$$ (step 2). This has complex conjugate roots $$\\pm 4i$$ (step 3). Note that $$e^{0x}=e^0=1$$, so the exponential term in our solution is just a constant. Then the general solution to the differential equation is\n\n$y(t)=c_1 \\cos 4t+c_2 \\sin 4t. \\tag{step 6}$\n\n##### Exercise $$\\PageIndex{6}$$\n\nFind the general solution to the following differential equations:\n\n1. $$y''-2y'+10y=0$$\n2. $$y''+14y'+49y=0$$\nHint\n\nFind the roots of the characteristic equation.\n\n$$y(x)=e^x(c_1 \\cos 3x+c_2 \\sin 3x)$$\n\n$$y(x)=c_1e^{-7x}+c_2xe^{-7x}$$\n\n## Initial-Value Problems and Boundary-Value Problems\n\nSo far, we have been finding general solutions to differential equations. However, differential equations are often used to describe physical systems, and the person studying that physical system usually knows something about the state of that system at one or more points in time. For example, if a constant-coefficient differential equation is representing how far a motorcycle shock absorber is compressed, we might know that the rider is sitting still on his motorcycle at the start of a race, time $$t=t_0.$$ This means the system is at equilibrium, so $$y(t_0)=0,$$ and the compression of the shock absorber is not changing, so $$y'(t_0)=0.$$ With these two initial conditions and the general solution to the differential equation, we can find the specific solution to the differential equation that satisfies both initial conditions. This process is known as solving an initial-value problem. (Recall that we discussed initial-value problems in Introduction to Differential Equations.) Note that second-order equations have two arbitrary constants in the general solution, and therefore we require two initial conditions to find the solution to the initial-value problem.\n\nSometimes we know the condition of the system at two different times. For example, we might know $$y(t_0)=y_0$$ and $$y(t_1)=y_1.$$These conditions are called boundary conditions, and finding the solution to the differential equation that satisfies the boundary conditions is called solving a boundary-value problem.\n\nMathematicians, scientists, and engineers are interested in understanding the conditions under which an initial-value problem or a boundary-value problem has a unique solution. Although a complete treatment of this topic is beyond the scope of this text, it is useful to know that, within the context of constant-coefficient, second-order equations, initial-value problems are guaranteed to have a unique solution as long as two initial conditions are provided. Boundary-value problems, however, are not as well behaved. Even when two boundary conditions are known, we may encounter boundary-value problems with unique solutions, many solutions, or no solution at all.\n\n##### Example $$\\PageIndex{7}$$: Solving an Initial-Value Problem\n\nSolve the following initial-value problem: $$y''+3y'-4y=0, \\, y(0)=1,\\, y'(0)=-9.$$\n\nSolution\n\nWe already solved this differential equation in Example 17.6a. and found the general solution to be\n\n$y(x)=c_1e^{-4x}+c_2e^{x}. \\nonumber$\n\nThen\n\n$y'(x)=-4c_1e^{-4x}+c_2e^{x}. \\nonumber$\n\nWhen $$x=0,$$ we have $$y(0)=c_1+c_2$$ and $$y'(0)=-4c_1+c_2.$$ Applying the initial conditions, we have\n\n\\begin{align*} c_1+c_2 &=1 \\\\[4pt] -4c_1+c_2 &=-9.\\end{align*}\n\nThen $$c_1=1-c_2.$$ Substituting this expression into the second equation, we see that\n\n\\begin{align*} -4(1-c_2)+c_2 &= -9 \\\\[4pt] -4+4c_2+c_2 &=-9 \\\\[4pt] 5c_2 &=-5 \\\\[4pt] c_2 &=-1. \\end{align*}\n\nSo, $$c_1=2$$ and the solution to the initial-value problem is\n\n$y(x)=2e^{-4x}-e^{x}. \\nonumber$\n\n##### Exercise $$\\PageIndex{7}$$\n\nSolve the initial-value problem $$y''-3y'-10y=0, \\quad y(0)=0, \\; y'(0)=7.$$\n\nHint\n\nUse the initial conditions to determine values for $$c_1$$ and $$c_2$$.\n\n$y(x)=-e^{-2x}+e^{5x} \\nonumber$\n\n##### Example $$\\PageIndex{8}$$: Solving an Initial-Value Problem and Graphing the Solution\n\nSolve the following initial-value problem and graph the solution:\n\n$y''+6y'+13y=0, \\quad y(0)=0, \\; y'(0)=2\\nonumber$\n\nSolution\n\nWe already solved this differential equation in Example $$\\PageIndex{6b}$$. and found the general solution to be\n\n$y(x)=e^{-3x}(c_1 \\cos 2x+c_2 \\sin 2x).\\nonumber$\n\nThen\n\n$y'(x)=e^{-3x}(-2c_1 \\sin 2x+2c_2 \\cos 2x)-3e^{-3x}(c_1 \\cos 2x+c_2 \\sin 2x). \\nonumber$\n\nWhen $$x=0,$$ we have $$y(0)=c_1$$ and $$y'(0)=2c_2-3c_1$$. Applying the initial conditions, we obtain\n\n\\begin{align*} c_1 &=0 \\\\[4pt] -3c_1+2c_2 &=2. \\end{align*}\n\nTherefore, $$c_1=0, \\, c_2=1,$$ and the solution to the initial value problem is shown in the following graph.\n\n$y=e^{-3x} \\sin 2x.\\nonumber$", null, "##### Exercise $$\\PageIndex{8}$$\n\nSolve the following initial-value problem and graph the solution: $$y''-2y'+10y=0, \\quad y(0)=2, \\; y'(0)=-1$$\n\nHint\n\nUse the initial conditions to determine values for $$c_1$$ and $$c_2.$$\n\n$y(x)=e^{x}(2 \\cos 3x - \\sin 3x) \\nonumber$\n\n##### Example $$\\PageIndex{9}$$: Initial-Value Problem Representing a Spring-Mass System\n\nThe following initial-value problem models the position of an object with mass attached to a spring. Spring-mass systems are examined in detail in Applications. The solution to the differential equation gives the position of the mass with respect to a neutral (equilibrium) position (in meters) at any given time. (Note that for spring-mass systems of this type, it is customary to define the downward direction as positive.)\n\n$y''+2y'+y=0, \\quad y(0)=1, \\; y'(0)=0 \\nonumber$\n\nSolve the initial-value problem and graph the solution. What is the position of the mass at time $$t=2$$ sec? How fast is the mass moving at time $$t=1$$ sec? In what direction?\n\nSolution\n\nIn Example Example $$\\PageIndex{6c}$$. we found the general solution to this differential equation to be\n\n$y(t)=c_1e^{-t}+c_2te^{-t}. \\nonumber$\n\nThen\n\n$y'(t)=-c_1e^{-t}+c_2(-te^{-t}+e^{-t}). \\nonumber$\n\nWhen $$t=0,$$ we have $$y(0)=c_1$$ and $$y'(0)=c_1+c_2.$$ Applying the initial conditions, we obtain\n\n$c_1=1 \\\\ -c_1+c_2=0. \\nonumber$\n\nThus, $$c_1=1, c_2=1,$$ and the solution to the initial value problem is\n\n$y(t)=e^{-t}+te^{-t}. \\nonumber$\n\nThis solution is represented in the following graph. At time $$t=2,$$ the mass is at position $$y(2)=e^{-2}+2e^{-2}=3e^{-2} \\approx 0.406$$ m below equilibrium.", null, "To calculate the velocity at time $$t=1,$$ we need to find the derivative. We have $$y(t)=e^{-t}+te^{-t},$$ so\n\n$y'(t)=-e^{-t}+e^{-t}-te^{-t}= -te^{-t}. \\nonumber$\n\nThen $$y'(1)=-e^{-1} \\approx -0.3679$$. At time $$t=1,$$ the mass is moving upward at $$0.3679$$ m/sec.\n\n##### Exercise $$\\PageIndex{9}$$\n\nSuppose the following initial-value problem models the position (in feet) of a mass in a spring-mass system at any given time. Solve the initial-value problem and graph the solution. What is the position of the mass at time $$t=0.3$$ sec? How fast is it moving at time $$t=0.1$$ sec? In what direction?\n\n$y''+14y'+49y=0, \\quad y(0)=0, \\; y'(0)=1 \\nonumber$\n\nHint\n\nUse the initial conditions to determine values for $$c_1$$ and $$c_2$$.\n\n$y(t)=te^{-7t}\\nonumber$", null, "At time $$t=0.3, \\; y(0.3)=0.3e^{(-7^{\\ast} 0.3)}=0.3e^{-2.1} \\approx 0.0367.$$ The mass is $$0.0367$$ft below equilibrium. At time $$t=0.1, \\; y'(0.1)=0.3e^{-0.7} \\approx 0.1490.$$ The mass is moving downward at a speed of $$0.1490$$ ft/sec.\n\n##### Example $$\\PageIndex{10}$$: Solving a Boundary-Value Problem\n\nIn Example 17.6f. we solved the differential equation $$y''+16y=0$$ and found the general solution to be $$y(t)=c_1 \\cos 4t+c_2 \\sin 4t.$$ If possible, solve the boundary-value problem if the boundary conditions are the following:\n\n1. $$y(0)=0, y( \\frac{\\pi}{4})=0$$\n2. $$y(0)=1,y(0)=1, y(\\frac{\\pi}{8})=0$$\n3. $$y(\\frac{\\pi}{8})=0, y(\\frac{3 \\pi}{8})=2$$\n\nSolution\n\nWe have\n\n$y(x)=c_1 \\cos 4t+c_2 \\sin 4t. \\nonumber$\n\n1. Applying the first boundary condition given here, we get $$y(0)=c_1=0.$$ So the solution is of the form $$y(t)=c_2 \\sin 4t.$$ When we apply the second boundary condition, though, we get $$y(\\frac{\\pi}{4})=c_2 \\sin(4(\\frac{\\pi}{4}))=c_2 \\sin \\pi =0$$ for all values of $$c_2$$. The boundary conditions are not sufficient to determine a value for $$c_2,$$ so this boundary-value problem has infinitely many solutions. Thus, $$y(t)=c_2 \\sin 4t$$ is a solution for any value of $$c_2$$.\n2. Applying the first boundary condition given here, we get $$y(0)=c_1=1.$$ Applying the second boundary condition gives $$y(\\frac{\\pi}{8})=c_2=0,$$ so $$c_2=0.$$ In this case, we have a unique solution: $$y(t)= \\cos 4t$$.\n3. Applying the first boundary condition given here, we get $$y(\\frac{\\pi}{8})=c_2=0.$$ However, applying the second boundary condition gives $$y(\\frac{3 \\pi}{8})=-c_2=2,$$ so $$c_2=-2.$$ We cannot have $$c_2=0=-2,$$ so this boundary value problem has no solution.\n\n## Key Concepts\n\n• Second-order differential equations can be classified as linear or nonlinear, homogeneous or nonhomogeneous.\n• To find a general solution for a homogeneous second-order differential equation, we must find two linearly independent solutions. If $$y_1(x)$$ and $$y_2(x)$$ are linearly independent solutions to a second-order, linear, homogeneous differential equation, then the general solution is given by\n\n$y(x)=c_1y_1(x)+c_2y_2(x).\\nonumber$\n\n• To solve homogeneous second-order differential equations with constant coefficients, find the roots of the characteristic equation. The form of the general solution varies depending on whether the characteristic equation has distinct, real roots; a single, repeated real root; or complex conjugate roots.\n• Initial conditions or boundary conditions can then be used to find the specific solution to a differential equation that satisfies those conditions, except when there is no solution or infinitely many solutions.\n\n## Key Equations\n\n• Linear second-order differential equation $a_2(x)y''+a_1(x)y'+a_0(x)y=r(x) \\nonumber$\n• Second-order equation with constant coefficients $ay''+by'+cy=0 \\nonumber$\n\n## Glossary\n\nboundary conditions\nthe conditions that give the state of a system at different times, such as the position of a spring-mass system at two different times\nboundary-value problem\na differential equation with associated boundary conditions\ncharacteristic equation\nthe equation $$aλ^2+bλ+c=0$$ for the differential equation $$ay″+by′+cy=0$$\nhomogeneous linear equation\na second-order differential equation that can be written in the form $$a_2(x)y″+a_1(x)y′+a_0(x)y=r(x)$$, but $$r(x)=0$$ for every value of $$x$$\nnonhomogeneous linear equation\na second-order differential equation that can be written in the form $$a_2(x)y″+a_1(x)y′+a_0(x)y=r(x)$$, but $$r(x)≠0$$ for some value of $$x$$\nlinearly dependent\na set of functions $$f_1(x),\\,f_2(x),\\,…,\\,f_n(x)$$ for whichthere are constants $$c_1,\\,c_2,\\,…,\\,c_n$$, not all zero, such that $$c_1f_1(x)+c_2f_2(x)+⋯+c_nf_n(x)=0$$ for all $$x$$ in the interval of interest\nlinearly independent\na set of functions $$f_1(x),\\,f_2(x),\\,…,\\,f_n(x)$$ for which there are no constants $$c_1,\\,c_2,\\,…,\\,c_n$$, such that $$c_1f_1(x)+c_2f_2(x)+⋯+c_nf_n(x)=0$$ for all $$x$$ in the interval of interest\n\n17.1: Second-Order Linear Equations is shared under a not declared license and was authored, remixed, and/or curated by LibreTexts." ]
[ null, "https://math.libretexts.org/@api/deki/files/7886/imageedit_2_7175091963.png", null, "https://math.libretexts.org/@api/deki/files/7885/imageedit_6_6167430810.png", null, "https://math.libretexts.org/@api/deki/files/7887/imageedit_11_6555472619.png", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.8145702,"math_prob":0.99999857,"size":37893,"snap":"2023-14-2023-23","text_gpt3_token_len":11586,"char_repetition_ratio":0.19937184,"word_repetition_ratio":0.15922731,"special_character_ratio":0.32610244,"punctuation_ratio":0.09860544,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":1.0000074,"pos_list":[0,1,2,3,4,5,6],"im_url_duplicate_count":[null,7,null,7,null,7,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-06-05T10:20:39Z\",\"WARC-Record-ID\":\"<urn:uuid:f23c0f8e-bf40-489a-a476-d9e8d2da3668>\",\"Content-Length\":\"186821\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:f8f1a7d5-40d8-4402-9533-d0e953715947>\",\"WARC-Concurrent-To\":\"<urn:uuid:d4d7383b-7432-42cc-bb6f-2cb828ef7732>\",\"WARC-IP-Address\":\"13.249.39.44\",\"WARC-Target-URI\":\"https://math.libretexts.org/Bookshelves/Calculus/Map%3A_Calculus__Early_Transcendentals_(Stewart)/17%3A_SecondOrder_Differential_Equations/17.01%3A_Second-Order_Linear_Equations\",\"WARC-Payload-Digest\":\"sha1:QXEQJPQG44TXF6E2QHFXZTDLFBETFRWT\",\"WARC-Block-Digest\":\"sha1:6RCBSWZRHCK6UZAYAVXVMJH6D5W2VWXZ\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-23/CC-MAIN-2023-23_segments_1685224651815.80_warc_CC-MAIN-20230605085657-20230605115657-00057.warc.gz\"}"}
https://drtecho.com/pre-algebra-basics/
[ "# Pre algebra basics ideas in 2021\n\nWritten by Wayne Jun 12, 2021 · 7 min read", null, "Your Pre algebra basics images are available. Pre algebra basics are a topic that is being searched for and liked by netizens now. You can Get the Pre algebra basics files here. Get all free images.\n\nIf you’re looking for pre algebra basics images information related to the pre algebra basics interest, you have come to the ideal site. Our site frequently provides you with hints for seeing the highest quality video and picture content, please kindly hunt and find more informative video articles and graphics that fit your interests.\n\nPre Algebra Basics. Equations expressions and inequalities One-step equation word problems. Units of time Perfect numbers. Learn how arithmetic was done in the past. Find the lesser fraction.", null, "Introduction To Algebra Equations Pre Algebra Basics For Kids 7th Grade Math Algebra Equations Pre Algebra From pinterest.com\n\nDictionary of the English Language 4th Edition. Coolmath Pre-Algebra has a ton of. Greater than and less than basics. Full curriculum of exercises and videos. Sometimes algebraic expressions can be. PreAlgebra For Dummies.\n\n### Ad Master 450 algebra skills with online practice.\n\nInteresting and challenging pre-algebra topics. Review of natural number arithmetic. Here is a perfect and comprehensive collection of FREE Pre-Algebra worksheets that would help you or your students in Pre-Algebra preparation and practice. Equations expressions and inequalities One-step equations intuition. Units of time Perfect numbers. 21022014 Conquer your math anxiety forever with the easytofollow instructions and practical exercises of Basic Math.", null, "Source: pinterest.com\n\nWe also present an introduction to geometry and right triangles. Set notation Ancient numeration system. Learn the basics of algebra for freefocused on common mathematical relationships such as linear relationships. Full curriculum of exercises and videos. Hello Everyone In this series of lectures We teach from fundamental concepts to advance level concepts.", null, "Source: in.pinterest.com\n\nReview of natural number arithmetic. So please do subscribe our channel and share and lik. Find the lesser fraction. Here is a perfect and comprehensive collection of FREE Pre-Algebra worksheets that would help you or your students in Pre-Algebra preparation and practice. Pre-Algebra Printable Pre-Algebra Worksheets Practice makes perfect prepare a stronger base for algebra with this assemblage of pre-algebra worksheets.", null, "Source: pinterest.com\n\nCross-multiplication is a handy tool for finding the common denominator for two fractions which is important for many operations involving fractions. Here is a perfect and comprehensive collection of FREE Pre-Algebra worksheets that would help you or your students in Pre-Algebra preparation and practice. Set notation Ancient numeration system. Learn the basics of algebra for freefocused on common mathematical relationships such as linear relationships. 21 Basic Properties of Algebra eg Distributive 22 Linear Patterns Recognition Converting to an Equation 23 Operating with Real Numbers Absolute Value x Chapter 4.", null, "Source: pinterest.com\n\nAd Master 450 algebra skills with online practice. Interesting and challenging pre-algebra topics. Math problem solving strategies Common mistakes in math. Cockney is a dialect of English. These letters are unknowns and can represent either a single unknown number or a range of unknown numbers.", null, "Source: in.pinterest.com\n\nDownload our free Mathematics worksheets for the Pre-Algebra test. In Pre Algebra you will for example study. Coolmath Pre-Algebra has a ton of. We also present an introduction to geometry and right triangles. Getting a Handle on Whole Numbers 4 Part III.", null, "Source: pinterest.com\n\nFull curriculum of exercises and videos. Equations expressions and inequalities Inequalities. Set notation Ancient numeration system. Units of time Perfect numbers. Cross-multiplication is a handy tool for finding the common denominator for two fractions which is important for many operations involving fractions.", null, "Source: pinterest.com\n\n21022014 Conquer your math anxiety forever with the easytofollow instructions and practical exercises of Basic Math. 21 Basic Properties of Algebra eg Distributive 22 Linear Patterns Recognition Converting to an Equation 23 Operating with Real Numbers Absolute Value x Chapter 4. Learn the basics of algebra for freefocused on common mathematical relationships such as linear relationships. Fractions and Decimals 24 Adding and Subtracting Fractions 25 Multiplying and Dividing Fractions 26 Mixed Numbers and Improper Fractions. Need great Pre-Algebra worksheets to help your students learn basic math concepts.", null, "Source: pinterest.com\n\nFrom The American Heritage. Math problem solving strategies Common mistakes in math. Coolmath Pre-Algebra has a ton of. Algebra involves the use of letters in mathematics. Ad Master 450 algebra skills with online practice.", null, "Source: pinterest.com\n\nUnits of time Perfect numbers. Need great Pre-Algebra worksheets to help your students learn basic math concepts. 21022014 Conquer your math anxiety forever with the easytofollow instructions and practical exercises of Basic Math. If so then look no further. Learn how arithmetic was done in the past.", null, "Source: pinterest.com\n\nHere is a perfect and comprehensive collection of FREE Pre-Algebra worksheets that would help you or your students in Pre-Algebra preparation and practice. Equations expressions and inequalities One-step equations intuition. Learn the basics of algebra for freefocused on common mathematical relationships such as linear relationships. Find the lesser fraction. Parts of the Whole.", null, "Source: pinterest.com\n\nAd Master 450 algebra skills with online practice. From The American Heritage. Download our free Mathematics worksheets for the Pre-Algebra test. Cross-multiplication is a handy tool for finding the common denominator for two fractions which is important for many operations involving fractions. Parts of the Whole.", null, "Source: pinterest.com\n\nCockney is a dialect of English. Algebra involves the use of letters in mathematics. In the following practice questions you are asked to cross-multiply to compare fractions to find out which is greater or less. Arming Yourself with the Basics of Basic Math 3 Part II. Interesting and challenging pre-algebra topics.", null, "Source: pinterest.com\n\nCross-multiplication is a handy tool for finding the common denominator for two fractions which is important for many operations involving fractions. Algebra involves the use of letters in mathematics. Featuring exercises on topics like fractions decimals integers measurement squaring numbers order of operations estimation factors GCF LCM ratio percent exponents radicals scientific notations logarithms absolute. Pre Algebra is the first math course in high school and will guide you through among other things integers one-step equations inequalities and equations graphs and functions percent probabilities. If so then look no further.", null, "Source: za.pinterest.com\n\nFeaturing exercises on topics like fractions decimals integers measurement squaring numbers order of operations estimation factors GCF LCM ratio percent exponents radicals scientific notations logarithms absolute. Equations expressions and inequalities One-step equations intuition. Set notation Ancient numeration system. PreAlgebra For Dummies. Equations expressions and inequalities One-step equation word problems.", null, "Source: pinterest.com\n\nReview of natural number arithmetic. Here is a perfect and comprehensive collection of FREE Pre-Algebra worksheets that would help you or your students in Pre-Algebra preparation and practice. Algebra involves the use of letters in mathematics. Fractions and Decimals 24 Adding and Subtracting Fractions 25 Multiplying and Dividing Fractions 26 Mixed Numbers and Improper Fractions. Sometimes algebraic expressions can be.", null, "Source: pinterest.com\n\nSo please do subscribe our channel and share and lik. In the following practice questions you are asked to cross-multiply to compare fractions to find out which is greater or less. Math problem solving strategies Common mistakes in math. Need great Pre-Algebra worksheets to help your students learn basic math concepts. Parts of the Whole.", null, "Source: pinterest.com\n\nFull curriculum of exercises and videos. Dictionary of the English Language 4th Edition. Units of time Perfect numbers. Interesting and challenging pre-algebra topics. Equations expressions and inequalities Inequalities.", null, "Source: pinterest.com\n\nEquations expressions and inequalities One-step equation word problems. Equations expressions and inequalities One-step equation word problems. Download our free Mathematics worksheets for the Pre-Algebra test. If so then look no further. These letters are unknowns and can represent either a single unknown number or a range of unknown numbers.\n\nThis site is an open community for users to do sharing their favorite wallpapers on the internet, all images or pictures in this website are for personal wallpaper use only, it is stricly prohibited to use this wallpaper for commercial purposes, if you are the author and find this image is shared without your permission, please kindly raise a DMCA report to Us.\n\nIf you find this site helpful, please support us by sharing this posts to your favorite social media accounts like Facebook, Instagram and so on or you can also save this blog page with the title pre algebra basics by using Ctrl + D for devices a laptop with a Windows operating system or Command + D for laptops with an Apple operating system. If you use a smartphone, you can also use the drawer menu of the browser you are using. Whether it’s a Windows, Mac, iOS or Android operating system, you will still be able to bookmark this website.\n\n##### Read next", null, "## Typical geometry worksheet Wonderful\n\nFeb 20 . 8 min read", null, "## Reading worksheets science Latest\n\nJun 04 . 7 min read", null, "## Calendar creator 2017 Most Effective\n\nFeb 12 . 7 min read", null, "## Remarkable common core 4th grade math worksheets information\n\nApr 28 . 7 min read", null, "## Average pre kindergarten worksheets ideas\n\nJan 28 . 8 min read", null, "## Printable math multiplication worksheets Awesome\n\nApr 08 . 9 min read" ]
[ null, "https://i.pinimg.com/474x/ee/fd/2b/eefd2bcb6cd8746cdfc3ba68f2bc0fd8--algebra-problems-free-math-worksheets.jpg", null, "https://drtecho.com/img/placeholder.svg", null, "https://drtecho.com/img/placeholder.svg", null, "https://drtecho.com/img/placeholder.svg", null, "https://drtecho.com/img/placeholder.svg", null, "https://drtecho.com/img/placeholder.svg", null, "https://drtecho.com/img/placeholder.svg", null, "https://drtecho.com/img/placeholder.svg", null, "https://drtecho.com/img/placeholder.svg", null, "https://drtecho.com/img/placeholder.svg", null, "https://drtecho.com/img/placeholder.svg", null, "https://drtecho.com/img/placeholder.svg", null, "https://drtecho.com/img/placeholder.svg", null, "https://drtecho.com/img/placeholder.svg", null, "https://drtecho.com/img/placeholder.svg", null, "https://drtecho.com/img/placeholder.svg", null, "https://drtecho.com/img/placeholder.svg", null, "https://drtecho.com/img/placeholder.svg", null, "https://drtecho.com/img/placeholder.svg", null, "https://drtecho.com/img/placeholder.svg", null, "https://drtecho.com/img/placeholder.svg", null, "https://drtecho.com/img/placeholder.svg", null, "https://drtecho.com/img/placeholder.svg", null, "https://drtecho.com/img/placeholder.svg", null, "https://drtecho.com/img/placeholder.svg", null, "https://drtecho.com/img/placeholder.svg", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.88545567,"math_prob":0.8413825,"size":9714,"snap":"2021-21-2021-25","text_gpt3_token_len":1812,"char_repetition_ratio":0.14891864,"word_repetition_ratio":0.46746817,"special_character_ratio":0.17479926,"punctuation_ratio":0.1030303,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9921276,"pos_list":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52],"im_url_duplicate_count":[null,1,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-06-25T13:32:03Z\",\"WARC-Record-ID\":\"<urn:uuid:fb6954fe-6a20-4d48-8182-59601e83241e>\",\"Content-Length\":\"35419\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:fa18b40a-3cf5-49b4-9b8a-3c31ee2fea8b>\",\"WARC-Concurrent-To\":\"<urn:uuid:90c7b603-ed29-4465-a641-17d981ddb837>\",\"WARC-IP-Address\":\"172.67.179.140\",\"WARC-Target-URI\":\"https://drtecho.com/pre-algebra-basics/\",\"WARC-Payload-Digest\":\"sha1:6H6OFDXR7R3DRIDIXOFTAC5KTWAT3NUY\",\"WARC-Block-Digest\":\"sha1:XZ3THSHAQTI4LHSQ2G5Z6V2LRWVDJJ2L\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-25/CC-MAIN-2021-25_segments_1623487630175.17_warc_CC-MAIN-20210625115905-20210625145905-00122.warc.gz\"}"}
https://github.com/NICTA/rng
[ "# NICTA/rng\n\nPure-functional random value generation\nScala Shell", null, "Fetching latest commit…\nCannot retrieve the latest commit at this time.\nType Name Latest commit message Commit time\nFailed to load latest commit information.", null, "examples/src/main/scala/com/nicta/rng", null, "notes", null, "project", null, "src", null, ".gitignore", null, ".travis.yml", null, "CONTRIBUTORS", null, "LICENCE", null, "README.md", null, "sbt", null, "version.sbt\n\n# RNG Random Generation Library\n\nThis library provides the ability for a user to generate random values of arbitrary type. It provides a pure-functional interface to preserve equational reasoning. Existing combinator libraries are provided for built-in data types. For example:\n\n• Generating random product types (tuples) given generators for its components.\n• Generating random sum types given generators for its constructors\n• `scala.Either`\n• `scalaz.\\/`\n• `scalaz.Validation`\n\nExample usages are provided in the `/examples` source directory.\n\n`libraryDependencies += \"com.nicta\" %% \"rng\" % \"1.3.0\"`\n\n(changing the version number if necessary).\n\n### `Rng` data type\n\nA generator is represented by the `Rng` data type. A value of the type `Rng[T]` will produce random values of the type `T`. For example, to generate random pairs `(X, Y)` and given a `Rng[X]` (call it `randomX`) and a `Rng[Y]` (call it `randomY`), use the `zip` function:\n\n```val randomPair: Rng[(X, Y)] =\nrandomX zip randomY```\n\nTo generate random sum type `(X \\/ Y)` and given a `Rng[X]` (call it `randomX`) and a `Rng[Y]` (call it `randomY`), use the `either` function:\n\n```val randomEither: Rng[(X \\/ Y)] =\nrandomX either randomY```\n\n#### `Rng` structure\n\nThe `Rng` data type uses a specific technique for ensuring a pure-functional programming interface. It utilises the free monad by defining a grammar for manipulation by the free monad.\n\nThe grammar is defined by the `RngOp` data type, which defines two primitive operations:\n\n• `nextbits` which is expected to produce a random integer\n• `setseed` which manipulates the seed for random generation\n\nAll other random generation operations are defined in terms of these two primitive operations.\n\nThe library user manipulates random generation by essentially building up a program that is composed of combinations of these operations. Although it is important to understand this programming model, the library user is effectively insulated by higher-level libraries. Users can expect the types provided by the library to dictate purpose. This robustness is a consequence of the pure-functional programming interface. Side-effects are guaranteed to never occur.\n\nThe `run` method on `Rng` executes the grammar and returns an `IO` action to manipulate the value arbitrary. The provided examples demonstrate how to achieve this.\n\n#### `RngOp`\n\nTh `RngOp` data type underlies the random generator by providing a grammar with two instructions (`nextbits` and `setseed`). Programming the `RngOp` data type directly is atypical and users might consider the higher-level library provided on the `Rng` data type instead. The `RngOp` type constructor forms a `comonad` and so has operations for manipulating the operation:\n\n• The `map` method on `RngOp[A]` accepts a function (`A => B`) and returns a `RngOp[B]`\n• The `coflatMap` method on `RngOp[A]` accepts a function (`RngOp[A] => B`) and returns a `RngOp[B]`\n\n`RngOp` values can then be lifted to a generator (`Rng`) using the `lift` method.\n\n#### `Rng` combinator library\n\nMany random generators are provided, such as:\n\n• The `option` method produces a generator for `Rng[Option[T]]` when the method is called on a value of the type `Rng[T]`.\n• The `list` method produces a generator for `Rng[List[T]]` when the method is called on a value of the type `Rng[T]`.\n• The `list1` method produces a generator for `Rng[NonEmptyList[T]]` when the method is called on a value of the type `Rng[T]`.\n• Generators for primitive types provided as functions on the `Rng` object:\n• `int` to generate random integer values\n• `byte` to generate random byte values\n• `short` to generate random short values\n• `long` to generate random long values\n• `double` to generate random double values\n• `float` to generate random float values\n• `boolean` to generate random boolean values\n• `short` to generate random short values\n• `char` to generate random character values\n• `chars` to generate random lists of character values\n• `chars1` to generate random non-empty lists of character values\n• Upper-case characters\n• `upper` to generate random upper-case (A-Z) character values\n• `uppers` to generate random lists of upper-case (A-Z) character values\n• `uppers1` to generate random non-empty lists of upper-case (A-Z) character values\n• `upperstring` to generate random strings of upper-case (A-Z) character values\n• `upperstring1` to generate random non-empty strings of upper-case (A-Z) character values\n• Lower-case characters\n• `lower` to generate random lower-case (a-z) character values\n• `lowers` to generate random lists of lower-case (a-z) character values\n• `lowers1` to generate random non-empty lists of lower-case (a-z) character values\n• `lowerstring` to generate random strings of lower-case (a-z) character values\n• `lowerstring1` to generate random non-empty strings of lower-case (a-z) character values\n• Alpha characters\n• `alpha` to generate random alpha (a-z and A-Z) character values\n• `alphas` to generate random lists of alpha (a-z and A-Z)character values\n• `alphas1` to generate random non-empty lists of (a-z and A-Z) alpha character values\n• `alphastring` to generate random strings of alpha (a-z and A-Z) character values\n• `alphastring1` to generate random non-empty strings of alpha (a-z and A-Z) character values\n• Numeric characters\n• `numeric` to generate random numeric (0-9) character values\n• `numerics` to generate random lists of numeric (0-9) character values\n• `numerics1` to generate random non-empty lists of numeric (0-9) character values\n• `numericstring` to generate random strings of numeric (0-9) character values\n• `numericstring1` to generate random non-empty strings of numeric (0-9) character values\n• Alpha-numeric characters\n• `alphanumeric` to generate random alpha-numeric (a-z, A-Z and 0-9) character values\n• `alphanumerics` to generate random lists of alpha-numeric (a-z, A-Z and 0-9) character values\n• `alphanumerics1` to generate random non-empty lists of alpha-numeric (a-z, A-Z and 0-9) character values\n• `alphanumericstring` to generate random strings of alpha-numeric (a-z, A-Z and 0-9) character values\n• `alphanumericstring1` to generate random non-empty strings of alpha-numeric (a-z, A-Z and 0-9) character values\n• Identifiers (an identifier is defined by a string of characters starting with an alpha character, followed by zero or more alpha-numeric characters)\n• `identifier` for generating random non-empty lists of characters representing an identifier\n• `identifierstring` for generating random non-empty strings representing an identifier\n• Proper noun (a proper noun is defined by a string of characters starting with an upper-case character, followed by zero or more lower-case characters)\n• `propernoun` for generating random non-empty lists of characters representing a proper noun\n• `propernounstring` for generating random non-empty strings representing a proper noun\n• Integer ranges\n• `negative(double/float/long/int)` to generate random negative doubles/floats/longs/integers\n• `positive(double/float/long/int)` to generate random positive doubles/floats/longs/integers\n• `chooseint` to generate random integers in a given range\n• `chooselong` to generate random longs in a given range\n• `choosefloat` to generate random floats in a given range\n• `choosedouble` to generate random doubles in a given range\n• Generators for values of the `scalaz.Digit` data type provided as functions on the `Rng` object:\n• `digit` to generate random digit values\n• `digits` to generate random lists of digit values\n• `digits1` to generate random non-empty lists of digit values\n• Generators for manipulating lists of values\n• `oneof` accepts a non-empty (variable argument) list of values and returns a generator that produces one of those values\n• `oneofL` does the same as `oneof`, however, it is accepts an argument of `scalaz.NonEmptyList` instead of a non-empty argument list.\n• `frequency` accepts a non-empty (variable argument) list of pairs of values. The pair is an integer and a random generator where the integer represents the skewed frequency of the associated random generator. The `frequencyL` function returns a generator that will select from the given list of generators with a skewed distribution.\n• `frequencyL` does the same as `frequency`, however, it is accepts an argument of `scalaz.NonEmptyList` instead of a non-empty argument list.\n• Distributing and traversing generators\n• `sequence` for taking a traversable of generators to a generator of traversables. A Traversable value is represented as a generalised interface (`scalaz.Traverse`).\n• `distribute` for taking a generator of distributive values to a distribution of generators. A distributive value is represented as a generalised interface (`scalaz.Distributive`).\n\n#### `Rng` monad\n\nThe `Rng` type constructor forms a monad making it trivial to combine existing random generators for user-defined data types. For example, consider a data type combined of products and sums:\n\n`case class Person(name: String, age: Option[Int])`\n\nA random generator can be constructed by combining random generators for `String`, `Int` and `Option` using a for-comprehension:\n\n```val randomPerson: Rng[Person] =\nfor {\nn <- Rng.string\na <- Rng.int.option\n} yield Person(n, a)```\n\n### Documentation\n\nDocumentation for this library is provided by this document, example usages and static-type verification. The statically verified constraints provided by this library are a consequence of the pure-functional programming interface.\n\nYou can’t perform that action at this time." ]
[ null, "https://github.githubassets.com/images/spinners/octocat-spinner-32-EAF2F5.gif", null, "https://github.githubassets.com/images/spinners/octocat-spinner-32.gif", null, "https://github.githubassets.com/images/spinners/octocat-spinner-32.gif", null, "https://github.githubassets.com/images/spinners/octocat-spinner-32.gif", null, "https://github.githubassets.com/images/spinners/octocat-spinner-32.gif", null, "https://github.githubassets.com/images/spinners/octocat-spinner-32.gif", null, "https://github.githubassets.com/images/spinners/octocat-spinner-32.gif", null, "https://github.githubassets.com/images/spinners/octocat-spinner-32.gif", null, "https://github.githubassets.com/images/spinners/octocat-spinner-32.gif", null, "https://github.githubassets.com/images/spinners/octocat-spinner-32.gif", null, "https://github.githubassets.com/images/spinners/octocat-spinner-32.gif", null, "https://github.githubassets.com/images/spinners/octocat-spinner-32.gif", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.6045035,"math_prob":0.8715693,"size":9078,"snap":"2019-43-2019-47","text_gpt3_token_len":2063,"char_repetition_ratio":0.23771214,"word_repetition_ratio":0.15668203,"special_character_ratio":0.19057061,"punctuation_ratio":0.060747664,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9794914,"pos_list":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24],"im_url_duplicate_count":[null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-11-21T09:51:24Z\",\"WARC-Record-ID\":\"<urn:uuid:9dab74d0-1a58-4b1e-b121-2b66be62392b>\",\"Content-Length\":\"102152\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:782165ab-2de8-4b47-a292-d966a610765d>\",\"WARC-Concurrent-To\":\"<urn:uuid:f4bd9c7f-6084-46d1-80fc-19174c52b4c8>\",\"WARC-IP-Address\":\"140.82.113.4\",\"WARC-Target-URI\":\"https://github.com/NICTA/rng\",\"WARC-Payload-Digest\":\"sha1:CCDXPSSYY3OSNJCHIWRIID62LFII2QUH\",\"WARC-Block-Digest\":\"sha1:UEXWAERKYY63XP5CL3NDGY33CLSYRZ5T\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-47/CC-MAIN-2019-47_segments_1573496670743.44_warc_CC-MAIN-20191121074016-20191121102016-00008.warc.gz\"}"}
https://education.blurtit.com/156762/how-many-digits-are-there-in-a-million
[ "# How Many Digits Are There In A Million?\n\n1,000,000 There are 7 digits in One Million. There is a 1, and 6 zero's.\nthanked the writer.\n1,000,000 (million) = 7 digits / 6 zeroes\n10,000,000 (ten millions) = 8 digits / 7 zeroes\n1,000,000,000 (billion) = 10 digits / 9 zeroes\nthanked the writer.\nOne million has seven digits, six zeros/naughts.\n1,000,000 (easier to see with commas)\nthanked the writer.\n7\nmy answer this is correct?\nthanked the writer.\nHi :) there are six naughts. 1,000,000 ( easier to see with commas :) )\nX\nthanked the writer.\n1,000,000 =7 digits\n10,000,000=8 digits\n1,000,000,000=10 digits\nthanked the writer.\nSeven digits with six zeros\nthanked the writer.\n4 and up as long as there are 6 0's\nthanked the writer.\nSix\nthanked the writer.\n100,000,000\nthanked the writer.\n1,000,000=7 digits - 6 0's\n10,000,000=8 digits - 7 0's\n1,000,000,000=8 digits - 9 0's\nthanked the writer.\nAnna Shetty , Anna, answered\n\nInteresting and you have very nice way of expressing the article.The author clearly describe all the parts of the article with good language and information.Looking forward to another article. run 3 cool math\n\nthanked the writer.\n0.9 million\nwhat is notation\nthanked the writer.", null, "" ]
[ null, "https://cf.blurtitcdn.com/var/avatar/thumb_default_avatar.jpg", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.763905,"math_prob":0.95226216,"size":1213,"snap":"2022-40-2023-06","text_gpt3_token_len":433,"char_repetition_ratio":0.26716295,"word_repetition_ratio":0.26213592,"special_character_ratio":0.45836768,"punctuation_ratio":0.20063694,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9954293,"pos_list":[0,1,2],"im_url_duplicate_count":[null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-10-07T08:59:32Z\",\"WARC-Record-ID\":\"<urn:uuid:273ac595-d81e-404f-bdc8-01249446135b>\",\"Content-Length\":\"77588\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:9dfbaad6-5883-4b40-bf78-d6985da4b4bc>\",\"WARC-Concurrent-To\":\"<urn:uuid:8a6d822f-6a0f-44ac-bbe0-e101f3f131c8>\",\"WARC-IP-Address\":\"172.67.65.240\",\"WARC-Target-URI\":\"https://education.blurtit.com/156762/how-many-digits-are-there-in-a-million\",\"WARC-Payload-Digest\":\"sha1:SXWXHMBFMW5ZXWRFEBHAGJBOG4IFJSR4\",\"WARC-Block-Digest\":\"sha1:Z5PIOB7CVBB4CMYRC6GASJ3XZHQQRXHJ\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-40/CC-MAIN-2022-40_segments_1664030338001.99_warc_CC-MAIN-20221007080917-20221007110917-00132.warc.gz\"}"}
https://techcommunity.microsoft.com/t5/excel/userform-vba-coding-update-command-button/td-p/2889445
[ "", null, "# UserForm VBA Coding - Update command button\n\nHello\n\nI was wondering if someone may be able to help me to restrict the following code to only updating one record within a Excel UserForm.  At present I have a search function which finds a name within textbox2 for eg. Bill.  I alter the data that is populated in the form as required however when I select Update it updates all the \"Bill's\" within the spreadsheet rather than just the one that is loaded into the form.\n\nAny advice would be greatly appreciated.\n\nMy code is as follows:\n\nPrivate Sub CommandButton6_Click()\nDim Name As String\nName = Trim(TextBox2.Text)\nlastrow = Worksheets(\"Sheet1\").Cells(Rows.Count, 1).End(xlUp).Row\nFor i = 2 To lastrow\nIf Worksheets(\"Sheet1\").Cells(i, 2).Value = TextBox2 Then\nWorksheets(\"Sheet1\").Cells(i, 3) = TextBox3.Text\nWorksheets(\"Sheet1\").Cells(i, 4) = TextBox4.Text\nWorksheets(\"Sheet1\").Cells(i, 5) = TextBox5.Text\nWorksheets(\"Sheet1\").Cells(i, 6) = TextBox6.Text\nWorksheets(\"Sheet1\").Cells(i, 7) = TextBox7.Text\nWorksheets(\"Sheet1\").Cells(i, = Recommendations.Value\n\nEnd If\nNext\nEnd Sub" ]
[ null, "https://www.facebook.com/tr", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.8344502,"math_prob":0.6141816,"size":1148,"snap":"2021-43-2021-49","text_gpt3_token_len":334,"char_repetition_ratio":0.1923077,"word_repetition_ratio":0.023952097,"special_character_ratio":0.29616725,"punctuation_ratio":0.15481171,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9847146,"pos_list":[0,1,2],"im_url_duplicate_count":[null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-11-27T07:37:35Z\",\"WARC-Record-ID\":\"<urn:uuid:dae496ae-b326-4909-81fb-408782786ef5>\",\"Content-Length\":\"416620\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:224867ea-f6d0-4441-8621-d5f534ab81e3>\",\"WARC-Concurrent-To\":\"<urn:uuid:81d84942-0a97-49e2-a488-23ae54ea7193>\",\"WARC-IP-Address\":\"104.106.168.149\",\"WARC-Target-URI\":\"https://techcommunity.microsoft.com/t5/excel/userform-vba-coding-update-command-button/td-p/2889445\",\"WARC-Payload-Digest\":\"sha1:T3QH6JS2CZ4KZQWK473P7DKQ2OV2G7RG\",\"WARC-Block-Digest\":\"sha1:XVRUXR25WQVVM4OAOWGQQYOT65I72L7M\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-49/CC-MAIN-2021-49_segments_1637964358153.33_warc_CC-MAIN-20211127073536-20211127103536-00227.warc.gz\"}"}
https://ask.sagemath.org/questions/25373/revisions/
[ "# Revision history [back]\n\n### Defining constants after solving ODE/PDE\n\nHello\n\nSolving the differential equation $f'(x) = f(x)$ the answer leads to $f(x) = ce^x$ where $c$ is a constant. How can I generically solve this ODE in SAGE and define $c$ afterwards (I don't want to use ics)?\n\nConsider this script\n\nx = var('x')\nf = function('f',x)\nf = desolve(diff(f,x) == f(x), f, ival=x)\nprint str(f(x))\n>> ce^x\n#I want to define c afterwards\n\n\nA method I found:\n\n#continue the previous prompt\nf(x,c) = f(x)\nh(x) = f(x,10)\n\n\nIs there something else that I can do?" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.84661037,"math_prob":0.99854374,"size":479,"snap":"2021-43-2021-49","text_gpt3_token_len":157,"char_repetition_ratio":0.101052634,"word_repetition_ratio":0.0,"special_character_ratio":0.33194155,"punctuation_ratio":0.09174312,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9998386,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-10-23T23:52:20Z\",\"WARC-Record-ID\":\"<urn:uuid:17480b1b-2038-464e-801f-c9bf36d27ba2>\",\"Content-Length\":\"15053\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:95ba48bf-07fa-41b1-aa6c-01afa1156171>\",\"WARC-Concurrent-To\":\"<urn:uuid:c3121b62-7e71-4ad4-bb83-ee7e74d42910>\",\"WARC-IP-Address\":\"194.254.163.53\",\"WARC-Target-URI\":\"https://ask.sagemath.org/questions/25373/revisions/\",\"WARC-Payload-Digest\":\"sha1:BX3JALLBJ2ORG3R2LAIZ62NLP6DOTGSO\",\"WARC-Block-Digest\":\"sha1:XFJ4GFT4MDDSDT56TT4POPSONFUMDSIH\",\"WARC-Identified-Payload-Type\":\"application/xhtml+xml\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-43/CC-MAIN-2021-43_segments_1634323585828.15_warc_CC-MAIN-20211023224247-20211024014247-00428.warc.gz\"}"}
https://www.rdocumentation.org/packages/stats/versions/3.6.0/topics/var.test
[ "stats (version 3.6.0)\n\n# var.test: F Test to Compare Two Variances\n\n## Description\n\nPerforms an F test to compare the variances of two samples from normal populations.\n\n## Usage\n\n```var.test(x, …)# S3 method for default\nvar.test(x, y, ratio = 1,\nalternative = c(\"two.sided\", \"less\", \"greater\"),\nconf.level = 0.95, …)# S3 method for formula\nvar.test(formula, data, subset, na.action, …)```\n\n## Arguments\n\nx, y\n\nnumeric vectors of data values, or fitted linear model objects (inheriting from class `\"lm\"`).\n\nratio\n\nthe hypothesized ratio of the population variances of `x` and `y`.\n\nalternative\n\na character string specifying the alternative hypothesis, must be one of `\"two.sided\"` (default), `\"greater\"` or `\"less\"`. You can specify just the initial letter.\n\nconf.level\n\nconfidence level for the returned confidence interval.\n\nformula\n\na formula of the form `lhs ~ rhs` where `lhs` is a numeric variable giving the data values and `rhs` a factor with two levels giving the corresponding groups.\n\ndata\n\nan optional matrix or data frame (or similar: see `model.frame`) containing the variables in the formula `formula`. By default the variables are taken from `environment(formula)`.\n\nsubset\n\nan optional vector specifying a subset of observations to be used.\n\nna.action\n\na function which indicates what should happen when the data contain `NA`s. Defaults to `getOption(\"na.action\")`.\n\nfurther arguments to be passed to or from methods.\n\n## Value\n\nA list with class `\"htest\"` containing the following components:\n\nstatistic\n\nthe value of the F test statistic.\n\nparameter\n\nthe degrees of the freedom of the F distribution of the test statistic.\n\np.value\n\nthe p-value of the test.\n\nconf.int\n\na confidence interval for the ratio of the population variances.\n\nestimate\n\nthe ratio of the sample variances of `x` and `y`.\n\nnull.value\n\nthe ratio of population variances under the null.\n\nalternative\n\na character string describing the alternative hypothesis.\n\nmethod\n\nthe character string `\"F test to compare two variances\"`.\n\ndata.name\n\na character string giving the names of the data.\n\n## Details\n\nThe null hypothesis is that the ratio of the variances of the populations from which `x` and `y` were drawn, or in the data to which the linear models `x` and `y` were fitted, is equal to `ratio`.\n\n`bartlett.test` for testing homogeneity of variances in more than two samples from normal distributions; `ansari.test` and `mood.test` for two rank based (nonparametric) two-sample tests for difference in scale.\n```# NOT RUN {" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.69681835,"math_prob":0.93327713,"size":2310,"snap":"2021-43-2021-49","text_gpt3_token_len":575,"char_repetition_ratio":0.1292281,"word_repetition_ratio":0.010230179,"special_character_ratio":0.24069265,"punctuation_ratio":0.14565217,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9969702,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-10-17T04:35:32Z\",\"WARC-Record-ID\":\"<urn:uuid:65908e5a-bc6d-42db-9943-9f7bc89095a8>\",\"Content-Length\":\"31029\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:d4bdb66f-351d-4ee4-be9a-370bdd942c4b>\",\"WARC-Concurrent-To\":\"<urn:uuid:d9bedf9c-2f3f-482e-8a4f-e227e7ccccaa>\",\"WARC-IP-Address\":\"54.239.152.91\",\"WARC-Target-URI\":\"https://www.rdocumentation.org/packages/stats/versions/3.6.0/topics/var.test\",\"WARC-Payload-Digest\":\"sha1:IGDDN5MTR7YZWRDIVJBEEKO64EPXVDCI\",\"WARC-Block-Digest\":\"sha1:GXTDUN33VR5IOA2LYVAZRBN2SU5GKHNB\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-43/CC-MAIN-2021-43_segments_1634323585120.89_warc_CC-MAIN-20211017021554-20211017051554-00102.warc.gz\"}"}
https://wordpandit.com/data-interpretation-level-3-set-11/
[ "DIRECTION : A professor keeps data on students tabulated by performance and sex of the student. The data is kept on a computer disk, but unfortunately some of it is lost because of a virus. Only the following could be recovered:", null, "Panic buttons were pressed but to no avail. An expert committee was formed, which decided that the following facts were self evident:\n1.One third of the male students were average.\n2.Half the students were either excellent or good.\n3.40% of the students were females.\n\nQuestion 1. How many students are both male and good?\n(a) 10\n(b) 16\n(c) 22\n(d) 48\n\nQuestion 2. How many students were both female and excellent?\n(a) 0\n(b) 8\n(c) 16\n(d) 32\n\nQuestion 3. What proportion of female students are good?\n(a) 0\n(b) 0.25\n(c) 0.5\n(d) 1.0\n\nQuestion 4. Among average students, what is the ratio of male to female?\n(a) 1 : 2\n(b) 2 : 1\n(c) 3 : 2\n(d) 2 : 3\n\nQuestion 5. What proportion of good students are male?\n(a) 0\n(b) 0.73\n(c) 0.4\n(d) 1.0\n\n1.  From the table it is given that the number of females are 32 which is the 40% of the student which means the total number of students are 80 and the number of boys are 48 2. Now in the question we are given by that half the students were excellent or good Also it is given that One third of the male students were average. So the numbers of male average students are 16 3. (Number of average students) = (number of good students + number of excellent students) = 40. 4. Total good students = 30 5. Therefore the number of excellent students = 40 – 30 = 10. 6. Also in the question it is mentioned that 1/3rd of male students were average, Therefore total number of boy students that were good = (48 – 16 – 10) = 22.\n\nNow from this information our graph will change to the following graph", null, "Number of students who are both male and good = 22.\n\nNumber of students who are both female & excellent = 0.\n\nProportion of female students who are good = (8/32) = 0.25." ]
[ null, "https://dxuoddg10rgxw.cloudfront.net/wp-content/uploads/2017/08/26113859/di-level-3-set-11-pic-1.png", null, "https://dxuoddg10rgxw.cloudfront.net/wp-content/uploads/2017/08/26115037/di-level-3-set-11-pic-2.png", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.96473974,"math_prob":0.9856292,"size":2374,"snap":"2019-43-2019-47","text_gpt3_token_len":692,"char_repetition_ratio":0.18691984,"word_repetition_ratio":0.022624435,"special_character_ratio":0.3146588,"punctuation_ratio":0.12820514,"nsfw_num_words":1,"has_unicode_error":false,"math_prob_llama3":0.9882295,"pos_list":[0,1,2,3,4],"im_url_duplicate_count":[null,2,null,2,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-11-20T07:20:46Z\",\"WARC-Record-ID\":\"<urn:uuid:79539333-b5b5-432e-b7cf-dcd8b0ddd134>\",\"Content-Length\":\"64256\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:80b94167-683b-435c-b15f-609ea4db9d9c>\",\"WARC-Concurrent-To\":\"<urn:uuid:5cc23113-902c-4004-b134-6c8480356a0c>\",\"WARC-IP-Address\":\"139.59.49.211\",\"WARC-Target-URI\":\"https://wordpandit.com/data-interpretation-level-3-set-11/\",\"WARC-Payload-Digest\":\"sha1:T6YTXRC2O4MZ6CHZAV4RZ57SFBHNHXOY\",\"WARC-Block-Digest\":\"sha1:Z3I2DR3S7JWFLW3QF2FXX2SJSMQ3JMMV\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-47/CC-MAIN-2019-47_segments_1573496670512.94_warc_CC-MAIN-20191120060344-20191120084344-00367.warc.gz\"}"}
https://www.thefreelibrary.com/Data+Preprocessing+Method+and+Fault+Diagnosis+Based+on+Evaluation...-a0585354998
[ "# Data Preprocessing Method and Fault Diagnosis Based on Evaluation Function of Information Contribution Degree.\n\n1. Introduction\n\nIn this paper, based on the evaluation function to calculate the weight of the data feature, the premise is to evaluate the accuracy of the function, which is the theoretical basis and guarantee for the validity of the follow-up work. At present, BP neural network is one of the most popular regression algorithms. It can effectively approximate complex nonlinear mappings based on inputting samples and has the advantages of simple structure and high operability and has been applied in many fields [1, 2]. On the other hand, there are some problems . First of all, the parameter training method based on the gradient descent learning algorithm converges slowly and falls into the local optimum. Secondly, there are many parameters in the neural network that need to be trained, which can take a great time to deal with. In the actual operation of the system, the model data of the system may not have been completely collected but acquired one by one or block by block, while the neural network is a learning algorithm lacking the ability to update online. It is unacceptable for many practical situations to retrain the network in response to changes in the modalities of system. However, if the parameters in the neural network are not updated in time, the fitting output of the network will greatly deviate from the real value.\n\nIn order to solve the above problems, the industry has proposed Neural Network Incremental Learning algorithm to deal with them . The incremental learning method can adjust the artificial neural network by analyzing the specific conditions and recognition results of each new sample, learn new knowledge based on the existing knowledge, and flexibly adapt to the dynamic changes of the environment . Therefore, there are many researches on incremental learning algorithms [6, 7]. The main idea of incremental learning is mainly reflected in two aspects: (1) in the actual perception of data, the amount of data is often gradually increased. Therefore, in the face of new data, the learning method should only update the changes caused by the new data without changing the original knowledge base and then learn from the new data contained in the knowledge; (2) the cost of modifying a well-trained system is usually less than the cost of retraining one system. There are many frameworks for incremental learning. The core of each framework is to evaluate the similarity between new data and stored knowledge. The method thus determines the way in which new knowledge is perceived and the knowledge base is increased, which affects the growth of knowledge. Therefore, the judgment mechanism of new knowledge is the core part of incremental learning. In an Orthogonal Least Square (OLS) learning algorithm proposed by Chen, structure and parameter identification are performed simultaneously . In , a dynamic fuzzy neural network (DFNN) based on RBF is proposed. The parameters are adjusted by Linear Least Square (LLS), and the structure can be adaptively added and deleted according to the rules. On the basis of these, a generalized DFNN (GDFNN) is proposed by the literature . Based on the Ellipse Basis Function (EBF), an online parameter locating mechanism is proposed. The above algorithms are more difficult to achieve and at the same time cannot guarantee the real-time algorithm.\n\nThe Kalman filtering method was widely used in the fields of process control, communication, biomedical science, etc., once proposed in the 1960s. Because of its recursive nature, it does not need to store a large amount of historical information and reduces the amount of computer storage. Combining the system state equation and the observation equation directly, it can directly give the estimation accuracy when estimating system state parameters. Its concise way of thinking had become the theoretical basis for the development of such theories as estimation theory and emerging information fusion [11,12]. Compared with Kalman, the least squares method uses all the observed data to estimate the value of the state quantity at the initial time. Due to the large number of observations and the statistical characteristics of the method, then this method has a higher accuracy. However, due to its centralized nature, it lacks real-time performance. Kalman filter after the observation data is updated, the state variables are improved with new observation data to obtain the state variables at this observation time. Therefore, Kalman filtering is suitable for real-time processing. In this paper, a method of real-time update of hidden layer output weights based on Kalman filter is proposed, which avoids the retraining of the model. At the same time, the deviation from the real value of the model output data caused by the failure of the model parameters to be updated due to the system modal change is eliminated.\n\nThe rest of this article is organized as follows: Section 2 gives a brief description of the problems to be solved. The formal description of BP neural network, the gradient descent method, least squares method, and Kalman filter method are used to update the global or local parameters of the network in Section 3. In Section 4, we give a detailed introduction to the process of weighting MIV algorithm. Section 5 simulates the proposed algorithm based on the UCI standard dataset and results of comparisons and analyses. Section 6 summarizes the related research contents, elaborates on the existing problems, and gives a prospect of the next work.\n\n2. Problem Description\n\nBased on the data-driven fault diagnosis method, a series of data processing is often required before the fault diagnosis, such as data standardization, data dimension reduction, feature selection, feature weighting, etc. Some even need to map the data onto high-dimensional space, like we are using support vector machine (SVM) for data classification. The ultimate goal of all the above data preprocessing operations is to improve the diagnostic performance of the fault diagnosis method. Different data preprocessing operations are often adopted for different fault diagnosis methods. Feature weighting algorithm is relatively special, and no matter which kind of data preprocessing operation, you can then weight their features. The purpose of the weight of the feature is to amplify the difference between the feature variables of the data and to eliminate the feature redundancy to a certain extent.\n\nX = [x(1), x(2), ..., x(N)] is the data set composed of N samples and x(k) = [[[x.sub.1](k), [x.sub.2] (k), ..., [x.sub.n](k)].sup.T] is a sample of the data set X, where x(k) is the sample at time k and [x.sub.i] (k) is the component at time k, k = 1,2, ..., N; i = 1,2, ..., n. Our purpose is to find a transformation matrix P to perform a weighted transformation on the sample data\n\n[bar.x] (k) = Px (k) (1)\n\n[mathematical expression not reproducible] (2)\n\nMaking the weighted transformed sample data [bar.x](k) can be more effective in fault diagnosis. The next question is how to model and find the transformation matrix P: the traditional principal component analysis (PCA) algorithm can solve the transformation matrix to map the original data containing n features onto the selected m-dimensional feature space and have m < n, so PCA lost some information in the process of data transformation. The information entropy feature weighting algorithm weights the sample data based on the uncertainty of the feature set's classification of the data set, but its calculation is more difficult; the data set also has higher requirements. In this paper, we want to obtain the weight of the feature through an evaluation function. The evaluation function is generated based on the BP neural network fitting function. In order to ensure the accuracy of the evaluation function, we generally need to retrain the network when the system modal changes. This is a time-consuming task. In order to avoid the retraining of the model, this paper proposes a Kalman filter-based algorithm for real-time update of hidden layer output weights of BP neural network and then establishes the evaluation function model to obtain the transformation matrix (i.e., feature weights). Following we are going to introduce the establishment of the evaluation function and the weight of the data feature in detail. The algorithm implementation process is shown in Figure 1.\n\n3. Evaluation Function Established\n\nThe weight of the feature in the above problem depends on the evaluation function. The evaluation function model is generated based on the fitting function of the neural network (i.e., the algebraic representation of the model), and the influence of the input to the output is calculated by the Mean Impact Value (MIV) algorithm, so this article refers to it as the evaluation function. In order to ensure the accuracy of the evaluation function, a precise system model will be necessary. Next, we will conduct a modeling analysis on how to build a model that is accurate and the model parameters updated in real time as the system modal changes.\n\n3.1. Formal Description of BP Neural Network. BP neural network is a kind of feedforward neural network; its main feature is the signal forward, the error of the reverse transmission. In the forward transfer process, the signal input is processed by the hidden layer and finally output. If the output layer error is greater than our set value, it is propagated backwards. After this is repeated, constantly adjust the network weights and bias until the output error meets the set value, or the number of iterations of the algorithm goes up to the ceiling . BP neural network structure is shown in Figure 2.\n\nFor the dataset X = [x(1), x(2), ..., x(N)], we need corresponding output Y = [y(1), y(2), ..., y(N)] in neural network training and bring the above labeled dataset into the established BP neural network structure model as (3) to train the model parameters and get the parameters to estimate [omega], [alpha], [beta], b\n\ny(k) = [i.summation over (j=1)] [[beta].sub.jo] f ([n.summation over (i=1)][[omega].sub.ij][x.sub.i] (k) + [a.sub.j]) + b,\n\n(3)\n\nk = 1,2, ..., N\n\nwhere [Omega] and [beta] are input layer output weight matrix and hidden layer output weight matrix, a and b are the hidden layer bias and output layer bias vector, [omega] [subset not equal to] [R.sup.lxn], [beta] [subset not equal to] [R.sup.lxm] and a [subset not equal to] [R.sup.lx1], b [subset not equal to] [R.sup.mx1], respectively. BP neural network can be regarded as a nonlinear function, neural network output value, and predicted value of the function of the independent variables and dependent variables. When the input vector is n-dimensional and the output vector is m-dimensional, the BP neural network expresses the function mapping from n-dimensional space onto m-dimensional space.\n\nBP neural network conducts network training before making predictions; the training process includes the following steps.\n\nStep 1. Initialization of neural network parameter: according to the input and output sequence of the system, the number of hidden layer nodes l and the number of output layer nodes and m are determined. The weights [omega] and [beta] of the input layer to the hidden layer and the hidden layer to the output layer are initialized, and the bias vectors are a and b. Set the learning rate [eta] and select the activation function.\n\nStep 2. Calculating output of hidden layer: according to the input of input layer, input layer to the hidden layer of the weight, and bias, calculate output of hidden layer z\n\n[z.sub.j] (k) = f ([n.summation over (n=1)] [[omega].sub.ij] [x.sub.i] (k) + [a.sub.j]),\n\n(4)\n\ni = 1, 2, ..., n; j = 1, 2, ..., l\n\nwhere f is the hidden layer of the excitation function and the function has many forms, common like sigmoid function, and Gaussian function.\n\nStep 3. Calculating output of output layer [z.sub.jk]: according to output of hidden layer [beta], output weight of hidden layer vector a, and bias vector b, we calculate the BP neural network prediction output value [??]\n\n[??](k) = [l.summation over (j=1)][[beta].sub.jo]f ([n.summation over (i=1)][[omega].sub.ij][x.sub.i](k) + [a.sub.j]) + b\n\n(5)\n\no = 1,2, ..., m\n\nStep 4. Error calculation: based on the predicted output [??](k) of system and expected output y(k), a network prediction error e is calculated\n\ne = [L.summation over (k=1)] [[??](k)-y(k)] (6)\n\nStep 5. Updating of weight vector and bias vector: we are going to describe in detail the different weight update algorithms in the following section.\n\nStep 6. Determine whether [parallel]e(k)[parallel] is smaller than the set value or whether the number of iterations of the algorithm has reached the ceiling. If it is \"yes\" the algorithm ends; if it is \"no\" the algorithm returns to Step 2.\n\n3.2. Estimation of Evaluation Function Parameters Based on Gradient Descent Method. The method of parameter training in BP neural network generally adopts the method of gradient descent. Gradient descent method is used to find the minimum value of the function, and it is an iterative algorithm, which has been widely used in machine learning. Gradient is a vector, the direction of the derivative is a scalar, the direction of the gradient refers to the direction of the maximum direction of the derivative, and gradient modulus is equal to the maximum value of the directional derivative. Solving the gradient is to find the partial derivative for each independent variable, and then the partial derivative as the direction of the independent variable coordinates can be\n\n[mathematical expression not reproducible] (7)\n\nFirstly, select an initial point and calculate the gradient of the point and then update the independent variable in the direction of the gradient. If the k-th iteration value of [[omega].sub.ij] is [[omega].sup.(k).sub.ij], then\n\n[[omega].sup.(k+1).sub.ij] = [[omega].sup.(k).sub.ij] - [eta][[nabla].sub.[omega]]J ([[omega].sup.(k).sub.ij], a,[beta],b) (8)\n\nwhere [eta] is called the step length or the learning rate, which indicates the size of the argument in each iteration step.\n\nIn the same way, other parameters in the network iteratively update the expression\n\n[a.sup.(k+1).sub.j] = [a.sup.(k).sub.j] - [eta][[nabla].sub.a] f ([omega], [a.sup.(k+).sub.j], [beta], b) (9)\n\n[[beta].sup.(k+1).sub.jo] = [[beta].sup.(k).sub.jo] - [eta][[nabla].sub.[beta]] f ([omega], a, [[beta].sup.(k).sub.jo], b) (10)\n\n[b.sup.(k+1).sub.o] = [b.sup.(k).sub.o] - [eta][[nabla].sub.b] f ([omega], a, [beta], [b.sup.(k).sub.o]) (11)\n\nNote 1. The gradient descent method slows down when approaching the minimum value. There is no standardized way to set the iteration step size of the algorithm. The algorithm may fall into the local optimum and may not be able to obtain the global minimum. It is difficult to update the parameters in the neural network adaptively with the increasing of input samples.\n\n3.3. Estimation of Evaluation Function Parameters Based on Extreme Learning Machine Method. Extreme Learning Machine (ELM) is an algorithm proposed by Professor Huang Guangbin from Nanyang Technological University to solve neural networks. The biggest characteristic of ELM compared to the traditional neural network, especially single hidden neural network, is faster than the traditional learning algorithm.\n\nWhen we randomly initialize w and a in BP neural network and set the bias vector b to zero and consider only ft, the BP neural network can be regarded as an ELM . The matrix representation of the ELM combined with the above equation (2) is as follows:\n\nZ * [beta] = Y (12)\n\nwhere Z is the output of the hidden layer node, [beta] is the output weight, and Y is the expected output.\n\nOnce the input weight [[omega].sub.ij] and the hidden layer bias [a.sub.j] are given randomly in the ELM algorithm, the output matrix Z of the hidden layer is uniquely determined. A single hidden layer neural network that had been trained can be transformed into solving a linear system: Z * [beta] = Y. Then the problem of solving the hidden layer output weight vector b is transformed into the least square problem .\n\nNote 2. Single hidden layer neural network in the process of iterative algorithm training all the parameters in the network should be retrained, so its training speed is slower. If using extreme learning machine to solve the network parameters, the training speed of the network will be greatly improved. The BP neural network has been reduced to ELM to reduce the computational complexity. However, [omega] and a are randomly initialized in the network, which leads to unstable output of the network.\n\nLeast squares method is a mathematical optimization technique that finds the best match for the data by minimizing the square of the error. The least squares method can be used to find the unknown data easily and minimize the sum of squares of the errors between the obtained data and the actual data. For the linear model established in (11), for the least squares, the final matrix representation is as follows:\n\nmin [[parallel]Z[beta]-Y[parallel].sub.2] (13)\n\nThe final optimal solution is\n\n[beta] = [([Z.sup.T]Z).sup.-1] [Z.sup.T] Y (14)\n\nNote 3. The least squares method is a centralized approach that is based on the whole and cannot adjust and update the network parameters adaptively as the sample data increases.\n\nAccording to the research, Kalman filtering possesses the potential to adjust parameters in the network in real time as the number of samples increases or modalities update.\n\n3.4. Estimation of Evaluation Function Parameters Based on Kalman. If we want to use Kalman filtering to update the network parameters in real time, then we must establish the state equation and the measurement equation that fit the Kalman filter [16,17]. Considering that the parameters [beta] and b to be estimated are all subject to a certain degree of random disturbance, we model the state equation of Kalman filter as follows:\n\n[alpha] (k +1) = [alpha] (k) + w (k) (15)\n\nIn the above formula, [alpha] = [[[beta], b].sup.T]. To simulate the interference to be estimated, we added the white noise sequence w(k) to the equation.\n\nIn the above BP neural network algorithm derivation process, (3) can be seen as Kalman filter measurement equation\n\ny(k) = [l.summation over (j=1)] [[beta].sub.jo]f ([n.summation over (i=1)]) [[omega].sub.ij][x.sub.i](k) + [a.sub.j]) + b + v (k) (16)\n\nConsidering that we are building a linear Kalman filter model, we randomly initialize w and e in the above formula, so the above equation is distorted to\n\ny(k) = H(k)[alpha] + v (k) (17)\n\nwhere H(k) = [g([[summation].sup.n.sub.i=1] [[omega].sub.i1] (k) + [a.sub.j]), g([[summation].sup.n.sub.i=1] [[omega].sub.i2] (k) + [a.sub.j], ..., g([[summation].sup.n.sub.i=1] [[omega].sub.ij] (k) + [a.sub.j]), 1]; since the parameter [alpha] to be estimated is slowly changing, we also added the white noise sequence w(k) to the model.\n\nTherefore, the establishment of Kalman filter model is as follows:\n\n[alpha](k + 1) = A(k + 1,k) [alpha](k) + w (k)\n\ny (k) = H[alpha] (k) + v (k) (18)\n\nIn the Kalman filter model, both the process noise w(k) and the observed noise v(k) are white noise sequences, which are constant values during the sampling interval. With E{w(k)w'(k)} = Q and E{v(k)v (k)} = R, and when w(k) and v(k) are independent of each other, E{w(k)v'(k)} = 0. The process of Kalman filtering is shown in Figure 3. Now Kalman optimal filtering equation is summarized as follows:\n\nTime update is\n\n[mathematical expression not reproducible] (19)\n\nP(k + 1 | k) = A(k+1,k)P(k | k)[A.sup.T] (k+1 | k)\n\n+ [GAMMA](k+1,k)Q(k)[[GAMMA].sup.T] (k+1,k) (20)\n\nMeasurement update is\n\n[mathematical expression not reproducible] (21)\n\n[mathematical expression not reproducible] (22)\n\n[mathematical expression not reproducible] (23)\n\nIn the above five formulas, (19) to (23), [??](k + 1 | k) denotes the state estimation value at time k+1; P(k + 1 | k) denotes the covariance matrix corresponding to [alpha](k+1|k); K(k + 1) denotes the optimal gain matrix at time k+1; [??](k + 1 | k) denotes the state estimation error at time k+1, [??](k + 1 \\ k) = a(k +1) - [??](k + 1 | k); [??](k +1 | k + 1) is the optimal state estimate at time k+1; and P(k + 1 | k+1) represents the covariance matrix corresponding to [alpha](k +1 | k +1).\n\nAfter the above Kalman filter model is established, the observation matrix H is solved with the parameters in the trained neural network, and then the hidden layer output weight vector and the bias vector a are updated according to the Kalman filter algorithm.\n\nNote 4. If we consider [omega] and a in f([[summation].sup.n.sub.i=1] [[omega].sub.ij] [x.sub.i] (k) + [a.sub.j]), the measurement equation of Kalman filter we have established becomes a nonlinear equation. The equation of state is a column vector [[omega], a, [beta], b].sup.T] consisting of [omega], a, [beta], and b. Nonlinear filtering method for state estimation will greatly increase the complexity of the algorithm [18,19].\n\n4. Feature Weight Calculation and Fault Diagnosis\n\nMean Impact Value (MIV) is used to evaluate the importance of each independent variable for the dependent variable size . MIV is an indicator used to determine the magnitude of the effect of input neurons on the output neurons, whose symbols represent the relative direction, and the absolute value represents the relative importance of the effect. In a word, the greater the feature weight calculated by the evaluation function, the more sensitive the output of the function to the change of the characteristic variable. The feature weighting used for sample attributes is mainly to amplify the changes of key feature variables, making the output more sensitive to changes. The specific calculation process is as follows:\n\n[mathematical expression not reproducible] (24)\n\n[mathematical expression not reproducible] (25)\n\n[mathematical expression not reproducible] (26)\n\n[mathematical expression not reproducible] (27)\n\n[mathematical expression not reproducible] (28)\n\nLet [delta] * [x.sub.i] (k) = [DELTA][x.sub.i]; then (28) becomes\n\n[mathematical expression not reproducible] (29)\n\nIn summary, take 0.1 [less than or equal to] [delta] [less than or equal to] 0.3, i = 1, 2, ..., n. After the network training is terminated, the training samples [x.sup.(i).sub.+[delta]] and [x.sup.(i).sub.-[delta]] are simulated as the simulation samples using the builtup network to simulate, respectively. Getting two simulation results [[??].sub.i+] and [[??].sub.t,-], [IV.sub.i] are the average influence of the i-th variable in the sample data. Similarly, the average effect of the other variables in the sample data can be obtained.\n\nIV = [[[IV.sub.1],[IV.sub.2], ..., [IV.sub.n]].sup.T] (30)\n\nThe parameters in IV are the value of influence for feature variables in sample data to the output. Finally, the IV value of m group is simulated, and the average value of the corresponding mean IV is to be taken as MIV.\n\nMIV = 1/m [m.summation over (i=1)][IV.sub.i] (31)\n\nThe magnitude of the absolute value of MIV is the relative importance of the influence of the respective variables on the network output, thus achieving the weighting of the sample data characteristics, and then the PCA algorithm is used for fault diagnosis.\n\n5. Simulation of the Algorithm\n\n5.1. Simulation Data. The dataset contains 9568 data points collected from a Combined Cycle Power Plant over 6 years (2006-2011), when the power plant was set to work with full load. Features consist of hourly average ambient variables, temperature (T), ambient pressure (AP), relative humidity (RH), and exhaust vacuum (V) to predict the net hourly electrical energy output (EP) of the plant. A Combined Cycle Power Plant (CCPP) is composed of gas turbines (GT), steam turbines (ST), and heat recovery steam generators. In a CCPP, the electricity is generated by gas and steam turbines, which are combined in one cycle, and is transferred from one turbine to another. While the vacuum is collected from and has effect on the steam turbine, the other three of the ambient variables affect the GT performance .\n\nIn this experiment, 300 sets of data T were used in the simulation test. In the evaluation function establishment and fault diagnosis process, 200 sets were selected as the training data and 100 sets as the test data. To simulate the variation of the system modal, we add an interference r = 2 + 5* randn(k, 1) to the third feature input of the original dataset, where k is the number of samples. We multiply the original sample data output T by 0.99, 1.02, and 1.05 to simulate changes in the system modality and then test the fitting output of the BP neural network before and after the parameter update. The error rate is used to characterize the fitting accuracy of the model.\n\nError rate is\n\ns_e = [square root of ([[summation].sup.L.sub.i=1] ([y.sub.i] - [[??].sub.i]).sup.2] / n)] / [bar.y] x 100% (32)\n\n5.2. Discussion. For the data before and after the system modal change, we use the original trained neural network and the neural networks of hidden layer output weights were updated by Kalman filter algorithm to fit the data, and then we calculated the error rate to characterize the fitting accuracy, respectively. Combined with Figure 4 and Table 1, we can clearly see that the algorithm proposed in this paper real-time update of the model parameters can be very good to ensure the accuracy of the model.\n\nAfter the traditional neural network parameter training is completed, if the modality of the original system changes, we often retrain the entire network. However, we all know that neural network parameter training process is time-consuming. For those systems whose modality is constantly changing, it is obviously unreasonable to adopt a method of retraining the entire network parameters. The Kalman filtering-based real-time update algorithm for the hidden layer output weights of the BP neural network solves the above problems. On the basis of not changing the other training parameters of the original network, the Kalman filtering model is established, and then the hidden layer output parameters of the BP neural network are updated according to the new data. It can be seen from Table 1 and Figure 4 in this paper that the greater the change in the modality of the original system, the greater the network fitting error. Among the several modal changes we simulated, the fitting errors were 1.33%, 0.88%, 2.16%, and 4.86%, respectively. It can be seen that the change of the original system modality and the original network can no longer trace the output well. However, in our simulation of several modal changes, using the proposed BP neural network local parameter update algorithm to update the hidden layer output weights in the network, the fitting error is 0.88%, 0.89%, 0.93%, and 1.01%, respectively. It can be seen that using the proposed BP neural network local parameter real-time updating algorithm greatly ensures the accuracy of the model, which is the premise to ensure the validity of the evaluation function.\n\nTable 2 is the vector of weights obtained before and after updating the network parameters. We use the weight vectors obtained before and after updating the network parameters to weight the original sample data and then using the PCA fault diagnosis algorithm to do the fault diagnosis. Finally, the fault diagnosis results of the two kinds of weighted data are compared with the results of failure diagnosis of the sample data without weighting. As shown in Table 3 and Figure 5, the three are significantly different in the SPE statistics. After the modal changes, the weighted weights using the original weights are lower than the unweighted diagnostic accuracy. The weighted weights using the updated weights are significantly higher than the unweighted diagnostic accuracy, with the maximum increase of 18%.\n\nIt can be seen from the above simulation data and simulation plot that using Kalman filter algorithm to update the hidden layer output weights of neural networks in real time is feasible. After the observation data is updated, the Kalman filter improves the state quantity with new observation data to get the state quantity at this moment, and the real-time performance of the algorithm is greatly improved. When the system modal changes, the output of the model can be well fitted to the true value without the need of retraining all the parameters of the neural network. At the same time, an accurate evaluation function to obtain the characteristic weight effectively enhances the diagnostic performance of the fault diagnosis algorithm. However, since the method eventually simplifies the model to a linear model and updates some parameters in the network, it is worthwhile to study all parameters of the network using some nonlinear filtering algorithms .\n\n6. Conclusions\n\nThis paper applies the Kalman filter to the real-time update of the hidden layer output weights of BP neural network, which greatly improves the applicability and real-time performance of the BP neural network and ensures the accuracy of the model parameters, so that the obtained evaluation function is accurate. This also makes it possible to characterize the impact of each feature variable on the output based on the weights of the data features obtained from the evaluation function. When there is not big change in the system state, the output of BP neural network hidden layer is adjusted by Kalman filter to compensate the output of the system, in order to avoid retraining the network once the system modality changes. Retraining will result in a waste of resources and may not be tolerated even with frequent retraining of some system models. The simulation results on a standard UCI-ccpp dataset validate the effectiveness of the proposed algorithm.\n\nOnce the training of neural network is completed, it is always a difficult problem to retrain global parameters and update local parameters after it is applied to practical industrial systems. The proposed algorithm only completes the real-time update of the hidden layer output weights of the BP neural network without changing other parameters in the network. On this basis, in the next step we are going to combine some nonlinear filtering algorithms and contents of incremental learning to seek a breakthrough in the regulation and updating of global network parameters.\n\nData Availability\n\nThe data used to support the findings of this study are available from the corresponding author upon request.\n\nhttps://doi.org/10.1155/2018/6565737\n\nConflicts of Interest\n\nThe authors declare that they have no conflicts of interest.\n\nAcknowledgments\n\nThis work is supported by the National Natural Science Foundation (NNSF) of China under Grants nos. U1509203, 61490701, 61573137, 61673160, and 61333005.\n\nReferences\n\n S. Ferrari and R. F. Stengel, \"Smooth function approximation using neural networks,\" IEEE Transactions on Neural Networks and Learning Systems, vol. 16, no. 1, pp. 24-38, 2005.\n\n T.-Y. Kwok and D.-Y. Yeung, \"Objective functions for training new hidden units in constructive neural networks,\" IEEE Transactions on Neural Networks and Learning Systems, vol. 8, no. 5, pp. 1131-1148,1997\n\n S. Ganjefar and M. Tofighi, \"Optimization of quantum-inspired neural network using memetic algorithm for function approximation and chaotic time series prediction,\" Neurocomputing, vol. 291, pp. 175-186, 2018.\n\n Y. W. Wong, K. P. Seng, and L.-M. Ang, \"Radial basis function neural network with incremental learning for face recognition,\" IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics, vol. 41, no. 4, pp. 940-949, 2011.\n\n L. Fu, \"Incremental knowledge acquisition in supervised learning networks,\" IEEE Transactions on Systems, Man and Cybernetics, Part A: Systems and Humans, vol. 26, no. 6, pp. 801-809, 1996.\n\n K. W. Kow, Y. W. Wong, R. K. Rajkumar, R. K. Rajkumar, and D. Isa, \"Incremental unsupervised learning algorithm for power fluctuation event detection in PV grid-tied systems,\" Lecture Notes in Electrical Engineering, vol. 398, pp. 673-679, 2017\n\n H. Wen, W. Xie, J. Pei, and L. Guan, \"An incremental learning algorithm for the hybrid RBF-BP network classifier,\" EURASIP Journal on Advances in Signal Processing, vol. 2016, no. 1, 2016.\n\n S. Chen, C. F. N. Cowan, and P. M. Grant, \"Orthogonal least squares learning algorithm for radial basis function networks,\" IEEE Transactions on Neural Networks and Learning Systems, vol. 2, no. 3, pp. 302-309, 1991.\n\n S. Wu and M. J. Er, \"Dynamic fuzzy neural networks--a novel approach to function approximation,\" IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics, vol. 30, no. 2, pp. 358-364, 2000.\n\n S. Q. Wu, M. J. Er, and Y. Gao, \"A fast approach for automatic generation of fuzzy rules by generalized dynamic fuzzy neural networks,\" IEEE Transactions on Fuzzy Systems, vol. 9, no. 4, pp. 578-594, 2001.\n\n M. Zhang, X. Ma, B. Qin et al., \"Information fusion control with time delay for smooth pursuit eye movement,\" Physiological Reports, vol. 4, no. 10, Article ID e12775, 2016.\n\n L.-Z. Xu, X.-L. Feng, and C.-L. Wen, \"Sequential fusion filtering for networked multi-sensor systems based on noise estimation,\" Tien Tzu Hsueh Pao/Acta Electronica Sinica, vol. 42, no. 1, pp. 160-168, 2014.\n\n S. Ding and Q.-H. Wu, \"A MATLAB-based study on approximation performances of improved algorithms of typical BP neural networks,\" Applied Mechanics and Materials, vol. 313-314, pp. 1353-1356, 2013.\n\n G. Huang, L. Chen, and C. Siew, \"Universal approximation using incremental constructive feedforward networks with random hidden nodes,\" IEEE Transactions on Neural Networks and Learning Systems, vol. 17, no. 4, pp. 879-892, 2006.\n\n S. Rhode, K. Usevich, I. Markovsky, and F. Gauterin, \"A recursive restricted total least-squares algorithm,\" IEEE Transactions on Signal Processing, vol. 62, no. 21, pp. 5652-5662, 2014.\n\n W. Chenglin, Multi-Scale Dynamic Modeling Theory and Its Applications, Science Press, 2008.\n\n Q. Liu, Z. Wang, X. He, and D. Zhou, \"On Kalman-consensus filtering with random link failures over sensor networks,\" IEEE Transactions on Automatic Control, vol. 99, pp. 1-1, 2017\n\n Q. Liu, Z. Wang, X. He, G. Ghinea, and F. E. Alsaadi, \"A resilient approach to distributed filter design for time-varying systems under stochastic nonlinearities and sensor degradation,\" IEEE Transactions on Signal Processing, vol. 65, no. 5, pp. 1300-1309, 2017.\n\n C. Wen, Z. Wang, J. Hu, Q. Liu, and F. E. Alsaadi, \"Recursive filtering for state-saturated systems with randomly occurring nonlinearities and missing measurements,\" International Journal of Robust and Nonlinear Control, vol. 28, no. 5, pp. 1715-1727, 2018.\n\n S. Ji, X. Xu, and C. Wen, \"A kind of K--Nearest neighbor fault diagnosis method based on MIV data transformation,\" in Proceedings of the 2017 Chinese Automation Congress (CAC), pp. 6306-6310, Jinan, October 2017.\n\n M. Lichman, UCI Machine Learning Repository, University of California, School of Information and Computer Science, Irvine, Calif, USA, 2013, http://archive.ics.uci.edu/ml.\n\n C. Wen, Z. Wang, T. Geng, and F. E. Alsaadi, \"Event-based distributed recursive filtering for state-saturated systems with redundant channels,\" Information Fusion, vol. 39, pp. 96-107, 2018.\n\nSiyu Ji and Chenglin Wen\n\nSchool of Automation, Hangzhou Dianzi University, Hangzhou 310018, China\n\nCorrespondence should be addressed to Chenglin Wen; wencl@hdu.edu.cn\n\nReceived 18 February 2018; Revised 14 April 2018; Accepted 30 April 2018; Published 2 July 2018\n\nCaption: FIGURE 1: Evaluation function of information contribution degree algorithm process.\n\nCaption: FIGURE 2: BP neural network structure.\n\nCaption: FIGURE 3: The process of Kalman filtering.\n\nCaption: FIGURE 4: Neural network fitting output before and after the parameters of neural network were updated by Kalman filter after system modal change.\n\nCaption: FIGURE 5: Fault detection diagram for 1.05T.\n```TABLE 1: Neural network fitting results before and after the\nparameter update.\n\nThe error rate algorithm fitting (%)\nOriginal Data T\n0.99T 1.00T 1.02T 1.05T\n\nBPNN 1.33 0.88 2.16 4.86\nKalman-BPNN 0.88 0.89 0.93 1.01\n\nTABLE 2: The characteristic weights of the sample data.\n\nWeight\nOriginal Data T\nOriginal weight\n\n0.99T -10.76 -0.59 0.10 -3.21\n1.00T -10.76 -0.59 0.10 -3.21\n1.02T -10.76 -0.59 0.10 -3.21\n1.05T -10.76 -0.59 0.10 -3.21\n\nWeight\nOriginal Data T\nUpdated weight\n\n0.99T -7.46 -1.98 0.97 -1.06\n1.00T -7.54 -2.00 0.98 -1.07\n1.02T -7.69 -2.03 1.00 -1.09\n1.05T -7.91 -2.09 1.03 -1.12\n\nTABLE 3: Accuracy of fault diagnosis for different weights.\n\nOriginal Data T Accuracy of fault diagnosis (%)\n\nUnweighted Original weight\n\n[T.sup.2.sub.99] SPE [T.sup.2.sub.99] SPE\n\n0.99T 98 50 4 42\n1.00T 100 78 100 100\n1.02T 98 50 4 42\n1.05T 98 50 4 42\n\nOriginal Data T Accuracy of fault diagnosis (%)\n\nUpdated weight\n\n[T.sup.2.sub.99] SPE\n\n0.99T 98 66\n1.00T 100 84\n1.02T 98 68\n1.05T 98 68\n```\nTitle Annotation:", null, "Printer friendly", null, "Cite/link", null, "Email", null, "Feedback Research Article Ji, Siyu; Wen, Chenglin Journal of Control Science and Engineering Report Jan 1, 2018 6234 Performance Analysis and Comparison for High Maneuver Target Track Based on Different Jerk Models. Using Communication Networks in Control Systems: The Theoretical and Practical Challenges. Algorithms Artificial neural networks Data processing Electronic data processing Fault location (Engineering) Neural networks" ]
[ null, "https://www.thefreelibrary.com/_/static/ico_print.gif", null, "https://www.thefreelibrary.com/_/static/ico_link.gif", null, "https://www.thefreelibrary.com/_/static/ico_email.gif", null, "https://www.thefreelibrary.com/_/static/ico_feedback.gif", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.86177164,"math_prob":0.98097384,"size":37576,"snap":"2021-43-2021-49","text_gpt3_token_len":8966,"char_repetition_ratio":0.16698605,"word_repetition_ratio":0.044070646,"special_character_ratio":0.25015968,"punctuation_ratio":0.16701543,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9956458,"pos_list":[0,1,2,3,4,5,6,7,8],"im_url_duplicate_count":[null,null,null,null,null,null,null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-12-05T21:04:26Z\",\"WARC-Record-ID\":\"<urn:uuid:e745625e-72cb-41ab-9bbe-9eaae1da4083>\",\"Content-Length\":\"78424\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:a06208cb-56b5-4845-8da1-608b321e6d83>\",\"WARC-Concurrent-To\":\"<urn:uuid:1351c38f-9f82-47ef-8ec3-db4409b37c4e>\",\"WARC-IP-Address\":\"45.35.33.117\",\"WARC-Target-URI\":\"https://www.thefreelibrary.com/Data+Preprocessing+Method+and+Fault+Diagnosis+Based+on+Evaluation...-a0585354998\",\"WARC-Payload-Digest\":\"sha1:OGZREF5DQWAQ4Y3NAYHM7YTU22B5B4FW\",\"WARC-Block-Digest\":\"sha1:ZYZZB22IEGG4RNMXI7CXBMDBCN3RTPTV\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-49/CC-MAIN-2021-49_segments_1637964363216.90_warc_CC-MAIN-20211205191620-20211205221620-00572.warc.gz\"}"}
https://learnhtml.foobrdigital.com/what-is-the-bitcoin-mining-math-puzzle/
[ "Categories\n\n# What Is the Bitcoin Mining Math Puzzle?\n\nAt the heart of bitcoin mining is a math puzzle that miners are supposed to solve to earn bitcoin rewards. The puzzle is called proof of work (PoW), a reference to the computational work expended by miners to mine bitcoin. While it is often referred to as complex, in actual fact, the mining puzzle is fairly simple and can be described as guesswork.\n\nThe miners in Bitcoin’s network try to come up with a 64-digit hexadecimal number, called a hash, that is less than or equal to a target hash in SHA-256, Bitcoin’s PoW algorithm. A miner’s systems use considerable brute force in the form of multiple processing units stacked together and spit out hashes at different rates—megahashes per second (MH/s), gigahashes per second (GH/s), or terahashes per second (TH/s)—depending on the unit, guessing all possible 64-digit combinations until they arrive at a solution. The systems that guess a number less than or equal to the hash are rewarded with bitcoin.\n\nHere’s an example to explain the process. Say I ask friends to guess a number between 1 and 100 that I have thought of and written down on a piece of paper. My friends don’t have to guess the exact number; they just have to be the first person to guess a number less than or equal to my number.\n\nIf I am thinking of the number 19 and a friend comes up with 21, they lose because 21 is greater than 19. But if someone guesses 16 and another friend guesses 18, then the latter wins because 18 is closer to 19 than 16. In very simple terms, the bitcoin mining math puzzle is the same situation described above, except with 64-digit hexadecimal numbers and thousands of computing systems." ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.9405758,"math_prob":0.9369262,"size":1639,"snap":"2023-40-2023-50","text_gpt3_token_len":361,"char_repetition_ratio":0.112538226,"word_repetition_ratio":0.031358887,"special_character_ratio":0.22513728,"punctuation_ratio":0.07854985,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.95109344,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-12-02T18:58:14Z\",\"WARC-Record-ID\":\"<urn:uuid:02154e78-26ee-487d-9968-267621d80b04>\",\"Content-Length\":\"241144\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:5868f8c0-0049-45c8-89d8-af9746583335>\",\"WARC-Concurrent-To\":\"<urn:uuid:5d1e2cfe-b56f-46e2-ae0c-acfac7e6ac61>\",\"WARC-IP-Address\":\"172.67.191.6\",\"WARC-Target-URI\":\"https://learnhtml.foobrdigital.com/what-is-the-bitcoin-mining-math-puzzle/\",\"WARC-Payload-Digest\":\"sha1:XS7CVD4TBEBMFWBN4OZSHWFDROYK2UJP\",\"WARC-Block-Digest\":\"sha1:F24B3BV6TEJ7FLNNIM2PZBXFYGEDSRXV\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-50/CC-MAIN-2023-50_segments_1700679100448.65_warc_CC-MAIN-20231202172159-20231202202159-00525.warc.gz\"}"}
https://www.jiskha.com/questions/53086/how-would-i-solve-this-equation-11p-6r-4-2p-4-3-10p-5r-4
[ "# Math\n\nHow would I solve this equation?\n\n-11p^6r^4\n----------\n(-2p^4)^3 (-10p^5r^4)\n\n1. 👍\n2. 👎\n3. 👁\n\n## Similar Questions\n\n1. ### algebra\n\n(1) Is the equation true false or open? 9p + 8 = 10p + 7 A. open;there is a variable ***** B. true;the expressions are all the same for all values of the variiables C. false;the expressions are never the same (12) Which equation\n\n2. ### math\n\n(1)Is the Equation true, false, or open? 4y + 8 = 6y + 3 A. True; the expressionas are the same for all values of variables B. False; the expressions are never the same ****** C. Open; there is a varible (12)Which equation is an\n\n3. ### calculus\n\n2. Worldwide annual sales of all cell phones is approximately -10p + 1600 million phones when the wholesale price is \\$p. a) If manufacturers are prepared to supply q = 14p – 800 million phones per year at a wholesale price \\$p,\n\n4. ### Math\n\nIs the equation true, false, or open? 9p + 8 = 10p + 7 I think it's true... Am I correct???\n\n1. ### Algebra\n\n1.Is the equation true false or open ? 9p+8=10p+7 A. Open; there is a variable B. True; the expression are the same for all values of the vaiables. False; the expression are never the same 2.Which is the solution of the equation\n\n2. ### How do I do this.?(Math.)\n\nUse the Substitution method to solve the system of equations. y - 2x = -5 3y - x = 5 Solve one of the equations for x or y. Let's solve the first one for y: y - 2x = -5 y = 2x - 5 Now let's substitute 2x - 5 for y in the second\n\n1. Solve the system of equations y=2x^2-3 y=3x-1 a)no solution b)(-1/2,5),(2,-5/2) c)(-1/2,-5/2),(2,5)**** d)(1/2,5/2),(2,5) 2. How many real number solutions are there to the equation 0=-3x^2+x-4? a)0 ***** b)1 c)2 d)3 3.solve\n\n4. ### Algebra\n\nI have a few questions that I need help with. Solve the radical equation, and check all proposed solutions. 5. x- square root 3x-2=4 I don't understand this problem. Solve and check the equation. 10. (x^2+14x+49)^3/4-20=7 would I\n\n1. ### Math\n\n1. Solve the equation. -6g = 42 a. g = 7 b. g = -7 c. g = 252 d. g = -252 2. Solve the equation. x/8 = 16 a. x = 128 b. x = 24 c. x = 8 d. x = 2 3. Solve the equation. 12m = 14.4 a. m = 120 b. m = 12 c. m = 1.2 d. m = 0.12 4.\n\n2. ### math\n\n(1) Is the equation true false or open? 9p + 8 = 10p + 7 A. open;there is a variable ***** B. true;the expressions are all the same for all values of the variiables C. false;the expressions are never the same (12) Which equation\n\n3. ### Math\n\nSolve this equation p square-10p-24=0\n\n4. ### math\n\nWhat is the first step in solving the linear system {2x−3y=11 {−x+5y=−9 by the substitution method in the most efficient way? A. Solve the first equation for x. B. Solve the first equation for y. C. Solve the second equation" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.79560417,"math_prob":0.99966335,"size":2659,"snap":"2021-31-2021-39","text_gpt3_token_len":899,"char_repetition_ratio":0.17438795,"word_repetition_ratio":0.18903592,"special_character_ratio":0.36179015,"punctuation_ratio":0.15541601,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9999366,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-09-28T01:41:53Z\",\"WARC-Record-ID\":\"<urn:uuid:1d44f920-cb0b-4a19-80e3-b81873699506>\",\"Content-Length\":\"14573\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:9f3e05c9-3f03-4776-840b-e936e5fb2f2c>\",\"WARC-Concurrent-To\":\"<urn:uuid:98735440-743a-4ae2-907a-a9415b8b9363>\",\"WARC-IP-Address\":\"66.228.55.50\",\"WARC-Target-URI\":\"https://www.jiskha.com/questions/53086/how-would-i-solve-this-equation-11p-6r-4-2p-4-3-10p-5r-4\",\"WARC-Payload-Digest\":\"sha1:JKVC5X2Y4VXET5DQ7UZYCK3XI7MQOSQP\",\"WARC-Block-Digest\":\"sha1:7OGUSJGPBZ3VWLQXQV4PFBCWNK4ORLDD\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-39/CC-MAIN-2021-39_segments_1631780058589.72_warc_CC-MAIN-20210928002254-20210928032254-00116.warc.gz\"}"}
https://fepevybydexuvu.menards.club/fast-implementation-of-the-normalized-least-squares-lattice-adaptive-digital-filter-book-9597cn.php
[ "Last edited by Zululmaran\nThursday, April 30, 2020 | History\n\n2 edition of fast implementation of the normalized least squares lattice adaptive digital filter. found in the catalog.\n\nfast implementation of the normalized least squares lattice adaptive digital filter.\n\nMichael Wai-Ho Leung\n\n# fast implementation of the normalized least squares lattice adaptive digital filter.\n\n• 347 Want to read\n• 1 Currently reading\n\nPublished .\nWritten in English\n\nThe Physical Object\nPagination leaves\nNumber of Pages139\nID Numbers\nOpen LibraryOL18822870M\n\nAbstract: The normalized subband adaptive filter (NSAF) presented by Lee and Gan can obtain faster convergence rate than the normalized least-mean-square (NLMS) algorithm with colored input signals. However, similar to other fixed step-size adaptive filtering algorithms, the NSAF requires a tradeoff between fast convergence rate and low Cited by: noise cancellation, signal prediction, adaptive feedback cancellation and echo cancellation. The adaptive filters used in our thesis, LMS (Least Mean Square) filter and NLMS (Normalized Lea st Mean Square) filter, are the most widely used and simplest to implement. The application we File Size: 1MB. Performance analysis of Adaptive Lattice Filters for FM Signals and Alpha-Stable Processes Under the requirements of PhD regulation , the above candidate was examined orally by the Faculty. The members of the panel set up for this examination recommend that. Noise Cancellation by Linear Adaptive Filter based on efficient RLS Lattice Algorithm implementation. RLS Lattice (RLSL) Algorithm We consider, in general the prewindowed with exponentially weighted least square case, the input samples vector to the microphone be - A.\n\nAvailable for Download\n\nShare this book\nYou might also like\nPregnancy proteins\n\nPregnancy proteins\n\nCommunity engagement framework\n\nCommunity engagement framework\n\nCatholic Indian Missions.\n\nCatholic Indian Missions.\n\nHistory of the Zoar Society from its commencement to its conclusion\n\nHistory of the Zoar Society from its commencement to its conclusion\n\nAmerica day by day\n\nAmerica day by day\n\nThistle Creek\n\nThistle Creek\n\nArchives of India\n\nArchives of India\n\nFive Ramesseum papyri\n\nFive Ramesseum papyri\n\nReenlistment bonuses\n\nReenlistment bonuses\n\nExperimental studies in judgment\n\nExperimental studies in judgment\n\nSalvation of Your Loved Ones\n\nSalvation of Your Loved Ones\n\nPass Trak series 7, General securities representative.\n\nPass Trak series 7, General securities representative.\n\n### fast implementation of the normalized least squares lattice adaptive digital filter. by Michael Wai-Ho Leung Download PDF EPUB FB2\n\nNormalized least mean squares filter (NLMS) The main drawback of the \"pure\" LMS algorithm is that it is sensitive to the scaling of its input x (n) {\\displaystyle x(n)}. This makes it very hard (if not impossible) to choose a learning rate μ {\\displaystyle \\mu } that guarantees stability of the algorithm (Haykin ).\n\nThree representative algorithms from the family of Fast Least Squares (FLS) algorithms are reviewed. They correspond to the transversal FIR filter, the lattice-ladder structure and the rotation approach respectively. They all solve the least squares problem recursively Cited by: 3.\n\nThe Lattice Recursive Least Squares adaptive filter is related to the standard RLS except that it requires fewer arithmetic operations (order N). It offers additional advantages over conventional LMS algorithms such as faster convergence rates, modular structure, and insensitivity to variations in eigenvalue spread of the input correlation matrix.\n\n\"Adaptive Digital Filters\" presents an important discipline applied to the domain of speech processing. The book first makes the reader acquainted with the basic terms of filtering and adaptive. Clearly, when e(k) is very small, the adaptive filter response is close to the response of the unknown system.\n\nIn this case, the same input feeds both the adaptive filter and the unknown. If, for example, the unknown system is a modem, the input often represents white noise, and is a part of the sound you hear from your modem when you log in to your Internet service provider.\n\nA new lattice filter algorithm for adaptive filtering is presented. In common with other lattice algorithms for adaptive filtering, this algorithm only requires 0(p) operations for the solution of.\n\n.Normalized Least Mean Square (LMS) Algorithm is used in this paper. The filter length and step size of an adaptive filter along with the algorithm affect the convergence speed. An appropriate step size and filter length must be chosen to ensure that the convergence speed of the adaptive filter satisfiesFile Size: KB.\n\nThe simulation results indicate that the proposed fast lattice LS adaptive algorithm has a good tracking capability and, in addition, has a nice numerical behavior in reduced arithmetic precision. Conclusion A highly efficient adaptive lattice algorithm for least squares multichannel FIR filtering has been by: The FIR filter is implemented serially using a multiplier and an adder with feedback.\n\nThe FIR result is normalized to minimize saturation. The LMS algorithm iteratively updates the coefficient and feeds it to the FIR filter. The FIR filter than uses the coefficient c(n) along with the input reference signal x(n) to generate the output y(n).\n\nAbstract. There are a large number of algorithms that solve the least-squares problem in a recursive form. In particular, the algorithms based on the lattice realization are very attractive because they allow modular implementation and require a reduced number of arithmetic operations (of order N) []–[].As a consequence, the lattice recursive least-squares (LRLS) algorithms are considered Author: Paulo Sergio Ramirez Diniz.\n\nShareable Link. Use the link below to share a full-text version of this article with your friends and colleagues. Learn more. Fast least squares (FLS) algorithms of the transversal type are derived and studied inChapter 6,with emphasis on design aspects and performance.\n\nSeveral complementary algorithms of the same family are presented in Chapter 7to cope with various practical situations and signal types.\n\nTime and order recursions that lead to FLS lattice algorithms. I'm looking to implement the Normalised Least Mean Squares (NLMS) in C. My issue is in the weight update (I think) As I'm running it against a standard MATLAB library.\n\nThis is the MATLAB code (That. Keywords: digital filters, adaptive algorithms, adaptive line enhancers A new adaptive line enhancer using a recently advanced digital biquadratic filter section and a modified least-squares based algorithm is proposed in this paper. The new structure is having an independent tuning of the central frequency and the bandwidth of theAuthor: Maria Nenova, Georgi Stoyanov, Georgi Iliev.\n\nSayed, Adaptive Filters, Wiley, NJ, Description. Adaptive filtering is a topic of immense practical and theoretical value, having applications in areas ranging from digital and wireless communications to biomedical systems.\n\nIn the fourth edition of Adaptive Filtering: Algorithms and Practical Implementation, author Paulo S.R. Diniz presents the basic concepts of adaptive signal processing and adaptive filtering in a concise and straightforward main classes of adaptive filtering algorithms are presented in a unified framework, using clear notations that facilitate actual : Hardcover.\n\nOn Algorithms, Structures, and Implementations of Adaptive IIR Filters by Sergio Lima Netto Elec. Eng., Federal University of Rio de Janeiro,COPPE/Federal University of Rio de Janeiro, A Dissertation Submitted in Partial Fulfillment of the Requirements for the Degree of.\n\nChapter 11 deals with nonlinear adaptive filtering which consists of utilizing a nonlinear structure for the adaptive filter. The motivation is to use nonlinear adaptive filtering structures to better model some nonlinear phenomena commonly found in communications applications, such as nonlinear characteristics of power amplifier at Size: 7MB.\n\nIn this paper we examine the two-dimensional extensions of some popular adaptive lattice filters. Adaptation is based on either the normalized least mean squares “NLMS” or the fast recursive least squares “FRLS” algorithms.\n\nThese algorithms can update the filter coefficients in growing-order form with a moderate computational : X. Liu, M. Najim, M. Janati, H.\n\nYoulal. adaptive filtering algorithms that is least mean square (LMS), Normalized least mean square (NLMS),Time varying least mean square (TVLMS), Recursive least square (RLS), Fast Transversal Recursive least square (FTRLS).\n\nImplementation aspects of these algorithms, their computational complexity and Signal to Noise ratioCited by: Normalized least mean square-based adaptive sparse filtering algorithms for estimating multiple-input multiple-output channels Guan Gui 1*,LiXuand Fumiyuki Adachi2 1 Department of Electronics and Information Systems, Akita Prefectural University, Akita, Japan.\n\nAdaptive Filtering Fundamentals of Least Mean Squares with MATLABR Alexander D. Poularikas University of Alabama, Huntsville, AL CRCPress Taylor&FrancisCroup Boca Raton London NewYork CRCPressis animprintof the Taylor &Francis Croup,an informabusinessFile Size: KB. Keywords: adaptive filters, FIR, IIR, least pth norm algorithm, LTI, minimax, MATLAB.\n\nINTRODUCTION: In signal processing and control applications, the signals and the transfer functions of the system are time invariant and should be known at the design : a, narain. I'm studying the IIR filter design that is described in the book: Algorithms for the constrained design of digital filters with arbitrary phase and magnitude responses.\n\nYou can get the code at page (at least the main function), and here is an example of a filter design. Index Terms: least mean square, normalized least mean square, adaptive filter. noisy tone signal. Introduction Nowadays, the mechanisms for promoting active noise cancellation based on the utilization of different classes of adaptive filter have described by researchers as an alternative way for controlling the level of noise by.\n\nLeast-Squares Linear-Phase FIR Filter Design. Another versatile, effective, and often-used case is the weighted least squares method, which is implemented in the matlab function firls and others.\n\nA good general reference in this area is [].Let the FIR filter length be samples, with even, and suppose we'll initially design it to be centered about the time origin (zero phase''). This letter proposes a sequential selection normalized subband adaptive filter (SS-NSAF) in order to reduce the computational complexity.\n\nIn addition, a variable step-size algorithm is also proposed using the mean-square deviation analysis of the SS-NSAF. To enhance the performance in terms of the convergence speed, we propose an improved variable step-size SS-NSAF using a two-stage by: 3. Keywords: adaptive notch filter, all-pass filter, normalized lattice structure, mean square error, simplified lattice algorithm, Affine combination lattice algorithm 1.\n\nIntroduction Adaptive notch filters are the time-variant notch filters of which fre-quency characteristics, e.g. File Size: KB.\n\nThis book focuses on theoretical aspects of the affine projection algorithm (APA) for adaptive filtering. The APA is a natural generalization of the classical, normalized least-mean-squares (NLMS) algorithm. The book first explains how the APA evolved from the NLMS algorithm, where an.\n\nLeast-Squares Algorithms for Adaptive Equalizers By M. MUELLER (Manuscript received March 1 7, 1 ) Least-squares algorithms are the fastest converging algorithms for adaptive signal processors, such as adaptive equalizers.\n\nThe Kalman, fast Kalman., and. Optimal Design of the Adaptive Normalized Matched Filter Detector Abla Kammoun, Romain Couillet, Fre´de´ric Pascal, Mohamed-Slim Alouini Abstract—This article addresses improvements on the design of the adaptive normalized matched filter (ANMF) for File Size: KB.\n\nAdaptive filtering is a topic of immense practical and theoretical value, having applications in areas ranging from digital and wireless communications to biomedical systems. This book enables readers to gain a gradual and solid introduction to the subject, its applications to a variety of topical problems, existing limitations, and extensions of current theories.\n\nFast convergence rate and low computational complexity features are important issues for high data rate applications such as speech processing, echo cancelation, network echo cancelation, and channel equalization. The least-mean-squares (LMS) and the normalized LMS (NLMS) algo-rithms are useful for a wide range of adaptive filter applica-Cited by: 1.\n\nChapter 5 on the Method of Stochastic Gradient Descent is new. In Chapter 6 (the old Chapter 5) on the Lease—Mean-Square (LMS) algorithm, major changes have been made to the statistical learning theory of LMS in light of the Langevin equation and the related Brownian : On-line Supplement. Standard Recursive Least-Squares Algorithm Convergence Behavior of the RLS Algorithm Problems 13 Fast RLS Algorithms Least-Squares Forward Prediction Least-Squares Backward Prediction Least-Squares Lattice RLSL Algorithm FTRLS Algorithm Problems 14 Tracking You can write a book review and share your experiences.\n\nOther readers will always be interested in your opinion of the books you've read. Whether you've loved the book or not, if you give your honest and detailed thoughts then people will find new books that are right for them. ber of unknowns. This situation corresponds to an under-determined least-squares problem for which () will have an infinite number of solutions.\n\nDefinition (Least-squares problem) Given an N x 1 vector y and an N x M data matrix H, the least-squares problem seeks an M x 1 vector w that solves minlly — Hw LEAST-SQUARES PROBLEM.\n\nLeast-Squares Lattice (LSL) Predictor. Angle-Normalized Estimation Errors. First-Order State-Space Models for Lattice Filtering. QR-Decomposition—Based Least-Squares Lattice (QRD-LSL) Filters.\n\nFundamental Properties of the QRD-LSL FilterAvailability: Live. O(L), L is the FIR filter length. The other class of adaptive algorithm is the recursive least-squares (RLS) algorithm which minimizes a deterministic sum of squared errors .\n\nThe RLS algorithm solves this problem, but at the expense of increased computational complexity of O(L2). A large number of fast RLS (FRLS) algorithms have been developed.\n\nGeneral Derivative Implementation p. Adaptive Algorithms p. Recursive least-squares algorithm p. The Gauss-Newton algorithm p. Gradient-based algorithm p. Alternative Adaptive Filter Structures p. Cascade Form p. Lattice Structure p. Parallel Form p. Frequency-Domain Parallel Structure p.\n\n7 Adaptive Filters • Adaptive structures • The least mean squares (LMS) algorithm • Programming examples for noise cancellation and system identification using C code Adaptive filters are best used in cases where signal conditions or system parameters are slowly changing and the filter is to be adjusted to compensate for this change. R.\n\nMustafa, M. A. Mohd Ali, C. Umat and D. A. Al-Asady “Design and Implementation of Least Mean Square Adaptive Filter on Altera Cyclone II Field Programmable Gate Array for Active Noise Control” IEEE Symposium on Industrial Electronics and Applications, S.\n\nM. Kuo, X. Kong and W. S. Gan, “Applications of Adaptive.Adaptive filters are used in many diverse applications, appearing in everything from military instruments to cellphones and home appliances.\n\nAdaptive Filtering: Fundamentals of Least Mean Squares with MATLAB® covers the core concepts of this important field, focusing on a vital part of the statisti." ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.87624955,"math_prob":0.8616069,"size":14990,"snap":"2021-21-2021-25","text_gpt3_token_len":3070,"char_repetition_ratio":0.16815695,"word_repetition_ratio":0.026363635,"special_character_ratio":0.18472315,"punctuation_ratio":0.1109375,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.95627934,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-06-19T21:17:04Z\",\"WARC-Record-ID\":\"<urn:uuid:f59d745e-b1e9-4ee1-aeac-96dd90822ee5>\",\"Content-Length\":\"30098\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:ffe69d8d-1f6c-4778-b0b6-37c8bb52ad91>\",\"WARC-Concurrent-To\":\"<urn:uuid:4d065c89-0379-4989-a3d6-a328889ec8d3>\",\"WARC-IP-Address\":\"172.67.131.24\",\"WARC-Target-URI\":\"https://fepevybydexuvu.menards.club/fast-implementation-of-the-normalized-least-squares-lattice-adaptive-digital-filter-book-9597cn.php\",\"WARC-Payload-Digest\":\"sha1:VCTG22S4IDOUP6YS2M4ITAIJX2UC47BF\",\"WARC-Block-Digest\":\"sha1:WEI67CWPFUGOMRMAFWQYFFRCQ3IA6EY4\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-25/CC-MAIN-2021-25_segments_1623487649731.59_warc_CC-MAIN-20210619203250-20210619233250-00476.warc.gz\"}"}
https://www.healthknowledge.org.uk/public-health-textbook/research-methods/1b-statistical-methods/mldap
[ "# Measures of Location and Dispersion and their appropriate uses\n\n## Measures of Location and Dispersion and their appropriate uses\n\n### Statistics: Measures of location and dispersion\n\nThis section covers\n\n•        Mean\n•        Median\n•        Mode\n•        Range\n•        Interquartile Range\n•        Standard deviation\n\nMeasures of Location\n\nMeasures of location describe the central tendency of the data. They include the mean, median and mode.\n\nMean or Average\n\nThe (arithmetic) mean, or average, of n observations", null, "(pronounced “x bar”) is simply the sum of the observations divided by the number of observations; thus:\n\n$\\bar x = \\frac{{{\\rm{Sum\\;of\\;all\\;sample\\;values}}}}{{{\\rm{Sample\\;size}}}} = \\;\\frac{{\\sum {x_i}}}{n}$\n\nIn this equation, xi represents the individual sample values and Σxi their sum. The Greek letter 'Σ' (sigma) is the Greek capital 'S' and stands for 'sum'. Their calculation is described in example 1, below.\n\nMedian\n\nThe median is defined as the middle point of the ordered data. It is estimated by first ordering the data from smallest to largest, and then counting upwards for half the observations. The estimate of the median is either the observation at the centre of the ordering in the case of an odd number of observations, or the simple average of the middle two observations if the total number of observations is even. More specifically, if there are an odd number of observations, it is the [(n+1)/2]th observation, and if there are an even number of observations, it is the average of the [n/2]th and the [(n/2)+1]th observations.\n\nExample 1 Calculation of mean and median\n\nConsider the following 5 birth weights, in kilograms, recorded to 1 decimal place:\n\n1.2, 1.3, 1.4, 1.5, 2.1\n\nThe mean is defined as the sum of the observations divided by the number of observations. Thus mean = (1.2+1.3+…+2.1)/5 = 1.50kg. It is usual to quote 1 more decimal place for the mean than the data recorded.\n\nThere are 5 observations, which is an odd number, so the median value is the (5+1)/2 = 3rd observation, which is 1.4kg. Remember that if the number of observations was even, then the median is defined as the average of the [n/2]th and the [(n/2)+1]th. Thus, if we had observed an additional value of 3.5kg in the birth weights sample, the median would be the average of the 3rd and the 4th observation in the ranking, namely the average of 1.4 and 1.5, which is 1.45kg.\n\nThe major advantage of the mean is that it uses all the data values, and is, in a statistical sense, efficient.\n\nThe main disadvantage of the mean is that it is vulnerable to outliers. Outliers are single observations which, if excluded from the calculations, have noticeable influence on the results. For example, if we had entered '21' instead of '2.1' in the calculation of the mean in Example 1, we would find the mean changed from 1.50kg to 7.98kg. It does not necessarily follow, however, that outliers should be excluded from the final data summary, or that they always result from an erroneous measurement.\n\nThe median has the advantage that it is not affected by outliers, so for example the median in the example would be unaffected by replacing '2.1' with '21'. However, it is not statistically efficient, as it does not make use of all the individual data values.\n\nMode\n\nA third measure of location is the mode. This is the value that occurs most frequently, or, if the data are grouped, the grouping with the highest frequency. It is not used much in statistical analysis, since its value depends on the accuracy with which the data are measured; although it may be useful for categorical data to describe the most frequent category. The expression 'bimodal' distribution is used to describe a distribution with two peaks in it. This can be caused by mixing populations. For example, height might appear bimodal if one had men and women on the population. Some illnesses may raise a biochemical measure, so in a population containing healthy and ill people one might expect a bimodal distribution. However, some illnesses are defined by the measure (e.g. obesity or high blood pressure) and in this case the distributions are usually unimodal.\n\nMeasures of Dispersion or Variability\n\nMeasures of dispersion describe the spread of the data. They include the range, interquartile range, standard deviation and variance.\n\nRange and Interquartile Range\n\nThe range is given as the smallest and largest observations. This is the simplest measure of variability. Note in statistics (unlike physics) a range is given by two numbers, not the difference between the smallest and largest. For some data it is very useful, because one would want to know these numbers, for example knowing in a sample the ages of youngest and oldest participant. If outliers are present it may give a distorted impression of the variability of the data, since only two observations are included in the estimate.\n\nQuartiles and Interquartile Range\n\nThe quartiles, namely the lower quartile, the median and the upper quartile, divide the data into four equal parts; that is there will be approximately equal numbers of observations in the four sections (and exactly equal if the sample size is divisible by four and the measures are all distinct). Note that there are in fact only three quartiles and these are points not proportions. It is a common misuse of language to refer to being ‘in the top quartile’. Instead one should refer to being ‘in the top quarter or ‘above the top quartile’. However, the meaning of the first statement is clear and so the distinction is really only useful to display a superior knowledge of statistics! The quartiles are calculated in a similar way to the median; first arrange the data in size order and determine the median, using the method described above. Now split the data in two (the lower half and upper half, based on the median). The first quartile is the middle observation of the lower half, and the third quartile is the middle observation of the upper half. This process is demonstrated in Example 2, below.\n\nThe interquartile range is a useful measure of variability and is given by the lower and upper quartiles. The interquartile range is not vulnerable to outliers and, whatever the distribution of the data, we know that 50% of observations lie within the interquartile range.\n\nExample 2 Calculation of the quartiles\n\nSuppose we had 18 birth weights arranged in increasing order.\n\n1.51, 1.53. 1.55, 1.55, 1.79. 1.81, 2.10, 2.15, 2.18,\n\n2.22, 2.35, 2.37, 2.40, 2.40, 2.45, 2.78. 2.81, 2.85.\n\nThe median is the average of the 9th and 10th observations (2.18+2.22)/2 = 2.20 kg. The first half of the data has 9 observations so the first quartile is the 5th observation, namely 1.79kg. Similarly the 3rd quartile would be the 5th observation in the upper half of the data, or the 14th observation, namely 2.40 kg. Hence the interquartile range is 1.79 to 2.40 kg.\n\nStandard Deviation and Variance\n\nThe standard deviation of a sample (s) is calculated as follows:\n\n$s = \\;\\sqrt {\\frac{{\\sum {{\\left( {{x_i} - \\bar x} \\right)}^2}}}{{n - 1}}}$\n\nThe expression ∑(xi -", null, ")2 is interpreted as: from each individual observation (xi) subtract the mean (", null, "), then square this difference. Next add each of the n squared differences. This sum is then divided by (n-1). This expression is known as the sample variance (s2). The variance is expressed in square units, so we take the square root to return to the original units, which gives the standard deviation, s. Examining this expression it can be seen that if all the observations were the same (i.e. x1 = x2 = x3 ... = xn), then they would equal the mean, and so s would be zero. If the x's were widely scattered about, then s would be large. In this way, s reflects the variability in the data. The calculation of the standard deviation is described in Example 3. The standard deviation is vulnerable to outliers, so if the 2.1 was replace by 21 in Example 3 we would get a very different result.\n\nExample 3 Calculation of the standard deviation\n\nConsider the data from example 1. The calculations required to determine the sum of the squared differences from the mean are given in Table 1, below. We found the mean to be 1.5kg. We subtract this from each of the observations. Note the mean of this column is zero. This will always be the case: the positive deviations from the mean cancel the negative ones. A convenient method for removing the negative signs is squaring the deviations, which is given in the next column. These values are then summed to get a value of 0.50 kg2. We need to find the average squared deviation. Common-sense would suggest dividing by n, but it turns out that this actually gives an estimate of the population variance, which is too small. This is because we are using the estimated mean", null, "in the calculation and we should really be using the true population mean. It can be shown that it is better to divide by the degrees of freedom, which is n minus the number of estimated parameters, in this case n-1. An intuitive way of looking at this is to suppose one had n telephone poles each 100 meters apart. How much wire would one need to link them? As with variation, here we are not interested in where the telegraph poles are, but simply how far apart they are. A moment's thought should convince one that n-1 lengths of wire are required to link n telegraph poles.\n\nTable 1 Calculation of the mean squared deviation", null, "From the results calculated thus far, we can determine the variance and standard deviation, as follows:\n\nn = 5\n\nVariance = 0.50/(5-1) = 0.125 kg2\n\nStandard deviation = √(0.125) = 0.35 kg\n\nWhy is the standard deviation useful?\n\nIt turns out in many situations that about 95% of observations will be within two standard deviations of the mean, known as a reference interval. It is this characteristic of the standard deviation which makes it so useful. It holds for a large number of measurements commonly made in medicine. In particular, it holds for data that follow a Normal distribution. Standard deviations should not be used for highly skewed data, such as counts or bounded data, since they do not illustrate a meaningful measure of variation, and instead an IQR or range should be used. In particular, if the standard deviation is of a similar size to the mean, then the SD is not an informative summary measure, save to indicate that the data are skewed.\n\nStandard deviation is often abbreviated to SD in the medical literature.\n\nReference\n\n•        Campbell MJ, Machin D and Walters SJ. Medical Statistics: a Commonsense Approach 4th ed. Chichester: Wiley-Blackwell 2007\n\n© MJ Campbell 2016, S Shantikumar 2016" ]
[ null, "https://www.healthknowledge.org.uk/sites/default/files/documents/publichealthtextbook/statistics/meanx2.gif", null, "https://www.healthknowledge.org.uk/sites/default/files/documents/publichealthtextbook/statistics/meanx2.gif", null, "https://www.healthknowledge.org.uk/sites/default/files/documents/publichealthtextbook/statistics/meanx2.gif", null, "https://www.healthknowledge.org.uk/sites/default/files/documents/publichealthtextbook/statistics/meanx2.gif", null, "https://www.healthknowledge.org.uk/sites/default/files/documents/publichealthtextbook/statistics/sdtable.png", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.93351245,"math_prob":0.9894894,"size":10598,"snap":"2020-45-2020-50","text_gpt3_token_len":2517,"char_repetition_ratio":0.16745327,"word_repetition_ratio":0.031093836,"special_character_ratio":0.2364597,"punctuation_ratio":0.12901723,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99900013,"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,4,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-11-30T05:10:55Z\",\"WARC-Record-ID\":\"<urn:uuid:38b44612-b557-49ac-9a7d-90b104649913>\",\"Content-Length\":\"93920\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:70afc070-3ea6-4fd5-82eb-0aede1ca1632>\",\"WARC-Concurrent-To\":\"<urn:uuid:9b7f0f5b-f195-4518-9510-6a0ae97db951>\",\"WARC-IP-Address\":\"23.185.0.2\",\"WARC-Target-URI\":\"https://www.healthknowledge.org.uk/public-health-textbook/research-methods/1b-statistical-methods/mldap\",\"WARC-Payload-Digest\":\"sha1:HPNWXYQKVL4J3ALBWTGC6NWKU6DM7P5L\",\"WARC-Block-Digest\":\"sha1:AK46IEOBBLNSRUSHZZMIG4JZZDOGIJG4\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-50/CC-MAIN-2020-50_segments_1606141205147.57_warc_CC-MAIN-20201130035203-20201130065203-00664.warc.gz\"}"}
https://www.gradesaver.com/textbooks/math/trigonometry/CLONE-68cac39a-c5ec-4c26-8565-a44738e90952/chapter-7-applications-of-trigonometry-and-vectors-section-7-2-the-ambiguous-case-of-the-law-of-sines-7-2-exercises-page-311/38
[ "## Trigonometry (11th Edition) Clone\n\nThe heading of $Z$ from $X$ is $~~75^{\\circ}$ The distance $YZ$ is $~~273.6~miles$\nThe points $X$, $Y,$ and $Z$ form a triangle. We can find $\\angle XYZ$: $\\angle XYZ = 35^{\\circ}+(180^{\\circ}-145^{\\circ}) = 70^{\\circ}$ Since $XY = XZ = 400~mi$, the triangle is an isosceles triangle. Then $\\angle XZY = \\angle XYZ = 70^{\\circ}$ We can find $\\angle YXZ$: $\\angle YXZ = 180^{\\circ} - \\angle XYZ - \\angle XZY$ $\\angle YXZ = 180^{\\circ} - 70^{\\circ} - 70^{\\circ}$ $\\angle YXZ = 40^{\\circ}$ We can find the heading of $Z$ from $X$: $35^{\\circ}+40^{\\circ} = 75^{\\circ}$ The heading of $Z$ from $X$ is $~~75^{\\circ}$ We can find the distance $YZ$: $\\frac{YZ}{sin~\\angle YXZ} = \\frac{XY}{sin~\\angle XZY}$ $YZ = \\frac{XY~sin~\\angle YXZ}{sin~\\angle XZY}$ $YZ = \\frac{400~sin~40^{\\circ}}{sin~70^{\\circ}}$ $YZ = 273.6~mi$ The distance $YZ$ is $~~273.6~miles$" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.59542054,"math_prob":1.0000099,"size":872,"snap":"2022-27-2022-33","text_gpt3_token_len":354,"char_repetition_ratio":0.22926268,"word_repetition_ratio":0.09375,"special_character_ratio":0.46100917,"punctuation_ratio":0.07100592,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":1.00001,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-07-02T17:29:25Z\",\"WARC-Record-ID\":\"<urn:uuid:7c566c0f-22f6-4888-9d21-44fba0da01d9>\",\"Content-Length\":\"74215\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:2cd54028-be2e-4efa-84f1-ea5eef4a4004>\",\"WARC-Concurrent-To\":\"<urn:uuid:f02f8625-f80c-4fa2-a2ec-8b36f295cdc1>\",\"WARC-IP-Address\":\"100.25.243.4\",\"WARC-Target-URI\":\"https://www.gradesaver.com/textbooks/math/trigonometry/CLONE-68cac39a-c5ec-4c26-8565-a44738e90952/chapter-7-applications-of-trigonometry-and-vectors-section-7-2-the-ambiguous-case-of-the-law-of-sines-7-2-exercises-page-311/38\",\"WARC-Payload-Digest\":\"sha1:GY2QV5IKKOO3NOMUUGGACQFCLDC67KNT\",\"WARC-Block-Digest\":\"sha1:4DYWA2BUEUOVAKW2STDIUYHMKZTWSZHZ\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-27/CC-MAIN-2022-27_segments_1656104189587.61_warc_CC-MAIN-20220702162147-20220702192147-00539.warc.gz\"}"}
https://codereview.stackexchange.com/questions/208662/given-some-integers-find-triplets-where-the-product-of-two-numbers-equals-the-t
[ "# Given some integers, find triplets where the product of two numbers equals the third number\n\nI am trying to solve a coding challenge:\n\nGiven N integers A1, A2, …, AN, count the number of triplets (x, y, z) (with 1 ≤ x < y < zN) such that at least one of the following is true:\n\nAx = Ay × Az, and/or\nAy = Ax × Az, and/or\nAz = Ax × Ay\n\n### Sample case 1\n\n5 2 4 6 3 1\n\nIn Sample Case #1, the only triplet satisfying the condition given in the problem statement is (2, 4, 5). The triplet is valid since the second, fourth, and fifth integers are 2, 6, and 3, and 2 × 3 = 6. thus the answer here is 1.\n\n### Sample case 2\n\n2 4 8 16 32 64\n\nThe six triplets satisfying the condition given in the problem statement are: (1, 2, 3), (1, 3, 4), (1, 4, 5), (1, 5, 6), (2, 3, 5), (2, 4, 6). so the answer here is 6.\n\nMy Code in python:\n\nimport itertools\ncount=0\nfor t in itertools.combinations(l,3):\nif t*t==t or t*t==t or t*t==t:\ncount+=1\nprint(count)\n\n\nThis is the naive way of generating all possible 3 length combinations and checking for the condition. This works fine for smaller input but when the inout size increase time complexity increases. I am assuming for an example that has 1,2,3,6,8 the combinations generated are (2,3,6),(2,3,8) 2,3,6 satisfy the condition so the checking for 2,3,8 is unnecessary and can be avoided. How can I modify my code to take advantage of this observation ?\n\n• – Martin R Nov 29 '18 at 6:16\n\nYour combinations(…, 3) loop makes your algorithm O(N3).\n\nIt's easy to improve it to be O(N2). The question is, essentially: for every pair of entries, how many occurrences of their product are in the list? So, make an indexes data structure to help you find, in O(1) time, where the product might be located.\n\nfrom collections import defaultdict\nfrom itertools import combinations\n\na = [int(ai) for ai in input('Input: ').split()]\n\nindexes = defaultdict(set)\nfor i, ai in enumerate(a):\n\ntriplets = set()\nfor x, y in combinations(range(len(a)), 2):\nfor z in indexes[a[x] * a[y]].difference([x, y]):\n\nprint(len(triplets))\n\n\nHere, I've chosen to stick closer to the notation used in the challenge itself, with a being the list, and x, y, z as the indexes of entries (but 0-based rather than 1-based).\n\n• Can you add few examples – Rohit Nov 30 '18 at 16:59\n• Examples of what? – 200_success Nov 30 '18 at 17:12\n• How would this logic work for [1,1,1,1] and [5,2,4,6,3,1] – Rohit Nov 30 '18 at 17:15\n• You're right: the code in Rev 1 broke in the case of [1, 1, 1, 1], giving 12 instead of 4 because it was counting all permutations of (x, y, z). – 200_success Nov 30 '18 at 18:04\n\nYour answer is a faithful implementation of the problem description. Unfortunately, that makes it $$\\O(N^3)\\$$\n\n200_success has described an $$\\O(N^2)\\$$ solution to this problem; I’m thinking we can do a little better, perhaps not as good as $$\\O(N \\log N)\\$$, but maybe close.\n\nWe’ve not been asked to find the tuples (x,y,z), x < y < z, which satisfy that A[x],A[y],A[z] represent (in any order) multiplier, multiplicand, and product; we’ve been asked to find only the number of such tuples. This means we can change the order of values in A[], reindex the A[] array, or even change the representation of A[] to a list of value, count pairs, and still obtain the same answer.\n\nThe first step should be to sort the A[] values. $$\\O(N \\log N)\\$$. This guarantees A[x] ≤ A[y] ≤ A[z], when x < y < z, and we now only need to look for tuples where A[x]*A[y]=A[z].\n\nWe can loop for x in range(N-2) and for y in range(x+1, N-1), and find the product’s indexes in the manner suggested by 200_success, but now we can break out of the inner loop when A[x]*A[y] > A_max, and break the outer loop when A[x]*A[x+1] > A_max, which should reduce the number of iterations significantly.\n\nBut again we really don’t care what the indices are which correspond to the product. We only care about how many there are. So after sorting A[], we can count the number of occurrences of each unique value C[], and eliminate the duplicates from A[]. If C[p] > 0 for p = A[x] * A[y], then the number of tuples for that multiplier, multiplicand, product combination is C[A[x]] * C[A[y]] * C[p], if A[x] ≠ 1. When A[x]=1, then p=A[y] for all x<y, and the number of tuples for these combinations is C * C[p] * (C[p]-1)/2. In addition, there are C * (C-1) * (C-2)/6 combinations of 1*1=1. Lastly, we need to count any combinations of bases and their squares: p = A[x] * A[x] which is C[p] * C[A[x]] * (C[A[x]]-1)/2.\n\nfrom collections import Counter\n\ndef tuple_products(*A):\nc = Counter(A) # Record # of duplicates\nA = sorted(c) # Sorted list of unique values\n\nlargest = A[-1] # For early loop termination\n\ntriplets = 0 # Number of product triplets\n\n# Handle (1, A[y], A[y]) triplets first\nif A == 1:\n\nc1 = c # Number of 1's\n\n# Number of (1, 1, 1) triplets\ntriplets += c1 * (c1-1) * (c1-2) // 6\n\nA = A[1:] # Remove 1 from A list and\ndel c # from count dictionary\n\n# Number of (1, A[y], A[y]) triplets (A[y] != 1)\ntriplets += c1 * sum(cy * (cy-1) for cy in c.values()) // 2\n\n# Handle (A[x], A[y], A[z]) triplets (A[x] != 1)\nfor x, ax in enumerate(A[:-1]):\n\n# Break outer loop if beyond possible products\nsquare = ax*ax\nif square > largest:\nbreak\n\n# Number of (A[x], A[x], A[x]^2) triplets\ncx = c[ax]\ntriplets += cx * (cx-1) * c[square] // 2\n\n# Handle (A[x], A[y], A[z]) triplets\nfor ay in A[x+1:-1]:\n\n# Break inner loop when beyond possible products\nproduct = ax*ay\nif product > largest:\nbreak\n\n# Number of (A[x], A[y], A[z]) triplets\ntriplets += cx * c[ay] * c[product]\n\nprint(triplets)\n\ntuple_products(4,4,4,4,16)\ntuple_products(5,2,4,6,3,1)\ntuple_products(2,4,8,16,32,64)\ntuple_products(1,1,1,1)\ntuple_products(8,1,1,4,2,1,4,1,2)\n\n\nWe are still $$\\O(N^2)\\$$, but we’ve made N smaller by eliminating any duplicate numbers, and eliminated many of the $$\\N^2\\$$ combinations by sorting and breaking out of the loops early. Can we do any better? I think so. Here’s why:\n\nConsider the numbers 3, 5, 7, 8, 9, 10, 11, 14, 36, 42, 45. The outer loop would start at x=0, A[x]=3. The inner loop would start at y=1, A[y]=5, with the product product=3*5=15. Since A[] is sorted, we can perform a bisection search for the 15 and find the next number higher than 15, which is 36. Dividing 36/A[x] gives us 12, performing a bisection search, and getting the next higher number retrieves 14. Multiplying A[x]*14 gives us 42, which can actually be found in the A[] list. Advancing past 14 takes us to 36 and 3*36 is greater than the maximum so we can break out of the inner loop. Using this bisection search technique has skipped over the numbers 7, 8, 9, 10, and 11. I think this means we’ve got log N numbers in each inner loop, and a log N bisection search giving an inner loop complexity of $$\\O(log^2 N)\\$$, which combined with the outer loop gives $$\\O(N \\log^2 N)\\$$. I think." ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.8268992,"math_prob":0.9950415,"size":4245,"snap":"2020-34-2020-40","text_gpt3_token_len":1374,"char_repetition_ratio":0.12520632,"word_repetition_ratio":0.033419024,"special_character_ratio":0.35147232,"punctuation_ratio":0.14185815,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.998031,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-08-13T17:49:02Z\",\"WARC-Record-ID\":\"<urn:uuid:c9be4d1f-9f29-4322-b4d2-01ba3e579298>\",\"Content-Length\":\"167373\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:dbafef52-4539-432f-a733-b767525c09df>\",\"WARC-Concurrent-To\":\"<urn:uuid:5b79659a-570e-41aa-8da2-2cf70b23dac0>\",\"WARC-IP-Address\":\"151.101.193.69\",\"WARC-Target-URI\":\"https://codereview.stackexchange.com/questions/208662/given-some-integers-find-triplets-where-the-product-of-two-numbers-equals-the-t\",\"WARC-Payload-Digest\":\"sha1:YB77MX3CJLDVHD74BS5N6UQJISPQWYNC\",\"WARC-Block-Digest\":\"sha1:PVUH5P7XVKN7UCVRB3IMWD762ULPAOL5\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-34/CC-MAIN-2020-34_segments_1596439739048.46_warc_CC-MAIN-20200813161908-20200813191908-00326.warc.gz\"}"}
https://docs.opencv.org/4.1.1/dc/db1/tutorial_dnn_custom_layers.html
[ "", null, "OpenCV  4.1.1 Open Source Computer Vision\nCustom deep learning layers support\n\n## Introduction\n\nDeep learning is a fast growing area. The new approaches to build neural networks usually introduce new types of layers. They could be modifications of existing ones or implement outstanding researching ideas.\n\nOpenCV gives an opportunity to import and run networks from different deep learning frameworks. There are a number of the most popular layers. However you can face a problem that your network cannot be imported using OpenCV because of unimplemented layers.\n\nThe first solution is to create a feature request at https://github.com/opencv/opencv/issues mentioning details such a source of model and type of new layer. A new layer could be implemented if OpenCV community shares this need.\n\nThe second way is to define a custom layer so OpenCV's deep learning engine will know how to use it. This tutorial is dedicated to show you a process of deep learning models import customization.\n\n## Define a custom layer in C++\n\nDeep learning layer is a building block of network's pipeline. It has connections to input blobs and produces results to output blobs. There are trained weights and hyper-parameters. Layers' names, types, weights and hyper-parameters are stored in files are generated by native frameworks during training. If OpenCV mets unknown layer type it throws an exception trying to read a model:\n\nUnspecified error: Can't create layer \"layer_name\" of type \"MyType\" in function getLayerInstance\n\nTo import the model correctly you have to derive a class from cv::dnn::Layer with the following methods:\n\nclass MyLayer : public cv::dnn::Layer\n{\npublic:\nMyLayer(const cv::dnn::LayerParams &params);\nvirtual bool getMemoryShapes(const std::vector<std::vector<int> > &inputs,\nconst int requiredOutputs,\nstd::vector<std::vector<int> > &outputs,\nstd::vector<std::vector<int> > &internals) const CV_OVERRIDE;\nvirtual void forward(cv::InputArrayOfArrays inputs,\ncv::OutputArrayOfArrays internals) CV_OVERRIDE;\nvirtual void finalize(cv::InputArrayOfArrays inputs,\ncv::OutputArrayOfArrays outputs) CV_OVERRIDE;\n};\n\nAnd register it before the import:\n\n#include <opencv2/dnn/layer.details.hpp> // CV_DNN_REGISTER_LAYER_CLASS\n{\nCV_DNN_REGISTER_LAYER_CLASS(Interp, InterpLayer);\n// ...\nNote\nMyType is a type of unimplemented layer from the thrown exception.\n\nLet's see what all the methods do:\n\n• Constructor\nMyLayer(const cv::dnn::LayerParams &params);\n\nRetrieves hyper-parameters from cv::dnn::LayerParams. If your layer has trainable weights they will be already stored in the Layer's member cv::dnn::Layer::blobs.\n\n• A static method create\n\nThis method should create an instance of you layer and return cv::Ptr with it.\n\n• Output blobs' shape computation\nvirtual bool getMemoryShapes(const std::vector<std::vector<int> > &inputs,\nconst int requiredOutputs,\nstd::vector<std::vector<int> > &outputs,\nstd::vector<std::vector<int> > &internals) const CV_OVERRIDE;\n\nReturns layer's output shapes depends on input shapes. You may request an extra memory using internals.\n\n• Run a layer\nvirtual void forward(cv::InputArrayOfArrays inputs,\n\nImplement a layer's logic here. Compute outputs for given inputs.\n\nNote\nOpenCV manages memory allocated for layers. In the most cases the same memory can be reused between layers. So your forward implementation should not rely that the second invocation of forward will has the same data at outputs and internals.\n• Optional finalize method\nvirtual void finalize(cv::InputArrayOfArrays inputs,\n\nThe chain of methods are the following: OpenCV deep learning engine calls create method once then it calls getMemoryShapes for an every created layer then you can make some preparations depends on known input dimensions at cv::dnn::Layer::finalize. After network was initialized only forward method is called for an every network's input.\n\nNote\nVarying input blobs' sizes such height or width or batch size you make OpenCV reallocate all the internal memory. That leads efficiency gaps. Try to initialize and deploy models using a fixed batch size and image's dimensions.\n\n## Example: custom layer from Caffe\n\nLet's create a custom layer Interp from https://github.com/cdmh/deeplab-public. It's just a simple resize that takes an input blob of size N x C x Hi x Wi and returns an output blob of size N x C x Ho x Wo where N is a batch size, C is a number of channels, Hi x Wi and Ho x Wo are input and output height x width correspondingly. This layer has no trainable weights but it has hyper-parameters to specify an output size.\n\nIn example,\n\nlayer {\nname: \"output\"\ntype: \"Interp\"\nbottom: \"input\"\ntop: \"output\"\ninterp_param {\nheight: 9\nwidth: 8\n}\n}\n\nThis way our implementation can look like:\n\nclass InterpLayer : public cv::dnn::Layer\n{\npublic:\nInterpLayer(const cv::dnn::LayerParams &params) : Layer(params)\n{\noutWidth = params.get<int>(\"width\", 0);\noutHeight = params.get<int>(\"height\", 0);\n}\n{\nreturn cv::Ptr<cv::dnn::Layer>(new InterpLayer(params));\n}\nvirtual bool getMemoryShapes(const std::vector<std::vector<int> > &inputs,\nconst int requiredOutputs,\nstd::vector<std::vector<int> > &outputs,\nstd::vector<std::vector<int> > &internals) const CV_OVERRIDE\n{\nCV_UNUSED(requiredOutputs); CV_UNUSED(internals);\nstd::vector<int> outShape(4);\noutShape = inputs; // batch size\noutShape = inputs; // number of channels\noutShape = outHeight;\noutShape = outWidth;\noutputs.assign(1, outShape);\nreturn false;\n}\n// Implementation of this custom layer is based on https://github.com/cdmh/deeplab-public/blob/master/src/caffe/layers/interp_layer.cpp\nvirtual void forward(cv::InputArrayOfArrays inputs_arr,\ncv::OutputArrayOfArrays internals_arr) CV_OVERRIDE\n{\nif (inputs_arr.depth() == CV_16S)\n{\n// In case of DNN_TARGET_OPENCL_FP16 target the following method\n// converts data from FP16 to FP32 and calls this forward again.\nforward_fallback(inputs_arr, outputs_arr, internals_arr);\nreturn;\n}\nstd::vector<cv::Mat> inputs, outputs;\ninputs_arr.getMatVector(inputs);\noutputs_arr.getMatVector(outputs);\ncv::Mat& inp = inputs;\ncv::Mat& out = outputs;\nconst float* inpData = (float*)inp.data;\nfloat* outData = (float*)out.data;\nconst int batchSize = inp.size;\nconst int numChannels = inp.size;\nconst int inpHeight = inp.size;\nconst int inpWidth = inp.size;\nconst float rheight = (outHeight > 1) ? static_cast<float>(inpHeight - 1) / (outHeight - 1) : 0.f;\nconst float rwidth = (outWidth > 1) ? static_cast<float>(inpWidth - 1) / (outWidth - 1) : 0.f;\nfor (int h2 = 0; h2 < outHeight; ++h2)\n{\nconst float h1r = rheight * h2;\nconst int h1 = static_cast<int>(h1r);\nconst int h1p = (h1 < inpHeight - 1) ? 1 : 0;\nconst float h1lambda = h1r - h1;\nconst float h0lambda = 1.f - h1lambda;\nfor (int w2 = 0; w2 < outWidth; ++w2)\n{\nconst float w1r = rwidth * w2;\nconst int w1 = static_cast<int>(w1r);\nconst int w1p = (w1 < inpWidth - 1) ? 1 : 0;\nconst float w1lambda = w1r - w1;\nconst float w0lambda = 1.f - w1lambda;\nconst float* pos1 = inpData + h1 * inpWidth + w1;\nfloat* pos2 = outData + h2 * outWidth + w2;\nfor (int c = 0; c < batchSize * numChannels; ++c)\n{\npos2 =\nh0lambda * (w0lambda * pos1 + w1lambda * pos1[w1p]) +\nh1lambda * (w0lambda * pos1[h1p * inpWidth] + w1lambda * pos1[h1p * inpWidth + w1p]);\npos1 += inpWidth * inpHeight;\npos2 += outWidth * outHeight;\n}\n}\n}\n}\nprivate:\nint outWidth, outHeight;\n};\n\nNext we need to register a new layer type and try to import the model.\n\nCV_DNN_REGISTER_LAYER_CLASS(Interp, InterpLayer);\n\n## Example: custom layer from TensorFlow\n\nThis is an example of how to import a network with tf.image.resize_bilinear operation. This is also a resize but with an implementation different from OpenCV's or Interp above.\n\nLet's create a single layer network:\n\ninp = tf.placeholder(tf.float32, [2, 3, 4, 5], 'input')\nresized = tf.image.resize_bilinear(inp, size=[9, 8], name='resize_bilinear')\n\nOpenCV sees that TensorFlow's graph in the following way:\n\nnode {\nname: \"input\"\nop: \"Placeholder\"\nattr {\nkey: \"dtype\"\nvalue {\ntype: DT_FLOAT\n}\n}\n}\nnode {\nname: \"resize_bilinear/size\"\nop: \"Const\"\nattr {\nkey: \"dtype\"\nvalue {\ntype: DT_INT32\n}\n}\nattr {\nkey: \"value\"\nvalue {\ntensor {\ndtype: DT_INT32\ntensor_shape {\ndim {\nsize: 2\n}\n}\ntensor_content: \"\\t\\000\\000\\000\\010\\000\\000\\000\"\n}\n}\n}\n}\nnode {\nname: \"resize_bilinear\"\nop: \"ResizeBilinear\"\ninput: \"input:0\"\ninput: \"resize_bilinear/size\"\nattr {\nkey: \"T\"\nvalue {\ntype: DT_FLOAT\n}\n}\nattr {\nkey: \"align_corners\"\nvalue {\nb: false\n}\n}\n}\nlibrary {\n}\n\nCustom layers import from TensorFlow is designed to put all layer's attr into cv::dnn::LayerParams but input Const blobs into cv::dnn::Layer::blobs. In our case resize's output shape will be stored in layer's blobs.\n\nclass ResizeBilinearLayer CV_FINAL : public cv::dnn::Layer\n{\npublic:\nResizeBilinearLayer(const cv::dnn::LayerParams &params) : Layer(params)\n{\nCV_Assert(!params.get<bool>(\"align_corners\", false));\nCV_Assert(!blobs.empty());\nfor (size_t i = 0; i < blobs.size(); ++i)\nCV_Assert(blobs[i].type() == CV_32SC1);\n// There are two cases of input blob: a single blob which contains output\n// shape and two blobs with scaling factors.\nif (blobs.size() == 1)\n{\nCV_Assert(blobs.total() == 2);\noutHeight = blobs.at<int>(0, 0);\noutWidth = blobs.at<int>(0, 1);\nfactorHeight = factorWidth = 0;\n}\nelse\n{\nCV_Assert(blobs.size() == 2); CV_Assert(blobs.total() == 1); CV_Assert(blobs.total() == 1);\nfactorHeight = blobs.at<int>(0, 0);\nfactorWidth = blobs.at<int>(0, 0);\noutHeight = outWidth = 0;\n}\n}\n{\nreturn cv::Ptr<cv::dnn::Layer>(new ResizeBilinearLayer(params));\n}\nvirtual bool getMemoryShapes(const std::vector<std::vector<int> > &inputs,\nconst int,\nstd::vector<std::vector<int> > &outputs,\nstd::vector<std::vector<int> > &) const CV_OVERRIDE\n{\nstd::vector<int> outShape(4);\noutShape = inputs; // batch size\noutShape = inputs; // number of channels\noutShape = outHeight != 0 ? outHeight : (inputs * factorHeight);\noutShape = outWidth != 0 ? outWidth : (inputs * factorWidth);\noutputs.assign(1, outShape);\nreturn false;\n}\nvirtual void finalize(cv::InputArrayOfArrays, cv::OutputArrayOfArrays outputs_arr) CV_OVERRIDE\n{\nstd::vector<cv::Mat> outputs;\noutputs_arr.getMatVector(outputs);\nif (!outWidth && !outHeight)\n{\noutHeight = outputs.size;\noutWidth = outputs.size;\n}\n}\n// This implementation is based on a reference implementation from\n// https://github.com/tensorflow/tensorflow/blob/master/tensorflow/contrib/lite/kernels/internal/reference/reference_ops.h\nvirtual void forward(cv::InputArrayOfArrays inputs_arr,\ncv::OutputArrayOfArrays internals_arr) CV_OVERRIDE\n{\nif (inputs_arr.depth() == CV_16S)\n{\n// In case of DNN_TARGET_OPENCL_FP16 target the following method\n// converts data from FP16 to FP32 and calls this forward again.\nforward_fallback(inputs_arr, outputs_arr, internals_arr);\nreturn;\n}\nstd::vector<cv::Mat> inputs, outputs;\ninputs_arr.getMatVector(inputs);\noutputs_arr.getMatVector(outputs);\ncv::Mat& inp = inputs;\ncv::Mat& out = outputs;\nconst float* inpData = (float*)inp.data;\nfloat* outData = (float*)out.data;\nconst int batchSize = inp.size;\nconst int numChannels = inp.size;\nconst int inpHeight = inp.size;\nconst int inpWidth = inp.size;\nfloat heightScale = static_cast<float>(inpHeight) / outHeight;\nfloat widthScale = static_cast<float>(inpWidth) / outWidth;\nfor (int b = 0; b < batchSize; ++b)\n{\nfor (int y = 0; y < outHeight; ++y)\n{\nfloat input_y = y * heightScale;\nint y0 = static_cast<int>(std::floor(input_y));\nint y1 = std::min(y0 + 1, inpHeight - 1);\nfor (int x = 0; x < outWidth; ++x)\n{\nfloat input_x = x * widthScale;\nint x0 = static_cast<int>(std::floor(input_x));\nint x1 = std::min(x0 + 1, inpWidth - 1);\nfor (int c = 0; c < numChannels; ++c)\n{\nfloat interpolation =\ninpData[offset(inp.size, c, x0, y0, b)] * (1 - (input_y - y0)) * (1 - (input_x - x0)) +\ninpData[offset(inp.size, c, x0, y1, b)] * (input_y - y0) * (1 - (input_x - x0)) +\ninpData[offset(inp.size, c, x1, y0, b)] * (1 - (input_y - y0)) * (input_x - x0) +\ninpData[offset(inp.size, c, x1, y1, b)] * (input_y - y0) * (input_x - x0);\noutData[offset(out.size, c, x, y, b)] = interpolation;\n}\n}\n}\n}\n}\nprivate:\nstatic inline int offset(const cv::MatSize& size, int c, int x, int y, int b)\n{\nreturn x + size * (y + size * (c + size * b));\n}\nint outWidth, outHeight, factorWidth, factorHeight;\n};\n\nNext we register a layer and try to import the model.\n\nCV_DNN_REGISTER_LAYER_CLASS(ResizeBilinear, ResizeBilinearLayer);\n\n## Define a custom layer in Python\n\nThe following example shows how to customize OpenCV's layers in Python.\n\nLet's consider Holistically-Nested Edge Detection deep learning model. That was trained with one and only difference comparing to a current version of Caffe framework. Crop layers that receive two input blobs and crop the first one to match spatial dimensions of the second one used to crop from the center. Nowadays Caffe's layer does it from the top-left corner. So using the latest version of Caffe or OpenCV you'll get shifted results with filled borders.\n\nNext we're going to replace OpenCV's Crop layer that makes top-left cropping by a centric one.\n\n• Create a class with getMemoryShapes and forward methods\nclass CropLayer(object):\ndef __init__(self, params, blobs):\nself.xstart = 0\nself.xend = 0\nself.ystart = 0\nself.yend = 0\n# Our layer receives two inputs. We need to crop the first input blob\n# to match a shape of the second one (keeping batch size and number of channels)\ndef getMemoryShapes(self, inputs):\ninputShape, targetShape = inputs, inputs\nbatchSize, numChannels = inputShape, inputShape\nheight, width = targetShape, targetShape\nself.ystart = (inputShape - targetShape) // 2\nself.xstart = (inputShape - targetShape) // 2\nself.yend = self.ystart + height\nself.xend = self.xstart + width\nreturn [[batchSize, numChannels, height, width]]\ndef forward(self, inputs):\nreturn [inputs[:,:,self.ystart:self.yend,self.xstart:self.xend]]\nNote\nBoth methods should return lists.\n• Register a new layer.\ncv.dnn_registerLayer('Crop', CropLayer)\n\nThat's it! We've replaced an implemented OpenCV's layer to a custom one. You may find a full script in the source code.", null, "", null, "" ]
[ null, "https://docs.opencv.org/4.1.1/opencv-logo-small.png", null, "https://docs.opencv.org/4.1.1/lena.jpg", null, "https://docs.opencv.org/4.1.1/lena_hed.jpg", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.59308535,"math_prob":0.95579594,"size":11059,"snap":"2020-24-2020-29","text_gpt3_token_len":3147,"char_repetition_ratio":0.12998644,"word_repetition_ratio":0.11836027,"special_character_ratio":0.29749525,"punctuation_ratio":0.21145785,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9926313,"pos_list":[0,1,2,3,4,5,6],"im_url_duplicate_count":[null,null,null,1,null,1,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-07-05T08:25:23Z\",\"WARC-Record-ID\":\"<urn:uuid:7eef4ef7-f4a6-42c6-a22d-2bcfe5af708b>\",\"Content-Length\":\"50700\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:df7f82e5-2d2e-4cdc-822c-b64133f0bc1f>\",\"WARC-Concurrent-To\":\"<urn:uuid:6b1d8eff-787e-41eb-a5d6-d0c2ff66188e>\",\"WARC-IP-Address\":\"207.38.86.214\",\"WARC-Target-URI\":\"https://docs.opencv.org/4.1.1/dc/db1/tutorial_dnn_custom_layers.html\",\"WARC-Payload-Digest\":\"sha1:43UMCA6WIBONF5T3H33REDGJFRSAI7TU\",\"WARC-Block-Digest\":\"sha1:PRDM4IEHKJDVVVF4GNALRX77LZKZCNVE\",\"WARC-Identified-Payload-Type\":\"application/xhtml+xml\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-29/CC-MAIN-2020-29_segments_1593655887046.62_warc_CC-MAIN-20200705055259-20200705085259-00407.warc.gz\"}"}
https://brainmass.com/chemistry/general-chemistry/balancing-chemical-equations-writing-total-net-ionic-38278
[ "Purchase Solution\n\n# Balancing chemical equations and writing the total and net ionic equation\n\nNot what you're looking for?\n\nBalance the equations and write the total ionic equation and the net ionic equation for the reactions:\n\na.) K3PO4 (aq) + Ca(NO3)2 (aq)---->Ca3(PO4)3 (s) + KNO3 (aq)\n\nb.) Al(NO3)3 (aq) + NaOH (aq)----> Al(OH)3 (s) + NaNO3 (aq)\n\n##### Solution Summary\n\nThis solution is provided in 267 words. It uses step-by-step explanations for balance the chemical equations, and writes the equations in both total and net form.\n\n##### Solution Preview\n\n(a) First of all, I believe you've got a typo in this equation. It should be\n\nK3PO4 (aq) + Ca(NO3)2 (aq)---->Ca3(PO4)2 (s) + KNO3 (aq)\n\nK3PO4 (aq) + 3 Ca(NO3)2 (aq)---->Ca3(PO4)2 (s) + KNO3 (aq)\n\nThen do the nitrates:\n\nK3PO4 (aq) + 3 Ca(NO3)2 (aq)---->Ca3(PO4)2 (s) ...\n\n##### Match Elements with their Symbols\n\nElements are provided: choose the matching one- or two-letter symbol for each element.\n\n##### Organic Chemistry Naming: Alkanes\n\nThis is a quiz which is designed to assist students with learning the nomenclature used to identify organic compounds. This quiz focuses on the organic compounds called Alkanes.\n\n##### General Chemistry - Classification of Matter\n\nThis test will assess your knowledge on the classification of matter which includes elements, compounds and mixtures.\n\n##### Thermochemistry\n\nThe quiz helps in revising basic concepts about thermochemistry." ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.8184118,"math_prob":0.9733832,"size":1477,"snap":"2023-40-2023-50","text_gpt3_token_len":412,"char_repetition_ratio":0.12763068,"word_repetition_ratio":0.044247787,"special_character_ratio":0.267434,"punctuation_ratio":0.08550186,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9776522,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-11-28T08:46:58Z\",\"WARC-Record-ID\":\"<urn:uuid:22c14fa8-44a5-4334-9b58-04e5e900a97b>\",\"Content-Length\":\"20921\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:2e84d1de-c526-4093-b5d0-50284e595756>\",\"WARC-Concurrent-To\":\"<urn:uuid:0ba85ca6-0a0a-4f6f-b5e6-f0240a04542e>\",\"WARC-IP-Address\":\"104.21.75.23\",\"WARC-Target-URI\":\"https://brainmass.com/chemistry/general-chemistry/balancing-chemical-equations-writing-total-net-ionic-38278\",\"WARC-Payload-Digest\":\"sha1:YSDFYRV6LVV7ESYVAXZ35564SPBKW7PA\",\"WARC-Block-Digest\":\"sha1:FS6AFTI6JF2X7YOVIRQENFSIMFHNOZ4V\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-50/CC-MAIN-2023-50_segments_1700679099281.67_warc_CC-MAIN-20231128083443-20231128113443-00513.warc.gz\"}"}
https://fabricebaudoin.wordpress.com/2012/03/26/lecture-6-the-kolmogorov-continuity-theorem/
[ "## Lecture 6. The Kolmogorov continuity theorem\n\nThe Daniell-Kolmogorov theorem seen in Lecture 5 is a very useful tool since it provides existence results for stochastic processes. Nevertheless, this theorem does not say anything about the paths of this process. The following theorem, due to Kolmogorov, precises that, under mild conditions, we can work with processes whose paths are quite regular.\n\nDefinition. A function", null, "$f:\\mathbb{R}_{\\ge 0} \\rightarrow \\mathbb{R}^d$ is said to be Hölder continuous with exponent", null, "$\\alpha >0$ if there exists a constant", null, "$C >0$ such that for", null, "$s,t \\in \\mathbb{R}_{\\ge 0}$,", null, "$\\| f(t)-f(s) \\| \\le C \\mid t-s \\mid^{\\alpha}.$\n\nHölder functions are of course in particular continuous.\n\nDefinition. A stochastic process", null, "$(\\tilde{X}_t)_{t \\geq 0}$ is called a modification of the process", null, "$(X_t)_{t \\geq 0}$ if for every", null, "$t \\geq 0$,", null, "$\\mathbb{P} \\left( X_t = \\tilde{X}_t \\right)=1.$\n\nWe can observe that if", null, "$(\\tilde{X}_t)_{t \\geq 0}$ is a modification of", null, "$(X_t)_{t \\geq 0}$ then", null, "$(\\tilde{X}_t)_{t \\geq 0}$ has the same distribution as", null, "$(X_t)_{t \\geq 0}$ (because they need to have the same finite-dimensional distributions).\n\nTheorem. (Kolmogorov continuity theorem) Let", null, "$\\alpha, \\varepsilon, c >0$. If a", null, "$d$-dimensional process", null, "$(X_t)_{t\\in [0,1]}$ defined on a probability space", null, "$(\\Omega, \\mathcal{F}, \\mathbb{P})$ satisfies for", null, "$s,t \\in [0,1]$,", null, "$\\mathbb{E} \\left( \\| X_t - X_s \\|^{\\alpha} \\right) \\leq c \\mid t-s \\mid^{1+\\varepsilon},$\n\nthen there exists a modification of the process", null, "$(X_t)_{t \\in [0,1]}$ that is a continuous process and whose paths are", null, "$\\gamma$-Hölder for every", null, "$\\gamma \\in [0, \\frac{\\varepsilon}{\\alpha} )$.\n\nProof:\n\nWe make the proof for", null, "$d=1$ and let the reader extend it as an exercise to the case", null, "$d \\ge 2$. For", null, "$n \\in \\mathbb{N}$, we denote", null, "$\\mathcal{D}_n=\\left\\{ \\frac{k}{2^n}, k=0,...,2^{n} \\right\\}$\n\nand", null, "$\\mathcal{D}=\\cup_{n \\in \\mathbb{N}} \\mathcal{D}_n.$\n\nLet", null, "$\\gamma \\in [0, \\frac{\\varepsilon}{\\alpha} )$. From Chebychev’s inequality:", null, "$\\mathbb{P} \\left( \\max_{1 \\le k \\le 2^n} | X_{\\frac{k}{2^n}} -X_{\\frac{k-1}{2^n}} | \\ge 2^{-\\gamma n}\\right)$", null, "$=\\mathbb{P} \\left( \\cup_{1 \\le k \\le 2^n} | X_{\\frac{k}{2^n}} -X_{\\frac{k-1}{2^n}} | \\ge 2^{-\\gamma n}\\right)$", null, "$\\le \\sum_{k=1}^{2^n} \\mathbb{P} \\left( | X_{\\frac{k}{2^n}} -X_{\\frac{k-1}{2^n}} | \\ge 2^{-\\gamma n}\\right)$", null, "$\\le \\sum_{k=1}^{2^n} \\frac{\\mathbb{E}\\left( | X_{\\frac{k}{2^n}} -X_{\\frac{k-1}{2^n}} |^{\\alpha}\\right)}{2^{-\\gamma \\alpha n}}$", null, "$\\le c 2^{-n(\\varepsilon-\\gamma \\alpha)}$\n\nTherefore, since", null, "$\\gamma \\alpha < \\varepsilon$, we deduce", null, "$\\sum_{n=1}^{+\\infty} \\mathbb{P} \\left( \\max_{1 \\le k \\le 2^n} | X_{\\frac{k}{2^n}} -X_{\\frac{k-1}{2^n}} | \\ge 2^{-\\gamma n}\\right)<+\\infty.$\n\nFrom the Borel-Cantelli lemma, we can thus find a set", null, "$\\Omega^* \\in \\mathcal{F}$ such that", null, "$\\mathbb{P} ( \\Omega^*)=1$ and such that for", null, "$\\omega \\in \\Omega^*$, there exists", null, "$N(\\omega)$ such that for", null, "$n \\ge N(\\omega)$,", null, "$\\max_{1 \\le k \\le 2^n} | X_{\\frac{k}{2^n}} (\\omega) -X_{\\frac{k-1}{2^n}} (\\omega)| \\le 2^{-\\gamma n}.$\n\nIn particular, there exists an almost surely finite random variable", null, "$C$ such that for every", null, "$n \\ge 0$,", null, "$\\max_{1 \\le k \\le 2^n} | X_{\\frac{k}{2^n}} (\\omega) -X_{\\frac{k-1}{2^n}} (\\omega)| \\le C 2^{-\\gamma n}$\n\nWe now claim that the paths of the restricted process", null, "$X_{/\\Omega^*}$ are consequently", null, "$\\gamma$-Hölder on", null, "$\\mathcal{D}$. Indeed, let", null, "$s,t \\in \\mathcal{D}$,", null, "$t \\neq s$. We can find", null, "$n \\ge 0$ such that", null, "$\\frac{1}{2^{n+1}} \\le \\mid s-t \\mid \\le \\frac{1}{2^n}.$\n\nWe now pick an increasing and stationary sequence", null, "$(s_k)_{k \\ge n}$ converging toward", null, "$s$, such that", null, "$s_k \\in \\mathcal{D}_k$ and", null, "$\\mid s_{k+1}-s_k \\mid =2^{-(k+1)} \\quad \\text{or} \\quad 0.$\n\nIn the same way, we can find an analogue sequence", null, "$(t_k)_{k \\ge n}$ that converges toward", null, "$t$ and such that", null, "$s_n$ and", null, "$t_n$ are neighbors in", null, "$\\mathcal{D}_n$. We have then:", null, "$X_t - X_s=\\sum_{i=n}^{+\\infty}(X_{s_{i+1}} -X_{s_{i}}) +(X_{s_n}-X_{t_n})+\\sum_{i=n}^{+\\infty}(X_{t_{i}} -X_{t_{i+1}}),$\n\nwhere the above sums are actually finite.\n\nTherefore,", null, "$| X_t - X_s |$", null, "$\\le C 2^{-\\gamma n}+ 2 \\sum_{k=n}^{+\\infty} C 2^{-\\gamma(k+1)}$", null, "$\\le 2C \\sum_{k=n}^{+\\infty} 2^{- \\gamma k}$", null, "$\\le \\frac{2C}{1-2^{-\\gamma}} 2^{-\\gamma n}$\n\nHence the paths of", null, "$X_{/\\Omega^*}$ are", null, "$\\gamma$-Hölder on the set", null, "$\\mathcal{D}$. For", null, "$\\omega \\in \\Omega^*$, let", null, "$t\\rightarrow \\tilde{X}_t (\\omega)$ be the unique continuous function that agrees with", null, "$t\\rightarrow X_t (\\omega)$ on", null, "$\\mathcal{D}$. For", null, "$\\omega \\notin \\Omega^*$, we set", null, "$\\tilde{X}_t (\\omega)=0$. The process", null, "$(\\tilde{X}_t)_{t \\in [0,1]}$ is the desired modification of", null, "$(X_t)_{t \\in [0,1]}$.", null, "$\\square$\n\nThis entry was posted in Stochastic Calculus lectures. Bookmark the permalink.\n\n### 5 Responses to Lecture 6. The Kolmogorov continuity theorem\n\n1.", null, "zihui says:\n\nThe theorem is stated in the form that “suppose for a fixed interval [0,T] there exist a set of parameters \\alpha, \\epsilon, c such that (some inequality holds), then there exists a continuous modification of the process on [0,T]”. The set of parameters depend on the interval.\n\nWe do not hope for a set of parameters such that the condition inequality holds on [0,\\infty) globally, because the concept of Holder continuity is more often discussed only locally. It would restrict ourselves too much to discuss about “globally Holder”. Is this correct?\n\n•", null, "Fabrice Baudoin says:\n\nYes, indeed, most of the processes, including the Brownian motion, are not globally Holder but only locally: The Holder constant depends on the interval.\n\n2.", null, "zihui says:\n\nThanks Professor.\n\nJust remember\n(i) D\n(ii) the set \\Omega^*, which has full measure\n(iii) paths of X restricted on \\Omega^* are \\gamma-Holder on D\nit shouldn’t be difficult to memorize the theorem.\n\n3.", null, "etfoxall says:\n\nIs the assertion |s-t| <= 2^{-n} backwards? We find |X_t-X_s| <= 2^{-alpha n} which we want to be <= |s-t|^{\\alpha}, for which 2^{-n} <= |s-t| is more useful.\n\n•", null, "Fabrice Baudoin says:\n\nThe proof was fine, because", null, "$|t-s| \\le \\frac{1}{2^n} \\Rightarrow |X_t -X_s| \\le C \\frac{1}{2^{n\\gamma}}$ implies that", null, "$X$ is", null, "$\\gamma$-Holder, but I slightly edited the post to make it more clear. Thanks for the comment." ]
[ null, "https://s0.wp.com/latex.php", null, "https://s0.wp.com/latex.php", null, "https://s0.wp.com/latex.php", null, "https://s0.wp.com/latex.php", null, "https://s0.wp.com/latex.php", null, "https://s0.wp.com/latex.php", null, "https://s0.wp.com/latex.php", null, "https://s0.wp.com/latex.php", null, "https://s0.wp.com/latex.php", null, "https://s0.wp.com/latex.php", null, "https://s0.wp.com/latex.php", null, "https://s0.wp.com/latex.php", null, "https://s0.wp.com/latex.php", null, "https://s0.wp.com/latex.php", null, "https://s0.wp.com/latex.php", null, "https://s0.wp.com/latex.php", null, "https://s0.wp.com/latex.php", null, "https://s0.wp.com/latex.php", null, "https://s0.wp.com/latex.php", null, "https://s0.wp.com/latex.php", null, "https://s0.wp.com/latex.php", null, "https://s0.wp.com/latex.php", null, "https://s0.wp.com/latex.php", null, "https://s0.wp.com/latex.php", null, "https://s0.wp.com/latex.php", null, "https://s0.wp.com/latex.php", null, "https://s0.wp.com/latex.php", null, "https://s0.wp.com/latex.php", null, "https://s0.wp.com/latex.php", null, "https://s0.wp.com/latex.php", null, "https://s0.wp.com/latex.php", null, "https://s0.wp.com/latex.php", null, "https://s0.wp.com/latex.php", null, "https://s0.wp.com/latex.php", null, "https://s0.wp.com/latex.php", null, "https://s0.wp.com/latex.php", null, "https://s0.wp.com/latex.php", null, "https://s0.wp.com/latex.php", null, "https://s0.wp.com/latex.php", null, "https://s0.wp.com/latex.php", null, "https://s0.wp.com/latex.php", null, "https://s0.wp.com/latex.php", null, "https://s0.wp.com/latex.php", null, "https://s0.wp.com/latex.php", null, "https://s0.wp.com/latex.php", null, "https://s0.wp.com/latex.php", null, "https://s0.wp.com/latex.php", null, "https://s0.wp.com/latex.php", null, "https://s0.wp.com/latex.php", null, "https://s0.wp.com/latex.php", null, "https://s0.wp.com/latex.php", null, "https://s0.wp.com/latex.php", null, "https://s0.wp.com/latex.php", null, "https://s0.wp.com/latex.php", null, "https://s0.wp.com/latex.php", null, "https://s0.wp.com/latex.php", null, "https://s0.wp.com/latex.php", null, "https://s0.wp.com/latex.php", null, "https://s0.wp.com/latex.php", null, "https://s0.wp.com/latex.php", null, "https://s0.wp.com/latex.php", null, "https://s0.wp.com/latex.php", null, "https://s0.wp.com/latex.php", null, "https://s0.wp.com/latex.php", null, "https://s0.wp.com/latex.php", null, "https://s0.wp.com/latex.php", null, "https://s0.wp.com/latex.php", null, "https://s0.wp.com/latex.php", null, "https://s0.wp.com/latex.php", null, "https://s0.wp.com/latex.php", null, "https://s0.wp.com/latex.php", null, "https://s0.wp.com/latex.php", null, "https://s0.wp.com/latex.php", null, "https://s0.wp.com/latex.php", null, "https://s0.wp.com/latex.php", null, "https://s0.wp.com/latex.php", null, "https://s0.wp.com/latex.php", null, "https://2.gravatar.com/avatar/881545468e20e685d6701d8f6b3cdf87", null, "https://0.gravatar.com/avatar/9ff216a8ed461d2c616f189d905e5e91", null, "https://2.gravatar.com/avatar/881545468e20e685d6701d8f6b3cdf87", null, "https://0.gravatar.com/avatar/641d59d426b87fecac8ae76872b21e8f", null, "https://0.gravatar.com/avatar/9ff216a8ed461d2c616f189d905e5e91", null, "https://s0.wp.com/latex.php", null, "https://s0.wp.com/latex.php", null, "https://s0.wp.com/latex.php", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.9318268,"math_prob":0.9999701,"size":3114,"snap":"2019-13-2019-22","text_gpt3_token_len":707,"char_repetition_ratio":0.12797427,"word_repetition_ratio":0.0037453184,"special_character_ratio":0.22447014,"punctuation_ratio":0.12292359,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":1.0000076,"pos_list":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,96,97,98,99,100,101,102,103,104,105,106,107,108,109,110,111,112,113,114,115,116,117,118,119,120,121,122,123,124,125,126,127,128,129,130,131,132,133,134,135,136,137,138,139,140,141,142,143,144,145,146,147,148,149,150,151,152,153,154,155,156,157,158,159,160,161,162,163,164,165,166,167,168,169,170],"im_url_duplicate_count":[null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-05-19T15:30:38Z\",\"WARC-Record-ID\":\"<urn:uuid:979e6c69-c9e5-4557-bba8-05a5df44718c>\",\"Content-Length\":\"85127\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:19aeb8e7-9eab-4f69-aa30-cc4340091187>\",\"WARC-Concurrent-To\":\"<urn:uuid:f95d2e90-d0c2-4ef8-ad46-1d005939d41c>\",\"WARC-IP-Address\":\"192.0.78.12\",\"WARC-Target-URI\":\"https://fabricebaudoin.wordpress.com/2012/03/26/lecture-6-the-kolmogorov-continuity-theorem/\",\"WARC-Payload-Digest\":\"sha1:AXIX3FY4AHGSGWPMWAQZSLQZCBP5IRZN\",\"WARC-Block-Digest\":\"sha1:LCKEY7HILVHXJIC4LYITEWQ5UQISYIXQ\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-22/CC-MAIN-2019-22_segments_1558232254889.43_warc_CC-MAIN-20190519141556-20190519163556-00160.warc.gz\"}"}
https://blog.finxter.com/python-one-line-fizzbuzz/
[ "# Python One Line FizzBuzz\n\nThe FizzBuzz problem is a common exercise posed in code interviews to test your proficiency in writing simple Python code.\n\nProblem: Print all numbers from 1-100 to the shell with three exceptions:\n\n• For each number divisible by three you print `\"Fizz\"`,\n• For each number divisible by five you print `\"Buzz\"`, and\n• For each number divisible by three and five you print `\"FizzBuzz\"`.\n\nExample: The first 15 numbers of the FizzBuzz sequence are the following.\n\n```1\n2\nFizz\n4\nBuzz\nFizz\n7\n8\nFizz\nBuzz\n11\nFizz\n13\n14\nFizzBuzz\n...```\n\nHow to write a Python one-liner that solves this problem?\n\nHere’s an interactive overview:\n\nExercise: Do both one-liners produce the same results? Run the code to check!\n\nLet’s dive into those one-liners to gain a deeper understanding and improve your Python skills!\n\n## FizzBuzz One-Liner 1: Generator Expression + String Concatenation + Short Circuiting\n\nThe following one-liner solves the problem in an elegant way using a fine understanding of more advanced Python features (source).\n\n`print('\\n'.join('Fizz' * (i%3==0) + 'Buzz' * (i%5==0) or str(i) for i in range(1,101)))`\n\nThe one-liner creates a string using the `join` function with the newline character as a delimiter. Here’s a short explanation of the function:\n\nThe `string.join(iterable)` method concatenates all the string elements in the `iterable` (such as a list, string, or tuple) and returns the result as a new string. The `string` on which you call it is the delimiter string—and it separates the individual elements. For example, `'-'.join(['hello', 'world'])` returns the joined string `'hello-world'`.\n\nSo, what’s the iterable, you pass into the `join()` function? It’s a generator expression of the form: `expression for variable in context`. You go over all integer values in the context 1 to 100 using the `range()` function. So, you obtain the remaining `expression for i in range(1, 101)`. What’s the expression part?\n\nIt consists of three elements:\n\n• `'Fizz' * (i%3==0)` — The modulo expression `i%3==0` returns `True` only if the integer `i` is divisible by 3, otherwise it returns `False`. So, you multiply the string `'Fizz'` either with `True` (=1) or with `False` (=0). As a result, you obtain the empty string `''` in all cases except if the integer `i` is divisible by 3—in which case you obtain the string `'Fizz'`.\n• `'Buzz' * (i%5==0)`— The modulo expression `i%5==0` returns `True` only if the integer `i` is divisible by 5, otherwise it returns `False`. So, you multiply the string `'Buzz'` either with `True` (=1) or with `False` (=0). As a result, you obtain the empty string `''` in all cases except if the integer `i` is divisible by 5—in which case you obtain the string `'Buzz'`.\n• You use string concatenation to glue together the previously obtained strings. In most cases, this will be the empty string. If `i` is divisible by 3, you obtain the string `'Fizz'`. If `i` is divisible by 5, you obtain the string `'Buzz'`. And if `i` is divisible by 3 and 5, you obtain the string `'FizzBuzz'`.\n• `or str(i)` — In the case you obtained a non-empty string in `{'Fizz', 'Buzz', 'FizzBuzz'}` in the previous step, the `or` operation simply returns this string. This is called short circuiting—and it’s used in many programming languages such as Python to improve efficiency of logical operations.\n• But if the string is empty, it is interpreted as a logical `False`. Thus, Python returns the second operand of the `or` operation. The second operand simply is the string representation of the integer `i`.\n\nA very interesting implementation of the FizzBuzz problem indeed!\n\n## FizzBuzz One-Liner 2: Slicing\n\nAn alternative is given in the following nice one-liner (source):\n\n`for i in range(1, 101): print('FizzBuzz'[i*i%3*4:8--i**4%5] or i)`\n\nWow—what a short and concise one-liner solution! But how does it work?\n\n• You iterate over all values from `i=1` to `i=100` and print a string. So far so good.\n• You use the `or` operation and slicing to determine the string `'FizzBuzz'[start:end] or i` generates the output.\n• You use the property of short circuiting in Python: If `'FizzBuzz'[start:end]` is empty, the integer `i` is returned, otherwise, the non-empty string is returned.\n• You carve out a substring from `'FizzBuzz'` using slicing as follows.\n\nSlicing is a concept to carve out a substring from a given string. Use slicing notation `s[start:stop:step]` to access every `step`-th element starting from index `start` (included) and ending in index `stop` (excluded). All three arguments are optional, so you can skip them to use the default values (`start=0`, `stop=len(lst)`, `step=1`). For example, the expression `s[2:4]` from string `'hello'` carves out the slice `'ll'` and the expression `s[:3:2]` carves out the slice `'hl'`.\n\nIn the example, you have the slicing operation `'FizzBuzz'[i*i%3*4:8--i**4%5]`.\n\n• `start = i*i%3*4` — Note that the multiplication `*` and modulo operation `%` have the same priority, so they are evaluated from left to right. If integer `i` is divisible by 3, `i*i` is also divisible by 3, and the start index is 0. In all other cases, the start index is 4. Thus, the slice either starts with `'Fizz'` or `'Buzz'`.\n• `stop = 8--i**4%5` — This is 4 in all cases except if the number `i` is divisible by 5, in which case this is 8.\n\nSo, there are four cases:\n\n• The number is divisible only by 3: `start=0`, `stop=4` –> `'Fizz'`\n• The number is divisible only by 5: `start=4`, `stop=8` –> `'Buzz'`\n• The number is divisible by both 3 and 5: `start=0`, `stop=8` –> `'FizzBuzz'`\n• The number is divisible by neither 3 nor 5: `start = 4`, `stop=4` –> `''`\n\nPhew! This was a hard nut to crack, wasn’t it?\n\n## Python One-Liner 3: Map + Lambda\n\nYou can find detailed tutorials on the map and lambda functions here:\n\nThose two functions can be used to solve the FizzBuzz problem (source):\n\n`print(list(map(lambda i: \"Fizz\"*(i%3==0)+\"Buzz\"*(i%5==0) or str(i), range(1,101))))`\n\nIt’s similar to Method 1 and by now you’re able to figure it out. Think of the different values the integer `i` can take.\n\n## Python One-Liners Book: Master the Single Line First!\n\nPython programmers will improve their computer science skills with these useful one-liners.\n\nPython One-Liners will teach you how to read and write “one-liners”: concise statements of useful functionality packed into a single line of code. You’ll learn how to systematically unpack and understand any line of Python code, and write eloquent, powerfully compressed Python like an expert.\n\nThe book’s five chapters cover (1) tips and tricks, (2) regular expressions, (3) machine learning, (4) core data science topics, and (5) useful algorithms.\n\nDetailed explanations of one-liners introduce key computer science concepts and boost your coding and analytical skills. You’ll learn about advanced Python features such as list comprehension, slicing, lambda functions, regular expressions, map and reduce functions, and slice assignments.\n\nYou’ll also learn how to:\n\n• Leverage data structures to solve real-world problems, like using Boolean indexing to find cities with above-average pollution\n• Use NumPy basics such as array, shape, axis, type, broadcasting, advanced indexing, slicing, sorting, searching, aggregating, and statistics\n• Calculate basic statistics of multidimensional data arrays and the K-Means algorithms for unsupervised learning\n• Create more advanced regular expressions using grouping and named groups, negative lookaheads, escaped characters, whitespaces, character sets (and negative characters sets), and greedy/nongreedy operators\n• Understand a wide range of computer science topics, including anagrams, palindromes, supersets, permutations, factorials, prime numbers, Fibonacci numbers, obfuscation, searching, and algorithmic sorting\n\nBy the end of the book, you’ll know how to write Python at its most refined, and create concise, beautiful pieces of “Python art” in merely a single line.\n\nGet your Python One-Liners on Amazon!!", null, "" ]
[ null, "https://vg01.met.vgwort.de/na/e23d87f88a9949eaa0ccea1ccb6ff30d", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.8192883,"math_prob":0.93488115,"size":8409,"snap":"2021-31-2021-39","text_gpt3_token_len":2072,"char_repetition_ratio":0.12682927,"word_repetition_ratio":0.058208954,"special_character_ratio":0.24105126,"punctuation_ratio":0.12797076,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.98716545,"pos_list":[0,1,2],"im_url_duplicate_count":[null,1,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-09-17T22:59:03Z\",\"WARC-Record-ID\":\"<urn:uuid:d8590d5e-1d13-4b69-9710-ea96f9e71367>\",\"Content-Length\":\"97974\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:dff25842-716d-4d41-9a03-ac90fd3181ab>\",\"WARC-Concurrent-To\":\"<urn:uuid:a2fed906-6238-479e-a71c-b5ac05427d33>\",\"WARC-IP-Address\":\"194.1.147.89\",\"WARC-Target-URI\":\"https://blog.finxter.com/python-one-line-fizzbuzz/\",\"WARC-Payload-Digest\":\"sha1:XHK5AMN4TP7Z2D3FZTREPNNG6AFJPDKS\",\"WARC-Block-Digest\":\"sha1:H2OXEZT2QAUBMI7SBI4BVX5IJGT7NBXP\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-39/CC-MAIN-2021-39_segments_1631780055808.78_warc_CC-MAIN-20210917212307-20210918002307-00212.warc.gz\"}"}
https://decimal.info/conversion-factors/milligrams-to-yottagrams-conversion-factor-and-calculator.html
[ "Milligrams to Yottagrams Conversion Factor", null, "The Milligrams to Yottagrams Conversion Factor, also known as the mg to Yg Conversion Factor, is useful if you need to convert any measurement of milligrams (mg) to yottagrams (Yg).\n\nTo convert milligrams to yottagrams, you simply multiply milligrams by the Milligrams to Yottagrams Conversion Factor.\n\nThe Milligrams to Yottagrams Conversion Factor (mg to Yg Conversion Factor) is as follows:\n\n10-27\n\nThus, multiply 10^-27 by any measurement of milligrams to get the same value in yottagrams. For your convenience, we have created the mg to Yg calculator below. You can enter your milligram (mg) measurement to get the equal yottagram (Yg) value.\n\nMilligrams to Zeptograms Conversion Factor and Calculator\nHere is the next Conversion Factor and Calculator on our list.\n\nMetric Conversion Factor Lookup\nGo here to look up other metric conversion factors." ]
[ null, "https://decimal.info/Images/conversion-factor.png", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.7649602,"math_prob":0.96900564,"size":941,"snap":"2022-40-2023-06","text_gpt3_token_len":210,"char_repetition_ratio":0.24653149,"word_repetition_ratio":0.028169014,"special_character_ratio":0.19341126,"punctuation_ratio":0.08227848,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.98249716,"pos_list":[0,1,2],"im_url_duplicate_count":[null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-10-03T17:18:09Z\",\"WARC-Record-ID\":\"<urn:uuid:66b26990-302b-4e4e-9496-9c255b962fa8>\",\"Content-Length\":\"5564\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:949874b3-3442-4eb7-a304-6f19187bada5>\",\"WARC-Concurrent-To\":\"<urn:uuid:6c79aa36-31e3-4ae8-a427-6678ca3be6cc>\",\"WARC-IP-Address\":\"13.249.39.100\",\"WARC-Target-URI\":\"https://decimal.info/conversion-factors/milligrams-to-yottagrams-conversion-factor-and-calculator.html\",\"WARC-Payload-Digest\":\"sha1:Y4HNDUJKLOM3BWUZVWYPM7TASG4DVDHU\",\"WARC-Block-Digest\":\"sha1:MSZHLWF3SWTNYMEBOQOR7NNBBIB77AQF\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-40/CC-MAIN-2022-40_segments_1664030337428.0_warc_CC-MAIN-20221003164901-20221003194901-00000.warc.gz\"}"}
https://ulcius.com/2020/05/01/psyc-354-homework-1-6-assignment-papers/
[ "# PSYC 354 Homework 1 – 6 Assignment Papers\n\nPSYC 354 Homework 1 – 6 Assignment Papers\n\nFill in the blank with the appropriate word or words.\n1. A researcher counts the number of times per half hour that a child shares a toy. This variable (number of times sharing) is at the ________ level of measurement.\n2. A psychologist divides different learning styles into 3 categories, or types. The variable “learning style” is a variable at the ________ level of measurement.\n3. When describing interval and ratio variables, people often group them together into a more general type of variable. The name for this more general kind of variable is a __________ variable.\n4. The ____________ is the large group about which you want to know something\n5. A(n) ________ is a set of observations drawn from the larger group of interest.\n6. A statistic that uses sample data to make general estimates about the larger population is a(n) ________ statistic.\n\n### ORDER NOW FOR A CUSTOM-WRITTEN AND PLAGIARISM-FREE PAPER\n\n7. A(n) ________ statistic is one which summarizes a group of numbers. 8. A scientist is in the process of drawing conclusions about whether or not a particular relation between variables is supported by the data. The name for this process is ________.\n9. A variable that is manipulated to determine its effects on another variable is a(n) ________ variable.\n10. A(n) ________ variable makes it impossible to determine whether the independent variable is the cause of changes in the dependent variable.\n11. When each participant has the same chance of being assigned to the various levels of the manipulation, they are said to be ______________ to conditions.\n12. A(n) ___________ relies on random assignment of participants to conditions so that cause and effect can be discovered.\n13. Participants in a sleep study are divided into three groups: normal sleep, interrupted sleep, and sleep deprivation. Each participant only experiences the level to which they are assigned. This is an example of a(n) ________-subjects design.\n14. In another sleep study, participants experience all three sleep conditions over time. This is an example of a(n) ________-subjects design. PSYC 354 Homework 1 – 6 Assignment Papers\n15. Briefly explain what a “level” is in relation to independent variables: ________________________________________________________________________________________________________________________________________________\n\nQuestion 1a-1c\n\nA clinical psychologist decides to study the effects of treatment type (cognitive behavioral, psychodynamic, and interpersonal) on depression symptoms. 1-a) What would the dependent variable be in this study? Answer 1-b) What would the independent variable be in this study? Answer 1-c) How many levels would the independent variable have? Answer\n\nQuestion 2 (a-d) A psychologist reported the results of a study in which 200 female college students with OCD completed an anxiety symptoms scale with scores ranging from 0 to 30. On average, the female college students scored 17. Identify each of the following for this study. 2-a) Population Answer 2-b) Sample Answer 2-c) Dependent variable Answer 2-d) Descriptive statistic Answer\n\nQuestions 3-6 Answer these general SPSS questions. 3) In which window do you enter data in SPSS? PSYC 354 Homework 1 – 6 Assignment Papers Answer 4) Which window displays the results of your analysis in SPSS? Answer 5) Which SPSS main menu would you use to choose a particular statistical test? Answer 6) In the Data View, each _____ represents one participant’s information. Answer\n\nQuestion 7a-7b Suppose you have a data set in which the variable “Gender” is coded in the file as numbers (1 and 2). However, you want the words “male” and “female” to show up in the output when you run your test. 7a) Which dialog box is used to create labels such as male and female for specific numbers in the data set? (Give the title at the top of the box.) Answer 7b) If you want to define the level of measurement for the variable “Gender,” which column within Variable View allows you to do this? Answer\n\nSubmit Homework 1 by 11:59 p.m. (ET) on Monday of Module/Week 1. Remember to name file appropriately.\n\n### PSYC 354 Homework 1 – 6 Assignment Papers\n\nUse the following table to answer Question 1. This table depicts the scores of 40 students on an exam worth 100 points.\n\n1) Use the information in the table to determine the percentages for each interval. Depending on your rounding decisions, these may or may not add up to exactly 100% but should be very close.\n\nTable: Grouped Frequency Table\n\nScore Interval       Frequency     Percentages for each Interval 90-100                         9                             ? 80-89                          10                            ? 70-79                           9                              ? 60-69                           5                              ? 50-59                           4                              ? 40-49                           2                              ? 30-39                           1                               ? TOTAL                         ?                               ?\n\n2) ________ look like bar graphs but typically display scale data.\n\n3) A frequency distribution that is bell-shaped, symmetrical, and unimodal is ____________.\n\n4) A frequency distribution that has a tail trailing off to the right of the distribution is ____________- skewed.\n\n5) A frequency distribution of ages of residents at an assisted living facility is clustered around 81 with a long tail to the left. This distribution is ____________-skewed.\n\n6) When a constraint prevents a variable from taking on values above a certain point, this is known as a(n) ________ effect.\n\n7) There are two types of graphs that are best to use when graphing two scale variables. Which two graphs are these? _________ and __________\n\n8) When graphing a nominal independent variable and a scale dependent variable, you could use a ________ or a _________.\n\n9) When graphing a single scale variable you should use which type of graph? _________\n\n10) A grouped frequency table has the following intervals: 0–19, 20–39, and 40–59. If converted into a histogram, what would the midpoints be? The process of determining midpoints is best outlined in Example 2.3 of Chapter 2, and illustrated in Ex. 2.4. PSYC 354 Homework 1 – 6 Assignment Papers\n\n30–39: Midpoint Value 40–49: Midpoint Value 50–59: Midpoint Value\n\n11) Do the data in the scatterplot below show a linear relation, non-linear relation, or no relation at all?\n\n12) Do the data in the scatterplot below show a linear relation, non-linear relation, or no relation at all?\n\nPart II: SPSS Analysis\n\nGreen and Salkind, Lesson 20\n\n• Open the “Lesson 20 Exercise File 1” document (found in the course’s Assignment Instructions folder) in order to complete these exercises. • Always use the Blackboard files instead of the files on the Green and Salkind website as some files have been modified for the purposes of this course. • Reminder: For Exercise 1, be sure to paste in the SPSS output and write out the answers for A, B, and C beneath it.\n\nPart II: Questions 1-4 • Ann wants to describe the demographic characteristics of a sample of 25 individuals who completed a large-scale survey. • She has demographic data on the participants’: ♣ Gender (two categories) ♣ Educational level (four categories) ♣ Marital status (three categories) ♣ Community population size (eight categories).\n\nQuestions 1a -1c\n\n1) Conduct a frequency analysis on the gender and marital status variables. From the output, identify the following: a. Percentage of women b. Mode for marital status c. Frequency of people who have never been married in the sample\n\nAnswer- Table- Gender: (paste Table in this cell)\n\nAnswer- Table- Marital Status: (paste Table in this cell)\n\n1-b) Mode for marital status (give the name of the group, not the number): Answer\n\n1-c) Frequency of people who have never been married: Answer\n\nQuestions 2-4\n\n2) Create a frequency table to summarize the data on the educational level variable. Answer- Table- Education Level: (paste Table in this cell)\n\n3) Create a bar chart to summarize the data from the community population variable. Answer- Bar chart – Community population: (paste Bar chart in this cell)\n\n4) Write a Participants section describing the participants in Ann’s sample. You may refer to the tables you have created above within the section. PSYC 354 Homework 1 – 6 Assignment Papers Answer- Participants Section:\n\nPart III: SPSS Data Entry and Analysis\n\nThe steps will be the same in Part III as the ones you have been practicing in Part I of the assignment; the only difference is that you are now responsible for creating the data file as well. Remember to do the following: • Name and define your variables under the “Variable View,” then return to the “Data View” to enter the data; and • Paste all SPSS output and graphs into your homework file at the appropriate place.\n\nPart III:\n\nQuestions 1a-1c\n\n• This question is based on the data in the end-of-chapter Question 2.30 of the Nolan and Heinzen textbook. • Create a variable called “num_years” in a new SPSS file. • Enter the data given in #2.30. o Remember to enter the data into 1 column (variable).\n\n1-a) Create a frequency table in SPSS for these data. Answer- Frequency Table- Number of Years: (paste Table in this cell)\n\n1-b) Create a histogram for these data. Answer- Histogram – Number of Years: (paste Figure in this cell)\n\n1-c) How many schools have an average completion time of 10 years or less? (Each number in the file represents one school.)\n\nAn average completion time of 12 years or more? PSYC 354 Homework 1 – 6 Assignment Papers\n\nAnswer for 10 years or less =\n\nAnswer for 12 years or more =\n\nQuestions 1-4\n\nFill in the highlighted blanks to answer/complete the statements. 1) Another name for the arithmetic average of a set of numbers is the ________. 2) What is an outlier? ________\n\n3) Which measure of central tendency is most likely to be adversely affected by outliers? ________ 4) We compute standard deviation by taking the ________ of the variance.\n\nQuestion 5a-5d\n\nFor the following terms, write the equivalent mathematical symbol (letter or letters) for the sample statistic. 5-a) Score: Answer 5-b) Mean: Answer\n\nQuestion 6a-6c\n\nThese are the scores of eleven patients on the Beck Depression Inventory (BDI ® ). Scores can range from 0 to 63. PSYC 354 Homework 1 – 6 Assignment Papers 12\n\n19\n\n11\n\n23\n\n16\n\n15\n\n27\n\n25\n\n52\n\n13\n\n14\n\n6-a) What is the mean of the scores? (Compute this using a calculator): Answer 6-b) What is the median of these scores? Answer 6-c ) Compare the mean and median. Does the difference between them suggest that the data are skewed very much? Explain. Answer\n\nExplanation/ Justification\n\nQuestion 7a- 7f\n\n• At this website, (http://projects.newyorker.com/story/subway/) you will find an interactive graph concerning New York City’s geography and income. • Read the introduction and click on different “subway lines” to see how the interactive graph works. • Note that the abbreviations stand for the four different boroughs: ♣ MAN = Manhattan ♣ BRX = Bronx ♣ BRK = Brooklyn ♣ QNS = Queens\n\n• Also note that hovering your mouse over the dots on the graph displays the subway stop and the median income of households in that area. PSYC 354 Homework 1 – 6 Assignment Papers\n\n7-a) In which of the four boroughs is the median household income highest? (This is made evident as you click on the different lines.)\n\n7-b) Click on the “A” line. Does the line graph for Manhattan show high or low variability? What does this level of variability tell us about the household income in this area of Manhattan?\n\n7-c) Click on Line 6. Though both boroughs depicted show some variability, which borough (not a street) shows the most variability in median household income?\n\n7-d) On Line 3, find the following two subway stops: New Lots Ave. (the first of the Brooklyn stops) and Park Place (the first of the highest stops in Manhattan). What is the difference (calculate) between the median household incomes of the two areas?\n\n7-e) Click on the “F” line. Which subway stop in Brooklyn seems to be an outlier?\n\n7-f) Based on this module/week’s reading, why do you think the author of this graph chose the median household income instead of the mean household income to describe central tendency? PSYC 354 Homework 1 – 6 Assignment Papers\n\nPart II: SPSS Analysis\n\nGreen and Salkind Course Text, Lesson 21: Exercises 1, 4, 7, and 8 • Questions 1 and 4 o Green and Salkind Text, Lesson 21 o Lesson 21 Exercise File 1 (located under course’s Assignment Instructions folder)\n\nPart II:\n\nExercises 1a-1d and Exercise 4\n\nGreen and Salkind, Lesson 21, Exercises 1 and 4 ( do not complete numbers 2 or 3) Open “Lesson 21 Exercise File 1” in order to complete these exercises. David collects anxiety scores from 15 college students who visit the university health center during finals week: 1) Compute descriptive statistics on the anxiety scores. From the output, identify the following: a. Skewness b. Mean c. Standard deviation d. Kurtosis\n\nAnswer: SPSS Table- Descriptive Statistics for Anxiety Scores (paste Table in this cell)\n\n4) Create a histogram to show the distribution of the anxiety scores. Edit the graph so that most of the normal curve is visible. Answer: SPSS Figure- Histogram for Anxiety Scores with Normal Curve (paste Figure in this cell)\n\nPart III: SPSS Data Entry and Analysis Data provided below.\n\nThe steps will be the same as the ones you have been practicing in Part I of the assignment; the only difference is that you are now responsible for creating the data file, as well. Remember to do the following: a) Name and define your variables under the Variable View, then return to the Data View to enter the data; and b) Paste all SPSS output and graphs into your homework file at the appropriate place. PSYC 354 Homework 1 – 6 Assignment Papers\n\nPart III: Questions 1-4\n\nThe following data are based on numbers taken from the Bureau of Labor Statistics surveys from the years 2009–2013, with some modifications. They represent the average weekly pay for wage and salary earners measured at 4 different quarters each year and broken down by gender.\n\n• Enter these data into a new file containing one variable for gender and one variable for salary.\n\n• For the gender variable in column 1, code women as 1 and men as 2 o Remember to define these in Value Labels as covered in presentations since Module 1. o There will be twenty “1”s and twenty “2”s (as many participants as in each group).\n\n• The corresponding earnings will be entered in the salary column (second column).\n\n• If you need an example, look at the set-up of gender in the “Lesson 21 Practice Data File 1” document.\n\nWomen 649 654 652 675 660 667 675 668 681 671 685 692 676 689 683 700 692 688 688 694 Men 825 818 813 831 822 851 815 816 833 827 830 828 833 846 837 851 868 831 881 854\n\n1) In SPSS, compute descriptive statistics for each gender for these data. The necessary steps are covered in the last 3 slides of this module’s SPSS tutorial.\n\nAnswer- SPSS Table- Descriptive Statistics for Weekly Pay by Gender: (Paste one table; should include weekly pay grouped by men and women)\n\n2) Create a boxplot describing the average overall weekly salary for each gender. Answer- SPSS boxplot: 3) Based on these data, what is the mean weekly income for men? PSYC 354 Homework 1 – 6 Assignment Papers\n\n4) What is the standard deviation of the weekly income for women? Answer\n\nPart IV: Cumulative Questions 1-4\n\nBDI Scores\n\n9 10 9 5 17 3 15 20 17 62\n\n15 12 10 4 61 61 22 15 10 11\n\n• The BDI (Beck et al., 1961) is an instrument widely used to assess levels of depression in individuals in a variety of settings.\n\n• The scores range from 0–63 (whole numbers only).\n\n• A researcher administers the BDI to a sample of college students. The results appear in the table below.\n\n• They are entered as two columns to save space (i.e., you will not need two columns in the SPSS file, only one).\n\n1) Using SPSS, run a frequencies analysis on these scores that includes:\n\n• A Frequency Table\n\n• Table of Descriptive Statistics o Include measures of central tendency, dispersion/spread, and distribution.\n\n• Paste the output into your homework file.\n\nAnswer- SPSS Table- Frequency Table for BDI Scores:\n\nAnswer- SPSS Table- Descriptive Statistics for BDI Scores:\n\n2) Create a graph to describe the data set. Justify why this graph is the best choice for these data. Answer- SPSS graph\n\nExplanation/ Justification 3) Based on your SPSS output, what is the numerical skewness value of this data set? What does this value say about how the scores are distributed? PSYC 354 Homework 1 – 6 Assignment Papers Answer\n\nExplanation\n\n4) Based on your graph and your answers above, which measure of central tendency is most appropriate for describing this group of scores? Why? Answer Explanation/Rationale\n\n### ORDER NOW FOR A CUSTOM-WRITTEN AND PLAGIARISM-FREE PAPER\n\nQuestions 1-10\n\nFill in the highlighted blanks to answer/complete the statements. 1) When a sample has similar characteristics to the population from which it was drawn, the sample is said to be ________.\n\n2) If a finding based on a sample also applies beyond that sample to the entire population, that finding is said to have high external _______.\n\n3) The duplication of the results of a research study in a different context or with a different sample is called ________.\n\n4) Your own estimate of the likelihood that you will win a contest is known as a(n) ________.\n\n5) Expected relative-frequency probability is computed as the number of ________ divided by the number of ________.\n\n6) The ________ group is the group receiving the intervention or treatment of interest.\n\n7) A statement that 2 populations are different from one another is a(n) ________ hypothesis.\n\n8) If you find that the groups you studied differed from each other more than would be expected by chance alone, you ________ the null hypothesis.\n\n9) When you fail to reject the null hypothesis but the null hypothesis is in fact false, you have made a(n) ________ error.\n\n10) When you reject the null hypothesis but the null hypothesis is in fact true, you have made a(n) ________ error.\n\nQuestion 11a-11b\n\nA school psychologist is interested in whether longer recess breaks affect time on task in the classroom. She divides students into two groups: one with a standard recess length of 10 minutes, and one with a longer recess length of 18 minutes, and assesses their time on task in the classroom over a period of 4 weeks. PSYC 354 Homework 1 – 6 Assignment Papers 11-a) What is the likely null hypothesis for this experiment? Answer 11-b) What is the likely research hypothesis for this experiment? Answer\n\nQuestion 12-15\n\nComplete the following exercises:\n\n12) What is the probability of hitting a target if, in the long run, 15 out of every 125 attempts actually hit the target? Answer (show work) 13) On a TV game show, 6 people have won the grand prize and a total of 159 people have competed. Estimate the probability of winning the grand prize. Answer (show work) 14) Convert the following proportions to percentages: a) 0.356 b) .9 c) .1742 a) Answer b) Answer c) Answer\n\n15) Convert the following percentages to proportions: a) 57.8% b) .5% c) 3.3% a) Answer b) Answer c) Answer\n\nPart II & Part III There is no new SPSS material this module/week. No questions for Part II or III .\n\nPart IV: Cumulative Data provided below for Questions 1 and 2.\n\n99.00 96.00 92.00 89.00 85.00 80.00 78.00 76.00 75.00 74.00 72.00 70.00 70.00 67.00 63.00 59.00 53.00\n\nPart IV:\n\nQuestions 1a-1b\n\nThe final grades for students in a freshman seminar are shown in the left-hand column. Enter the data into a new SPSS data file.\n\n• Create the appropriate SPSS graph to show the distribution of students’ grades.\n\n• Compute descriptive statistics for this data.\n\n• Which measure of central tendency would you use to describe this data?\n\n• Why?\n\n1-a) Create the appropriate SPSS graph to show the distribution of students’ grades. Answer: SPSS graph\n\n1-b) Compute descriptive statistics for this data. Which measure of central tendency would you use to describe this data? Why? Answer: Appropriate Descriptive Statistics Table\n\nExplanation/Justification:\n\nCity                                    Livability Rating\n\nBoston                                    73 Austin                                      83 Chicago                                   73 Pittsburgh                              75 San Diego                               80 Jacksonville, FL                    72 Detroit                                    67 Miami                                     71 New York                               73 Portland                                 80 Atlanta                                    78 Charlotte                                77\n\nPart IV:\n\nQuestions 2a & 2b\n\n• The overall livability ratings of 12 US cities appear in the columns to the left.\n\n• The data are based on data taken from this livability calculator (http://www.areavibes.com/).\n\n• Enter the data in a new SPSS file. When creating the City variable, be sure that the type is set to “string” or “text” in the Variable View window so that the names will show up on the graph.\n\n2-a) Create the correct type of graph to display this data, and justify your choice of graph. Answer: paste SPSS graph here\n\nExplanation/Justification: 2-b) What level of measurement (nom., ord., scale) is the variable “City”? What level of measurement is the variable “Livability Rating”? Answer Answer\n\n### PSYC 354 Homework 1 – 6 Assignment Papers\n\n#### PSYC 354 HOMEWORK 5 : Z-Ddistribution\n\nWhat are always the mean and standard deviation of the z-distribution? Define the central limit theorem. Fill in the blanks: A z-score can be thought of as the number of Standard Deviation that a score is from the mean.\n4) Calculating z scores from raw scores: If a population has a mean of m=198 and a standard deviation of s = 20, calculate z scores for each of the following raw scores (X) from this population. Show work on the right hand side, put answers on the left in the space provided.\n5) Calculating raw scores from z scores: If a population has a mean of m=198 and a standard deviation of s = 20, calculate raw scores (X) for each of the following z scores from this population. Show work on the right hand side, put answers on the left in the space provided.\n6) In a normal curve, what percentage of scores falls:\n7) Compute the standard error (sm) for each of the following sample sizes, assuming a population mean of 125 and a standard deviation of 20.\n8) Compute a z-statistic for each of the following sample means, assuming the population has a mean of 100 and a standard deviation of 30 (Remember to compute sM before computing the z statistic!) Create a histogram of the anxiety raw scores and paste it below. Using the descriptives method covered in the presentation and chapter, transform the anxiety raw scores to z-scores, creating a new variable called “z_anxiety.”\nPaste the output of descriptive statistics in the cell below. These descriptive statistics should describe the original raw scores and not the new z-scores. What is the z-score that is closest to 0 (on either side of the mean) in the data set? What is the z-score that is the farthest from 0 (on either side of the mean) in the data set? Based on the histogram from (1a) and your other answers above, would you describe the anxiety data as being normally distributed? Why or why not? Support your answer with information from the chapter and presentations regarding normal and standard normal z-distributions. PSYC 354 Homework 1 – 6 Assignment Papers\n\nGenerate descriptive statistics for this variable. Generate a histogram for this variable. In your data set, standardize the IQ scores by transforming them into z-scores under a new variable “ZIQ.” Using your data set as a reference, what z-score corresponds to a raw IQ score of 115? To a raw IQ score of 79? To a raw IQ score of 107? Based on what you have been told about IQ scores in the beginning of the problem, does this sample’s distribution seem to reflect the distribution of IQ scores in the general population? Why or why not? What is the independent variable in this experiment? What is the dependent variable? What is the likely null hypothesis for this experiment? What is the likely research hypothesis for this experiment? Compute descriptive statistics by diagnosis (that is, for each of the two groups in one table) (2 pts) Construct a boxplot to show the difference between the mean scores of the 2 groups. (3 pts) PSYC 354 Homework 1 – 6 Assignment Papers\n\n#### PSYC 354  Homework 5 Z-Scores\n\nWhen submitting this file, be sure the filename includes your full name, course and section. Example: HW5_JohnDoe_354B01\n\nBe sure you have reviewed this module/week’s lesson and presentations along with the practice data analysis before proceeding to the homework exercises. Complete all analyses in SPSS, then copy and paste your output and graphs into your homework document file. Answer any written questions (such as the text-based questions or the APA Participants section) in the appropriate place within the same file. Part I: Concepts\n\nQuestions 1–9 These questions are based on the Nolan and Heinzen reading and end-of-chapter questions. PSYC 354 Homework 1 – 6 Assignment Papers\n\n1) What are always the mean and standard deviation of the z-distribution? Answer (mean) 0 Answer (standard deviation) 1\n\n2) Define the central limit theorem. Answer Refers to how the distributuin of sample mean is a normal distribution more than distribution of scores even though the population distribution is not normal.\n\n3) Fill in the blanks: A z-score can be thought of as the number of ___ that a score is from the mean. Part I: Questions 4-8\n\nRemember to show work to receive partial credit where applicable. For help working on these problems, refer to the presentation from this module/week on the normal curve and computing z-scores. 4) Calculating z scores from raw scores: If a population has a mean of =198 and a standard deviation of  = 20, calculate z scores for each of the following raw scores (X) from this population. Show work on the right hand side, put answers on the left in the space provided. PSYC 354 Homework 1 – 6 Assignment Papers 4\n\na) X = 210; Z = 0.6 Work:(210-198)/20=0.6 4b) X = 231; Z = 1.65 Work: (231-198)/20=1.65 4c) X = 179; Z = -0.95 Work: (179-198)/20= -0.95 4d) X = 163; Z = -1.75 Work: (163-198)/20= -1.75 5) Calculating raw scores from z scores: If a population has a mean of =198 and a standard deviation of  = 20, calculate raw scores (X) for each of the following z scores from this population. Show work on the right hand side, put answers on the left in the space provided. 5a) Z = .56; X = 209.2 Work: .56(20) + 198 = 209.2 5b) Z = -2.44; X = 149.2 Work: -2.44(20) + 198 = 149.2 5c) Z = -1.0; X = 178 Work: -1.0(20) + 198 = 178 5d) Z = 1.83; X = 234.6 Work: 1.83(20) + 198 = 234.6\n\n6) In a normal curve, what percentage of scores falls: 6a) Above the mean? Answer Work: 6b) Between -1 and +1 standard deviations (SD) from the mean? Answer Work: 6c) Beyond 2 SD’s away from the mean (in the tails on both sides)? Answer Work: 6d) Between the mean and 2 SD’s above the mean? Answer Work:\n\n7) Compute the standard error (m) for each of the following sample sizes, assuming a population mean of 125 and a standard deviation of 20. PSYC 354 Homework 1 – 6 Assignment Papers 7a) 40 Answer Work: 7b) 140 Answer Work: 7c) 1400 Answer Work:\n\n8) Compute a z-statistic for each of the following sample means, assuming the population has a mean of 100 and a standard deviation of 30 (Remember to compute M before computing the z statistic!) 8a) A sample of 32 scores has a mean of 113 Answer Work: 8b) A sample of 80 scores has a mean of 95 Answer Work: 8c) A sample of 50 scores has a mean of 100. Answer Work: Part II: SPSS Analysis\n\nModule 5 Lesson 21 Exercise File 1 Open the “Lesson 21 Exercise File 1” document (found in the course’s Assignment Instructions folder) in order to complete these exercises. Part II:\n\nExercises 1a-1d\n\nUse file: Module 5 Lesson 21 Exercise File 1 Using the data set (answers will be pasted into the blanks below this summary):\n\n• a) Create a histogram of the raw scores\n\n• b) Transform the raw scores to z-scores o Label the new variable “z_anxiety”\n\n• Paste Descriptive Statistics Table of the raw anxiety scores o Note that descriptive statistics should describe the original raw scores and not the new z scores\n\n• c) Identify the z-score that is closest to 0 and farthest from 0.\n\n• d) Evaluate whether the scores are normally distributed. o Support your answer. 1a) Create a histogram of the anxiety raw scores and paste it below. Answer: Histogram 1b) Using the descriptives method covered in the presentation and chapter, transform the anxiety raw scores to z-scores, creating a new variable called “z_anxiety.” Paste the output of descriptive statistics in the cell below. These descriptive statistics should describe the original raw scores and not the new z-scores. PSYC 354 Homework 1 – 6 Assignment Papers\n\nAnswer: Descriptive Statistics Table Descriptive Statistics N Range Minimum Maximum Mean Std. Deviation Variance Skewness Kurtosis Statistic Statistic Statistic Statistic Statistic Std. Error Statistic Statistic Statistic Std. Error Statistic Std. Error Anxiety Scores 15 73 5 78 32.27 6.062 23.478 551.210 .416 .580 -1.124 1.121 Valid N (listwise) 15\n\n1c)\n\nWhat is the z-score that is closest to 0 (on either side of the mean) in the data set? What is the z-score that is the farthest from 0 (on either side of the mean) in the data set? Answer Answer 1d) Based on the histogram from (1a) and your other answers above, would you describe the anxiety data as being normally distributed? Why or why not? Support your answer with information from the chapter and presentations regarding normal and standard normal z-distributions. PSYC 354 Homework 1 – 6 Assignment Papers Answer Justification Part III: SPSS Data Entry and Analysis\n\nData provided below. IQ Scores 79 120 104 145 108 100 115 107 60 122 105 87 98 124 82 93 89 123 117 104 112 96 88 98 105 91 113 123 124 90\n\nPart III:\n\nQuestions 1a-1e\n\nThe data in the columns to the left represent IQ scores of a sample of 30 high school students. In the general population, IQ scores have a mean of 100 and a standard deviation of 15. Enter this data into SPSS. Be sure to save this file, since you will be using it next week as well.\n\n• Generate descriptive statistics for this variable.\n\n• Generate a histogram for this variable.\n\n• In your data set, standardize the IQ scores by transforming them into z-scores o Label the new variable “ZIQ” • Which z-scores corresponds to a raw IQ score of 115, 79 and 107?\n\nData provided below for respective questions.\n\nPart IV: Question 1a-1d (Non-SPSS)\n\nPart IV:\n\nQuestions 2a & 2b (SPSS)\n\nA forensic psychologist wants to examine the level of narcissistic personality traits in those who are diagnosed with antisocial personality disorder (ASPD) and those who do not qualify for ASPD within a local prison population. She administers a measure of narcissistic personality traits where higher scores indicate higher levels of narcissism and scores range from 0–35. PSYC 354 Homework 1 – 6 Assignment Papers\n\n• Create a new SPSS data file for these scores.\n\n• Your file must have 2 variables: Diagnosis and Score.\n\n• Your diagnosis variable must be set up as a 1-column grouping variable with 2 groups (diagnosis, no diagnosis) coded numerically. This will be much like the gender variable you created in a previous module/week. o For example, if you code ASPD Diagnosis as 1 and No ASPD Diagnosis as 2, then the SPSS file will appear somewhat like the following: Column 1 Column 2 “Diagnosis” “Score” 1 23 1 11 1 19\n\n• All ASPD Diagnosis scores from the table above will appear in a similar fashion.\n\n• Then, continuing in the same columns, enter No ASPD Diagnosis information as: Column 1 Column 2 2 10 2 8 2 19 [Continue in this fashion to the end of the file]\n\n### ORDER NOW FOR A CUSTOM-WRITTEN AND PLAGIARISM-FREE PAPER\n\n• a) Compute descriptive statistics by diagnosis (that is, for each of the two groups in one table) using similar steps to those covered in Green and Salkind’s Lesson 21 and in the Module/Week 3 presentation (HS GPA scores by Gender).\n\n• b) Construct a boxplot to show the difference between the mean scores of the 2 groups 2-a) Compute descriptive statistics by diagnosis (that is, for each of the two groups in one table) (2 pts) Answer: SPSS Table- Descriptive Statistics for Score (level of narcissistic personality) grouped by Diagnosis (ASPD/No ASPD): [Paste one table] 2-b) Construct a boxplot to show the difference between the mean scores of the 2 groups. (3 pts) Answer: Boxplot Submit Homework 5 by 11:59 p.m. (ET) on Monday of Module/Week 5. Remember to name file appropriately.\n\nPart I: Questions 1-7\n\nEnd-of-chapter problems:\n\n• If applicable, remember to show work in your homework document for partial credit.\n\n1) What are the 6 steps of hypothesis testing? (State the 6 steps) A) B) C) D) E) F) 2) Using the z table in Appendix B, calculate the following percentages for a z score of -0.45 2-a) % above this z score: Answer Work:\n\n2-b) % below this z score: Answer Work:\n\n2-c) At least as extreme as this z score (on either side): Answer Work: 3) Rewrite each of the following percentages as probabilities, or p levels: 3-a) 5% = Answer\n\n3-c) 43% = Answer 4) If the critical values, or cutoffs, for a two-tailed z test are -2.05 and +2.05, determine whether you would reject or fail to reject the null hypothesis in each of the following cases: 4a) z = 2.23 Answer 4b) z = -0.97 Answer\n\n5) Imagine a class of twenty-five 12-year-old girls with an average height of 62 inches. We know that the population mean and standard deviation for this age group of girls is m=59 inches, s = 1.5 inches. (Note that this is a z statistic problem.)\n\n5a) Calculate the z statistic for this sample (not the z score). Answer\n\n5b) How does this sample mean compare to the distribution of sample means? In other words, how does the height of the girls in the sample compare to the height of girls in th general population? Answer\n\n6) For the following scenarios, identify whether the researcher has expressed a directional or a nondirectional hypothesis:\n\n6a) Social media has changed the levels of closeness in long-distance relationships. Answer\n\n6b) A professor wonders whether students who eat a healthy breakfast score better on exams in morning courses than those who do not eat a healthy breakfast. PSYC 354 Homework 1 – 6 Assignment Papers Answer 7) For the following scenario, state the null and research hypotheses in both words and symbolic notation. Symbolic notation must include the symbols “” and “” and a comparison operator (=, , <, >, , ), as described in Nolan and Heinzen (2014). Remember to consider whether the hypothesis is nondirectional or directional. Scenario: A professor wonders whether students who eat a healthy breakfast score better on exams in morning courses than those who do not eat a healthy breakfast. Null Hypothesis (H0): Symbolic Notation Answer\n\nPart I: Questions 8a-8g Fill in the highlighted blanks with the best word or words. 8-a) Values of a test statistic beyond which you reject the null hypothesis are called ________. 8-b) The ________ is the area in the tails in which the null can be rejected.\n\n8-c) The probability used to determine the critical values, or cutoffs, in hypothesis testing is known as a ________ level, also known as alpha.\n\n8-d) If your data differ from what you would expect if chance were the only thing operating, you would call your finding ________. 8-e) A hypothesis test in which the research hypothesis is directional is a(n) ________ test.\n\n8-f) A hypothesis test in which the research hypothesis specifies that there will be a difference but does not specify the direction of that difference is a(n) ________ test.\n\n8-g) If your z-statistic exceeds the critical cutoff, you can ________ the null hypothesis.\n\nPart I: Questions 10a-10c\n\nThe police department of a major city has found that the average height of their 1,200 officers is 71 inches (in.) with  = 2.6 inches. Use the normal distribution and the formulas and steps in this week’s presentations to answer the following questions:\n\nNote: Showing work is required for this section. Remember that it helps to transfer the raw mean and SD from the description above to the standardized curve shown here (though you don’t need to show this). This helps compare raw and z scores and check your work. 10a) What is the z score for an officer who is 72 inches tall? Based on the z score and the z table, what is the officer’s percentile? (Hint: See slide 7 of this week’s related presentation). PSYC 354 Homework 1 – 6 Assignment Papers Answer (z score): Work (required):\n\nAnswer (percentile): Work/reasoning using z table (required): 10b) What is the height (in inches) that marks the 80th percentile for this group of officers? (Hint: See slides 14-16 of this week’s related presentation)\n\nWork (required):\n\n10c) What percent of officers are between 68 and 72 inches tall? (Hint: See slide 12 of this week’s related presentation) Answer Work (required):\n\nPart I: Questions 11a-11c\n\nThe verbal part of the Graduate Record Exam (GRE) has a  of 500 and  = 100. Use the normal distribution and the formulas and steps in this week’s presentations to answer the following questions:\n\nNote: Showing work is required for this section. Remember that it helps to transfer the raw mean and SD from the description above to the standardized curve shown here (though you don’t need to show this). This helps compare raw and z scores and check your work. 11a) What is the z score for a GRE score of 583? What is the percentile rank of this z score? (Hint: See slide 7 of this week’s related presentation) Answer (z score): Work (required):\n\nAnswer (percentile): Work (required): 11b) What GRE score corresponds to a percentile rank of 25%? (Hint: See slide 17 of this week’s related presentation) Answer Work (required): 11c) If you wanted to select only students at or above the 82nd percentile, what GRE score would you use as a cutoff score (i.e. what GRE score corresponds to this percentile)? (Hint: See slides 14-16 of this week’s related presentation) Answer Work (required):\n\nPart II: SPSS Analysis\n\nFor this section, you will be using last module/week’s data set containing IQ scores. Open the file; it should also contain the standardized IQ variable you created last module/week.\n\nPart II: Question 1a & 1b\n\nUse last week’s HW file that you created using IQ scores, and the SPSS reading and presentation from this week. • Using the z-scored IQ variable, create percentile ranks assuming the scores are normally distributed. o Call the new percentile variable “IQ rank.”\n\n1a) List the first 5 IQ ranks from your file (rows 1–5). Answer: Row 1: Row 2: Row 3: Row 4: Row 5:\n\n1b) Which raw IQ score seems to best divide the top 50% from the bottom 50% of scores? (This score can be found by looking carefully over the values in the IQ rank column) Answer\n\nPart III: SPSS Data Entry and Analysis\n\nThere is no Part III material this module/week.\n\nPart IV: Cumulative Data provided below for respective questions.\n\nPart IV: (Non-SPSS) Questions 1-4\n\nFor a distribution with M = 40 and s = 5:\n\n1) What is the z-score corresponding to a raw score of 32? Answer Work: 2) What is the z-score corresponding to a raw score of 50? Answer Work: 3) If a person has a z-score of 1.8, what is his/her raw score? Answer Work: 4) If a person has a z-score of -.63, what is his/her raw score? Answer Work:\n\nPart IV: (Non-SPSS) Question 5-8 For the following types of data, state the graph that would be the best choice to display the data. Two items have more than one correct answer—for these, either answer is acceptable. PSYC 354 Homework 1 – 6 Assignment Papers 5) A nominal independent variable (IV) and a scale dependent variable (DV) Answer 6) One scale variable with frequencies (when you want to see the general shape of the distribution). Answer 7) One scale IV and one scale DV Answer 8) One nominal variable broken down into percentages Answer\n\n#### PSYC 354 HOMEWORK 7 Confidence Intervals, Effect Size, and Statistical Power\n\nWhen submitting this file, be sure the filename includes your full name, course and section. Example: HW7_JohnDoe_354B01 Be sure you have reviewed this module/week’s lesson and presentations along with the practice data analysis before proceeding to the homework exercises. Complete all analyses in SPSS, then copy and paste your output and graphs into your homework document file. Answer any written questions (such as the text-based questions or the APA Participants section) in the appropriate place within the same file. Part I: Concepts\n\nQuestions 1–8 These questions are based on the Nolan and Heinzen reading and end-of-chapter questions.\n\nPart I: Questions 1a-1e Fill in the highlighted blanks with the best word or words. 1-a) The confidence interval is centered around the _mean_______ of the sample. 1-b) Cohen’s d measures the difference between means in terms of ___standard deviation not standard error_____. According to Cohen’s conventions, a d value of _appropriate measure of effect size 1-c) for a z statistic_______ indicates a small effect. A study that calculates the mean effect size from the individual effect sizes of many 1-d) studies is called a(n) __meta analysis______. Statistical power refers to the probability of successfully rejecting the _null 1-e) hypothesis_______.\n\nPart I: Questions 2-5 End-of-chapter problems: Complete the following problems. Page 1 of 5 PSYC 354 If applicable, remember to show work in your homework document to receive partial credit. 2) List five factors that affect statistical power. For each, indicate how a researcher can leverage/manipulate that factor to increase power in a study. A) Sample Size (increase sample size) B) )Effect Size (increase predicted difference between means/decrease population standard deviation) C) Alpha Level (use less extreme alpha level), D) Test Direction (use a one-tailed test E) Type of Hypothesis Test Used (use more sensitive hypothesis test) 3) Exercise 8.22 from N&amp;H text: In 2006, approximately 47% of Americans, when surveyed by a Gallup poll, felt that having a gun in the home made them safer than having no gun. The margin of error reported was 3%. Construct an interval estimate using these figures. Answer44% – 50% is our interval estimate 4) For each of the following confidence levels, look up the critical z values for a two-tailed test. 4a) 80% (Hint: 10% in each tail): Answer" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.8581428,"math_prob":0.8245048,"size":38539,"snap":"2023-14-2023-23","text_gpt3_token_len":9495,"char_repetition_ratio":0.15059038,"word_repetition_ratio":0.16762134,"special_character_ratio":0.26308414,"punctuation_ratio":0.0989535,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.98470074,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-03-29T16:08:36Z\",\"WARC-Record-ID\":\"<urn:uuid:09dc2e54-b832-49a9-aea7-91ea868f39de>\",\"Content-Length\":\"129298\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:60b69807-b168-4f85-aca8-cf7fec24985c>\",\"WARC-Concurrent-To\":\"<urn:uuid:be4fd848-5c1b-49fa-86b9-f307c4f38c43>\",\"WARC-IP-Address\":\"167.114.157.85\",\"WARC-Target-URI\":\"https://ulcius.com/2020/05/01/psyc-354-homework-1-6-assignment-papers/\",\"WARC-Payload-Digest\":\"sha1:AUGGQOBNQTUGPZEZFV2EKT5SVPSJIU6U\",\"WARC-Block-Digest\":\"sha1:6RWPMMII4R4ZWAZOXZMZ7EAOUYKQMMC3\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-14/CC-MAIN-2023-14_segments_1679296949009.11_warc_CC-MAIN-20230329151629-20230329181629-00355.warc.gz\"}"}
https://books.google.no/books?qtid=6e7e788c&lr=&id=K-I2AAAAMAAJ&hl=no&sa=N&start=30
[ "Søk Bilder Maps Play YouTube Nyheter Gmail Disk Mer »\nLogg på\n Bøker Bok", null, "To divide a given straight line into two parts, so that the rectangle contained by the whole, and one of the parts, may be equal to the square of the other part.", null, "The Elements of Euclid: The Errors, by which Theon, Or Others, Have Long Ago ... - Side 64\nav Robert Simson - 1806 - 518 sider\nUten tilgangsbegrensning - Om denne boken", null, "## The Elements of Euclid; viz. the first six books,together with the eleventh ...\n\nEuclides - 1841 - 351 sider\n...equal to the square of the other part. Let AB be the given straight line; it is required to divide it into two parts, so that the rectangle contained by...parts, shall be equal to the square of the other part. Upon AB describe* the square ABDC; bisect* AC * 46. 1. in E, and join BE; produce CA to F, making*...\nUten tilgangsbegrensning - Om denne boken", null, "## Elements of geometry: consisting of the first four,and the sixth, books of ...\n\nEuclides - 1842\n...equivalent to double the squares of AC, CD. If therefore a straight line, &c. QED PROP. XI. PROB. To divide a given straight line into two parts, so that the...contained by the whole, and one of the parts, shall be equivalent to the square of the other part. Let AB be the given straight line : it is required to divide...\nUten tilgangsbegrensning - Om denne boken", null, "## Elements of Geometry: Containing the First Six Books of Euclid, with a ...\n\nJohn Playfair - 1842 - 317 sider\n...(2a-f*)2+*2=2a2+2(a+i)2, and the proposition is evident from this algebraical equality. PROP. XI. PROB. To divide a given straight line into two parts, so that the...rectangle contained by the whole, and one of the parts, may be equal to the square of the other part. Let AB be the given straight line ; it is required to...\nUten tilgangsbegrensning - Om denne boken", null, "## Proceedings\n\n...the squares described on the other two sides, these sides contain a right angle. 3. Divide a given line into two parts, so that the rectangle contained by the whole line and one of the parts may be equal to the square of the other part. 4. The angle in a semicircle...\nUten tilgangsbegrensning - Om denne boken", null, "## The British Annals of Education for ...: Being The Scholastic ..., Volum 1\n\n1844\n...contained by the whole and each of the parts are together equal to the square of the whole line. 7. Divide a given straight line into two parts, so that the...parts shall be equal to the square of the other part. 8. If in a circle two straight lines cut one another, which do not both pass through the centre, they...\nUten tilgangsbegrensning - Om denne boken", null, "## Elements of Geometry: Containing the First Six Books of Euclid, with a ...\n\nJohn Playfair - 1844 - 317 sider\n...straight line ; it is required to divide it into two parts, so that the rectangle contained by Ji ^j. the whole, and one of the parts, shall be equal to the square of the other part. Upon AB describe (46. 1.) the square ABDC ; bisect (10. 1.) AC in E, and join BE ; produce CA to F,...\nUten tilgangsbegrensning - Om denne boken", null, "## Report of the Committee of Council on Education (England and Wales ..., Volum 2\n\n...rectangle contained by the whole and that part, together with the square of the other part. 62. To divide a given straight line into two parts, so that the...parts, shall be equal to the square of the other part. 63. Show that if — B he substracted from A, the result is A + B. 64. Perform the operations indicated...\nUten tilgangsbegrensning - Om denne boken", null, "## Euclid in Paragraphs: The Elements of Euclid: Containing the First Six Books ...\n\nEuclid - 1845 - 199 sider\n...equal to the square of the other part. Let AB be the given straight line; it is required to divide it into two parts, so that the rectangle contained by...parts, shall be equal to the square of the other part. Upon AB describe* the square ABDC ; bisectf AC in • 46. i. E, and join BE; produce CA to F, and makeJ...\nUten tilgangsbegrensning - Om denne boken", null, "## Euclid's Elements of geometry [book 1-6, 11,12] with explanatory notes ...\n\nEuclides - 1845\n...equal to the square of the other part. Let AB be the given straight line. It is required to divide AB into two parts, so that the rectangle contained by...parts, shall be equal to the square of the other part. H KD Upon AB describe the square ACDB; (i. 46.) bisect AC in E, (i. 10.) and join BE, produce CA to...\nUten tilgangsbegrensning - Om denne boken", null, "## A Treatise on Algebra: Symbolical algebra and its applications to the ...\n\nGeorge Peacock - 1845\n...the following problem. Its first case stated and solved. \" To divide a given line into two such parts that the rectangle contained by the whole and one...parts shall be equal to the square of the other.\" If we call x the greater of the two parts, and, therefore, a - x the other, the equation will become...\nUten tilgangsbegrensning - Om denne boken" ]
[ null, "https://books.google.no/googlebooks/quote_l.gif", null, "https://books.google.no/googlebooks/quote_r.gif", null, "https://books.google.no/books/content", null, "https://books.google.no/books/content", null, "https://books.google.no/books/content", null, "https://books.google.no/books/content", null, "https://books.google.no/books/content", null, "https://books.google.no/books/content", null, "https://books.google.no/books/content", null, "https://books.google.no/books/content", null, "https://books.google.no/books/content", null, "https://books.google.no/books/content", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.8435603,"math_prob":0.976981,"size":3371,"snap":"2021-04-2021-17","text_gpt3_token_len":870,"char_repetition_ratio":0.19661419,"word_repetition_ratio":0.38985738,"special_character_ratio":0.2818155,"punctuation_ratio":0.2272175,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.98672736,"pos_list":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24],"im_url_duplicate_count":[null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-01-19T10:22:02Z\",\"WARC-Record-ID\":\"<urn:uuid:adb29762-7b05-492c-a3d9-99eb6f94a0c2>\",\"Content-Length\":\"30909\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:952ddeb0-8657-4ef0-8213-790f0db8e12c>\",\"WARC-Concurrent-To\":\"<urn:uuid:15bd96e6-aaf3-4315-a6c3-e8afb90f9bab>\",\"WARC-IP-Address\":\"172.217.7.142\",\"WARC-Target-URI\":\"https://books.google.no/books?qtid=6e7e788c&lr=&id=K-I2AAAAMAAJ&hl=no&sa=N&start=30\",\"WARC-Payload-Digest\":\"sha1:V5U3LP23NPQMIBPJZMP65KISU663YKIN\",\"WARC-Block-Digest\":\"sha1:ILNLZG75S5BPGOU2KZWZEXE7LPSA7W3V\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-04/CC-MAIN-2021-04_segments_1610703518201.29_warc_CC-MAIN-20210119072933-20210119102933-00552.warc.gz\"}"}
https://tysonbarrett.com/jekyll/update/2018/03/29/jamovi_logistic/
[ "# Using Jamovi: Logistic Regression\n\nThis post is part of a series–demonstrating the use of Jamovi–mainly because some of my students asked for it. Notably, this is using version 0.8.6.0. Today’s topic is logistic regression (with a binary outcome).\n\nNote: This starts by assuming you know how to get data into Jamovi and start getting descriptive statistics.\n\n## Logistic Regression\n\nRunning correlation in Jamovi requires only a few steps once the data is ready to go. To start, click on the Regression tab and then on 2 Outcomes below the “Logistic Regression” minor header. The following screen becomes visible.", null, "In this instance, we need to have a binary outcome that we put into the “Dependent Variable” slot. As was the case in the Linear Regression method in Jamovi, the covariates are the continuous predictors and the factors are the categorical predictors. Here, we have a continuous predictor and a categorical predictor.", null, "Notice that the tables start autofilling once you place the variables in those slots.\n\n### Model Specifications\n\nThe next thing we need to consider is how the model will look and how we will built up the models. There’s no “proven” way to do this but there are some common practices. To build the model, we will use the + Add New Block button. “Blocks” are individual building blocks of the final model. In each block we will add a variable(s). Each block is then compared statistically so we can decide if one model is significantly better than the others.", null, "In the example above, we start with just inco (income) in the model (Block 1). Then we add another block and add show (Block 2). Notice that in the output we have a few things showing up.\n\n• We have model fit statistics for each model.\n• We have a “Model Comparisons” table showing us that from model 1 to 2, we are significantly different (p = .040).\n• Then we have “Model Specific Results” with a drop-down menu to select one of the models (right now it is on Model 2).\n\nFrom here, we can also look at an interaction between Pretest and Group. To do that we add a new block, highlight both pretest and group from the left-hand side list, select the arrow that has a downward triangle and select “Interaction”. When we do that, the new block has Group*Pretest now added to it, which means we did it right.", null, "In this case, we can see that the model with the interaction isn’t statistically better than the model without it (p = .627). At this point, we have our model built up very well but now we can make small adjustments with the following menus.\n\n### Reference Levels\n\nThis menu allows us to change the reference level of any categorical variables. This includes our outcome variable, since it is also a categorical variable. We can change either reference category. For the outcome, that changes what we are predicting; when the reference category is 0, we are predicting the probability of being 1 in the outcome. If we switch it, we would be predicting being 0.\n\nNotice that in the coefficients table, it says The Office - Parks and Rec under Show:. This says that (and the screenshot agrees), level “Parks and Rec” is the reference level. This means, our comparisons for the show variable is in reference to “Parks and Rec”. So any differences reported are based on a comparison with “Parks and Rec”. We can change this if we need to in order to understand the model better.", null, "### Assumption Checks\n\nJamovi provides only one assumption check–that for collinearity. I won’t cover the meaning of that here, but know that it is possible to check that. Other assumptions are much more difficult to test in general, and are therefore not (yet?) integrated into Jamovi.\n\n### Model Fit\n\nThe model fit menu gives us the options to get a number of model fit statistics. For our purposes, the default works just fine.", null, "### Model Coefficients\n\nWe can also ask for a bit more information regarding our model estimates. The most important thing to ask for here are the odds ratios and the confidence intervals of the odds ratios.", null, "### Estimated Marginal Means\n\nFinally and importantly, we can look at the estimated marginal means. This will provide plots that can help understand coefficients better, particularly interactions. In logistic regression, we are going to be assessing the predicted probabilities across variables. Here, we see the predicted probabilities across income.", null, "In the screenshot above, Term 1 is the main effect of income because that is the variable I dragged to that slot. Term 2 is show’s main effect. Term 3 is the interaction between pretest and group since they are both in there. It is best if one of the variables is continuous, make that one the first one in there. That is because the second is always considered a grouping variable. So, with continuous variables, it chops it up into three parts and using it as a categorical predictor for the plot.\n\n### Prediction\n\nThe prediction menu is particular to logistic regression in Jamovi. This shows us how well our model predicts the outcome of interest. High prediction success can tell us that our model is “good” or “useful.” In the screenshot below, we select the classification table and the accuracy options. Other important options exist, but I won’t cover those here.", null, "In the screenshot, the classification table is shown. In this example, our prediction accuracy of those that don’t use substances (subs = 0) is high (93.3%) while our prediction accuracy of those that use substances (subs = 1) is low (25.0%). Our overall accuracy rate is 78.9%. Overall, this suggests that our model is not all that great at predicting substance use in this sample.\n\n## Conclusions\n\nWell, that’s it for now. Leave comments or questions below!" ]
[ null, "https://tysonbarrett.com/assets/Jamovi/logreg_01.png", null, "https://tysonbarrett.com/assets/Jamovi/logreg_02.png", null, "https://tysonbarrett.com/assets/Jamovi/logreg_03.png", null, "https://tysonbarrett.com/assets/Jamovi/logreg_04.png", null, "https://tysonbarrett.com/assets/Jamovi/logreg_05.png", null, "https://tysonbarrett.com/assets/Jamovi/logreg_07.png", null, "https://tysonbarrett.com/assets/Jamovi/logreg_08.png", null, "https://tysonbarrett.com/assets/Jamovi/logreg_09.png", null, "https://tysonbarrett.com/assets/Jamovi/logreg_10.png", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.92821974,"math_prob":0.9272221,"size":5651,"snap":"2022-27-2022-33","text_gpt3_token_len":1226,"char_repetition_ratio":0.12165752,"word_repetition_ratio":0.004127967,"special_character_ratio":0.21359052,"punctuation_ratio":0.106980965,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99239904,"pos_list":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18],"im_url_duplicate_count":[null,5,null,5,null,5,null,5,null,5,null,5,null,5,null,5,null,5,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-07-05T11:41:51Z\",\"WARC-Record-ID\":\"<urn:uuid:117d678c-2060-42fb-bbf1-3ff05cfa1b27>\",\"Content-Length\":\"16685\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:ff4d7ccb-f71a-483b-b628-d98c437cbbab>\",\"WARC-Concurrent-To\":\"<urn:uuid:b05ffe2c-afa9-424a-a8fb-586949c20ff4>\",\"WARC-IP-Address\":\"185.199.110.153\",\"WARC-Target-URI\":\"https://tysonbarrett.com/jekyll/update/2018/03/29/jamovi_logistic/\",\"WARC-Payload-Digest\":\"sha1:66OAHYWBSAHS2O2BCWOFHZ7MGV34YCNI\",\"WARC-Block-Digest\":\"sha1:Q5MB77BNDFEPKIH7SEQ3WPRJGO6BSHU2\",\"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-00367.warc.gz\"}"}
https://en.formulasearchengine.com/wiki/Integer
[ "# Integer\n\n{{#invoke:Hatnote|hatnote}} {{ safesubst:#invoke:Unsubst||$N=Refimprove |date=__DATE__ |$B= {{#invoke:Message box|ambox}} }} Template:Sidebox Template:Group theory sidebar\n\nAn integer (from the Latin integer meaning \"whole\")[note 1] is a number that can be written without a fractional component. For example, 21, 4, 0, and −2048 are integers, while 9.75, 5½, and Template:Sqrt are not.\n\nThe set of integers consists of zero (0), the natural numbers (1, 2, 3, ...), also called whole numbers or counting numbers, and their additive inverses (the negative integers, i.e. −1, −2, −3, ...). This is often denoted by a boldface Z (\"Z\") or blackboard bold ${\\mathbb {Z} }$", null, "(Unicode U+2124 ) standing for the German word Zahlen (Template:IPA-de, \"numbers\"). is a subset of the sets of rational and real numbers and, like the natural numbers, is countably infinite.\n\nThe integers form the smallest group and the smallest ring containing the natural numbers. In algebraic number theory, the integers are sometimes called rational integers to distinguish them from the more general algebraic integers. In fact, the (rational) integers are the algebraic integers that are also rational numbers.\n\n## Algebraic properties", null, "Integers can be thought of as discrete, equally spaced points on an infinitely long number line. In the above, non-negative integers are shown in purple and negative integers in red.\n\nLike the natural numbers, Z is closed under the operations of addition and multiplication, that is, the sum and product of any two integers is an integer. However, with the inclusion of the negative natural numbers, and, importantly, 0, Z (unlike the natural numbers) is also closed under subtraction. The integers form a unital ring which is the most basic one, in the following sense: for any unital ring, there is a unique ring homomorphism from the integers into this ring. This universal property, namely to be an initial object in the category of rings, characterizes the ring Z.\n\nZ is not closed under division, since the quotient of two integers (e.g., 1 divided by 2), need not be an integer. Although the natural numbers are closed under exponentiation, the integers are not (since the result can be a fraction when the exponent is negative).\n\nThe following lists some of the basic properties of addition and multiplication for any integers a, b and c.\n\nAddition Multiplication a + bTemplate:Padis an integer a × bTemplate:Padis an integer a + (b + c) = (a + b) + c a × (b × c) = (a × b) × c a + b = b + a a × b = b × a a + 0 = a a × 1 = a a + (−a) = 0 An inverse element usually does not exist at all. a × (b + c) = (a × b) + (a × c)Template:PadandTemplate:Pad(a + b) × c = (a × c) + (b × c) If a × b = 0, then a = 0 or b = 0 (or both)\n\nIn the language of abstract algebra, the first five properties listed above for addition say that Z under addition is an abelian group. As a group under addition, Z is a cyclic group, since every non-zero integer can be written as a finite sum 1 + 1 + ⋯ + 1 or (−1) + (−1) + ⋯ + (−1). In fact, Z under addition is the only infinite cyclic group, in the sense that any infinite cyclic group is isomorphic to Z.\n\nThe first four properties listed above for multiplication say that Z under multiplication is a commutative monoid. However not every integer has a multiplicative inverse; e.g. there is no integer x such that 2x = 1, because the left hand side is even, while the right hand side is odd. This means that Z under multiplication is not a group.\n\nAll the rules from the above property table, except for the last, taken together say that Z together with addition and multiplication is a commutative ring with unity. It is the prototype of all objects of such algebraic structure. Only those equalities of expressions are true in Z for all values of variables, which are true in any unital commutative ring. Note that certain non-zero integers map to zero in certain rings.\n\nAt last, the property (*) says that the commutative ring Z is an integral domain. In fact, Z provides the motivation for defining such a structure.\n\nThe lack of multiplicative inverses, which is equivalent to the fact that Z is not closed under division, means that Z is not a field. The smallest field with the usual operations containing the integers is the field of rational numbers. The process of constructing the rationals from the integers can be mimicked to form the field of fractions of any integral domain. And back, starting from an algebraic number field (an extension of rational numbers), its ring of integers can be extracted, which includes Z as its subring.\n\nAlthough ordinary division is not defined on Z, the division \"with remainder\" is defined on them. It is called Euclidean division and possesses the following important property: that is, given two integers a and b with b ≠ 0, there exist unique integers q and r such that a = q × b + r and 0 ≤ r < | b |, where | b | denotes the absolute value of b. The integer q is called the quotient and r is called the remainder of the division of a by b. The Euclidean algorithm for computing greatest common divisors works by a sequence of Euclidean divisions.\n\nAgain, in the language of abstract algebra, the above says that Z is a Euclidean domain. This implies that Z is a principal ideal domain and any positive integer can be written as the products of primes in an essentially unique way. This is the fundamental theorem of arithmetic.\n\n## Order-theoretic properties\n\nZ is a totally ordered set without upper or lower bound. The ordering of Z is given by:\n\n... −3 < −2 < −1 < 0 < 1 < 2 < 3 < ...\n\nAn integer is positive if it is greater than zero and negative if it is less than zero. Zero is defined as neither negative nor positive.\n\nThe ordering of integers is compatible with the algebraic operations in the following way:\n\n1. if a < b and c < d, then a + c < b + d\n2. if a < b and 0 < c, then ac < bc.\n\nIt follows that Z together with the above ordering is an ordered ring.\n\nThe integers are the only nontrivial totally ordered abelian group whose positive elements are well-ordered. This is equivalent to the statement that any Noetherian valuation ring is either a field or a discrete valuation ring.\n\n## Construction", null, "Red points represent ordered pairs of natural numbers. Linked red points are equivalence classes representing the blue integers at the end of the line.\n\nIn elementary school teaching, integers are often intuitively defined as the disjoint union of the (positive) natural numbers, the singleton set whose only element is zero, and the negations of natural numbers. However, this style of definition leads to many different cases (each arithmetic operation needs to be defined on each combination of types of integer) and makes it difficult to prove that these operations obey the laws of arithmetic. Therefore, in modern set-theoretic mathematics a more abstract construction, which allows one to define the arithmetical operations without any case distinction, is often used instead. The integers can thus be formally constructed as the equivalence classes of ordered pairs of natural numbers (a,b).\n\nThe intuition is that (a,b) stands for the result of subtracting b from a. To confirm our expectation that 1 − 2 and 4 − 5 denote the same number, we define an equivalence relation ~ on these pairs with the following rule:\n\n$(a,b)\\sim (c,d)\\,\\!$", null, "precisely when\n\n$a+d=b+c.\\,\\!$", null, "Addition and multiplication of integers can be defined in terms of the equivalent operations on the natural numbers; denoting by [(a,b)] the equivalence class having (a,b) as a member, one has:\n\n$[(a,b)]+[(c,d)]:=[(a+c,b+d)].\\,$", null, "$[(a,b)]\\cdot [(c,d)]:=[(ac+bd,ad+bc)].\\,$", null, "The negation (or additive inverse) of an integer is obtained by reversing the order of the pair:\n\n$-[(a,b)]:=[(b,a)].\\,$", null, "Hence subtraction can be defined as the addition of the additive inverse:\n\n$[(a,b)]-[(c,d)]:=[(a+d,b+c)].\\,$", null, "The standard ordering on the integers is given by:\n\n$[(a,b)]<[(c,d)]\\,$", null, "iff $a+d", null, "It is easily verified that these definitions are independent of the choice of representatives of the equivalence classes.\n\nEvery equivalence class has a unique member that is of the form (n,0) or (0,n) (or both at once). The natural number n is identified with the class [(n,0)] (in other words the natural numbers are embedded into the integers by map sending n to [(n,0)]), and the class [(0,n)] is denoted −n (this covers all remaining classes, and gives the class [(0,0)] a second time since −0 = 0.\n\nThus, [(a,b)] is denoted by\n\n${\\begin{cases}a-b,&{\\mbox{if }}a\\geq b\\\\-(b-a),&{\\mbox{if }}a", null, "If the natural numbers are identified with the corresponding integers (using the embedding mentioned above), this convention creates no ambiguity.\n\nThis notation recovers the familiar representation of the integers as {... −3,−2,−1, 0, 1, 2, 3, ...}.\n\nSome examples are:\n\n{\\begin{aligned}0&=[(0,0)]&=[(1,1)]&=\\cdots &&=[(k,k)]\\\\1&=[(1,0)]&=[(2,1)]&=\\cdots &&=[(k+1,k)]\\\\-1&=[(0,1)]&=[(1,2)]&=\\cdots &&=[(k,k+1)]\\\\2&=[(2,0)]&=[(3,1)]&=\\cdots &&=[(k+2,k)]\\\\-2&=[(0,2)]&=[(1,3)]&=\\cdots &&=[(k,k+2)].\\end{aligned}}", null, "## Computer science\n\n{{#invoke:main|main}} An integer is often a primitive data type in computer languages. However, integer data types can only represent a subset of all integers, since practical computers are of finite capacity. Also, in the common two's complement representation, the inherent definition of sign distinguishes between \"negative\" and \"non-negative\" rather than \"negative, positive, and 0\". (It is, however, certainly possible for a computer to determine whether an integer value is truly positive.) Fixed length integer approximation data types (or subsets) are denoted int or Integer in several programming languages (such as Algol68, C, Java, Delphi, etc.).\n\nVariable-length representations of integers, such as bignums, can store any integer that fits in the computer's memory. Other integer data types are implemented with a fixed size, usually a number of bits which is a power of 2 (4, 8, 16, etc.) or a memorable number of decimal digits (e.g., 9 or 10).\n\n## Cardinality\n\nThe cardinality of the set of integers is equal to $\\aleph _{0}$", null, "(aleph-null). This is readily demonstrated by the construction of a bijection, that is, a function that is injective and surjective from Z to N. If N = {0, 1, 2, ...} then consider the function:\n\n$f(x)={\\begin{cases}2|x|,&{\\mbox{if }}x<0\\\\0,&{\\mbox{if }}x=0\\\\2x-1,&{\\mbox{if }}x>0.\\end{cases}}$", null, "{... (-4,8) (-3,6) (-2,4) (-1,2) (0,0) (1,1) (2,3) (3,5) ...}\n\nIf N = {1, 2, 3, ...} then consider the function:\n\n$g(x)={\\begin{cases}2|x|,&{\\mbox{if }}x<0\\\\2x+1,&{\\mbox{if }}x\\geq 0.\\end{cases}}$", null, "{... (-4,8) (-3,6) (-2,4) (-1,2) (0,1) (1,3) (2,5) (3,7) ...}\n\nIf the domain is restricted to Z then each and every member of Z has one and only one corresponding member of N and by the definition of cardinal equality the two sets have equal cardinality." ]
[ null, "https://en.formulasearchengine.com/index.php", null, "https://upload.wikimedia.org/wikipedia/commons/thumb/9/93/Number-line.svg/300px-Number-line.svg.png", null, "https://upload.wikimedia.org/wikipedia/commons/thumb/2/27/Relatives_Numbers_Representation.png/600px-Relatives_Numbers_Representation.png", null, "https://en.formulasearchengine.com/index.php", null, "https://en.formulasearchengine.com/index.php", null, "https://en.formulasearchengine.com/index.php", null, "https://en.formulasearchengine.com/index.php", null, "https://en.formulasearchengine.com/index.php", null, "https://en.formulasearchengine.com/index.php", null, "https://en.formulasearchengine.com/index.php", null, "https://en.formulasearchengine.com/index.php", null, "https://en.formulasearchengine.com/index.php", null, "https://en.formulasearchengine.com/index.php", null, "https://en.formulasearchengine.com/index.php", null, "https://en.formulasearchengine.com/index.php", null, "https://en.formulasearchengine.com/index.php", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.86848223,"math_prob":0.9968473,"size":11401,"snap":"2019-43-2019-47","text_gpt3_token_len":2837,"char_repetition_ratio":0.13880846,"word_repetition_ratio":0.018897638,"special_character_ratio":0.2571704,"punctuation_ratio":0.15329768,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99940956,"pos_list":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32],"im_url_duplicate_count":[null,null,null,null,null,6,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-11-19T03:24:50Z\",\"WARC-Record-ID\":\"<urn:uuid:95879e11-a387-42f7-bcf7-91e3f2987b51>\",\"Content-Length\":\"80675\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:6d0fd791-7671-40aa-be33-701ee4c9f00f>\",\"WARC-Concurrent-To\":\"<urn:uuid:0d2ca313-6469-4ded-ac43-ebfb371e6700>\",\"WARC-IP-Address\":\"132.195.228.228\",\"WARC-Target-URI\":\"https://en.formulasearchengine.com/wiki/Integer\",\"WARC-Payload-Digest\":\"sha1:7TZH5QI3ZHK6IWAS5YBYNHULEGSY27GZ\",\"WARC-Block-Digest\":\"sha1:Y3H6Q6XTFCRV2UQNOTQQYNC2EGAFTPFE\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-47/CC-MAIN-2019-47_segments_1573496669967.80_warc_CC-MAIN-20191119015704-20191119043704-00160.warc.gz\"}"}
https://artofproblemsolving.com/wiki/index.php?title=2004_AMC_12A_Problems/Problem_7&oldid=100089
[ "# 2004 AMC 12A Problems/Problem 7\n\nThe following problem is from both the 2004 AMC 12A #7 and 2004 AMC 10A #8, so both problems redirect to this page.\n\n## Problem\n\nA game is played with tokens according to the following rule. In each round, the player with the most tokens gives one token to each of the other players and also places one token in the discard pile. The game ends when some player runs out of tokens. Players", null, "$A$,", null, "$B$, and", null, "$C$ start with", null, "$15$,", null, "$14$, and", null, "$13$ tokens, respectively. How many rounds will there be in the game?", null, "$\\mathrm{(A) \\ } 36 \\qquad \\mathrm{(B) \\ } 37 \\qquad \\mathrm{(C) \\ } 38 \\qquad \\mathrm{(D) \\ } 39 \\qquad \\mathrm{(E) \\ } 40$\n\n## Solution\n\nWe look at a set of three rounds, where the players begin with", null, "$x+1$,", null, "$x$, and", null, "$x-1$ tokens. After three rounds, there will be a net loss of", null, "$1$ token per player (they receive two tokens and lose three). Therefore, after", null, "$36$ rounds -- or", null, "$12$ three-round sets,", null, "$A,B$ and", null, "$C$ will have", null, "$3$,", null, "$2$, and", null, "$1$ tokens, respectively. After", null, "$1$ more round, player", null, "$A$ will give away", null, "$3$ tokens, leaving it empty-handed, and thus the game will end. We then have there are", null, "$36+1=\\boxed{\\mathrm{(B)}\\ 37}$ rounds until the game ends.\n\nThe problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.", null, "" ]
[ null, "https://latex.artofproblemsolving.com/0/1/9/019e9892786e493964e145e7c5cf7b700314e53b.png ", null, "https://latex.artofproblemsolving.com/f/f/5/ff5fb3d775862e2123b007eb4373ff6cc1a34d4e.png ", null, "https://latex.artofproblemsolving.com/c/3/3/c3355896da590fc491a10150a50416687626d7cc.png ", null, "https://latex.artofproblemsolving.com/f/1/9/f1965fae079a9ba2c0726c307070c2355dfcb213.png ", null, "https://latex.artofproblemsolving.com/8/2/0/820a20de2847dfdc1bc5cffc8d904933150032bd.png ", null, "https://latex.artofproblemsolving.com/0/3/0/030e19e4e2f1c074127cb50581e8496470c5419f.png ", null, "https://latex.artofproblemsolving.com/6/a/e/6aecdd53c8980dfe4b2f57c756f8559d138d1b05.png ", null, "https://latex.artofproblemsolving.com/c/c/c/cccb103143393c0119f5ab61d6d53a852ce70fcf.png ", null, "https://latex.artofproblemsolving.com/2/6/e/26eeb5258ca5099acf8fe96b2a1049c48c89a5e6.png ", null, "https://latex.artofproblemsolving.com/d/4/b/d4baf6d4b1cfa69b68b3204b5e2eba0c5755fe20.png ", null, "https://latex.artofproblemsolving.com/d/c/e/dce34f4dfb2406144304ad0d6106c5382ddd1446.png ", null, "https://latex.artofproblemsolving.com/c/e/5/ce5d3cbb9ab0a992ed503c2d4499e4f4af2f9d65.png ", null, "https://latex.artofproblemsolving.com/e/d/f/edf074831eb5bc9e61d6d6e09f525a86e3068f6a.png ", null, "https://latex.artofproblemsolving.com/5/f/6/5f642cbbd390b4882363ab6b5c2906dbf6be6cc8.png ", null, "https://latex.artofproblemsolving.com/c/3/3/c3355896da590fc491a10150a50416687626d7cc.png ", null, "https://latex.artofproblemsolving.com/7/c/d/7cde695f2e4542fd01f860a89189f47a27143b66.png ", null, "https://latex.artofproblemsolving.com/4/1/c/41c544263a265ff15498ee45f7392c5f86c6d151.png ", null, "https://latex.artofproblemsolving.com/d/c/e/dce34f4dfb2406144304ad0d6106c5382ddd1446.png ", null, "https://latex.artofproblemsolving.com/d/c/e/dce34f4dfb2406144304ad0d6106c5382ddd1446.png ", null, "https://latex.artofproblemsolving.com/0/1/9/019e9892786e493964e145e7c5cf7b700314e53b.png ", null, "https://latex.artofproblemsolving.com/7/c/d/7cde695f2e4542fd01f860a89189f47a27143b66.png ", null, "https://latex.artofproblemsolving.com/b/5/4/b541ff4bc07ee89a27c98da3172173ec71a76e71.png ", null, "https://wiki-images.artofproblemsolving.com//8/8b/AMC_logo.png", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.83588064,"math_prob":0.9991715,"size":1571,"snap":"2021-43-2021-49","text_gpt3_token_len":474,"char_repetition_ratio":0.14231014,"word_repetition_ratio":0.31547618,"special_character_ratio":0.36282623,"punctuation_ratio":0.10064935,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9988876,"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],"im_url_duplicate_count":[null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-12-08T20:15:39Z\",\"WARC-Record-ID\":\"<urn:uuid:bccc016a-2e9a-47cc-9b9d-da67aae609c3>\",\"Content-Length\":\"47321\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:e9d845a4-6a7a-42cc-983e-c9f69d7d6cf8>\",\"WARC-Concurrent-To\":\"<urn:uuid:281930c0-c4c0-4b7d-97c0-696bfdcb142a>\",\"WARC-IP-Address\":\"104.26.11.229\",\"WARC-Target-URI\":\"https://artofproblemsolving.com/wiki/index.php?title=2004_AMC_12A_Problems/Problem_7&oldid=100089\",\"WARC-Payload-Digest\":\"sha1:U5SB4HXZX7CAQOCK57ALE7XJI5WROTBX\",\"WARC-Block-Digest\":\"sha1:IFVZXLI2TXKJYTR5VFI6JACDJSU6BDA6\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-49/CC-MAIN-2021-49_segments_1637964363520.30_warc_CC-MAIN-20211208175210-20211208205210-00531.warc.gz\"}"}
https://luapower.com/lpeglabel
[ "This package\nlpeglabel\n\nStandard Libraries\nglue\npp\noo\nevents\ncoro\nerrors\nlpeglabel\ndollar\nlogging\n\n# lpeglabel\n\n## Introduction\n\nLPegLabel is a conservative extension of the LPeg library that provides an implementation of Parsing Expression Grammars (PEGs) with labeled failures. Labels can be used to signal different kinds of errors and to specify which recovery pattern should handle a given label. Labels can also be combined with the standard patterns of LPeg.\n\nBesides that, LPegLabel also reports the farthest failure position in case of an ordinary failure (which is represented by label fail).\n\nThis document describes the new functions available in LpegLabel and presents some examples of usage.\n\nWith labeled failures it is possible to distinguish between an ordinary failure and an error. Usually, an ordinary failure is produced when the matching of a character fails, and this failure is caught by ordered choice. An error (a non-ordinary failure), by its turn, is produced by the throw operator and may be caught by a recovery rule.\n\nIn LPegLabel, the result of an unsuccessful matching is a triple nil, lab, errpos, where lab is the label associated with the failure (a string or an integer), and errpos is the input position being matched when lab was thrown.\n\nWhen lab is an ordinary failure and no error was thrown before, errpos is the farthest position where an ordinary failure occurred. In case lab is an ordinary failure and an error was thrown before, errpos is the farthest input position where an ordinary failure occurred after the last error.\n\nBelow there is a brief summary of the new functions provided by LpegLabel:\n\n Function Description `lpeglabel.T (l)` Throws a label `l` to signal an error `%{l}` Syntax of relabel module. Equivalent to `lpeglabel.T(l)` `p^l` Syntax sugar available at relabel for `p / %{l}` `relabel.calcline(subject, i)` Calculates line and column information regarding position i of the subject\n\n### Functions\n\n#### `lpeglabel.T(l)`\n\nReturns a pattern that throws the label `l`, which can be an integer or a string.\n\nWhen a label is thrown, the current subject position is used to set errpos, no matter whether it is the fartherst failure position or not.\n\nIn case the PEG grammar has a rule `l`, after a label is thrown this rule will be used as a recovery rule, otherwise the whole matching fails.\n\nThe recovery rule will try to match the input from the subject position where `l` was thrown. In case the matching of the recovery rule succeeds, the regular matching is resumed. Otherwise, the result of the recovery rule is the matching result.\n\nWhen we have a predicate such as `-p` or `#p` and a label `l` is thrown during the matching of `p`, this causes the failure of `p`, but does not propagate `l`, or calls its associated recovery rule.\n\n#### `%{l}`\n\nSyntax of relabel module. Equivalent to `lpeglabel.T(l)`.\n\nLabel `l` must be a valid identifier name.\n\n#### `p^l`\n\nSyntax of relabel module. The pattern `p^l` is equivalent to `p + lpeglabel.T(l)`.\n\nLabel `l` must be a valid identifier name.\n\n#### `relabel.calcline (subject, i)`\n\nReturns line and column information regarding position i of the subject.\n\n### Examples\n\nBelow there a few examples of usage of LPegLabel. The code of these and of other examples is available in the examples directory.\n\n#### Reporting the farthest failure\n\nThis example illustrates the new values returned by the match function in case of an unsuccessful matching. As no error is thrown in this example, when the matching fails errpos represents the farthest suffix where an ordinary failure occurred.\n\n``````local m = require'lpeglabel'\n\nfunction matchPrint(p, s)\nlocal r, lab, errpos = p:match(s)\nprint(\"r: \", r, \"lab: \", lab, \"errpos: \", errpos)\nend\n\nlocal p = m.P\"a\"^0 * m.P\"b\" + m.P\"c\"\nmatchPrint(p, \"abc\") --> r: 3 lab: nil errpos: nil\nmatchPrint(p, \"c\") --> r: 2 lab: nil errpos: nil\nmatchPrint(p, \"aac\") --> r: nil lab: fail errpos: 3\nmatchPrint(p, \"xxc\") --> r: nil lab: fail errpos: 1``````\n\n#### Matching a list of identifiers separated by commas\n\nThe following example defines a grammar that matches a (possibly empty) list of identifiers separated by commas. A label is thrown when there is no identifier after a comma, or when the whole input is not matched.\n\n``````local m = require'lpeglabel'\nlocal re = require'relabel'\n\nlocal terror = {\nErrId = \"expecting an identifier\",\nErrEnd = \"expecting EOF\",\nfail = \"undefined\"\n}\n\nlocal id = m.R'az'^1\n\nlocal g = m.P{\n'S',\nS = m.V'List' * (-m.P(1) + m.T'ErrEnd'),\nList = m.V'Id' * (m.V'Comma' * (m.V'Id' + m.T'ErrId'))^0,\nId = m.V'Sp' * id,\nComma = m.V'Sp' * ',',\nSp = m.S' \\n\\t'^0,\n}\n\nfunction mymatch (g, s)\nlocal r, e, pos = g:match(s)\nif not r then\nlocal line, col = re.calcline(s, pos)\nlocal msg = \"Error at line \" .. line .. \" (col \" .. col .. \"): \"\nreturn r, msg .. terror[e] .. \" before '\" .. s:sub(pos) .. \"'\"\nend\nreturn r\nend\n\nprint(mymatch(g, \"one,two\")) --> 8\nprint(mymatch(g, \"one two\")) --> nil Error at line 1 (col 4): expecting EOF before ' two'\nprint(mymatch(g, \"one,\\n two,\\nthree,4\")) --> nil Error at line 3 (col 7): expecting an identifier before '4'``````\n\nIn this example we could think about writing rule List as follows:\n\n``List = m.V'Id' * ((m.V'Comma' + m.T'ErrComma') * (m.V'Id' + m.T'ErrId'))^0,``\n\nbut when matching `m.V’Comma’ + m.T’ErrComma’` against the end of input we would get a failure whose associated label would be errComma, and this would cause the failure of the whole repetition.\n\nBelow we rewrite the previous grammar to indicate an error when there is no comma after an identifer. Before tyring to match a comma, we check if we have reached the end of input:\n\n``````local m = require'lpeglabel'\nlocal re = require'relabel'\n\nlocal terror = {\nErrId = \"expecting an identifier\",\nErrComma = \"expecting ','\",\nfail = \"undefined\"\n}\n\nlocal id = m.R'az'^1\n\nlocal g = m.P{\n'S',\nS = m.V'List',\nList = m.V'Id' * (#m.P(1) * m.V'Comma' * (m.V'Id' + m.T'ErrId'))^0,\nId = m.V'Sp' * id,\nComma = m.V'Sp' * ',' + m.T'ErrComma',\nSp = m.S' \\n\\t'^0,\n}\n\nfunction mymatch (g, s)\nlocal r, e, pos = g:match(s)\nif not r then\nlocal line, col = re.calcline(s, pos)\nlocal msg = \"Error at line \" .. line .. \" (col \" .. col .. \"): \"\nreturn r, msg .. terror[e] .. \" before '\" .. s:sub(pos) .. \"'\"\nend\nreturn r\nend\n\nprint(mymatch(g, \"one,two\")) --> 8\nprint(mymatch(g, \"one two\")) --> nil Error at line 1 (col 4): expecting ',' before ' two'\nprint(mymatch(g, \"one,\\n two,\\nthree,4\")) --> nil Error at line 3 (col 7): expecting an identifier before '4'\nprint(mymatch(g, \" 1,2\")) --> nil Error at line 1 (col 2): undefined before '1,2'``````\n\n#### Error Recovery\n\nWe can specify a recovery rule that should be matched when a label is thrown. After matching the recovery rule, and possibly recording the error, the parser will resume the regular matching. The recovery rule must have the same name (or number) of the label that was thrown.\n\nFor example, in the example below we expect to match rule A, but when a failure occur the label `Err` is thrown and then we will try to match rule Err:\n\n``````local m = require'lpeglabel'\n\nlocal recp = m.P\"oast\"\n\nlocal g = m.P{\n'S',\nS = m.V'A' * '.',\nA = m.P't' * (m.P'est' + m.T'Err'),\nErr = m.P'oast'\n}\n\nprint(g:match(\"test.\")) --> 6\nprint(g:match(\"toast.\")) --> 7\nprint(g:match(\"oast.\")) --> nil fail oast.\nprint(g:match(\"toward.\")) --> nil fail ward.``````\n\nWhen trying to match subject ‘toast.’, in rule A the first ‘t’ is matched, then the matching of `m.P\"est\"` fails and label `Err` is thrown, with the associated inpux suffix ‘oast.’. The recovery rule Err successfully matches ‘oast’, so the regular matching continues, and pattern `'.'` matches the rest of the input.\n\nWhen matching subject ‘oast.’, pattern `m.P\"t\"` fails, and the result of the matching is nil, fail, 1.\n\nWhen matching ‘toward.’, label `Err` is thrown after matching ‘t’, with the associated input suffix ‘oward.’. As the matching of the recovery pattern fails, the result is nil, fail, 3.\n\nUsually, the recovery pattern is an expression that does not fail. In the previous example, we could have used `(m.P(1) - m.P\".\")^0` as the recovery pattern.\n\nBelow we rewrite the grammar that describes a list of identifiers to use a recovery strategy, with the help of some auxiliary functions. Function `record`, plus function `recorderror`, will help us to save the input position where a label was thrown, while function `sync` will give us a synchronization pattern, that consumes the input while it is not possible to match a given pattern `p`.\n\nWhen the matching of an identifier fails, a defaul value (‘NONE’) is provided.\n\n``````local m = require'lpeglabel'\nlocal re = require'relabel'\n\nlocal terror = {\nErrId = \"expecting an identifier\",\nErrComma = \"expecting ','\",\nErrList = \"expecting a list of identifiers\",\nfail = \"undefined\"\n}\n\nlocal subject, errors\n\nfunction recorderror(pos, lab)\nlocal line, col = re.calcline(subject, pos)\ntable.insert(errors, { line = line, col = col, msg = terror[lab] })\nend\n\nfunction record (lab)\nreturn (m.Cp() * m.Cc(lab)) / recorderror\nend\n\nfunction sync (p)\nreturn (-p * m.P(1))^0\nend\n\nfunction defaultValue ()\nreturn m.Cc\"NONE\"\nend\n\nlocal id = m.R'az'^1\n\nlocal g = m.P{\n\"S\",\nS = m.V\"List\" + (m.P(1) * m.T'ErrList'),\nList = m.V'Id' * (#m.P(1) * m.V'Comma' * (m.V'Id' + m.T'ErrId'))^0,\nId = m.V'Sp' * m.C(id),\nComma = m.V'Sp' * ',' + m.T'ErrComma',\nSp = m.S' \\n\\t'^0,\nErrId = record'ErrId' * sync(m.P\",\") * defaultValue(),\nErrComma = record'ErrComma' * sync(id),\nErrList = record'ErrList' * sync(m.P(-1)) * defaultValue()\n}\n\nfunction mymatch (g, s)\nerrors = {}\nsubject = s\nio.write(\"Input: \", s, \"\\n\")\nlocal r = { g:match(s) }\nio.write(\"Captures (separated by ';'): \")\nfor k, v in pairs(r) do\nio.write(v .. \"; \")\nend\nio.write(\"\\nSyntactic errors found: \" .. #errors)\nif #errors > 0 then\nio.write(\"\\n\")\nlocal out = {}\nfor i, err in ipairs(errors) do\nlocal msg = \"Error at line \" .. err.line .. \" (col \" .. err.col .. \"): \" .. err.msg\ntable.insert(out, msg)\nend\nio.write(table.concat(out, \"\\n\"))\nend\nprint(\"\\n\")\nreturn r\nend\n\nmymatch(g, \"one,two\")\n--> Captures (separated by ';'): one; two;\n--> Syntactic errors found: 0\n\nmymatch(g, \"one two three\")\n--> Captures (separated by ';'): one; two; three;\n--> Syntactic errors found: 2\n--> Error at line 1 (col 4): expecting ','\n--> Error at line 1 (col 8): expecting ','\n\nmymatch(g, \"1,\\n two, \\n3,\")\n--> Captures (separated by ';'): NONE;\n--> Syntactic errors found: 1\n--> Error at line 1 (col 2): expecting a list of identifiers\n\nmymatch(g, \"one\\n two123, \\nthree,\")\n--> Captures (separated by ';'): one; two; three; NONE;\n--> Syntactic errors found: 3\n--> Error at line 2 (col 1): expecting ','\n--> Error at line 2 (col 5): expecting ','\n--> Error at line 3 (col 6): expecting an identifier``````\n##### relabel syntax\n\nBelow we write a grammar for a simple programming language using the syntax supported by relabel, where `%{}` is the throw operator, and the syntax `p^l` is syntatic sugar for `p / %{l}` (given that l is a valid identifier name):\n\n``````local re = require 'relabel'\n\nlocal terror = {\ncmdSeq = \"Missing ';' in CmdSeq\",\nifExp = \"Error in expresion of 'if'\",\nifThen = \"Error matching 'then' keyword\",\nifThenCmdSeq = \"Error matching CmdSeq of 'then' branch\",\nifElseCmdSeq = \"Error matching CmdSeq of 'else' branch\",\nifEnd = \"Error matching 'end' keyword of 'if'\",\nrepeatCmdSeq = \"Error matching CmdSeq of 'repeat'\",\nrepeatUntil = \"Error matching 'until' keyword\",\nrepeatExp = \"Error matching expression of 'until'\",\nassignOp = \"Error matching ':='\",\nassignExp = \"Error matching expression of assignment\",\nwriteExp = \"Error matching expression after 'write'\",\nsimpleExp = \"Error matching 'SimpleExp'\",\nterm = \"Error matching 'Term'\",\nfactor = \"Error matching 'Factor'\",\nopenParExp = \"Error matching expression after '('\",\nclosePar = \"Error matching ')'\",\neof = \"Error, expecting EOF\",\nundefined = \"Undefined Error\"\n}\n\ng = re.compile([[\nTiny <- CmdSeq (!. / %{eof})\nCmdSeq <- (Cmd SEMICOLON^cmdSeq) (Cmd SEMICOLON^cmdSeq)*\nCmd <- IfCmd / RepeatCmd / ReadCmd / WriteCmd / AssignCmd\nIfCmd <- IF Exp^ifExp THEN^ifThen CmdSeq^ifThenCmdSeq (ELSE CmdSeq^ifElseCmdSeq / '') END^ifEnd\nRepeatCmd <- REPEAT CmdSeq^repeatCmdSeq UNTIL^repeatUntil Exp^repeatExp\nAssignCmd <- NAME ASSIGNMENT^assignOp Exp^assignExp\nWriteCmd <- WRITE Exp^writeExp\nExp <- SimpleExp ((LESS / EQUAL) SimpleExp^simpleExp / '')\nSimpleExp <- Term ((ADD / SUB) Term^term)*\nTerm <- Factor ((MUL / DIV) Factor^factor)*\nFactor <- OPENPAR Exp^openParExp CLOSEPAR^closePar / NUMBER / NAME\nASSIGNMENT <- Sp ':='\nCLOSEPAR <- Sp ')'\nDIV <- Sp '/'\nIF <- Sp 'if'\nELSE <- Sp 'else'\nEND <- Sp 'end'\nEQUAL <- Sp '='\nLESS <- Sp '<'\nMUL <- Sp '*'\nNAME <- !RESERVED Sp [a-z]+\nNUMBER <- Sp [0-9]+\nOPENPAR <- Sp '('\nREPEAT <- Sp 'repeat'\nSEMICOLON <- Sp ';'\nSUB <- Sp '-'\nTHEN <- Sp 'then'\nUNTIL <- Sp 'until'\nWRITE <- Sp 'write'\nRESERVED <- (IF / ELSE / END / READ / REPEAT / THEN / UNTIL / WRITE) ![a-z]+\nSp <- (%s / %nl)*\n]], terror)\n\nlocal function mymatch(g, s)\nlocal r, e, pos = g:match(s)\nif not r then\nlocal line, col = re.calcline(s, pos)\nlocal msg = \"Error at line \" .. line .. \" (col \" .. col .. \"): \"\nreturn r, msg .. terror[e]\nend\nreturn r\nend\n\nlocal s = [[\nn := 5;\nf := 1;\nrepeat\nf := f + n;\nn := n - 1\nuntil (n < 1);\nwrite f;]]\nprint(mymatch(g, s)) --> nil Error at line 6 (col 1): Missing ';' in CmdSeq\n\nprint(mymatch(g, \"a : 2\")) --> nil Error at line 1 (col 2): Error matching ':='\nprint(mymatch(g, \"a := 2; 6\")) --> nil Error at line 1 (col 8): Error, expecting EOF``````\n\n### Caveats\n\nDoes not use the number 1 to specify a recovery rule, since that the entry with index 1 in the grammar table defines its initial rule.\n\nIn case your grammar has many regular and recovery rules, you may get an error message such as grammar: has too many rules. In this case, we need to change MAXRULES in `lpltypes.h`.\n\nLast updated: 23 months ago | Edit on GitHub\n\n Package: lpeglabel Pkg type: Lua Version: d9daedd Last commit: License: MIT Import ver: ed18386 Requires: none more... Required by: more...\n\nTop" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.6732497,"math_prob":0.9329516,"size":13603,"snap":"2023-40-2023-50","text_gpt3_token_len":3910,"char_repetition_ratio":0.13670123,"word_repetition_ratio":0.19358975,"special_character_ratio":0.30728516,"punctuation_ratio":0.18091168,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.97889686,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-12-02T09:30:42Z\",\"WARC-Record-ID\":\"<urn:uuid:108d72a2-164e-4051-8fce-daf144963608>\",\"Content-Length\":\"64326\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:1c4bf5aa-89db-43d8-9be8-0b34c630c927>\",\"WARC-Concurrent-To\":\"<urn:uuid:5eee91f4-b101-4b26-b005-9dc0a9d0422a>\",\"WARC-IP-Address\":\"168.235.102.143\",\"WARC-Target-URI\":\"https://luapower.com/lpeglabel\",\"WARC-Payload-Digest\":\"sha1:JEBVOU3JZBPDN4TM6GFUYY7I63GRGOUU\",\"WARC-Block-Digest\":\"sha1:BFZT3VKQFOUYQRDB7JEAIXEAWSDSND37\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-50/CC-MAIN-2023-50_segments_1700679100381.14_warc_CC-MAIN-20231202073445-20231202103445-00463.warc.gz\"}"}
https://cracku.in/blog/number-system-questions-for-cat/
[ "# Number System Questions for CAT\n\n0\n17741\n\nNumber systems is the most important topic for CAT exam. The number of questions asked from number systems in CAT is very high and also this topic is the most basic topic in CAT Syllabus. The questions will vary from easy to difficult and learning number systems tricks for CAT will be very helpful.\n\n# Number System Questions for CAT:\n\nQuestion 1:\n\nFive-digit numbers are formed using only 0, 1, 2, 3, 4 exactly once. What is the difference between the maximum and minimum number that can be formed?\n\na) 19800\nb) 41976\nc) 32976\nd) None of these\n\nQuestion 2:\n\nA is the set of positive integers such that when divided by 2, 3, 4, 5, 6 leaves the remainders 1, 2, 3, 4, 5 respectively. How many integers between 0 and 100 belong to set A?\n\na) 0\nb) 1\nc) 2\nd) None of these\n\nQuestion 3:\n\nTwenty-seven persons attend a party. Which one of the following statements can never be true?\n\na) There is a person in the party who is acquainted with all the twenty-six others.\nb) Each person in the party has a different number of acquaintances.\nc) There is a person in the party who has an odd number of acquaintances.\nd) In the party, there is no set of three mutual acquaintances.\n\nQuestion 4:\n\nP, Q and R are three consecutive odd numbers in ascending order. If the value of three times P is 3 less than two times R, find the value of R.\n\na) 5\nb) 7\nc) 9\nd) 11\n\nQuestion 5:\n\nA positive whole number M less than 100 is represented in base 2 notation, base 3 notation, and base 5 notation. It is found that in all three cases the last digit is 1, while in exactly two out of the three cases the leading digit is 1. Then M equals\n\na) 31\nb) 63\nc) 75\nd) 91\n\nAnswers and Solutions for Number System Questions for CAT:\n\nSolutions:\n\nMaximum five digit number which can be formed by using numbers is 43210\nAnd minimum five digit number = 10234\nDifference = 43210 – 10234 = 32976\n\nLet the number ‘n’ belong to the set A.\nHence, the remainder when n is divided by 2 is 1\nThe remainder when n is divided by 3 is 2\nThe remainder when n is divided by 4 is 3\nThe remainder when n is divided by 5 is 4 and\nThe remainder when n is divided by 6 is 5\nSo, when (n+1) is divisible by 2,3,4,5 and 6.\nHence, (n+1) is of the form 60k for some natural number k.\nAnd n is of the form 60k-1\nBetween numbers 0 and 100, only 59 is of the form above and hence the correct answer is 1\n\nFrom the options a, c and d all can possibly occur. Hence option b. Besides, if all people have different number of acquaintances, then first person will have 26 acquaintance, second person will have 25 acquaintance, third person will have 24 and so on till 27 th person will have 0 acquaintance. 0 acquaintance is practically not possible." ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.91002077,"math_prob":0.9944543,"size":3307,"snap":"2022-27-2022-33","text_gpt3_token_len":942,"char_repetition_ratio":0.13533151,"word_repetition_ratio":0.074074075,"special_character_ratio":0.28757182,"punctuation_ratio":0.10843374,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99591106,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-06-27T02:13:10Z\",\"WARC-Record-ID\":\"<urn:uuid:193b43da-29dd-4db9-9bad-3f301dc17ac1>\",\"Content-Length\":\"189044\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:350184d1-690b-46e4-a056-83c45aba7f5f>\",\"WARC-Concurrent-To\":\"<urn:uuid:0e4d16f4-2647-43d6-b5bf-419c05e8433f>\",\"WARC-IP-Address\":\"174.138.120.144\",\"WARC-Target-URI\":\"https://cracku.in/blog/number-system-questions-for-cat/\",\"WARC-Payload-Digest\":\"sha1:PVXLUEVUIOQXCRWAJNHW54FSUAI2IUDQ\",\"WARC-Block-Digest\":\"sha1:2BEZB2LKZRMBFNMKQ2LRFFMLAIKHMS5V\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-27/CC-MAIN-2022-27_segments_1656103324665.17_warc_CC-MAIN-20220627012807-20220627042807-00125.warc.gz\"}"}
https://ocw.mit.edu/courses/economics/14-15j-networks-spring-2018/lecture-and-recitation-notes/recitation-11-notes/
[ "# Recitation 11 Notes\n\n## Topics\n\n• Strategic substitutes\n• Strategic complements (local network effects, continued)\n• Subgame perfect equillibrium\n• Rubinstein's bargaining game\n\n## Strategic Substitutes\n\nIf other players act more aggressively, you have incentive to act less aggressively, and vice versa.\n\n## Strategic Complements\n\nIf other players act more aggressively, you have incentive to act more aggressively, and vice versa.\n\n### Example: Playing Sports with Friends", null, "• N = {1, 2, 3}\n• Si = ℝ+ = [0, ∞)\n• ui(xi, x-i, δ, G) = xi — ½ xi2 + δ∑(j≠i) gixxj\n• Where δ is the degree of complementarity (δ ≥ 0).\n• Best response of player i", null, "• Collectively, BRi(x-i) = 𝟙 + δG𝕏.\n• The equilibrium (fixed point) is 𝕏* = (I — δG)-1𝟙.\n\n## Subgame Perfect Equilibrium\n\nNash equlibrium only requires mutual optimality:\n\n• Issue 1: In dynamic games, cannot change the strategy you have taken in the past.\n• Subgame perfect equilibrium (SPE).\n• Issue 2: Some players may know what other players don't.\n• (Perfect) Bayesian Nash equilibrium.\n\n### Example: Battle of the Sexes\n\nShopping  Football\nShopping (3, 2) (0, 0)\nFootball (0, 0) (2, 3)\n• Where (3, 2) and (2, 3) are the two Nash equalibirums.\n\nSuppose the girl wakes up very early. Then, she can wait at Starbucks in the mall.", null, "Then, (3, 2) is the unique SPE. The guy claiming that he'll definitely go to football no matter what is an \"empty threat.\"\n\n## Rubinstein's Bargaining Game\n\n• Seller (player 1) does not value the good: v1 = 0.\n• Buyer (player 2) values the good: v2 = 1.\n\nQuestion: How is the price determined?\nAnswer: Many models, e.g. take-it-or-leave-it-offer. Rubenstein's is important because it can generate price ≈ ½ without altruism.\n\nSuppose they make alternating offers of prices until either accepts an offer. What is the SPE?\n\nWhen traded at price p:\n\n• Player 1 receives payoff p.\n• Player 2 receives payoff q := 1 — p.\n\nTrick: Let ͟p and be the minimum and maximum payoffs 1 can receive in his turn. Similarly, define ͟q and .\n\n• In 1's turn, since any offer above δ  is accepted, p ≥ 1 — δ.\n• Since any offer below δ͟q is rejected, p̅ ≤ 1 — δ͟q.\n• Similarly, in 2's turn, we get ͟q ≥ 1 — δ p̅ and q̅ ≤ 1 — δ͟p.\n• Combining, we get:\n• ͟p ≥ 1 — δ ≥ 1 — δ(1 — δ͟p) ⇒ ͟p ≥ (1 — δ)/(1 — δ2) = 1/(1 + δ).\n• ≤ 1 — δ͟q ≤ 1 — δ(1 — δ) ⇒ ≤ (1 — δ)/(1 — δ2) = 1/(1 + δ).\n• Thus, ͟p = = 1/(1 + δ) and ͟q = = 1/(1 + δ).\n\nBottom line: If there is any SPE, 1's payoff at t=odd should be 1/(1 + δ) and 2's payoff at t=even be 1/(1 + δ).\n\nIndeed, this equilibrium payoff profile is attainable if and only if they take the following strategies:\n\n• Player 1: At t=odd, offer p = 1(1 + δ)\nand at t=even, accept any offer above p = δ/(1 + δ).\n• Player 2: At t=odd, accept any offer above q = δ/(1 + δ)\nand at t=even, offer q = 1/(1 + δ).\n\nOn the equilibrium path, 1 offers p = 1/(1 + δ) and 2 immediately accepts it; end of game." ]
[ null, "https://ocw.mit.edu/courses/economics/14-15j-networks-spring-2018/lecture-and-recitation-notes/recitation-11-notes/MIT14_15JS18_rec11c.png", null, "https://ocw.mit.edu/courses/economics/14-15j-networks-spring-2018/lecture-and-recitation-notes/recitation-11-notes/MIT14_15JS18_rec11a.png", null, "https://ocw.mit.edu/courses/economics/14-15j-networks-spring-2018/lecture-and-recitation-notes/recitation-11-notes/MIT14_15JS18_rec11b.png", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.85128856,"math_prob":0.9687721,"size":2846,"snap":"2021-21-2021-25","text_gpt3_token_len":971,"char_repetition_ratio":0.114707954,"word_repetition_ratio":0.056737587,"special_character_ratio":0.33485594,"punctuation_ratio":0.15485996,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.96282154,"pos_list":[0,1,2,3,4,5,6],"im_url_duplicate_count":[null,2,null,2,null,2,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-06-15T04:18:00Z\",\"WARC-Record-ID\":\"<urn:uuid:be05256c-8ada-46f7-acfa-7dd41ab8d211>\",\"Content-Length\":\"41188\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:787f8591-5212-44b2-a4ce-f6d9749903bc>\",\"WARC-Concurrent-To\":\"<urn:uuid:68258b70-15f8-48f5-aa5f-3d0b9da79768>\",\"WARC-IP-Address\":\"151.101.250.133\",\"WARC-Target-URI\":\"https://ocw.mit.edu/courses/economics/14-15j-networks-spring-2018/lecture-and-recitation-notes/recitation-11-notes/\",\"WARC-Payload-Digest\":\"sha1:ZVZJ7J73CFR4GAVC6B5MXQWBFFYDE36Q\",\"WARC-Block-Digest\":\"sha1:7KBPW3H5QPB4KJMOUX7ERZZJLDNIYCSV\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-25/CC-MAIN-2021-25_segments_1623487616657.20_warc_CC-MAIN-20210615022806-20210615052806-00529.warc.gz\"}"}
https://www.arxiv-vanity.com/papers/hep-th/0206182/
[ "hep-th/0206182 RUNHETC-2002-19 NI02014-MTH\n\nStrings in Time-Dependent Orbifolds\n\nHong Liu, Gregory Moore\n\nDepartment of Physics, Rutgers University\n\nPiscataway, New Jersey, 08855-0849\n\nand\n\nNathan Seiberg\n\nSchool of Natural Sciences\n\nEinstein Drive,Princeton, NJ 08540\n\nWe continue and extend our earlier investigation “Strings in a Time-Dependent Orbifold” (hep-th/0204168). We formulate conditions for an orbifold to be amenable to perturbative string analysis and classify the low dimensional orbifolds satisfying these conditions. We analyze the tree and torus amplitudes of some of these orbifolds. The tree amplitudes exhibit a new kind of infrared divergences which are a result of some ultraviolet effects. These UV enhanced IR divergences can be interpreted as due to back reaction of the geometry. We argue that for this reason the three dimensional parabolic orbifold is not amenable to perturbation theory. Similarly, the smooth four dimensional null-brane tensored with sufficiently few noncompact dimensions also appears problematic. However, when the number of noncompact dimensions is sufficiently large perturbation theory in these time dependent backgrounds seems consistent.\n\nJune 20, 2002\n\n1. Introduction\n\nTime dependent physics poses a large number of interesting conceptual and technical problems in quantum field theory, quantum gravity, and in string theory. So far very little work has been done on time-dependent backgrounds in the framework of string theory, although the situation is beginning to change (see, e.g. [1--22] for recent discussions of this issue). Here, we continue the investigation of strings in time dependent orbifolds which we started in . We are adopting a conservative approach, simply trying to follow the standard rules of perturbative string theory, and trying to imitate the constructions and methods which have been proven useful in time independent setups.\n\nIn order to be able to apply perturbative string methods we have to deal with the following issues: 1. We start with a solution of the classical equations of motion; i.e. a worldsheet conformal field theory. This conformal field theory is most tractable when it is based on an orbifold of flat spacetime. Therefore, we will mod out by a subgroup of its symmetry group which is the Poincare group in dimensions . We will denote the orbifold by . In order to have nontrivial time dependence should not be a subgroup of the Euclidean group in dimensions as in ordinary Euclidean orbifolds. 2. In Euclidean orbifolds the singularities of the target space are at fixed points of . Lorentzian orbifolds typically have also other potential problems. The quotient by can make time non-orientable. It can also create closed null curves (CNC’s) or closed time-like curves (CTC). These are potentially problematic because they can lead to divergent expectation values of composite operators like the stress tensor and to large back reaction of the metric. We examine orbifolds which are time-orientable and have no CTC’s, although we will allow singularities, non-Hausdorff spaces, and the possibility of CNC’s. We will also see examples in which the orbifold has no CNC’s but has closed curves whose invariant length is arbitrarily small; we will examine the consequences of these curves. 3. In order to help ensure the stability of the background against radiative corrections we will look for orbifolds which leave unbroken some amount of supersymmetry. This supersymmetry can guarantee that some of the back reaction due to CNC when they are present is harmless. Having such supersymmetry leads to a null Killing vector (see [3,,4] and section 7 below). We can therefore use lightcone frame and treat as time. The orbifold is thus foliated by spaces of fixed . The lightcone description also guarantees that the vacuum of the second quantized theory is trivial, and there is no particle production in the system . 4. Even if supersymmetry guarantees that the zero point function and the one point functions vanish to all orders, the question of back reaction is far from obvious. Vertex operators correspond to small deformations of the background. If they are singular at some point in spacetime, they can lead to infinite energy density there and to large change in the gravitational field. Such an effect can render perturbation theory invalid. For smooth backgrounds vertex operators which are singular at some point in spacetime can be excluded, but in various singular orbifolds all vertex operators are singular. We will discuss this issue in more detail below in some examples. We will also show that sometimes a smooth background with smooth vertex operators can also suffer from large back reaction. In particular, we will see that the back reaction is reflected in “UV enhanced IR divergences”, which may also signal that one needs to consider more subtle asymptotic states.\n\nIn section 2 we will examine two orbifolds. The first, which we will refer to as the parabolic orbifold (it is also called the “null orbifold”), was introduced in  and briefly studied in . Its geometry was further explored recently in  and strings in this background were investigated in . The second orbifold, the “null-brane” was described in [4,,11]. In sections 3 – 6 we will slightly extend the analysis of string theory in the background of the parabolic orbifold in , and will apply the same techniques to the case of the null-brane background. In section 3 we consider the functions on the orbifolds which are important when constructing vertex operators. In section 4 we consider the canonical quantization of free strings. In section 5 we analyze the torus partition function, and in section 6 we consider tree level S-matrix amplitudes. In section 7 we comment on the general classification of such models and describe several new orbifolds which exhibit new phenomena.\n\nStrings in the null-brane orbifold are also studied by D. Robbins and S. Sethi  and by M. Fabinger and J. McGreevy . Also, A. Lawrence  and G. Horowitz and J. Polchinski  reached conclusions related to ours about the back reaction and the validity of perturbation theory in the parabolic orbifold and the null-brane.\n\n2. The parabolic orbifold and the null-brane\n\n2.1. Coordinates and Metric\n\nIn  we analyzed in detail string theory on a parabolic orbifold, with target space where is a parabolic subgroup of the three dimensional Lorentz group . is a transverse Euclidean CFT which is invariant under the action of . More explicitly, writing the Lorentzian metric for as , the generator of the orbifold group acts as\n\n X=⎛⎜⎝x+xx−⎞⎟⎠→g0⋅X=e2πJX=⎛⎜ ⎜⎝x+x+2πx+x−+2πx+12(2π)2x+⎞⎟ ⎟⎠;J=⎛⎜⎝000100010⎞⎟⎠\n\nThat is, where we take the Lie algebra generator\n\n J=J+x=1√2(J0x+J1x)\n\ncorresponding to a linear combination of a boost and a rotation.\n\nFor some purposes it is convenient to use coordinates This is a special case of the transformation from “Brinkman” to “Rosen” coordinates in the theory of pp waves .\n\n x+=y+x=y+yx−=y−+12y+y2\n\nin terms of which the metric becomes\n\n ds2=−2dy+dy−+(y+)2dy2\n\nand the orbifold identification is simply . The spacetime (2.4) may be visualized as two cones (parametrized by and ) with a common tip at , crossed with the real line (for ). This description is not valid at the singularity where this coordinate system is not valid.\n\nThe parabolic orbifold has a few attractive features which fit nicely with the criteria outlined in the introduction: 1. The orbifold has a null isometry which allows us to use light-cone evolution. There is no string or particle production in the second quantized theory. 2. The orbifold has a covariant spinor and thus preserves half of the supersymmetries in the superstring theory. As a result, one can show that one-loop cosmological constant and the massless tadpoles vanish. 3. There are no closed time-like curves, while there are closed null curves only in the hyperplane . 4. In terms of light-cone time, the orbifold describes the big crunch of a circle at , followed by a big bang. There is a null singular line at . This provides an interesting toy model for understanding the big crunch/big bang singularity in cosmology. It is also related to the singularity of the massless BTZ black hole [28,,29]. 5. If the spacetime does not end at the singularity, one might be able to define an -matrix as a natural observable.\n\nIn  we observed that there are divergences in the -matrix of the parabolic orbifold for special kinematic configurations. We suggested there that they might signal the breakdown of perturbation theory. Below we will analyze these divergences in more detail, and will argue that this conclusion is unavoidable. Therefore, even if such an S-matrix exists, it cannot be computed in perturbation theory.\n\nIn this paper we consider a few generalizations of the parabolic orbifold by allowing to act nontrivially on the transverse spacetime or by including more generators, in a way that the above attractive features remain. In the following we will discuss in detail a simple family of orbifolds of which the parabolic orbifold is a special example. In particular we will show that this more general family does allow a perturbative computation of the S-matrix. Other generalizations and classifications will be discussed in sec. 7.\n\n ds2=−2dx+dx−+dx2+dz2 .\n\nand consider the orbifolds obtained by identifying\n\n X∼e2πnJX,z∼z+2πnR,n∈\\tenbfZ\n\nwhere the column vector and matrix are the same as in (2.1). The generator of the identification is now given by\n\n g0=e2πi(J+Rpz),\n\nwhere is given by (2.2) and is the generator for translation in direction.\n\nThe above orbifold, called the null-brane, was introduced in [4,,11]. The null-brane has a continuous modulus and the parabolic orbifold corresponds to the singular limit . The geodesic distance between a point and its ’th image is . At finite the spacetime is regular and Hausdorff everywhere with no closed causal curves. Thus it may also be considered as a regularization of the parabolic orbifold.\n\nThe orbifold action breaks the Poincaré symmetry of , leaving only three of its Lie algebra generators unbroken. These are , which shifts by a constant, and which generates translations in the -direction. The null Killing vector associated with allows us to use a light-cone evolution treating as time. Thus again there is no particle production in the second quantized theory. As in the parabolic orbifold, for an appropriate choice of the sign of the generator (2.7) acting on spinors, the group leaves one half of all spinor components invariant. When the superstring is compactified on a null-brane it preserves half of the supercharges. These supercharges square to the Killing vector .\n\nLet us now look at the geometry of the null-brane in more detail. We will change to two different coordinate systems. First, for it is convenient to define as in (2.3) and to express the metric (2.5) as\n\n ds2=−2dy+dy−+(y+)2dy2+dz2\n\nand the orbifold identification (2.6) becomes\n\n ⎛⎜ ⎜ ⎜⎝y+yy−z⎞⎟ ⎟ ⎟⎠∼⎛⎜ ⎜ ⎜⎝y+y+2πny−z+2πnR⎞⎟ ⎟ ⎟⎠\n\nIf we also define\n\n z=Ry+u\n\nwhere is a noncompact coordinate, then the metric becomes\n\n ds2=−2dy+dy−+du2+(R2+(y+)2)dy2+2Rdudy=−2dy+dy−+(y+)2R2+(y+)2du2+(R2+(y+)2)(dy+RR2+(y+)2du)2\n\n(2.11) represents a circle fibration over a three-dimensional manifold parameterized by , where the the circle has a radius and the fibration has a connection with\n\n F=−Ry+(R2+(y+)2)2dy+∧du .\n\nIt is manifest in the first line of (2.11) that as we get the metric of the parabolic orbifold in coordinate times a transverse noncompact direction\n\n ds2=−2dy+dy−+(y+)dy2+du2 .\n\nNote that since the coordinate transformation (2.3) is singular at , the limit of (2.11) should be treated with caution.\n\nAnother set of global coordinates  can be obtained by taking\n\n z=Rθ,˜X=e−zRJX,\n\ni.e. explicitly,\n\n x+=˜x+x=˜x+θ˜x+x−=˜x−+θ˜x+12θ2˜x+\n\nIn these coordinates the metric becomes\n\n ds2=−2d˜x+d˜x−+d˜x2+(R2+(˜x+)2)dθ2+2dθ(˜x+d˜x−˜xd˜x+)=−2d˜x+d˜x−+d˜x2−1R2+(˜x+)2(˜x+d˜x−˜xd˜x+)2+(R2+(˜x+)2)(dθ+1R2+(˜x+)2(˜x+d˜x−˜xd˜x+))2\n\nNote that the above metric has a constant determinant . (2.16) represents a circle fibration over a 3-manifold parametrized by . The latter has nonsingular metric with . Moreover there is a connection on the circle fibration with\n\n F=2R2(R2+(˜x+)2)2d˜x+∧d˜x .\n\nThere is a strong formal similarity between this solution and the standard Melvin universe. As in the parabolic orbifold, plays a dual role of a time and a “radial variable.” Note that in the present case it is clear that , so that we have the “two-cone” theory. It would be of some interest to extend the present discussion to the analog of the two-parameter Melvin solutions [30--32] with nontrivial -flux but we will not attempt this in the present paper.\n\nThe coordinate system is not geodesically complete. Its completion is given by the system related by\n\n ˜x+=y+˜x=y+(y−z/R)˜x−=y−+12y+(y−z/R)2θ=z/R\n\nThe limit is somewhat subtle in these coordinates since the coordinate used in (2.14) and (2.15) is not well defined in this limit.\n\nIn terms of light-cone time , the null-brane describes an infinite size circle in the far past shrinking to a minimal radius at and then expanding to infinite size in the remote future. An interesting feature of the causal structure of the parabolic orbifold is that every point with is always in the causal future of the every point with . In the null-brane geometry, while this is no longer so, there is a close analogue. The geodesic distance square between a point and the image of a point is\n\n Δn(P1,P2)=−2Δy+Δy−+y+1y+2(Δy−2πn)2+(Δz−2πnR)2\n\nThe large behavior of the above equation for fixed is\n\n Δn(P1,P2)∼(y+1y+2+R2)(2πn)2\n\nThus, points with are necessarily timelike separated.\n\n3. Solutions of the wave equation on the null-brane\n\nIn  we discussed the solutions of the wave equation on the parabolic orbifold. Here we give an analogous treatment for the null-brane. These functions, which are easily derived from those of the parabolic orbifold, are important for studying first quantized particles on this spacetime and for constructing the vertex operators in string theory.\n\nWe start by considering functions on the covering space . We diagonalize the Killing vectors and the Laplacian :\n\n [−2∂∂x+∂∂x−+∂2∂x2+∂2∂z2]ψ=m2ψˆJψ=−i(x+∂∂x+x∂∂x−)ψ=Jψˆp+ψ=i∂∂x−ψ=p+ψ,ˆpzψ=−i∂∂zψ=kψ .\n\nFollowing the discussion in , the eigenfunctions functions can be written as\n\n ψp+,J,k,m2=√1ix+ \\tenrmexp[−ip+x−−im2+k22p+x++ip+2x+(x−ξ)2+ikz]=∫∞−∞dp√2πp+ e−ipξ\\tenrmexp[−ip+x−−ip2+k2+m22p+x++ipx+ikz]\n\nwith\n\n ξ=−Jp+ .\n\nThe second line of (3.2) shows that -eigenfunctions can be obtained from the standard momentum eigenfunctions by a Fourier transform. The functions form a complete basis of functions for fixed with the inner product\n\n ∫∞−∞dx−dxdzψ∗p+,J,k,m2ψ˜p+,˜J,˜k,m2=(2π)3δ(p+−˜p+)δ(J−˜J)δ(k−˜k) .\n\nConsider now the null-brane orbifold . Under the identification (2.6) the function (3.2) transforms as\n\n ψp+,J,k,m2→e2πin(J+kR)ψp+,J,k,m2\n\nIt then follows that in the null-brane functions should satisfy the quantization condition\n\n J+kR=n∈\\tenbfZ .\n\nTherefore, we label the basis functions\n\n Vp+,J,n,m2=ψp+,J,k=n−JR,m2\n\nThe orbifold is foliated by equal spaces and the complete basis functions satisfy\n\n ∫Fx+V∗p+,J,n,m2V˜p+,˜J,˜n,m2=(2π)3Rδn,˜nδ(p+−˜p+)δ(J−˜J) .\n\nIn terms of the coordinate system (2.3)(2.10) the functions (3.7) can be written as\n\n Vp+,J,n,m2=√1iy+ \\tenrmexp⎡⎢ ⎢ ⎢⎣−ip+y−+iny+iJ22p+y+−i(n−JR)2+m22p+y++i(n−JR)u⎤⎥ ⎥ ⎥⎦\n\nand in terms of the coordinates (2.14) they are\n\n Vp+,J,n,m2=√1i˜x+\\tenrmexp⎡⎢ ⎢ ⎢⎣−ip+˜x−−i(n−JR)2+m22p+˜x++ip+2˜x+(˜x−ξ)2+inθ⎤⎥ ⎥ ⎥⎦\n\n(to derive this, it is convenient to use ).\n\nThe basis functions (3.7) are singular at . More explicitly, we have\n\n limx+→0Vp+,J,n,m2(x+,x,x−,z)=√2πp+e−ip+x−+i(n−JR)zδ(x−ξ)=√2πp+e−ip+˜x−+inθδ(˜x−ξ)\n\nThis implies that these basis functions are localized at at .\n\nThese functions are potentially dangerous to use as vertex operators for two related reasons:\n\n1. Focusing the particles at a point results in infinite energy density and can cause large back reaction when the system is coupled to gravity (as in string theory).\n\n2. The expression for the basis functions in terms of plane waves as in the second expression in (3.2) involves integrating over arbitrarily high energies. This leads to certain divergences in S-matrix elements.\n\nThe origin of these problems can be traced back to the diagonalization of , and one might expect that they can therefore be avoided by smearing them with smooth functions of of rapid decrease. Recall that the Schwarz space of functions of rapid decrease is the space of functions with for any . This space is preserved by Fourier transform . We now demonstrate that this is the case. Consider the wave packets\n\n Up+,f(J),n,m2=∫dJf(J)Vp+,J,n,m2\n\nwhere is a smooth function of rapid decrease. Their inner product is\n\n ∫Fx+U∗p+,f,n,m2U˜p+,˜f,˜n,m2=(2π)3Rδ(p+−˜p+)δn,˜n∫dJf(J)∗˜f(J) .\n\nSince is bounded for , the integral over in (3.12) converges for all . Moreover the singularity at is smoothed out\n\n limx+→0Up+,f,n,m2(x+,x,x−,z)=√2πp+\\tenrmexp(−ip+x−+i(n+xp+)zR)f(−xp+)=√2πp+e−ip+˜x−+inθf(−˜xp+)\n\nTherefore, does not have any singularities. This solves the first problem mentioned above.\n\nUsing (3.2)(3.7)(3.12) we can express as an integral over plane waves\n\nSince is of rapid decrease its Fourier transform is of rapid decrease. Therefore, in (3.15) the support of wave functions with large energy is suppressed More precisely, this statement is true only for fixed , and there is no universal bound for all values of . .\n\nIt is important that in the parabolic orbifold the label is discrete. Therefore we cannot form wave packets as here and smear the singularity. Note that by integrating over the singularities of the wave functions with can be smeared. However, there is no way to avoid the singularity of the functions with .\n\nTo demonstrate this general discussion of wavefunctions in the null-brane, consider the wave packet with ,\n\n Up+,−J22,n,m2=∫dJe−J22Vp+,J,n,m2\n\nIt is simple to express the above function in coordinates\n\n Up+,−J22,n,m2=√2πp+K\\tenrmexp[−Q2K]\\tenrmexp(−ip+˜x−−im22p+˜x++inθ)\n\nwhere\n\n K=p+˜x++i[(˜x+R)2−1],Q=(p+˜x+R2−i(p+)2)˜x2+[˜x+p+R2−i(˜x+R)2]n2+2˜x+˜xnR2 .\n\nIt is manifest in (3.17) and (3.18)  that is completely regular everywhere. It is also instructive to write as a wave packet in momentum space using the second line of (3.2). We find that\n\n Up+,−J22,n,m2= ⎷1p++i˜x+R2\\tenrmexp⎛⎜⎝−ip+˜x−−im2+n2R22p+˜x++inθ⎞⎟⎠∫d˜pg(˜p)ei˜p˜x−i˜p22p+˜x+\n\nwith\n\n g(˜p)=\\tenrmexp⎡⎢ ⎢⎣−12(1+i˜x+p+R2)(˜pp++˜x+np+R2)2⎤⎥ ⎥⎦ .\n\nThus corresponds to a Gaussian wave packet in which is the momentum conjugate to . In particular, the higher energy region of the integration is suppressed.\n\nThe limit of the null-brane is the parabolic orbifold times a noncompact line parametrized by . In order for the function to have a sensible limit we should hold the momentum along the direction, , fixed as . The resulting function is of (3.2) with , which is a good function on the parabolic orbifold times the line. In order to have a good limit for the wave packets (3.12) we should let the function depend also on and , , such that with finite . Then\n\n limR→0U=∫dk˜f(k)ψp+,J=n,k,m2\n\ni.e. it has fixed value for and is a wave packet in . Clearly, this function diverges at .\n\nOne can work out the propagator for a massive particle on the null-brane. It can be obtained from the propagators in by summing over the images under the orbifold action, leading to\n\n GF(P1,P2)=i8π∑n∈\\tenbfZ(m2Δn+iϵ)1/2H(2)1(√m2(Δn+iϵ))\n\nwhere is the invariant distance square between a point and the image of (2.19). Note that the propagator for the parabolic orbifold is also given by (3.22) with in (2.19).\n\nThe propagator (3.22) can be expanded in terms of the wave functions discussed in this section,\n\n G(P1,P2)=θ(Δy+)D(P1,P2)+θ(−Δy+)D(P2,P1)\n\nwhere when\n\n D(P1,P2)=∫∞0dp+(2π)32p+R∫∞−∞dJ∑n∈\\tenbfZ1√iy+1√−iy+2×\\tenrmexp⎡⎢ ⎢ ⎢⎣−ip+Δy−+iJΔy+in−JRΔz−iJ22p+(−1y+1+1y+2)−im2+(n−JR)22p+Δy+⎤⎥ ⎥ ⎥⎦\n\nNote that the sum over in (3.24) and (3.22) are not the same. They are related by a Poisson resumation.\n\n4. String quantization on the null-brane\n\nIn this section we consider the canonical quantization of strings in the null-brane background. The discussion is very similar to that of the parabolic orbifold in  and therefore it will be very brief.\n\nIn the covariant formalism we use four free fields . In the twisted sector they are subject to the twisted boundary conditions\n\n ⎛⎜ ⎜ ⎜ ⎜⎝x+(σ+2π,τ)x(σ+2π,τ)x−(σ+2π,τ)z(σ+2π,τ)⎞⎟ ⎟ ⎟ ⎟⎠=gw0⋅(Xz)=⎛⎜ ⎜ ⎜ ⎜⎝x+(σ,τ)x(σ,τ)+2πwx+(σ,τ)x−(σ,τ)+2πwx(σ,τ)+12(2πw)2x+(σ,τ)z(σ,τ)+2πwR⎞⎟ ⎟ ⎟ ⎟⎠\n\nThese can be “solved” using free fields  and lead to an interesting exchange algebra similar to exchange algebras in RCFT Although there is a potential role for noncommutative geometry here, note that the spacetime is perfectly Hausdorff, as is the WZW theory..\n\nIn the lightcone gauge we have two possible procedures: 1. Use the original coordinates. The advantage of this method is that the worldsheet Lagrangian is free. The somewhat unusual aspect of this procedure is that the worldsheet Hamiltonian is not invariant under the orbifold action which is a gauge symmetry of the system. Also, in the twisted sectors the periodicity rules of the fields depend on the worldsheet time . 2. Use an invariant Hamiltonian. This can be done either with the coordinates (2.3)(2.10), where the Hamiltonian is or with the coordinates (2.14), where the Hamiltonian is . The disadvantage of this procedure is that unlike the first one, the system is time () dependent.\n\nIt is essential to keep as dynamical variables in the Lagrangian the zero modes of in the first procedure, and the zero mode of or in the second procedure [15,,34]. In the first procedure this coordinate is needed to ensure the invariance of the system under the orbifold action. In the second procedure this is needed in order to absorb all infinite renormalization constants in appropriate counter terms.\n\nFor brevity here we will follow only the first procedure. The light-cone gauge Lagrangian is\n\n L=−p+∂τx−0+14πα′∫2π0dσ(α′p+∂τx∂τx−1α′p+∂σx∂σx+α′p+∂τz∂τz−1α′p+∂σz∂σz)\n\nInvariance under constant shifts of is implemented by imposing \n\n ∫dσ(∂σx∂τx+∂σz∂τz−12τ∂σx2)=0\n\nIt is important that the Lagrangian (4.2) and the expressions for the constraint (4.3) are invariant under the orbifold identification\n\n x(σ,τ)→x(σ,τ)+2πnτx−0(τ)→x−0(τ)+2πn∫2π0dσ2πx(σ,τ)+(2πn)22τz(σ,τ)→z(σ,τ)+2πnR\n\nThe equation of motion for sets to a constant. The equation of motion for leads to\n\n Px−=p+∂τx−0=14πα′∫ℓ0dσ(∂τx∂τx+∂σx∂σx+∂τz∂τz+∂σz∂σz)\n\nwhere we have rescaled to range in .\n\nA complete set of solutions to the equations of motion in the -twisted sector, can be expressed in terms of harmonic oscillators:\n\n x(σ,τ)=−Jp++pp+τ+2πwστℓ+i(α′2)12∑n≠0{αnn\\tenrmexp[−2πin(σ+τ)ℓ]+˜αnn\\tenrmexp[2πin(σ−τ)ℓ]}z(σ,τ)=z0+kp+τ+2πwRσℓ+i(α′2)12∑n≠0{αznn\\tenrmexp[−2πin(σ+τ)ℓ]+˜αznn\\tenrmexp[2πin(σ−τ)ℓ]}\n\nThe solution of is obtained from (4.5). Upon quantization these oscillators obey the standard canonical commutation relations and .\n\nAs in , it is straightforward to extend the worldsheet Lagrangian (4.5) to the Green-Schwarz formalism. For concreteness consider the model on . Before taking the quotient by we should add to (4.5) six free worldsheet bosons and eight rightmoving fermions (in the type II theory we also need eight leftmoving fermions and in the heterotic string also leftmoving degrees of freedom for the internal degrees of freedom). It is easy to see using the symmetries of the problem that after the action by the added fields and remain free. The boundary conditions of these fields depend on the spin structure around the nontrivial cycle. For the spin structure which preserves supersymmetry and are periodic around the string. For the other spin structure transforms with , as in the supersymmetry breaking compactification of .\n\n5. Torus partition function\n\nIn the one-loop amplitudes we sum over the “sectors”\n\n (X,z)(σ1+1,σ2)=(e2πwaJX,z+2πRwa)(σ1,σ2)(X,z)(σ1,σ2+1)=(e2πwbJX,z+2πRwb)(σ1,σ2)\n\nComparing with the analogous calculation in , the only difference is the replacement as the effective radius-square in equation (5.13) of . That is, the contribution of the classical action to the torus amplitude is given by\n\n \\tenrmexp[−π[(x+)2+R2]α′|wb+waτ|2τ2]\n\nEquation (5.2) is most easily derived using the coordinate system since the classical configuration is then given by\n\n θ(σ1,σ2)=2π(waσ1+wbσ2)\n\nwith a constant.\n\nWe would like to make a few comments about the torus amplitude: 1. Both in the parabolic orbifold and in the null-brane we can study the system either with supersymmetric boundary conditions around the nontrivial cycle or with nonsupersymmetric boundary conditions as in . With supersymmetric boundary conditions we find cancellations and the one loop cosmological constant vanishes. 2. The final answer is a cosmological constant as a function of . Regardless of the boundary conditions as we recover the standard flat space answer because in this limit our spacetime becomes time independent. Similarly, in the large lightcone time limit the cosmological constant vanishes in the superstring theory. 3. As we recover the results of  for the parabolic orbifold. 4. If is sufficiently small, can be smaller than order . Then if supersymmetry is broken the system can have tachyons in the winding sector and the cosmological constant can diverge. 5. As for finite we do not find a continuum of winding modes because the T-dual space is of finite size ().\n\n6. Tree amplitudes\n\nIn this section we consider the tree-level amplitudes for the untwisted modes in the null-brane. We will show that the tree-level amplitudes for the wave packets of (3.12) in the null-brane are better behaved than the amplitudes studied in . The amplitudes involving twisted modes, which are important for understanding twisted mode production, will be left for future work.\n\nAs in , we calculate the tree-level untwisted amplitudes in the null-brane using the inheritance principle from those in flat space in the -basis by restricting to integers. Therefore, in the -basis the tree level untwisted S-matrix is essentially the same in flat space, in the parabolic orbifold and in the null-brane. The amplitudes in the -basis in flat spacetime are in turn computed from those in the momentum basis by a Fourier transform, thanks to the simple relation between the -basis functions and the plane waves. For simplicity we will only look at tachyon amplitudes.\n\nThe vertex operator for the tachyon is given by\n\n Vp+,J,n,p⊥(σ,τ)=1√2πp+ ∫∞−∞dpeipξei→p⋅→X(σ,τ),ξ=−Jp+\n\nwhere\n\n ei→p⋅→X(σ,τ)=\\tenrmexp[−ip+x−−ip−x++ipx+ikz+i→p⊥⋅→x⊥(σ,τ)]\n\n( and denote vectors in other transverse dimensions) is the standard on-shell tachyon vertex operator with\n\n p−=p2+\\tenrmm22p+,\\tenrmm2=m2+k2+→p2⊥,m2=−4α′,k=n−JR .\n\nIt then follows that in the null-brane the three- and four-point amplitudes in terms of the above vertex operators are given precisely by equations (6.4) – (6.6) and (6.13) – (6.17) of  with the substitution\n\n (→p⊥i)\\tenrmthere=(ki,→p⊥i),ki=ni−JiR .\n\nThus the behavior of the four-point amplitudes are the same as those discussed in , which involve integrating the momentum space amplitudes over an infinite range of the Mandelstam variable . An important question is whether the S-matrix is finite, since the integrals involve very large , i.e. potentially infinite center of mass energy. Roughly, the contribution of the large region of the integral to the amplitudes can be written as\n\n AJ≈I++I−\n\nwith\n\n I±∼∫∞−∞dσ|σ|eiσF±(Ji,p+i)AVS(s(σ),t±(σ),u±(σ))\n\nwhere is the Virasoro-Shapiro amplitude in momentum space, are functions of and of the external particles, and\n\n s=(p+1+p+2)σ2+⎛⎜⎝ ⎷p+1p+2k1− ⎷p+2p+1k2⎞⎟⎠2+μs(→p⊥i,p" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.91667354,"math_prob":0.9896885,"size":24561,"snap":"2021-31-2021-39","text_gpt3_token_len":5393,"char_repetition_ratio":0.15620801,"word_repetition_ratio":0.017839445,"special_character_ratio":0.20736127,"punctuation_ratio":0.09235177,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9925646,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-07-27T01:29:55Z\",\"WARC-Record-ID\":\"<urn:uuid:35ba5930-ece3-43fe-8fdb-50ef963b291e>\",\"Content-Length\":\"1049491\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:2c8a53be-203f-40f2-b078-3cc126a09e14>\",\"WARC-Concurrent-To\":\"<urn:uuid:9f0f3d84-b791-47d9-9e60-bc57a653821e>\",\"WARC-IP-Address\":\"104.21.14.110\",\"WARC-Target-URI\":\"https://www.arxiv-vanity.com/papers/hep-th/0206182/\",\"WARC-Payload-Digest\":\"sha1:74S2SCNB7BXDYQJECGQWLX5RW6AGD3TI\",\"WARC-Block-Digest\":\"sha1:ND2W2W4FG6DZIBBS5YAHU4DVY7DMFO47\",\"WARC-Truncated\":\"length\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-31/CC-MAIN-2021-31_segments_1627046152168.38_warc_CC-MAIN-20210727010203-20210727040203-00262.warc.gz\"}"}
http://amigadev.elowar.com/read/ADCD_2.1/Devices_Manual_guide/node0247.html
[ "", null, "", null, "", null, "", null, "", null, "", null, "```\nThis chunk is a basic data chunk used to hold the delta compression data.\nThe minimum size of this chunk is 32 bytes as the first 8 long-words are\nbyte pointers into the chunk for the data for each of up to 8 bitplanes.\nThe pointer for the plane data starting immediately following these 8\npointers will have a value of 32 as the data starts in the 33-rd byte of\nthe chunk (index value of 32 due to zero-base indexing).\n\nThe data for a given plane consists of groups of data words. In Long\nDelta mode, these groups consist of both short and long words - short\nwords for offsets and numbers, and long words for the actual data. In\nShort Delta mode, the groups are identical except data words are also\nshorts so all data is short words. Each group consists of a starting word\nwhich is an offset. If the offset is positive then it indicates the\nincrement in long or short words (whichever is appropriate) through the\nbitplane. In other words, if you were reconstructing the plane, you would\nstart a pointer (to shorts or longs depending on the mode) to point to the\nfirst word of the bitplane. Then the offset would be added to it and the\nfollowing data word would be placed at that position. Then the next\noffset would be added to the pointer and the following data word would be\nplaced at that position. And so on... The data terminates with an offset\nequal to 0xFFFF.\n\nA second interpretation is given if the offset is negative. In that case,\nthe absolute value is the offset+2. Then the following short-word\nindicates the number of data words that follow. Following that is the\nindicated number of contiguous data words (longs or shorts depending on\nmode) which are to be placed in contiguous locations of the bitplane.\n\nIf there are no changed words in a given plane, then the pointer in the\nfirst 32 bytes of the chunk is =0.\n\n```\n\n`[Back to Amiga Developer Docs]`" ]
[ null, "http://amigadev.elowar.com/read/ADCD_2.1/images/toc_d.gif", null, "http://amigadev.elowar.com/read/ADCD_2.1/images/index.gif", null, "http://amigadev.elowar.com/read/ADCD_2.1/images/help_d.gif", null, "http://amigadev.elowar.com/read/ADCD_2.1/images/retrace_d.gif", null, "http://amigadev.elowar.com/read/ADCD_2.1/images/prev.gif", null, "http://amigadev.elowar.com/read/ADCD_2.1/images/next.gif", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.93700683,"math_prob":0.95746773,"size":1856,"snap":"2021-21-2021-25","text_gpt3_token_len":403,"char_repetition_ratio":0.14686824,"word_repetition_ratio":0.047477745,"special_character_ratio":0.21551724,"punctuation_ratio":0.07258064,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.97467893,"pos_list":[0,1,2,3,4,5,6,7,8,9,10,11,12],"im_url_duplicate_count":[null,null,null,null,null,null,null,null,null,null,null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-05-08T12:48:50Z\",\"WARC-Record-ID\":\"<urn:uuid:944a8f78-cf99-488a-b75c-d04e5bf9e6d3>\",\"Content-Length\":\"3285\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:f28d28d8-2f67-46fb-a113-f32cccad3858>\",\"WARC-Concurrent-To\":\"<urn:uuid:c4c4f983-18e1-4353-9ac3-97ff65d13a11>\",\"WARC-IP-Address\":\"46.252.18.44\",\"WARC-Target-URI\":\"http://amigadev.elowar.com/read/ADCD_2.1/Devices_Manual_guide/node0247.html\",\"WARC-Payload-Digest\":\"sha1:ZX4EKOJQG2A2NB5IKQYUYRO4NAVVAZIW\",\"WARC-Block-Digest\":\"sha1:OFTDKU2VIB2CQW6XQ7OMXWB4V5BADVAV\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-21/CC-MAIN-2021-21_segments_1620243988882.7_warc_CC-MAIN-20210508121446-20210508151446-00033.warc.gz\"}"}
http://encyclopedia2.thefreedictionary.com/Church-Rosser+Theorem
[ "Church-Rosser Theorem\n\nChurch-Rosser theorem\n\n[¦chərch ¦rȯs·ər ¦thir·əm]\n(mathematics)\nIf for a lambda expression there is a terminating reduction sequence yielding a reduced form B, then the leftmost reduction sequence will yield a reduced form that is equivalent to B up to renaming.\n\nChurch-Rosser Theorem\n\n(theory)\nA property of a reduction system that states that if an expression can be reduced by zero or more reduction steps to either expression M or expression N then there exists some other expression to which both M and N can be reduced. This implies that there is a unique normal form for any expression since M and N cannot be different normal forms because the theorem says they can be reduced to some other expression and normal forms are irreducible by definition. It does not imply that a normal form is reachable, only that if reduction terminates it will reach a unique normal form.\nSite: Follow: Share:\nOpen / Close" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.91527766,"math_prob":0.95650965,"size":897,"snap":"2019-26-2019-30","text_gpt3_token_len":205,"char_repetition_ratio":0.16461366,"word_repetition_ratio":0.0,"special_character_ratio":0.18729097,"punctuation_ratio":0.03726708,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.960925,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-06-20T09:07:43Z\",\"WARC-Record-ID\":\"<urn:uuid:b0a42896-de36-4b01-a5af-d7ef67d06a4d>\",\"Content-Length\":\"41858\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:3c389588-ceb6-4087-806f-0cddce8c40e8>\",\"WARC-Concurrent-To\":\"<urn:uuid:2802be1d-ed34-483e-b4dc-e94212d6bacd>\",\"WARC-IP-Address\":\"172.106.80.2\",\"WARC-Target-URI\":\"http://encyclopedia2.thefreedictionary.com/Church-Rosser+Theorem\",\"WARC-Payload-Digest\":\"sha1:PDYJDGB4NYKFFBD2TKVROLOTHHCLRDI6\",\"WARC-Block-Digest\":\"sha1:SLK7OMZNGQLU5YGR2QHHYN5IUDED6BVK\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-26/CC-MAIN-2019-26_segments_1560627999200.89_warc_CC-MAIN-20190620085246-20190620111246-00315.warc.gz\"}"}
https://apps.dtic.mil/sti/citations/ADP000063
[ "# Abstract:\n\nEfficient reanalysis models, which provide high quality explicit approximations for the structural behavior, are introduced. The presented algorithms are based on a series expansion which is shown to be equivalent to a simple iteration procedure. Only the decomposed stiffness matrix, known from exact analysis of the initial design, is required to obtain the approximate expressions. Two approaches of accelerated convergence are proposed to improve the quality of the approximations a An approach where a scalar multiplier, used for scaling of the initial design, is chosen prior to the solution as the accelerating parameter b An approach where information gathered during calculations of the series coefficient is used to improve the convergence rate. Numerical examples illustrate the efficiency and the quality of the proposed approximations. A special attention is focused on reanalyses along a line, a problem typical to many optimal design procedures. The computational effort in this case is considerably reduced, since only a single independent variable is involved.\n\n# Subject Categories:\n\n• Structural Engineering and Building Technology" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.8942972,"math_prob":0.9379257,"size":1437,"snap":"2020-45-2020-50","text_gpt3_token_len":271,"char_repetition_ratio":0.100488484,"word_repetition_ratio":0.0099502485,"special_character_ratio":0.17606124,"punctuation_ratio":0.11158799,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.97642785,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-10-24T19:09:44Z\",\"WARC-Record-ID\":\"<urn:uuid:ec76f5ae-e621-4ca0-bd35-984da036463b>\",\"Content-Length\":\"48871\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:ea87545a-10f7-4153-ae1e-19e7ee6a22af>\",\"WARC-Concurrent-To\":\"<urn:uuid:5371ffbb-d7ba-423c-b617-84a7cf7f1ed1>\",\"WARC-IP-Address\":\"131.84.180.30\",\"WARC-Target-URI\":\"https://apps.dtic.mil/sti/citations/ADP000063\",\"WARC-Payload-Digest\":\"sha1:PMZNPPGYKPEK24H2J7SPVDTAO77TZIAS\",\"WARC-Block-Digest\":\"sha1:TCKTMWIJUHAWQ34RM3R7PNEAKN7CBHAD\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-45/CC-MAIN-2020-45_segments_1603107884322.44_warc_CC-MAIN-20201024164841-20201024194841-00409.warc.gz\"}"}
https://math.stackexchange.com/questions/1066756/what-is-the-linear-space-of-eigenvectors-associated-with-a-certain-eigenvalue
[ "# What is the linear space of Eigenvectors associated with a certain Eigenvalue?\n\nThe following matrix $A$ has $\\lambda=2$ and $\\lambda=8$ as its eigenvalues\n\n$$A = \\begin{bmatrix} 4 & 2 & 2 \\\\ 2 & 4 & 2 \\\\ 2 & 2 & 4 \\end{bmatrix}$$\n\nlet $P$ be the orthogonal matrix that diagonalizes $A$. in other words, $A= PDP^T$. you can check that\n\n$$P = \\begin{bmatrix} (-√2)/2 & (-√6)/6 & (-√3)/3 \\\\ (√2)/2 & (-√6)/6 & (√3)/3 \\\\ 0 & (√6)/3 & (√3)/3 \\end{bmatrix}$$\n\nthen the linear space of eigenvectors associated to the eigenvalue $\\lambda=2$ is generated by?\n\n1. The last two columns of the matrix $P$\n2. The last two rows of matrix $P$\n3. The first two columns of the matrix $P$\n4. The first two rows of the matrix $P$\n5. The last column of the matrix $P$\n\nI Don't know how to solve this, I tried doing it but it got really messy and I didn't get any answer that made sense. If someone could please explain how to do it or how to solve it, that would be great.\n\nThank You\n\n• To format a matrix from now on use \\begin{bmatrix} and \\end{bmatrix}. In between separate the entries in the same row by & and separate the rows by \\\\. Dec 13, 2014 at 20:45\n\nSince matrix $P$ is orthogonal ($P^\\top = P^{-1}$) one can rewrite $A = PDP^\\top$ as $$D = P^{-1}A(P^{-1})^\\top = P^\\top AP$$ After multiplying one would obtain (there is a typo in your $P$ matrix) $$D = \\begin{bmatrix} -\\frac{1}{\\sqrt{2}} & \\frac{1}{\\sqrt{2}} & 0 \\\\ -\\frac{1}{\\sqrt{6}} & -\\frac{1}{\\sqrt{6}} & \\sqrt{\\frac{2}{3}} \\\\ \\frac{1}{\\sqrt{3}} & \\frac{1}{\\sqrt{3}} & \\frac{1}{\\sqrt{3}} \\end{bmatrix} \\begin{bmatrix} 4 & 2 & 2 \\\\ 2 & 4 & 2 \\\\ 2 & 2 & 4 \\end{bmatrix} \\begin{bmatrix} -\\frac{1}{\\sqrt{2}} & -\\frac{1}{\\sqrt{6}} & \\frac{1}{\\sqrt{3}} \\\\ \\frac{1}{\\sqrt{2}} & -\\frac{1}{\\sqrt{6}} & \\frac{1}{\\sqrt{3}} \\\\ 0 & \\sqrt{\\frac{2}{3}} & \\frac{1}{\\sqrt{3}} \\end{bmatrix} = \\begin{bmatrix} 2 & 0 & 0 \\\\ 0 & 2 & 0 \\\\ 0 & 0 & 8 \\end{bmatrix}$$ Note that $A = PDP^\\top$ could be rewritten as $AP = PD$ which means that $P$ columns are eigenvectors of $A$ and corresponding eigenvalues are on $D$ diagonal: $$A\\mathbf{p}_i = d_{ii} \\mathbf{p}_i, \\qquad P = \\begin{bmatrix} \\mathbf{p}_1 & \\mathbf{p}_2 & \\mathbf{p}_3 \\end{bmatrix}$$ Because $d_{11} = d_{22} = 2$ the eigenspace corresponding to $\\lambda = 2$ is formed by $\\mathbf{p}_1$ and $\\mathbf{p}_2$\nThe term is \"eigenspace for the eigenvalues $\\lambda=2$\" (not a linear space of eigenvectors, since the zero vector is not an eigenvector). It is by definition the kernel of (the linear map with matrix) $A-2I$, which is a matrix with all entries $2$. A column vector is in this kernel if each row of $A-2I$ applied to it is zero, and since all three rows are equal, it suffices to consider just one. If $x,y,z$ are the entries of the column vector, the equation becomes $x+y+z=0$. The first two columns of $P$ satisfy this, the third does not.\nIn fact $P$ has apparently been formed by taking bases of the eigenspaces for $\\lambda=2$ ($2$-dimensional) and for $\\lambda=8$ ($1$-dimensional), and making each of these basis orthonormal. The rows of $P$ have no natural interpretation as vectors expressed on the standard basis (and indeed none of them satisfy the relation $x+y+z=0$)." ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.8416531,"math_prob":0.9999988,"size":1002,"snap":"2022-40-2023-06","text_gpt3_token_len":332,"char_repetition_ratio":0.1482966,"word_repetition_ratio":0.09424084,"special_character_ratio":0.36127743,"punctuation_ratio":0.05076142,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":1.0000038,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-09-26T21:46:52Z\",\"WARC-Record-ID\":\"<urn:uuid:57f8d134-0ec9-4913-9ecb-c77196d1ff9c>\",\"Content-Length\":\"234332\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:4874e877-6889-42ba-8062-3c92041961e7>\",\"WARC-Concurrent-To\":\"<urn:uuid:ea151a87-b364-4d1b-b6fe-5db8817df6c9>\",\"WARC-IP-Address\":\"151.101.1.69\",\"WARC-Target-URI\":\"https://math.stackexchange.com/questions/1066756/what-is-the-linear-space-of-eigenvectors-associated-with-a-certain-eigenvalue\",\"WARC-Payload-Digest\":\"sha1:IGQSPTIF47KLJR3DT5SOGOPFD7QAVORW\",\"WARC-Block-Digest\":\"sha1:BVSUGID7JTL6NSHX5AYTIH3V3BXL3YQ2\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-40/CC-MAIN-2022-40_segments_1664030334942.88_warc_CC-MAIN-20220926211042-20220927001042-00009.warc.gz\"}"}
https://mcpherrin.ca/2019/11/23/sum-collisions.html
[ "# Matthew McPherrin\n\n2019-11-23\n\n## Colliding the sum checksum\n\nThe `sum` command-line tool is a simple checksum utility included in BSD and GNU Coreutils. It is not a cryptographically secure hash, and so I wrote a tool to set the `sum` of a file to an arbitrary value.\n\nYou can find that tool and associated code from this post on my github account in the sumcoll repository\n\n## Usage\n\nSum takes file(s) on the command line and prints a checksum value in decimal, along with a count of 1024-byte blocks.\n\n``````\\$ echo abcdef > file\n\\$ sum file\n33901 1\n``````\n\n## Backstory\n\nSome years ago I was asked to include the BSD sums of a homework assignment, to verify I had not modified the code after the assignment deadline. The sums of the files were included with a written portion submitted on paper in class, and the code was graded later.\n\n## Security\n\nUsing a non-cryptographically secure hash for this task is totally insecure, as a malicious student could find another file which has the same checksum as what was submitted on the paper handout. The property needed to prevent that is called Second Preimage Resistance. The malicious student gets to pick `m1` before the assignment deadline, and then afterwards, if they can find `m2` such that `hash(m1) = hash(m2)`, they can submit `m2`, a second preimage, without detection. Whether `m2` will get them more marks is left as an exercise to the student.\n\nEven with no knowledge of the algorithm used, we can tell it’s not secure. We can observe the output of the `sum` utility is a 16-bit number (printed in decimal usually), along with a count of how many 1024 byte blocks are in the input. The output being only 16 bits is simply not large enough, and we can use brute force to find collisions: If we sum `2^16 + 1` files, we are guaranteed to find a collision. That’s not quite the 2nd preimage we want, but it’s illustrative of how a small checksum value cannot be cryptographically secure.\n\n## The Algorithm\n\nThere’s no need blindly brute-force, as we can examine how `sum` works and be a bit more intelligent about how we attack it. The algorithm is very simple: Each byte is added into a 16 bit counter, and the counter is rotated right between each addition. Or, in Python:\n\n``````def rotate_right_16bit(data: int) -> int:\nreturn (data >> 1) | ((data & 1) << 15)\nfor byte in data:\nsum = rotate_right_16bit(sum) + byte\nsum = sum & 0xffff # clamp to 16 bits\n``````\n\n## Going Backwards\n\nFrom looking at this algorithm, the first thing to notice is that all the operations are reversible: We can subtract and rotate left to go backwards. That lets us add or change characters at any point in the file, and easily work backwards to find out what the intermediate value of the checksum we need to get our final goal value.\n\n``````def rotate_left_16bit(data: int) -> int:\nreturn (0xffff & (data << 1)) | (data >> 15)\nfor byte in reversed(suffix):\nsum = rotate_left_16bit((sum - byte) & 0xffff)\n``````\n\n## Making Changes\n\nThe tool we’re writing is going to insert bytes at a particular offset into the file. We’ll put the extra inserted characters in a comment, string, or some location that can be modified. We’ll compute the sum over a prefix up to the insertion point, and use the backwards sum computation to approach that same point from the opposite direction.\n\nOur task now is to find a set of characters that will, when inserted after the prefix, cause the sum to that point to equal the backwards sum. This is likely brute-forceable, but because we can go backwards, we can do a bit better.\n\n## Meet In The Middle\n\nThe strategy we’ll take for our tool is going to take advantage of the fact that the set of possible hashes is small, and that we can go backwards.\n\nWe’ll alternate extending prefix and suffix strings by an extra character and then checking if the resulting hash is in the opposite set. That is, we add to the end of the prefix and check if we’ve hit any of the suffix hashes, and then prepend to the suffix and check if we’ve hit any of the prefix hashes.\n\nBecause of the birthday paradox, and the fact that the set of hashes is only 2^16, the attack takes only a split second on my computer to run.\n\n## Character Sets\n\nThe code for generating collisions takes a bytstring as input, and will only use bytes from that. This means you can, say, only feed it printable characters, only ascii lowercase characters, or whatever you need to not break the file you’re trying to collide.\n\nTypically that means you want printable characters without newline for many comment “to the end of the line” style comments, or you can avoid `/` if you are using something like CSS that only does `/* */` style comments.\n\n## Block Size\n\nInserting a few bytes could change the number of blocks in the input. You’ll have to figure out what to do about that yourself. Try inserting the new bytes at a different location, or removing some other bytes first.\n\n## Conclusion\n\nThis isn’t exactly a hardened target, so there’s nothing really novel here, but I haven’t found any documentation of how to accomplish this elsewhere.\n\nI doubt anyone will ever need this, but there is both an implementation of the sum tool and the attack tool here. If you have feedback on that tool or this blog post, feel free to post issues there, or to email me." ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.8926241,"math_prob":0.7856431,"size":5139,"snap":"2020-45-2020-50","text_gpt3_token_len":1189,"char_repetition_ratio":0.10243428,"word_repetition_ratio":0.015086207,"special_character_ratio":0.22844912,"punctuation_ratio":0.08682927,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9578586,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-11-26T15:52:52Z\",\"WARC-Record-ID\":\"<urn:uuid:083d6887-377b-435d-b870-24bad7eb38d9>\",\"Content-Length\":\"10474\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:179c7d6b-0686-40c1-8544-b02a81dde04a>\",\"WARC-Concurrent-To\":\"<urn:uuid:6c0ec0cf-d4c4-41f2-97de-cb6661f4f6be>\",\"WARC-IP-Address\":\"185.199.109.153\",\"WARC-Target-URI\":\"https://mcpherrin.ca/2019/11/23/sum-collisions.html\",\"WARC-Payload-Digest\":\"sha1:57AJC7DYEICMYN3NGRWE7IMKU7PH44F5\",\"WARC-Block-Digest\":\"sha1:ZQXNNSUWKOU57YRZU2MGKEEFMFVD7WMR\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-50/CC-MAIN-2020-50_segments_1606141188800.15_warc_CC-MAIN-20201126142720-20201126172720-00221.warc.gz\"}"}
https://math.stackexchange.com/questions/3228704/confusion-in-intersection-of-images-of-sets
[ "# Confusion in Intersection of Images of sets.\n\nI am somehow unable to understand the following relation.\n\nif $$f:X\\rightarrow Y$$ and $$S,T\\subseteq X$$ then $$f(S\\cap T)\\subseteq f(S)\\cap f(T)$$\n\nThe main problem is I always end up in showing the equality rather than the subset-ness.\n\nExample $$f:X=\\{x_1,x_2,x_3\\}\\rightarrow Y=\\{y_1,y_2,y_3\\}$$ where $$f$$ is defined by $$f(x_1)=f(x_2)=y_1$$,$$f(x_3)=y_3$$ and $$S=\\{x_1\\},T=\\{x_2,x_3\\}$$ Then clearly $$f(S)\\cap f(T)\\subseteq f(S\\cap T)$$ does not hold,thus the equality is not possible.\n\nBut My question is where I am making mistake in following proof :\n\n$$y\\in f(S) \\cap f(T)$$ $$\\implies y\\in f(S) \\land y\\in f(T)$$ $$\\implies \\exists x\\in S \\land \\exists x\\in T$$ such that $$y=f(x)$$ $$\\implies x\\in S\\cap T$$ $$\\implies f(x)=y\\in f(S\\cap T)$$ Hence $$f(S)\\cap f(T)\\subseteq f(S\\cap T)$$\n\nCan you please correct me,?\n\n• The fact that $\\exists x \\in S \\text { and } \\exists x \\in T$ does not mean that they are the same $x$. – Mauro ALLEGRANZA May 16 '19 at 18:23\n• Consider : \"there is a number that is Even and there is a number that is Odd\". – Mauro ALLEGRANZA May 16 '19 at 18:24\n• Does that mean if such $x$ exists then equality holds ? – NewBornMATH May 16 '19 at 18:51\n\n## 1 Answer\n\nIn line three, you use the same $$x$$ in both $$S$$ and $$T$$. All that you know is that there exists an $$x\\in S$$ and there exists a $$z\\in T$$ so that $$f(x)=y=f(z)$$. There is no reason that you need the same element in both $$S$$ and $$T$$, just a pair of elements with the same image.\n\nIn your example, $$f(S)=\\{y_1\\}$$ and $$f(T)=\\{y_1,y_2\\}$$, so $$f(S)\\cap f(T)=\\{y_1\\}$$. Then, when you take preimages in $$S$$ and $$T$$ of $$y_1$$, you get $$x_1\\in S$$ and $$x_2\\in T$$. These are (of course) not the same element.\n\n• (+1) one thing I want to know whether $f(s)$ is the set of exactly all elements that are mapped from $x\\in S$ ? I mean consider here f(S)={y_1}, what I want to know , is whether {y1,y2} can be f(S) or not,? (as it contains {y1} !) – NewBornMATH May 16 '19 at 18:47\n• This is a different question, so it would be better to start a new question if you want more details. However, the short answer is $f(S)$ is exactly the set of images of points in $S$. In other words, $f(S)=\\{f(x):x\\in S\\}$. – Michael Burr May 16 '19 at 19:04\n• @Michael if it is exactly the set of images then, dpes $f(x)\\in f(S)$ necessary imply $x\\in S$ ? (Like $x\\in S \\implies f(x) \\in S$) – M Desmond May 16 '19 at 19:23\n• @MDesmond This is a different question, so it would be better to start a new question if you want more details. The short answer is that the two things you describe are not the same. No, if you know that $f(x)\\in f(S)$, then you cannot conclude that $x\\in S$ since there might be some other $y\\in S$ so that $f(x)=f(y)$. For example, if $S$ is the positive integers and $f$ is the squaring map, then $f(-2)=4\\in f(S)$ since $f(2)=4$ and $2\\in S$, but $-2\\not\\in S$. On the other hand, the last line you write is correct (after correcting a typo), $x\\in S$ implies that $f(x)\\in f(S)$. – Michael Burr May 16 '19 at 21:50" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.730652,"math_prob":0.9999912,"size":805,"snap":"2021-21-2021-25","text_gpt3_token_len":301,"char_repetition_ratio":0.13233458,"word_repetition_ratio":0.0,"special_character_ratio":0.3689441,"punctuation_ratio":0.08947369,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":1.0000074,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-06-13T23:30:56Z\",\"WARC-Record-ID\":\"<urn:uuid:f7574aaf-9ec6-4f8d-9325-7fbcccca15ea>\",\"Content-Length\":\"169084\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:ce2fc62e-aaea-4d68-bff6-a3ea6ce1742f>\",\"WARC-Concurrent-To\":\"<urn:uuid:694cfd59-58f2-492e-84de-a64a36362830>\",\"WARC-IP-Address\":\"151.101.1.69\",\"WARC-Target-URI\":\"https://math.stackexchange.com/questions/3228704/confusion-in-intersection-of-images-of-sets\",\"WARC-Payload-Digest\":\"sha1:33S6TTXDPVXMX53YSUDQV7DSIMHU5APO\",\"WARC-Block-Digest\":\"sha1:S4OLYQ3DNBYDJJPEHOFHAG4XVXRMZL2Z\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-25/CC-MAIN-2021-25_segments_1623487611089.19_warc_CC-MAIN-20210613222907-20210614012907-00067.warc.gz\"}"}
https://www.kanshudo.com/grammar/math
[ "", null, "Components\n\nGrammar detail: mathematical notation\n\nmathematical notation\nTweet\n142 words\nMy current mastery of this grammar point:\nThis article shows how to express simple arithmetic as well as more complex mathematical formulas in Japanese.\nArithmetic\n + たす - ひく x かける ÷ わる = は (read わ)\nFor example, 3 x 2 = 6 would be read さんかけるにはろく.\nMore examples:\nくわ\nえる\nなる\nAdd 5 to 3 and you have 8.\nじょう乗 - to the power of\nさん\nさん\nじょう\nにじゅうなな\n27\nである\n3 to the third power is 27.\nOdd and even numbers\n(click the word for examples and links)\nTEST\n(click the word for examples and links)\nTEST\nSequences\nnoun\n(click the word for examples and links)\nTEST\nnoun\n(click the word for examples and links)\nTEST\nFractions and parts\n\n• ろくにん\n6人\nちゅう\nごにん\n5人\nいしゃ\n医者\nfive out of six doctors\nThe most common way to indicate a part of something is X\nぶん\nの Y. For example:\nわたし\nケーキ\nよんぶん\n4分\nいち\nべた\n\nI ate a quarter of a cake.\nKey mathematical terms\nnoun\n(click the word to view an additional 1 form, examples and links)\nTEST\nnoun\ndenominator  (mathematics)\n(click the word for examples and links)\nTEST\n1. numerator\n2. molecule\n(click the word to view an additional 1 meaning, examples and links)\nTEST\n\nKanji used in this grammar\n\nチュウ   ジュウ   なか middle\nジン   ニン   ひと person\nイ    doctor" ]
[ null, "https://www.facebook.com/tr", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.74013555,"math_prob":0.78733146,"size":1612,"snap":"2022-05-2022-21","text_gpt3_token_len":492,"char_repetition_ratio":0.16044776,"word_repetition_ratio":0.09057971,"special_character_ratio":0.22952853,"punctuation_ratio":0.100323625,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.97215366,"pos_list":[0,1,2],"im_url_duplicate_count":[null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-01-20T02:04:32Z\",\"WARC-Record-ID\":\"<urn:uuid:fbe2cb7e-5846-4c40-b626-649945472e08>\",\"Content-Length\":\"181106\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:298864df-d3b9-4e0c-a72e-5bcce05df3e2>\",\"WARC-Concurrent-To\":\"<urn:uuid:bfc7ca89-1311-4ccc-8b65-fc9ed80c0890>\",\"WARC-IP-Address\":\"52.21.227.162\",\"WARC-Target-URI\":\"https://www.kanshudo.com/grammar/math\",\"WARC-Payload-Digest\":\"sha1:DUSIYCHP5RMST2PZARS5JAVF27EH3LYC\",\"WARC-Block-Digest\":\"sha1:TJXQUU3KHCAUT4IPGPRN4HNFEIEX3I5E\",\"WARC-Identified-Payload-Type\":\"application/xhtml+xml\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-05/CC-MAIN-2022-05_segments_1642320301670.75_warc_CC-MAIN-20220120005715-20220120035715-00690.warc.gz\"}"}
https://www.python-engineer.com/blog/advancedpython19_asterisk/
[ "# The Asterisk (*) operator - Advanced Python 19\n\nThe asterisk sign (`*`) can be used for different cases in Python:\n\n• Multiplication and power operations\n• Creation of list, tuple, or string with repeated elements\n• `*args` , `**kwargs` , and keyword-only parameters\n• Unpacking lists/tuples/dictionaries for function arguments\n• Unpacking containers\n• Merging containers into list / Merge dictionaries\n\n## Multiplication and power operations\n\n``````# multiplication\nresult = 7 * 5\nprint(result)\n\n# power operation\nresult = 2 ** 4\nprint(result)``````\n`````` 35\n16``````\n\n## Creation of list, tuple, or string with repeated elements\n\n``````# list\nzeros = * 10\nonetwos = [1, 2] * 5\nprint(zeros)\nprint(onetwos)\n\n# tuple\nzeros = (0,) * 10\nonetwos = (1, 2) * 5\nprint(zeros)\nprint(onetwos)\n\n# string\nA_string = \"A\" * 10\nAB_string = \"AB\" * 5\nprint(A_string)\nprint(AB_string)``````\n`````` [0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\n[1, 2, 1, 2, 1, 2, 1, 2, 1, 2]\n(0, 0, 0, 0, 0, 0, 0, 0, 0, 0)\n(1, 2, 1, 2, 1, 2, 1, 2, 1, 2)\nAAAAAAAAAA\nABABABABAB``````\n\n## `*args` , `**kwargs` , and keyword-only arguments\n\n• Use `*args` for variable-length arguments\n• Use `**kwargs` for variable-length keyword arguments\n• Use `*,` followed by more function parameters to enforce keyword-only arguments\n``````def my_function(*args, **kwargs):\nfor arg in args:\nprint(arg)\nfor key in kwargs:\nprint(key, kwargs[key])\n\nmy_function(\"Hey\", 3, [0, 1, 2], name=\"Alex\", age=8)\n\n# Parameters after '*' or '*identifier' are keyword-only parameters and may only be passed using keyword arguments.\ndef my_function2(name, *, age):\nprint(name)\nprint(age)\n\n# my_function2(\"Michael\", 5) --> this would raise a TypeError\nmy_function2(\"Michael\", age=5)``````\n`````` Hey\n3\n[0, 1, 2]\nname Alex\nage 8\nMichael\n5``````\n\n## Unpacking for function arguments\n\n• Lists/tuples/sets/strings can be unpacked into function arguments with one `*` if the length matches the parameters.\n• Dictionaries can be unpacked with two `**` if the length and the keys match the parameters.\n``````def foo(a, b, c):\nprint(a, b, c)\n\n# length must match\nmy_list = [1, 2, 3]\nfoo(*my_list)\n\nmy_string = \"ABC\"\nfoo(*my_string)\n\n# length and keys must match\nmy_dict = {'a': 4, 'b': 5, 'c': 6}\nfoo(**my_dict)``````\n`````` 1 2 3\nA B C\n4 5 6``````\n\n## Unpacking containers\n\nUnpack the elements of a list, tuple, or set into single and multiple remaining elements. Note that multiple elements are combined in a list, even if the unpacked container is a tuple or a set.\n\n``````numbers = (1, 2, 3, 4, 5, 6, 7, 8)\n\n*beginning, last = numbers\nprint(beginning)\nprint(last)\n\nprint()\n\nfirst, *end = numbers\nprint(first)\nprint(end)\n\nprint()\nfirst, *middle, last = numbers\nprint(first)\nprint(middle)\nprint(last)``````\n`````` [1, 2, 3, 4, 5, 6, 7]\n8\n\n1\n[2, 3, 4, 5, 6, 7, 8]\n\n1\n[2, 3, 4, 5, 6, 7]\n8``````\n\n## Merge iterables into a list / Merge dictionaries\n\nThis is possible since Python 3.5 thanks to PEP 448 (https://www.python.org/dev/peps/pep-0448/).\n\n``````# dump iterables into a list and merge them\nmy_tuple = (1, 2, 3)\nmy_set = {4, 5, 6}\nmy_list = [*my_tuple, *my_set]\nprint(my_list)\n\n# merge two dictionaries with dict unpacking\ndict_a = {'one': 1, 'two': 2}\ndict_b = {'three': 3, 'four': 4}\ndict_c = {**dict_a, **dict_b}\nprint(dict_c)``````\n`````` [1, 2, 3, 4, 5, 6]\n{'one': 1, 'two': 2, 'three': 3, 'four': 4}``````\n\nBut be careful with the following merging solution. It does not work if the dictionary has any non-string keys:\nhttps://stackoverflow.com/questions/38987/how-to-merge-two-dictionaries-in-a-single-expression/39858#39858\n\n``````dict_a = {'one': 1, 'two': 2}\ndict_b = {3: 3, 'four': 4}\ndict_c = dict(dict_a, **dict_b)\nprint(dict_c)\n\n# this works:\n# dict_c = {**dict_a, **dict_b}``````\n`````` ---------------------------------------------------------------------------\nTypeError Traceback (most recent call last)\n<ipython-input-52-2660fb90a60f> in <module>\n1 dict_a = {'one': 1, 'two': 2}\n2 dict_b = {3: 3, 'four': 4}\n----> 3 dict_c = dict(dict_a, **dict_b)\n4 print(dict_c)\n5\nTypeError: keywords must be strings``````" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.5315508,"math_prob":0.97201174,"size":3777,"snap":"2020-10-2020-16","text_gpt3_token_len":1281,"char_repetition_ratio":0.14656772,"word_repetition_ratio":0.09586777,"special_character_ratio":0.37860736,"punctuation_ratio":0.21254802,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9789685,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-02-20T19:55:21Z\",\"WARC-Record-ID\":\"<urn:uuid:8119b665-b961-47b3-ae18-a9e81a607e76>\",\"Content-Length\":\"169089\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:c0691a91-55ca-49de-8d2e-bb5609338ed9>\",\"WARC-Concurrent-To\":\"<urn:uuid:f52b387b-9728-4711-9112-495c4900d311>\",\"WARC-IP-Address\":\"104.248.60.43\",\"WARC-Target-URI\":\"https://www.python-engineer.com/blog/advancedpython19_asterisk/\",\"WARC-Payload-Digest\":\"sha1:IDWWM3FAOJEMFEVQLQQB2AKA2IFIYTT2\",\"WARC-Block-Digest\":\"sha1:4DH3DUF4T4CXZF3DJVSU7XSAECQGGHRH\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-10/CC-MAIN-2020-10_segments_1581875145282.57_warc_CC-MAIN-20200220193228-20200220223228-00270.warc.gz\"}"}
https://fuckbuttons.com/what-is-bell-curve-analysis/
[ "", null, "# What is bell curve analysis?\n\n## What is bell curve analysis?\n\nA bell curve (also known as normal distribution curve) is a way to plot and analyze data that looks like a bell curve. In the bell curve, the highest point is the one that has the highest probability of occurring, and the probability of occurrences goes down on either side of the curve.\n\n## How do you standardize a normal curve?\n\nLogically, a normal distribution can also be standardized. The result is called a standard normal distribution. You may be wondering how the standardization goes down here. Well, all we need to do is simply shift the mean by mu, and the standard deviation by sigma.\n\n## What does a normal curve indicate?\n\nWhat is Normal Distribution? Normal distribution, also known as the Gaussian distribution, is a probability distribution that is symmetric about the mean, showing that data near the mean are more frequent in occurrence than data far from the mean. In graph form, normal distribution will appear as a bell curve.\n\n## Why do we standardize in statistics?\n\nStandardized data is essential for accurate data analysis; it’s easier to draw clear conclusions about your current data when you have other data to measure it against.\n\n## How do you know if a distribution is normal?\n\nIn order to be considered a normal distribution, a data set (when graphed) must follow a bell-shaped symmetrical curve centered around the mean. It must also adhere to the empirical rule that indicates the percentage of the data set that falls within (plus or minus) 1, 2 and 3 standard deviations of the mean.\n\n## What is standard normal probability distribution?\n\nThe standard normal distribution is a normal distribution with a mean of zero and standard deviation of 1. The standard normal distribution is centered at zero and the degree to which a given measurement deviates from the mean is given by the standard deviation.२०१६ जुलाई २४\n\n## What are the characteristics of a normal curve?\n\nCharacteristics of a Normal Curve\n\n• All normal curves are bell-shaped with points of inflection at μ ± σ .\n• All normal curves are symmetric about the mean .\n• The area under an entire normal curve is 1.\n• All normal curves are positive for all .\n\n## What is a performance curve?\n\nA pump performance curve indicates how a pump will perform in regards to pressure head and flow. A curve is defined for a specific operating speed (rpm) and a specific inlet/outlet diameter. The curve also shows the shut off head or the head that the pump would generate if operating against a closed valve.\n\n## Why do we need normalization?\n\nNormalization is a technique for organizing data in a database. It is important that a database is normalized to minimize redundancy (duplicate data) and to ensure only related data is stored in each table. It also prevents any issues stemming from database modifications such as insertions, deletions, and updates.\n\n## What is bell curve mentality?\n\nWhat do you mean by bell curve mentality? It is a social theory designed to sort people out and identify a limited number of winners. It suggests there’s no need to even try to get some kids to learn because they were’nt born with the right stuff, that some students have the ability to achieve while some do not.२०१४ नोभेम्बर ४\n\n## What is the use of normalization?\n\nNormalization is used to minimize the redundancy from a relation or set of relations. It is also used to eliminate the undesirable characteristics like Insertion, Update and Deletion Anomalies. Normalization divides the larger table into the smaller table and links them using relationship.\n\n## How do you standardize?\n\nTypically, to standardize variables, you calculate the mean and standard deviation for a variable. Then, for each observed value of the variable, you subtract the mean and divide by the standard deviation.\n\n## What are 3 characteristics of a normal curve?\n\nCharacteristics of Normal Distribution Normal distributions are symmetric, unimodal, and asymptotic, and the mean, median, and mode are all equal. A normal distribution is perfectly symmetrical around its center. That is, the right side of the center is a mirror image of the left side.२०१५ जुलाई १६\n\n## What is the area of the entire region under the normal curve?\n\nThe total area under the normal curve is equal to 1. The probability that a normal random variable X equals any particular value is 0.\n\n## What is NPC and its characteristics?\n\nThe Normal Probability Curve (N.P.C.) is symmetrical about the ordinate of the central point of the curve. It implies that the size, shape and slope of the curve on one side of the curve is identical to that of the other. If the figure is to be folded along its vertical axis, the two halves would coincide.\n\n## How do you find standardized value?\n\nStandardized value = X – μ / σ = 520 – 420 / 50. Step 3: Use a calculator and solve: 520 – 420 / 50 = 100/50 = 2. The standardized value is 2….The Standardized Values Formula\n\n1. X: the observation (a specific value that you are calculating the z-score for).\n2. Mu(μ): the mean.\n3. Sigma(σ): the standard deviation." ]
[ null, "https://fuckbuttons.com/wp-content/themes/cool-blog/assets/loader/style-5.gif", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.9223259,"math_prob":0.9796894,"size":5002,"snap":"2022-40-2023-06","text_gpt3_token_len":1089,"char_repetition_ratio":0.17667067,"word_repetition_ratio":0.012850467,"special_character_ratio":0.207517,"punctuation_ratio":0.10208333,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99372405,"pos_list":[0,1,2],"im_url_duplicate_count":[null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-09-27T13:49:50Z\",\"WARC-Record-ID\":\"<urn:uuid:e1eeb943-b8a4-4f0d-9747-09e7dcb1346a>\",\"Content-Length\":\"58391\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:eb284f9e-7ba4-4877-93a1-5e88f47c3efd>\",\"WARC-Concurrent-To\":\"<urn:uuid:214b7548-645a-4995-ba51-e0238109c703>\",\"WARC-IP-Address\":\"151.139.128.10\",\"WARC-Target-URI\":\"https://fuckbuttons.com/what-is-bell-curve-analysis/\",\"WARC-Payload-Digest\":\"sha1:PQVUODPVLSER762TGV37KSUGEJVGILBL\",\"WARC-Block-Digest\":\"sha1:LC2NOGM6AYHHEIN5HQ2BH6OTNN7JNS7Z\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-40/CC-MAIN-2022-40_segments_1664030335034.61_warc_CC-MAIN-20220927131111-20220927161111-00679.warc.gz\"}"}
https://convertoctopus.com/834-days-to-hours
[ "## Conversion formula\n\nThe conversion factor from days to hours is 24, which means that 1 day is equal to 24 hours:\n\n1 d = 24 hr\n\nTo convert 834 days into hours we have to multiply 834 by the conversion factor in order to get the time amount from days to hours. We can also form a simple proportion to calculate the result:\n\n1 d → 24 hr\n\n834 d → T(hr)\n\nSolve the above proportion to obtain the time T in hours:\n\nT(hr) = 834 d × 24 hr\n\nT(hr) = 20016 hr\n\nThe final result is:\n\n834 d → 20016 hr\n\nWe conclude that 834 days is equivalent to 20016 hours:\n\n834 days = 20016 hours\n\n## Alternative conversion\n\nWe can also convert by utilizing the inverse value of the conversion factor. In this case 1 hour is equal to 4.996003197442E-5 × 834 days.\n\nAnother way is saying that 834 days is equal to 1 ÷ 4.996003197442E-5 hours.\n\n## Approximate result\n\nFor practical purposes we can round our final result to an approximate numerical value. We can say that eight hundred thirty-four days is approximately twenty thousand sixteen hours:\n\n834 d ≅ 20016 hr\n\nAn alternative is also that one hour is approximately zero times eight hundred thirty-four days.\n\n## Conversion table\n\n### days to hours chart\n\nFor quick reference purposes, below is the conversion table you can use to convert from days to hours\n\ndays (d) hours (hr)\n835 days 20040 hours\n836 days 20064 hours\n837 days 20088 hours\n838 days 20112 hours\n839 days 20136 hours\n840 days 20160 hours\n841 days 20184 hours\n842 days 20208 hours\n843 days 20232 hours\n844 days 20256 hours" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.8403402,"math_prob":0.871552,"size":1518,"snap":"2022-05-2022-21","text_gpt3_token_len":416,"char_repetition_ratio":0.17965654,"word_repetition_ratio":0.0,"special_character_ratio":0.34123847,"punctuation_ratio":0.054607507,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99357516,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-05-28T23:27:13Z\",\"WARC-Record-ID\":\"<urn:uuid:ec4b2362-b3d9-4205-834a-2ba0e36d5e0b>\",\"Content-Length\":\"30040\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:eb985ce2-f647-4411-9cc4-2c41e00bbf3b>\",\"WARC-Concurrent-To\":\"<urn:uuid:e948247f-1263-4acc-84b2-af1024299c03>\",\"WARC-IP-Address\":\"172.67.171.60\",\"WARC-Target-URI\":\"https://convertoctopus.com/834-days-to-hours\",\"WARC-Payload-Digest\":\"sha1:J5JHH7LX7MAMXP4Z5GLI2JFQFXZSM6JE\",\"WARC-Block-Digest\":\"sha1:HLN6ALRTFCCG5YQTCGPRJKVPJI7XE5AI\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-21/CC-MAIN-2022-21_segments_1652663021405.92_warc_CC-MAIN-20220528220030-20220529010030-00159.warc.gz\"}"}
https://retiretotravel.savingadvice.com/2008/05/30/its-starting-to-feel-real_39527/
[ "User Real IP - 3.216.28.250\n```Array\n(\n => Array\n(\n => 182.68.68.92\n)\n\n => Array\n(\n => 101.0.41.201\n)\n\n => Array\n(\n => 43.225.98.123\n)\n\n => Array\n(\n => 2.58.194.139\n)\n\n => Array\n(\n => 46.119.197.104\n)\n\n => Array\n(\n => 45.249.8.93\n)\n\n => Array\n(\n => 103.12.135.72\n)\n\n => Array\n(\n => 157.35.243.216\n)\n\n => Array\n(\n => 209.107.214.176\n)\n\n => Array\n(\n => 5.181.233.166\n)\n\n => Array\n(\n => 106.201.10.100\n)\n\n => Array\n(\n => 36.90.55.39\n)\n\n => Array\n(\n => 119.154.138.47\n)\n\n => Array\n(\n => 51.91.31.157\n)\n\n => Array\n(\n => 182.182.65.216\n)\n\n => Array\n(\n => 157.35.252.63\n)\n\n => Array\n(\n => 14.142.34.163\n)\n\n => Array\n(\n => 178.62.43.135\n)\n\n => Array\n(\n => 43.248.152.148\n)\n\n => Array\n(\n => 222.252.104.114\n)\n\n => Array\n(\n => 209.107.214.168\n)\n\n => Array\n(\n => 103.99.199.250\n)\n\n => Array\n(\n => 178.62.72.160\n)\n\n => Array\n(\n => 27.6.1.170\n)\n\n => Array\n(\n => 182.69.249.219\n)\n\n => Array\n(\n => 110.93.228.86\n)\n\n => Array\n(\n => 72.255.1.98\n)\n\n => Array\n(\n => 182.73.111.98\n)\n\n => Array\n(\n => 45.116.117.11\n)\n\n => Array\n(\n => 122.15.78.189\n)\n\n => Array\n(\n => 14.167.188.234\n)\n\n => Array\n(\n => 223.190.4.202\n)\n\n => Array\n(\n => 202.173.125.19\n)\n\n => Array\n(\n => 103.255.5.32\n)\n\n => Array\n(\n => 39.37.145.103\n)\n\n => Array\n(\n => 140.213.26.249\n)\n\n => Array\n(\n => 45.118.166.85\n)\n\n => Array\n(\n => 102.166.138.255\n)\n\n => Array\n(\n => 77.111.246.234\n)\n\n => Array\n(\n => 45.63.6.196\n)\n\n => Array\n(\n => 103.250.147.115\n)\n\n => Array\n(\n => 223.185.30.99\n)\n\n => Array\n(\n => 103.122.168.108\n)\n\n => Array\n(\n => 123.136.203.21\n)\n\n => Array\n(\n => 171.229.243.63\n)\n\n => Array\n(\n => 153.149.98.149\n)\n\n => Array\n(\n => 223.238.93.15\n)\n\n => Array\n(\n => 178.62.113.166\n)\n\n => Array\n(\n => 101.162.0.153\n)\n\n => Array\n(\n => 121.200.62.114\n)\n\n => Array\n(\n => 14.248.77.252\n)\n\n => Array\n(\n => 95.142.117.29\n)\n\n => Array\n(\n => 150.129.60.107\n)\n\n => Array\n(\n => 94.205.243.22\n)\n\n => Array\n(\n => 115.42.71.143\n)\n\n => Array\n(\n => 117.217.195.59\n)\n\n => Array\n(\n => 182.77.112.56\n)\n\n => Array\n(\n => 182.77.112.108\n)\n\n => Array\n(\n => 41.80.69.10\n)\n\n => Array\n(\n => 117.5.222.121\n)\n\n => Array\n(\n => 103.11.0.38\n)\n\n => Array\n(\n => 202.173.127.140\n)\n\n => Array\n(\n => 49.249.249.50\n)\n\n => Array\n(\n => 116.72.198.211\n)\n\n => Array\n(\n => 223.230.54.53\n)\n\n => Array\n(\n => 102.69.228.74\n)\n\n => Array\n(\n => 39.37.251.89\n)\n\n => Array\n(\n => 39.53.246.141\n)\n\n => Array\n(\n => 39.57.182.72\n)\n\n => Array\n(\n => 209.58.130.210\n)\n\n => Array\n(\n => 104.131.75.86\n)\n\n => Array\n(\n => 106.212.131.255\n)\n\n => Array\n(\n => 106.212.132.127\n)\n\n => Array\n(\n => 223.190.4.60\n)\n\n => Array\n(\n => 103.252.116.252\n)\n\n => Array\n(\n => 103.76.55.182\n)\n\n => Array\n(\n => 45.118.166.70\n)\n\n => Array\n(\n => 103.93.174.215\n)\n\n => Array\n(\n => 5.62.62.142\n)\n\n => Array\n(\n => 182.179.158.156\n)\n\n => Array\n(\n => 39.57.255.12\n)\n\n => Array\n(\n => 39.37.178.37\n)\n\n => Array\n(\n => 182.180.165.211\n)\n\n => Array\n(\n => 119.153.135.17\n)\n\n => Array\n(\n => 72.255.15.244\n)\n\n => Array\n(\n => 139.180.166.181\n)\n\n => Array\n(\n => 70.119.147.111\n)\n\n => Array\n(\n => 106.210.40.83\n)\n\n => Array\n(\n => 14.190.70.91\n)\n\n => Array\n(\n => 202.125.156.82\n)\n\n => Array\n(\n => 115.42.68.38\n)\n\n => Array\n(\n => 102.167.13.108\n)\n\n => Array\n(\n => 117.217.192.130\n)\n\n => Array\n(\n => 205.185.223.156\n)\n\n => Array\n(\n => 171.224.180.29\n)\n\n => Array\n(\n => 45.127.45.68\n)\n\n => Array\n(\n => 195.206.183.232\n)\n\n => Array\n(\n => 49.32.52.115\n)\n\n => Array\n(\n => 49.207.49.223\n)\n\n => Array\n(\n => 45.63.29.61\n)\n\n => Array\n(\n => 103.245.193.214\n)\n\n => Array\n(\n => 39.40.236.69\n)\n\n => Array\n(\n => 62.80.162.111\n)\n\n => Array\n(\n => 45.116.232.56\n)\n\n => Array\n(\n => 45.118.166.91\n)\n\n => Array\n(\n => 180.92.230.234\n)\n\n => Array\n(\n => 157.40.57.160\n)\n\n => Array\n(\n => 110.38.38.130\n)\n\n => Array\n(\n => 72.255.57.183\n)\n\n => Array\n(\n => 182.68.81.85\n)\n\n => Array\n(\n => 39.57.202.122\n)\n\n => Array\n(\n => 119.152.154.36\n)\n\n => Array\n(\n => 5.62.62.141\n)\n\n => Array\n(\n => 119.155.54.232\n)\n\n => Array\n(\n => 39.37.141.22\n)\n\n => Array\n(\n => 183.87.12.225\n)\n\n => Array\n(\n => 107.170.127.117\n)\n\n => Array\n(\n => 125.63.124.49\n)\n\n => Array\n(\n => 39.42.191.3\n)\n\n => Array\n(\n => 116.74.24.72\n)\n\n => Array\n(\n => 46.101.89.227\n)\n\n => Array\n(\n => 202.173.125.247\n)\n\n => Array\n(\n => 39.42.184.254\n)\n\n => Array\n(\n => 115.186.165.132\n)\n\n => Array\n(\n => 39.57.206.126\n)\n\n => Array\n(\n => 103.245.13.145\n)\n\n => Array\n(\n => 202.175.246.43\n)\n\n => Array\n(\n => 192.140.152.150\n)\n\n => Array\n(\n => 202.88.250.103\n)\n\n => Array\n(\n => 103.248.94.207\n)\n\n => Array\n(\n => 77.73.66.101\n)\n\n => Array\n(\n => 104.131.66.8\n)\n\n => Array\n(\n => 113.186.161.97\n)\n\n => Array\n(\n => 222.254.5.7\n)\n\n => Array\n(\n => 223.233.67.247\n)\n\n => Array\n(\n => 171.249.116.146\n)\n\n => Array\n(\n => 47.30.209.71\n)\n\n => Array\n(\n => 202.134.13.130\n)\n\n => Array\n(\n => 27.6.135.7\n)\n\n => Array\n(\n => 107.170.186.79\n)\n\n => Array\n(\n => 103.212.89.171\n)\n\n => Array\n(\n => 117.197.9.77\n)\n\n => Array\n(\n => 122.176.206.233\n)\n\n => Array\n(\n => 192.227.253.222\n)\n\n => Array\n(\n => 182.188.224.119\n)\n\n => Array\n(\n => 14.248.70.74\n)\n\n => Array\n(\n => 42.118.219.169\n)\n\n => Array\n(\n => 110.39.146.170\n)\n\n => Array\n(\n => 119.160.66.143\n)\n\n => Array\n(\n => 103.248.95.130\n)\n\n => Array\n(\n => 27.63.152.208\n)\n\n => Array\n(\n => 49.207.114.96\n)\n\n => Array\n(\n => 102.166.23.214\n)\n\n => Array\n(\n => 175.107.254.73\n)\n\n => Array\n(\n => 103.10.227.214\n)\n\n => Array\n(\n => 202.143.115.89\n)\n\n => Array\n(\n => 110.93.227.187\n)\n\n => Array\n(\n => 103.140.31.60\n)\n\n => Array\n(\n => 110.37.231.46\n)\n\n => Array\n(\n => 39.36.99.238\n)\n\n => Array\n(\n => 157.37.140.26\n)\n\n => Array\n(\n => 43.246.202.226\n)\n\n => Array\n(\n => 137.97.8.143\n)\n\n => Array\n(\n => 182.65.52.242\n)\n\n => Array\n(\n => 115.42.69.62\n)\n\n => Array\n(\n => 14.143.254.58\n)\n\n => Array\n(\n => 223.179.143.236\n)\n\n => Array\n(\n => 223.179.143.249\n)\n\n => Array\n(\n => 103.143.7.54\n)\n\n => Array\n(\n => 223.179.139.106\n)\n\n => Array\n(\n => 39.40.219.90\n)\n\n => Array\n(\n => 45.115.141.231\n)\n\n => Array\n(\n => 120.29.100.33\n)\n\n => Array\n(\n => 112.196.132.5\n)\n\n => Array\n(\n => 202.163.123.153\n)\n\n => Array\n(\n => 5.62.58.146\n)\n\n => Array\n(\n => 39.53.216.113\n)\n\n => Array\n(\n => 42.111.160.73\n)\n\n => Array\n(\n => 107.182.231.213\n)\n\n => Array\n(\n => 119.82.94.120\n)\n\n => Array\n(\n => 178.62.34.82\n)\n\n => Array\n(\n => 203.122.6.18\n)\n\n => Array\n(\n => 157.42.38.251\n)\n\n => Array\n(\n => 45.112.68.222\n)\n\n => Array\n(\n => 49.206.212.122\n)\n\n => Array\n(\n => 104.236.70.228\n)\n\n => Array\n(\n => 42.111.34.243\n)\n\n => Array\n(\n => 84.241.19.186\n)\n\n => Array\n(\n => 89.187.180.207\n)\n\n => Array\n(\n => 104.243.212.118\n)\n\n => Array\n(\n => 104.236.55.136\n)\n\n => Array\n(\n => 106.201.16.163\n)\n\n => Array\n(\n => 46.101.40.25\n)\n\n => Array\n(\n => 45.118.166.94\n)\n\n => Array\n(\n => 49.36.128.102\n)\n\n => Array\n(\n => 14.142.193.58\n)\n\n => Array\n(\n => 212.79.124.176\n)\n\n => Array\n(\n => 45.32.191.194\n)\n\n => Array\n(\n => 105.112.107.46\n)\n\n => Array\n(\n => 106.201.14.8\n)\n\n => Array\n(\n => 110.93.240.65\n)\n\n => Array\n(\n => 27.96.95.177\n)\n\n => Array\n(\n => 45.41.134.35\n)\n\n => Array\n(\n => 180.151.13.110\n)\n\n => Array\n(\n => 101.53.242.89\n)\n\n => Array\n(\n => 115.186.3.110\n)\n\n => Array\n(\n => 171.49.185.242\n)\n\n => Array\n(\n => 115.42.70.24\n)\n\n => Array\n(\n => 45.128.188.43\n)\n\n => Array\n(\n => 103.140.129.63\n)\n\n => Array\n(\n => 101.50.113.147\n)\n\n => Array\n(\n => 103.66.73.30\n)\n\n => Array\n(\n => 117.247.193.169\n)\n\n => Array\n(\n => 120.29.100.94\n)\n\n => Array\n(\n => 42.109.154.39\n)\n\n => Array\n(\n => 122.173.155.150\n)\n\n => Array\n(\n => 45.115.104.53\n)\n\n => Array\n(\n => 116.74.29.84\n)\n\n => Array\n(\n => 101.50.125.34\n)\n\n => Array\n(\n => 45.118.166.80\n)\n\n => Array\n(\n => 91.236.184.27\n)\n\n => Array\n(\n => 113.167.185.120\n)\n\n => Array\n(\n => 27.97.66.222\n)\n\n => Array\n(\n => 43.247.41.117\n)\n\n => Array\n(\n => 23.229.16.227\n)\n\n => Array\n(\n => 14.248.79.209\n)\n\n => Array\n(\n => 117.5.194.26\n)\n\n => Array\n(\n => 117.217.205.41\n)\n\n => Array\n(\n => 114.79.169.99\n)\n\n => Array\n(\n => 103.55.60.97\n)\n\n => Array\n(\n => 182.75.89.210\n)\n\n => Array\n(\n => 77.73.66.109\n)\n\n => Array\n(\n => 182.77.126.139\n)\n\n => Array\n(\n => 14.248.77.166\n)\n\n => Array\n(\n => 157.35.224.133\n)\n\n => Array\n(\n => 183.83.38.27\n)\n\n => Array\n(\n => 182.68.4.77\n)\n\n => Array\n(\n => 122.177.130.234\n)\n\n => Array\n(\n => 103.24.99.99\n)\n\n => Array\n(\n => 103.91.127.66\n)\n\n => Array\n(\n => 41.90.34.240\n)\n\n => Array\n(\n => 49.205.77.102\n)\n\n => Array\n(\n => 103.248.94.142\n)\n\n => Array\n(\n => 104.143.92.170\n)\n\n => Array\n(\n => 219.91.157.114\n)\n\n => Array\n(\n => 223.190.88.22\n)\n\n => Array\n(\n => 223.190.86.232\n)\n\n => Array\n(\n => 39.41.172.80\n)\n\n => Array\n(\n => 124.107.206.5\n)\n\n => Array\n(\n => 139.167.180.224\n)\n\n => Array\n(\n => 93.76.64.248\n)\n\n => Array\n(\n => 65.216.227.119\n)\n\n => Array\n(\n => 223.190.119.141\n)\n\n => Array\n(\n => 110.93.237.179\n)\n\n => Array\n(\n => 41.90.7.85\n)\n\n => Array\n(\n => 103.100.6.26\n)\n\n => Array\n(\n => 104.140.83.13\n)\n\n => Array\n(\n => 223.190.119.133\n)\n\n => Array\n(\n => 119.152.150.87\n)\n\n => Array\n(\n => 103.125.130.147\n)\n\n => Array\n(\n => 27.6.5.52\n)\n\n => Array\n(\n => 103.98.188.26\n)\n\n => Array\n(\n => 39.35.121.81\n)\n\n => Array\n(\n => 74.119.146.182\n)\n\n => Array\n(\n => 5.181.233.162\n)\n\n => Array\n(\n => 157.39.18.60\n)\n\n => Array\n(\n => 1.187.252.25\n)\n\n => Array\n(\n => 39.42.145.59\n)\n\n => Array\n(\n => 39.35.39.198\n)\n\n => Array\n(\n => 49.36.128.214\n)\n\n => Array\n(\n => 182.190.20.56\n)\n\n => Array\n(\n => 122.180.249.189\n)\n\n => Array\n(\n => 117.217.203.107\n)\n\n => Array\n(\n => 103.70.82.241\n)\n\n => Array\n(\n => 45.118.166.68\n)\n\n => Array\n(\n => 122.180.168.39\n)\n\n => Array\n(\n => 149.28.67.254\n)\n\n => Array\n(\n => 223.233.73.8\n)\n\n => Array\n(\n => 122.167.140.0\n)\n\n => Array\n(\n => 95.158.51.55\n)\n\n => Array\n(\n => 27.96.95.134\n)\n\n => Array\n(\n => 49.206.214.53\n)\n\n => Array\n(\n => 212.103.49.92\n)\n\n => Array\n(\n => 122.177.115.101\n)\n\n => Array\n(\n => 171.50.187.124\n)\n\n => Array\n(\n => 122.164.55.107\n)\n\n => Array\n(\n => 98.114.217.204\n)\n\n => Array\n(\n => 106.215.10.54\n)\n\n => Array\n(\n => 115.42.68.28\n)\n\n => Array\n(\n => 104.194.220.87\n)\n\n => Array\n(\n => 103.137.84.170\n)\n\n => Array\n(\n => 61.16.142.110\n)\n\n => Array\n(\n => 212.103.49.85\n)\n\n => Array\n(\n => 39.53.248.162\n)\n\n => Array\n(\n => 203.122.40.214\n)\n\n => Array\n(\n => 117.217.198.72\n)\n\n => Array\n(\n => 115.186.191.203\n)\n\n => Array\n(\n => 120.29.100.199\n)\n\n => Array\n(\n => 45.151.237.24\n)\n\n => Array\n(\n => 223.190.125.232\n)\n\n => Array\n(\n => 41.80.151.17\n)\n\n => Array\n(\n => 23.111.188.5\n)\n\n => Array\n(\n => 223.190.125.216\n)\n\n => Array\n(\n => 103.217.133.119\n)\n\n => Array\n(\n => 103.198.173.132\n)\n\n => Array\n(\n => 47.31.155.89\n)\n\n => Array\n(\n => 223.190.20.253\n)\n\n => Array\n(\n => 104.131.92.125\n)\n\n => Array\n(\n => 223.190.19.152\n)\n\n => Array\n(\n => 103.245.193.191\n)\n\n => Array\n(\n => 106.215.58.255\n)\n\n => Array\n(\n => 119.82.83.238\n)\n\n => Array\n(\n => 106.212.128.138\n)\n\n => Array\n(\n => 139.167.237.36\n)\n\n => Array\n(\n => 222.124.40.250\n)\n\n => Array\n(\n => 134.56.185.169\n)\n\n => Array\n(\n => 54.255.226.31\n)\n\n => Array\n(\n => 137.97.162.31\n)\n\n => Array\n(\n => 95.185.21.191\n)\n\n => Array\n(\n => 171.61.168.151\n)\n\n => Array\n(\n => 137.97.184.4\n)\n\n => Array\n(\n => 106.203.151.202\n)\n\n => Array\n(\n => 39.37.137.0\n)\n\n => Array\n(\n => 45.118.166.66\n)\n\n => Array\n(\n => 14.248.105.100\n)\n\n => Array\n(\n => 106.215.61.185\n)\n\n => Array\n(\n => 202.83.57.179\n)\n\n => Array\n(\n => 89.187.182.176\n)\n\n => Array\n(\n => 49.249.232.198\n)\n\n => Array\n(\n => 132.154.95.236\n)\n\n => Array\n(\n => 223.233.83.230\n)\n\n => Array\n(\n => 183.83.153.14\n)\n\n => Array\n(\n => 125.63.72.210\n)\n\n => Array\n(\n => 207.174.202.11\n)\n\n => Array\n(\n => 119.95.88.59\n)\n\n => Array\n(\n => 122.170.14.150\n)\n\n => Array\n(\n => 45.118.166.75\n)\n\n => Array\n(\n => 103.12.135.37\n)\n\n => Array\n(\n => 49.207.120.225\n)\n\n => Array\n(\n => 182.64.195.207\n)\n\n => Array\n(\n => 103.99.37.16\n)\n\n => Array\n(\n => 46.150.104.221\n)\n\n => Array\n(\n => 104.236.195.147\n)\n\n => Array\n(\n => 103.104.192.43\n)\n\n => Array\n(\n => 24.242.159.118\n)\n\n => Array\n(\n => 39.42.179.143\n)\n\n => Array\n(\n => 111.93.58.131\n)\n\n => Array\n(\n => 193.176.84.127\n)\n\n => Array\n(\n => 209.58.142.218\n)\n\n => Array\n(\n => 69.243.152.129\n)\n\n => Array\n(\n => 117.97.131.249\n)\n\n => Array\n(\n => 103.230.180.89\n)\n\n => Array\n(\n => 106.212.170.192\n)\n\n => Array\n(\n => 171.224.180.95\n)\n\n => Array\n(\n => 158.222.11.87\n)\n\n => Array\n(\n => 119.155.60.246\n)\n\n => Array\n(\n => 41.90.43.129\n)\n\n => Array\n(\n => 185.183.104.170\n)\n\n => Array\n(\n => 14.248.67.65\n)\n\n => Array\n(\n => 117.217.205.82\n)\n\n => Array\n(\n => 111.88.7.209\n)\n\n => Array\n(\n => 49.36.132.244\n)\n\n => Array\n(\n => 171.48.40.2\n)\n\n => Array\n(\n => 119.81.105.2\n)\n\n => Array\n(\n => 49.36.128.114\n)\n\n => Array\n(\n => 213.200.31.93\n)\n\n => Array\n(\n => 2.50.15.110\n)\n\n => Array\n(\n => 120.29.104.67\n)\n\n => Array\n(\n => 223.225.32.221\n)\n\n => Array\n(\n => 14.248.67.195\n)\n\n => Array\n(\n => 119.155.36.13\n)\n\n => Array\n(\n => 101.50.95.104\n)\n\n => Array\n(\n => 104.236.205.233\n)\n\n => Array\n(\n => 122.164.36.150\n)\n\n => Array\n(\n => 157.45.93.209\n)\n\n => Array\n(\n => 182.77.118.100\n)\n\n => Array\n(\n => 182.74.134.218\n)\n\n => Array\n(\n => 183.82.128.146\n)\n\n => Array\n(\n => 112.196.170.234\n)\n\n => Array\n(\n => 122.173.230.178\n)\n\n => Array\n(\n => 122.164.71.199\n)\n\n => Array\n(\n => 51.79.19.31\n)\n\n => Array\n(\n => 58.65.222.20\n)\n\n => Array\n(\n => 103.27.203.97\n)\n\n => Array\n(\n => 111.88.7.242\n)\n\n => Array\n(\n => 14.171.232.77\n)\n\n => Array\n(\n => 46.101.22.182\n)\n\n => Array\n(\n => 103.94.219.19\n)\n\n => Array\n(\n => 139.190.83.30\n)\n\n => Array\n(\n => 223.190.27.184\n)\n\n => Array\n(\n => 182.185.183.34\n)\n\n => Array\n(\n => 91.74.181.242\n)\n\n => Array\n(\n => 222.252.107.14\n)\n\n => Array\n(\n => 137.97.8.28\n)\n\n => Array\n(\n => 46.101.16.229\n)\n\n => Array\n(\n => 122.53.254.229\n)\n\n => Array\n(\n => 106.201.17.180\n)\n\n => Array\n(\n => 123.24.170.129\n)\n\n => Array\n(\n => 182.185.180.79\n)\n\n => Array\n(\n => 223.190.17.4\n)\n\n => Array\n(\n => 213.108.105.1\n)\n\n => Array\n(\n => 171.22.76.9\n)\n\n => Array\n(\n => 202.66.178.164\n)\n\n => Array\n(\n => 178.62.97.171\n)\n\n => Array\n(\n => 167.179.110.209\n)\n\n => Array\n(\n => 223.230.147.172\n)\n\n => Array\n(\n => 76.218.195.160\n)\n\n => Array\n(\n => 14.189.186.178\n)\n\n => Array\n(\n => 157.41.45.143\n)\n\n => Array\n(\n => 223.238.22.53\n)\n\n => Array\n(\n => 111.88.7.244\n)\n\n => Array\n(\n => 5.62.57.19\n)\n\n => Array\n(\n => 106.201.25.216\n)\n\n => Array\n(\n => 117.217.205.33\n)\n\n => Array\n(\n => 111.88.7.215\n)\n\n => Array\n(\n => 106.201.13.77\n)\n\n => Array\n(\n => 50.7.93.29\n)\n\n => Array\n(\n => 123.201.70.112\n)\n\n => Array\n(\n => 39.42.108.226\n)\n\n => Array\n(\n => 27.5.198.29\n)\n\n => Array\n(\n => 223.238.85.187\n)\n\n => Array\n(\n => 171.49.176.32\n)\n\n => Array\n(\n => 14.248.79.242\n)\n\n => Array\n(\n => 46.219.211.183\n)\n\n => Array\n(\n => 185.244.212.251\n)\n\n => Array\n(\n => 14.102.84.126\n)\n\n => Array\n(\n => 106.212.191.52\n)\n\n => Array\n(\n => 154.72.153.203\n)\n\n => Array\n(\n => 14.175.82.64\n)\n\n => Array\n(\n => 141.105.139.131\n)\n\n => Array\n(\n => 182.156.103.98\n)\n\n => Array\n(\n => 117.217.204.75\n)\n\n => Array\n(\n => 104.140.83.115\n)\n\n => Array\n(\n => 119.152.62.8\n)\n\n => Array\n(\n => 45.125.247.94\n)\n\n => Array\n(\n => 137.97.37.252\n)\n\n => Array\n(\n => 117.217.204.73\n)\n\n => Array\n(\n => 14.248.79.133\n)\n\n => Array\n(\n => 39.37.152.52\n)\n\n => Array\n(\n => 103.55.60.54\n)\n\n => Array\n(\n => 102.166.183.88\n)\n\n => Array\n(\n => 5.62.60.162\n)\n\n => Array\n(\n => 5.62.60.163\n)\n\n => Array\n(\n => 160.202.38.131\n)\n\n => Array\n(\n => 106.215.20.253\n)\n\n => Array\n(\n => 39.37.160.54\n)\n\n => Array\n(\n => 119.152.59.186\n)\n\n => Array\n(\n => 183.82.0.164\n)\n\n => Array\n(\n => 41.90.54.87\n)\n\n => Array\n(\n => 157.36.85.158\n)\n\n => Array\n(\n => 110.37.229.162\n)\n\n => Array\n(\n => 203.99.180.148\n)\n\n => Array\n(\n => 117.97.132.91\n)\n\n => Array\n(\n => 171.61.147.105\n)\n\n => Array\n(\n => 14.98.147.214\n)\n\n => Array\n(\n => 209.234.253.191\n)\n\n => Array\n(\n => 92.38.148.60\n)\n\n => Array\n(\n => 178.128.104.139\n)\n\n => Array\n(\n => 212.154.0.176\n)\n\n => Array\n(\n => 103.41.24.141\n)\n\n => Array\n(\n => 2.58.194.132\n)\n\n => Array\n(\n => 180.190.78.169\n)\n\n => Array\n(\n => 106.215.45.182\n)\n\n => Array\n(\n => 125.63.100.222\n)\n\n => Array\n(\n => 110.54.247.17\n)\n\n => Array\n(\n => 103.26.85.105\n)\n\n => Array\n(\n => 39.42.147.3\n)\n\n => Array\n(\n => 137.97.51.41\n)\n\n => Array\n(\n => 71.202.72.27\n)\n\n => Array\n(\n => 119.155.35.10\n)\n\n => Array\n(\n => 202.47.43.120\n)\n\n => Array\n(\n => 183.83.64.101\n)\n\n => Array\n(\n => 182.68.106.141\n)\n\n => Array\n(\n => 171.61.187.87\n)\n\n => Array\n(\n => 178.162.198.118\n)\n\n => Array\n(\n => 115.97.151.218\n)\n\n => Array\n(\n => 196.207.184.210\n)\n\n => Array\n(\n => 198.16.70.51\n)\n\n => Array\n(\n => 41.60.237.33\n)\n\n => Array\n(\n => 47.11.86.26\n)\n\n => Array\n(\n => 117.217.201.183\n)\n\n => Array\n(\n => 203.192.241.79\n)\n\n => Array\n(\n => 122.165.119.85\n)\n\n => Array\n(\n => 23.227.142.218\n)\n\n => Array\n(\n => 178.128.104.221\n)\n\n => Array\n(\n => 14.192.54.163\n)\n\n => Array\n(\n => 139.5.253.218\n)\n\n => Array\n(\n => 117.230.140.127\n)\n\n => Array\n(\n => 195.114.149.199\n)\n\n => Array\n(\n => 14.239.180.220\n)\n\n => Array\n(\n => 103.62.155.94\n)\n\n => Array\n(\n => 118.71.97.14\n)\n\n => Array\n(\n => 137.97.55.163\n)\n\n => Array\n(\n => 202.47.49.198\n)\n\n => Array\n(\n => 171.61.177.85\n)\n\n => Array\n(\n => 137.97.190.224\n)\n\n => Array\n(\n => 117.230.34.142\n)\n\n => Array\n(\n => 103.41.32.5\n)\n\n => Array\n(\n => 203.90.82.237\n)\n\n => Array\n(\n => 125.63.124.238\n)\n\n => Array\n(\n => 103.232.128.78\n)\n\n => Array\n(\n => 106.197.14.227\n)\n\n => Array\n(\n => 81.17.242.244\n)\n\n => Array\n(\n => 81.19.210.179\n)\n\n => Array\n(\n => 103.134.94.98\n)\n\n => Array\n(\n => 110.38.0.86\n)\n\n => Array\n(\n => 103.10.224.195\n)\n\n => Array\n(\n => 45.118.166.89\n)\n\n => Array\n(\n => 115.186.186.68\n)\n\n => Array\n(\n => 138.197.129.237\n)\n\n => Array\n(\n => 14.247.162.52\n)\n\n => Array\n(\n => 103.255.4.5\n)\n\n => Array\n(\n => 14.167.188.254\n)\n\n => Array\n(\n => 5.62.59.54\n)\n\n => Array\n(\n => 27.122.14.80\n)\n\n => Array\n(\n => 39.53.240.21\n)\n\n => Array\n(\n => 39.53.241.243\n)\n\n => Array\n(\n => 117.230.130.161\n)\n\n => Array\n(\n => 118.71.191.149\n)\n\n => Array\n(\n => 5.188.95.54\n)\n\n => Array\n(\n => 66.45.250.27\n)\n\n => Array\n(\n => 106.215.6.175\n)\n\n => Array\n(\n => 27.122.14.86\n)\n\n => Array\n(\n => 103.255.4.51\n)\n\n => Array\n(\n => 101.50.93.119\n)\n\n => Array\n(\n => 137.97.183.51\n)\n\n => Array\n(\n => 117.217.204.185\n)\n\n => Array\n(\n => 95.104.106.82\n)\n\n => Array\n(\n => 5.62.56.211\n)\n\n => Array\n(\n => 103.104.181.214\n)\n\n => Array\n(\n => 36.72.214.243\n)\n\n => Array\n(\n => 5.62.62.219\n)\n\n => Array\n(\n => 110.36.202.4\n)\n\n => Array\n(\n => 103.255.4.253\n)\n\n => Array\n(\n => 110.172.138.61\n)\n\n => Array\n(\n => 159.203.24.195\n)\n\n => Array\n(\n => 13.229.88.42\n)\n\n => Array\n(\n => 59.153.235.20\n)\n\n => Array\n(\n => 171.236.169.32\n)\n\n => Array\n(\n => 14.231.85.206\n)\n\n => Array\n(\n => 119.152.54.103\n)\n\n => Array\n(\n => 103.80.117.202\n)\n\n => Array\n(\n => 223.179.157.75\n)\n\n => Array\n(\n => 122.173.68.249\n)\n\n => Array\n(\n => 188.163.72.113\n)\n\n => Array\n(\n => 119.155.20.164\n)\n\n => Array\n(\n => 103.121.43.68\n)\n\n => Array\n(\n => 5.62.58.6\n)\n\n => Array\n(\n => 203.122.40.154\n)\n\n => Array\n(\n => 222.254.96.203\n)\n\n => Array\n(\n => 103.83.148.167\n)\n\n => Array\n(\n => 103.87.251.226\n)\n\n => Array\n(\n => 123.24.129.24\n)\n\n => Array\n(\n => 137.97.83.8\n)\n\n => Array\n(\n => 223.225.33.132\n)\n\n => Array\n(\n => 128.76.175.190\n)\n\n => Array\n(\n => 195.85.219.32\n)\n\n => Array\n(\n => 139.167.102.93\n)\n\n => Array\n(\n => 49.15.198.253\n)\n\n => Array\n(\n => 45.152.183.172\n)\n\n => Array\n(\n => 42.106.180.136\n)\n\n => Array\n(\n => 95.142.120.9\n)\n\n => Array\n(\n => 139.167.236.4\n)\n\n => Array\n(\n => 159.65.72.167\n)\n\n => Array\n(\n => 49.15.89.2\n)\n\n => Array\n(\n => 42.201.161.195\n)\n\n => Array\n(\n => 27.97.210.38\n)\n\n => Array\n(\n => 171.241.45.19\n)\n\n => Array\n(\n => 42.108.2.18\n)\n\n => Array\n(\n => 171.236.40.68\n)\n\n => Array\n(\n => 110.93.82.102\n)\n\n => Array\n(\n => 43.225.24.186\n)\n\n => Array\n(\n => 117.230.189.119\n)\n\n => Array\n(\n => 124.123.147.187\n)\n\n => Array\n(\n => 216.151.184.250\n)\n\n => Array\n(\n => 49.15.133.16\n)\n\n => Array\n(\n => 49.15.220.74\n)\n\n => Array\n(\n => 157.37.221.246\n)\n\n => Array\n(\n => 176.124.233.112\n)\n\n => Array\n(\n => 118.71.167.40\n)\n\n => Array\n(\n => 182.185.213.161\n)\n\n => Array\n(\n => 47.31.79.248\n)\n\n => Array\n(\n => 223.179.238.192\n)\n\n => Array\n(\n => 79.110.128.219\n)\n\n => Array\n(\n => 106.210.42.111\n)\n\n => Array\n(\n => 47.247.214.229\n)\n\n => Array\n(\n => 193.0.220.108\n)\n\n => Array\n(\n => 1.39.206.254\n)\n\n => Array\n(\n => 123.201.77.38\n)\n\n => Array\n(\n => 115.178.207.21\n)\n\n => Array\n(\n => 37.111.202.92\n)\n\n => Array\n(\n => 49.14.179.243\n)\n\n => Array\n(\n => 117.230.145.171\n)\n\n => Array\n(\n => 171.229.242.96\n)\n\n => Array\n(\n => 27.59.174.209\n)\n\n => Array\n(\n => 1.38.202.211\n)\n\n => Array\n(\n => 157.37.128.46\n)\n\n => Array\n(\n => 49.15.94.80\n)\n\n => Array\n(\n => 123.25.46.147\n)\n\n => Array\n(\n => 117.230.170.185\n)\n\n => Array\n(\n => 5.62.16.19\n)\n\n => Array\n(\n => 103.18.22.25\n)\n\n => Array\n(\n => 103.46.200.132\n)\n\n => Array\n(\n => 27.97.165.126\n)\n\n => Array\n(\n => 117.230.54.241\n)\n\n => Array\n(\n => 27.97.209.76\n)\n\n => Array\n(\n => 47.31.182.109\n)\n\n => Array\n(\n => 47.30.223.221\n)\n\n => Array\n(\n => 103.31.94.82\n)\n\n => Array\n(\n => 103.211.14.45\n)\n\n => Array\n(\n => 171.49.233.58\n)\n\n => Array\n(\n => 65.49.126.95\n)\n\n => Array\n(\n => 69.255.101.170\n)\n\n => Array\n(\n => 27.56.224.67\n)\n\n => Array\n(\n => 117.230.146.86\n)\n\n => Array\n(\n => 27.59.154.52\n)\n\n => Array\n(\n => 132.154.114.10\n)\n\n => Array\n(\n => 182.186.77.60\n)\n\n => Array\n(\n => 117.230.136.74\n)\n\n => Array\n(\n => 43.251.94.253\n)\n\n => Array\n(\n => 103.79.168.225\n)\n\n => Array\n(\n => 117.230.56.51\n)\n\n => Array\n(\n => 27.97.187.45\n)\n\n => Array\n(\n => 137.97.190.61\n)\n\n => Array\n(\n => 193.0.220.26\n)\n\n => Array\n(\n => 49.36.137.62\n)\n\n => Array\n(\n => 47.30.189.248\n)\n\n => Array\n(\n => 109.169.23.84\n)\n\n => Array\n(\n => 111.119.185.46\n)\n\n => Array\n(\n => 103.83.148.246\n)\n\n => Array\n(\n => 157.32.119.138\n)\n\n => Array\n(\n => 5.62.41.53\n)\n\n => Array\n(\n => 47.8.243.236\n)\n\n => Array\n(\n => 112.79.158.69\n)\n\n => Array\n(\n => 180.92.148.218\n)\n\n => Array\n(\n => 157.36.162.154\n)\n\n => Array\n(\n => 39.46.114.47\n)\n\n => Array\n(\n => 117.230.173.250\n)\n\n => Array\n(\n => 117.230.155.188\n)\n\n => Array\n(\n => 193.0.220.17\n)\n\n => Array\n(\n => 117.230.171.166\n)\n\n => Array\n(\n => 49.34.59.228\n)\n\n => Array\n(\n => 111.88.197.247\n)\n\n => Array\n(\n => 47.31.156.112\n)\n\n => Array\n(\n => 137.97.64.180\n)\n\n => Array\n(\n => 14.244.227.18\n)\n\n => Array\n(\n => 113.167.158.8\n)\n\n => Array\n(\n => 39.37.175.189\n)\n\n => Array\n(\n => 139.167.211.8\n)\n\n => Array\n(\n => 73.120.85.235\n)\n\n => Array\n(\n => 104.236.195.72\n)\n\n => Array\n(\n => 27.97.190.71\n)\n\n => Array\n(\n => 79.46.170.222\n)\n\n => Array\n(\n => 102.185.244.207\n)\n\n => Array\n(\n => 37.111.136.30\n)\n\n => Array\n(\n => 50.7.93.28\n)\n\n => Array\n(\n => 110.54.251.43\n)\n\n => Array\n(\n => 49.36.143.40\n)\n\n => Array\n(\n => 103.130.112.185\n)\n\n => Array\n(\n => 37.111.139.202\n)\n\n => Array\n(\n => 49.36.139.108\n)\n\n => Array\n(\n => 37.111.136.179\n)\n\n => Array\n(\n => 123.17.165.77\n)\n\n => Array\n(\n => 49.207.143.206\n)\n\n => Array\n(\n => 39.53.80.149\n)\n\n => Array\n(\n => 223.188.71.214\n)\n\n => Array\n(\n => 1.39.222.233\n)\n\n => Array\n(\n => 117.230.9.85\n)\n\n => Array\n(\n => 103.251.245.216\n)\n\n => Array\n(\n => 122.169.133.145\n)\n\n => Array\n(\n => 43.250.165.57\n)\n\n => Array\n(\n => 39.44.13.235\n)\n\n => Array\n(\n => 157.47.181.2\n)\n\n => Array\n(\n => 27.56.203.50\n)\n\n => Array\n(\n => 191.96.97.58\n)\n\n => Array\n(\n => 111.88.107.172\n)\n\n => Array\n(\n => 113.193.198.136\n)\n\n => Array\n(\n => 117.230.172.175\n)\n\n => Array\n(\n => 191.96.182.239\n)\n\n => Array\n(\n => 2.58.46.28\n)\n\n => Array\n(\n => 183.83.253.87\n)\n\n => Array\n(\n => 49.15.139.242\n)\n\n => Array\n(\n => 42.107.220.236\n)\n\n => Array\n(\n => 14.192.53.196\n)\n\n => Array\n(\n => 42.119.212.202\n)\n\n => Array\n(\n => 192.158.234.45\n)\n\n => Array\n(\n => 49.149.102.192\n)\n\n => Array\n(\n => 47.8.170.17\n)\n\n => Array\n(\n => 117.197.13.247\n)\n\n => Array\n(\n => 116.74.34.44\n)\n\n => Array\n(\n => 103.79.249.163\n)\n\n => Array\n(\n => 182.189.95.70\n)\n\n => Array\n(\n => 137.59.218.118\n)\n\n => Array\n(\n => 103.79.170.243\n)\n\n => Array\n(\n => 39.40.54.25\n)\n\n => Array\n(\n => 119.155.40.170\n)\n\n => Array\n(\n => 1.39.212.157\n)\n\n => Array\n(\n => 70.127.59.89\n)\n\n => Array\n(\n => 14.171.22.58\n)\n\n => Array\n(\n => 194.44.167.141\n)\n\n => Array\n(\n => 111.88.179.154\n)\n\n => Array\n(\n => 117.230.140.232\n)\n\n => Array\n(\n => 137.97.96.128\n)\n\n => Array\n(\n => 198.16.66.123\n)\n\n => Array\n(\n => 106.198.44.193\n)\n\n => Array\n(\n => 119.153.45.75\n)\n\n => Array\n(\n => 49.15.242.208\n)\n\n => Array\n(\n => 119.155.241.20\n)\n\n => Array\n(\n => 106.223.109.155\n)\n\n => Array\n(\n => 119.160.119.245\n)\n\n => Array\n(\n => 106.215.81.160\n)\n\n => Array\n(\n => 1.39.192.211\n)\n\n => Array\n(\n => 223.230.35.208\n)\n\n => Array\n(\n => 39.59.4.158\n)\n\n => Array\n(\n => 43.231.57.234\n)\n\n => Array\n(\n => 60.254.78.193\n)\n\n => Array\n(\n => 122.170.224.87\n)\n\n => Array\n(\n => 117.230.22.141\n)\n\n => Array\n(\n => 119.152.107.211\n)\n\n => Array\n(\n => 103.87.192.206\n)\n\n => Array\n(\n => 39.45.244.47\n)\n\n => Array\n(\n => 50.72.141.94\n)\n\n => Array\n(\n => 39.40.6.128\n)\n\n => Array\n(\n => 39.45.180.186\n)\n\n => Array\n(\n => 49.207.131.233\n)\n\n => Array\n(\n => 139.59.69.142\n)\n\n => Array\n(\n => 111.119.187.29\n)\n\n => Array\n(\n => 119.153.40.69\n)\n\n => Array\n(\n => 49.36.133.64\n)\n\n => Array\n(\n => 103.255.4.249\n)\n\n => Array\n(\n => 198.144.154.15\n)\n\n => Array\n(\n => 1.22.46.172\n)\n\n => Array\n(\n => 103.255.5.46\n)\n\n => Array\n(\n => 27.56.195.188\n)\n\n => Array\n(\n => 203.101.167.53\n)\n\n => Array\n(\n => 117.230.62.195\n)\n\n => Array\n(\n => 103.240.194.186\n)\n\n => Array\n(\n => 107.170.166.118\n)\n\n => Array\n(\n => 101.53.245.80\n)\n\n => Array\n(\n => 157.43.13.208\n)\n\n => Array\n(\n => 137.97.100.77\n)\n\n => Array\n(\n => 47.31.150.208\n)\n\n => Array\n(\n => 137.59.222.65\n)\n\n => Array\n(\n => 103.85.127.250\n)\n\n => Array\n(\n => 103.214.119.32\n)\n\n => Array\n(\n => 182.255.49.52\n)\n\n => Array\n(\n => 103.75.247.72\n)\n\n => Array\n(\n => 103.85.125.250\n)\n\n => Array\n(\n => 183.83.253.167\n)\n\n => Array\n(\n => 1.39.222.111\n)\n\n => Array\n(\n => 111.119.185.9\n)\n\n => Array\n(\n => 111.119.187.10\n)\n\n => Array\n(\n => 39.37.147.144\n)\n\n => Array\n(\n => 103.200.198.183\n)\n\n => Array\n(\n => 1.39.222.18\n)\n\n => Array\n(\n => 198.8.80.103\n)\n\n => Array\n(\n => 42.108.1.243\n)\n\n => Array\n(\n => 111.119.187.16\n)\n\n => Array\n(\n => 39.40.241.8\n)\n\n => Array\n(\n => 122.169.150.158\n)\n\n => Array\n(\n => 39.40.215.119\n)\n\n => Array\n(\n => 103.255.5.77\n)\n\n => Array\n(\n => 157.38.108.196\n)\n\n => Array\n(\n => 103.255.4.67\n)\n\n => Array\n(\n => 5.62.60.62\n)\n\n => Array\n(\n => 39.37.146.202\n)\n\n => Array\n(\n => 110.138.6.221\n)\n\n => Array\n(\n => 49.36.143.88\n)\n\n => Array\n(\n => 37.1.215.39\n)\n\n => Array\n(\n => 27.106.59.190\n)\n\n => Array\n(\n => 139.167.139.41\n)\n\n => Array\n(\n => 114.142.166.179\n)\n\n => Array\n(\n => 223.225.240.112\n)\n\n => Array\n(\n => 103.255.5.36\n)\n\n => Array\n(\n => 175.136.1.48\n)\n\n => Array\n(\n => 103.82.80.166\n)\n\n => Array\n(\n => 182.185.196.126\n)\n\n => Array\n(\n => 157.43.45.76\n)\n\n => Array\n(\n => 119.152.132.49\n)\n\n => Array\n(\n => 5.62.62.162\n)\n\n => Array\n(\n => 103.255.4.39\n)\n\n => Array\n(\n => 202.5.144.153\n)\n\n => Array\n(\n => 1.39.223.210\n)\n\n => Array\n(\n => 92.38.176.154\n)\n\n => Array\n(\n => 117.230.186.142\n)\n\n => Array\n(\n => 183.83.39.123\n)\n\n => Array\n(\n => 182.185.156.76\n)\n\n => Array\n(\n => 104.236.74.212\n)\n\n => Array\n(\n => 107.170.145.187\n)\n\n => Array\n(\n => 117.102.7.98\n)\n\n => Array\n(\n => 137.59.220.0\n)\n\n => Array\n(\n => 157.47.222.14\n)\n\n => Array\n(\n => 47.15.206.82\n)\n\n => Array\n(\n => 117.230.159.99\n)\n\n => Array\n(\n => 117.230.175.151\n)\n\n => Array\n(\n => 157.50.97.18\n)\n\n => Array\n(\n => 117.230.47.164\n)\n\n => Array\n(\n => 77.111.244.34\n)\n\n => Array\n(\n => 139.167.189.131\n)\n\n => Array\n(\n => 1.39.204.103\n)\n\n => Array\n(\n => 117.230.58.0\n)\n\n => Array\n(\n => 182.185.226.66\n)\n\n => Array\n(\n => 115.42.70.119\n)\n\n => Array\n(\n => 171.48.114.134\n)\n\n => Array\n(\n => 144.34.218.75\n)\n\n => Array\n(\n => 199.58.164.135\n)\n\n => Array\n(\n => 101.53.228.151\n)\n\n => Array\n(\n => 117.230.50.57\n)\n\n => Array\n(\n => 223.225.138.84\n)\n\n => Array\n(\n => 110.225.67.65\n)\n\n => Array\n(\n => 47.15.200.39\n)\n\n => Array\n(\n => 39.42.20.127\n)\n\n => Array\n(\n => 117.97.241.81\n)\n\n => Array\n(\n => 111.119.185.11\n)\n\n => Array\n(\n => 103.100.5.94\n)\n\n => Array\n(\n => 103.25.137.69\n)\n\n => Array\n(\n => 47.15.197.159\n)\n\n => Array\n(\n => 223.188.176.122\n)\n\n => Array\n(\n => 27.4.175.80\n)\n\n => Array\n(\n => 181.215.43.82\n)\n\n => Array\n(\n => 27.56.228.157\n)\n\n => Array\n(\n => 117.230.19.19\n)\n\n => Array\n(\n => 47.15.208.71\n)\n\n => Array\n(\n => 119.155.21.176\n)\n\n => Array\n(\n => 47.15.234.202\n)\n\n => Array\n(\n => 117.230.144.135\n)\n\n => Array\n(\n => 112.79.139.199\n)\n\n => Array\n(\n => 116.75.246.41\n)\n\n => Array\n(\n => 117.230.177.126\n)\n\n => Array\n(\n => 212.103.48.134\n)\n\n => Array\n(\n => 102.69.228.78\n)\n\n => Array\n(\n => 117.230.37.118\n)\n\n => Array\n(\n => 175.143.61.75\n)\n\n => Array\n(\n => 139.167.56.138\n)\n\n => Array\n(\n => 58.145.189.250\n)\n\n => Array\n(\n => 103.255.5.65\n)\n\n => Array\n(\n => 39.37.153.182\n)\n\n => Array\n(\n => 157.43.85.106\n)\n\n => Array\n(\n => 185.209.178.77\n)\n\n => Array\n(\n => 1.39.212.45\n)\n\n => Array\n(\n => 103.72.7.16\n)\n\n => Array\n(\n => 117.97.185.244\n)\n\n => Array\n(\n => 117.230.59.106\n)\n\n => Array\n(\n => 137.97.121.103\n)\n\n => Array\n(\n => 103.82.123.215\n)\n\n => Array\n(\n => 103.68.217.248\n)\n\n => Array\n(\n => 157.39.27.175\n)\n\n => Array\n(\n => 47.31.100.249\n)\n\n => Array\n(\n => 14.171.232.139\n)\n\n => Array\n(\n => 103.31.93.208\n)\n\n => Array\n(\n => 117.230.56.77\n)\n\n => Array\n(\n => 124.182.25.124\n)\n\n => Array\n(\n => 106.66.191.242\n)\n\n => Array\n(\n => 175.107.237.25\n)\n\n => Array\n(\n => 119.155.1.27\n)\n\n => Array\n(\n => 72.255.6.24\n)\n\n => Array\n(\n => 192.140.152.223\n)\n\n => Array\n(\n => 212.103.48.136\n)\n\n => Array\n(\n => 39.45.134.56\n)\n\n => Array\n(\n => 139.167.173.30\n)\n\n => Array\n(\n => 117.230.63.87\n)\n\n => Array\n(\n => 182.189.95.203\n)\n\n => Array\n(\n => 49.204.183.248\n)\n\n => Array\n(\n => 47.31.125.188\n)\n\n => Array\n(\n => 103.252.171.13\n)\n\n => Array\n(\n => 112.198.74.36\n)\n\n => Array\n(\n => 27.109.113.152\n)\n\n => Array\n(\n => 42.112.233.44\n)\n\n => Array\n(\n => 47.31.68.193\n)\n\n => Array\n(\n => 103.252.171.134\n)\n\n => Array\n(\n => 77.123.32.114\n)\n\n => Array\n(\n => 1.38.189.66\n)\n\n => Array\n(\n => 39.37.181.108\n)\n\n => Array\n(\n => 42.106.44.61\n)\n\n => Array\n(\n => 157.36.8.39\n)\n\n => Array\n(\n => 223.238.41.53\n)\n\n => Array\n(\n => 202.89.77.10\n)\n\n => Array\n(\n => 117.230.150.68\n)\n\n => Array\n(\n => 175.176.87.60\n)\n\n => Array\n(\n => 137.97.117.87\n)\n\n => Array\n(\n => 132.154.123.11\n)\n\n => Array\n(\n => 45.113.124.141\n)\n\n => Array\n(\n => 103.87.56.203\n)\n\n => Array\n(\n => 159.89.171.156\n)\n\n => Array\n(\n => 119.155.53.88\n)\n\n => Array\n(\n => 222.252.107.215\n)\n\n => Array\n(\n => 132.154.75.238\n)\n\n => Array\n(\n => 122.183.41.168\n)\n\n => Array\n(\n => 42.106.254.158\n)\n\n => Array\n(\n => 103.252.171.37\n)\n\n => Array\n(\n => 202.59.13.180\n)\n\n => Array\n(\n => 37.111.139.137\n)\n\n => Array\n(\n => 39.42.93.25\n)\n\n => Array\n(\n => 118.70.177.156\n)\n\n => Array\n(\n => 117.230.148.64\n)\n\n => Array\n(\n => 39.42.15.194\n)\n\n => Array\n(\n => 137.97.176.86\n)\n\n => Array\n(\n => 106.210.102.113\n)\n\n => Array\n(\n => 39.59.84.236\n)\n\n => Array\n(\n => 49.206.187.177\n)\n\n => Array\n(\n => 117.230.133.11\n)\n\n => Array\n(\n => 42.106.253.173\n)\n\n => Array\n(\n => 178.62.102.23\n)\n\n => Array\n(\n => 111.92.76.175\n)\n\n => Array\n(\n => 132.154.86.45\n)\n\n => Array\n(\n => 117.230.128.39\n)\n\n => Array\n(\n => 117.230.53.165\n)\n\n => Array\n(\n => 49.37.200.171\n)\n\n => Array\n(\n => 104.236.213.230\n)\n\n => Array\n(\n => 103.140.30.81\n)\n\n => Array\n(\n => 59.103.104.117\n)\n\n => Array\n(\n => 65.49.126.79\n)\n\n => Array\n(\n => 202.59.12.251\n)\n\n => Array\n(\n => 37.111.136.17\n)\n\n => Array\n(\n => 163.53.85.67\n)\n\n => Array\n(\n => 123.16.240.73\n)\n\n => Array\n(\n => 103.211.14.183\n)\n\n => Array\n(\n => 103.248.93.211\n)\n\n => Array\n(\n => 116.74.59.127\n)\n\n => Array\n(\n => 137.97.169.254\n)\n\n => Array\n(\n => 113.177.79.100\n)\n\n => Array\n(\n => 74.82.60.187\n)\n\n => Array\n(\n => 117.230.157.66\n)\n\n => Array\n(\n => 169.149.194.241\n)\n\n => Array\n(\n => 117.230.156.11\n)\n\n => Array\n(\n => 202.59.12.157\n)\n\n => Array\n(\n => 42.106.181.25\n)\n\n => Array\n(\n => 202.59.13.78\n)\n\n => Array\n(\n => 39.37.153.32\n)\n\n => Array\n(\n => 177.188.216.175\n)\n\n => Array\n(\n => 222.252.53.165\n)\n\n => Array\n(\n => 37.139.23.89\n)\n\n => Array\n(\n => 117.230.139.150\n)\n\n => Array\n(\n => 104.131.176.234\n)\n\n => Array\n(\n => 42.106.181.117\n)\n\n => Array\n(\n => 117.230.180.94\n)\n\n => Array\n(\n => 180.190.171.5\n)\n\n => Array\n(\n => 150.129.165.185\n)\n\n => Array\n(\n => 51.15.0.150\n)\n\n => Array\n(\n => 42.111.4.84\n)\n\n => Array\n(\n => 74.82.60.116\n)\n\n => Array\n(\n => 137.97.121.165\n)\n\n => Array\n(\n => 64.62.187.194\n)\n\n => Array\n(\n => 137.97.106.162\n)\n\n => Array\n(\n => 137.97.92.46\n)\n\n => Array\n(\n => 137.97.170.25\n)\n\n => Array\n(\n => 103.104.192.100\n)\n\n => Array\n(\n => 185.246.211.34\n)\n\n => Array\n(\n => 119.160.96.78\n)\n\n => Array\n(\n => 212.103.48.152\n)\n\n => Array\n(\n => 183.83.153.90\n)\n\n => Array\n(\n => 117.248.150.41\n)\n\n => Array\n(\n => 185.240.246.180\n)\n\n => Array\n(\n => 162.253.131.125\n)\n\n => Array\n(\n => 117.230.153.217\n)\n\n => Array\n(\n => 117.230.169.1\n)\n\n => Array\n(\n => 49.15.138.247\n)\n\n => Array\n(\n => 117.230.37.110\n)\n\n => Array\n(\n => 14.167.188.75\n)\n\n => Array\n(\n => 169.149.239.93\n)\n\n => Array\n(\n => 103.216.176.91\n)\n\n => Array\n(\n => 117.230.12.126\n)\n\n => Array\n(\n => 184.75.209.110\n)\n\n => Array\n(\n => 117.230.6.60\n)\n\n => Array\n(\n => 117.230.135.132\n)\n\n => Array\n(\n => 31.179.29.109\n)\n\n => Array\n(\n => 74.121.188.186\n)\n\n => Array\n(\n => 117.230.35.5\n)\n\n => Array\n(\n => 111.92.74.239\n)\n\n => Array\n(\n => 104.245.144.236\n)\n\n => Array\n(\n => 39.50.22.100\n)\n\n => Array\n(\n => 47.31.190.23\n)\n\n => Array\n(\n => 157.44.73.187\n)\n\n => Array\n(\n => 117.230.8.91\n)\n\n => Array\n(\n => 157.32.18.2\n)\n\n => Array\n(\n => 111.119.187.43\n)\n\n => Array\n(\n => 203.101.185.246\n)\n\n => Array\n(\n => 5.62.34.22\n)\n\n => Array\n(\n => 122.8.143.76\n)\n\n => Array\n(\n => 115.186.2.187\n)\n\n => Array\n(\n => 202.142.110.89\n)\n\n => Array\n(\n => 157.50.61.254\n)\n\n => Array\n(\n => 223.182.211.185\n)\n\n => Array\n(\n => 103.85.125.210\n)\n\n => Array\n(\n => 103.217.133.147\n)\n\n => Array\n(\n => 103.60.196.217\n)\n\n => Array\n(\n => 157.44.238.6\n)\n\n => Array\n(\n => 117.196.225.68\n)\n\n => Array\n(\n => 104.254.92.52\n)\n\n => Array\n(\n => 39.42.46.72\n)\n\n => Array\n(\n => 221.132.119.36\n)\n\n => Array\n(\n => 111.92.77.47\n)\n\n => Array\n(\n => 223.225.19.152\n)\n\n => Array\n(\n => 159.89.121.217\n)\n\n => Array\n(\n => 39.53.221.205\n)\n\n => Array\n(\n => 193.34.217.28\n)\n\n => Array\n(\n => 139.167.206.36\n)\n\n => Array\n(\n => 96.40.10.7\n)\n\n => Array\n(\n => 124.29.198.123\n)\n\n => Array\n(\n => 117.196.226.1\n)\n\n => Array\n(\n => 106.200.85.135\n)\n\n => Array\n(\n => 106.223.180.28\n)\n\n => Array\n(\n => 103.49.232.110\n)\n\n => Array\n(\n => 139.167.208.50\n)\n\n => Array\n(\n => 139.167.201.102\n)\n\n => Array\n(\n => 14.244.224.237\n)\n\n => Array\n(\n => 103.140.31.187\n)\n\n => Array\n(\n => 49.36.134.136\n)\n\n => Array\n(\n => 160.16.61.75\n)\n\n => Array\n(\n => 103.18.22.228\n)\n\n => Array\n(\n => 47.9.74.121\n)\n\n => Array\n(\n => 47.30.216.159\n)\n\n => Array\n(\n => 117.248.150.78\n)\n\n => Array\n(\n => 5.62.34.17\n)\n\n => Array\n(\n => 139.167.247.181\n)\n\n => Array\n(\n => 193.176.84.29\n)\n\n => Array\n(\n => 103.195.201.121\n)\n\n => Array\n(\n => 89.187.175.115\n)\n\n => Array\n(\n => 137.97.81.251\n)\n\n => Array\n(\n => 157.51.147.62\n)\n\n => Array\n(\n => 103.104.192.42\n)\n\n => Array\n(\n => 14.171.235.26\n)\n\n => Array\n(\n => 178.62.89.121\n)\n\n => Array\n(\n => 119.155.4.164\n)\n\n => Array\n(\n => 43.250.241.89\n)\n\n => Array\n(\n => 103.31.100.80\n)\n\n => Array\n(\n => 119.155.7.44\n)\n\n => Array\n(\n => 106.200.73.114\n)\n\n => Array\n(\n => 77.111.246.18\n)\n\n => Array\n(\n => 157.39.99.247\n)\n\n => Array\n(\n => 103.77.42.132\n)\n\n => Array\n(\n => 74.115.214.133\n)\n\n => Array\n(\n => 117.230.49.224\n)\n\n => Array\n(\n => 39.50.108.238\n)\n\n => Array\n(\n => 47.30.221.45\n)\n\n => Array\n(\n => 95.133.164.235\n)\n\n => Array\n(\n => 212.103.48.141\n)\n\n => Array\n(\n => 104.194.218.147\n)\n\n => Array\n(\n => 106.200.88.241\n)\n\n => Array\n(\n => 182.189.212.211\n)\n\n => Array\n(\n => 39.50.142.129\n)\n\n => Array\n(\n => 77.234.43.133\n)\n\n => Array\n(\n => 49.15.192.58\n)\n\n => Array\n(\n => 119.153.37.55\n)\n\n => Array\n(\n => 27.56.156.128\n)\n\n => Array\n(\n => 168.211.4.33\n)\n\n => Array\n(\n => 203.81.236.239\n)\n\n => Array\n(\n => 157.51.149.61\n)\n\n => Array\n(\n => 117.230.45.255\n)\n\n => Array\n(\n => 39.42.106.169\n)\n\n => Array\n(\n => 27.71.89.76\n)\n\n => Array\n(\n => 123.27.109.167\n)\n\n => Array\n(\n => 106.202.21.91\n)\n\n => Array\n(\n => 103.85.125.206\n)\n\n => Array\n(\n => 122.173.250.229\n)\n\n => Array\n(\n => 106.210.102.77\n)\n\n => Array\n(\n => 134.209.47.156\n)\n\n => Array\n(\n => 45.127.232.12\n)\n\n => Array\n(\n => 45.134.224.11\n)\n\n => Array\n(\n => 27.71.89.122\n)\n\n => Array\n(\n => 157.38.105.117\n)\n\n => Array\n(\n => 191.96.73.215\n)\n\n => Array\n(\n => 171.241.92.31\n)\n\n => Array\n(\n => 49.149.104.235\n)\n\n => Array\n(\n => 104.229.247.252\n)\n\n => Array\n(\n => 111.92.78.42\n)\n\n => Array\n(\n => 47.31.88.183\n)\n\n => Array\n(\n => 171.61.203.234\n)\n\n => Array\n(\n => 183.83.226.192\n)\n\n => Array\n(\n => 119.157.107.45\n)\n\n => Array\n(\n => 91.202.163.205\n)\n\n => Array\n(\n => 157.43.62.108\n)\n\n => Array\n(\n => 182.68.248.92\n)\n\n => Array\n(\n => 157.32.251.234\n)\n\n => Array\n(\n => 110.225.196.188\n)\n\n => Array\n(\n => 27.71.89.98\n)\n\n => Array\n(\n => 175.176.87.3\n)\n\n => Array\n(\n => 103.55.90.208\n)\n\n => Array\n(\n => 47.31.41.163\n)\n\n => Array\n(\n => 223.182.195.5\n)\n\n => Array\n(\n => 122.52.101.166\n)\n\n => Array\n(\n => 103.207.82.154\n)\n\n => Array\n(\n => 171.224.178.84\n)\n\n => Array\n(\n => 110.225.235.187\n)\n\n => Array\n(\n => 119.160.97.248\n)\n\n => Array\n(\n => 116.90.101.121\n)\n\n => Array\n(\n => 182.255.48.154\n)\n\n => Array\n(\n => 180.149.221.140\n)\n\n => Array\n(\n => 194.44.79.13\n)\n\n => Array\n(\n => 47.247.18.3\n)\n\n => Array\n(\n => 27.56.242.95\n)\n\n => Array\n(\n => 41.60.236.83\n)\n\n => Array\n(\n => 122.164.162.7\n)\n\n => Array\n(\n => 71.136.154.5\n)\n\n => Array\n(\n => 132.154.119.122\n)\n\n => Array\n(\n => 110.225.80.135\n)\n\n => Array\n(\n => 84.17.61.143\n)\n\n => Array\n(\n => 119.160.102.244\n)\n\n => Array\n(\n => 47.31.27.44\n)\n\n => Array\n(\n => 27.71.89.160\n)\n\n => Array\n(\n => 107.175.38.101\n)\n\n => Array\n(\n => 195.211.150.152\n)\n\n => Array\n(\n => 157.35.250.255\n)\n\n => Array\n(\n => 111.119.187.53\n)\n\n => Array\n(\n => 119.152.97.213\n)\n\n => Array\n(\n => 180.92.143.145\n)\n\n => Array\n(\n => 72.255.61.46\n)\n\n => Array\n(\n => 47.8.183.6\n)\n\n => Array\n(\n => 92.38.148.53\n)\n\n => Array\n(\n => 122.173.194.72\n)\n\n => Array\n(\n => 183.83.226.97\n)\n\n => Array\n(\n => 122.173.73.231\n)\n\n => Array\n(\n => 119.160.101.101\n)\n\n => Array\n(\n => 93.177.75.174\n)\n\n => Array\n(\n => 115.97.196.70\n)\n\n => Array\n(\n => 111.119.187.35\n)\n\n => Array\n(\n => 103.226.226.154\n)\n\n => Array\n(\n => 103.244.172.73\n)\n\n => Array\n(\n => 119.155.61.222\n)\n\n => Array\n(\n => 157.37.184.92\n)\n\n => Array\n(\n => 119.160.103.204\n)\n\n => Array\n(\n => 175.176.87.21\n)\n\n => Array\n(\n => 185.51.228.246\n)\n\n => Array\n(\n => 103.250.164.255\n)\n\n => Array\n(\n => 122.181.194.16\n)\n\n => Array\n(\n => 157.37.230.232\n)\n\n => Array\n(\n => 103.105.236.6\n)\n\n => Array\n(\n => 111.88.128.174\n)\n\n => Array\n(\n => 37.111.139.82\n)\n\n => Array\n(\n => 39.34.133.52\n)\n\n => Array\n(\n => 113.177.79.80\n)\n\n => Array\n(\n => 180.183.71.184\n)\n\n => Array\n(\n => 116.72.218.255\n)\n\n => Array\n(\n => 119.160.117.26\n)\n\n => Array\n(\n => 158.222.0.252\n)\n\n => Array\n(\n => 23.227.142.146\n)\n\n => Array\n(\n => 122.162.152.152\n)\n\n => Array\n(\n => 103.255.149.106\n)\n\n => Array\n(\n => 104.236.53.155\n)\n\n => Array\n(\n => 119.160.119.155\n)\n\n => Array\n(\n => 175.107.214.244\n)\n\n => Array\n(\n => 102.7.116.7\n)\n\n => Array\n(\n => 111.88.91.132\n)\n\n => Array\n(\n => 119.157.248.108\n)\n\n => Array\n(\n => 222.252.36.107\n)\n\n => Array\n(\n => 157.46.209.227\n)\n\n => Array\n(\n => 39.40.54.1\n)\n\n => Array\n(\n => 223.225.19.254\n)\n\n => Array\n(\n => 154.72.150.8\n)\n\n => Array\n(\n => 107.181.177.130\n)\n\n => Array\n(\n => 101.50.75.31\n)\n\n => Array\n(\n => 84.17.58.69\n)\n\n => Array\n(\n => 178.62.5.157\n)\n\n => Array\n(\n => 112.206.175.147\n)\n\n => Array\n(\n => 137.97.113.137\n)\n\n => Array\n(\n => 103.53.44.154\n)\n\n => Array\n(\n => 180.92.143.129\n)\n\n => Array\n(\n => 14.231.223.7\n)\n\n => Array\n(\n => 167.88.63.201\n)\n\n => Array\n(\n => 103.140.204.8\n)\n\n => Array\n(\n => 221.121.135.108\n)\n\n => Array\n(\n => 119.160.97.129\n)\n\n => Array\n(\n => 27.5.168.249\n)\n\n => Array\n(\n => 119.160.102.191\n)\n\n => Array\n(\n => 122.162.219.12\n)\n\n => Array\n(\n => 157.50.141.122\n)\n\n => Array\n(\n => 43.245.8.17\n)\n\n => Array\n(\n => 113.181.198.179\n)\n\n => Array\n(\n => 47.30.221.59\n)\n\n => Array\n(\n => 110.38.29.246\n)\n\n => Array\n(\n => 14.192.140.199\n)\n\n => Array\n(\n => 24.68.10.106\n)\n\n => Array\n(\n => 47.30.209.179\n)\n\n => Array\n(\n => 106.223.123.21\n)\n\n => Array\n(\n => 103.224.48.30\n)\n\n => Array\n(\n => 104.131.19.173\n)\n\n => Array\n(\n => 119.157.100.206\n)\n\n => Array\n(\n => 103.10.226.73\n)\n\n => Array\n(\n => 162.208.51.163\n)\n\n => Array\n(\n => 47.30.221.227\n)\n\n => Array\n(\n => 119.160.116.210\n)\n\n => Array\n(\n => 198.16.78.43\n)\n\n => Array\n(\n => 39.44.201.151\n)\n\n => Array\n(\n => 71.63.181.84\n)\n\n => Array\n(\n => 14.142.192.218\n)\n\n => Array\n(\n => 39.34.147.178\n)\n\n => Array\n(\n => 111.92.75.25\n)\n\n => Array\n(\n => 45.135.239.58\n)\n\n => Array\n(\n => 14.232.235.1\n)\n\n => Array\n(\n => 49.144.100.155\n)\n\n => Array\n(\n => 62.182.99.33\n)\n\n => Array\n(\n => 104.243.212.187\n)\n\n => Array\n(\n => 59.97.132.214\n)\n\n => Array\n(\n => 47.9.15.179\n)\n\n => Array\n(\n => 39.44.103.186\n)\n\n => Array\n(\n => 183.83.241.132\n)\n\n => Array\n(\n => 103.41.24.180\n)\n\n => Array\n(\n => 104.238.46.39\n)\n\n => Array\n(\n => 103.79.170.78\n)\n\n => Array\n(\n => 59.103.138.81\n)\n\n => Array\n(\n => 106.198.191.146\n)\n\n => Array\n(\n => 106.198.255.122\n)\n\n => Array\n(\n => 47.31.46.37\n)\n\n => Array\n(\n => 109.169.23.76\n)\n\n => Array\n(\n => 103.143.7.55\n)\n\n => Array\n(\n => 49.207.114.52\n)\n\n => Array\n(\n => 198.54.106.250\n)\n\n => Array\n(\n => 39.50.64.18\n)\n\n => Array\n(\n => 222.252.48.132\n)\n\n => Array\n(\n => 42.201.186.53\n)\n\n => Array\n(\n => 115.97.198.95\n)\n\n => Array\n(\n => 93.76.134.244\n)\n\n => Array\n(\n => 122.173.15.189\n)\n\n => Array\n(\n => 39.62.38.29\n)\n\n => Array\n(\n => 103.201.145.254\n)\n\n => Array\n(\n => 111.119.187.23\n)\n\n => Array\n(\n => 157.50.66.33\n)\n\n => Array\n(\n => 157.49.68.163\n)\n\n => Array\n(\n => 103.85.125.215\n)\n\n => Array\n(\n => 103.255.4.16\n)\n\n => Array\n(\n => 223.181.246.206\n)\n\n => Array\n(\n => 39.40.109.226\n)\n\n => Array\n(\n => 43.225.70.157\n)\n\n => Array\n(\n => 103.211.18.168\n)\n\n => Array\n(\n => 137.59.221.60\n)\n\n => Array\n(\n => 103.81.214.63\n)\n\n => Array\n(\n => 39.35.163.2\n)\n\n => Array\n(\n => 106.205.124.39\n)\n\n => Array\n(\n => 209.99.165.216\n)\n\n => Array\n(\n => 103.75.247.187\n)\n\n => Array\n(\n => 157.46.217.41\n)\n\n => Array\n(\n => 75.186.73.80\n)\n\n => Array\n(\n => 212.103.48.153\n)\n\n => Array\n(\n => 47.31.61.167\n)\n\n => Array\n(\n => 119.152.145.131\n)\n\n => Array\n(\n => 171.76.177.244\n)\n\n => Array\n(\n => 103.135.78.50\n)\n\n => Array\n(\n => 103.79.170.75\n)\n\n => Array\n(\n => 105.160.22.74\n)\n\n => Array\n(\n => 47.31.20.153\n)\n\n => Array\n(\n => 42.107.204.65\n)\n\n => Array\n(\n => 49.207.131.35\n)\n\n => Array\n(\n => 92.38.148.61\n)\n\n => Array\n(\n => 183.83.255.206\n)\n\n => Array\n(\n => 107.181.177.131\n)\n\n => Array\n(\n => 39.40.220.157\n)\n\n => Array\n(\n => 39.41.133.176\n)\n\n => Array\n(\n => 103.81.214.61\n)\n\n => Array\n(\n => 223.235.108.46\n)\n\n => Array\n(\n => 171.241.52.118\n)\n\n => Array\n(\n => 39.57.138.47\n)\n\n => Array\n(\n => 106.204.196.172\n)\n\n => Array\n(\n => 39.53.228.40\n)\n\n => Array\n(\n => 185.242.5.99\n)\n\n => Array\n(\n => 103.255.5.96\n)\n\n => Array\n(\n => 157.46.212.120\n)\n\n => Array\n(\n => 107.181.177.138\n)\n\n => Array\n(\n => 47.30.193.65\n)\n\n => Array\n(\n => 39.37.178.33\n)\n\n => Array\n(\n => 157.46.173.29\n)\n\n => Array\n(\n => 39.57.238.211\n)\n\n => Array\n(\n => 157.37.245.113\n)\n\n => Array\n(\n => 47.30.201.138\n)\n\n => Array\n(\n => 106.204.193.108\n)\n\n => Array\n(\n => 212.103.50.212\n)\n\n => Array\n(\n => 58.65.221.187\n)\n\n => Array\n(\n => 178.62.92.29\n)\n\n => Array\n(\n => 111.92.77.166\n)\n\n => Array\n(\n => 47.30.223.158\n)\n\n => Array\n(\n => 103.224.54.83\n)\n\n => Array\n(\n => 119.153.43.22\n)\n\n => Array\n(\n => 223.181.126.251\n)\n\n => Array\n(\n => 39.42.175.202\n)\n\n => Array\n(\n => 103.224.54.190\n)\n\n => Array\n(\n => 49.36.141.210\n)\n\n => Array\n(\n => 5.62.63.218\n)\n\n => Array\n(\n => 39.59.9.18\n)\n\n => Array\n(\n => 111.88.86.45\n)\n\n => Array\n(\n => 178.54.139.5\n)\n\n => Array\n(\n => 116.68.105.241\n)\n\n => Array\n(\n => 119.160.96.187\n)\n\n => Array\n(\n => 182.189.192.103\n)\n\n => Array\n(\n => 119.160.96.143\n)\n\n => Array\n(\n => 110.225.89.98\n)\n\n => Array\n(\n => 169.149.195.134\n)\n\n => Array\n(\n => 103.238.104.54\n)\n\n => Array\n(\n => 47.30.208.142\n)\n\n => Array\n(\n => 157.46.179.209\n)\n\n => Array\n(\n => 223.235.38.119\n)\n\n => Array\n(\n => 42.106.180.165\n)\n\n => Array\n(\n => 154.122.240.239\n)\n\n => Array\n(\n => 106.223.104.191\n)\n\n => Array\n(\n => 111.93.110.218\n)\n\n => Array\n(\n => 182.183.161.171\n)\n\n => Array\n(\n => 157.44.184.211\n)\n\n => Array\n(\n => 157.50.185.193\n)\n\n => Array\n(\n => 117.230.19.194\n)\n\n => Array\n(\n => 162.243.246.160\n)\n\n => Array\n(\n => 106.223.143.53\n)\n\n => Array\n(\n => 39.59.41.15\n)\n\n => Array\n(\n => 106.210.65.42\n)\n\n => Array\n(\n => 180.243.144.208\n)\n\n => Array\n(\n => 116.68.105.22\n)\n\n => Array\n(\n => 115.42.70.46\n)\n\n => Array\n(\n => 99.72.192.148\n)\n\n => Array\n(\n => 182.183.182.48\n)\n\n => Array\n(\n => 171.48.58.97\n)\n\n => Array\n(\n => 37.120.131.188\n)\n\n => Array\n(\n => 117.99.167.177\n)\n\n => Array\n(\n => 111.92.76.210\n)\n\n => Array\n(\n => 14.192.144.245\n)\n\n => Array\n(\n => 169.149.242.87\n)\n\n => Array\n(\n => 47.30.198.149\n)\n\n => Array\n(\n => 59.103.57.140\n)\n\n => Array\n(\n => 117.230.161.168\n)\n\n => Array\n(\n => 110.225.88.173\n)\n\n => Array\n(\n => 169.149.246.95\n)\n\n => Array\n(\n => 42.106.180.52\n)\n\n => Array\n(\n => 14.231.160.157\n)\n\n => Array\n(\n => 123.27.109.47\n)\n\n => Array\n(\n => 157.46.130.54\n)\n\n => Array\n(\n => 39.42.73.194\n)\n\n => Array\n(\n => 117.230.18.147\n)\n\n => Array\n(\n => 27.59.231.98\n)\n\n => Array\n(\n => 125.209.78.227\n)\n\n => Array\n(\n => 157.34.80.145\n)\n\n => Array\n(\n => 42.201.251.86\n)\n\n => Array\n(\n => 117.230.129.158\n)\n\n => Array\n(\n => 103.82.80.103\n)\n\n => Array\n(\n => 47.9.171.228\n)\n\n => Array\n(\n => 117.230.24.92\n)\n\n => Array\n(\n => 103.129.143.119\n)\n\n => Array\n(\n => 39.40.213.45\n)\n\n => Array\n(\n => 178.92.188.214\n)\n\n => Array\n(\n => 110.235.232.191\n)\n\n => Array\n(\n => 5.62.34.18\n)\n\n => Array\n(\n => 47.30.212.134\n)\n\n => Array\n(\n => 157.42.34.196\n)\n\n => Array\n(\n => 157.32.169.9\n)\n\n => Array\n(\n => 103.255.4.11\n)\n\n => Array\n(\n => 117.230.13.69\n)\n\n => Array\n(\n => 117.230.58.97\n)\n\n => Array\n(\n => 92.52.138.39\n)\n\n => Array\n(\n => 221.132.119.63\n)\n\n => Array\n(\n => 117.97.167.188\n)\n\n => Array\n(\n => 119.153.56.58\n)\n\n => Array\n(\n => 105.50.22.150\n)\n\n => Array\n(\n => 115.42.68.126\n)\n\n => Array\n(\n => 182.189.223.159\n)\n\n => Array\n(\n => 39.59.36.90\n)\n\n => Array\n(\n => 111.92.76.114\n)\n\n => Array\n(\n => 157.47.226.163\n)\n\n => Array\n(\n => 202.47.44.37\n)\n\n => Array\n(\n => 106.51.234.172\n)\n\n => Array\n(\n => 103.101.88.166\n)\n\n => Array\n(\n => 27.6.246.146\n)\n\n => Array\n(\n => 103.255.5.83\n)\n\n => Array\n(\n => 103.98.210.185\n)\n\n => Array\n(\n => 122.173.114.134\n)\n\n => Array\n(\n => 122.173.77.248\n)\n\n => Array\n(\n => 5.62.41.172\n)\n\n => Array\n(\n => 180.178.181.17\n)\n\n => Array\n(\n => 37.120.133.224\n)\n\n => Array\n(\n => 45.131.5.156\n)\n\n => Array\n(\n => 110.39.100.110\n)\n\n => Array\n(\n => 176.110.38.185\n)\n\n => Array\n(\n => 36.255.41.64\n)\n\n => Array\n(\n => 103.104.192.15\n)\n\n => Array\n(\n => 43.245.131.195\n)\n\n => Array\n(\n => 14.248.111.185\n)\n\n => Array\n(\n => 122.173.217.133\n)\n\n => Array\n(\n => 106.223.90.245\n)\n\n => Array\n(\n => 119.153.56.80\n)\n\n => Array\n(\n => 103.7.60.172\n)\n\n => Array\n(\n => 157.46.184.233\n)\n\n => Array\n(\n => 182.190.31.95\n)\n\n => Array\n(\n => 109.87.189.122\n)\n\n => Array\n(\n => 91.74.25.100\n)\n\n => Array\n(\n => 182.185.224.144\n)\n\n => Array\n(\n => 106.223.91.221\n)\n\n => Array\n(\n => 182.190.223.40\n)\n\n => Array\n(\n => 2.58.194.134\n)\n\n => Array\n(\n => 196.246.225.236\n)\n\n => Array\n(\n => 106.223.90.173\n)\n\n => Array\n(\n => 23.239.16.54\n)\n\n => Array\n(\n => 157.46.65.225\n)\n\n => Array\n(\n => 115.186.130.14\n)\n\n => Array\n(\n => 103.85.125.157\n)\n\n => Array\n(\n => 14.248.103.6\n)\n\n => Array\n(\n => 123.24.169.247\n)\n\n => Array\n(\n => 103.130.108.153\n)\n\n => Array\n(\n => 115.42.67.21\n)\n\n => Array\n(\n => 202.166.171.190\n)\n\n => Array\n(\n => 39.37.169.104\n)\n\n => Array\n(\n => 103.82.80.59\n)\n\n => Array\n(\n => 175.107.208.58\n)\n\n => Array\n(\n => 203.192.238.247\n)\n\n => Array\n(\n => 103.217.178.150\n)\n\n => Array\n(\n => 103.66.214.173\n)\n\n => Array\n(\n => 110.93.236.174\n)\n\n => Array\n(\n => 143.189.242.64\n)\n\n => Array\n(\n => 77.111.245.12\n)\n\n => Array\n(\n => 145.239.2.231\n)\n\n => Array\n(\n => 115.186.190.38\n)\n\n => Array\n(\n => 109.169.23.67\n)\n\n => Array\n(\n => 198.16.70.29\n)\n\n => Array\n(\n => 111.92.76.186\n)\n\n => Array\n(\n => 115.42.69.34\n)\n\n => Array\n(\n => 73.61.100.95\n)\n\n => Array\n(\n => 103.129.142.31\n)\n\n => Array\n(\n => 103.255.5.53\n)\n\n => Array\n(\n => 103.76.55.2\n)\n\n => Array\n(\n => 47.9.141.138\n)\n\n => Array\n(\n => 103.55.89.234\n)\n\n => Array\n(\n => 103.223.13.53\n)\n\n => Array\n(\n => 175.158.50.203\n)\n\n => Array\n(\n => 103.255.5.90\n)\n\n => Array\n(\n => 106.223.100.138\n)\n\n => Array\n(\n => 39.37.143.193\n)\n\n => Array\n(\n => 206.189.133.131\n)\n\n => Array\n(\n => 43.224.0.233\n)\n\n => Array\n(\n => 115.186.132.106\n)\n\n => Array\n(\n => 31.43.21.159\n)\n\n => Array\n(\n => 119.155.56.131\n)\n\n => Array\n(\n => 103.82.80.138\n)\n\n => Array\n(\n => 24.87.128.119\n)\n\n => Array\n(\n => 106.210.103.163\n)\n\n => Array\n(\n => 103.82.80.90\n)\n\n => Array\n(\n => 157.46.186.45\n)\n\n => Array\n(\n => 157.44.155.238\n)\n\n => Array\n(\n => 103.119.199.2\n)\n\n => Array\n(\n => 27.97.169.205\n)\n\n => Array\n(\n => 157.46.174.89\n)\n\n => Array\n(\n => 43.250.58.220\n)\n\n => Array\n(\n => 76.189.186.64\n)\n\n => Array\n(\n => 103.255.5.57\n)\n\n => Array\n(\n => 171.61.196.136\n)\n\n => Array\n(\n => 202.47.40.88\n)\n\n => Array\n(\n => 97.118.94.116\n)\n\n => Array\n(\n => 157.44.124.157\n)\n\n => Array\n(\n => 95.142.120.13\n)\n\n => Array\n(\n => 42.201.229.151\n)\n\n => Array\n(\n => 157.46.178.95\n)\n\n => Array\n(\n => 169.149.215.192\n)\n\n => Array\n(\n => 42.111.19.48\n)\n\n => Array\n(\n => 1.38.52.18\n)\n\n => Array\n(\n => 145.239.91.241\n)\n\n => Array\n(\n => 47.31.78.191\n)\n\n => Array\n(\n => 103.77.42.60\n)\n\n => Array\n(\n => 157.46.107.144\n)\n\n => Array\n(\n => 157.46.125.124\n)\n\n => Array\n(\n => 110.225.218.108\n)\n\n => Array\n(\n => 106.51.77.185\n)\n\n => Array\n(\n => 123.24.161.207\n)\n\n => Array\n(\n => 106.210.108.22\n)\n\n => Array\n(\n => 42.111.10.14\n)\n\n => Array\n(\n => 223.29.231.175\n)\n\n => Array\n(\n => 27.56.152.132\n)\n\n => Array\n(\n => 119.155.31.100\n)\n\n => Array\n(\n => 122.173.172.127\n)\n\n => Array\n(\n => 103.77.42.64\n)\n\n => Array\n(\n => 157.44.164.106\n)\n\n => Array\n(\n => 14.181.53.38\n)\n\n => Array\n(\n => 115.42.67.64\n)\n\n => Array\n(\n => 47.31.33.140\n)\n\n => Array\n(\n => 103.15.60.234\n)\n\n => Array\n(\n => 182.64.219.181\n)\n\n => Array\n(\n => 103.44.51.6\n)\n\n => Array\n(\n => 116.74.25.157\n)\n\n => Array\n(\n => 116.71.2.128\n)\n\n => Array\n(\n => 157.32.185.239\n)\n\n => Array\n(\n => 47.31.25.79\n)\n\n => Array\n(\n => 178.62.85.75\n)\n\n => Array\n(\n => 180.178.190.39\n)\n\n => Array\n(\n => 39.48.52.179\n)\n\n => Array\n(\n => 106.193.11.240\n)\n\n => Array\n(\n => 103.82.80.226\n)\n\n => Array\n(\n => 49.206.126.30\n)\n\n => Array\n(\n => 157.245.191.173\n)\n\n => Array\n(\n => 49.205.84.237\n)\n\n => Array\n(\n => 47.8.181.232\n)\n\n => Array\n(\n => 182.66.2.92\n)\n\n => Array\n(\n => 49.34.137.220\n)\n\n => Array\n(\n => 209.205.217.125\n)\n\n => Array\n(\n => 192.64.5.73\n)\n\n => Array\n(\n => 27.63.166.108\n)\n\n => Array\n(\n => 120.29.96.211\n)\n\n => Array\n(\n => 182.186.112.135\n)\n\n => Array\n(\n => 45.118.165.151\n)\n\n => Array\n(\n => 47.8.228.12\n)\n\n => Array\n(\n => 106.215.3.162\n)\n\n => Array\n(\n => 111.92.72.66\n)\n\n => Array\n(\n => 169.145.2.9\n)\n\n => Array\n(\n => 106.207.205.100\n)\n\n => Array\n(\n => 223.181.8.12\n)\n\n => Array\n(\n => 157.48.149.78\n)\n\n => Array\n(\n => 103.206.138.116\n)\n\n => Array\n(\n => 39.53.119.22\n)\n\n => Array\n(\n => 157.33.232.106\n)\n\n => Array\n(\n => 49.37.205.139\n)\n\n => Array\n(\n => 115.42.68.3\n)\n\n => Array\n(\n => 93.72.182.251\n)\n\n => Array\n(\n => 202.142.166.22\n)\n\n => Array\n(\n => 157.119.81.111\n)\n\n => Array\n(\n => 182.186.116.155\n)\n\n => Array\n(\n => 157.37.171.37\n)\n\n => Array\n(\n => 117.206.164.48\n)\n\n => Array\n(\n => 49.36.52.63\n)\n\n => Array\n(\n => 203.175.72.112\n)\n\n => Array\n(\n => 171.61.132.193\n)\n\n => Array\n(\n => 111.119.187.44\n)\n\n => Array\n(\n => 39.37.165.216\n)\n\n => Array\n(\n => 103.86.109.58\n)\n\n => Array\n(\n => 39.59.2.86\n)\n\n => Array\n(\n => 111.119.187.28\n)\n\n => Array\n(\n => 106.201.9.10\n)\n\n => Array\n(\n => 49.35.25.106\n)\n\n => Array\n(\n => 157.49.239.103\n)\n\n => Array\n(\n => 157.49.237.198\n)\n\n => Array\n(\n => 14.248.64.121\n)\n\n => Array\n(\n => 117.102.7.214\n)\n\n => Array\n(\n => 120.29.91.246\n)\n\n => Array\n(\n => 103.7.79.41\n)\n\n => Array\n(\n => 132.154.99.209\n)\n\n => Array\n(\n => 212.36.27.245\n)\n\n => Array\n(\n => 157.44.154.9\n)\n\n => Array\n(\n => 47.31.56.44\n)\n\n => Array\n(\n => 192.142.199.136\n)\n\n => Array\n(\n => 171.61.159.49\n)\n\n => Array\n(\n => 119.160.116.151\n)\n\n => Array\n(\n => 103.98.63.39\n)\n\n => Array\n(\n => 41.60.233.216\n)\n\n => Array\n(\n => 49.36.75.212\n)\n\n => Array\n(\n => 223.188.60.20\n)\n\n => Array\n(\n => 103.98.63.50\n)\n\n => Array\n(\n => 178.162.198.21\n)\n\n => Array\n(\n => 157.46.209.35\n)\n\n => Array\n(\n => 119.155.32.151\n)\n\n => Array\n(\n => 102.185.58.161\n)\n\n => Array\n(\n => 59.96.89.231\n)\n\n => Array\n(\n => 119.155.255.198\n)\n\n => Array\n(\n => 42.107.204.57\n)\n\n => Array\n(\n => 42.106.181.74\n)\n\n => Array\n(\n => 157.46.219.186\n)\n\n => Array\n(\n => 115.42.71.49\n)\n\n => Array\n(\n => 157.46.209.131\n)\n\n => Array\n(\n => 220.81.15.94\n)\n\n => Array\n(\n => 111.119.187.24\n)\n\n => Array\n(\n => 49.37.195.185\n)\n\n => Array\n(\n => 42.106.181.85\n)\n\n => Array\n(\n => 43.249.225.134\n)\n\n => Array\n(\n => 117.206.165.151\n)\n\n => Array\n(\n => 119.153.48.250\n)\n\n => Array\n(\n => 27.4.172.162\n)\n\n => Array\n(\n => 117.20.29.51\n)\n\n => Array\n(\n => 103.98.63.135\n)\n\n => Array\n(\n => 117.7.218.229\n)\n\n => Array\n(\n => 157.49.233.105\n)\n\n => Array\n(\n => 39.53.151.199\n)\n\n => Array\n(\n => 101.255.118.33\n)\n\n => Array\n(\n => 41.141.246.9\n)\n\n => Array\n(\n => 221.132.113.78\n)\n\n => Array\n(\n => 119.160.116.202\n)\n\n => Array\n(\n => 117.237.193.244\n)\n\n => Array\n(\n => 157.41.110.145\n)\n\n => Array\n(\n => 103.98.63.5\n)\n\n => Array\n(\n => 103.125.129.58\n)\n\n => Array\n(\n => 183.83.254.66\n)\n\n => Array\n(\n => 45.135.236.160\n)\n\n => Array\n(\n => 198.199.87.124\n)\n\n => Array\n(\n => 193.176.86.41\n)\n\n => Array\n(\n => 115.97.142.98\n)\n\n => Array\n(\n => 222.252.38.198\n)\n\n => Array\n(\n => 110.93.237.49\n)\n\n => Array\n(\n => 103.224.48.122\n)\n\n => Array\n(\n => 110.38.28.130\n)\n\n => Array\n(\n => 106.211.238.154\n)\n\n => Array\n(\n => 111.88.41.73\n)\n\n => Array\n(\n => 119.155.13.143\n)\n\n => Array\n(\n => 103.213.111.60\n)\n\n => Array\n(\n => 202.0.103.42\n)\n\n => Array\n(\n => 157.48.144.33\n)\n\n => Array\n(\n => 111.119.187.62\n)\n\n => Array\n(\n => 103.87.212.71\n)\n\n => Array\n(\n => 157.37.177.20\n)\n\n => Array\n(\n => 223.233.71.92\n)\n\n => Array\n(\n => 116.213.32.107\n)\n\n => Array\n(\n => 104.248.173.151\n)\n\n => Array\n(\n => 14.181.102.222\n)\n\n => Array\n(\n => 103.10.224.252\n)\n\n => Array\n(\n => 175.158.50.57\n)\n\n => Array\n(\n => 165.22.122.199\n)\n\n => Array\n(\n => 23.106.56.12\n)\n\n => Array\n(\n => 203.122.10.146\n)\n\n => Array\n(\n => 37.111.136.138\n)\n\n => Array\n(\n => 103.87.193.66\n)\n\n => Array\n(\n => 39.59.122.246\n)\n\n => Array\n(\n => 111.119.183.63\n)\n\n => Array\n(\n => 157.46.72.102\n)\n\n => Array\n(\n => 185.132.133.82\n)\n\n => Array\n(\n => 118.103.230.148\n)\n\n => Array\n(\n => 5.62.39.45\n)\n\n => Array\n(\n => 119.152.144.134\n)\n\n)\n```\nIts Starting to Feel Real: Retire to Travel\n << Back to all Blogs Login or Create your own free blog Layout: Blue and Brown (Default) Author's Creation\nHome > Its Starting to Feel Real", null, "", null, "", null, "# Its Starting to Feel Real\n\nMay 30th, 2008 at 02:17 am\n\nI stopped at the lawyers office and picked up my payoff for the house. Of course, I immediately went to the bank to open a money market account and deposit the check. It made it all seem so real.\n\nI also stopped by my insurance agent's office to cancel the umbrella policy. I really like my agent, but I am seriously considering shopping around for a better price. That also feels weird since I've been with this company for 27 years.\n\nI feel like I'm living the poem by Robert Frost \"The Road Not Taken\". So many possible roads. I want to live deliberately.\n\nAt the gas station, I looked down and there was a credit card. No, not mine. I deliberated on what to do and decided to just call the 800 number on the back and report it lost or is that found. They told me they would notify the card holder and would I please use scissors to cut the card up. I went one better and put it through the shredder.\n\nThe plan is to be completely moved out on Saturday, but it might take til Sunday. That will drive the ex crazy. The agreement gives me until midnight Sunday. He told me he's moving all his stuff in on Friday(before I'm out), I said no way. Give the man an inch and he goes several miles. I should never have told him he could move a few boxes into an empty room when he asked two weeks ago.\n\nSaturday is going to be a long day.\n\n### 2 Responses to “Its Starting to Feel Real”\n\n1. boomeyers Says:" ]
[ null, "https://www.savingadvice.com/blogs/images/search/top_left.php", null, "https://www.savingadvice.com/blogs/images/search/top_right.php", null, "https://www.savingadvice.com/blogs/images/search/bottom_left.php", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.98596996,"math_prob":0.99936515,"size":1625,"snap":"2020-34-2020-40","text_gpt3_token_len":387,"char_repetition_ratio":0.08266502,"word_repetition_ratio":0.22222222,"special_character_ratio":0.25046155,"punctuation_ratio":0.09803922,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9996729,"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\":\"2020-10-01T05:12:54Z\",\"WARC-Record-ID\":\"<urn:uuid:e953c7f0-85b3-48c9-a721-7f4d9906b99e>\",\"Content-Length\":\"148777\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:7925ace5-5ac6-4500-9cb0-509620d0a2bc>\",\"WARC-Concurrent-To\":\"<urn:uuid:90fe6d88-1c02-480e-a248-0b7ff51d43d9>\",\"WARC-IP-Address\":\"173.231.200.26\",\"WARC-Target-URI\":\"https://retiretotravel.savingadvice.com/2008/05/30/its-starting-to-feel-real_39527/\",\"WARC-Payload-Digest\":\"sha1:CO2HP5KZEO3AKQIKKFVOU35PPA6ZSDWR\",\"WARC-Block-Digest\":\"sha1:GF3X234AESEHLA23BWPHE27HLW6UYEYA\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-40/CC-MAIN-2020-40_segments_1600402130615.94_warc_CC-MAIN-20201001030529-20201001060529-00404.warc.gz\"}"}
https://en.scratch-wiki.info/wiki/Join_()()_(block)
[ "Join ()() `join ()()` Category Operators Type Reporter Introduced in 1.4\n\nThe Join ()() block is an Operators block and a Reporter block. The block concatenates, or \"links\" the two values together and reports the result — for example, if \"hello\" and \"world\" were put in the block, it would report \"helloworld\". To report \"hello world\", use either \"hello \" and \"world\" or \"hello\" and \" world\", with a space.\n\nTo join three or more values together, put this block inside one of its inputs.\n\n## Example Uses\n\nIf words, numbers, sentences—any two values—must be concatenated together, this block easily does the job.\n\nSome common uses for the Join ()() block:\n\n• Joining words and variables to create a sentence\n```when flag clicked\nsay (join (join (join (join [Hello ] (answer))[. My name is ]) (Person's name)) [.])\n```\n• Place a variable in a message (e.g. \"You completed 2 loops\")\n`say (join [The score is ] (join (score) [.]))`\n• An easy method of negating a positive number\n`set [variable v] to (join [-] (number))`", null, "Note: This does not work on numbers that are already negative.\n• Using hex inputs in pen colors\n`set pen color to (join [0x] (hex input))`\n\n### Offline decimal trick\n\nIn the Offline Editor (this does not work online!), numbers in variables and speech bubbles usually round to only one decimal place. In some projects, it is necessary to have more. Placing the calculation in one input of the Join ()() block and leaving the other input empty \"magically\" reports the number with more decimal places.\n\n• The original script:\n```set [number v] to ([sqrt v] of ((item (1 v) of [list v]) * (3)))\n```\n• Script with more decimals:\n```set [number v] to (join([sqrt v] of ((item (1 v) of [list v]) * (3))) [])\n```\n• To set the number of decimal places, use a script like this:\n```set [number v] to (join((round (([10^ v] of (decimal places)::operators) * ([sqrt v] of ((item (1 v) of [list v]) * (3))))) / ([10^ v] of (decimal places)::operators))[])\n```\n\n## Workaround\n\nMain article: List of Block Workarounds\n\nThis block can be replicated with the following code:\n\n```delete all of [final v]\nset [count v] to \nrepeat (length of (insert1))\nchange [count v] by (1)\nadd (letter (count) of (insert1)) to [final v]\nend\nset [count v] to \nrepeat (length of (insert2))\nchange [count v] by (1)\nadd (letter (count) of (insert2)) to [final v]\nend\nset [result v] to (final)\n```\n\nThe variable \"result\" contains the result. This works because list reporters join all of the items in a list without spaces if they are all 1 character long, and so by taking just 1 letter from each string at a time and putting them into the list, the reporter has the same result as the join block in most cases.\n\n## Limitations\n\nThe join block displays a phenomenon where it does not output strings longer than 10240 characters, even if either side or both sides of the concatenation are longer than this amount. The characters which are expected to appear beyond the 10240th character are just truncated. It is still possible to join two strings to longer than 10240, but it cannot be done with the join block — it must be done using the workaround listed above, unless the total string contains more than 200000 characters." ]
[ null, "https://en.scratch-wiki.info/w/images/thumb/Information.png/18px-Information.png", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.85414374,"math_prob":0.8548357,"size":3432,"snap":"2020-45-2020-50","text_gpt3_token_len":890,"char_repetition_ratio":0.11610268,"word_repetition_ratio":0.06635071,"special_character_ratio":0.31060606,"punctuation_ratio":0.08589952,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9846024,"pos_list":[0,1,2],"im_url_duplicate_count":[null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-11-28T05:12:40Z\",\"WARC-Record-ID\":\"<urn:uuid:72018b8f-87a1-4d20-85e3-960f8d51e606>\",\"Content-Length\":\"33615\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:70e6c193-d1be-473c-9534-3de37b0e79c8>\",\"WARC-Concurrent-To\":\"<urn:uuid:e839570f-820f-4b1c-a47a-845bd680efa4>\",\"WARC-IP-Address\":\"195.30.85.120\",\"WARC-Target-URI\":\"https://en.scratch-wiki.info/wiki/Join_()()_(block)\",\"WARC-Payload-Digest\":\"sha1:H5JDMS3OE2TOMWBWSNPAFYEHTIXFXVAF\",\"WARC-Block-Digest\":\"sha1:R563YOHRYNHBJP6BXR23EFKDE26GSE5Z\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-50/CC-MAIN-2020-50_segments_1606141195069.35_warc_CC-MAIN-20201128040731-20201128070731-00008.warc.gz\"}"}
https://www.numerade.com/questions/when-100-mathrmg-of-metallic-chromium-is-heated-with-elemental-chlorine-gas-3045-mathrmg-of-a-chromi/
[ "Composition\n\n### Discussion\n\nYou must be signed in to discuss.\n##### Top Chemistry 101 Educators", null, "", null, "", null, "##### Jake R.\n\nUniversity of Toronto\n\n### Video Transcript\n\nright. So here way have chromium in our test tube and being a to begin is crying gas. And these tools, yet I understand heat to create a chlorine, a chromium for it and soaked Ionic Bond formation thing. Okay, so the f chromium quarrying, gas making chromium four right are unknown. But we need what we know is the mass of this compact, which is 3.45 Gramps. Okay, we can use the way out what the compound was that we created. And we can also weigh our starting chromium metal, which was one gram turn to win gases. That's why we probably couldn't even find the mass every guess. But we can now subtract what we produced from this one starting material to know how much gas was added into this top. The oldest one minus 3.45 to give two point over five grams of chlorine. So, to find the empirical formula of the final product, we need to understand how much of each Adam is present. And to understand that grams can't help us. What we need is moles. Most will give us more quantity and we know that moles is equivalent to mass sweated by moments. So then became bring our product table of elements and find the elements of each of the zones and divide mass. By that number, what we get men is 0.0 192 molds of chromium and 0.576 most of chlorine, right? So, yeah, this number is useful. However, we must have it in a interred your whole number for him. So aren't you do that until I keep this ratio, but, you know, increase it, increase the actual numbers themselves. So what we'll do, it'll do some division. We'll take this number. True. The chlorine number of moles and divided by the Korean and most simply because it's bigger is your door with you could have done that the other way wouldn't matter. I take your 0.576 over zero. Put 019 Let's see what we get. One night, two nos Uh, this equates to It's basically three right, and we know any home number. All members are over 12 3/1. So we have three chlorine atoms for everyone and there we have it. Our empirical formula, c r C l. Three", null, "McMaster University\n\n#### Topics\n\nComposition\n\n##### Top Chemistry 101 Educators", null, "", null, "", null, "##### Jake R.\n\nUniversity of Toronto" ]
[ null, "https://d1ras9cbx5uamo.cloudfront.net/eyJidWNrZXQiOiAiY29tLm51bWVyYWRlIiwgImtleSI6ICJpbnN0cnVjdG9ycy9mNjBhNWRjOTEzMDI0MDBhYTFhNDhmZTE2YjcxMWMwOS5qcGciLCAiZWRpdHMiOiB7InJlc2l6ZSI6IHsid2lkdGgiOiAyNTYsICJoZWlnaHQiOiAyNTZ9fX0=", null, "https://d1ras9cbx5uamo.cloudfront.net/eyJidWNrZXQiOiAiY29tLm51bWVyYWRlIiwgImtleSI6ICJpbnN0cnVjdG9ycy83ODM1ODgxMDZkMTk0ZmZkYjBmODQ4ZWE3ODY1ZDc0Ny5qcGciLCAiZWRpdHMiOiB7InJlc2l6ZSI6IHsid2lkdGgiOiAyNTYsICJoZWlnaHQiOiAyNTZ9fX0=", null, "https://d1ras9cbx5uamo.cloudfront.net/eyJidWNrZXQiOiAiY29tLm51bWVyYWRlIiwgImtleSI6ICJpbnN0cnVjdG9ycy85MDk3ODhlNTY0ODU0ZmUyYTg0Y2M2NTc1MzZjMmQ0ZC5qcGVnIiwgImVkaXRzIjogeyJyZXNpemUiOiB7IndpZHRoIjogMjU2LCAiaGVpZ2h0IjogMjU2fX19", null, "https://d1ras9cbx5uamo.cloudfront.net/eyJidWNrZXQiOiAiY29tLm51bWVyYWRlIiwgImtleSI6ICJpbnN0cnVjdG9ycy83NGVhNDY0ODc1NDQ0ZmIwYjgyMzYyMWQyNGUwMGQ3OC5KUEciLCAiZWRpdHMiOiB7InJlc2l6ZSI6IHsid2lkdGgiOiAyNTYsICJoZWlnaHQiOiAyNTZ9fX0=", null, "https://d1ras9cbx5uamo.cloudfront.net/eyJidWNrZXQiOiAiY29tLm51bWVyYWRlIiwgImtleSI6ICJpbnN0cnVjdG9ycy9mNjBhNWRjOTEzMDI0MDBhYTFhNDhmZTE2YjcxMWMwOS5qcGciLCAiZWRpdHMiOiB7InJlc2l6ZSI6IHsid2lkdGgiOiAyNTYsICJoZWlnaHQiOiAyNTZ9fX0=", null, "https://d1ras9cbx5uamo.cloudfront.net/eyJidWNrZXQiOiAiY29tLm51bWVyYWRlIiwgImtleSI6ICJpbnN0cnVjdG9ycy83ODM1ODgxMDZkMTk0ZmZkYjBmODQ4ZWE3ODY1ZDc0Ny5qcGciLCAiZWRpdHMiOiB7InJlc2l6ZSI6IHsid2lkdGgiOiAyNTYsICJoZWlnaHQiOiAyNTZ9fX0=", null, "https://d1ras9cbx5uamo.cloudfront.net/eyJidWNrZXQiOiAiY29tLm51bWVyYWRlIiwgImtleSI6ICJpbnN0cnVjdG9ycy85MDk3ODhlNTY0ODU0ZmUyYTg0Y2M2NTc1MzZjMmQ0ZC5qcGVnIiwgImVkaXRzIjogeyJyZXNpemUiOiB7IndpZHRoIjogMjU2LCAiaGVpZ2h0IjogMjU2fX19", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.9588778,"math_prob":0.9324815,"size":2312,"snap":"2021-04-2021-17","text_gpt3_token_len":548,"char_repetition_ratio":0.11135182,"word_repetition_ratio":0.0048076925,"special_character_ratio":0.23572664,"punctuation_ratio":0.12525253,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.97649276,"pos_list":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"im_url_duplicate_count":[null,null,null,null,null,null,null,null,null,null,null,null,null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-04-16T11:35:01Z\",\"WARC-Record-ID\":\"<urn:uuid:0e1ec927-b60c-415b-aab6-ed609531cc68>\",\"Content-Length\":\"133604\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:d38b11e8-13ba-403d-bc5c-ebc8d6407991>\",\"WARC-Concurrent-To\":\"<urn:uuid:7c021a1f-a52a-46b6-9647-5298d78dbab5>\",\"WARC-IP-Address\":\"54.186.83.212\",\"WARC-Target-URI\":\"https://www.numerade.com/questions/when-100-mathrmg-of-metallic-chromium-is-heated-with-elemental-chlorine-gas-3045-mathrmg-of-a-chromi/\",\"WARC-Payload-Digest\":\"sha1:HFFJQ5XZN5OWGUBBAYQKDDLA5IR3MLFD\",\"WARC-Block-Digest\":\"sha1:7WUHLQS7Z456QKCRCHATADIXWBVRHXYS\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-17/CC-MAIN-2021-17_segments_1618038056325.1_warc_CC-MAIN-20210416100222-20210416130222-00255.warc.gz\"}"}
https://www.brainkart.com/article/Differential-Mode-Operation---Differential-Amplifier_12554/
[ "Home | | Electronic Devices and Circuits | Differential Mode Operation - Differential Amplifier\n\n# Differential Mode Operation - Differential Amplifier\n\nIn the differential mode, the two input signals are different from each other. Consider the two input signals which are same in magnitude but 180\" out of phase.\n\nDifferential Mode Operation\n\nIn the differential mode, the two input signals are different from each other. Consider the two input signals which are same in magnitude but 180\" out of phase. These signals, with opposite phase can be obtained from the center tap transformer. The circuit used in differential mode operation is shown in the Fig..", null, "Assume that the sine wave on the base of Q 1is positive going while on the base of Q 2 is negative going. With a positive going signal on the base of Q 1, m amplified negative going signal develops on the collector of Q1. Due to positive going signal, current through R E also increases and hence a positive going wave is developed across R E. Due to negative going signal on the base of Q2, an amplified positive going signal develops on the collector of Q 2. And a negative going signal develops across R E, because of emitter follower action of Q 2. So signal voltages across R E, due to the effect of Q1 and Q2 are equal in magnitude and 180o out of phase, due to matched pair of transistors. Hence these two signals cancel each other and there is no signal across the emitter resistance. Hence there is no a.c. signal current flowing through the emitter resistance.\n\nHence R E in this case does not introduce negative feedback. While Vo is the output taken across collector of Q1 and collector of Q 2. The two outputs on collector L and 2 are equal in magnitude but opposite in polarity. And Vo is the difference between these two signals, e.g. +10 - (-10) = + 20.\n\nHence the difference output Vo is twice as large as the signal voltage from either collector to ground\n\nStudy Material, Lecturing Notes, Assignment, Reference, Wiki description explanation, brief detail\n\nRelated Topics" ]
[ null, "https://www.brainkart.com/media/extra/IwOJXBU.jpg", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.90761817,"math_prob":0.966773,"size":1725,"snap":"2019-51-2020-05","text_gpt3_token_len":408,"char_repetition_ratio":0.14584544,"word_repetition_ratio":0.04262295,"special_character_ratio":0.2231884,"punctuation_ratio":0.10174418,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.98213667,"pos_list":[0,1,2],"im_url_duplicate_count":[null,1,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-12-15T15:36:54Z\",\"WARC-Record-ID\":\"<urn:uuid:63c66a18-b23f-4e8a-8fcc-513a89ca6af2>\",\"Content-Length\":\"31390\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:bf020b43-7173-481e-995e-ff6c1eabea50>\",\"WARC-Concurrent-To\":\"<urn:uuid:52d7335c-6f7d-402f-93e4-359380cb0f03>\",\"WARC-IP-Address\":\"148.66.135.100\",\"WARC-Target-URI\":\"https://www.brainkart.com/article/Differential-Mode-Operation---Differential-Amplifier_12554/\",\"WARC-Payload-Digest\":\"sha1:6V7L43GSQQO4CMY4UJGLTPWXIU7VHCAK\",\"WARC-Block-Digest\":\"sha1:SIZVBJI5HPTJPF4L2XDHN7XZBK2RGRBD\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-51/CC-MAIN-2019-51_segments_1575541308604.91_warc_CC-MAIN-20191215145836-20191215173836-00192.warc.gz\"}"}
https://www.r-bloggers.com/2018/06/exploring-different-squigglers-hga/
[ "Want to share your content on R-bloggers? click here if you have a blog, or here if you don't.\n\n```library(fitzRoy)\nlibrary(tidyverse)```\n\n`## -- Attaching packages --------------------------------------------------- tidyverse 1.2.1 --`\n\n```## v ggplot2 2.2.1 v purrr 0.2.5\n## v tibble 1.4.2 v dplyr 0.7.5\n## v tidyr 0.8.1 v stringr 1.3.1\n## v readr 1.1.1 v forcats 0.3.0```\n\n```## -- Conflicts ------------------------------------------------------ tidyverse_conflicts() --\n\n`library(lubridate)`\n\n```##\n## Attaching package: 'lubridate'```\n\n```## The following object is masked from 'package:base':\n##\n## date```\n\n`library(mgcv)`\n\n`## Loading required package: nlme`\n\n```##\n## Attaching package: 'nlme'```\n\n```## The following object is masked from 'package:dplyr':\n##\n## collapse```\n\n`## This is mgcv 1.8-23. For overview type 'help(\"mgcv-package\")'.`\n\n```afltables<-fitzRoy::get_match_results()\ntips <- get_squiggle_data(\"tips\")```\n\n`## Getting data from https://api.squiggle.com.au/?q=tips`\n\n```afltables<-afltables%>%mutate(Home.Team = str_replace(Home.Team, \"GWS\", \"Greater Western Sydney\"))\n\nafltables<-afltables %>%mutate(Home.Team = str_replace(Home.Team, \"Footscray\", \"Western Bulldogs\"))\n\nunique(afltables\\$Home.Team)```\n\n```## \"Fitzroy\" \"Collingwood\"\n## \"Geelong\" \"Sydney\"\n## \"Essendon\" \"St Kilda\"\n## \"Melbourne\" \"Carlton\"\n## \"Richmond\" \"University\"\n## \"Hawthorn\" \"North Melbourne\"\n## \"Western Bulldogs\" \"West Coast\"\n## \"Gold Coast\" \"Greater Western Sydney\"```\n\n`names(afltables)`\n\n```## \"Game\" \"Date\" \"Round\" \"Home.Team\"\n## \"Home.Goals\" \"Home.Behinds\" \"Home.Points\" \"Away.Team\"\n## \"Away.Goals\" \"Away.Behinds\" \"Away.Points\" \"Venue\"\n## \"Margin\" \"Season\" \"Round.Type\" \"Round.Number\"```\n\n`names(tips)`\n\n```## \"venue\" \"hteamid\" \"tip\" \"correct\" \"date\"\n## \"round\" \"ateam\" \"bits\" \"year\" \"confidence\"\n## \"updated\" \"tipteamid\" \"gameid\" \"ateamid\" \"err\"\n## \"sourceid\" \"margin\" \"source\" \"hconfidence\" \"hteam\"```\n\n```tips\\$date<-ymd_hms(tips\\$date)\n\ntips\\$date<-as.Date(tips\\$date)\n\nafltables\\$Date<-ymd(afltables\\$Date)\njoined_dataset<-left_join(tips, afltables, by=c(\"hteam\"=\"Home.Team\", \"date\"=\"Date\"))\n\ndf<-joined_dataset%>%\nselect(hteam, ateam,tip,correct, hconfidence, round, date,\nsource, margin, Home.Points, Away.Points, year)%>%\nmutate(squigglehomemargin=if_else(hteam==tip, margin, -margin),\nactualhomemargin=Home.Points-Away.Points,\nhconfidence=hconfidence/100)%>%\nfilter(source==\"PlusSixOne\")%>%\nselect(round, hteam, ateam, hconfidence, squigglehomemargin, actualhomemargin, correct)\ndf<-df[complete.cases(df),]\n\ndf\\$hteam<-as.factor(df\\$hteam)\ndf\\$ateam<-as.factor(df\\$ateam)\nft=gam(I(actualhomemargin>0)~s(hconfidence),data=df,family=\"binomial\")\n\ndf\\$logitChance = log(df\\$hconfidence)/log(100-df\\$hconfidence)\n\nft=gam(I(actualhomemargin>0)~s(logitChance),data=df,family=\"binomial\")\n\npreds = predict(ft,type=\"response\",se.fit=TRUE)\npredSort=sort(preds\\$fit,index.return=TRUE)\n\nplot(predSort\\$x~df\\$hconfidence[predSort\\$ix],col=\"red\",type=\"l\")\n\nabline(h=0.5,col=\"blue\")\nabline(v=50,col=\"blue\")\nabline(c(0,1),col=\"purple\")\nlines(df\\$hconfidence[predSort\\$ix],predSort\\$x+2*preds\\$se.fit[predSort\\$ix])\nlines(df\\$hconfidence[predSort\\$ix],predSort\\$x-2*preds\\$se.fit[predSort\\$ix])```", null, "```# predicting winners\nft=gam(I(actualhomemargin>0)~s(hconfidence),data=df,family=\"binomial\",sp=0.05)\n# the 0.05 was to make it a bit wiggly but not too silly (the default was not monotonically increasing, which is silly)\nabline(h=0.5,col=\"blue\")\nabline(v=0.5,col=\"blue\")\nabline(c(0,1),col=\"purple\")```", null, "```# predicting margins\nft=gam(actualhomemargin~s(hconfidence),data=df)\nplot(ft,rug=FALSE,residual=TRUE,pch=1,cex=0.4)\nabline(h=0.5,col=\"blue\")\nabline(v=0.5,col=\"blue\")\n\n# add squiggle margins to the plot\nconfSort = sort(df\\$hconfidence,index.return=TRUE)\nlines(confSort\\$x,df\\$squigglehomemargin[confSort\\$ix],col=\"purple\")```", null, "" ]
[ null, "https://i2.wp.com/analysisofafl.netlify.com/fitzRoy/2018-06-30-exploring-different-squigglers-hga_files/figure-html/unnamed-chunk-1-1.png", null, "https://i0.wp.com/analysisofafl.netlify.com/fitzRoy/2018-06-30-exploring-different-squigglers-hga_files/figure-html/unnamed-chunk-1-2.png", null, "https://i1.wp.com/analysisofafl.netlify.com/fitzRoy/2018-06-30-exploring-different-squigglers-hga_files/figure-html/unnamed-chunk-1-3.png", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.5265318,"math_prob":0.63692516,"size":4583,"snap":"2020-45-2020-50","text_gpt3_token_len":1460,"char_repetition_ratio":0.13081458,"word_repetition_ratio":0.111597374,"special_character_ratio":0.31573206,"punctuation_ratio":0.18764569,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.97469777,"pos_list":[0,1,2,3,4,5,6],"im_url_duplicate_count":[null,3,null,3,null,3,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-11-27T12:30:05Z\",\"WARC-Record-ID\":\"<urn:uuid:b880bb6a-3077-4d89-871a-d2bacacf32f2>\",\"Content-Length\":\"114061\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:759f21e0-f312-4b19-ad09-f6b329e1c43f>\",\"WARC-Concurrent-To\":\"<urn:uuid:8d790227-8769-4fa2-9fb3-14e41f04ee75>\",\"WARC-IP-Address\":\"172.67.170.238\",\"WARC-Target-URI\":\"https://www.r-bloggers.com/2018/06/exploring-different-squigglers-hga/\",\"WARC-Payload-Digest\":\"sha1:UQCTNUAYMOSGACNU2U6ZUMLTPHA4UUQN\",\"WARC-Block-Digest\":\"sha1:CZOS54R2YQG54I6FZQRKSOQPUYIQTMBD\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-50/CC-MAIN-2020-50_segments_1606141191692.20_warc_CC-MAIN-20201127103102-20201127133102-00229.warc.gz\"}"}
https://yq.aliyun.com/articles/544048
[ "#", null, "<!DOCTYPE html PUBLIC \"-//W3C//DTD XHTML 1.0 Transitional//EN\" \"http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd\"> <html><head><meta http-equiv=\"Cont\n\n0\n0\n0", null, "1. 云栖社区>\n2. 博客>\n3. 正文\n\ntonemy 浏览901\n\n# 一:综述\n\n01序列的最长连续零——只知道左右区间的最长连续零,没法知道总的最长连续零\n\n# 二:原理\n\n(注:由于线段树的每个节点代表一个区间,以下叙述中不区分节点和区间,只是根据语境需要,选择合适的词)", null, "## (2)线段树的区间查询:\n\n(2.1)先给出一个粗略的证明(结合下图):", null, "", null, "", null, "", null, "(2.2)然后给出正式一点的证明:\n\n[L,R]分成的子区间由两部分组成:\n\n[L,R]一共被分成了", null, "个区间。", null, "n=3,4时,有很多组区间的分解可以达到最小上界。", null, "", null, "", null, "", null, "## (3)线段树的区间修改:\n\n注意:如果区间修改时不下推标记,那么PushUp函数中,必须考虑本节点的标记。\n而如果所有操作都下推标记,那么PushUp函数可以不考虑本节点的标记,因为本节点的标记一定已经被下推了(也就是对本节点无效了)\n\n## (4)线段树的存储结构:", null, "# 三:递归实现\n\n(0)定义:\n\n```#define maxn 100007 //元素总个数\n#define ls l,m,rt<<1\n#define rs m+1,r,rt<<1|1\nint A[maxn],n;//存原数组数据下标[1,n] ```\n\n(1)建树:\n\n```//PushUp函数更新节点信息 ,这里是求和\nvoid PushUp(int rt){Sum[rt]=Sum[rt<<1]+Sum[rt<<1|1];}\n//Build函数建树\nvoid Build(int l,int r,int rt){ //l,r表示当前节点区间,rt表示当前节点编号\nif(l==r) {//若到达叶节点\nSum[rt]=A[l];//储存数组值\nreturn;\n}\nint m=(l+r)>>1;\n//左右递归\nBuild(l,m,rt<<1);\nBuild(m+1,r,rt<<1|1);\n//更新信息\nPushUp(rt);\n}```\n\n(2)点修改:\n\n```void Update(int L,int C,int l,int r,int rt){//l,r表示当前节点区间,rt表示当前节点编号\nif(l==r){//到叶节点,修改\nSum[rt]+=C;\nreturn;\n}\nint m=(l+r)>>1;\n//根据条件判断往左子树调用还是往右\nif(L <= m) Update(L,C,l,m,rt<<1);\nelse Update(L,C,m+1,r,rt<<1|1);\nPushUp(rt);//子节点更新了,所以本节点也需要更新信息\n} ```\n\n(3)区间修改:\n\n```void Update(int L,int R,int C,int l,int r,int rt){//L,R表示操作区间,l,r表示当前节点区间,rt表示当前节点编号\nif(L <= l && r <= R){//如果本区间完全在操作区间[L,R]以内\nSum[rt]+=C*(r-l+1);//更新数字和,向上保持正确\nreturn ;\n}\nint m=(l+r)>>1;\nPushDown(rt,m-l+1,r-m);//下推标记\n//这里判断左右子树跟[L,R]有无交集,有交集才递归\nif(L <= m) Update(L,R,C,l,m,rt<<1);\nif(R > m) Update(L,R,C,m+1,r,rt<<1|1);\nPushUp(rt);//更新本节点信息\n} ```\n\n(4)区间查询:\n\n```void PushDown(int rt,int ln,int rn){\n//ln,rn为左子树,右子树的数字数量。\n//下推标记\n//清除本节点标记\n}\n}```\n\n```int Query(int L,int R,int l,int r,int rt){//L,R表示操作区间,l,r表示当前节点区间,rt表示当前节点编号\nif(L <= l && r <= R){\n//在区间内,直接返回\nreturn Sum[rt];\n}\nint m=(l+r)>>1;\n//下推标记,否则Sum可能不正确\nPushDown(rt,m-l+1,r-m);\n\n//累计答案\nint ANS=0;\nif(L <= m) ANS+=Query(L,R,l,m,rt<<1);\nif(R > m) ANS+=Query(L,R,m+1,r,rt<<1|1);\nreturn ANS;\n} ```\n\n(5)函数调用:\n\n```\n//建树\nBuild(1,n,1);\n//点修改\nUpdate(L,C,1,n,1);\n//区间修改\nUpdate(L,R,C,1,n,1);\n//区间查询\nint ANS=Query(L,R,1,n,1);```\n\n# 四:非递归原理\n\n## 点修改:", null, "【在上面的图片中,红色为原数组下标,黑色为存储下标】\n\n## 点修改下的区间查询:", null, "", null, "", null, "", null, "", null, "## 区间修改下的区间查询:", null, "# 五:非递归实现\n\n(0)定义\n\n```//\n#define maxn 100007\nint A[maxn],n,N;//原数组,n为原数组元素个数 ,N为扩充元素个数\nint Sum[maxn<<2];//区间和\n\n(1)建树:\n\n```//\nvoid Build(int n){\n//计算N的值\nN=1;while(N < n+2) N <<= 1;\n//更新叶节点\nfor(int i=1;i<=n;++i) Sum[N+i]=A[i];//原数组下标+N=存储下标\n//更新非叶节点\nfor(int i=N-1;i>0;--i){\n//更新所有非叶节点的统计信息\nSum[i]=Sum[i<<1]+Sum[i<<1|1];\n}\n} ```\n\n(2)点修改:\n\nA[L]+=C\n```//\nvoid Update(int L,int C){\nfor(int s=N+L;s;s>>=1){\nSum[s]+=C;\n}\n} ```\n\n(3)点修改下的区间查询:\n\ns和t分别代表之前的论述中的左右蓝色节点,其余的代码根据之前的论述应该很容易看懂了。\ns^t^1 在s和t的父亲相同时值为0,终止循环。\n\n```//\nint Query(int L,int R){\nint ANS=0;\nfor(int s=N+L-1,t=N+R+1;s^t^1;s>>=1,t>>=1){\nif(~s&1) ANS+=Sum[s^1];\nif( t&1) ANS+=Sum[t^1];\n}\nreturn ANS;\n} ```\n\n(4)区间修改:\n\nA[L..R]+=C\n```<span style=\"font-size:14px;\">//\nvoid Update(int L,int R,int C){\nint s,t,Ln=0,Rn=0,x=1;\n//Ln: s一路走来已经包含了几个数\n//Rn: t一路走来已经包含了几个数\n//x: 本层每个节点包含几个数\nfor(s=N+L-1,t=N+R+1;s^t^1;s>>=1,t>>=1,x<<=1){\n//更新Sum\nSum[s]+=C*Ln;\nSum[t]+=C*Rn;\n}\n//更新上层Sum\nfor(;s;s>>=1,t>>=1){\nSum[s]+=C*Ln;\nSum[t]+=C*Rn;\n}\n} </span>```\n\n(5)区间修改下的区间查询:\n\n```//\nint Query(int L,int R){\nint s,t,Ln=0,Rn=0,x=1;\nint ANS=0;\nfor(s=N+L-1,t=N+R+1;s^t^1;s>>=1,t>>=1,x<<=1){\n//根据标记更新\n//常规求和\nif(~s&1) ANS+=Sum[s^1],Ln+=x;\nif( t&1) ANS+=Sum[t^1],Rn+=x;\n}\n//处理上层标记\nfor(;s;s>>=1,t>>=1){\n}\nreturn ANS;\n}```\n\n# 六:线段树解题模型", null, "——–统计信息:统计节点代表的区间的信息,一般自下而上更新\n——–标记:对操作进行标记(在区间修改时需要),一般自上而下传递,或者不传递\n\n1.区间加法\n2.建树,点信息到区间信息的转换\n3.每种操作(包括查询,修改)对区间信息的调用,修改\n\n## (1):字符串哈希\n\n1.区间加法 :(PushUp函数,Pow[a]=K^a)\n2.点信息->区间信息:(叶节点上,区间只包含一个点,所以需要将点信息转换成区间信息)\n\n```//\n#define K 137\n#define maxn 100001\nchar str[maxn];\nint Pow[maxn];//K的各个次方\nstruct Node{\nint KeyL,KeyR;\nNode():KeyL(0),KeyR(0){}\nvoid init(){KeyL=KeyR=0;}\n}node[maxn<<2];\nvoid PushUp(int L,int R,int rt){\nnode[rt].KeyL=node[rt<<1].KeyL+node[rt<<1|1].KeyL*Pow[L];\nnode[rt].KeyR=node[rt<<1].KeyR*Pow[R]+node[rt<<1|1].KeyR;\n}```\n\n## (2):最长连续零\n\n1.区间加法:\n\n-(1):左子区间最长连续零\n-(2):右子区间最长连续零\n-(3):左右子区间拼起来,而在中间生成的连续零(可能长于两个子区间的最长连续零)\n\n–(1):左区间不是全零,那么等于左区间的左最长连续零\n–(2):左区间全零,那么等于左区间0的个数加上右区间的左最长连续零\n\n2.点信息->区间信息 :\n\n`//`\n\n#define maxn 200001 using namespace std; int L[maxn<<2];//从左开始连续零个数 int R[maxn<<2];//从右 int Max[maxn<<2];//区间最大连续零 bool Pure[maxn<<2];//是否全零 int M; void PushUp(int rt,int k){//更新rt节点的四个数据 k来选择两棵线段树 Pure[rt][k]=Pure[rt<<1][k]&&Pure[rt<<1|1][k]; Max[rt][k]=max(R[rt<<1][k]+L[rt<<1|1][k],max(Max[rt<<1][k],Max[rt<<1|1][k])); L[rt][k]=Pure[rt<<1][k]?L[rt<<1][k]+L[rt<<1|1][k]:L[rt<<1][k]; R[rt][k]=Pure[rt<<1|1][k]?R[rt<lt;<1|1][k]+R[rt<<1][k]:R[rt<<1|1][k]; }\n\n## (3):计数排序\n\n1.区间加法\n\n2.点信息->区间信息:把对应字符的数量设置成1,其余为0,排序标记为false。\n\n3.标记下推\n\n4.区间修改\n\n```//\nstruct Node{\nint d;//计数排序\nint D;//总数\nbool sorted;//是否排好序\nbool Inc;//是否升序\n};```\n\n## (4)总结:\n\n:将问题转换成点信息目标信息\n\n:将目标信息根据需要扩充成区间信息\n1.增加信息符合区间加法。\n2.增加标记支持区间操作。\n\n:代码中的主要模块:\n1.区间加法\n2.标记下推\n3.点信息->区间信息\n4.操作(各种操作,包括修改和查询)\n\n# 七:扫描线\n\nPOJ 1177 Picture:给定若干矩形求合并之后的图形周长    题解\nHDU 1255 覆盖的面积:给定平面上若干矩形,求出被这些矩形覆盖过至少两次的区域的面积.   题解\nHDU 3642 Get The Treasury:给定若干空间立方体,求重叠了3次或以上的体积(这个是扫描面,每个面再扫描线)题解\n\nPOJ 2482 Stars in your window : 给定一些星星的位置和亮度,求用W*H的矩形能够框住的星星亮度之和最大为多少。\n\n## 扫描线求重叠矩形面积:", null, "", null, "", null, "X1:首先遇到X1,将第一条线段加入线段树,由线段树统计得到线段长度为L1.\n\nX2:然后继续扫描到X2,此时要进行两个动作:\n1.计算面积,目前扫过的面积=L1*(X2-X1)\n2.更新线段。由于X2处仍然是入边,所以往线段树中又加了一条线段,加的这条线段可以参考3幅图中的第一幅。\n\nX3:继续扫描到X3,步骤同X2\n\nX4:扫描到X4有些不一样了。\n\n```//\nstruct LINE{\nint x;//横坐标\nint y1,y2;//矩形纵向线段的左右端点\nbool In;//标记是入边还是出边\nbool operator < (const Line &B)const{return x < B.x;}\n}Line[maxn]; ```\n\n```//\nint PreL=0;//前一个L值,刚开始是0,所以第一次计算时不会引入误差\nint X;//X值\nint ANS=0;//存累计面积\nint I=0;//线段的下标\n\nwhile(I < Ln){\n//先计算面积\nANS+=PreL*(Line[I].x-X);\nX=Line[I].x;//更新X值\n//对所有X相同的线段进行操作\nwhile(I < Ln && Line[I].x == X){\n//根据入边还是出边来选择加入线段还是移除线段\nif(Line[I].In) Cover(Line[I].y1,Line[I].y2-1,1,n,1);\nelse Uncover(Line[I].y1,Line[I].y2-1,1,n,1);\n++I;\n}\n}```\n\n## 需要解决的几个问题:\n\n(1):线段树进行线段操作时,每个点的含义(比如为什么Cover函数中,y2后面要-1)。\n(2):线段树如何维护扫描线过程中的覆盖线段长度。\n(3):线段树如何维护扫描线过程中线段的数量。\n\n### (1):线段树中点的含义\n\n```//\nint Rank[maxn],Rn;\nvoid SetRank(){//调用前,所有y值被无序存入Rank数组,下标为[1..Rn]\nint I=1;\n//第一步排序\nsort(Rank+1,Rank+1+Rn);\n//第二步去除重复值\nfor(int i=2;i<=Rn;++i) if(Rank[i]!=Rank[i-1]) Rank[++I]=Rank[i];\nRn=I;\n//此时,所有y值被从小到大无重复地存入Rank数组,下标为[1..Rn]\n}\nint GetRank(int x){//给定x,求x的下标\n//二分法求下标\nint L=1,R=Rn,M;//[L,R] first >=x\nwhile(L!=R){\nM=(L+R)>>1;\nif(Rank[M]<x) L=M+1;\nelse R=M;\n}\nreturn L;\n}```\n\n```//\nif(Line[I].In) Cover(GetRank(Line[I].y1),GetRank(Line[I].y2)-1,1,n,1);\nelse Uncover(GetRank(Line[I].y1),GetRank(Line[I].y2)-1,1,n,1);```\n\n### (2):如何维护覆盖线段长度\n\n```//\nstruct Node{\nint Cover;//区间整体被覆盖的次数\nint L;//Length : 所代表的区间总长度\nint CL;//Cover Length :实际覆盖长度\nNode operator +(const Node &B)const{\nNode X;\nX.Cover=0;//因为若上级的Cover不为0,不会调用子区间加法函数\nX.L=L+B.L;\nX.CL=CL+B.CL;\nreturn X;\n}\n}K[maxn<<2];```\n\n```//\nNode Query(int L,int R,int l,int r,int rt){\nif(L <= l && r <= R){\nreturn K[rt];\n}\nint m=(l+r)>>1;\nNode LANS,RANS;\nint X=0;\nif(L <= m) LANS=Query(L,R,ls),X+=1;\nif(R > m) RANS=Query(L,R,rs),X+=2;\nif(X==1) return LANS;\nif(X==2) return RANS;\nreturn LANS+RANS;\n}```\n\n```//\nstruct Nodes{\nint C;//Cover\nint CL;//CoverLength[0~3]\n//CL[i]表示被覆盖了大于等于i次的线段长度,CL其实就是线段总长\n}ST[maxn<<2];\nvoid PushUp(int rt){\nfor(int i=1;i<=3;++i){\nif(ST[rt].C < i) ST[rt].CL[i]=ST[rt<<1].CL[i-ST[rt].C]+ST[rt<<1|1].CL[i-ST[rt].C];\nelse ST[rt].CL[i]=ST[rt].CL;\n}\n} ```\n\n### (3):如何维护扫描线过程中线段的数量\n\n```//\nstruct Node{\nint cover;//完全覆盖层数\nint lines;//分成多少个线段\nbool L,R;//左右端点是否被覆盖\nNode operator +(const Node &B){//连续区间的合并\nNode C;\nC.cover=0;\nC.lines=lines+B.lines-(R&&B.L);\nC.L=L;C.R=B.R;\nreturn C;\n}\n}K[maxn<<2]; ```\n\n## 扫描线求重叠矩形周长:", null, "```//\nstruct Node{\nint cover;//完全覆盖层数\nint lines;//分成多少个线段\nbool L,R;//左右端点是否被覆盖\nint CoverLength;//覆盖长度\nint Length;//总长度\nNode(){}\nNode(int cover,int lines,bool L,bool R,int CoverLength):cover(cover),lines(lines),L(L),R(R),CoverLength(CoverLength){}\nNode operator +(const Node &B){//连续区间的合并\nNode C;\nC.cover=0;\nC.lines=lines+B.lines-(R&&B.L);\nC.CoverLength=CoverLength+B.CoverLength;\nC.L=L;C.R=B.R;\nC.Length=Length+B.Length;\nreturn C;\n}\n}K[maxn<<2];\nvoid PushUp(int rt){//更新非叶节点\nif(K[rt].cover){\nK[rt].CoverLength=K[rt].Length;\nK[rt].L=K[rt].R=K[rt].lines=1;\n}\nelse{\nK[rt]=K[rt<<1]+K[rt<<1|1];\n}\n} ```\n\n``` int PreX=L.x;//前X坐标\nint ANS=0;//目前累计答案\nint PreLength=0;//前线段总长\nint PreLines=0;//前线段数量\nBuild(1,20001,1);\nfor(int i=0;i<nL;++i){\n//操作\nif(L[i].c) Cover(L[i].y1,L[i].y2-1,1,20001,1);\nelse Uncover(L[i].y1,L[i].y2-1,1,20001,1);\n//更新横向的边界\nANS+=2*PreLines*(L[i].x-PreX);\nPreLines=K.lines;\nPreX=L[i].x;\n//更新纵向边界\nANS+=abs(K.CoverLength-PreLength);\nPreLength=K.CoverLength;\n}\n//输出答案\nprintf(\"%d\\n\",ANS); ```\n\n# 八:可持久化 (主席树)\n\n```//主席树\nint L[maxnn],R[maxnn],Sum[maxnn],T[maxn],TP;//左右子树,总和,树根,指针\nvoid Add(int &rt,int l,int r,int x){//建立新树,l,r是区间, x是新加入的数字的排名\n++TP;L[TP]=L[rt];R[TP]=R[rt];Sum[TP]=Sum[rt]+1;rt=TP;//复制&新建\nif(l==r) return;\nint m=(l+r)>>1;\n}\nint Search(int TL,int TR,int l,int r,int k){//区间查询第k大\nif(l==r) return l;//返回第k大的下标\nint m=(l+r)>>1;\nif(Sum[L[TR]]-Sum[L[TL]]>=k) return Search(L[TL],L[TR],l,m,k);\nelse return Search(R[TL],R[TR],m+1,r,k-Sum[L[TR]]+Sum[L[TL]]);\n} ```\n\nL,R是伪指针,指向左右子节点。\n\n1.每个节点的Sum值为0\n2.每个非叶节点的左右子节点的Sum值也是0\n\n—————————–     补充     ————————————-\n\n# 九:练习题\n\n## 适合非递归线段树的题目:\n\nCodeforces 612D The Union of k-Segments :  题解\n\nURAL 1846 GCD2010 :  题解\n\nCodeforces 12D Ball :   题解\n\nCodeforces 19D Points : 题解\n\n2.remove x y  :删除(x,y)这个点\n\n3.find x y         :找到在(x,y)这点右上方的x最小的点,若x相同找y最小的点,输出这点坐标,若没有,则输出-1.\n\nCodeforces 633E Startup Funding : 题解\n\n## 扫描线题目:\n\nPOJ 1177 Picture:给定若干矩形求合并之后的图形周长    题解\nHDU 1255 覆盖的面积:给定平面上若干矩形,求出被这些矩形覆盖过至少两次的区域的面积.   题解\nHDU 3642 Get The Treasury:给定若干空间立方体,求重叠了3次或以上的体积(这个是扫描面,每个面再扫描线)题解\nPOJ 2482 Stars in your window : 给定一些星星的位置和亮度,求用W*H的矩形能够框住的星星亮度之和最大为多少。  题解\n\n## 递归线段树题目:\n\nCodeforces 558E A Simple Task  题解\n\nCodeforces 527C Glass Carving  :  题解\n\nURAL1989 Subpalindromes    题解\n\n1:改变某个字符。\n2:判断某个子串是否构成回文串。\n\nHDU 4288 Coder :  题解\n题意:对一个集合进行插入与删除操作。要求询问某个时刻,集合中的元素从小到大排序之后,序号%5 ==3 的元素值之和。\n\nHDU 2795 BillBoard : 题解\n\nCodeforces 374D Inna and Sequence题解\n\nCodeforces 482B Interesting Array:  题解\n\nCodeforces 474E Pillar (线段树+动态规划):  题解\n\nPOJ 2777  Count Color :   题解\n\n30种颜色用int的最低30位来存,然后线段树解决。\n\nURAL 1019 Line Painting: 线段树的区间合并  题解\n\nCodeforces 633H Fibonacci-ish II  :题解\n\n## 树套树题目:\n\nZOJ 2112 Dynamic Rankings 动态区间第k大  题解\n\nCodeforces 605D Board Game :  题解\n\nCodeforces 19D Points : 题解\n\n2.remove x y  :删除(x,y)这个点\n\n3.find x y         :找到在(x,y)这点右上方的x最小的点,若x相同找y最小的点,输出这点坐标,若没有,则输出-1.\n\ntonemy\n+ 关注" ]
[ null, "https://yqfile.alicdn.com/dfb80b22c483698f031f2e5859e9335b.png", null, "https://yq.aliyun.com/articles/544048", null, "http://img.blog.csdn.net/20150908231214395", null, "http://img.blog.csdn.net/20150909172342229", null, "http://img.blog.csdn.net/20150909172350036", null, "http://img.blog.csdn.net/20150909172354161", null, "http://img.blog.csdn.net/20150909172357585", null, "http://img.blog.csdn.net/20150909174934998", null, "http://img.blog.csdn.net/20150909175521708", null, "http://img.blog.csdn.net/20150909002020582", null, "http://img.blog.csdn.net/20150909002026149", null, "http://img.blog.csdn.net/20150909002029983", null, "http://img.blog.csdn.net/20150909002033412", null, "http://img.blog.csdn.net/20150909010827440", null, "http://img.blog.csdn.net/20150909220210622", null, "http://img.blog.csdn.net/20150909222733861", null, "http://img.blog.csdn.net/20150909222737285", null, "http://img.blog.csdn.net/20150909222740550", null, "http://img.blog.csdn.net/20150909222744247", null, "http://img.blog.csdn.net/20150909220210622", null, "http://img.blog.csdn.net/20150909222740550", null, "http://img.blog.csdn.net/20150915173357612", null, "http://img.blog.csdn.net/20150910075556358", null, "http://img.blog.csdn.net/20150910075603559", null, "http://img.blog.csdn.net/20150910075607860", null, "http://img.blog.csdn.net/20150910134955319", null ]
{"ft_lang_label":"__label__zh","ft_lang_prob":0.5694051,"math_prob":0.996866,"size":9331,"snap":"2020-34-2020-40","text_gpt3_token_len":5375,"char_repetition_ratio":0.10474965,"word_repetition_ratio":0.09386282,"special_character_ratio":0.3852749,"punctuation_ratio":0.21756648,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99669117,"pos_list":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52],"im_url_duplicate_count":[null,null,null,1,null,4,null,4,null,4,null,4,null,4,null,4,null,4,null,4,null,4,null,4,null,4,null,4,null,8,null,4,null,4,null,8,null,4,null,8,null,8,null,4,null,4,null,4,null,4,null,4,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-10-01T00:47:56Z\",\"WARC-Record-ID\":\"<urn:uuid:ae3747ab-713d-4cc6-8ed3-a8849a23f59e>\",\"Content-Length\":\"147969\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:06375a2d-db0d-443e-8dfc-05eac75a314d>\",\"WARC-Concurrent-To\":\"<urn:uuid:d967afa4-e31a-498d-a1a0-6051c7260e4c>\",\"WARC-IP-Address\":\"106.15.83.34\",\"WARC-Target-URI\":\"https://yq.aliyun.com/articles/544048\",\"WARC-Payload-Digest\":\"sha1:4QSENM66BK4CAN3JX7SGYW7C3MCQPQ6E\",\"WARC-Block-Digest\":\"sha1:W4D4DYUMU2NZLAHABJ5XZEEMUTXKSCEZ\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-40/CC-MAIN-2020-40_segments_1600402130531.89_warc_CC-MAIN-20200930235415-20201001025415-00751.warc.gz\"}"}
https://freeyourmindtravel.com/tourist/why-are-positive-forces-considered-repulsive-and-negative-forces-considered-attractive.html
[ "Why are positive forces considered repulsive and negative forces considered attractive?\n\nContents\n\nCan a positive force be attractive and repulsive?\n\nIf the particles are both positively or negatively charged, the force is repulsive; if they are of opposite charge, it is attractive. … Unlike the gravitational force however, the Coulomb (or electric) force may be either attractive or repulsive, depending on the signs of the charges and .\n\nIs a positive force can be both attractive and repulsive in nature?\n\nRegarding force (c)A positive force can be both attractive and repulsive in nature. Explanation: The force is repulsive if the particles are both positively or negatively charged; it is attractive if they are of opposite charge.\n\nIs a negative force repulsive or attractive?\n\nWhen the charges have opposite sign, the force is attractive (negative F), while if both charges have the same sign, the force is repulsive (positive F).\n\nIs positive force attractive?\n\nIf both the interacting particles are positively or negatively charged, then the force is repulsive. If both the interacting particles are of opposite charges then the force is attractive in nature. Coulomb’s law describes this nature of electric charges.\n\nIMPORTANT:  How long does it take for F1 visa to be processed?\n\nWhy are attractive forces negative?\n\nThat’s all right,but I want to know whenever we use a work done by an attraction force we use a negative sign,viz: the gravitational potential.It is written in books that the gravitational potential is negative because the work to bring an object from infinity to the gravitational field is done by the gravitational …\n\nIs positive force always repulsive?\n\nIf the product q1q2 is positive, the force between the two charges is repulsive; if the product is negative, the force between them is attractive.\n\nWhich of the following forces are both attractive and repulsive in nature?\n\nBoth gravitational and magnetic forces are attractive and repulsive in nature.\n\nHow do you know if a force is positive or negative?\n\nWork can be either positive or negative: if the force has a component in the same direction as the displacement of the object, the force is doing positive work. If the force has a component in the direction opposite to the displacement, the force does negative work.\n\nIs negative force attractive in nature?\n\nLike charges repel and unlike charges attract. Coulomb’s law describes a force of infinite range which obeys the inverse square law, and is of the same form as the gravity force. … A negative force implies an attractive force. The force is directed along the line joining the two charges.\n\nCan electric force be attractive and repulsive?\n\nComparing Electrical and Gravitational Forces\n\nBoth equations show an inverse square relationship between force and separation distance. … Second, gravitational forces are only attractive; electrical forces can be either attractive or repulsive.\n\nIMPORTANT:  Best answer: What kind of personality attracts others?" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.9249382,"math_prob":0.9607468,"size":2755,"snap":"2022-05-2022-21","text_gpt3_token_len":535,"char_repetition_ratio":0.23082516,"word_repetition_ratio":0.07936508,"special_character_ratio":0.18620689,"punctuation_ratio":0.10420842,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99062747,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-01-27T17:51:27Z\",\"WARC-Record-ID\":\"<urn:uuid:9414e802-d192-411c-95db-adea8c900cf6>\",\"Content-Length\":\"71516\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:526d2655-d221-4b22-aa0f-75f2b4ca2fce>\",\"WARC-Concurrent-To\":\"<urn:uuid:4f08e1b2-5070-45be-a5ba-a860857ea02c>\",\"WARC-IP-Address\":\"82.146.60.64\",\"WARC-Target-URI\":\"https://freeyourmindtravel.com/tourist/why-are-positive-forces-considered-repulsive-and-negative-forces-considered-attractive.html\",\"WARC-Payload-Digest\":\"sha1:YIWBRC3OOF5NI7EKWLHHXUMOG642BKJ7\",\"WARC-Block-Digest\":\"sha1:R6FUXSY2I6IWVTXIISZG4Z2O5MEABGCV\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-05/CC-MAIN-2022-05_segments_1642320305277.88_warc_CC-MAIN-20220127163150-20220127193150-00108.warc.gz\"}"}
https://numberworld.info/root-of-8378074
[ "# Root of 8378074\n\n#### [Root of eight million three hundred seventy-eight thousand seventy-four]\n\nsquare root\n2894.4903\ncube root\n203.1022\nfourth root\n53.8005\nfifth root\n24.2454\nIn mathematics extracting a root is declared as the determination of the unknown \"x\" in the following equation $y=x^n$ The outcome of the extraction of the root is considered as a so-called root. In the case of \"n equals 2\", one talks about a square root or sometimes a second root also, another possibility could be that n = 3 then one would consider it a cube root or simply third root. Considering n beeing greater than 3, the root is declared as the fourth root, fifth root and so on.\nIn maths, the square root of 8378074 is represented as this: $$\\sqrt[]{8378074}=2894.4902832796$$\nMoreover it is legit to write every root down as a power: $$\\sqrt[n]{x}=x^\\frac{1}{n}$$\nThe square root of 8378074 is 2894.4902832796. The cube root of 8378074 is 203.10224814991. The fourth root of 8378074 is 53.800467314695 and the fifth root is 24.245371243836.\n\nLook Up" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.77513456,"math_prob":0.9952801,"size":555,"snap":"2021-43-2021-49","text_gpt3_token_len":188,"char_repetition_ratio":0.18330309,"word_repetition_ratio":0.025974026,"special_character_ratio":0.4774775,"punctuation_ratio":0.13043478,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9994252,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2021-12-06T18:30:41Z\",\"WARC-Record-ID\":\"<urn:uuid:4236e9c3-8793-4192-90e4-25069ac05257>\",\"Content-Length\":\"7941\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:c2dd1635-f398-4ea1-882a-99855e67f419>\",\"WARC-Concurrent-To\":\"<urn:uuid:6a053a7f-577f-42bb-9c25-b7503ff74e62>\",\"WARC-IP-Address\":\"176.9.140.13\",\"WARC-Target-URI\":\"https://numberworld.info/root-of-8378074\",\"WARC-Payload-Digest\":\"sha1:DO76ANDUD7EVKM5JQ5GA2GV3LUVKANDQ\",\"WARC-Block-Digest\":\"sha1:SXTYKOXSAFKD4XUKIFZZHAMVUNRQFUZY\",\"WARC-Identified-Payload-Type\":\"application/xhtml+xml\",\"warc_filename\":\"/cc_download/warc_2021/CC-MAIN-2021-49/CC-MAIN-2021-49_segments_1637964363309.86_warc_CC-MAIN-20211206163944-20211206193944-00538.warc.gz\"}"}
https://howlingpixel.com/i-en/Maximum_sustainable_yield
[ "# Maximum sustainable yield\n\nIn population ecology and economics, maximum sustainable yield or MSY is theoretically, the largest yield (or catch) that can be taken from a species' stock over an indefinite period. Fundamental to the notion of sustainable harvest, the concept of MSY aims to maintain the population size at the point of maximum growth rate by harvesting the individuals that would normally be added to the population, allowing the population to continue to be productive indefinitely. Under the assumption of logistic growth, resource limitation does not constrain individuals' reproductive rates when populations are small, but because there are few individuals, the overall yield is small. At intermediate population densities, also represented by half the carrying capacity, individuals are able to breed to their maximum rate. At this point, called the maximum sustainable yield, there is a surplus of individuals that can be harvested because growth of the population is at its maximum point due to the large number of reproducing individuals. Above this point, density dependent factors increasingly limit breeding until the population reaches carrying capacity. At this point, there are no surplus individuals to be harvested and yield drops to zero. The maximum sustainable yield is usually higher than the optimum sustainable yield and maximum economic yield.\n\nMSY is extensively used for fisheries management. Unlike the logistic (Schaefer) model, MSY has been refined in most modern fisheries models and occurs at around 30% of the unexploited population size. This fraction differs among populations depending on the life history of the species and the age-specific selectivity of the fishing method.\n\nHowever, the approach has been widely criticized as ignoring several key factors involved in fisheries management and has led to the devastating collapse of many fisheries. As a simple calculation, it ignores the size and age of the animal being taken, its reproductive status, and it focuses solely on the species in question, ignoring the damage to the ecosystem caused by the designated level of exploitation and the issue of bycatch. Among conservation biologists it is widely regarded as dangerous and misused.\n\n## History\n\nThe concept of MSY as a fisheries management strategy developed in Belmar, New Jersey, in the early 1930s. It increased in popularity in the 1950s with the advent of surplus-production models with explicitly estimate MSY. As an apparently simple and logical management goal, combined with the lack of other simple management goals of the time, MSY was adopted as the primary management goal by several international organizations (e.g., IWC, IATTC, ICCAT, ICNAF), and individual countries.\n\nBetween 1949 and 1955, the U.S. maneuvered to have MSY declared the goal of international fisheries management (Johnson 2007). The international MSY treaty that was eventually adopted in 1955 gave foreign fleets the right to fish off any coast. Nations that wanted to exclude foreign boats had to first prove that its fish were overfished.\n\nAs experience was gained with the model, it became apparent to some researchers that it lacked the capability to deal with the real world operational complexities and the influence of trophic and other interactions. In 1977, Peter Larkin wrote its epitaph, challenging the goal of maximum sustained yield on several grounds: It put populations at too much risk; it did not account for spatial variability in productivity; it did not account for species other than the focus of the fishery; it considered only the benefits, not the costs, of fishing; and it was sensitive to political pressure. In fact, none of these criticisms was aimed at sustainability as a goal. The first one noted that seeking the absolute MSY with uncertain parameters was risky. The rest point out that the goal of MSY was not holistic; it left out too many relevant features.\n\nSome managers began to use more conservative quota recommendations, but the influence of the MSY model for fisheries management still prevailed. Even while the scientific community was beginning to question the appropriateness and effectiveness of MSY as a management goal, it was incorporated into the 1982 United Nations Convention for the Law of the Sea, thus ensuring its integration into national and international fisheries acts and laws. According to Walters and Maguire, an ‘‘institutional juggernaut had been set in motion’’, climaxing in the early 1990s with the collapse of northern cod.\n\n## Modelling MSY\n\n### Population growth\n\nThe key assumption behind all sustainable harvesting models such as MSY is that populations of organisms grow and replace themselves – that is, they are renewable resources. Additionally it is assumed that because the growth rates, survival rates, and reproductive rates increase when harvesting reduces population density, they produce a surplus of biomass that can be harvested. Otherwise, sustainable harvest would not be possible.\n\nAnother assumption of renewable resource harvesting is that populations of organisms do not continue to grow indefinitely; they reach an equilibrium population size, which occurs when the number of individuals matches the resources available to the population (i.e., assume classic logistic growth). At this equilibrium population size, called the carrying capacity, the population remains at a stable size.\n\nFigure 1\n\nThe logistic model (or logistic function) is a function that is used to describe bounded population growth under the previous two assumptions. The logistic function is bounded at both extremes: when there are not individuals to reproduce, and when there is an equilibrium number of individuals (i.e., at carrying capacity). Under the logistic model, population growth rate between these two limits is most often assumed to be sigmoidal (Figure 1). There is scientific evidence that some populations do grow in a logistic fashion towards a stable equilibrium – a commonly cited example is the logistic growth of yeast.\n\nThe equation describing logistic growth is:\n\n$N_{t}={\\frac {K}{1+{\\frac {K-N_{0}}{N_{0}}}e^{-rt}}}$", null, "(equation 1.1)\n\nThe parameter values are:\n\n$N_{t}$", null, "=The population size at time t\n$K$", null, "=The carrying capacity of the population\n$N_{0}$", null, "= The population size at time zero\n$r$", null, "= the intrinsic rate of population increase (the rate at which the population grows when it is very small)\n\nFrom the logistic function, the population size at any point can be calculated as long as $r$", null, ", $K$", null, ", and $N_{0}$", null, "are known.\n\nFigure 2\n\nDifferentiating equation 1.1 give an expression for how the rate of population increases as N increases. At first, the population growth rate is fast, but it begins to slow as the population grows until it levels off to the maximum growth rate, after which it begins to decrease (figure 2).\n\nThe equation for figure 2 is the differential of equation 1.1 (Verhulst's 1838 growth model):\n\n${\\frac {dN}{dt}}=rN\\left(1-{\\frac {N}{K}}\\right)$", null, "(equation 1.2)\n\n${\\frac {dN}{dt}}$", null, "can be understood as the change in population (N) with respect to a change in time (t). Equation 1.2 is the usual way in which logistic growth is represented mathematically and has several important features. First, at very low population sizes, the value of ${\\frac {N}{K}}$", null, "is small, so the population growth rate is approximately equal to $rN$", null, ", meaning the population is growing exponentially at a rate r (the intrinsic rate of population increase). Despite this, the population growth rate is very low (low values on the y-axis of figure 2) because, even though each individual is reproducing at a high rate, there are few reproducing individuals present. Conversely, when the population is large the value of ${\\frac {N}{K}}$", null, "approaches 1 effectively reducing the terms inside the brackets of equation 1.2 to zero. The effect is that the population growth rate is again very low, because either each individual is hardly reproducing or mortality rates are high. As a result of these two extremes, the population growth rate is maximum at an intermediate population or half the carrying capacity ($N={\\frac {K}{2}}$", null, ").\n\n### MSY model\n\nFigure 3\n\nThe simplest way to model harvesting is to modify the logistic equation so that a certain number of individuals is continuously removed:\n\n${\\frac {dN}{dt}}=rN\\left(1-{\\frac {N}{K}}\\right)-H$", null, "(equation 1.3)\n\nWhere H represents the number of individuals being removed from the population – that is, the harvesting rate. When H is constant, the population will be at equilibrium when the number of individuals being removed is equal to the population growth rate (figure 3). The equilibrium population size under a particular harvesting regime can be found when the population is not growing – that is, when ${\\frac {dN}{dt}}=0$", null, ". This occurs when the population growth rate is the same as the harvest rate:\n\n$rN\\left(1-{\\frac {N}{K}}\\right)=H$", null, "Figure 3 shows how growth rate varies with population density. For low densities (far from carrying capacity), there is little addition (or \"recruitment\") to the population, simply because there are few organisms to give birth. At high densities, though, there is intense competition for resources, and growth rate is again low because the death rate is high. In between these two extremes, the population growth rate rises to a maximum value ($N_{MSY}$", null, "). This maximum point represents the maximum number of individuals that can be added to a population by natural processes. If more individuals than this are removed from the population, the population is at risk for decline to extinction. The maximum number that can be harvested in a sustainable manner, called the maximum sustainable yield, is given by this maximum point.\n\nFigure 3 also shows several possible values for the harvesting rate, H. At $H_{1}$", null, ", there are two possible population equilibrium points: a low population size ($N_{a}$", null, ") and a high one ($N_{b}$", null, "). At $H_{2}$", null, ", a slightly higher harvest rate, however there is only one equilibrium point (at $N_{MSY}$", null, "), which is the population size that produces the maximum growth rate. With logistic growth, this point, called the maximum sustainable yield, is where the population size is half the carrying capacity (or $N={\\frac {K}{2}}$", null, "). The maximum sustainable yield is the largest yield that can be taken from a population at equilibrium. In figure 3, if $H$", null, "is higher than $H_{2}$", null, ", the harvesting would exceed the population's capacity to replace itself at any population size ($H_{3}$", null, "in figure 3). Because harvesting rate is higher than the population growth rate at all values of $N$", null, ", this rate of harvesting is not sustainable.\n\nAn important feature of the MSY model is how harvested populations respond to environmental fluctuations or illegal offtake. Consider a population at $N_{b}$", null, "harvested at a constant harvest level $H_{1}$", null, ". If the population falls (due to a bad winter or illegal harvest) this will ease density-dependent population regulation and increase yield, moving the population back to $N_{b}$", null, ", a stable equilibrium. In this case, a negative feedback loop creates stability. The lower equilibrium point for the constant harvest level $H_{1}$", null, "is not stable however; a population crash or illegal harvesting will decrease population yield farther below the current harvest level, creating a positive feedback loop leading to extinction. Harvesting at $N_{MSY}$", null, "is also potentially unstable. A small decrease in the population can lead to a positive feedback loop and extinction if the harvesting regime ($H_{2}$", null, ") is not reduced. Thus, some consider harvesting at MSY to be unsafe on ecological and economic grounds. The MSY model itself can be modified to harvest a certain percentage of the population or with constant effort constraints rather than an actual number, thereby avoiding some of its instabilities.\n\nThe MSY equilibrium point is semi-stable – a small increase in population size is compensated for, a small decrease to extinction if H is not decreased. Harvesting at MSY is therefore dangerous because it is on a knife-edge – any small population decline leads to a positive feedback, with the population declining rapidly to extinction if the number of harvested stays the same.\n\nThe formula for maximum sustained harvest ($H$", null, ") is one-fourth the maximum population or carrying capacity ($K$", null, ") times the intrinsic rate of growth ($r$", null, ").\n\n$H={\\frac {Kr}{4}}$", null, "### For demographically structured populations\n\nThe principle of MSY often holds for age-structured populations as well. The calculations can be more complicated, and the results often depend on whether density dependence occurs in the larval stage (often modeled as density dependent reproduction) and/or other life stages. It has been shown that if density dependence only acts on larva, then there is an optimal life stage (size or age class) to harvest, with no harvest of all other life stages. Hence the optimal strategy is to harvest this most valuable life-stage at MSY. However, in age and stage-structured models, a constant MSY does not always exist. In such cases, cyclic harvest is optimal where the yield and resource fluctuate in size, through time. In addition, environmental stochasticity interacts with demographically structured populations in fundamentally different ways than for unstructured populations when determining optimal harvest. In fact, the optimal biomass to be left in the ocean, when fished at MSY, can be either higher or lower than in analogous deterministic models, depending on the details of the density dependent recruitment function, if stage-structure is also included in the model.\n\n### Implications of MSY model\n\nStarting to harvest a previously unharvested population will always lead to a decrease in the population size. That is, it is impossible for a harvested population to remain at its original carrying capacity. Instead, the population will either stabilize at a new lower equilibrium size or, if the harvesting rate is too high, decline to zero.\n\nThe reason why populations can be sustainably harvested is that they exhibit a density-dependent response. This means that at any population size below K, the population is producing a surplus yield that is available for harvesting without reducing population size. Density dependence is the regulator process that allows the population to return to equilibrium after a perturbation. The logistic equation assumes that density dependence takes the form of negative feedback.\n\nIf a constant number of individuals is harvested from a population at a level greater than the MSY, the population will decline to extinction. Harvesting below the MSY level leads to a stable equilibrium population if the starting population is above the unstable equilibrium population size.\n\n### Uses of MSY\n\nMSY has been especially influential in the management of renewable biological resources such as commercially important fish and wildlife. In fisheries terms, maximum sustainable yield (MSY) is the largest average catch that can be captured from a stock under existing environmental conditions. MSY aims at a balance between too much and too little harvest to keep the population at some intermediate abundance with a maximum replacement rate.\n\nRelating to MSY, the maximum economic yield (MEY) is the level of catch that provides the maximum net economic benefits or profits to society. Like optimum sustainable yield, MEY is usually less than MSY.\n\n### Limitations of MSY approach\n\nAlthough it is widely practiced by state and federal government agencies regulating wildlife, forests, and fishing, MSY has come under heavy criticism by ecologists and others from both theoretical and practical reasons. The concept of maximum sustainable yield is not always easy to apply in practice. Estimation problems arise due to poor assumptions in some models and lack of reliability of the data. Biologists, for example, do not always have enough data to make a clear determination of the population's size and growth rate. Calculating the point at which a population begins to slow from competition is also very difficult. The concept of MSY also tends to treat all individuals in the population as identical, thereby ignoring all aspects of population structure such as size or age classes and their differential rates of growth, survival, and reproduction.\n\nAs a management goal, the static interpretation of MSY (i.e., MSY as a fixed catch that can be taken year after year) is generally not appropriate because it ignores the fact that fish populations undergo natural fluctuations (i.e., MSY treats the environment as unvarying) in abundance and will usually ultimately become severely depleted under a constant-catch strategy. Thus, most fisheries scientists now interpret MSY in a more dynamic sense as the maximum average yield (MAY) obtained by applying a specific harvesting strategy to a fluctuating resource. Or as an optimal \"escapement strategy\", where escapement means the amount of fish that must remain in the ocean [rather than the amount of fish that can be harvested]. An escapement strategy is often the optimal strategy for maximizing expected yield of a harvested, stochastically fluctuating population.\n\nHowever, the limitations of MSY, does not mean it performs worse than humans using their best intuitive judgment. Experiments using students in natural resource management classes suggest that people using their past experience, intuition, and best judgement to manage a fishery generate far less long term yield compared to a computer using an MSY calculation, even when that calculation comes from incorrect population dynamic models.\n\nFor a more contemporary description of MSY and its calculation see \n\n#### Orange roughy\n\nAn example of errors in estimating the population dynamics of a species occurred within the New Zealand Orange roughy fishery. Early quotas were based on an assumption that the orange roughy had a fairly short lifespan and bred relatively quickly. However, it was later discovered that the orange roughy lived a long time and had bred slowly (~30 years). By this stage stocks had been largely depleted.\n\n## Overfishing\n\nAll around the world, from the arctic to the tropics, there is a crisis in the world's fisheries. Until fairly recently it was assumed that our marine resources were limitless.\n\nIn recent years however, an accelerating decline has been observed in the productivity of many important fisheries. Fisheries which have been devastated in recent times include (but are not limited to) the great whale fisheries, the Grand Bank fisheries of the western Atlantic, and the Peruvian anchovy fishery. Recent assessments by the United Nations Food and Agriculture Organization (FAO) of the state of the world's fisheries indicate a levelling off of landings in the 1990s, at about 100 million tons.\n\nIn addition, the composition of global catches has changed. As fishers deplete larger, long-lived predatory fish species such as cod, tuna, shark, and snapper, they move down to the next level – to species that tend to be smaller, shorter-lived, and less valuable.\n\nOverfishing is a classic example of the tragedy of the commons.\n\n## Optimum sustainable yield\n\nIn population ecology and economics, optimum sustainable yield is the level of effort (LOE) that maximizes the difference between total revenue and total cost. Or, where marginal revenue equals marginal cost. This level of effort maximizes the economic profit, or rent, of the resource being utilized. It usually corresponds to an effort level lower than that of maximum sustainable yield. In environmental science, optimum sustainable yield is the largest economical yield of a renewable resource achievable over a long time period without decreasing the ability of the population or its environment to support the continuation of this level of yield." ]
[ null, "https://wikimedia.org/api/rest_v1/media/math/render/svg/b9b4df4d8fe10090d9cb498d63722e68c7805a64", null, "https://wikimedia.org/api/rest_v1/media/math/render/svg/b930a180af3138b8cf9c3e6674b5713bf81ef295", null, "https://wikimedia.org/api/rest_v1/media/math/render/svg/2b76fce82a62ed5461908f0dc8f037de4e3686b0", null, "https://wikimedia.org/api/rest_v1/media/math/render/svg/5b6328fbe0cded37216c90735c89ee188be26a30", null, "https://wikimedia.org/api/rest_v1/media/math/render/svg/0d1ecb613aa2984f0576f70f86650b7c2a132538", null, "https://wikimedia.org/api/rest_v1/media/math/render/svg/0d1ecb613aa2984f0576f70f86650b7c2a132538", null, "https://wikimedia.org/api/rest_v1/media/math/render/svg/2b76fce82a62ed5461908f0dc8f037de4e3686b0", null, "https://wikimedia.org/api/rest_v1/media/math/render/svg/5b6328fbe0cded37216c90735c89ee188be26a30", null, "https://wikimedia.org/api/rest_v1/media/math/render/svg/8ecdd930969407c6b71b1e6bed468dd7a7554730", null, "https://wikimedia.org/api/rest_v1/media/math/render/svg/5fe675c7133402404eeece5085efa035c3663580", null, "https://wikimedia.org/api/rest_v1/media/math/render/svg/ce184075563613091428270105e2081573f98e3f", null, "https://wikimedia.org/api/rest_v1/media/math/render/svg/9eb99bf85f623ee5a27c969cab5b673df9ba1f9d", null, "https://wikimedia.org/api/rest_v1/media/math/render/svg/ce184075563613091428270105e2081573f98e3f", null, "https://wikimedia.org/api/rest_v1/media/math/render/svg/2fa844757cb6ae0781df968947894936ec706cc6", null, "https://wikimedia.org/api/rest_v1/media/math/render/svg/d47fe40525bd38bc9142bc3bcce203b9bbe5df25", null, "https://wikimedia.org/api/rest_v1/media/math/render/svg/6d7678e9c7fe2d497be5cf8b5dc33bc51ddc6255", null, "https://wikimedia.org/api/rest_v1/media/math/render/svg/a30389dd5349501eb484d34f1a6c6aa61f53888d", null, "https://wikimedia.org/api/rest_v1/media/math/render/svg/0790f6c9af33392f2c903e1becf5adf62401c102", null, "https://wikimedia.org/api/rest_v1/media/math/render/svg/4d4d9a872a55b209f2eb7cc23a71e5e1541bd1f4", null, "https://wikimedia.org/api/rest_v1/media/math/render/svg/51e35e0d32883d0f4f6ba9d15fbbdebe42931253", null, "https://wikimedia.org/api/rest_v1/media/math/render/svg/72f4f985ecf182d4503ee6fba5942e91514b4d20", null, "https://wikimedia.org/api/rest_v1/media/math/render/svg/7fa4324515cc7343ee952e3840a1bb1aa8c7f74c", null, "https://wikimedia.org/api/rest_v1/media/math/render/svg/0790f6c9af33392f2c903e1becf5adf62401c102", null, "https://wikimedia.org/api/rest_v1/media/math/render/svg/2fa844757cb6ae0781df968947894936ec706cc6", null, "https://wikimedia.org/api/rest_v1/media/math/render/svg/75a9edddcca2f782014371f75dca39d7e13a9c1b", null, "https://wikimedia.org/api/rest_v1/media/math/render/svg/7fa4324515cc7343ee952e3840a1bb1aa8c7f74c", null, "https://wikimedia.org/api/rest_v1/media/math/render/svg/f4bc9dc729e1d53cb3651e618e87861c26656f6d", null, "https://wikimedia.org/api/rest_v1/media/math/render/svg/f5e3890c981ae85503089652feb48b191b57aae3", null, "https://wikimedia.org/api/rest_v1/media/math/render/svg/72f4f985ecf182d4503ee6fba5942e91514b4d20", null, "https://wikimedia.org/api/rest_v1/media/math/render/svg/4d4d9a872a55b209f2eb7cc23a71e5e1541bd1f4", null, "https://wikimedia.org/api/rest_v1/media/math/render/svg/72f4f985ecf182d4503ee6fba5942e91514b4d20", null, "https://wikimedia.org/api/rest_v1/media/math/render/svg/4d4d9a872a55b209f2eb7cc23a71e5e1541bd1f4", null, "https://wikimedia.org/api/rest_v1/media/math/render/svg/0790f6c9af33392f2c903e1becf5adf62401c102", null, "https://wikimedia.org/api/rest_v1/media/math/render/svg/7fa4324515cc7343ee952e3840a1bb1aa8c7f74c", null, "https://wikimedia.org/api/rest_v1/media/math/render/svg/75a9edddcca2f782014371f75dca39d7e13a9c1b", null, "https://wikimedia.org/api/rest_v1/media/math/render/svg/2b76fce82a62ed5461908f0dc8f037de4e3686b0", null, "https://wikimedia.org/api/rest_v1/media/math/render/svg/0d1ecb613aa2984f0576f70f86650b7c2a132538", null, "https://wikimedia.org/api/rest_v1/media/math/render/svg/0f7dcea3fa23e0f040b547524869260a5b8cfc89", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.93562365,"math_prob":0.96334285,"size":38680,"snap":"2019-26-2019-30","text_gpt3_token_len":7583,"char_repetition_ratio":0.15539353,"word_repetition_ratio":0.0941689,"special_character_ratio":0.19043434,"punctuation_ratio":0.10593782,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9631933,"pos_list":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76],"im_url_duplicate_count":[null,4,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,9,null,4,null,8,null,4,null,8,null,8,null,4,null,4,null,4,null,null,null,null,null,null,null,null,null,null,null,null,null,8,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,4,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-07-19T06:35:33Z\",\"WARC-Record-ID\":\"<urn:uuid:00ea4b60-0961-4c5b-9a2a-9659d6b87243>\",\"Content-Length\":\"174001\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:ec42400b-5f2b-4402-8b18-74dcf9837309>\",\"WARC-Concurrent-To\":\"<urn:uuid:9853e057-79e1-464c-8d2e-2d78f79e1ba2>\",\"WARC-IP-Address\":\"74.208.86.51\",\"WARC-Target-URI\":\"https://howlingpixel.com/i-en/Maximum_sustainable_yield\",\"WARC-Payload-Digest\":\"sha1:AICPKGSHHPBGLYK76YNZWMDWLI4RTYTY\",\"WARC-Block-Digest\":\"sha1:C2QUHOSSLE7OYAZAKILU4DBGG5AITP7I\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-30/CC-MAIN-2019-30_segments_1563195526064.11_warc_CC-MAIN-20190719053856-20190719075856-00470.warc.gz\"}"}
http://mth.vnit.ac.in/people/ppchakravarthy/teaching-2/
[ "Dr. P. P. Chakravarthy >>Teaching\n\nCourses Taught:\n\nUG level\n\nCore courses\n\n1. Mathematics – I (MAL 101)\n2. Mathematics – II (MAL 102)\n3. Integral Transforms and Partial Differential Equtions (MAL 201)\n\n​Elective courses\n\n1. Numerical Methods and Computation  (MAL 203)\n2. Numerical Methods and Probability Theory (MAL 205)\n\nPG level:\n\nCore courses\n\n1. Numerical Analysis (MAL 525)\n2. Theory of Differential Equations (MAL 513)\n\n​Elective courses\n\n1. Numerical Solution of Differential Equations (MAl 536)\n2. Finite Element Methods (MAL 544)\n3.  Finite Difference methods for Differential equations  (MAL 401) – M.Tech. WRE\n4. Application of Operational Research Techniques in Construction Management(MAL 405) – M.Tech. Constuction Engg.\n\n​Ph.D. (Contact Courses)\n\n1.   Singular Perturbation Theory   (MAL 601)\n2.   Fitted Numerical Methods for Singular Perturbation Problems(MAL 602)" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.6448636,"math_prob":0.85769045,"size":812,"snap":"2019-26-2019-30","text_gpt3_token_len":203,"char_repetition_ratio":0.16089109,"word_repetition_ratio":0.0,"special_character_ratio":0.26108375,"punctuation_ratio":0.07692308,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9611422,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-06-20T15:36:12Z\",\"WARC-Record-ID\":\"<urn:uuid:dcfab2be-523f-4bdb-a9cd-048c581046a9>\",\"Content-Length\":\"15145\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:de73a00d-2cc8-4a22-bc33-02cf8f883891>\",\"WARC-Concurrent-To\":\"<urn:uuid:f3f422d5-90cc-4eb6-a46f-ca8fa397924d>\",\"WARC-IP-Address\":\"210.212.165.238\",\"WARC-Target-URI\":\"http://mth.vnit.ac.in/people/ppchakravarthy/teaching-2/\",\"WARC-Payload-Digest\":\"sha1:SSDV7U4S5P4DYYFUEX3SWJWJRQKRML3G\",\"WARC-Block-Digest\":\"sha1:V3MVYRFHEY7VZTLIKYVIVOZPJB2YIJ5S\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-26/CC-MAIN-2019-26_segments_1560627999261.43_warc_CC-MAIN-20190620145650-20190620171650-00399.warc.gz\"}"}
https://appdividend.com/2019/01/16/python-pandas-tutorial-example-python-data-analysis-library/
[ "AppDividend\nLatest Code Tutorials\n\n# Pandas Example | Pandas Data Analysis Library In Python\n\nPandas is a software library written for the Python programming language for data manipulation and analysis. Python has been great for data manipulation and preparation, but less so for data analysis and modeling.\n\nPandas help fill this gap by enabling you to carry out your entire data analysis workflow in Python without having to switch to the more domain-specific language like R for data analysis.\n\nPandas do not implement significant modeling functionality outside of linear and panel regression.\n\n## Key Features of Pandas\n\nContent Overview\n\nThe key features of Pandas are the following.\n\n1. Pandas library is a fast and efficient DataFrame object with the default and customized indexing.\n2. Pandas library helps for loading the data into in-memory data objects from different file formats.\n3. It has functions that deal with Data alignment and integrated the handling of missing data.\n4. Using Pandas, we can reshape and pivot the data sets.\n5. It has Label-based slicing, indexing, and subsetting of more massive datasets.\n6. Pandas can insert or delete the Columns from the data structure.\n7. We can use Pandas for data aggregation and transformations.\n8. It gives the High-performance merging and joining of data.\n9. Time Series functionality.\n\n## Python Pandas Tutorial Example\n\nPandas is the Python package providing fast, reliable, flexible, and expressive data structures designed to make working with ‘relational’ or ‘labeled’ data both easy and intuitive way.\n\nPandas aim to be the fundamental high-level building block for doing practical, real-world data modeling and analysis in Python Programming Language.\n\n## Install Pandas on Mac\n\nInstall Pandas, if you have not installed previously on your machine.\n\nYou can install via PyPI using the following command.\n\n`python3 -m pip install --upgrade pandas`\n\nIf you want to upgrade the version, then you can go for the following command.\n\n`python3 -m pip install --upgrade pandas==0.23.0`\n\nMake sure; you will install it with proper permission such as use sudo if you are on Linux or Mac.\n\nStandard Python distribution does not come with the Pandas module. An alternative way is to install NumPy using a popular Python package installer, pip.\n\nIf you have installed a software pack something like Anaconda then pandas already been installed.\n\nNow, let’s test by the following example.\n\n```# app.py\n\nimport pandas as pd\nimport numpy as np\ndata = np.array(['a','b','c','d'])\nseri = pd.Series(data)\nprint(seri)\n```\n\nGo to the terminal and type the following command to run the file.\n\nIf you will get the above output then congrats!!. You have installed the Pandas successfully in your machine.\n\n## Pandas Data Structure\n\nPandas deals with the following two data structures.\n\nThe panel is deprecated and will be removed in a future version.\nThe recommended way to represent these types of 3-dimensional data is with a MultiIndex on a DataFrame, via the Panel.to_frame() method.\n\n### DataFrames in Pandas\n\nDataFrames allow you to store and manipulate the tabular data in rows of observations and columns of variables.\n\nDataFrames in Python are very similar as they come with the Pandas library, and they are defined as two-dimensional labeled data structures with columns of potentially different types.\n\n#### Features of DataFrame\n\n1. Potentially columns are of different types\n2. Size – Mutable\n3. Labeled axes (rows and columns)\n4. Can Perform Arithmetic operations on rows and columns\n\nA pandas DataFrame can be created using the following constructor.\n\n`pandas.DataFrame( data, index, columns, dtype, copy)`\n\nLet’s see the DataFrame example.\n\n```# app.py\n\nimport pandas as pd\nimport numpy as np\n\ndata = [['Krunal', 21],['Rushikesh', 22],['Hardik',30]]\ndf = pd.DataFrame(data, columns=['Name', 'Enrollment Number'])\nprint(df)```\n\nNow, run the above file and see the output.\n\nIn the above example, we have taken the data which is Name and Enrollment Number. For that data, we have used the NumPy library.\n\nThen, we have passed that data to the DataFrame and create a tabular data structure.\n\n### Series in Pandas\n\nSeries is the one-dimensional labeled array capable of holding data of any data type like integer, string, float, python objects, etc. The axis labels are collectively called index.\n\nLabels need not be unique but must be a hashable type. The object supports both integer and label-based indexing and provides a host of methods for performing operations involving the index.\n\nThe syntax of Series in Pandas is the following.\n\n`pandas.Series( data, index, dtype, copy)`\n\nLet’s create a primary series.\n\n```# app.py\n\nimport pandas as pd\n\ndata = [1, 2, 3, 4, 5, 6, 7]\ndf = pd.Series(data)\nprint(df)```\n\nRun the file and see the output.\n\nSo, the basics of Pandas are over. Finally, Python Pandas Tutorial Example | Python Data Analysis Library article is over. Thanks for taking it.\n\nThis site uses Akismet to reduce spam. Learn how your comment data is processed." ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.8293763,"math_prob":0.66280353,"size":4593,"snap":"2019-51-2020-05","text_gpt3_token_len":978,"char_repetition_ratio":0.13684899,"word_repetition_ratio":0.040983606,"special_character_ratio":0.20944916,"punctuation_ratio":0.12397661,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.97308207,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-01-27T20:25:59Z\",\"WARC-Record-ID\":\"<urn:uuid:eeb8bee0-1d88-42a6-b390-c378a808e316>\",\"Content-Length\":\"155997\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:f21b8cfb-1a7f-4b16-b62f-05d9a58d31be>\",\"WARC-Concurrent-To\":\"<urn:uuid:a08a07eb-a715-454d-9ae6-8db107d0ad5e>\",\"WARC-IP-Address\":\"52.45.7.26\",\"WARC-Target-URI\":\"https://appdividend.com/2019/01/16/python-pandas-tutorial-example-python-data-analysis-library/\",\"WARC-Payload-Digest\":\"sha1:VNLLTMUWQJKHWNNDLYCZA73NKPMP2QGB\",\"WARC-Block-Digest\":\"sha1:BF35BVDZ4LOPINW7PISUQ67RNHVKRLLU\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-05/CC-MAIN-2020-05_segments_1579251705142.94_warc_CC-MAIN-20200127174507-20200127204507-00557.warc.gz\"}"}
https://cstheory.stackexchange.com/questions/4343/searching-for-name-of-equivalence-property-in-hamiltonian-paths
[ "# Searching for name of equivalence property in hamiltonian paths\n\nThis one has been bugging me for a while. A long time ago in undergrad, I noticed this while learning about TSP. Nobody recognized it and I basically gave up.\n\nGiven a hamiltonian path, any subpath will consist of a start, end, and set of interior vertices. Any ordering of the interior vertices will possibly yield a path existing within the graph, that when substituted for the original will yield another valid hamiltonian path. These subpaths would therefore form an equivalence class.\n\nUnder this relation, two paths would be equivalent if they have the same start vertex, the same end vertex, and the same set of interior vertices.\n\nDoes this equivalence class have a name? If so, are there any TSP optimization algorithms that make use of this?\n\n• @user3266: Sorry if this is obvious, but how do one permute the order of the interior vertices and construct another valid Hamiltonian path? Or, only if such property exists then you put it into the equivalence class? – Hsien-Chih Chang 張顯之 Jan 16 '11 at 2:52\n• I believe OP means to permute the end nodes? – Ritwik Bose Jan 16 '11 at 3:03\n• There's a well-known randomized algorithm that uses pivoting, which is similar to this observation. The observation in general, though, is false (if I understand it correctly!): consider a circle. – alpoge Jan 16 '11 at 3:06\n• I am not sure if you are really referring to an equivalence class at all. – Tsuyoshi Ito Jan 16 '11 at 4:58\n• The set of all pairs of vertices that admit a Hamiltonian path? – Jeffε Jan 16 '11 at 6:08" ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.91547245,"math_prob":0.7767222,"size":748,"snap":"2019-51-2020-05","text_gpt3_token_len":155,"char_repetition_ratio":0.1061828,"word_repetition_ratio":0.0,"special_character_ratio":0.19385026,"punctuation_ratio":0.12328767,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.97956324,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-01-29T12:53:26Z\",\"WARC-Record-ID\":\"<urn:uuid:c8e3cf4d-20d9-4b34-bf79-cc0da73cf402>\",\"Content-Length\":\"138780\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:c3922201-d810-4b59-8617-c69bfec341a1>\",\"WARC-Concurrent-To\":\"<urn:uuid:07cd6415-694d-44f4-b031-440914cb54f2>\",\"WARC-IP-Address\":\"151.101.129.69\",\"WARC-Target-URI\":\"https://cstheory.stackexchange.com/questions/4343/searching-for-name-of-equivalence-property-in-hamiltonian-paths\",\"WARC-Payload-Digest\":\"sha1:T56EK32NXGJZ3FYH4TABTYD3QGBCRDYU\",\"WARC-Block-Digest\":\"sha1:MIJSGOEAJHOZVFVPWDGSFQVAIOZVSJYQ\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-05/CC-MAIN-2020-05_segments_1579251796127.92_warc_CC-MAIN-20200129102701-20200129132701-00474.warc.gz\"}"}
https://www.javatpoint.com/python-program-to-calculate-the-best-time-to-buy-and-sell-stock
[ "# Python program to calculate the best time to buy and sell stock\n\nWe will create a Python program for estimating the best time to buy and sell stock in the following tutorial.\n\nSo, let's get started.\n\n## Understanding the Python Project\n\nSuppose that we have an array X, here X[i] signifies the price of a provided stock on day n. We need to calculate the maximum profit. We can perform one transaction at most. (Transaction is considered to buy and sell stocks). However, it becomes a necessity for us to keep in mind that we may not engage in more than one transaction at one time. Thus, we must have to sell the stock before buying the new one.\n\nLet us consider an array as X = [7, 1, 5, 3, 6, 4]; then the output will be 5. As we can observe, if we buy on day 2 (index 1), then it will take 1 as a buying price. Then if we sell on day 5, we will get a profit of 6 - 1 = 5.\n\nLet us solve this problem using the following steps\n\nStep 1: Creating two arrays Lmin and Rmax, of the same size as Array X, and fill them with 0s\n\nStep 2: Lmin = A\n\nStep 3: for n in range 1 to length of X - 1, Lmin[n] = minimum of Lmin[n - 1] and X[n]\n\nStep 4: Rmax[i - 1] = X[i - 1]\n\nStep 5: for n in range length of X - 1 down to 1, Rmax[n] = maximum of Rmax[n + 1] and X[n]\n\nStep 6: Setting result = 0\n\nStep 7: for n in range 0 to length of X - 1, result = maximum of result and Rmax[n + 1] - Lmin[n]\n\nStep 8: Returning result\n\nNow, let us understand the implementation of these steps in the coding part shown below:\n\n## The Project Code\n\nLet us now consider the following Python program in order to calculate the best time for buying and selling stocks.\n\nFile: stocksProgram.py\n\nInput:\n\nOutput:\n\n```[7, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1]\n[8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7]\n6\n```\n\nExplanation\n\nIn the above snippet of code, we have defined a class. We then defined a function as max_profit within the class to calculate the maximum profit for a given array. We have created two arrays as Lmin and Rmax of the same size of the given array with 0 as their elements. We have then assigned the value of the first element of the Lmin array to the first element of the given array. We have used the for-loop to iterate the array's values to the Lmin array and print them for the users. We have then followed a similar for the Rmax array and print its elements for the users. We have then assigned the initial value of the res variable as 0. We have then used the for-loop again to estimate the maximum profit. At last, we instantiated the class and printed the maximum profit for the given array for the users. And in the above program, it is 6.\n\n### Feedback", null, "", null, "", null, "" ]
[ null, "https://www.javatpoint.com/images/facebook32.png", null, "https://www.javatpoint.com/images/twitter32.png", null, "https://www.javatpoint.com/images/pinterest32.png", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.8885146,"math_prob":0.98106766,"size":2950,"snap":"2022-40-2023-06","text_gpt3_token_len":811,"char_repetition_ratio":0.121520706,"word_repetition_ratio":0.04137931,"special_character_ratio":0.2715254,"punctuation_ratio":0.13283582,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99428767,"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\":\"2023-02-08T23:06:53Z\",\"WARC-Record-ID\":\"<urn:uuid:0b0c5694-eac8-4ad9-9193-fd47d8b50a3e>\",\"Content-Length\":\"119649\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:f0f36494-1782-43b4-b93d-4ec32922992c>\",\"WARC-Concurrent-To\":\"<urn:uuid:bc9ec367-30ed-4022-87c4-d14eff4377f0>\",\"WARC-IP-Address\":\"172.67.211.76\",\"WARC-Target-URI\":\"https://www.javatpoint.com/python-program-to-calculate-the-best-time-to-buy-and-sell-stock\",\"WARC-Payload-Digest\":\"sha1:A4IMY5E7467O7FJWRFBZ37LB7ZCPKDJC\",\"WARC-Block-Digest\":\"sha1:THOP2K2S2R7XKZHXPJRG5USX3CHHW57U\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-06/CC-MAIN-2023-06_segments_1674764500983.76_warc_CC-MAIN-20230208222635-20230209012635-00209.warc.gz\"}"}
https://conceptfreak.com/tag/weighted-k-nn/
[ "## What is Weighted k-NN Algorithm\n\nWe have seen the basic k-NN algorithm. You may want to read that first to better understand this concept.\n\nUsing k-NN we try to predict the class of a query point “Q” (an unclassified data-point). To do this we use the concept of neighbours or points that are similar or close to the query point and then do majority vote.\n\nBut we miss something here. Suppose we have 5 neighbours. Don’t you think that the points which are closer to Q needs to be given more importance?\n\nThat’s what we do here. We assign weights to the data-points based on their distance from Q. One way to calculate weight is to divide distance by 1 i.e. weight = 1/distance\n\nConsider the following neighbours of Q. Here we have added a new column Weight = 1/Distance\n\n Point Label Distance Weight A Positive 0.1 10 B Negative 0.2 5 C Positive 0.4 2.5 D Negative 0.5 2\n\nNow that we have weights assigned to each neighbour we can use weighted k-NN to predict the Label for Q. To do this we calculate positive and negative sums.\n\nPositive Sum\nWe calculate sum of weights for positive labels i.e. A,C : 10+2.5 = 12.5\n\nNegative Sum\nWe calculate sum of weights for negative labels i.e. B,D : 5+2 = 7\n\nSince Positive Sum > Negative Sum we can say that for Q the label will be Positive." ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.9140721,"math_prob":0.99655974,"size":1259,"snap":"2019-13-2019-22","text_gpt3_token_len":324,"char_repetition_ratio":0.1306773,"word_repetition_ratio":0.026200874,"special_character_ratio":0.2621128,"punctuation_ratio":0.10752688,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9995483,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-03-26T15:02:40Z\",\"WARC-Record-ID\":\"<urn:uuid:666cd532-9553-400e-81b5-f20530a90692>\",\"Content-Length\":\"20865\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:5f0ec50a-12cf-42e1-9c65-c2a4b21d6f2b>\",\"WARC-Concurrent-To\":\"<urn:uuid:91094c54-e1dd-4fa3-80d5-a8ad4da9f34a>\",\"WARC-IP-Address\":\"148.66.138.170\",\"WARC-Target-URI\":\"https://conceptfreak.com/tag/weighted-k-nn/\",\"WARC-Payload-Digest\":\"sha1:4X64ZC7WLU237GF6OZ3TCK2WNYFUWCRP\",\"WARC-Block-Digest\":\"sha1:ZLKY7B5ZMEAQFTYSHKVMT2QALVYWRDJM\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-13/CC-MAIN-2019-13_segments_1552912205534.99_warc_CC-MAIN-20190326135436-20190326161436-00317.warc.gz\"}"}
http://exsense.cn/2/show/254.html
[ "", null, "QQCustomer Service\nProduct Catalogue\nTel :\n+86-758-2876921\n+86-758-2877695\nFax :\n+86-758-2838131\nQQ :\n3004803562/1508496831\nTangxia Industry Zone, Mugang Town, Duanzhou Dist, Zhaoqing City, Guangdong Pro., China\nTechnical Support\nTechnical Support\nBrief Description of Frequency Characteristics of Single Layer Capacitor\n2019/03/04 03:03:51", null, "Chip capacitor--single layer capacitor has the advantages of small size, thin thickness, low equivalent series resistance, lower loss, etc., its frequency characteristic is great, the applying frequency can reach several GHZ, which is suitable for small, microwave occasions, can be used in microwave integrated circuits, play the role of DC isolation, RF bypass, smoothing, tuning and so on.\n\nThe frequency characteristic of the capacitor refers to the relationship of the capacitance and other parameters of the capacitor vary with the frequency, so when the capacitor works at high frequency, with the increase of work efficiency, the capacitance will decrease due to the decrease of dielectric coefficient of the insulating medium, and the loss will increase, which will also affect the distribution parameters of the capacitor, and will gradually show sensibility. The frequency characteristic of the capacitor, let's say the angular frequency is ω, the electrostatic capacity of the capacitor is C, then under the ideal condition, the impedance Z of the capacitor (1) can be shown as Formula ①:", null, "(1) Ideal Capacitor\n\n①XC=1/(ω*C) =1/(2*π*f*C)", null, "As can be seen from the formula ①, the impedance level |Z|, as shown in (2), which tends to decrease in inverse frequency. Due to there is no loss in the ideal capacitor, the equivalent series resistance (ESR) is zero.", null, "(2)\n\nBut in the actual single layer capacitor (2), in addition to the capacity component C, there is also a resistance (ESR) due to dielectric or electrode loss and a parasitic inductance (ESL) generated by electrodes or wires. As a result, the frequency characteristics of the |Z|, as shown in (4), are V-shaped (some capacitors may become U-shaped) curves, and ESR also shows the frequency characteristics corresponding to the loss value.", null, "(3)\n\nThe reasons why |Z| and ESR become the curve in (4) are as follows: |Z| of low frequency range is the same as the ideal capacitor, which tends to decrease in inverse frequency. ESR value also shows the characteristic corresponding to the dielectric loss caused by the polarization delay of dielectric medium. Near the point of resonance: the frequency increases, then the |Z| will be affected by ESR from the parasitic inductance or the specific resistance of the electrode,etc., deviating from the ideal capacitor (red dotted line), showing the minimum value. The frequency at which the |Z| is the minimum value is called the self-vibration frequency, at which point |Z|=ESR. If greater than the self-vibration frequency, the component characteristic is converted from capacitors to inductance, |Z| added instead. The range below the self-vibration frequency is called the capacitive field, the opposite is called the perceptual field.", null, "(4)\n\nIn addition to the influence of dielectric loss, ESR is also affected by the loss of self resistance stroke of the electrode. High Frequency range: In the higher frequency range above the resonance point, the characteristic of the |Z| are determined by the parasitic inductance (L). High Frequency range of The |Z| can be worked out approximately by formula in (2). The trend increases in proportion to the frequency. ESR gradually showed the effect of electrode skin effect and proximity effect.\n\nThe above is the frequency characteristics of the actual capacitor. Importantly, the higher the frequency, the less likely it is to ignore the effects of the parasitic component ESR or ESL. As capacitors are increasingly used in high-frequency applications, ESR and ESL are the same as electrostatic capacity, which have become an important parameter for single layer capacitor performance.\n\nPrev : No More\n\nNext : Ceramic Layer Capacitor\n\nmqu.cn site.nuo.cn" ]
[ null, "http://exsense.cn/Apps/Tpl/Home/Default/Public/images/icon/qq_03.jpg", null, "http://exsense.cn/Uploads/201903/5c7ccd0043492.jpg", null, "http://exsense.cn/Uploads/201903/5c7ccd1929b99.jpg", null, "http://exsense.cn/Uploads/201903/5c7cce0f8c0fc.jpg", null, "http://exsense.cn/Uploads/201903/5c7ccd48c6c90.jpg", null, "http://exsense.cn/Uploads/201903/5c7ccd6b74187.jpg", null, "http://exsense.cn/Uploads/201903/5c7ccd813279e.jpg", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.9269158,"math_prob":0.9549867,"size":3682,"snap":"2019-51-2020-05","text_gpt3_token_len":782,"char_repetition_ratio":0.18597063,"word_repetition_ratio":0.017301038,"special_character_ratio":0.20233569,"punctuation_ratio":0.11309524,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.96923286,"pos_list":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14],"im_url_duplicate_count":[null,null,null,1,null,4,null,4,null,4,null,4,null,4,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-12-14T12:56:02Z\",\"WARC-Record-ID\":\"<urn:uuid:eb1b5de2-9768-4e82-8e12-0e89216778c2>\",\"Content-Length\":\"38090\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:75fb3e7f-f733-44e9-9c60-04a65867b828>\",\"WARC-Concurrent-To\":\"<urn:uuid:10eb28a1-1519-4c96-b47f-642dc38b3a87>\",\"WARC-IP-Address\":\"47.88.107.173\",\"WARC-Target-URI\":\"http://exsense.cn/2/show/254.html\",\"WARC-Payload-Digest\":\"sha1:MMMWR6IA464VMHADZFMKBMZ2H2K2BTCG\",\"WARC-Block-Digest\":\"sha1:2BTUBJEIDPYPUZNXI2SVRRUEUSAW2ATH\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-51/CC-MAIN-2019-51_segments_1575541157498.50_warc_CC-MAIN-20191214122253-20191214150253-00413.warc.gz\"}"}
https://www.jkcs.or.kr/journal/view.php?number=6634
[ "", null, "", null, "J. Korean Ceram. Soc. > Volume 47(5); 2010 > Article\n Journal of the Korean Ceramic Society 2010;47(5): 457. doi: https://doi.org/10.4191/kcers.2010.47.5.457\n SmCoO3 페롭스카이트 계 열전소재에서 Fe2O3 첨가제가 출력인자에 미치는 영향 정광희, 최순목, 서원선, 박형호1 한국세라믹기술원 그린세라믹본부1연세대학교 신소재공학과 An Effect of Fe2O3 Additive on a Seebeck Coefficient and a Power Factor for SmCoO3 Perovskite System Kwang-Hee Jung, Soon-Mok Choi, Won-Seon Seo, Hyung-Ho Park1 Energy Materials Center, Green Ceramics Divsion., Korea Institute of Ceramic Engineering and Technology (KICET)1Department of Materials Science and Engineering, Yonsei University ABSTRACT $SmCoO_3$ system was investigated for their application to themoelectric materials. All specimens showed p-type semiconducting behavior and their electrical conductivity ($sigma$), Seebeck coefficient (S) and power factor were measured at high temperature. And the effect of dopant ions on their thermoelectrical properties were also investigated. $Fe^{3+}$ ion doped into $Co^{3+}$ site enhanced the Seebeck coefficient and decreased the electrical conductivity simultaneously. The maximum Seebeck coefficient value for 60% doping case reached to 780 ${mu}V$/K at $240^{circ}C$. However $Fe^{3+}$ doped system cause an negative effect on power factor value. In case of the pure phase, the maximum Seebeck coefficient value reached to 290 ${mu}V$/K at $240^{circ}C$ and the maximum electrical conductivity was obtained 748 1/(ohm$times$cm) at $960^{circ}C$. As a result, the maximum power factor was obtained $1.49times10^{-4}$ W/$mK^2$ at $550^{circ}C$. Key words: Themoelectrics, $SmCoO_3$, Perovskite, $Fe_2O_3$, p-type semiconductor\nTOOLS", null, "", null, "PDF Links", null, "", null, "Full text via DOI", null, "", null, "Download Citation", null, "", null, "CrossRef TDM", null, "", null, "E-Mail", null, "Share:", null, "", null, "", null, "", null, "", null, "METRICS", null, "0 Crossref\n 0 Scopus\n 1,354 View\nCopyright © The Korean Ceramic Society.", null, "" ]
[ null, "https://www.jkcs.or.kr/image/top_img.gif", null, "https://www.jkcs.or.kr/image/b_advanced.gif", null, "https://www.jkcs.or.kr/image/left_dotline.gif", null, "https://www.jkcs.or.kr/image/icon/pdf.gif", null, "https://www.jkcs.or.kr/image/left_dotline.gif", null, "https://www.jkcs.or.kr/image/icon/doi.gif", null, "https://www.jkcs.or.kr/image/left_dotline.gif", null, "https://www.jkcs.or.kr/image/icon/citation.gif", null, "https://www.jkcs.or.kr/image/left_dotline.gif", null, "https://www.jkcs.or.kr/image/icon/icon_tdm.gif", null, "https://www.jkcs.or.kr/image/left_dotline.gif", null, "https://www.jkcs.or.kr/image/icon/mail.gif", null, "https://www.jkcs.or.kr/image/left_dotline.gif", null, "https://www.jkcs.or.kr/image/facebook_icon.png", null, "https://www.jkcs.or.kr/image/Twitter_icon.png", null, "https://www.jkcs.or.kr/image/Linkedin_icon.png", null, "https://www.jkcs.or.kr/image/google_plus_icon.png", null, "https://www.jkcs.or.kr/image/left_dotline.gif", null, "https://www.jkcs.or.kr/image/button/metrics_btn.png", null, "https://www.m2-pi.com/images/developed_m2pi_1.png", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.86423165,"math_prob":0.89450836,"size":1502,"snap":"2022-05-2022-21","text_gpt3_token_len":490,"char_repetition_ratio":0.108144194,"word_repetition_ratio":0.0,"special_character_ratio":0.25432757,"punctuation_ratio":0.105058365,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9611575,"pos_list":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40],"im_url_duplicate_count":[null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2022-05-27T03:11:22Z\",\"WARC-Record-ID\":\"<urn:uuid:a2672598-d167-4a8a-8814-c3458a7a68d2>\",\"Content-Length\":\"44057\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:d3ff598a-16eb-43e2-9c84-5f6143597fbd>\",\"WARC-Concurrent-To\":\"<urn:uuid:afb5dab7-338b-4550-a28a-ce16cc36aafb>\",\"WARC-IP-Address\":\"121.254.129.102\",\"WARC-Target-URI\":\"https://www.jkcs.or.kr/journal/view.php?number=6634\",\"WARC-Payload-Digest\":\"sha1:TZVGFLYN2I5TANH7SFTVAUTURWXJI6LM\",\"WARC-Block-Digest\":\"sha1:EAKPORZQKASQGGZ3IVHP4TSDK3IEWAFF\",\"WARC-Identified-Payload-Type\":\"application/xhtml+xml\",\"warc_filename\":\"/cc_download/warc_2022/CC-MAIN-2022-21/CC-MAIN-2022-21_segments_1652662631064.64_warc_CC-MAIN-20220527015812-20220527045812-00336.warc.gz\"}"}
http://wikenigma.org.uk/doku.php?id=start:mathematics:irrational_numbers
[ "Site Tools\n\nPlease register and/or login to edit and create pages\n\n[ Click categories to expand ]\n\nOther categories\n\nFor tests only\n\nAlso see:\n\nstart:mathematics:irrational_numbers\n\nThis item is one of a special case - Known Unknowables\n\nIrrational numbers\n\nAn irrational number is a real number that cannot be expressed as a ratio of integers, i.e. as a fraction.\n\nExamples are π, √2 etc.\n\nFor many irrational numbers, relatively simple mathematical proofs exist which show that it's impossible to ever arrive at finite solution.\n\n(√2 was proved to be an irrational number by Greek mathematicians more than 2000 yrs ago).", null, "" ]
[ null, "http://wikenigma.org.uk/lib/exe/indexer.php", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.76569825,"math_prob":0.9619843,"size":886,"snap":"2019-43-2019-47","text_gpt3_token_len":212,"char_repetition_ratio":0.108843535,"word_repetition_ratio":0.38356164,"special_character_ratio":0.2054176,"punctuation_ratio":0.08125,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.9517853,"pos_list":[0,1,2],"im_url_duplicate_count":[null,8,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-10-23T08:21:44Z\",\"WARC-Record-ID\":\"<urn:uuid:f195b392-3dff-40e7-9f61-6c5e1826782e>\",\"Content-Length\":\"18974\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:5decf5ba-8ed8-4349-9bf7-11bdb6d6d7d5>\",\"WARC-Concurrent-To\":\"<urn:uuid:da51f3a0-9ed0-4d2e-b79e-07b89c0886c6>\",\"WARC-IP-Address\":\"193.254.210.60\",\"WARC-Target-URI\":\"http://wikenigma.org.uk/doku.php?id=start:mathematics:irrational_numbers\",\"WARC-Payload-Digest\":\"sha1:22QYXSD5OELPYEJAKU5NH2KMHEYZZRKW\",\"WARC-Block-Digest\":\"sha1:UY7BKNRT4SFEYGAEP4OJSYTLFDSPCOFG\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-43/CC-MAIN-2019-43_segments_1570987829507.97_warc_CC-MAIN-20191023071040-20191023094540-00196.warc.gz\"}"}
http://people.seas.harvard.edu/~jones/ap216/lectures/ls_2/ls2_u6/vanderpol/vanderpol.html
[ "# Van der Pol Negative Resistance Oscillator (pdf)\n\nVan der Pol's analysisof \"negative resistance\" (]e.g., tunnel diode) oscillators provides a valuable framework for treating with relative simplicity important features of oscillatory systems.\n\nThe characteristic curve of a \"negative resistance\" device", null, "Consider the following negative resistance oscillatory circuit:", null, "By simple circuit analysis, it is a straightforword proposition to find the following simple circuit equation which is the fundamental van der Pol oscillator equation:", null, "[ VdP-1 ]\nwhere", null, ".\nIf a is small, it is reasonable to take", null, "[ VdP-2 ]\nThen Equation [ VdP-1 ] becomes without approximation", null, "[ VdP-3 ]\nIf we ignore harmonic generation, Equation [ VdP-3 ] may be approximated as", null, "[ VdP-4 ]\nIf we make the slow time variation assumption, this equation reduces to", null, "[ VdP-5 ]\nwhere", null, ". This essential Equation [ VI-25b ] in the lecture set entitled The Interaction of Radiation and Matter: Semiclassical Theory. We saw there that the general steady state solution is given by", null, "[ VdP-6 ]\nTo study frequency locking we suppose that a driving source (to be precise a current source in parallel with the negative resistance) and then the van der Pol equation becomeshe driven case", null, "[ VdP-7 ]\nIn this case, it is reasonable to take", null, "[ VdP-8 ]\nIf we again ignore harmonic geneation, Equation [ VdP-7 ] becomes", null, "[ VdP-9 ]\nAgain under the slow time variation assumption, this equation reduces to", null, "[ VdP-10 ]\nIf we take", null, ", this equation separate into the following pair of equations:", null, "[ VdP-11a ]", null, "[ VdP-11b ]\nwhere", null, "(the \"detuning term\") and", null, "(the \"locking coefficient\"). For small", null, "we can decouple the equations and take", null, "from Equation [ VdP-6 ] so that", null, ".\nIf", null, "the relative phase angle changes linearly in time at the rate", null, ".   As", null, "decreases toward unity, the \"locking term\" subtracts from the ìdetuning termî in one half of a cycle and adds in the other half.  At", null, "there are two values of the phase angle that yield the \"mode locking\" condition", null, "-- viz.", null, "[ VdP-12 ]\n\nWe can test the stability of these solutions by taking", null, "and therefore Equation [VdP-11b] becomes", null, "[ VdP-13 ]\n\nand the solutions are stable if", null, "[ VdP-14a ]", null, "[ VdP-14b ]\n B. van der Pol, Radio Rev. 1, 704-754, 1920 and B. van der Pol, Phil. Mag. 3, 65, 1927\n\nThis page was prepared and is maintained by R. Victor Jones, jones@deas.harvard.edu\nLast updated March 16, 2000" ]
[ null, "http://people.seas.harvard.edu/~jones/ap216/lectures/ls_2/ls2_u6/vanderpol/vanderpol1.gif", null, "http://people.seas.harvard.edu/~jones/ap216/lectures/ls_2/ls2_u6/vanderpol/vanderpol2.gif", null, "http://people.seas.harvard.edu/~jones/ap216/lectures/ls_2/ls2_u6/vanderpol/vanderpol3.gif", null, "http://people.seas.harvard.edu/~jones/ap216/lectures/ls_2/ls2_u6/vanderpol/vanderpol4.gif", null, "http://people.seas.harvard.edu/~jones/ap216/lectures/ls_2/ls2_u6/vanderpol/vanderpol5.gif", null, "http://people.seas.harvard.edu/~jones/ap216/lectures/ls_2/ls2_u6/vanderpol/vanderpol6.gif", null, "http://people.seas.harvard.edu/~jones/ap216/lectures/ls_2/ls2_u6/vanderpol/vanderpol7.gif", null, "http://people.seas.harvard.edu/~jones/ap216/lectures/ls_2/ls2_u6/vanderpol/vanderpol8.gif", null, "http://people.seas.harvard.edu/~jones/ap216/lectures/ls_2/ls2_u6/vanderpol/vanderpol9.gif", null, "http://people.seas.harvard.edu/~jones/ap216/lectures/ls_2/ls2_u6/vanderpol/vanderpol10.gif", null, "http://people.seas.harvard.edu/~jones/ap216/lectures/ls_2/ls2_u6/vanderpol/vanderpol11.gif", null, "http://people.seas.harvard.edu/~jones/ap216/lectures/ls_2/ls2_u6/vanderpol/vanderpol12.gif", null, "http://people.seas.harvard.edu/~jones/ap216/lectures/ls_2/ls2_u6/vanderpol/vanderpol13.gif", null, "http://people.seas.harvard.edu/~jones/ap216/lectures/ls_2/ls2_u6/vanderpol/vanderpol14.gif", null, "http://people.seas.harvard.edu/~jones/ap216/lectures/ls_2/ls2_u6/vanderpol/vanderpol15.gif", null, "http://people.seas.harvard.edu/~jones/ap216/lectures/ls_2/ls2_u6/vanderpol/vanderpol16.gif", null, "http://people.seas.harvard.edu/~jones/ap216/lectures/ls_2/ls2_u6/vanderpol/vanderpol17.gif", null, "http://people.seas.harvard.edu/~jones/ap216/lectures/ls_2/ls2_u6/vanderpol/vanderpol18.gif", null, "http://people.seas.harvard.edu/~jones/ap216/lectures/ls_2/ls2_u6/vanderpol/vanderpol19.gif", null, "http://people.seas.harvard.edu/~jones/ap216/lectures/ls_2/ls2_u6/vanderpol/vanderpol20.gif", null, "http://people.seas.harvard.edu/~jones/ap216/lectures/ls_2/ls2_u6/vanderpol/vanderpol21.gif", null, "http://people.seas.harvard.edu/~jones/ap216/lectures/ls_2/ls2_u6/vanderpol/vanderpol22.gif", null, "http://people.seas.harvard.edu/~jones/ap216/lectures/ls_2/ls2_u6/vanderpol/vanderpol24.gif", null, "http://people.seas.harvard.edu/~jones/ap216/lectures/ls_2/ls2_u6/vanderpol/vanderpol25.gif", null, "http://people.seas.harvard.edu/~jones/ap216/lectures/ls_2/ls2_u6/vanderpol/vanderpol26.gif", null, "http://people.seas.harvard.edu/~jones/ap216/lectures/ls_2/ls2_u6/vanderpol/vanderpol27.gif", null, "http://people.seas.harvard.edu/~jones/ap216/lectures/ls_2/ls2_u6/vanderpol/vanderpol28.gif", null, "http://people.seas.harvard.edu/~jones/ap216/lectures/ls_2/ls2_u6/vanderpol/vanderpol29.gif", null, "http://people.seas.harvard.edu/~jones/ap216/lectures/ls_2/ls2_u6/vanderpol/vanderpol30.gif", null, "http://people.seas.harvard.edu/~jones/ap216/lectures/ls_2/ls2_u6/vanderpol/vanderpol31.gif", null, "http://people.seas.harvard.edu/~jones/ap216/lectures/ls_2/ls2_u6/vanderpol/vanderpol32.gif", null, "http://people.seas.harvard.edu/~jones/ap216/lectures/ls_2/ls2_u6/vanderpol/vanderpol33.gif", null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.8262134,"math_prob":0.98274523,"size":2412,"snap":"2019-35-2019-39","text_gpt3_token_len":679,"char_repetition_ratio":0.14451827,"word_repetition_ratio":0.047169812,"special_character_ratio":0.27155888,"punctuation_ratio":0.095348835,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99849087,"pos_list":[0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64],"im_url_duplicate_count":[null,1,null,1,null,1,null,1,null,1,null,1,null,1,null,1,null,1,null,1,null,1,null,1,null,1,null,1,null,1,null,1,null,1,null,1,null,1,null,1,null,1,null,1,null,1,null,1,null,1,null,1,null,1,null,1,null,1,null,1,null,1,null,1,null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-09-19T14:52:47Z\",\"WARC-Record-ID\":\"<urn:uuid:fbae1765-b501-43cd-8e7f-81268bdfe35f>\",\"Content-Length\":\"7728\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:cd21481a-95c4-4873-b94f-12f0fcb738e0>\",\"WARC-Concurrent-To\":\"<urn:uuid:ed2963cf-5156-4bdd-b902-26ec3cbe6a79>\",\"WARC-IP-Address\":\"54.172.197.41\",\"WARC-Target-URI\":\"http://people.seas.harvard.edu/~jones/ap216/lectures/ls_2/ls2_u6/vanderpol/vanderpol.html\",\"WARC-Payload-Digest\":\"sha1:GAEZOAF4FXH4B5UNDKM42EHWNOBRLCLW\",\"WARC-Block-Digest\":\"sha1:K6K7V4GC7BD43T7GYWKXMOVTF75234IN\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-39/CC-MAIN-2019-39_segments_1568514573533.49_warc_CC-MAIN-20190919142838-20190919164838-00201.warc.gz\"}"}
https://tex.stackexchange.com/questions/tagged/calc
[ "The Stack Overflow podcast is back! Listen to an interview with our new CEO.\n\nQuestions tagged [calc]\n\nThe tag has no usage guidance.\n\n45 questions\nFilter by\nSorted by\nTagged with\n64 views\n\nCan tikz projections be computed in three dimensions?\n\nAccording to the pgf manual, the syntax <coordinate>!<projection coordinate!<angle>:<second coordinate> can be used to project <projection coordinate> orthogonally onto ...\n50 views\n\nTikz: Calculations with coordinates\n\nInspired by the question How to draw a line passing through a point and parallel to another? I'm trying to do some arithmetic with coordinates. The code below does not work, but I hope that with a ...\n136 views\n\nClimate flow chart\n\nI am trying to draw the following \"flowchart\" After some fiddling I was able to come up with the following solution What I am struggling with mainly boils down to two things How can I align the ...\n38 views\n\ncalculate the title height and if the title height is above some number then add some space\n\ncalculate the title height and if the title height is above some number then add some space. when I use the code get the title, but when I use code like this \\settoheight{\\heightoftitle}{\\vbox{\\...\n150 views\n\nRelationship between strut and baselineskip\n\nHere, it is said that a strut is defined as: \\rule[-.3\\baselineskip]{0pt}{\\baselineskip} However, if I do: \\newlength{\\strutheight} \\settoheight{\\strutheight}{\\strut}\\printlength{\\strutheight} \\...\n17 views\n\nSet an option to a custom environment to change width of a setheight\n\nI'm tuning the code @CarLaTeX proposed in this topic to separate teacher version and student version. The goal is when the boolean is true (student version), a blank line takes the place of the stuff....\n80 views\n\nBasic TikZ “Missing number” error when using asin to calculate the end angle of arc\n\nI am new to plotting in TikZ and has come across the \"Missing number error\" in the following example on the line marked by %(**), \\documentclass{book} \\usepackage{tikz} \\usetikzlibrary{calc,shapes....\n22 views\n\nUsing zref return value as input for counter\n\nI am trying to create a new counter, which is counting the page numbers to store them and reuse them later. I always remove the 3 pages, which are not numbered at the beginning of the document and I ...\n109 views\n\nHow to evaluate an expression and use the result in newcommand?\n\nI am trying to declare a newcommand \\newcommand{\\seq}{#1_#2, #1_{#2 + 1} \\cdots ,#1_#3} What I want is basically to print the sequence $v_0, v_1, \\cdots, v_N$ by calling \\seq{v}{0}{N} but it is ...\n110 views\n\nRiemann Sum approaches Area under Curve\n\nI am trying to write a program where I can change the number of subintervals, n( using \\def\\n\\some number), and the output show that specific number of rectangles in the Riemann Sum. An animation ...\n407 views\n\nCall for node distance as a variable in TikZ\n\nIs it possible to use the node distance as a variable while expressing coordinates of new nodes with Calc and Positioning libraries? What I want to have is everything within a single piece of code for ...\n61 views\n\nProblems with enumitem and calc\n\nBelow is a MWE with the calc and enumitem packages: \\documentclass{report} \\usepackage{enumitem} \\usepackage{calc} \\begin{document} \\chapter{Title} \\section{Section} \\begin{enumerate}[labelindent=...\n130 views\n\nProblem with \\newdimen and \\widthof\n\nI have a problem with the following code under TexLive 2018: \\documentclass{report} \\usepackage{calc} \\usepackage[inline]{enumitem} \\usepackage{parskip} \\newdimen\\lblwidth\\lblwidth=\\widthof{8.88.\\ }...\n66 views\n\ncalc and xassoccnt incompatible?\n\nI'm getting LaTeX warning: Package xassoccnt Warning: Warning: Package \"calc\" is loaded -- this is not (xassoccnt) recommended for xassoccnt with calc 2017/05/25 v4.3 xassoccnt ...\n129 views\n\nWhy conflict between mathtools and Gonzalo's solution for auto-adjusting description environment?\n\nGonzalo Medina provided a nifty solution to \"Automatically set description list labelwidth based on widest label?.\" (The goal was to define a description environment where the item text is ...\n474 views\n\nHow to define a variable as another variable divided by two?\n\nI would like to define a variable \\j in a loop \\foreach \\i in { 2, 4, 6} and use \\j to labels of the nodes. Here is my code: \\documentclass{standalone} \\usepackage{balance,complexity,pgfplots,tikz,...\n129 views\n\nIs there an incompatibility between the packages calc and siunitx? (\\GenericError […])\n\nThe following code does not compile: \\documentclass[11pt]{article} \\usepackage{calc} \\usepackage{siunitx} \\begin{document} \\begin{tabular}{p{.5cm}p{\\widthof{\\textbf{AAAAAAAAA}}}l} &\\textbf{...\n48 views\n\nWeird behavior when mixing the tikz “let” and “plot” operation\n\nCan anyone explain to me why the output of the following code changes when I remove +\\x1 ? \\documentclass[tikz]{standalone} \\usepackage{tikz} \\begin{document} \\usetikzlibrary{calc} \\begin{...\n140 views\n\ntikz - create coordinate with maximum y-value of two other coordinates\n\nI'd like to define a coordinate (Q1) which contains the x-component of a coordinate (P1) and as y-component the maximum y-values of (P1) and (P2). Here's my MWE: \\documentclass{standalone} \\...\n288 views\n\nCombining calc and perpendicular coordinates in tikz\n\nAs it is described there, the following does not compile: \\documentclass{report} \\usepackage{tikz} \\usetikzlibrary{calc} \\begin{document} \\begin{tikzpicture} \\node at (0, 0) (node1) {Hello}; \\node ...\n345 views\n\nTikz coordinates relative to one node\n\nUsing both calc and |- would be a convenient way to refer to \"inner, relative coordinates\" of a node, with (0, 0) meaning node.center, (0, 1) meaning node.east and (.3, -.5) meaning somewhere precise ...\n155 views\n\nStore result of \\ratio calculation for repeated use\n\nI am using pdflatex with the beamer package to create a presentation template that is similar to the PowerPoint template provided by my company. I want the company logo to have the same size in my ...\n187 views\n\nError message converting from markdown to PDF, Package calc Error: \\let ' invalid at this point\n\nI am trying to convert a R markdown document to PDF. However, it fails to compile and gives me the following error message: ! Package calc Error: \\let ' invalid at this point. My document consists ...\n170 views\n\ntikz/pgf and \\maxof broken since 3.0.1a\n\nThe following example works well tikz up to 3.0.0 (TL 2014 and probably 2015), but breaks since tikz 3.0.1a (till now): \\documentclass{report} \\usepackage{calc} \\usepackage{tikz} \\usetikzlibrary{calc}...\n218 views\n\nUsing tikz Calc package to add cordinates\n\nI would like to draw the line shown in the right hand side of the attached figure from Node 3 to the line between Node 1 and Node 2. (Note line with should be same width as all other lines.) I ...\n63 views\n\nHow align paragraph with labels before resume enumitem list\n\nI have an enumerate list created with enumitem that I interrupt and then resume. Between the last item before the interruption and the first after the resumption, I insert a text paragraph. How can I ...\n49 views\n\nIncluding xifthen package breaks macro expansion in header\n\nIn the following MWE, I build a 'database' which I then query later in body text and in headers. It works fine until I load the xifthen package. This is not used in the MWE, but I do use the \\isempty{...\n63 views\n\nMacro definition with argument within node position calculation does not work\n\nI can't figure out, why the following macro definition \\gcmarknode does not work: \\documentclass{beamer} \\usepackage{tikz} \\usepackage{pifont} \\newcommand{\\cmark}{\\ding{51}} \\usetikzlibrary{calc} \\...\n126 views\n\nPersonal command incompatible with tikz calc library\n\nI have written a personal command called \\compo that allows you to place a figure next to a text: \\compo[.4]{ text }{ figure }; When the figure is created with the tikz calc library, there is this ...\n552 views\n\nError in tkz-euclide \\tkzDefPoint with square roots\n\nI cannot make sqrt(x) work in \\tkzDefPoint; I'm getting the error ! Argument of \\XC@definec@lor has an extra } in the following code: \\documentclass{scrbook} \\usepackage{fontenc} \\usepackage[utf8]{...\n183 views\n\nCentering the center of two tikz nodes to the center of a page\n\nConsider the following example: \\documentclass[twoside, 10pt]{book} \\usepackage[ paperwidth=6in, paperheight=9in, tmargin=0.75in, bmargin=0.75in, inner=0.75in, outer=0.75in ]{...\n387 views\n\nCalculate inside \\setlength\n\nI'm subdividing my page in a number of sections and I want to calculate the width of each section depending of the number. \\newlength{\\basewidth} \\setlength{\\basewidth}{\\linewidth/5.5} The \\...\n190 views\n\nPassing a numeric argument through \\newcommand or \\renewcommand to a calc package command?\n\nConsider the following MnotWE: \\documentclass[12pt,letterpaper]{article} \\usepackage{lmodern} \\usepackage[T1]{fontenc} \\usepackage{amsmath} \\usepackage{graphicx} \\usepackage{calc} \\newcommand{\\...\n477 views\n\nMultiplying command argument by factor\n\nI am trying to use calc to perform a basic multiplication of arguments of a user-defined command, like this: \\def\\Verdana#1{ \\normalfont \\fontsize{#1}{#1 * \\real{1.2}} \\VerdanaFont \\selectfont} ...\n96 views\n\nMake a CV auto updating\n\nI would like to create a code to insert in my CV that make it auto update. The hypotetic sentence is this one: \"Engineer with twenty experience years\", where twenty is generated by, e.g., \\startyear{...\n77 views\n\nCalc and mathtools : issue\n\nI have an issue when using titlesec with mathttools : l.19 \\addtocontents{toc}{\\setcounter{tocdepth}{0}} ! Undefined control sequence. Here is an minimal example : Can ...\n304 views\n\nRelative coordinates & Calc library\n\nAttached is the code to draw a simple tree. I wish to get the NEGF node to appear in a middle location between the \"west\" of the \\node {Without Illumination}, and \"east\" of the {Geometric} node. I ...\n32 views\n\nDimension too large for TikZ modulo arithmetic [duplicate]\n\n\\documentclass[a4paper,10pt]{article} \\usepackage[utf8]{inputenc} \\usepackage{tikz} \\usepackage{ifthen} \\usetikzlibrary{calc} \\begin{document} \\def\\sides{50} \\pgfmathsetmacro\\lmu{\\sides -1} \\...\n934 views\n\nMeasuring the height of a box\n\nSolution in Edit 3. It works well, but seems to need an optimization. :) MWE: \\documentclass{scrartcl} \\usepackage{calc} \\usepackage{mathptmx} \\usepackage{anyfontsize} \\newcommand{\\Title}{ \\...\n627 views\n\nWhat unit of measurement is \\widthof using\n\nFor various purposes I need to know the width of a given text. The easiest way to do this is to use the \\widthof{} command from the calc package. Issue is that I can't understand what unit of ...\n563 views\n\nMany errors given by the calc package\n\nI know that the title is not clear at all; the issue is that I'm trying to use the calc package to compute the value of a certain counter, and I receive two different error messages, according to some ...\n105 views\n\ncalc-package prevents \\headheight to change\n\nI am trying to automize setting the correct \\headheight following Heiko Oberdiek's approach. It is based on the fact that the fancyhdr package usually increases the \\headheight as required and saves ...\n2k views\n\ntikz Error some package has redefined the meaning of the math-mode dollar sign\n\nI am using Tikz code from package-lineno-not-working-well-skips-line-texlive-2016 and everything have been working very well. When I added some verbatim text at the end, now I get this error from ..." ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.81790113,"math_prob":0.67377186,"size":12569,"snap":"2019-43-2019-47","text_gpt3_token_len":3409,"char_repetition_ratio":0.15009949,"word_repetition_ratio":0.017653167,"special_character_ratio":0.25005966,"punctuation_ratio":0.12743437,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.969299,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2019-10-20T12:10:51Z\",\"WARC-Record-ID\":\"<urn:uuid:55dd2173-2ed1-449b-89d5-f9dc0eebbfbc>\",\"Content-Length\":\"239805\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:a5a2f811-3caf-4276-8e95-b42fd179ba6e>\",\"WARC-Concurrent-To\":\"<urn:uuid:2fbaebc0-fef1-42ce-9307-c9c61342866b>\",\"WARC-IP-Address\":\"151.101.193.69\",\"WARC-Target-URI\":\"https://tex.stackexchange.com/questions/tagged/calc\",\"WARC-Payload-Digest\":\"sha1:OWQR53TTOZN7WRDMAH336HEKVUBYIC3M\",\"WARC-Block-Digest\":\"sha1:CHJ46ZFDSCLS5IG32WU3YHNTTCGH7H5E\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2019/CC-MAIN-2019-43/CC-MAIN-2019-43_segments_1570986707990.49_warc_CC-MAIN-20191020105426-20191020132926-00062.warc.gz\"}"}
http://scholarpedia.org/article/Szemer%C3%A9di%27s_Theorem
[ "# Szemerédi's Theorem\n\nPost-publication activity\n\nCurator: Ben Joseph Green\n\nSzemerédi's theorem states that any \"positive fraction\" of the positive integers will contain arbitrarily long arithmetic progressions $$a, a+r, a+2r, \\ldots, a+(k-1)r\\ .$$ More precisely,\n\nTheorem (Szemerédi's theorem) Let $$A \\subset {\\Bbb Z^+}$$ be a subset of the positive integers of positive upper density, i.e., $$d^*(A) := \\limsup_{N \\to \\infty} \\frac{\\# \\{ n \\in A: n \\leq N \\}}{N} > 0\\ .$$ Then for any integer $$k \\geq 1\\ ,$$ the set $$A$$ contains at least one arithmetic progression $$a, a+r, a+2r, \\ldots, a+(k-1) r$$ of length $$k\\ ,$$ where $$a, r$$ are positive integers.\n\nIntuitively, this theorem is saying that long arithmetic progressions are so prevalent that it is impossible to eradicate them from a set of positive integers unless one shrinks the set so much that it has density zero. This deep fact is rather striking, given that many other patterns (e.g., geometric progressions $$a, a r, a r^2$$ with $$r>1$$) are much easier to eradicate (for instance, the set of squarefree numbers has positive upper density $$6/\\pi^2 \\ ,$$ but clearly contains no $$a r^2$$). One notable feature of the theorem is that there is almost no assumption made on the set $$A\\ ,$$ other than one of size; the set $$A$$ could be very structured (e.g. an infinite arithmetic progression) or very irregular (e.g. a randomly generated set), and yet one has long arithmetic progressions in either case. In fact, understanding this dichotomy between structure and randomness is the key to all the known proofs of Szemerédi's theorem: it is possible to generate arithmetic progressions from structure and from randomness, but for two completely different reasons, and so one must somehow separate the structure from the randomness in order to proceed. The depth of this theorem can also be discerned from Behrend's counterexample to a natural stronger version of this theorem, which will be discussed later.\n\nSzemerédi's theorem was initially conjectured by Erdős and Turán [ET] in 1936, but was only proven in full generality by Szemerédi [Sz2] in 1975. Several further important proofs of this theorem, using different types of analysis, were subsequently given, including an ergodic-theory proof by Furstenberg [F] in 1977, a Fourier-analytic and combinatorial proof by Gowers [Go2] in 2002, and proofs based on hypergraphs given by Gowers [Go3], [Go4] and by Nagle, Rődl, Schacht, and Skokan [NRS], [RSc], [RSk], [RSk2]. These proofs have also led to a number of deep and powerful generalisations and variants of the above theorem. Despite this multitude of proofs, though, the theorem is still considered quite deep and difficult.\n\nSzemerédi's theorem was a major landmark in additive number theory for several reasons. Not only did it solve a well-known conjecture in the subject, the powerful methods introduced in order to prove this theorem have turned out to be tremendously useful in many other problems, and have stimulated development and progress in multiple fields of mathematics. Also, the theorem itself has been applied to prove many other results; for instance, it was a key component in the argument of Green and Tao [GT] demonstrating that the prime numbers contain arbitrarily long arithmetic progressions. (The primes have density zero, so Szemerédi's theorem does not apply directly; instead, the argument in [GT] combines Szemerédi's theorem with an additional transference argument, together with some number-theoretic estimates.)\n\n## Contents\n\n### History\n\nThe first significant precursor to Szemerédi's theorem was van der Waerden's theorem [vdW], which appeared in 1927:\n\nTheorem (van der Waerden's theorem) Suppose that the positive integers $${\\Bbb Z}^+$$ are colored using finitely many colors. Then at least one of the color classes will contain arbitrarily long arithmetic progressions.\n\nThis theorem can be easily deduced from Szemerédi's theorem (since, by the pigeonhole principle, at least one of the color classes will have positive upper density), but it is far more difficult to deduce Szemerédi's theorem from van der Waerden's theorem. For example, the hypotheses of van der Waerden's theorem imply that at least one color class will contain arbitrarily long geometric progressions, but as noted above there are sets with upper density larger than $$1/2$$ that do not even have 3 term geometric progressions.\n\nvan der Waerden's theorem is similar in spirit to Ramsey's theorem [Ram] for colorings of complete graphs, which appeared at about the same time; indeed these two theorems initiated the field of Ramsey theory, in which one seeks to establish the existence of various structures inside a color class of a larger structure.\n\nVan der Waerden's proof of his theorem was elementary and quite short, but it was also highly recursive in nature, and so the effective bounds that the proof provided were very weak. For instance, if one colored the positive integers into $$r$$ colors and requested an arithmetic progression of length $$k$$ which was monochromatic (i.e. contained inside a single color class), then the proof did assert that such a progression would exist, and that all elements of that progression would be less than a certain finite quantity $$W(k,r)$$ depending on $$k$$ and $$r$$ (with the best such $$W(k,r)$$ known as the van der Waerden number of $$k$$ and $$r$$), but the upper bound on $$W(k,r)$$ provided by the proof grew incredibly quickly; even for $$r=2\\ ,$$ the growth rate was like an Ackermann function in $$k\\ .$$ (This growth rate was not improved until 1988, when Shelah [Sh] provided a growth rate which was primitive recursive, though still rather rapidly growing; the best upper bound currently known on $$W(k,r)$$ for general $$k$$ is $$2^{2^{r^{2^{k+9}}}}\\ ,$$ due to Gowers [Go2] in 2001, and which was obtained via Szemerédi's theorem.)\n\nIn 1936, Erdős and Turán [ET] investigated the problem further, motivated in part by an old conjecture (proven in 2004) that the primes contained arbitrarily long arithmetic progressions. They proposed two conjectures which would imply van der Waerden's theorem. The first (weaker) conjecture was the statement that became Szemerédi's theorem; the second (stronger) conjecture, which they attribute to Szekeres, asserted an extremely quantitative bound, in particular that given any $$k \\geq 1$$ there existed an $$\\varepsilon > 0\\ ,$$ such that any subset of $$\\{1,\\ldots,n\\}$$ of cardinality at least $$n^{1-\\varepsilon}$$ would necessarily contain at least one arithmetic progression of length $$k\\ ,$$ if $$n$$ was sufficiently large depending on $$k\\ .$$ They noted that this conjecture was in particular more than sufficient to guarantee that the primes contained arbitrarily long arithmetic progressions.\n\nThe stronger of these conjectures was disproven (even when $$k=3\\ ,$$ which is the first non-trivial case) by Salem and Spencer [SS] in 1942, with improvements to the counterexample given by Behrend [Be] and Moser [M]. Remarkably, Behrend's 1946 counterexample is still the best known for the $$k=3$$ problem (higher $$k$$ variants of this example were constructed by Rankin [Ran]). It is based, ultimately, on the simple observation that a sphere in any dimension is convex and thus cannot contain any arithmetic progressions of length three. By working with a suitable discrete analogue $$\\{ x \\in {\\Bbb Z}^d: |x|^2 = r^2 \\}$$ of a sphere and then transplanting that set to the integers, Behrend was able to create, for arbitrarily large $$n\\ ,$$ a subset of $$\\{1,\\ldots,n\\}$$ of cardinality at least $$n \\exp( - c \\sqrt{\\log n} )$$ for some absolute constant $$c > 0\\ ,$$ which did not contain any arithmetic progressions of length three. In particular, the size of this set is asymptotically larger than $$n^{1-\\varepsilon}$$ for any fixed $$\\varepsilon > 0\\ .$$ This type of counterexample rules out a number of elementary approaches to Szemerédi's theorem (e.g. using arguments based only on the pigeonhole principle, or the Cauchy-Schwarz inequality), and strongly suggests that the proof of these conjectures must be somehow \"iterative\" in nature.\n\nThe cases $$k < 3$$ of Szemerédi's theorem are trivial. The $$k=3$$ case was first settled by Roth [R] in 1953. This argument employed methods from Fourier analysis (or more specifically, the Hardy-Littlewood circle method). Roughly speaking, the idea was to assume for contradiction that one had a set of integers of positive density which contained no arithmetic progressions of length three, and then to use Fourier analysis to construct a new set of integers with even higher density which still contained no such progressions. Eventually one would be forced to construct a set of density exceeding $$1\\ ,$$ which was of course absurd.\n\nRoth's elegant argument failed to extend to the case of general $$k\\ ,$$ for reasons which were not fully understood until the work of Gowers [Go2] much later. The $$k=4$$ case was first established by Szemerédi [Sz] in 1969 by an elementary but intricate combinatorial argument. Even with this breakthrough, the higher $$k$$ case continued to prove to be quite difficult, and it was only in 1975 that Szemerédi [Sz2] was able to establish his theorem in full generality. This problem was given a cash prize of $1000 by Paul Erdős, who was well-known for assigning prizes to difficult problems; Szemerédi was first mathematician to ever collect a prize of that magnitude from Erdős. (In 1984, Frankl and Rődl[FR] solved another problem to which Erdős offered$1000, although they only accepted $500 due to Erdős' financial situation[Ba].) Erdős later offered$3000 for a proof of a stronger conjecture (sometimes mis-attributed to [ET]), namely that any set $$A$$ of positive integers whose sum of reciprocals $$\\sum_{n \\in A} \\frac{1}{n}$$ was divergent, would necessarily contain arbitrarily long progressions; this conjecture remains open to this day, even if one only seeks a single progression of length three. However, in the special case that the set $$A$$ consists of the prime numbers or a relatively dense subset thereof, the result was established in [GT].\n\nSzemerédi's proof was very sophisticated (though elementary), and introduced a number of important new tools, most notably what is now known as the Szemerédi regularity lemma for graphs, which roughly speaking allows one to approximate any large dense graph in a certain statistical sense by a bounded complexity random graph. (This lemma has since had an enormous number of applications in combinatorics and computer science; see [KS] for a survey.) Two years later, in 1977, Furstenberg [F] introduced a dramatically different proof of that theorem, recasting the problem as one in dynamical systems, and then using methods from ergodic theory to solve the problem. More specifically, Furstenberg showed that Szemerédi's theorem was logically equivalent to the following, very different-looking, result:\n\nTheorem (Furstenberg recurrence theorem) Let $$(X, {\\mathcal B}, \\mu)$$ be a probability space (thus $${\\mathcal B}$$ is a $$\\sigma$$-algebra of subsets of $$X\\ ,$$ and $$\\mu: {\\mathcal B} \\to [0,1]$$ is a probability measure on $$X$$), let $$T: X \\to X$$ be a measure-preserving bijection (thus $$\\mu(T(E)) = \\mu(E)$$ for all measurable $$E$$); we refer to $$(X,{\\mathcal B},\\mu,T)$$ as a measure-preserving system. Then for any set $$E \\subset X$$ of positive measure and every integer $$k \\geq 1$$ there exist infinitely many positive integers $$n$$ such that the set $$E \\cap T^n E \\cap \\ldots \\cap T^{(k-1)n} E$$ has positive measure. In fact, we have the slightly stronger statement $\\displaystyle\\liminf_{N \\to\\infty} \\frac{1}{N} \\sum_{n=1}^N \\mu(E \\cap T^n E \\cap \\ldots \\cap T^{(k-1)n} E ) > 0.$\n\nThe question of whether the sequence in the above equation was convergent (i.e. if the limit inferior could be replaced with a limit), and what that limit was, turned out to be surprisingly difficult, and was only settled in 2005 by Host and Kra [HK]. (A different proof was given in 2007 by Ziegler [Z] and a geometric interpretation of the limit was given by Ziegler in [Z2]; a third proof was given very recently in [T]). The $$k=2$$ case of this theorem is the classical Poincaré recurrence theorem, while the $$k=1$$ case is trivial. Just as Szemerédi's theorem is remarkable for requiring very few assumptions on the set $$A\\ ,$$ Furstenberg's theorem is remarkable for requiring very few assumptions on the probability space $$(X,\\mu)\\ ,$$ the shift map $$T\\ ,$$ or the set $$E\\ .$$\n\nThe equivalence of Szemerédi's theorem and the Furstenberg recurrence theorem is due to a more general principle, first formulated in [F], and now known as the Furstenberg correspondence principle. Roughly speaking, the correspondence links sets $$A$$ of integers with sets $$E$$ in a measure-preserving system $$(X,{\\mathcal B},\\mu,T)$$ by looking at finite segments $$\\{ n \\in A: 1 \\leq n \\leq N\\}$$ of $$A$$ and \"taking limits\"' as $$N \\to \\infty$$ in a certain weak topology. The proof of the Furstenberg recurrence theorem is shorter than the original proof of Szemerédi's theorem, and relies primarily on an induction on the $$\\sigma$$-algebra $${\\mathcal B}\\ .$$ A key theme in the proof is the dichotomy between two types of properties in a measure-preserving system, namely periodicity (or more precisely, almost periodicity) and mixing (or more precisely, weak mixing). Very roughly speaking, when there is periodicity, then we expect $$T^n E$$ to be close to $$E$$ for many $$n\\ ,$$ whereas when we have mixing, we expect $$T^n E$$ to become \"independent\" of $$E$$ for large $$n\\ .$$ The key insights are that periodicity and mixing can both be used to create recurrence, and that arbitrary measure-preserving systems can be decomposed into periodic and mixing components (the precise statement of this is now known as the Furstenberg structure theorem). For more details see [FKO], [F2]. Furstenberg's method led to a vast number of generalisations and other developments, some of which we will discuss below.\n\nThe Fourier-analytic method of Roth, which treated the $$k=3$$ case, was finally extended to the $$k=4$$ case by Gowers [Go] in 1998, and then to the general case by Gowers [Go2] in 2001. (An earlier argument of Roth [R2] combined Szemerédi's arguments with those in [R] to produce a hybrid proof of the $$k=4$$ case of Szemerédi's theorem.) Gowers realised that classical Fourier analysis, which relied on linear phases such as $$e^{2\\pi i n \\theta}\\ ,$$ were suitable tools for detecting arithmetic progressions of length three, but already for progressions of length four one needed to work with a generalised notion of Fourier analysis, in which quadratic phases such as $$e^{2\\pi i n^2 \\theta}$$ made an appearance. (The reason for this is technical, but is related to the fact that a function $$f: {\\Bbb R} \\to {\\Bbb R}$$ is linear, then its values on two points of an arithmetic progression can be extrapolated to evaluate the value on the third (i.e. two points determine a line). For quadratic $$f\\ ,$$ this property is no longer true, however it remains true that the values on three points on an arithmetic progression can be extrapolated to evaluate the value on the fourth.) Gowers' proofs then proceeded by developing this generalised Fourier analysis and combining them with several innovative new tools, including what is now known as the Balog-Szemerédi-Gowers lemma which is now of fundamental importance in additive combinatorics and number theory. Gowers' argument also gave fairly reasonable quantitative bounds on quantities such as the van der Waerden number $$W(k,r)\\ .$$ (Szemerédi's original argument used van der Waerden's theorem inside the proof, and so did not provide a better bound on that theorem; the argument of Furstenberg was infinitary and thus provided no explicit bound at all, although recently [T] it was shown that a quantitative bound could, in principle, be extracted from this type of argument.) Further variants and extensions of Gowers' argument were carried out more recently by Green and Tao [GT2], at least in the cases $$k \\leq 4\\ .$$\n\nA fourth type of proof, based on the theory of graphs and hypergraphs, was introduced by Ruzsa and Szemerédi [RS] in 1978, who observed that Roth's theorem could in fact be deduced from a more abstract graph-theoretical result which is now known as the triangle removal lemma; this lemma asserts that if a graph $$G$$ on $$n$$ vertices contains at most $$\\varepsilon n^3$$ triangles, then all of these triangles can be deleted at the cost of removing at most $$c(\\varepsilon) n^2$$ edges, where $$c(\\varepsilon)$$ is a quantity which goes to zero as $$\\varepsilon$$ goes to zero. They then showed that this removal lemma followed easily from the regularity lemma introduced earlier by Szemerédi. It was then natural to generalize these observations to tackle the full strength of Szemerédi's theorem, but this required one to exchange the familiar setting of graphs to the more difficult setting of hypergraphs (in which each \"edge\" does not connect just two vertices, but can connect three or more vertices together). One of the key difficulties was to obtain a sufficiently strong analogue of the Szemerédi regularity lemma for hypergraphs. After some preliminary steps in this direction [C], [FR2], this program was completed by Gowers [Go3], [Go4] and by Nagle, Rődl, Schacht, and Skokan [NRS], [RSc], [RSk], [RSk2] in 2006. More recently, there have been further developments of the hypergraph regularity method, providing some slightly different reproofs of Szemerédi's theorem [T2], [T4], [I], [ES].\n\nVery recently, it has been realised that these four approaches to proving Szemerédi's theorem are interrelated. For example, connections between the regularity lemma approach and the Fourier-analytic approach were uncovered in [Gr2], while connections between hypergraphs and ergodic theory were uncovered in [T4], and connections between the Fourier-analytic and ergodic approaches were uncovered in [GT2] and exploited systematically in [GT3]. The result in [GT] uses ideas and tools from all four methods.\n\n### Generalisations\n\nSzemerédi's theorem has been generalised and strengthened in many different directions. The following list is only a representative sample of some of these.\n\nFirstly, one can \"bootstrap\" Szemerédi's theorem to yield not just a single progression of length $$k\\ ,$$ but in fact many such progressions. Indeed, an averaging argument of Varnavides [V] gives\n\nTheorem (Varnavides' theorem) Let $$k \\geq 1$$ and $$0 < \\delta < 1\\ .$$ Then there exists $$N(k,\\delta) > 0$$ with the following property: if $$n > N(k,\\delta)\\ ,$$ then any subset $$A$$ of $$\\{1,\\ldots,n\\}$$ of cardinality at least $$\\delta n$$ will contain at least $$n^2 / N(k,\\delta)$$ arithmetic progressions of length $$k\\ .$$\n\nSzemerédi's theorem can also be extended to multiple dimensions, asserting that any subset of a lattice of positive Banach density will contain arbitrarily shaped \"constellations\":\n\nTheorem (Furstenberg-Katznelson theorem) [FK] Let $$d \\geq 1\\ ,$$ and let $$A \\subset {\\Bbb Z}^d$$ be a set of positive upper Banach density, thus $$d^*(A) = \\limsup_{N \\to \\infty} \\#(A \\cap [-N,N]^d) / (2N+1)^d > 0\\ .$$ Then for any $$v_1,\\ldots,v_k \\in {\\Bbb Z}^d\\ ,$$ there exist infinitely many $$a \\in {\\Bbb Z}^d$$ and positive integers $$r$$ such that $$a+rv_1, \\ldots, a+rv_k \\in A\\ .$$\n\nNote that Szemerédi's original theorem is the case when $$d=1$$ and $$v_i=i-1$$ for $$1 \\leq i \\leq k\\ .$$\n\nA significantly stronger (and more difficult) generalisation of this theorem replaces $${\\Bbb Z}^d$$ by an arbitrary set $$F^d\\ ,$$ as follows:\n\nTheorem (Density Hales-Jewett theorem) [FK3] Let $$F \\subset {\\Bbb Z}$$ and $$0 < \\delta < 1\\ .$$ If $$d$$ is sufficiently large depending on $$\\# F$$ and $$\\delta\\ ,$$ then any subset $$A$$ of $$F^d$$ of cardinality at least $$\\delta (\\# F)^d$$ will contain at least one set of the form $$\\{ a + tr: t \\in F \\}$$ where $$a, r \\in {\\Bbb Z}^d$$ with $$r$$ non-zero.\n\nThis significantly generalises the classical Hales-Jewett theorem [HJ]. There is an equivalent formulation of this theorem in which $$F$$ is an arbitrary finite set (not necessarily consisting of integers), and the set $$\\{ a + tr: t \\in F \\}$$ is replaced by a combinatorial line, but we will not state this version here as it requires some further notation. We do however note that this theorem implies a version of Szemerédi's theorem for finite abelian groups:\n\nCorollary Let $$k \\geq 1$$ and $$0 < \\delta < 1\\ .$$ If $$G$$ is a finite group of sufficiently large order depending on $$k$$ and $$\\delta\\ ,$$ then for any subset $$A$$ of $$G$$ of cardinality $$\\# A \\geq \\delta \\# G$$ there exists $$a, r \\in G$$ with $$r$$ non-zero such that $$a, a+r, \\ldots, a+(k-1) r \\in A\\ .$$\n\nThe $$k=3$$ case of this corollary was established by Meshulam [Me].\n\nIn another direction, Bergelson and Leibman [BL] established an extension of the Furstenberg-Katznelson theorem for polynomials:\n\nTheorem (Bergelson-Leibman theorem) [BL] Let $$d \\geq 1\\ ,$$ and let $$A \\subset {\\Bbb Z}^d$$ be a set of positive upper Banach density, thus $$\\limsup_{N \\to \\infty} \\#(A \\cap [-N,N]^d) / (2N+1)^d > 0\\ .$$ Then for any polynomials $$P_1,\\ldots,P_k: {\\Bbb Z} \\to {\\Bbb Z}^d$$ with $$P_1(0)=\\ldots=P_k(0) = 0\\ ,$$ there exist infinitely many $$a \\in {\\Bbb Z}^d$$ and positive integers $$r$$ such that $$a+P_1(r),\\ldots,a+P_k(r) \\in A\\ .$$\n\nThis theorem can be extended in a rather technical manner involving measure-preserving shift operators which generate a nilpotent group. On the other hand, these results fail once the group generated by the shifts ceases to be nilpotent. See [L], [BL2].\n\nLet $$k$$ and $$A$$ be as in Szemerédi's theorem. The set $$R_k$$ of all possible $$r$$ generated by that theorem has been studied by several authors (see [BHMP]). The arguments in [F] or [FKO] can be modified to yield the assertion that $$R_k$$ is syndetic, i.e. it has bounded gaps. In [FK2] it was shown that $$R_k$$ is an $$IP^*$$-set, which means that given any infinite set $$B$$ of positive integers, $$R_k$$ contains at least one element which can be expressed as the sum of distinct elements of $$B\\ .$$\n\nNow take $$\\varepsilon > 0\\ ,$$ and consider the set $$R_{k,\\varepsilon}$$ of all $$r$$ such that $$d^*( A \\cap (A-r) \\cap \\ldots \\cap (A-(k-1)r) ) > d^*(A)^k - \\varepsilon\\ .$$ For $$k \\leq 4$$ it is known that $$R_{k,\\varepsilon}$$ is syndetic, but this claim breaks down for $$k > 4\\ ;$$ see [BHK]. (The case $$k=2$$ is known as the Khintchine recurrence theorem.)\n\nIn a rather different direction, Szemerédi's theorem has been shown to follow from some general theorems in graph and hypergraph theory. For instance, the $$k=3$$ case of this theorem follows from the triangle removal lemma mentioned earlier. A typical result of this type is\n\nTheorem (Hypergraph removal lemma) Let $$G = (V,E)$$ be a $$k$$-uniform hypergraph (i.e. each edge has exactly $$k$$ vertices), then for any $$\\delta > 0$$ there exists an $$\\varepsilon > 0$$ if $$H = (W,F)$$ is any $$k$$-uniform hypergraph which contains at most $$\\varepsilon (\\# V)^{\\# W}$$ copies of $$G\\ ,$$ then it is possible to delete at most $$\\delta (\\# V)^k$$ edges in $$H$$ to create a hypergraph with no copy of $$G$$ whatsoever.\n\nFor a proof see [Go4], [RSk2], [T2], [T4], [ES], or [I]. Several refinements of this theorem, with applications to property testing of hypergraphs, are currently being pursued.\n\nLet $$r_k(n)$$ denote the size of the largest subset of $$\\{1,\\ldots,n\\}$$ which does not contain any arithmetic progressions of length $$n\\ .$$ The exact size of $$r_k(n)$$ is still unknown; Szemerédi's theorem asserts that $$r_k(n) =o(n)$$ for each $$k\\ .$$ For $$k=3\\ ,$$ the best known lower and upper bounds for $$r_3(n)$$ are $\\displaystyle n \\exp(-C\\sqrt{\\log n}) \\leq r_3(n) \\leq C n \\frac{(\\log \\log n)^{1/2}}{\\sqrt{\\log n}}$ for some absolute constant $$C > 0\\ ,$$ due to Behrend [Be] and Bourgain [Bo] respectively. (In a recent unpublished paper, Bourgain has improved the upper bound to $$C n \\frac{(\\log \\log n)^2}{(\\log n)^{2/3}}\\ .$$) For general $$k\\ ,$$ the best known bounds are $\\displaystyle n \\exp(-C\\log^{1/(\\lfloor \\log_2(k-1) \\rfloor+1)} n) \\leq r_k(n) \\leq n / (\\log_2 \\log_2 n)^{1/2^{k+9}}$ due to Rankin [Ran] and Gowers [Go2] respectively, though for $$k=4$$ the upper bound has been improved to $$n \\exp( -C \\sqrt{\\log \\log n} )$$ by Green and Tao [GT4].\n\nSzemerédi's theorem asserts that dense subsets of the integers contain long arithmetic progressions. It turns out that one can replace the integers with certain other sets, most notably the set of primes, using a transference principle: see [Gr], [GT]." ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.8894543,"math_prob":0.99905497,"size":32714,"snap":"2023-40-2023-50","text_gpt3_token_len":9230,"char_repetition_ratio":0.13274229,"word_repetition_ratio":0.05595215,"special_character_ratio":0.2902427,"punctuation_ratio":0.15895817,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99994254,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2023-10-05T01:53:52Z\",\"WARC-Record-ID\":\"<urn:uuid:4f8abfe5-6574-4acf-9566-8171d0745715>\",\"Content-Length\":\"62528\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:09f872a9-7814-4141-b2b1-29e0d553e491>\",\"WARC-Concurrent-To\":\"<urn:uuid:fe879799-1fe1-495f-942f-dbd9eee50d5e>\",\"WARC-IP-Address\":\"173.255.237.117\",\"WARC-Target-URI\":\"http://scholarpedia.org/article/Szemer%C3%A9di%27s_Theorem\",\"WARC-Payload-Digest\":\"sha1:FMBAVANGMH6HSKQVEXIGF3Y7AKATVYZ3\",\"WARC-Block-Digest\":\"sha1:VLU37LWABCTJT5M6EN7EFMVHPXK5DJXB\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2023/CC-MAIN-2023-40/CC-MAIN-2023-40_segments_1695233511717.69_warc_CC-MAIN-20231005012006-20231005042006-00471.warc.gz\"}"}
https://crypto.stackexchange.com/questions/24753/whats-the-differences-among-blind-computation-secure-multi-party-computation
[ "# What's the differences among Blind Computation, Secure Multi-Party Computation, Secure Circuit Evaluation and Homomorphic Encryption\n\nWe know that Blind Computation, Secure Multi-Party Computation, Secure Circuit Evaluation and Homomorphic Encryption all can process the encrypted data, but I am puzzled by them. What are their differences?\n\nIn short,\n\nA cryptography scheme is a homomorphic encryption scheme if it is somehow equivalent to manipulate its plaintexts and its ciphertexts.\n\nSecure multi-party computation and secure circuit evaluation are protocols to calculate functions in a distributed way without disclosing the data owned by each party and blind computation is any technique for transforming the data in a manner such that a third-party can calculate a specific function $f$ over these transformed data without knowing the value of $f$ when applied over the real data.\n\nIt is not right to say that\n\nall can process the encrypted data\n\nIn fact, the only one that must process encrypted data by definition is homomorphic encryption, because a scheme $\\gamma$ is homomorphic for one operation $*$ if, considering $c_1 = E(m_1)$ and $c_2 = E(m_2)$, then $m_1 * m_2$ is equivalent to $c_1 * c_2$ (where equivalent means that $m_1 * m_2 = D(c_1 * c_2)$.\n\nSecure Multi-Party is any protocol for doing distributed computations without revealing the data owned by each party.\n\nFor example, if I have $n$ numbers, you have $m$ numbers and we find out how to calculate the average of these $n + m$ numbers in such a way that we will get the result, but I will not know your numbers and you will not know mine, then we are doing Secure Multi-Party Computation. It doesn't require homomorphic encryption. But, homomorphic encryption is typically used because it makes things easier.\n\nBlind computation (in this context) is a technique that aims to hide the input and the output values of a function, in such a way that this function can be calculated for one person and this person will not know the real values used as input and the real value of output. Note that in Secure Multi-Party Computation, unlike the blind computation, all the parties involved know the output value, and the function is typically calculated by all of them in some iterative process.\n\nFor example, if I have $n$ numbers $x_1, x_2, ..., x_n$ and I require you to calculate their average. Then, I generate random numbers $r_1, r_2, .., r_n$ and, instead of sending the real data to you, I send $x_1+r_1, x_2 + r_2, .., x_n + r_n$. Then, you will calculate an average $\\mu'$ that is not the real answer and send it me. Finally, I just have to subtract the random numbers divided by $n$ to get the real $\\mu$.\n\nThis example is too simple. Usually, the function to be computed is more complex and it's hard to figure out how to preprocess the data to hide them and come back to the result after the computation. So, again, homomorphic encryption is a good tool..." ]
[ null ]
{"ft_lang_label":"__label__en","ft_lang_prob":0.9009741,"math_prob":0.9964409,"size":2952,"snap":"2020-34-2020-40","text_gpt3_token_len":678,"char_repetition_ratio":0.13466758,"word_repetition_ratio":0.04828974,"special_character_ratio":0.23204607,"punctuation_ratio":0.114285715,"nsfw_num_words":0,"has_unicode_error":false,"math_prob_llama3":0.99912876,"pos_list":[0],"im_url_duplicate_count":[null],"WARC_HEADER":"{\"WARC-Type\":\"response\",\"WARC-Date\":\"2020-10-01T22:18:15Z\",\"WARC-Record-ID\":\"<urn:uuid:c72ee43a-0dff-474b-bc12-f103607a6f64>\",\"Content-Length\":\"154646\",\"Content-Type\":\"application/http; msgtype=response\",\"WARC-Warcinfo-ID\":\"<urn:uuid:7a7e3a92-77bd-4120-b4e7-80a3e1c9f36a>\",\"WARC-Concurrent-To\":\"<urn:uuid:48eab71e-45b3-46ca-9b9d-bdd4f2366d1a>\",\"WARC-IP-Address\":\"151.101.193.69\",\"WARC-Target-URI\":\"https://crypto.stackexchange.com/questions/24753/whats-the-differences-among-blind-computation-secure-multi-party-computation\",\"WARC-Payload-Digest\":\"sha1:KSWOV4U3DXUWM3RJSYYZ7WMIKUNBWL27\",\"WARC-Block-Digest\":\"sha1:DPPT7X76OYS4SF5VICOM2GQ3CUB4HYRU\",\"WARC-Identified-Payload-Type\":\"text/html\",\"warc_filename\":\"/cc_download/warc_2020/CC-MAIN-2020-40/CC-MAIN-2020-40_segments_1600402132335.99_warc_CC-MAIN-20201001210429-20201002000429-00578.warc.gz\"}"}