content stringlengths 86 994k | meta stringlengths 288 619 |
|---|---|
Quadratic Functions: Summary
Terms & Coefficients
ax ^2 – the quadratic term (It’s not a quadratic without this x^2 term. 🙂 )
a is the coefficient; it includes the sign (positive or negative), but not the variable x^2.
The larger the magnitude of a, the more narrow the parabola will be because the output will increase faster.
(“Magnitude” means the absolute value – ignore the sign.)
If a is:
positive, the parabola opens upward (memory aid: positive = smile
negative, the parabola opens downward (memory aid: negative = frown
(Note that the coefficient “a” is the same for both the standard and the vertex forms of the equation.)
bx – the linear term
b is the coefficient, including the sign but not the x.
If b = 0 (so there’s no linear term), the vertex and the y-intercept (vertical intercept) will be the same point.
This term moves the vertex off of the x-axis.
│If a is │and b is│the vertex will move │
│positive│positive│down & left │
│positive│negative│down & right │
│negative│positive│up & right │
│negative│negative│up & left │
c – the constant term – also known as the initial value
The constant term is what the output (y) of the equation equals when the input (x) is set equal to zero. This is why it is known as the initial value. Also, because x = 0 on the y-axis:
The vertical intercept is (0, c)
This is an example of a parabola from a quadratic equation with a positive quadratic term and no linear term. It opens upward, is symmetric around the y-axis, and the vertex is equal to the
This is an example of a parabola from a quadratic equation with a negative quadratic term and no linear term. It opens downward, is symmetric around the y-axis, and the vertex is equal to the
Top: This is an example of a parabola from a quadratic equation with a positive quadratic term and no linear term. It opens upward, is symmetric around the y-axis, and the vertex is equal to the
Bottom: This is an example of a parabola from a quadratic equation with a negative quadratic term and no linear term. It opens downward, is symmetric around the y-axis, and the vertex is equal to the
This is an example of a graph of a parabola opening upward with the vertex to the left and below the y-intercept because a and b are both positive.
This is an example of a graph of a parabola opening upward with the vertex to the right and below the y-intercept because a is positive and b is negative.
Top: This is an example of a graph of a parabola opening upward with the vertex to the left and below the y-intercept because a and b are both positive.
Bottom: This is an example of a graph of a parabola opening upward with the vertex to the right and below the y-intercept because a is positive and b is negative.
This is an example of a graph of a parabola opening upward with the vertex to the left and above the y-intercept because a and b are both negative.
This is an example of a graph of a parabola opening upward with the vertex to the right and above the y-intercept because a is negative and b is positive.
Top: This is an example of a graph of a parabola opening upward with the vertex to the left and above the y-intercept because a and b are both negative.
Bottom: This is an example of a graph of a parabola opening upward with the vertex to the right and above the y-intercept because a is negative and b is positive.
Summary of the most useful points
Most quadratic problems, especially word problems, can be answered by using 4 key points and making a quick, labeled sketch. I go over these in more detail on another page.
1. The vertical intercept, (0, c)
2. The axis of symmetry
x = ^−b/[(2a)] (The axis of symmetry is an equation and requires both sides of the equal sign.)
3. The vertex, (h, k)
h = ^−b/[(2a) ](Notice that the x-value of the vertex is the same as the value of the axis of symmetry.)
k = f(h)
4. The x-intercept(s), if any. There may be zero, one, or two x-intercepts.Find the discriminate: b^2 − 4ac
If the discriminate is:
• negative, there are NO x-intercepts (no solution)
• zero, there is ONE x-intercept (one solution)
• positive, there are TWO x-intercepts (two solutions)
If the discriminate is zero or positive, solve for the x-intercepts either using the quadratic formula or by factoring. Because the discriminate is the part under the square root and you already
solved that part in order to find out if there were any x-intercepts, you can just plug the single number into the square root, making the formula a bit easier to calculate.
\large \mathrm{ x = \dfrac{- \color{blue} b \color{black} \pm \sqrt{\color{blue}b \color{black}^2 - 4 \color{red}a \color{purple}c}}{2 \color{red}a}} \\ \: \\ \large \mathrm{x = \dfrac{- \color{blue}
b \color{black} \pm \sqrt{discriminate}}{2 \color{red}a}}
The vertex form of a quadratic equation is covered on the “Completing the Square” page, but it looks like this:
f(x) = a(x − h)^2 + k
where (h, k) is the vertex of the parabola, and a is the same as the coefficient of the quadratic term in the standard form of the equation.
Inconsistency alert: Some books call the vertex form the standard form, but I think more books label it the way I have done.
I made the graphs in Excel and then copy-pasted them into FireAlpaca to save them as jpg files.
Please let me know in the comment section below if you have any questions or ideas about what you would like to see covered, and sign up for my e-mail list for more tips and news about science and
Leave a reply Cancel reply
This site uses Akismet to reduce spam. Learn how your comment data is processed. | {"url":"https://physicsmagic.com/quadratic-functions-summary/","timestamp":"2024-11-02T12:05:24Z","content_type":"text/html","content_length":"126744","record_id":"<urn:uuid:fa060d2b-d685-4a40-95d4-7112b187a310>","cc-path":"CC-MAIN-2024-46/segments/1730477027710.33/warc/CC-MAIN-20241102102832-20241102132832-00878.warc.gz"} |
pls help assap easy if 50x70 what is x
pls help assap easy
if 50x=70 what is x
Respuesta :
Step-by-step explanation:
To solve this equation, we need to isolate x.
To isolate x, divide both sides by 50.
So we are left with the equation x=1.4
Hope this helps!
Answer Link
Divide 50 on both sides
Answer Link | {"url":"http://cahayasurya.ac.id/question/12226510","timestamp":"2024-11-07T20:12:34Z","content_type":"text/html","content_length":"154615","record_id":"<urn:uuid:df045010-16c8-45ae-8b0d-d4d1b8e5e24d>","cc-path":"CC-MAIN-2024-46/segments/1730477028009.81/warc/CC-MAIN-20241107181317-20241107211317-00014.warc.gz"} |
Math multiplication puzzles with answers
Multiplication puzzles
Math multiplication puzzles with answers. Play multiplication square puzzles online. multiplication picture puzzles. puzzle pics multiplication. times table puzzle. Free multiplication puzzles for
grade 3. multiplication table puzzle. multiplication logic puzzles. multiplication puzzles for grade 4. Maths multiplication puzzles for grade 2. multiplication math puzzles. multiplication number
puzzles. multiplication table puzzles.
Click on 2 tiles so that they contain the multiplication problem and the corresponding result.
Watch as the picture appears.
Math multiplication puzzles with answers
Multiplication picture puzzles takes advantage of children's curiosity. As kids complete the multiplication tasks, they uncover nice pictures. They look forward to what they see in the picture and
therefore find the multiplication problems easy.
Printable multiplication puzzle worksheets
These online multiplication puzzles complement well with following printable multiplication puzzle worksheets. Printable multiplication square puzzles are designed for an use in the classroom or at
home. Everytime 12 new different multiplication puzzles are generated and create a new image.
Click the picture bellow and download the free multiplication puzzles in PDF:
Multiplication picture puzzles
50 multiplication puzzles
Fun printable puzzles to practice multiplication. 50 different pictures, many multiplication tasks.
US$ 3.00
Digital Download: 50 pages
Multiplication math puzzles: instructions
Are you looking for a fun multiplication activity? If you are working with 2nd grade and 3rd graders, you will love these multiplication math puzzles! Children will solve simple multiplication
problems to complete the multiplication puzzle game.
Students have to find out the answer for each square, then find the matching square and glue it onto it. Continue until reveal the funny picture. The best part is that this multiplication puzzle is
self-correcting. Kids realise if their answers are incorrect.
• Download the multiplication puzzle worksheets
• Print in color or black and white
• Cut the squares out
• Prepare some glue and scissors for each kid
Multiplication puzzle worksheets PDF
You can also download printable multiplication puzzles in PDF below. These free multiplication puzzles with answers are generated automatically.
Puzzle pics multiplication
Math multiplication puzzles are a great method how children learn multiplication in a fun way.
How to play multiplication puzzles online?
Half of the tiles contain the multiplication problem (blue text) and the other half of tiles contain the result (orange text).
Click first on the multiplication problem and then on the relevant result. Looking for pairs of math multiplication puzzles: the task and the result.
When the children manage to find a pair of tiles that belong together, the tiles disappear and the hidden picture of animal appears. When kids click on 2 tiles which don´t match, the tiles will flash
Did you click on a tile by mistake? It doesn't matter, click it again, the tile will be white again.
Continue to play times table puzzles until all tiles disappear. Then press the button "New puzzle" and a new free multiplication puzzle will be created.
Free multiplication picture puzzles
Multiplication square puzzles online
Learn multiplication easily with our multiplication puzzles for grade 3.
Usually, children solve the easiest multiplication tasks first, and at the end there remain problems they don't know so well. In this way they naturally learn multiplication.
The same principle is used for these division puzzles.
Multiplication Games 2nd Grade Math 3rd Grade Math Math puzzles | {"url":"https://matheasily.com/multiplication-puzzles.html","timestamp":"2024-11-04T01:28:35Z","content_type":"text/html","content_length":"52442","record_id":"<urn:uuid:544beb08-f7bc-4d4d-a328-a8966c0fbc1f>","cc-path":"CC-MAIN-2024-46/segments/1730477027809.13/warc/CC-MAIN-20241104003052-20241104033052-00054.warc.gz"} |
Collection of Solved Problems
Bubble in a Lake
Task number: 1283
An air bubble with a radius of 5.0 mm rises from the bottom of a lake 20.7 m deep. The temperature at the bottom of the lake is 7 °C and the temperature at the surface is 27 °C. The atmospheric
pressure is 100 kPa. How big will the bubble be when it reaches the surface?
• Hint
When the bubble rises from the bottom of the lake, it is not only the temperature what changes. It is also the pressure of the gas inside the bubble. This pressure corresponds to the pressure of
the water surrounding the bubble.
Determine the water pressure surrounding the bubble at the bottom and at the surface of the lake.
• Numerical values
h = 20.7 m the depth of the lake
r[1] = 5.0 mm = 5.0·10^-3 m the bubble radius at the bottom of the lake
t[1] = 7 °C => T[1] = 280 K the water temperature at the bottom of the lake
t[2] = 27 °C => T[1] = 300 K the water temperature at the surface of the lake
p[a] = 100 kPa = 1.00·105 Pa the atmospheric pressure
r[2] = ? the bubble radius at the surface of the lake
From The Handbook of Chemistry and Physics:
ρ = 1000 kg m^-3 the density of water
g = 9.81 m s^-2 the acceleration of gravity
• Analysis
When calculating the radius of the bubble, we use the fact that the pressure of the gas inside the bubble must be the same as the water pressure in the bubble surroundings. Otherwise the pressure
forces of the surroundings and of the gas inside the bubble at the air-water interface would be different and the bubble would either stretch or shrink.
The water pressure in the bubble surroundings is determined by the hydrostatic pressure (which is directly proportional to the depth, where the bubble is located) and the atmospheric pressure,
which thanks to Pascal’s law contributes with the same value to the overall pressure all over the volume of the lake. The gas pressure inside the bubble can be determined by the state equation.
Note: In the bubble there is air along with the saturated water vapor. In The Handbook of Chemistry and Physics we can find that the value of the pressure of saturated vapor for a given
temperature is a few kPa. So we can neglect this contribution of the saturated vapor pressure in the bubble to the atmospheric pressure.
• Solution
First, we express the water pressure p[1] at the bottom of the lake, which is a sum of the atmospheric and the hydrostatic pressure
\[ p_1\,=\,p_a\,+\,h\rho g \]
Realize that the pressure p[2] at the surface of the lake is equal to the atmospheric pressure
\[ p_2\,=\,p_a\,. \]
We assume that the gas inside the bubble behaves like an ideal gas, and therefore satisfies the ideal gas equation, i.e. that
\[ \frac{p_1V_1}{T_1}\,=\,\frac{p_2V_2}{T_2}\, \]
applies. The air pressure is the same as the pressure of the surrounding water, and the volume of the bubble can be determined by the volume formula of a sphere \(V\,=\,\frac{4}{3}\pi r^3\). Now
we substitute these relations into the state equation.
\[ \frac{\left(p_a+h\rho g\right)\frac{4}{3}\pi r_1^3}{T_1}\,=\,\frac{p_a\frac{4}{3}\pi r_2^3}{T_2} \] \[ \frac{\left(p_a+h\rho g\right)r_1^3}{T_1}\,=\,\frac{p_ar_2^3}{T_2} \]
and evaluate the unknown radius r[2]
\[ r_2^3\,=\,\frac{\left(p_a+h\rho g\right)r_1^3T_2}{p_aT_1} \] \[ r_2\,=\,\sqrt[3]{\frac{\left(p_a+h\rho g\right)r_1^3T_2}{p_aT_1}}\,. \]
Now we substitute the given values
\[ r_2\,=\,5\cdot{10^{-3}}\cdot \sqrt[3]{\frac{\left(10^5\cdot{20{.}7}\cdot 1000\cdot{9{.}81}\right)\cdot 300}{10^5\cdot{280}}}\,\mathrm{m} \] \[ r_2\,\dot{=}\,7{.}4\cdot{10^{-3}}\,\mathrm{m}\,=
\,7{.}4\,\mathrm{mm}\,. \]
Note: It is obvious that if we substituted the value of r[1] in millimeters, the resulting value would also be in millimeters
• Answer
The radius of the bubble at the surface of the lake will be approximately 7.4 mm.
• Comment on the other contributions to the pressure inside the bubble
The surface tension of water also contributes to the air pressure inside the bubble. The curved surface of liquid induces the capillary pressure given by:
\[ p_c\,=\,\frac{2\sigma}{r}\,\mathrm{,} \]
where r is the radius of the curvature of the liquid surface and σ is the surface tension of the liquid, its value for liquid being σ = 73 mNm^-1 = 0.073 Nm^-1.
We determine the value of the capillary pressure for both radii of the bubble:
\[ p_\mathrm{c1}\,=\,\frac{2\cdot{0{.}073}}{5\cdot{ 10^{-3}}}\,\mathrm{Pa}\,\dot{=}\,29\,\mathrm{Pa} \] \[ p_\mathrm{c2}\,=\,\frac{2\cdot{0{.}073}}{7{.}4\cdot{ 10^{-3}}}\,\mathrm{Pa}\,\dot{=}\,20
\,\mathrm{Pa}\,. \]
We can see that the value of the capillary pressure p[c] is in comparison to the atmospheric pressure p[a] negligible
Furthermore, there is saturated water vapor in the bubble along with the air. The pressure of the saturated water vapor for both temperatures is listed in The Handbook of Chemistry and Physics:
for t[1] = 7 °C the pressure is p[s] = 1.02 kPa
for t[1] = 27 °C the pressure is p[s] = 3.60 kPa
This contribution is also negligible in comparison to the atmospheric pressure. | {"url":"https://physicstasks.eu/1283/bubble-in-a-lake","timestamp":"2024-11-11T17:32:01Z","content_type":"text/html","content_length":"32331","record_id":"<urn:uuid:639635ea-bd1d-49c6-9b19-c3bcd84d8304>","cc-path":"CC-MAIN-2024-46/segments/1730477028235.99/warc/CC-MAIN-20241111155008-20241111185008-00433.warc.gz"} |
The Significance of Passive Acoustic Array-Configurations on Sperm whale Range Estimation when using the Hyperbolic Algorithm
Ph.D. Thesis, Heriot-Watt University, 2009. bibtex
author = {Hernández, J. V.},
title = {The Significance of Passive Acoustic Array-Configurations on Sperm
whale Range Estimation when using the Hyperbolic Algorithm},
school = {Heriot-Watt University},
year = {2009},
file = {:Hernandez2009.pdf:PDF},
owner = {Tiago},
subdatabase = {postdoc},
timestamp = {2009.03.03} | {"url":"https://bibbase.org/network/publication/hernndez-thesignificanceofpassiveacousticarrayconfigurationsonspermwhalerangeestimationwhenusingthehyperbolicalgorithm-2009","timestamp":"2024-11-12T10:14:57Z","content_type":"text/html","content_length":"10194","record_id":"<urn:uuid:24d3043d-9dd0-4ee3-8db8-b86e84bda45e>","cc-path":"CC-MAIN-2024-46/segments/1730477028249.89/warc/CC-MAIN-20241112081532-20241112111532-00377.warc.gz"} |
Fractional exclusion statistics and the Random Matrix Boson Ensemble
The k-body Gaussian Embedded Ensemble of Random Matrices is considered for N bosons distributed on two single-particle levels. When k = N, the ensemble is equivalent to the Gaussian Orthogonal
Ensemble (GOE), and when k = 2 it corresponds to the Two-body Random Ensemble (TBRE) for bosons. It is shown that the energy spectrum leads to a rank function which is of the form of a discrete
generalized beta distribution. The same distribution is obtained assuming N non-interacting quasiparticles that obey the fractional exclusion statistics introduced by Haldane two decades ago.
arXiv e-prints
Pub Date:
March 2012
□ Physics - Atomic Physics;
□ Condensed Matter - Statistical Mechanics | {"url":"https://ui.adsabs.harvard.edu/abs/2012arXiv1203.6694H/abstract","timestamp":"2024-11-13T21:19:13Z","content_type":"text/html","content_length":"36631","record_id":"<urn:uuid:900deaf0-935a-441b-8de1-b64bbebc09aa>","cc-path":"CC-MAIN-2024-46/segments/1730477028402.57/warc/CC-MAIN-20241113203454-20241113233454-00617.warc.gz"} |
Digital Math Resources
Display Title
Math Clip Art--Dice and Number Models--Two Dice with 7 Showing, A
Math Clip Art--Dice and Number Models--Two Dice with 7 Showing, A
Probability and Statistics
This image is part of a comprehensive series showcasing dice and various number models used in mathematics education. The specific content of this image, as indicated by its title, presents two dice
with a total of 7 showing. This visual aid is an essential tool for teaching advanced concepts in probability and statistics, particularly when dealing with the most likely outcome when rolling two
The use of math clip art, such as this two-dice image, plays a crucial role in mathematics education. It provides students with a clear, visual representation of complex concepts, making them more
accessible and easier to understand. In the context of probability and statistics, this image can be used to illustrate concepts such as compound events, sample space expansion, and the probability
of specific outcomes when rolling two dice.
Incorporating this number model image into lessons on probability and statistics can significantly enhance student comprehension. Teachers can use this image to explain the concept of independent
events, discuss why rolling a sum of 7 is the most likely outcome, and introduce the idea of central tendency in probability distributions. This visual approach can make complex mathematical concepts
more relatable and engaging for students.
A teacher might introduce this image to students by saying: "Here we have two dice showing a sum of 7. Did you know that 7 is the most common sum when rolling two dice? Today, we're going to explore
why this is the case, calculate the probability of rolling a 7, and discuss how this knowledge applies to various real-world situations, from board game design to financial modeling."
For a complete collection of math clip art related to Number Models click on this link: Number Models Collection.
Common Core CCSS.MATH.CONTENT.K.CC.B.4, CCSS.MATH.CONTENT.K.CC.B.4.A, CCSS.MATH.CONTENT.K.CC.B.4.B, CCSS.MATH.CONTENT.K.CC.B.4.C, CCSS.MATH.CONTENT.7.SP.C.7, CCSS.MATH.CONTENT.7.SP.C.7.A,
Standards CCSS.MATH.CONTENT.7.SP.C.7.B
Grade Range 6 - 12
Curriculum Nodes • Probability and Data Analysis
• Probability
Copyright Year 2014
Keywords die, dice, probability, clip art | {"url":"https://www.media4math.com/library/math-clip-art-dice-and-number-models-two-dice-7-showing","timestamp":"2024-11-11T20:03:39Z","content_type":"text/html","content_length":"59509","record_id":"<urn:uuid:0e504f2b-ab20-4d57-b464-0c0967800769>","cc-path":"CC-MAIN-2024-46/segments/1730477028239.20/warc/CC-MAIN-20241111190758-20241111220758-00738.warc.gz"} |
Adjacency list of convex hull
5739 Views
5 Replies
0 Total Likes
Adjacency list of convex hull
I would like to know if it is possible to obtain a vertex adjacency list from the result of ConvexHull the way it is possible in 2D when using the VoronoiDiagram. thanks
5 Replies
Horvat: A most helpful answer. Thank you so much. Bogdan
I'm not very familiar with this functionality, but many of the builtin objects such as interpolation functions, mesh regions, etc. can be queried like this obj["propertyName"].
If we have hull = ConvexHullMesh@RandomReal[1, {100, 3}];, then we can try
to get the available properties. Now allt his is undocumented, may not work across versions, may not work at all ... but at least in the current version of Mathematica we see that there's a property
called "AdjacencyMatrix".
will return this.
Once again, this is undocumented, may not work, may break, etc. So use with caution.
I would also like to know what is the simplest way to do this using documented functions. MeshPrimitives[hull, 1] does give all the edges, which can be used to extract adjacency information. But it
gives them in terms of point coordinates, not point indices, which makes it more difficult and less convenient to do this kind of computation.
UPDATE: MeshCells[hull, 1] will give all edges in terms of point indices (instead of point coordinates). This is just the edge list of the graph you are looking for: g = Graph[UndirectedEdge @@@
MeshCells[hull, 1][[All, 1]]] and then e.g. VertexDegree[g]
Thanks, but what I am really after is: for each vertex to know either how many neighbors it has OR the list of connected vertexes. I'm still unclear wether that can be done or not.
Be respectful. Review our Community Guidelines to understand your role and responsibilities. Community Terms of Use | {"url":"https://community.wolfram.com/groups/-/m/t/532264","timestamp":"2024-11-04T15:25:52Z","content_type":"text/html","content_length":"115007","record_id":"<urn:uuid:3077d677-00f9-4b54-9321-9d16475eb423>","cc-path":"CC-MAIN-2024-46/segments/1730477027829.31/warc/CC-MAIN-20241104131715-20241104161715-00053.warc.gz"} |
Astronomy and Astrophysics, Ph.D.
The Astronomy and Astrophysics graduate program is intended for those with a deep interest in the subject. Students are trained in the latest techniques in computation, data analysis, and
instrumentation, which have wide utility in academia and in industry. The interests of the faculty embrace a wide range of both theoretical, observational, and instrumentation aspects of astronomy.
Current research and course offerings include our stellar structure and evolution, solar system and other planetary systems, stellar spectroscopy, the interstellar medium, galactic structure,
cosmology, general relativity, gravitational radiation, the origin of the elements, optical and infrared astronomy, high-energy astrophysics, and advanced astronomical instrumentation.
Graduate students have access to state-of-the-art instrument development and data reduction technology, the UCO/Lick Observatory computer network, and an on-campus supercomputer dedicated to
astrophysical computation. Graduate students may conduct supervised research using selected telescopic facilities of the Lick Observatory on Mount Hamilton, 55 miles from Santa Cruz. The 10-meter
Keck Telescope in Hawaii, the world’s largest, is administered from the UCSC campus and is used for frontier research by UC astronomers.
Advancement to Candidacy
Course Requirements
Preparation for Graduate Work in Astrophysics
The UC Santa Cruz graduate program in astronomy and astrophysics is predominantly designed for Ph.D. students seeking a professional career in research and teaching, but with flexibility for students
to prepare for careers outside of academia. In view of the thorough preparation in mathematics and physics required for graduate study, most entering astronomy graduate students major in physics or
astrophysics as undergraduates.
The suggested minimum requirements for admission to graduate standing at UC Santa Cruz include the following undergraduate courses:
Basic physics.
Mechanics, wave motion, sound, light, electricity and magnetism, thermodynamics, atomic physics, and quantum mechanics.
PHYS 5A Introduction to Physics I 5
PHYS 5B Introduction to Physics II 5
PHYS 5C Introduction to Physics III 5
PHYS 5D Introduction to Physics IV 5
Basic mathematics.
MATH 19A Calculus for Science, Engineering, and Mathematics 5
MATH 19B Calculus for Science, Engineering, and Mathematics 5
MATH 23A Vector Calculus 5
MATH 23B Vector Calculus 5
And Statistics
Intermediate-level physics.
PHYS 105 Mechanics 5
PHYS 110A Electricity, Magnetism, and Optics 5
PHYS 110B Electricity, Magnetism, and Optics 5
PHYS 116A Mathematical Methods in Physics 5
PHYS 116D Mathematical Methods in Physics 5
PHYS 116C Mathematical Methods in Physics 5
PHYS 129 Particle Physics and Astrophysics 5
PHYS 139A Quantum Mechanics I 5
PHYS 139B Quantum Mechanics II 5
Intermediate-level mathematics.
MATH 21 Linear Algebra 5
MATH 103A Complex Analysis 5
MATH 106 Systems of Ordinary Differential Equations 5
MATH 107 Partial Differential Equations 5
Graduate Program Requirements
The graduate curriculum consists of eight astronomy and astrophysics courses, including six required core courses and a choice of two elective courses. Students must additionally satisfy three
equivalent educational requirements in the form of additional elective courses, research projects, independent study, or reading seminars. These requirements are detailed below.
Six courses are specifically required:
ASTR 202 Astrophysics I 5
ASTR 204 Astrophysics II 5
ASTR 205 Introduction to Astronomical Research and Teaching 5
ASTR 220A Stars and Planets I 5
ASTR 233 Galaxies and Cosmology I 5
ASTR 257 Observational Astronomy 5
Choose two over the first two years
ASTR 222 Stars and Planets II 5
ASTR 225 High-Energy Astrophysics 5
ASTR 230 Diffuse Matter in Space 5
ASTR 234 Statistical Techniques in Astronomy 5
ASTR 240A Galaxies and Cosmology II 5
ASTR 260 Instrumentation for Astronomy 5
ASTR 289 Adaptive Optics and Its Application 5
Equivalent Educational Requirements
Choose three over the first two years
Equivalent educational requirements (EER) may take one of several forms, and three pre-approved options are listed below. Other EERs may be approved by the department. Students must complete three
EERs during their first two years.
EER Option 1: Additional Elective Courses (5 credit course = 1 EER)
PHYS 224
Particle Astrophysics and Cosmology 5
/ASTR 224
PHYS 226
General Relativity 5
/ASTR 226
EART 262 Planetary Interiors 5
EART 265 Order of Magnitude Estimation 5
EART 264 Planetary Atmospheres 5
AM 275
Magnetohydrodynamics 5
/EART 275
STAT 206 Applied Bayesian Statistics 5
AM 212A Applied Partial Differential Equations 5
AM 214 Applied Dynamical Systems 5
AM 217 Introduction to Fluid Dynamics 5
PHYS 210 Classical Mechanics and Thermal Physics 5
PHYS 215 Introduction to Non-Relativistic Quantum Mechanics 5
PHYS 216 Advanced Topics in Non-Relativistic Quantum Mechanics 5
PHYS 217 Quantum Field Theory I 5
PHYS 218 Quantum Field Theory II 5
EER Option 2: Parallel Research Project
One quarter equals one EER.
A parallel research project is scientific research conducted in parallel to a student’s thesis research, with faculty other than their primary advisor and in an area outside their primary research
field. These projects will be designed to broaden the knowledge and skills of the student while increasing collaborative connections within the department, and may lead to publishable results. Each
quarter students may choose from a department provided list of faculty who have available research projects designed to be completed in approximately 10 weeks. The evaluation methodology of the
course will be a review by the designated faculty member of the completed research project and a write-up of the results. This option may only be taken twice in satisfaction of EERs, and may only be
taken once per quarter. This option may not be taken in the fall quarter of year one.
ASTR 294 Pedagogy of Astrophysical Research 5
EER Option 3: Reading Seminar
One quarter equals one EER.
A reading seminar is an independent study of the scientific literature or related subject matter, guided by a faculty member. Each quarter students may choose from a department-provided list of
faculty who will supervise the seminar and select the course material. The goal is to broaden the knowledge of the students in a field where they do not plan to conduct active research, and a reading
seminar in a student’s area of research will not qualify for an EER. Students will be required to meet with the faculty member over a 10-week period to discuss the papers. The evaluation methodology
for the course will be an oral exam of the material, administered by the faculty member leading the seminar.
ASTR 294 Pedagogy of Astrophysical Research 5
Additional Selective Coursework
Students are encouraged to leverage their opportunities for taking additional courses during their P.h.D studies at UC Santa Cruz. If students desire to supplement the coursework required for the
astronomy and astrophysics degree with additional domain classes in other departments or with classes likely to advance their career goals, they can take more courses throughout their graduate
career. Students should consult with their Ph.D. advisor and the graduate advisor to identify appropriate additional courses.
Additional Degree Requirements
In addition to the curriculum described above, students must fulfill the following requirements:
Students must meet at least quarterly with an assigned advisor.
Each student must also be a teaching assistant for at least two quarters. See the teaching educational requirement.
By the time of the annual board review, which occurs in July at the end of their second academic year, students must:
• Complete one quarter of master's project research with a primary UC Santa Cruz advisor and give a department talk on that work.
• Maintain a 3.0 GPA average in the six required core courses, in which students must register for an assigned grade.
• Submit one lead-author paper to a refereed journal that is based on research conducted at UC Santa Cruz. By the time of the board review, second-year students are expected to either (1) have
submitted a paper for publication to a refereed journal; or (2) submit to the board review a complete first draft of such a paper and a detailed plan for completion. If the student pursues option
(2), they are expected to submit the paper for publication by the first day of the fall quarter, and provide the electronic submission acknowledgement for the paper to the chair of the graduate
advising committee. If the student does not complete this requirement, they will meet with their advisor, the graduate advising committee chair, and the department chair before the first faculty
meeting of the fall quarter, in order to discuss the status of the paper. The faculty at that meeting will then make a recommendation whether the student should be granted an extension to the
next board review, and the full faculty will then vote on whether to grant an extension.
After passing the board review based on the above-mentioned requirements and the qualifying examination, students pursue independent research leading to the doctoral dissertation.
Teaching Requirements
During their Ph.D. studies, graduate students in UC Santa Cruz astronomy and astrophysics will gain formative experience teaching undergraduate students, usually through teaching assistantships (TAs)
in collaboration with department faculty.
• Students will serve as an official TA for at least two academic year quarters during their Ph.D. studies. One quarter must be during the first three years of Ph.D. studies. The remainder of this
teaching educational requirement must be satisfied before receiving a doctorate degree.
• The teaching education requirement applies to all students, including those with external fellowships or other forms of support.
• The department may require students to serve as a TA for more than two quarters as a condition of the student’s financial support during their Ph.D. studies.
Qualifying Examination
By the end of the third year, students must complete a qualifying examination that presents and defends a proposed thesis topic.
Degree Timeline and Funding
The department has established five years as the normative time to degree. Normative time is the elapsed calendar time, in years, that, under normal circumstances and excluding department-approved
leaves, will be needed to complete all requirements for the Ph.D.
We expect funding in the form of graduate student researcher positions or teaching assistantships to be available for our Ph.D. students for five years, provided the student makes sufficient progress
toward a degree. A one-year extension may be granted if funding is available. Funding support will not, in general, be provided beyond six years. Exceptions for extension beyond six years will be
granted only for exceptional extenuating circumstances, and will be decided upon by the department chair, associate chair, and the department graduate advising committee.
After passing the board review based on the requirements and the qualifying examination, students pursue independent research leading to the doctoral dissertation.
Dissertation Defense
Upon completion of the Ph.D. dissertation, students must pass an oral dissertation defense. A completed draft of the thesis must be submitted to the dissertation committee at least two weeks before
the date of the defense, and the defense itself must occur at least two weeks before the campus deadline for thesis submissions in that quarter. Exceptions to this policy will be granted only under
exceptional circumstances and must be approved by the department chair, associate chair, and the department graduate advising committee.
Academic Progress
The department has established five years as the normative time to degree. Normative time is the elapsed calendar time, in years, that, under normal circumstances and excluding department-approved
leaves, will be needed to complete all requirements for the Ph.D.
We expect funding in the form of graduate student researcher positions or teaching assistantships to be available for our PhD students for five years, provided the student makes sufficient progress
towards a degree. A one-year extension may be granted if funding is available. Funding support will not, in general, be provided beyond six years. Exceptions for extension beyond six years will be
granted only for exceptional extenuating circumstances, and will be decided upon by the department chair, associate chair, and the department graduate advising committee. | {"url":"https://catalog.ucsc.edu/en/2022-2023/general-catalog/academic-units/physical-and-biological-sciences-division/astronomy-and-astrophysics/astronomy-and-astrophysics-phd/","timestamp":"2024-11-06T01:07:14Z","content_type":"application/xhtml+xml","content_length":"86524","record_id":"<urn:uuid:ba983f26-5395-4f62-8a7f-8398270e4153>","cc-path":"CC-MAIN-2024-46/segments/1730477027906.34/warc/CC-MAIN-20241106003436-20241106033436-00701.warc.gz"} |
Comments on Rationally Speaking: What does it mean for something to be metaphysically necessary?Hi Pete,
Again, it's an analogy to try to com...DM -
Thanks for clarifying. I must say that the ...@Thomas Jones:
“I searched SEP for articles that m...@Thomas Jones:
“I'm not being sarcastic. I...If you mean computationalism, then I think they st...All that seems to say is that mathematical platomi...“…metaphysicians these days seem to make sense of ...An axiom is part of the definition of a mathematic...But an aciom is a statement that has no meaning ex...Hi Robin,
My claim is that all mathematical objec...I think that you need to unpack what sort of thing...Hi Robin,
This blog post ought to explain my atti...>Seriously???<
Tongue firmly planted in che...Seriously???Robin:So Harry Potter is a bit like M Theory?
Exa...Hi Pete,
"I can definitely understand where ...Hi DM,
Can you identify even one thing that would...But I wonder why you link a background in science ...But there are no laws of metaphysics, just like th...Pete, I can put the idea of it all being a symbol ...DM wrote: "Again, I'm not saying it is ca...Do numbers exist?Isn't "there are no laws of metaphysics&q...So I guess it is a little like science or mathemat...Hi,
Happy to answer your question. The particula...
Unknownnoreply@blogger.comBlogger111125tag:blogger.com,1999:blog-15005476.post-78012274530473093382014-03-09T08:47:42.887-04:002014-03-09T08:47:42.887-04:00Hi Pete,<br /><br />Again, it's an
analogy to try to communicate something about how I think of it, not an argument. It's not the same thing as language, but I think it is in some respects more appropriate to think of it like a
language than a place. My view of this does not in fact depend on human communications at all.<br /><br />One interesting thing I think languages and formal systems share is that just like languages,
different formal systems can be used to describe the same mathematical objects. ZFC and ZF can both be used to describe the Mandelbrot Set even though these are different formal systems, and in my
view there is only one Mandelbrot Set.<br /><br />Even better than a language would be to think of it as a context. The distance between geodesics remains constant in the context of Euclidian
geometry, but not in the context of Hyperbolic geometry, but there is no conflict because we are talking about different contexts. This is perhaps reasonably easy to understand. You seem to think
that the Continuum Hypothesis is fundamentally different, but I will only accept that if its affirmation or its negation turns out to be logically incoherent. The CH is true in the context of ZFC+CH
and false in ZFC+¬CH, just as the parallel postulate is true in Euclidean and false in Hyperbolic geometry.Disagreeable Mehttps://www.blogger.com/profile/
15258557849869963650noreply@blogger.comtag:blogger.com,1999:blog-15005476.post-29234186584872334042014-03-09T00:20:25.009-05:002014-03-09T00:20:25.009-05:00DM - <br /><br />Thanks for clarifying. I
must say that the language analogy is a bid misplaced as well. Languages are used for communicating and there are many different ways of doing this. However, as far as being descriptive of certain
aspects of the world around us, they still refer to objective features of existence that are unique and constant. Mathematical truth shouldn't have anything to do with the context of human beings
communicating with each other. petehttps://www.blogger.com/profile/
12969621709127674152noreply@blogger.comtag:blogger.com,1999:blog-15005476.post-24103523736736126972014-03-08T22:48:10.556-05:002014-03-08T22:48:10.556-05:00@Thomas Jones:<br />“I searched SEP for
articles that mention "concreteness," and found at least 32 articles in which it was mentioned in one context or another. I am clearly in over my head. I am sorry I cannot engage in a
fruitful discussion with you regarding your comments.”<br /><br /><br />As these were just short comments, I did not give out more precise description about what I mean on ‘concreteness’, although I
did know that it can be described in many different contexts. Thus, I took an easy way out, by using an operational definition, the “I”-concreteness (similar to Descartes' "Cogito ergo sum&
quot;). I further hinted that the u-concreteness is the ‘ultimate reality’ without giving details. <br /><br /><br />In addition to the operational definition, ‘concreteness’ has special meanings to
me. <br />One, mathematically, it is a precise procedure of how an infinity concretizes into a finite ‘object’. Thus, a finitude (finite universe) can be risen from infinity. Please see http://
prebabel.blogspot.com/2013/10/multiverse-bubbles-are-now-all-burst-by.html .<br /><br /><br />Two, with Cantor’s theorem, it is a precise procedure of how multi-dimensional universe arose from
one-dimension. See, http://prebabel.blogspot.com/2012/04/origin-of-spatial-dimensions-and.html .<br /><br /><br />Three, for u-concreteness, it must have, at least, the following attributes.<br />a.
It must be eternal and immutable,<br />b. It must give rise to all the followings: (the cosmological constant (Λ), the Cabibbo angle, the Weinberg angles, the Alpha, the Neff = 3, the Planck data,
the particle zoo of the Standard Model, the Baryongenesis, the quantum principle, the unified force equation (including gravity), the life, the Quantum-Spin, Why is here something rather than
nothing? And more.) See, http://www.quantumdiaries.org/2014/02/07/interpretations-of-quantum-mechanics/#comment-172443 .<br /><br /><br />With these, my ‘concreteness’ is now better defined.<br />
@Thomas Jones:<br /><br />“I'm not being sarcastic. I'm just wondering how to reconcile this concreteness with Buddhist notions of impermanence and change.”<br /><br />Excellent question. In
fact, my definition does not meet the requirement that the metaphysically necessary of ‘my concreteness’ is true in all possible worlds, at the first glance.<br /><br /><br />Let’s start with your
concreteness. Before I know you, your concreteness has no ‘meaning’ to my concreteness, that is, I can deny your concreteness without violating any physical or moral laws. Yet, as soon as I click the
‘reply’ button, a new concreteness arose, the interaction between us. There are two issues about this new concreteness.<br />First, your concreteness can no longer be denied by my concreteness.<br />
Second, there is a ‘metaphysical necessity’ for this newly arose concreteness, and it consists of at least the followings:<br />a. There must be a space which separate us.<br />b. There must be a
thing called ‘individuality’ which separate us in addition to space.<br />c. Massimo Pigliucci must be a concreteness which I no longer can deny.<br /><br /><br />Very quickly, this ‘local’ and
transient concreteness is no longer local and transient anymore. Now, I will introduce the 2nd metaphysics law.<br /><br />Law 2: If concreteness B is undeniable by concreteness A, then the
‘metaphysical necessity’ of concreteness B cannot be denied by concreteness A.<br /><br />Very soon, this ‘metaphysical necessity’ of concreteness B cannot be denied by many, and it is not too
difficult to show that it cannot be denied in all possible worlds if they are also concreteness.<br /><br /><br />Yet, I showed that there are two different types of concreteness.<br />One, the
“I”-type concreteness which can be denied in practice although not in principle because of the Law 2.<br />Two, the ‘ultimate’ concreteness (the ‘u’-type) which by definition must give rise to all
I-type concreteness.<br /><br />Now, I must introduce the Law 3 --- The ‘metaphysical necessity’ of an I-concreteness must also be a concreteness.<br /><br />By definition, there is a u-type
concreteness. But, is there a u-concreteness? Let me start with a subset of set (UC), the set (4), and it consists of only four concreteness.<br />C1 = Alpha fine structure constant<br />C2 = (Dark/
visible) mass ratio<br />C3 = particle zoo of Standard Model<br />C4 = I am here (a “life”)<br /><br />Theorem one: If concreteness X is the ‘metaphysical necessity’ of set (4), it is a
u-concreteness. <br />Is concreteness X a concreteness? Can we find it? Of course, we can.<br />How about the “Buddhist notions of impermanence and change”? A good ancient ‘opinion’, it does describe
one point of view.<br />Tienzenhttps://www.blogger.com/profile/
05842156512465678309noreply@blogger.comtag:blogger.com,1999:blog-15005476.post-52549132252212018552014-03-08T10:36:15.960-05:002014-03-08T10:36:15.960-05:00If you mean computationalism, then I think
they stand on their own. If, as you say, mathematical platonism is a consequence, then all the more reason for accepting platonism, I'd say.Disagreeable Mehttps://www.blogger.com/profile/
15258557849869963650noreply@blogger.comtag:blogger.com,1999:blog-15005476.post-18311199626981951362014-03-08T02:35:27.457-05:002014-03-08T02:35:27.457-05:00All that seems to say is that mathematical
platomism is a consequence of certain sorts of theories of mind. All the more reason for rejecting those theories I say.Robinhttps://www.blogger.com/profile/
16015911138886238144noreply@blogger.comtag:blogger.com,1999:blog-15005476.post-46417181454276314972014-03-07T18:40:47.558-05:002014-03-07T18:40:47.558-05:00“…metaphysicians these days seem to make
sense of the notion of metaphysical necessity by saying that something is metaphysically necessary if it is true in all possible worlds. … I am leaning toward the conclusion that there is no such
thing as metaphysical necessity. That’s in part because one cannot find metaphysical laws, and in part because I doubt there is such a thing as necessity, period. Nothing is physically or logically
necessary - only possible or impossible.”<br /><br />You have given two different ‘definitions’ for ‘metaphysical necessity’ while they are internal consistent between them. Of course, I cannot
disagree with you if I use these two definitions to discuss this issue. Thus, if you allow, I will make a new definition.<br /><br />I will define this issue with two steps.<br />First, finding out
the concreteness.<br />Two, finding out the ‘ultimate’ concreteness.<br />It will take a 200 page book to talk about this concreteness. Thus, I will not go into the details of it in this short
comment but just point out a few key points. The concreteness does not depend on the physics laws, math theory, reasoning, logic, time, eternal, or space. I am here now [will definitely be gone in a
future time, that is, my being is just a possible outcome in Buddhism], and it is ‘concreteness’ for me and to anyone who interacts with me. A 126 Gev. particle were seen by 6,000 physicists at LHC,
it is a concrete object for them. Now, we can make the ‘first’ metaphysical law (FML).<br /><br />FML --- for every concreteness, there is a something as the ‘metaphysical necessity’ for that
concreteness.<br /> Corollary --- if a concreteness is not the ‘ultimate’ concreteness, it cannot be its own metaphysical necessity.<br /><br />Now, with a unlimited concreteness set (UC) = {C1, C2,
… Cn,…}, C(u) is a standalone single concreteness, and there is a set (in finite numbers) of rules which allows the C(u) to give rise to all members of set (UC), then C(u) is the ‘ultimate’
concreteness. <br /><br />Of course, there is a big issue about whether such an ultimate concreteness can be found. Yet, with these new definitions, we might be able to address this issue in a new
direction.<br />Tienzenhttps://www.blogger.com/profile/
05842156512465678309noreply@blogger.comtag:blogger.com,1999:blog-15005476.post-86264585250588229892014-03-07T15:31:30.633-05:002014-03-07T15:31:30.633-05:00An axiom is part of the definition of a
mathematical object. If you view an axiom as a statement for human minds to appreciate and interpret, you are thinking about the representation in symbols of a mathematical concept and not about the
mathematical concept itself. The axiom is the meaning agreed upon by those who use it, not the statement used to represent it.Disagreeable Mehttps://www.blogger.com/profile/
15258557849869963650noreply@blogger.comtag:blogger.com,1999:blog-15005476.post-32885794177602833182014-03-07T14:40:13.353-05:002014-03-07T14:40:13.353-05:00But an aciom is a statement that has no
meaning except for the meaning agreed upon by those who use it. What sort of thing is an axiom that is independent of any mind?Robinhttps://www.blogger.com/profile/
16015911138886238144noreply@blogger.comtag:blogger.com,1999:blog-15005476.post-72382595413283525202014-03-07T09:25:01.900-05:002014-03-07T09:25:01.900-05:00Hi Robin,<br /><br />My claim is that all
mathematical objects exist. Since formal systems can be treated as mathematical objects, they also exist. Mathematical objects exist independently of any intelligent mind.Disagreeable Mehttps://
www.blogger.com/profile/15258557849869963650noreply@blogger.comtag:blogger.com,1999:blog-15005476.post-53568078230508721152014-03-07T08:55:36.859-05:002014-03-07T08:55:36.859-05:00I think that you
need to unpack what sort of thing an axiom or a formal system would be in the mathematical universe.<br /><br />In terms of the mathematics I do on paper these are sets of rules in a language and
depend upon an intelligent mind to interpret them and agree on meanings.<br /><br />Unless you are positing a default mathematician, which I know you are not, then you need to be clearer about what
is the analog of these things you are proposing in the self existing mathematical realm.Robinhttps://www.blogger.com/profile/
16015911138886238144noreply@blogger.comtag:blogger.com,1999:blog-15005476.post-29421396686119577332014-03-07T07:56:30.953-05:002014-03-07T07:56:30.953-05:00Hi Robin,<br /><br />This blog post ought
to explain my attitude.<br /><br />http://disagreeableme.blogspot.co.uk/2013/10/mathematical-platonism-is-true-because.htmlDisagreeable Mehttps://www.blogger.com/profile/
15258557849869963650noreply@blogger.comtag:blogger.com,1999:blog-15005476.post-32178893869214843162014-03-07T07:55:38.860-05:002014-03-07T07:55:38.860-05:00>Seriously???<<br /><br />Tongue
firmly planted in cheek.<br /><br />But yeah, maybe in some respects, in that it's not immediately obvious if it's coherent.Disagreeable Mehttps://www.blogger.com/profile/
www.blogger.com/profile/09099460671669064269noreply@blogger.comtag:blogger.com,1999:blog-15005476.post-71555852836973096462014-03-07T05:22:59.480-05:002014-03-07T05:22:59.480-05:00Robin:So Harry
Potter is a bit like M Theory?<br /><br />Exactly!Disagreeable Mehttps://www.blogger.com/profile/
15258557849869963650noreply@blogger.comtag:blogger.com,1999:blog-15005476.post-82888091259406038532014-03-07T05:22:13.067-05:002014-03-07T05:22:13.067-05:00Hi Pete,<br /><br />"I can definitely
understand where you're coming from in suggesting FBP and trying to tie it back into the example of different universes with different laws of physics. The problem with this is that it doesn'
t actually work. See, in the idea of a multiverse where different physical laws are instantiated in different universes (think of the 10^500 possible Calabi-Yau configurations or whatnot), there is
still actually a meta-theory or meta-laws of physics."<br /><br />I think you may be mistaking my analogy to physics for an argument when it is intended only as a means of illustrating my
position. Yes, there are differences between the set of formal systems and the set of universes within a specific kind of multiverse. That doesn't necessarily kill the analogy though. All
analogies involve aspects of similarity and aspects of difference. The question is whether the differences are more relevant than the similarities, and I don't think they are, at least not if I&#
39;m only trying to explain my meaning.<br /><br />Besides, there is an underlying meta-theory for the set of all formal systems, and that is the rule that mathematical objects described by
consistent formal systems exist.<br /><br />A core idea of the MUH is to discard all unnecessary axioms and metaphysical laws. The one law that remains is arguably not a law at all but a principle
with respect to how we regard the concept of existence. In the multiverse of the MUH, therefore, your criticism does not apply.<br /><br />"It makes no sense to think that over here a particular
mathematical statement is true, but over there its not (in the abstract mathematical universe)"<br /><br />I agree, which is why I think that there are different interpretations of my position
at play.<br /><br />I think of the different formal systems not in terms of being different places but more like being different languages. It makes no sense to imagine that the correct word for &
quot;Hello" is "Hola" in Spain and "Bonjour" in France. But it does make sense to say that the correct word is "Hola" in the context of Spanish, and "Bonjour&
quot; in the context of French.<br /><br />So the idea is that there is no absolute mathematical truth without context. Every mathematical utterance is made in the context of some formal system
whether implicit or explicit, and its truth is evaluated accordingly.Disagreeable Mehttps://www.blogger.com/profile/
15258557849869963650noreply@blogger.comtag:blogger.com,1999:blog-15005476.post-88252428051432028402014-03-07T04:20:21.592-05:002014-03-07T04:20:21.592-05:00Hi DM,<br /><br />Can you identify even one
thing that would be different about mathematics if numbers didn't exist?Robinhttps://www.blogger.com/profile/
16015911138886238144noreply@blogger.comtag:blogger.com,1999:blog-15005476.post-25558325272175858522014-03-07T03:24:41.393-05:002014-03-07T03:24:41.393-05:00But I wonder why you link a background in
science to a bias toward utility. Engineering maybe, but scientists are generally more likely to be moved by thinga like fascination, awe and the inherent value of knowledge than they are by
16015911138886238144noreply@blogger.comtag:blogger.com,1999:blog-15005476.post-78355009790525953002014-03-06T23:55:54.901-05:002014-03-06T23:55:54.901-05:00But there are no laws of metaphysics, just
like there are no laws of philosophy, so this endeavor is one of critically making sense of things, not of discovering or dictating how things are.<br /><br /><br />That would be correct, but who
know whether you know why? The answer is you can only arrive at such speculations using rationality and they only persist as long as rationally satisfying to you in making sense of logic and physics.
Rationality is a means, or ongoing process, with no end of laws in itself. Strictly speaking.Anonymoushttps://www.blogger.com/profile/
12115337703424786486noreply@blogger.comtag:blogger.com,1999:blog-15005476.post-76958552604091337182014-03-06T22:09:54.593-05:002014-03-06T22:09:54.593-05:00Pete, I can put the idea of it all being a
symbol manipulation to rest just as soon as someone gives me a good reason for doing so.<br /><br />What gives the symbol manipulation it's predictive power? Nobody knows, because you cannot get
past the symbol manipulation.<br /><br />We may refer speculatively to the "thing in itself", the "somewhat" the "physical world" as it has variously been called, but
the most information we have about it, probably that we will ever have about it, is a symbol manipulation.<br /><br />There is no logical requirement for there to be something that the symbol
manipulations are referring to. There is no need for that hypothesis in science. In fact some of our most important science was done by physicists who made no assumption about this.<br /><br />We
could not in any account know anything about the "what the symbol manipulation describes" beyond the symbol manipulation itself and the sensations we have of it.Robinhttps://www.blogger.com
/profile/16015911138886238144noreply@blogger.comtag:blogger.com,1999:blog-15005476.post-60048497959617173422014-03-06T21:41:42.981-05:002014-03-06T21:41:42.981-05:00DM wrote: "<i>Again, I'm
not saying it is categorically impossible. I am saying that the rules as stated are too simple, too naive. The rules as presented are not workable in the state they are in and need to be refined and
made more precise in order for us to figure out if they make sense.</i><br /><br />So Harry Potter is a bit like M Theory?Robinhttps://www.blogger.com/profile/
16015911138886238144noreply@blogger.comtag:blogger.com,1999:blog-15005476.post-74325089265512991152014-03-06T21:38:24.718-05:002014-03-06T21:38:24.718-05:00Do numbers exist?Robinhttps://
www.blogger.com/profile/16015911138886238144noreply@blogger.comtag:blogger.com,1999:blog-15005476.post-42742749045835691662014-03-06T21:20:21.879-05:002014-03-06T21:20:21.879-05:00Isn't "
there are no laws of metaphysics" a law of metaphysics?mregnorhttps://www.blogger.com/profile/
11431770851694587832noreply@blogger.comtag:blogger.com,1999:blog-15005476.post-19611482373548631632014-03-06T21:14:12.199-05:002014-03-06T21:14:12.199-05:00So I guess it is a little like science or
mathematics. This discussion may have no utility at all, or it may have utility in ways which we are not expecting but all ideas, no matter how apparently unrealistic, can have utility as the Anselm
example above shows.<br /><br />For me it has an inherent value which can also be utility since the concept of utility also involves personal utility.Robinhttps://www.blogger.com/profile/
16015911138886238144noreply@blogger.comtag:blogger.com,1999:blog-15005476.post-18764066182100309222014-03-06T20:20:47.941-05:002014-03-06T20:20:47.941-05:00Hi,<br /><br />Happy to answer your
question. The particular topic at hand is, at least tangentially, logic.<br /><br />Logic is what underlies mathematics and mathematics is what underlies physics which has quite a good deal of
utility.<br /><br />There have been completely pointless sounding arguments which have proved to have utility. For example a twelfth century monk comes up with an ingenious argument for the existence
of God.<br /><br />It sounds like rubbish but no-one can quite say why it is rubbish and the eventual refutation of it led to the biggest development in logic since Aristotle.<br /><br />Much of our
mathematics could not be stated without this advancement in logic and mathematics is, as I said before the basis of physics which has quite a lot of utility.<br /><br />I could make a good case that
the whole movement of Logical Positivism had an influence on science in that physicists of the early 20th century focussed less on concepts of reality and more on whether models worked.Robinhttps:// | {"url":"https://rationallyspeaking.blogspot.com/feeds/3762105175454702604/comments/default","timestamp":"2024-11-13T15:55:52Z","content_type":"application/atom+xml","content_length":"63475","record_id":"<urn:uuid:3cbca153-1b1e-4edf-81c0-cf44fd949410>","cc-path":"CC-MAIN-2024-46/segments/1730477028369.36/warc/CC-MAIN-20241113135544-20241113165544-00661.warc.gz"} |
2.3 Interpolation Operation
2.3 Interpolation Operation
Interpolated operations involve two or more axes whose movements are interdependent. There are many types of interpolated moves. Linear interpolation is when two or more axes works together to create
movement along a straight line. For linear interpolation, each axis moves in only one direction, and start and stop at the same time. Circular interpolation is when two axes work together to create
movement along the outer rim of a circle. For circular interpolation, each axis will change direction and speed as required to allow for a circular path of movement. A popular subset of circular
interpolation is arc interpolation, when two axes work together to move along the outer rim of a circle for a set number of degrees. Helical or tangential interpolation is when a circular or arc
interpolation of the X and Y-axis is combined with linear interpolation of the center point of the circle and the Z-axis. This allows for movement along a helical motion path. The Commander core
allows for all of these different moves, independently or in combination. These moves can be buffered together to allow for seamless continuous motion.
For more details on how the Commander core handles interpolation, refer to Appendix C - Interpolation.
< Previous Chapter | Topic Home | Home | Next Chapter | First Section >
This chapter is broken into the following sections and sub sections:
< Previous Chapter | Topic Home | Home | Next Chapter | First Section > | {"url":"https://support.nipponpulse.com/Commander/23InterpolationOperation.html","timestamp":"2024-11-14T23:16:35Z","content_type":"text/html","content_length":"14955","record_id":"<urn:uuid:fbab915c-2a5f-4687-b6eb-2c91467916ff>","cc-path":"CC-MAIN-2024-46/segments/1730477397531.96/warc/CC-MAIN-20241114225955-20241115015955-00398.warc.gz"} |
Volume – region
Cavalieri (segmentation)/point-counting
To estimate volume of anatomical regions or components of regions, combine the Cavalieri method of segmentation with point-counting. Using this method to estimate the volumes of particles, however,
is problematic because its difficult to resolve their tops and bottoms under the microscope (Tandrup, etal., 1997, pg. 108, last paragraph). The Cavalieri method involves systematic random sampling
through the region of interest. Then on the sections that are randomly and systematically chosen, instead of tracing the region, points that are over the region of interest are marked. Each point has
an area associated with it; if you think of the points being laid out in a grid with a side length of ‘g’ then the area associated with each point is g*g. the area estimate for a given section is the
number of points times their associated area. The volume estimate multiplies this by the thickness and interval of the sections:
For an example of unbiased estimation of volume with the Cavalieri/point-counting method see ‘Cavalieri Estimator‘.
Area Fraction Fractionator
To estimate the volume to volume or area to area percentage of one type of tissue per another type of tissue (for instance lesion or plaque load), systematic random sampling and point counting can
also be used, but instead of on the whole region, a fraction of the region can be sampled (Area Fraction Fractionator). A two-dimensional virtual space, usually a square or rectangle, can be
superimposed on the region, also using systematic random sampling. An array of points is in each sampling box, and one marker is marked on points of one type of tissue (tissue A) while another marker
is used for the other type of tissue (tissue B). The number of points over tissue A (subregion) is divided by the total number of points (reference) to get an estimate of the volume to volume
percentage of tissue A per tissue A plus B:
Howard, C.V. and M.G. Reed (2010) Unbiased Stereology, Second Edition, Chapter 4, Estimation of Component Volume and Volume Fraction, QTP Publications, Liverpool, U.K.
García-Fiñana, M., L.M Cruz-Orive, C.E. Mackay, B. Pakkenberg, and N. Roberts (2003) Comparison of MR Imaging Against Physical Sectioning to Estimate the Volume of Human Cerebral Compartments,
NeuroImage, 18, 505 – 516.
Tandrup, T., Gundersen, H.J.G. and E.B. Vedel Jensen (1997) The Optical Rotator. J. of Microscopy, 186, 108 -120.
Sponsored by MBF Bioscience
developers of Stereo Investigator, the world’s most cited stereology system | {"url":"https://www.stereology.info/volume/","timestamp":"2024-11-05T07:11:18Z","content_type":"text/html","content_length":"78699","record_id":"<urn:uuid:a07e2aed-abc6-46e0-8256-868c086dd1ef>","cc-path":"CC-MAIN-2024-46/segments/1730477027871.46/warc/CC-MAIN-20241105052136-20241105082136-00718.warc.gz"} |
Numpy memory error when masking along only certain axis, despite having sufficient RAM - Thiết kế website giá rẻ
Numpy memory error when masking along only certain axis, despite having sufficient RAM
I have a large array and I want to mask out certain values (set them to nodata). But I’m experiencing an out-of-memory error despite having sufficient RAM.
I have shown below an example that reproduces my situation. My array is 14.5 GB and the mask is ~7GB, but I have 64GB of RAM dedicated to this, so I don’t understand why this fails.
import numpy as np
arr = np.zeros((1, 71829, 101321), dtype='uint16')
mask = np.random.randint(2, size=(71829, 101321), dtype='bool')
nodata = 0
#this results in OOM error
arr[:, mask] = nodata
Interestingly, if I do the following, then things work.
arr = np.zeros((71829, 101321), dtype='uint16')
mask = np.random.randint(2, size=(71829, 101321), dtype='bool')
nodata = 0
#this works
arr[mask] = nodata
But it isn’t something I can use. This code will be a part of a library module that would need to accept a variable value for the zeroth dimension.
My guess is that arr[mask] = nodata is modifying the array in-place but arr[:, mask] = nodata is creating a new array, but I don’t know why that would be the case. Even if it did, there should still
be enough space for that, since the total size of arr and mask would be 22GB and I have 64GB of RAM.
I tried searching about this, I found this but I’m new to numpy and I didn’t understand the explanation of the longer answer. I did try the np.where approach from the other answer to that question,
but I still get OOM error.
Any input would be appreciated.
• python
• numpy
• memory
• indexing
• mask
Theme wordpress giá rẻ Theme wordpress giá rẻ Thiết kế website | {"url":"https://thietkewebsitegiare.vn/numpy-memory-error-when-masking-along-only-certain-axis-despite-having-sufficient-ram/","timestamp":"2024-11-04T19:47:35Z","content_type":"text/html","content_length":"40367","record_id":"<urn:uuid:c7d39305-6711-48da-a098-007c0176fc69>","cc-path":"CC-MAIN-2024-46/segments/1730477027861.16/warc/CC-MAIN-20241104194528-20241104224528-00406.warc.gz"} |
in Engadine
Physics tutoring in Engadine
For students doing physics, demands quickly become complex. While real-life problems tend to be hard to comprehend, it's also when students depend on logical thinking the most.
It's pretty straightforward, to master a subject, students need to be challenged and that means struggling from time to time.
As your child moves up the curriculum you might have already thought about offering additional support. You might have even looked for physics tutor in Engadine or somewhere close so you can easily
fit it into your busy schedule. But you might have also been unsure what to look for.
This is what we do best. This is where we can help.
All we need is to have a chat with you and we can start looking for a suitable tutor who can support your child's academic progress.
Every student learns in their own way and at their own specific pace. Once we know a little bit more about the student we can find a great tutor who'd really click with your child.
Once you reach out to us we can allocate a local Engadine physics tutor within a day or two. They set up the first lesson whenever you and your child can make it.
If you like the tutor's approach you keep working with them. You are not completely happy with the match? No worries, it happens sometimes. We consider it a trial lesson and find a better match.
Sounds good?
Give us a call! | {"url":"https://www.ezymathtutoring.com.au/tutors/engadine-2233/learn-physics","timestamp":"2024-11-07T10:31:18Z","content_type":"text/html","content_length":"210553","record_id":"<urn:uuid:a41ab9fd-d7c8-4c6e-9b52-c1fa728b5b3f>","cc-path":"CC-MAIN-2024-46/segments/1730477027987.79/warc/CC-MAIN-20241107083707-20241107113707-00564.warc.gz"} |
Maple newton method of solving a nonlinear equation
Bing visitors found us today by entering these algebra terms:
│answers to glencoe pre-algebra │worksheets on positive and negative │solving 3 equations with 3 unknowns │non-homogeneous differential equations │convert radicand to fraction │
│ │integers │ │ │ │
│Find a website that uses slopes │free printable math worksheets for 9th │how to use calculate solve cube root │ti 84 interactive free download │alegebra fraction problems │
│to solve an application problem │grade │ │ │ │
│5th grade math - multiplying │powers math quiz │multiplying negative fractions │translation of absolute value graphs │free help to solve solving rational │
│decimals │ │ │ │expression │
│algebra ratio definition │convert decimal to fraction calculator │convert whole number to decimal java │printable worksheets for beginning │6th standerd exam paper │
│ │ │ │algebra │ │
│Finding X Intercept With Graphic │using real object in algebra │cube roots in fractions │cubed functions │casio calculator help using it │
│Calculator │ │ │ │ │
│second order linear │Mixed number Fraction to decimal │ │ │ │
│non-homogeneous differential │converter │simultaneous formula │algebra poems │calculating 2nd order fit │
│equation │ │ │ │ │
│solving systems with variables │combination and permutation examples │graph a liner inequality │t1 89 │advance algebra quiz for 9th grades │
│and fractions │ │ │ │ │
│calculate +math + algebra + │adding positive and negative fractions │worded problems in quadratic equation│9th grade y intercept slope │simultaneous linear equation worksheet │
│subsets │worksheets │with one variable │ │ │
│ │Worksheets on adding and subtracting │ │past question paper and answer sheet for │math solvers inequalities to interval │
│web solver 3rd order │negatives │algebra formulas and examples │O'level Computing Studies at Cambridge │notation │
│ │ │ │University │ │
│math power grade 7 answer key │factorize "quadric" equation │the partial sums addition method │ti 84 calculator how to find degree of a │learning games for 9th grade │
│ │ │ │polynomial │ │
│topic in algebra by i.n herstein │multiplication large numbers lesson │algebra sums │year 9 maths work sheet │evaluate algebraic expressions with │
│for free notes │plan │ │ │exponents and radicals worksheets │
│ │multiplying, dividing, adding, │ │ │ │
│ladder method │subtracting negative numbers many step │pre algebra for 5th graders │math 10 pure simplifying radicals │online books of cost accounts free │
│ │problems │ │ │ │
│conversion decimal number to │free online algebra calculator │aptitude test download │printable mathematics poems │Answers to Math Homework │
│polynomial │ │ │ │ │
│online fraction perimeter │system of linear equations using │boolean algebra reducer │worksheet, variation, year 10 maths │graphing linear inequalities online │
│calculator │graphing calculator │ │ │calculators │
│varible and exponet and integer │parabola definition │find an equation from points on a │dividing polynomials box │how to find Y value on graphing calculator │
│math problems │ │parabola graph │ │ │
│elementry mathmatics │PRIMARY LEVEL GRAMMER IN FREE │download aptitude tests │Softmath │math combinations │
│IMPORTANCE OF algebra │How do you evaluate and Graph a │algebraic expressions made easy for │algebra calculator │DO MY ALGEBRA TWO HOMEWORK │
│ │Function involving square roots? │free │ │ │
│solving equation games Variables │online math problem sover │how to do square roots or radical │(free scientific calculator-grade 8) │free ebook for aptitue │
│ │ │math │ │ │
│McDougal Littell Pre Algebra │free algebra tutoring │ti-89 domain function │solve inequalities worksheet │McDougal Littel Algebra 2 Cheating │
│anwsers │ │ │ │ │
│ti 84 plus se emulator │answers for saxon algebra2 homework │Year 8 Maths work sheet │online scientific calculator statistic │integers add different sings multiplying │
│ │ │ │ │dividing │
│6th grade math - adding and │how to tell if linear equation is a │substitution method │parabola formula │simplify calculator radical │
│subtracting with decimals │function │ │ │ │
│the algebrator │decimal divide by whole numbers │square roots in numerator │simplifying expressions of the third root│6th grade math permutations │
│ │worksheet │ │ │ │
│algebra 2 book answer key │9th Grade Math Practice Worksheet │decimal fraction worksheets │solving algebra mixture problems with │Convert linear metre to square calculator │
│ │ │ │chemical solutions │ │
│free download of maths vocabulary│third Order Equations solver │diamond method algebra │Algebraic Formula pecentage │simultaneous algebra calculator │
│for primary school display │ │ │ │ │
│ │C# program that creates methods to │ │ │ │
│algebra 2 vertex form │calculate the area and the │graphic calc web polynom online │dividing calculator │online factorising │
│ │circumferance of a shape │ │ │ │
│solving equations with fraction │tutorial on boolean algebra in maths │algebra 2 notes linear equations and │ti-89 manual linear equation graph │Real Numbers │
│as a coefficient │ │functions │ │ │
│solving literal equations │who invented index radical notation │subtract negative and positive │what is an expression in 4th grade │www.zeros in the quotient .com/worksheet │
│worksheets │ │fractions calculator │algebra │ │
│ │ │how many consecutive numbers do you │how do you combine like terms before │6th grade worksheets for finding the volume│
│summation ti83 │simplify each expression calculator │need to guarantee the number is │solving │for rectangular, pyramid and cube prisms │
│ │ │divisable by 5 │ │ │
│mcdougall littel pre-algebra book│radical expressions big numbers │Beginner Algebra tutorial online │subtracting four digit numbers software │how to solve for a equation with only │
│on line book │ │ │ │variables │
│solution manual principle of │ │multiplying and dividing integer │ │ │
│mathematical analysis walter │quadratic equation in one variable │worksheets │factor a quadratic calculator │converting to binary number ti 89 │
│rudin │ │ │ │ │
│ │ │evaluating graph of function to find │prentice hall mathematics algebra 2 │lesson 3.3 algebra write a rule for each │
│+find the square of a fraction │how to subtract algebraic expressions │undefined points │answer key │table using the given letters to represnt │
│ │ │ │ │the variable │
│mathsheet on circle graph │"free college algebra help" │grade 7 divisibility rules and number│how do i do combinations rule on my ti-83│maple output format long │
│ │ │properties worksheets │calculator? │ │
│converting base 5 │1o properties of algabra │TI-89 beginning algebra problems │t-83 plus emulator │free download accounting books │
│how to solve expressions │picture for math area │addition of similar fractions │How to find the Square Root of an item │ALGEBRA ANSWER │
│homogeneous differential solver │factorization quadratics │nth root worksheets │plynomial long division work sheet │Equation Factoring Calculator │
│ │ │sample math high schoolprojects of │ │ │
│dividing integers worksheets │graphing worksheet │real life situations of grade 11 and │PREALGERBRA │mcdougal littell pre-algebra workbook │
│ │ │12 │ │ │
│radical calculator │printable worksheet of addition to 20 │simplify radical expressions │online lowest common denominator │answers for pre-algebra special activities │
│ │ │ │calculator │book (the plane facts) │
│ti-84 downloadable calculator │simplifying expressions worksheet │pre algebra mixture problems │help solving multivariable equations │"free worksheets" "distributive property" │
│ │ │ │ │"real numbers" │
│multiplying by the conjugate of a│boolean algebra "multiplying" │multiplication multiple variable │finding a variable while dividing │3rd grade math lesson plans inverse │
│cube root │"factoring" equation │equation solver │fractions │operations addition/subtraction │
│fraction least to greatest │online substitution method calculator │decimal mixed number │james S. walker physics third edition │second order ode solver │
│ │ │ │ebook │ │
│mathematics trivia │multiplying radical expression solver │excel solver system solution │TI-84 Plus Using Factoring │"logarithms on a ti-83" │
│ │ │equations │ │ │
│rules for adding/subtracting │least common denominator calculator │example matlab non linear │FREE intermediate algebra worksheets │cubed polynomials │
│integers │ │differential equations │ │ │
│Algebra PDF │free subtraction review │ks3-maths triangle number grid/nth │TI 84 plus download │decimal to fraction simplest form │
│ │ │term │ │calculator │
│"pre algebra" and readiness │free maths non-calculator revsion notes│free prentice hall algebra 1 online │graphing calculator worksheets ti 84 │6th grade decimal practice │
│ │ │book │ │ │
│mcdougal littell biology online │aptitude test papers download │Algebra 1 worksheets and answer keys │free pre algebra tutor │synthetic division program ti-84 plus │
│math tutorials for 5th graders │multiplying fractions work book │how to solve equations with a big │factoring algebra A-level │algebra formula sheet │
│ │ │division sign │ │ │
│pre algebra linear equations │distributive property printable │boolean identities problems with │converting negative mixed numbers to a │how to graph quadratic formulas using table│
│ │worksheets │solutions │decimal │of value │
│solving quadratic on ti 89 │Solving equations, radical, rational, │distributive property with fractions │McDougal Littell World History notes │algebra practise sums │
│ │exponents, Absolute value │ │ │ │
│milf/teachers │least common denominator algebra │glencoe algebra skills practice │basic algebra free cd │printable worksheets for 8th grader │
│ │ │workbook │ │ │
│combining like terms interactive │mcdougal littell world history tests │subtracting fraction integers │practice problems simplifying radicals │method of squares hyperbolas graph │
│ │ │ │and powers │ │
│free anser for math problrms │+how to solve wave function │Prentice Hall Mathematics │prentice hall course 3 workbook answers │glencoe mathematics algebra 1 book answers │
│work out a quadratic formula │questions in boolean algebra │add and subtract square roots │Javascript modulus divisor │online calculator turning decimals to │
│download │ │ │ │fractions │
│log base │Simplifying with Parentheses │solving differential equation first │A system that does your algebra home work│adding and subtracting integers word │
│ │ │order two variables │for you │problem worksheets │
│how to use a casio calculator │algebra substitution method calculator │factor tree, work sheet │any kind of math games for 5th graders │in math "investigatory project" │
│algebra 2 software │algebra 1a prentice hall workbook │converting a fractional equation to a│word problems and equation in math w/ │Calculas formula │
│ │ │quadratic equation │answer │ │
│dividing polynomials by binomial │ERB practice test for 6th grade │free worksheets for tenth grade math │5th grade algebra problems │distributive property pre algebra grade 7 │
│solve linear system ti 83 │learn to algebra expanding and │9th grade practive science problems │Square root method │long division with variables worksheet │
│ │simplifying grade 11 │ │ │ │
│ │using a calculator to find the sum or │5 problems with answer,simplifying │quadratic equations completing the square│solving simultaneous equations in 3 │
│algebra ks2 │difference of squares made easy │complex rational algabraic │step by step │unknowns calculator │
│ │ │expressions │ │ │
│divide polynomials for ladder │section 2 acceleration glencoe with │multiplying/dividing integers │t-tables and graphing ordered pairs using│Prentice Hall Mathematics Algebra 2 │
│programming │answers │ │shapes grade 6 alberta, canada cirriculum│Workbook Answers │
│Simplify Algebra Calculator │first grade algebra readiness lesson │Glencoe Algebra 2 Workbook Answers │"free answer" for vocabulary from │pearson hall prime number worksheet │
│ │plans │ │classical roots C │ │
│writing fractions as a decimal │cost accounting book with keys │mcdougal littell algebra 2 resource │printable numberline bsolute value │what is the difference between exponential │
│worksheet │ │book answers │ │and radical forms of an expression │
│solve algebra equations with age │method of decomposition and factoring │beginning algebra worksheets │linear subtraction equation problems and │online fraction simplifier calculator │
│ │ │ │answers │ │
│algebra factoring square root of │holt california algebra 1 textbook 7th │worksheet adding like terms │sample worksheets for finding the volume │algebra 2 homework answers │
│negative numbers │grade │ │of pyramids in mathematics │ │
│free Polynomial problem solver │6th grade math test generator │algebra help solving rational │abstract algebra tests │ti 89 program civil │
│ │ │exponents │ │ │
│solving nonlinear equations │logarithmic equation in exponential │writing formula in interval notation │partial sums │boolean algebra solver │
│matlab code │form problem solver │ │ │ │
│4 equations 4 unknowns solver │rate online algebra 2 software │GRE permutation and combination │solving the variable │graph axis calculate steps │
│ │ │practice │ │ │
│adding two negative fractions │self tutorial algebra II │adding multiple integers │Roots of real numbers power point │free online 7th grade algebra writing │
│ │ │ │ │expressions and equations │
│solving nonlinear simultaneous │how to find slope from quadratic │greatest common factor of 125 │math trivia with questions and answers │calculus integration substitution │
│equations │equation │ │ │ │
│algebra pizzazz │pre algebra with pizzaz │a factoring polynomials calculator │examples simplifying radicals expressions│Simplifying negative Algebraic Expressions │
│ │ │program │ │2-5 │
│ks2 factors worksheets │Algebra with Pizzazz Answer Key │solve an equation with negative │pythagoras theory printables ks2 │worded problems with solutions in college │
│ │ │exponents │ │algebra │
│how to solve simple fractions │cube root of Fractions │T83 calulator │explain addition: the partial sums method│scientific notation t184 │
│worded problems in special │finding the square root worksheet │5th grade exponents worksheet │tricky core java m.c.q with answer │answers for the integrated mathematics │
│products and factoring │ │ │ │McDougal book 1 │
│answer to prentice hall algebra 1│solve square roots │add, subtract, multiply, and divide │simultaneous equations non linear three │where can i downloads games for ti-84 plus │
│ │ │integers │variables │ │
│ratios and proportions worksheet │calculator program for factoring │algebra answers │mcdougal language arts book cheat sheet │permutations and combinations tutorial │
│middle grades │polynomials │ │grade 6 │ │
│calculator that shows its work │how to square root on calculator │take the 3rd root │word problems in trigonometry │combing like terms worksheet │
│partial sum decimal addition │factor expression rational exponent │cubed factoring │how to divide radicals with different │"difficult factoring" worksheets │
│ │ │ │index numbers │ │
│2nd order linear systems │online quadratic equation solver with │practice workbook algebra 1 answers │how to solve an equation │least to greatest using decimals and │
│ │pi │ │ │percents │
│trivia in algebra │percent worksheets discounts │how to put a pdf on a ti-89 │free download costing problem and │First Grade word problems worksheets │
│ │ │ │solutions for ca final │ │
│Logarithm pdf solving and formula│foundations for algebra worksheets │"algebra 1 online textbook" │solving equation fractions worksheets │basic algebra for first grade │
│removing algebraic brackets │solving systems with fractions in │worksheet on adding and subtracting │Lesson plans for adding integers │adding and subtracting negative #s & │
│simulation │algebra │negative numbers │ │worksheets │
│one to one parabolas │Pearson Education Algebra 1 chapter 2 │prentice hall algebra 1 book answer │divide expressions calculator │knowing the difference in the square root │
│ │worksheet answers │ │ │of a number and a number squared │
│factorizing cubed expressions │glencoe algebra sample pages │rewriting combinations and │Accounting Principles, 8th Edition-answer│converting decimal to fraction │
│ │ │permuatations │ │ │
│integers online games │adding and subtrating fraction games │simplified form for radicals │calculator for similar radicals │solving derivative of ln(x) using the limit│
│ │ │calculator │ │definition │
│slope formula problem solver │simplifying expressions cubed root │solving equations with pascal │addition to 13 worksheets │solving simultaneous equations in matlab │
│ │ │triangle │ │ │
│calculating probability on a │boolean equation solver │solving square roots manually online │factorising quadratics calculator │how to change a decimal to a mixed number │
│ti-83 plus │ │ │ │ │
│problem solving worksheet and │combining like terms worksheets │TI 83 statistics exercises pdf │trigonometry trivia questions and answers│QUAD feature TI 83 │
│integers │ │ │ │ │
│fourth grade fraction worksheets │FREE BOOKS IN CALCULUS MATHS,PDF │math sheet, area of circle │"McDougal Littell" Algebra 2 SOLUTIONS │TI-89 how to change log base │
│substitution method problem │solve square roots in denominators │coordinate plane worksheets │radical expression calculators │derivatives of algebraic expression example│
│solver │ │ │ │problem with solution │
│free worksheet ratio proportion │maths foundation plus past exams │factoring trinomial calculator │quadradic fraction inequalities │sobyfactor.html │
│unit conversion │questions papers │ │ │ │
│domain of third degree equations │Algebra Problem Solver Step by Step │algebra equations for percentage │solving inequality by addition and │adding and subtracting integers worksheet │
│ │ │difference │substraction worksheets │in football form │
│solve two variables non-linear │graphing calculator ellipse online │how to solve equations for rational │examples of worded problems in algebra │simplifying fractions using distibutive │
│equation with matlab │ │numbers │math 2 │property │
│find square of a fraction │algebra substitution method fractions │binomail expansion worksheets │first grade math sample sheet │mcdougal littell online book │
│how to use a ti-84 to solve │College algebra: An Early Functions │solving a system of equations with │how long is a lineal metre │balancing chemical formulas │
│quadratic equations │Approach Tutorial CD Roms │TI-83 │ │ │
│one step equations puzzzles │simplifying exponents │divide by the GCF and solve for the │gauss jordan method show steps done on ti│solving second order differential equation │
│ │ │unknown worksheet │84 │ │
│completing the square real life │HOW TO GET PDF ON TI-89 │online solve simultaneous equations │simplification complex numbers │fractional expressions calculator │
│situations │ │ │ │ │
│completing the square worksheet │free online math games 9th grade │fraction activities and third grade │slope equation on ti-83 │maple solve system of equations polinomial │
│ │ │ │ │equation │
│math simple fracion worksheets │how to find the lowest common │indefinite integrals calculator │free site to use to help solve algebra │Sample problems on Dividing Radicals in │
│ │denominator in algebraic fractions │antiderivatives │problems │mathematics │
│equation calculator with │matlab equation rectifier │graphing calculator T1-83 online use │change a quadratic equation to vertex │graphing quadratic equations interactive │
│substitution │ │ │form │ │
│factoring applications for ti 84 │solving nonlinear differential │solution principles of mathematical │online factoring trinomials calculator │do algabra onlinr │
│plus │equations │analysis free │ │ │
│newton's method ti 84 BASIC code │3rd grade math free printouts │subtracting square roots with │how to solve second order differential │how to solve arithmtic aptituse questions │
│program │ │parenthesis algebra │equations │age ratio │
│kumon worksheet │percent grade degree calculator │solving quadratic equations with │free accounting book download │multiplying, dividing, adding subtracting │
│ │ │negative square roots and fractions │ │polynomials │
│algrebra tutorial substitution │fraction of a square root │Nelson Math work sheets │slope exercises grade 8 │linear algebra with applications otto │
│ │ │ │ │solutions │
│step by step instructions on how │ │ │ │ │
│to do the elimination method in │math for dummies on cd │6TH WORK SHEET │t183 calculator online │fully simplify (2x cubed)to the power of 5 │
│alegbra │ │ │ │ │
│how to do simultenous equation │online tI-84 Plus │cube root simplify │simplifying square roots using the tree │math books solutions │
│using the ti 89 │ │ │method │ │
│free sample word problems for │adding, subtracting, multiplying and │download 8th grade algebra test │holt key code │circle graphs + sample math problems │
│polynomials │dividing integers using zero pairs │ │ │ │
│7th grade print worksheets scale │ti-89 basic hacks │learning algebra ii online for free │parabola equation converter │grade 6 test sheets free │
│factor │ │ │ │ │
│radical equations and │answers to the holt algebra1 homework │completing the square practice │holt rinehart ratio proportions │+math+Division+Worksheets+fifth+Grade │
│inequalities 3 times a radical │and practicwe workboook │ │powerpoint │ │
│formula LogMar to Decimal │6th grade christmas math │"cross product" "ti-84 plus" │fluid mechanic ppt │factoring cubed │
│physics mcqs │second order differential │simple math for dummys │how to do laplace on ti89 │algebra fractions addition method │
│ │nonhomogeneous │ │ │ │
│power of radicals without │cubed functions │square root simplification calc │can manipulatives be used in algebra │symbolic method │
│calculator+ worksheet │ │ │ │ │
│solve first order differential │formula sheet 7th grade │convert 345 in binary │how do you divide? │Solve by substitution calculator │
│equatiion using laplace │ │ │ │ │
│how to solve logarithmic │equations with fractions and │simultaneous nonlinear equations │6th grade math worksheets on radicals │ordering fractions from least to greatest │
│equations on a ti-89 │proportions │ │ │worksheets │
│finding the vertex of a linear │POLYNOMIALS USING SPECIAL PRODUCTS │exponents lesson plan │Combining Like Terms Worksheet │rational exponent calculator │
│equation │calculator │ │ │ │
│maths test in year 8 │putting chemistry equations in a T9 - │worded problems in trigonometry │How to convert a decimal to a mixed │simplifying radical expressions calculator │
│ │83 │ │number │ │
│simultaneous nonlinear equations │solving algebriac equations on ti 83 │subtracting polynomials on ti-83 │multiplying and dividing numbers written │help with dividing polynomials │
│ │ │ │in scientific notation solver │ │
│TI-89 pdf │how to solve mixed fractions │Algebra Readiness by McDougal Littel │online math aptitude test │factoring trinomials decomposition │
│ │ │answer sheets │ │ │
│nonhomogeneous partial │ │combine like terms expression │ │what does the online scientific calculator │
│differential equations, │visual basic square fórmula │fraction │simple english aptitude question paper │for clep look like? │
│applications │ │ │ │ │
│sums of permutations and │polynomial division solver │multiplying square roots calculator │maths trivia for kids │non constant coefficient linear second │
│combinations │ │ │ │order ode │
│integer order of operations with │converting to numeric base calculator │greatest common multiple how to solve│free download some example aptitude │adding and subtracting integers worksheets │
│missing numbers │ │with 3 numbers │questions and answers │ │
│inequalities graphing worksheet │mathematics trivia │what are square roots not using a │solving 2nd order partial differential │write a quadratic in vertex form │
│ │ │calculator │equations │ │
Search Engine users found our website today by entering these keywords :
Simultaneous Equation Solver, Free download accounting books, balancing chemical bonds, need help with algebra homework, multiplying rational expressions calc.
Multiplying and dividing monomials worksheets, algebric fomulas of cube, differential equations nonhomogeneous solve, cost accounting textbooks in uk.
Simple aptitude questions with answers, multiplying rational expressions calculator, Homogeneous and Nonhomogeneous Equations., free answers for algebra, problem solver for rationalizing a
denominator containing a radical, yr 9 maths work, printable algebra worksheets variable, function patterns.
Solve two linear equations java, converting percents to fraction and decimals worksheet, antiderivative calculator online, TI-86 how to input equations using fractional exponents, lcm in everyday
life, how to solve 2nd order nonhomogeneous ODE example.
Shortcuts to solving math software, evaluate algebraic expression worksheet, free polynomial long division problem solver, distributive equations-algebra worksheets, rational expressions online
Modelquestionpaper of halfyearly for ninth standard, practice exercises factorising polynomials by completing the square, factoring quadratic polynomials with algebrator.
Multiplying and dividing fractions word problems worksheet, math book answers, slope formula in excel, rational exponents and roots, College Algebra workbook PDF.
Formula for multiplying complex roots, nth term calculator, free online quadratic inequality solver.
Decimal to fraction worksheet, basic factoring algebra equations, problems in algebra and there solution, first grade algebra/ lessons.
Pythagorean theorem program for TI-84 calculator, ks2 maths sheets print out free, how do i use a radical in excel, mixture problem solver.
Ti-89 solve, solving quadratic equations by using a formula for fractions, free online math games - negative and positive integers, pdf for TI-89, solving equations worksheet, method math.
Free study material for college algebra clep, test bank of financial accounting seventh edition download, worksheets algebra tiles.
Java aptitude question, solve third order quadratic equation, adding and subtracting integers activities, linear algebra done right solution manual, basic programming "Heat transfer" ti-89.
Square root property, solve differential equation with quadratic term, bungee jumper - laplace - maple worksheet - maths, square roots worksheet.
Free books on aptitude questions of simplification, powerpoint presentation on graphing ordered pairs, solve nonlinear equation matlab, cost accounting + questions + worksheets, what is a equation in
the form of a fraction, free algebra worksheets, math terms poems.
Algebra practice test worksheet, algebra and trigonometry book 2 online, sq root symbol for calculator, radical expression calculator, subtraction equation terminology, secondary math worksheet.
Algebra Dummies Free, write a program that finds first 20 numbers when divisible by, How To find the sum between 1 and a number, what is the latest version of Algebrator software by softmath,
fractions worksheets for 4th grade.
Polynom solver applet, Polynomial Long Division Calculator, pre algebra glencoe mathematics answer key, jenkins-traub root refinement, area formulas worksheet website for fifth graders.
EQUATIONS INVOLVING RATIONAL EXPRESSIONS, common interest formulas cheat sheet, math calculations on line test, 3 equations excel, absolute value expressions solver.
Algebraic expressions worksheets, using fraction of power, normal equations third order polynomial, equation matlab forth degree.
Download maths problems for 9th class, learn algebra online for free, distance formula solver for ti84 plus, numerically solving a first order differential equation in Matlab, hardest equation that
is solved mathematical equations, math-integers handouts, writing decimals as fractions calculator.
Exponential variables two, Holt Pre-Algebra Practice B 6-7 answers, Holt Texas Algebra 1 online book, triangle worksheets, quadratic factoring calculator, turning 14.7 into a mixed number.
Evaluating an integral on a graphing calculator, printable worksheets with slopes, phase portrait Is the ellipse Maple, GED math word problem worksheets, differentiol equations similarity solution
combination of variables, how to work out a pre algebra word problem, worksheets for finding least common denominator.
Algebra worksheets mastery mathematics, algebra cube of a binomial, answer for glencoe pre algebra skills practice using the percent proportion, solved question bank about teaching aptitude,
converting standard form to vertex, free online algebra 1 problem solver.
Solve quadratic differential equation, online factoring, solve quadratic equations by factoring calculator.
Calculate exponents, square root expressions, simplify 500 cubed, simplify radical equations solver.
Ti-84 calculator+downloads, 3rd. grade TAKS preparation worksheets, coverting mixed fractions to a decimal, yr 7 maths test decimals, ti 89 quadratic equation, solving decimal polynomials.
Add or subtract any given radical expressions, free worksheet writing rules for linear functions, abstract algebra for dummies, steps of ordering fractions.
Polynomials for idiots, college ratio math help, inequality worksheet elementary, algebra radicals help.
Free dowload cost accounting, trig help solver, operations with integers puzzle, solving quadratic equation in matlab, free pizzazz math sheet, hard math equation example, free download aptitude
Re writing a fraction in multiplication, simplify square root calculator, simultaneous complex equations on ti-89, algebra formula chart, sums and there solution from volume and area of cube and
cuboid of class 9, printable louisiana ged practice test, adding signed numbers worksheet.
Convert to radical, CLEP algebra equivalent practice test, slope intercept formula.
Entering logs into the ti-89, freee printable symmetry worksheets, algebra work, "middle school" math dilation, completing the square multivariable.
Free Polynomial Solver, math poems about 1/3, ti 84 apps simple interest formula, steps to solving quadratic equations by square root, Adding and Subtracting Integers Worksheet, solving Multipul
simultaneous equations.
Second order nonhomogeneous nonlinear equations, graphing linear equations, TI-83, trigonometry activity with answer.
Aptitude Test Download, solving equasions, math tutor mission texas, how to program a game for the ti-84, solving for a variable in matlab, Math for Dummies, cheat on clep.
How to calculate an intercept when slope is known, alegbra pizzazz, how to solve dividend+remainder+l.c.m. regarding problems, free download accounting books, free to print coordinate work sheets,
hyperbola equation, solving 5th grade equations with excel.
Download Cognitive Tutor Algebra® Software, solving nonlinear simultaneous equation, online textbook free geometry Mathematics Geometry (Florida Edition)Prentice Hall Geometry (Prentice Hall
Mathematics), difference quotient math solver, factoring quadratic calculator, step by step to solve differential equations.
Pearson prentice hall excel exercises answers, holt math worksheets, evaluation and simplification of an expression, line plots math elementary worksheets, college math calculator.
Yr 8 hard maths problems, second order homogeneous differential equations, "cost accounting" ebook, college algebra problems fusion, algebra, formula for percentages.
Mathlab quiz answers, free printables plotting ordered pairs, algebra with pizzazz.com.
Free Rational Expressions and Functions calculator, matlab solve returns rootof(X1, building scales 8th grade math, Ten Key Tutor Free.
Changing a radical to an exponential expression calculator, maths factor calculator, factoring polynomials cubes.
How do you divide a fraction that = a variable, graphing algebraic expressions, free downloadable e books of Aptitude.
Beginning algebra sheets, grade 9 ontario free math sheet, inequality range formula, Algebra with Pizzazz worksheets, answers to math problems solving rationalizing radicals, SOLVING EQUATIONS
CONTAINING RADICAL EXPRESSIONS, free downloadable Permutation Combination Problems Practice.
Dimensional analysis math worksheet, bash calculation mod, quadratic formula for the solution of a third degree polynomial, linear, inverse, quadratic relationships in graphs, solving quadratic
equations by square root method worksheet, free worksheets for 8th grade algebra, intermediate algebra cheat sheet.
Quadratic roots calculator imaginary, TI-84 factoring tool, online least common denominator finder, converting cubed roots, equation for converting farenheih into digree celsius, y-intercept of slope
concept, prentice hall mathematics pre algebra.
Taking the square root of a fraction, factoring third order polynomials, factorials worksheets, Ninth Grade Algebra, logic math problems-worksheets.
Solve three nonlinear equations with Matlab, download concrete proportions calculator, algebra vertex form quadratic, excel solver and recursive formulas, standard grade free past paper printout,
free algebra 1 solver.
Free online math worksheets for grade 8, partial-fraction expansion texas ti-89, simplifying radical expresions calculator, homogeneous second order differential equation, solving graphing problems,
equation solver on ti 83.
Solving equation calculator trigo, download kumon, 7th grade math problems beginning algebra free, ebooks "cost accounting", how to solve equation for given domain, pre algebra game shows.
Solving equations involving rational expressions, how to solve algebraic fractions, free printable worksheets on integers, radicals and square roots, nonlinear differential equation +matlab, how to
solve for range in a graph, write and solve an equation worksheet.
Phoenix ti 84 cheats, convert expressions as one Logarithm, rectangular to polar coding visual basic textbook, complex math on ti, algebra 2 curriculm.
GCSE Maths-Probability and equality, math equation for finding a percent, excel, equation, quadratic.
How to solve quadratic distance word poblems, program to solve system of equations on ti 84, expanding cubed brackets, most recommended college algebra tutor cd, quadratic equation factoring
calculator, java convert decimal to fraction.
Modern biology mcdougal littell, formater Ti 84+, impossible question 1/3 of fourth graders are unable to do this, adding ,multiplying and dividing signs, apollo 2000 cooke data sheet, free aptitude
questions with answers, Fraction formulas.
5th grade square root problems and answers, probability sats questions, adding negatives and positives worksheet, solving by square root method worksheet, solving inequalities parabola, solving
systems of equations by graphing calculator using cramer's rule.
Simple factor tree worksheets, how to graph slope on TI-83, word version of maths exam paper.
Free printable graphing paper for linear Equations, matlab solving third order ode, divisions of complex matrix 3 unknowns, 7th grade math dimensional analysis, converting between bases with ti 89,
physics solved numerical problems related to gcse olevels, free accounting books.
Algebraic expressions power point, McDougal littell world history worksheets, how to solve simultaneous equations on ti 83, percentage equations.
Worksheet square roots and square, free printable logarithmic function worksheets, solving 2nd order equations with laplace transforms, combining like terms worksheet.
Integer review worksheets for free, kumon work sheets download free, calculation sheet for wallpapering worksheet, algebra expanding brackets worksheets, online math test editor.
The ALEKS Math Self-Assessment, book of aptitude test+download, how to solve probability and odds, complex number system equations, free online calculator for vectors, HOW TO SOLVE QUADRATICS ON TI
Lcd,algebra, Decay half life on Ti 84, circuit solver ti calculator, algebra slopes for dummies, expression factor calculator, math trivias using numbers, easy way to calculate formulas in excel.
Vertices algebra 2 definition, free grade 3 math ppt, algebraic expression for word phrase worksheet, t1-83 calculator online, calculator online fractions simplify, Percentage equations.
Algebra equation solver for the ti-84 plus, polynomial algebra solver divison, solving fractional exponent equations, simplifying expressions calculator.
Free online calculator with square root function, pre algabra, decimals worksheet free printables, addition & subtraction equation worksheets, why factoring polynomials is important, Investigatory
project in mathe.
Quadratic equation will graph what for type of graphs, general aptitude question and answer, like fractions addition worksheets, program lowest common denominator.
How to add all the y values on a graphing calculator, 5th grade, free math percentage problems, game theory: brain teasers for beginners, algebra relating graphs to events.
Pre algebra with pizzazz, pictures on graphing calculator, math trivia, +multipling and dividing polynomials in grade 11 free, answers to college algebra problems free.
Definite integrals using method of substitution, free holt mathematics worksheets, algebra games solving for X, how to solve equation poem, matlab solving nonlinear simultaneous equations, free
online rational expression calculator.
Simplify radical expressions, adding and subtracting binomials calculator, texas instrument calculator converting decimals to fractions, how to convert decimals to fractions on TI-83.
Properties of exponents lesson plans, algebra pie symbols, algebra solver reviews, TI-84 Plus silver factor.
Sample of math trivia question, fractions decimals worksheets, differentiate between evaluation and measurement, solving linear programming problem in TI-83.
Convert decimal to mixed number, find the square of the radical expression, free polynomial solving on line, algebric eqations, free elementary algebra calculator, adding and subtracting decimals
worksheet, simplify the complex fraction calculator.
Online algebra solvers radicals, what is a scale factor, TO MAKE FORMULA SUBTRACT, sample of basic accounting test.
Writing equations power point, "key terms" fourth grade graphing, ti83 plus cube roots, adding fractions with opposite signs.
Learn algebra free, ti 89 completing the square, begining algebra program, TI 83+ equation solver programs.
General aptitude question, calculating quadratic equation when you know the roots, multiply and divide fractions worksheets, aleks.com cheats, calculator online for signed numbers.
Algebra for dummies, multiplying and dividing integers worksheet, subtract rational expressions with common denominators, free revision-past-papers ks2, english cross words worksheet beginner,
quadratic equations positive negative.
Graphing ellipses programing, java print out all numbers divisible by 2, powerpoint on Solving quadratic equation’ for gcse classes, 9th grade calculator, third root, hard math calculations, graphing
Algebraic and their expression solutions, pre-albegra word problems with variables on both sides, solve second order differential equations on matlab, algebra 2 hard questions for parabolas,
distributive property exercises sixth grade, addition and subtraction of positive and negative integers worksheets.
Florida edition glencoe mathematics pre-algebra book teacher edition, factoring trinomials worksheet diamond, algerbra calcaulator, solution of second degree non homogenous differential equations,
cost equation for cache.
Taking the square root of exponents, Exercise Worksheet Java Software Solutions, college algebra 7th edition gustafson/frisk, "quadratic equation"+ multiple variables, How to Solve a Exponential
Growth Equation, adding and subtracting negative positive numbers.
Teach me trigonometry u tube, High school math solving exponents, trig answers.
Lesson plan, simple linear equation, year 10, how to make ti-89 solve any problem, INTEGER worksheets.
Step by step Using scale factor, non homogeneous linear equation, ti-89 solve for y, algebrator download.
Solution Problem 17 Chapter 3 Real and Complex Analysis Rudin, coordinate transformation on casio scientific calculator, fact and statistic about homework.
Sample java code for accepting both numbers and decimal values, sample project on "statistics' for high school, saxon math algebra one answers, 3rd and 4th grade grids and coordinates worksheets,
linear differential equations cheat sheet, polynomial factor calculator.
Factoring polynomial machine, sequences worksheets for maths, accounting book answers.
Second order differential equation solver, simplifying equations with powers, 8th grade math sample ny, non homogeneous equation solving, manual download ti 89 calculator english.
Installing free algebrator, solving second order differential equations, glencoe mcgraw hill algebra chapter 9, program that factors equations.
Solving systems of linear equations in excel, fraction worksheet LCD, Arithmetic Reasoning Tutor Online for Free, nonlinear simultaneous equation.
Simplified Radical Form, section formula and its +mathamatical application, ANSWER REAL AND COMPLEX RUDIN PROBLEM 20 CHAPTER 5.
Abstract algebra+homework, easy way to find radical expressions, how to factor on ti-83 plus calculators, free sample 11+ exams.
Vertex of an equation, solve for second order nonlinear differential equation, What are the four fundamental math concepts used in evaluating an expression?, cubing polynomials, rationalizing the
denominator quick solver, online mixed number to decimal calculator, manufacturing account books pdf.
What is the difference between evaluation and simplification of an expression?, ca cpt guess papers, how to factor a radical fraction, subtracting negative fractions, equation for 35.00.
Free online math worksheets for linear equations, factoring: for dummies, slope for quadratic equation.
Formula 4th grade math, 11+ maths for year 6 free online, can you multiply square roots and regular numbers, java linear equation, "permutation and combination", 1st grade writing sheets.
Geometry chapter 2 test a mcdougal littell answers, cubed factoring equation, algebra pyramid.
Prime number generator in quickbasic, define graph hyperbola, online calculator with radicals, quadratic equation factored form calculator, scientific notation examples adding subtracting multiplying
and dividing, apti question and answers.
Standard grade algebra, squate root conversion, APTITUDE QUESTION, applied problems, dividing a polynominal by a binominal, simplifying complex number calculator, test 4th grade adding and
subtracting whole numbers, square decimals.
Multiplying and dividing games, radical square root online calculator, TI 84 how to program foil into calculator, second grade primary school english test templates free, maths sheets for yr 8 and
yr9, differential equations matlab.
TI-83+ rom download, prentice hall pre algebra practice workbook answers, Figuring out Trinomials, free printable mental maths exercises for primary classes, multiply rational expressions involving
polynomials, ti 84 calculator online, MULTIPLY RADICAL EXPRESSIONS INVOLVING PARENTHESIS.
Cube square roots on a calculator, online fraction solver, solve on number line pre algebra, integers rule for dividing with negative numbers with variables.
Completing a square questions, Algebra 1 for dummies, math solver logarithms, software company aptitude questions and answers.
MANUALTI89, solving by elimination calulator, Ti 89 complex Matrix, math trivia grade 5, Scale Factor in Algebra.
APTITUDE QUESTIONS WITH SOLUTIONS, free georgia 9th grade test and answers, how to use dictionary guide words + free printable worksheet + middle school + teacher resource, how to find the scale
factor (in math ), Classic Physicis math symbols, math test of genius questions and answers.
Solve slope practice problems, x-intercepts for sideways parabolas, trig calculator download, multiplying rational expressions and functions fraction, factor a cubed polynomial.
Softmath, how do solve an equation involving a rational expression, hard pythagoras' theorem worksheet - problem solving, VB6 + LCM, second order differential equation to first order, free
multipication maths for fourth garde, common factors word exercises.
How to write a 3rd order polynomial equation in differential form?, the greatest denominator, polynomial long division problem solver, gcse maths solutionbook, erb test practice, solved past papers
of History(O level), download aptitude test and answer.
How to change a mixed number to a decimal, trigonometric identities problem solver, do to factor on a graphing calculator, combination algebra.
Simple steps to learn balancing chemical equations, high school practice square roots, pre algebra slope worksheet, quadratic equations convert to decimals, online substitution method calculator.
A pluse maath, changed a mixed number into decimal, holt algebra 1 resources, cost accountancy book, solving algebra problems online.
Math answers for free, hardest math problem in the world, GENERAL APTITUDE QUESTIONS AND ANSWERS.
Log ti-89, free worksheets on writing rules for linear functions, ti 84 plus program for domain, dividing polynomials cheat, free mental maths worksheets for grade 8, dividing rational expressions
Algegra maths, worlds hardest math problem, multiplying square root expressions, rational expression calculator, how to beat green globs.
Tests for mcdougal littell world history, lowest, "cost accounting" INURL:(PDF | chm), ratio and proportion free exercises, ordered pairs powerpoints, A beginner's guide to exponential equations,
solve polynomial equations java online.
Math worksheets algebra slope inequality, program that will solve math problems, ti 83 program for solving 3 equations 3 unknowns, intermediate algebra tutoring help, free powerpoint presentations on
solving equations.
Casio calculator exponential, download vb program in TI 89, error 13 dimension in TI-86.
Write each decimal as a fraction in simplest form, PRENTICE HALL FL ALGEBRA 1, t-i 89 Simplifying Rational Expressions.
Adding, subtracting, multiplying and dividing with decimals worksheet 7th grade math, changing fractions to highest terms worksheets, examples of math trivia in geometry, Algebra 1 practice workbook
holt, ven diagrams on the ti 84.
Cyber +calculater, mixed decimal number, how to rewrite the exponential expression with the different base, multiplying integers worksheet, multivariable solver, scientific reading
comprehension+biology+keys+free samples.
Exponential simplify addition, online algebra solvers radicals free shows work, book for algebra for passing a CPT test, add,subract,divide,multiply factions free work sheet.
Algebra function machine calculator, algerbra calculator, solve a differential equation in matlab.
Quadratics square root property calculator, simplifying rational expressions calculator, percent composition ti 89 program, factoring binomial equations, Presentation to parents helping with
pre-algebra, formulas for algebra one, subtracting trinomials.
Sixth grade practice star testing, english aptitude with answer, algebra free online calculator, Fifth Grade Math Worksheets.
Aptitude questions & Answers Solutions, how to convert to base six, grade 11 mathematics model papers.
Ti-84 factoring trinomials, EQUATIONS WORKSHEETS, online book florida edition glencoe mathematics pre-algebra book teacher edition.
Diff square root, free english work sheet for grade 4, solve linear equations java, free trig downloads, ti 89 titanium rom download.
Calculator to divide expressions, using a calculator to solve a limit, pareto pdf ti-89, download free basic algebra book.
FREE DOWNLOADING OF VIDEO TECHNIQES TO SOLVE THE REASONING QUESTION, LCM Sums for fifth class, how to solve a second order ode?, question bank on aptitude, mcDougal littell workbook, Two Step
Equations Worksheets, Saxon Math Answers Free.
Modern algebra book free download, Free Algebra Projects, answers and problems to 6th graders dividing fractions, how do i enter a rational equation in matlab, algebraic expressions 5th grade.
How to FOIL algebraic expressions and solve for x, square root of a decimal, ti calculator emulator 84, how to solve log in ti-89, Teens and Compund interest, Factor Polynomials Online Calculator.
Non-linear differential equation, mac download college algebra solver, solving fraction equations: Addition and Subtraction, algerbra 2 book answers for prentice hall mathematics, hyperbolas for
Matlab equations from data, LCM Answers, least common denominator calculater, how to put equations into a graphing calculator, alevel l math exercise online.
Meijerg differential equation, california prentice hall math worksheets, Math Investigatory Problems, factors and multiples of a number - exercises, solving radicals, third order quadratic equation.
Lesson 7-4 prentice hall algebra 1 textbook, multiple variable equation solver, year 3 maths homework sheets, examples of simplifying algebraic expressions with answers.
Solving square root equations, algebra problems area triangle rectangle subtract, free math problem solver for adding and subtracting rational expressions LCD, permutations and combinations aptitude,
free coordinate plotting pictures elementary worksheets, Aptitude Questions in Java, three basic methods of solving systems of linear equations.
When a polynomial is not factorable what is it called? Why?, use online ti 89 calculator, printable pizzazz math worksheets, free worksheets on equations and parallel lines, dividing subtracting
adding polynomials, www.the easiest way to do algebra.com, need free printable worksheets on adding and subtracting intergers.
Question & answer of Aptitude+pdf, Physics Formula Sheet, quadratic equation ti-83.
Prentice hall florida edition solving equations by adding, first grade measurement worksheets, worksheets on writing simple and compound inequalities, algebra program, excel solve simultaneous
equation 2007, math investigatory.
Factoring polynomial calculator, tests from Algebra 2 and Trigonometry Structure Method Book 2, basic math help for dummies.
College recommended algebra tutor cd, ti-83 problem dividing, Do My Algebra Homework, operations with integers game, ti 84 plus emulator, midpoint formula program for TI-84, simplifying complex
rational fractions.
Algebraic inequalities word problem worksheet, setting up word problems with rational expressions, simple pre algerba, graph hyperbola in ti 84.
Fractions worksheets lcd, Free Math Trivia, boolean expression reducer.
Trigonometry Grade 10 syllabus canada, solving 2 non linear equations simultaneously ti-83, real life examples of hyperbolas, integer adding and subtracting worksheet, cubic root formula, 4th grade,
solving simultaneous equations solver with exponents, ELIMINATION CALCULATOR ALEGEBRA.
9th grade math worksheets to do online, Algebra software, solve compound inequalities and chart, Cramer's rule TI 89, scale word problem worksheet, algebra 2 tutoring, solve simultaneous equations
9th grade work, evaluating expressions practice worksheets, linera equation math by h.s hall, how to simplify powers fractions.
C aptitude tutorials with answers, implicit differentiation derivative calculator, simplifying radicals calculator, online factoring complex, english 8th grade lesson plan jordan, Learning Basic
Complex exponential algebra calculator, free linear equations worksheets, find the least common multiple variables, aptitude questions pdf, square root method.
Differential equations simplified, java code for algebra solver, prentice hall mathematics geometry answers, hard math quiz questions.
Exponential expression, MATHCAD émulation, linear relationship quadratic cubic, rational exponents solver, how to solve quadratic equation.
Free tutor on mathematical induction, largest common multiple calculator, TI-89 LOGIC PROGRAM, evaluating radicals and simplifying radical expressions, inverse natural log problems on ti-89, how to
teach 6th graders conversion, dividing decimal worksheets.
Matlab polynomial solve, simplifying square roots, algerbra equation answers, factoring a quadratic polynomial in two variables, prentice hall mathematics pre algebra nc, find a polynomial with least
degrees on ti 89, subtracting with zeros worksheets.
Add subtract multiply divide fractions, excel formula for adding and subtracting integers, multiplying the radical form.
Adding ,subtracting ,multiplying and dividing decimal worksheets, how to convert base 2 to base 10, lcd calculator, 6th grade combination formulas, tutorial activities for ninth grader, "coordinate
graph pictures".
Help with intermediate algebra, writing exponential equations, ppt, adding and subtracting radicals calculator, test of genius, pizzazz book E.
Problem solver software about assignment problem free, algebra investment problem calculator, simplify evaluate algebraic expressions, Multiply Rational Expressions Calculator, explain relating
graphs to events.
Differential equations using matlab, area of complex figures free worksheet, intermediate algebra help, algebra 2 cubic solutions problem solvers, adding and subtracting cube root formula, college
math for dummies.
What is the comon denomator between 8 and 9, mpi parallel multiple triangular solver, quDRATIC FORMULA.
Simplifying numbers, algebra 1 homework answers, property roots of equation, worksheets on least common denominator, Polar Equations,examples, intro algebra free worksheets.
Solving by elimination calculator, important apptitude question paper with answer, easy way to calculate celcius to farenhite, inetresting activities for algebra 2.
Factor calculator equation, i need help building an algebra problem, adding square roots with fractions, how do u do square roots on the texas instruments ti-83 calculator, rational exponent
calculator, convert mixed fractions to decimal, solving second order differential equation.
Printable ged math worksheet, creative algebra worksheets, negative positive worksheets, parabolas and linear lines, Least Common Multiple Worksheets, how to program sequence and series into a ti84.
"mod" "Texas 83 Plus", math-variables worksheets, how to get the cube root on a ti-83, Math Trivia Questions, vertex algebra.
Ks3 maths papers on line, question and answer about graph of a quadratic function sim and answer, free high level worksheets for adults, problem solving-dividing mixed numbers, online TI-83
calculator Free, how to solve plotting problems.
How to factor cubed polynomials, Free download aptitude Question and answer, study guides of mcdougal littell algebra structure method, stable polynomial 3rd order, linear differential equations
cheat sheet, easy understand mathematics, free book download + Advance differential equation.
Holt mcdougal algebra books, general aptitude questions, First grade math examples.
General aptitude questions with answers, algebra solve for square root, Free Algebra Problem Solver Online, pre-algebra work, quadratic functions factoring cube.
COMMON DENOMINATOR DIVISIONS, worksheets on solving addition equations - pre-algebra, online synthetic division solver, trigonometry aptitude questions and answers, how to figure out negative roots
on TI-89, math trivia for sixth graders.
Scientific+calculator+with+cube+root, Help With Elementary Algebra, how do you solve quadratic equations with a ti-89.
Prentice Hall Chemistry Workbook Answers, solve by substitution method calculator, simplify roots calculators, solve my expression, writing notes on ti 89, cubing polynomial calc.
Pre algebra "proofs", worksheets for dividing fractions, How is doing operations (adding, subtracting, multiplying, and dividing) with rational expressions similar to or different from doing
operations with fractions?.
HELP SIMPLIFYING AND FACTORING ALGEBRAIC EXPRESSIONS, convert 4.3 to a mixed number, Learn How To Do Algebra, free math homework for 5th and 7th grade, Dividing Rational expressions calculator,
equations with absolute values calculator.
Math tutorials, factoring, graphic of the distributive rule in algebra, how to solve nonlinear differential equation in matlab, "learn" and "sample C program", algebra 2 guide, 7th grade inequality
worksheets, free printable worksheets on coordinate graphs.
T189 scientific calculator vs t184, mc graw-hill school divison worksheets.com, simplifying logarithmic equations, solving one step multiplication equations worksheets, what is extended algebra?.
Quadratic equation trivia, basic algebra equation with variable in denominator, learn to add worksheet, adding and subtracting negative and positive numbers worksheets, add, subtract, multiply,
divide fractions project, free aptitude questions, fre work sheets for gcse maths.
Adding, subtracting, multiplying, and dividing complex numbers, "laplace transform" ti-89, integers numbers worksheets free, program ti 89 quadratic equation, sample pre algebra questions, guide for
the TI-38 graphing calculator.
Factoring quadratics calc, algebra expression calculator, java code find sum, fractions into decimals formula.
Solving Equasions, factoring quadratic calculator, binomials, polynomial, real world division.
Free lesson/work sheet english 5th grade, 411279, solving addition and subtraction of rational expressions, general third order equation, help combinations and permutations.
Solving linear equation with 3 variables, Free Intermediate Algebra Software, Free Math Problem Solver, online factorising.
Algebra 2 math answers, phschool math pre algebra string band, elipse calculation, calculator for eliminating fractions, Compare and order rational numbers 6th grade worksheets.
Online algebra factoring calculator, divisor formula for excel, learning basic algerbras, free formulas used for CAT mathematics, least squares second order differential equation.
How to Write a Decimal as a Mixed Number, solve for x graphing calculator online, Solving equations? Fractions? Integers?, calculator to convert decimal into fraction.
Polynomials, Permutations and Combinations sample questions 6th Grade, excel answer sheets general maths, what is substitution in mathmatics, how to do third square roots on a calculator.
Can i get worksheets for mcdougal littell science, how to use a ti-83 plus calculator for square roots, algebra 2 mcdougal littell chapter 3 workbook answers, sample word problems containing rational
algebraic expression, square roots of fractions.
Software in solving rational expressions and radicals, excel simultaneous equations calculator, multiplication solver, yr 8 maths training worksheets.
How to use a texas instrument fractions, math for dummies, online parabola calculator.
Whole square formulas, quadratic equation slope, homework answers math, adding subtracting multiplying dividing coefficients examples, polynomial long division solver, vertex for absolute value
Calculating sqaure root, online rational equation calculator, Algebra Homework Help.
Examples of math trivia, how to subtract and multiply and divide integers, Free Adding and Subtracting Radical Expressions Calculator, free pdf download + mathematics, math problem solver hyperbolas,
solving simultaneous equation on casio calculator, convertdecimaltofraction.
How to teach Scale Factor in Middle School, cost accounting download pdf, Graphing Linear Equations Worksheets, indefinite problem for solving of equations by graphing, integral equations to real
life problems.pdf.
Solve algebra problems with radicals for free, hungerford solution, previous exam papers for math in yr 12, verbal expressions and steps for solving, aptitude Questions and answer, download, solving
second order differential equations with initial condition, how to convert mixed fraction to decimal.
Ordering negative and positive integers decimals and fractions worksheet, free worksheets for cross multiplying, algebra help multiple parenthesis.
Adding subtracting multiplying decimals, fractions from greatest to least, substitution method in algebra, step by step free integral calculator, subtracting integers, math work sheets -area
formulas, nonlinear system of equation solving in matlab.
Simplifying algebraic expression, seventh grade Fundamentals of Math exam study guide, Holt Mathematics Course 3-finding percents, why is intermediate algebra useful in everyday life, Advanced
algebra chapter 5 prentice hall.
Factoring quadratic expressions calculator, least to greatest calculator, ti calculator downloads imaginary numbers, algebra software, Saxon Math Homework Answers, Rudin Chapter 4 Solutions, method
of characteristics for first order partial differential equations.
Equation for gcd, pictograph worksheets, find vertex of quadratic function with TI 89 titanium.
Gcse algebraic fractions worksheets, free biology lessons for grade 11, TI-83 plus calculator solving system of equations.
Rational expression solver, algebra ii worksheets free, simplify radicals calc.
Equations, cheats in phoenix on ti 83, Mcdougal little algebra2 chapter 7 work sheet, kumon work sheets, Eigenvalue calculation for Graph java code, linear equation mixture problems with pure solvent
with 1 variable, statistics o level past papers ebook.
Mcdougal littel modern world history online text book, symmetry worksheet hard, math area and volume worksheets.
Logarithmic equation solver, algebraic expressions ks3 questions and answers, how do you divide, matlab literal cubic equations, merrill physics principles and problems answer key, t183 scientific
How to solve decimal fractions and calculator, adding and subtrracting integers worksheets, First order differential equations Laplace, Maths sheets to do with multiply,adding and subtracting with
fractions, negitive Fractions Calculator, Rational Expressions, equations, and exponents, PRE ALGEBRA WORKSHEETS free.
Solved paper of c lanuage in o level exam, rational exponents and radical expressions solutions, ks3 yr 8 maths test, 3rd grade trigonometry problem.
Adding and subtracting integers game, how to write a word problem for circumference of a circle, free sat tests printouts, algebra for idoits.
Algebraic formulas, What Is the Difference between Evaluation and Simplification of an Expression, generator power circlechart, gre math formulas.
Stats, plato pathways cheat, combinations permutations advanced practice, California Algebra 1 worksheet, printable 10 key calculator practice sheet, MATH POEMS.
Basic english and math test online, use of bc calculator to find greatest of three numbers, multi-step equations worksheet, costaccounting notes download, how to solve differential equations on ti
89, expression solver, absolute value formula square root.
Reduction of order differential equations y'', combining like terms handouts, GCD Calculation.
MEASUREMENT WORKSHEETS-FREE, simple interest problems + free worksheets, quadratic equations solver with variable a, algebra: converting measurements presentation, math problem solver.
Solve ode maple multivariable, free maths school models, math worksheet activities for writing functions, prentice hall chemistry workbook answers, problem solving in equation of motions.
Rational expressions calculator, hardest math problim, gmat formula sheet, english aptitude, cube worksheets.
Multiplying algebraic expressions work sheets, least common multiple word problems, square meters to lineal meters calculator, algebra trivia, Algebra: what is the square of 13?, square roots
simplifying, Write and evaluate expressions worksheets.
Free Symmetry worksheets, dividing fractions with exponents, solution of chapter 1 by walter rudin, intermediate math cheat sheet, dividing fractions worksheet 6th grade.
Free Printable Pre Algebra Worksheets, quadratic sequences cheats, dividing a polynominal by a binominal, change radical into exponential expression calculator.
Solving a quadratic with a TI-83, how to convert vertex form to standard form, difference quotient solver.
Quadratic passing through points calculator, how to change fraction into decimal on ti86 calculator, solved example of permutation and combination, second order nonhomogeneous equations.
Linear equations+powerpoint presentations, Trigonometry Solver ti84, solve by using the substitution method calculator.
Free download of schaums solved problems series in eletricity, lesson plans on teaching matrices in math, algebra elimination calculator, How to get a cubed root on a TI-83 plus calculator, online
graphic calculator, y= x 3(1-X), factoring calculator.
Scale model math practice problems, mixed fraction to decimal, intitle: "index.of" pdf algebra lineal, associative property worksheets, adding and subtracting ordered pairs, how to right a quadratic
formula in standard form, linear first order equations calculator.
Algebra tutorial software, finding slope on a calculator, finding slope on ti-83, convert pdf to ti-89, learning elementary algebra online, dividing decimals worksheets.
Convert decimal to a mixed number, factor equation calculator, ti-89 convert, multiply and divide rational expressions, converting between bases ti 89, Do fractions help algebraic thinking, complex
numbers worksheet.
Precalculus program answer solver, higher root mean square indicates, adding, subtracting, dividing and multiplying negative integers worksheets.
Least common denominator online activity, extracting the square root, ti 83 rom code.
Linear equation practice 9th grade, non linear differential equations, algebra simplify integer exponents and multiple choice, simplify expression calculator, square root simplifying calculator,
Decimal equal to square feet, free online answer key to glencoe pre algebra workbooks.
How to write velocity formulas on TI 83, add, subtract, multiply and divide fractions worksheet, subtracting integers game.
Math homework answers, formula divisor, factoring with 3 variables, glencoe/mcgraw hill algebra 1 answers, dividing exponents problems solver, complete the square ti-89.
Iowa algebra aptitude test sample questions, topics for primary fifth degree english lesson plans, solving two-step word problems worksheets.
2. orden differential ti-89, free ti 84 physical chemistry downloads, "2nd order differential equations" AND "numerical method", additional practice and skills workbook answers, square root of "two
Common factor method with algebra, free download online aptitude test question and answer, my answer parentheses mathcad imaginary, how to solve quadratic equations by grouping., worksheet on
number-relation word problems.
Slope intercept two points worksheets, games that have functions with positive and negative numbers, Glencoe/McGraw-Hill systems of equations answers, ninth grade worksheets, mcdougal littell answer
key for algebra 1 practice workbook, worksheets on slope.
Free printable christmas activities for 9th grade Algebra students, Glencoe/McGraw systems of equations anwsers, How Do You Find the Scale Factor of a Figure, Vertex calculator, online calculator
that multiplies square roots.
Algebrator, t189 scientific calculator, 3rd root to fraction.
View pdf on ti-89, gre test for dummies free download, factoring a polynomial with two variables, aptitude test paper download, "rule of signs" "inequalities" "system of equations", 2nd order ode in
Banking apptitude questions and answer, how to solve nonlinear simultaneous equations in excel, powerpoint +graphing systems of equations, algebra plain english, math combinations calculator, BINARY
FRACTION CALCULATOR, math tutorial free special products factoring.
Cubed polynomials, calculating cube root fraction, maple solve symbolic equations, convert mixed fractions to decimals, free online math games for 9th grade.
Explain the relationship between changes in dimensions and perimeter of the base of rectangular solids. use ratios in your explanation, Online Factoring, quadratic functions for ti-83 plus.
Fractional exponents simplify, pre algebra for dummies, convert each decimal measurement to mixed number, decimal length mixed number length, adding and subtracting negative number worksheets, square
rti-83 plus arcsin, gcse test papers for maths do papers online for free.
Free algebra solver download, advanced math exercices, online Holt Mathematics Course 3 for free, how to subtract and add percent, TI-89 cramer's rule polar, solve the nonlinear inequality. write the
solution set in interval notation and graph, how to solve systems of equations ti 83.
Calculation the gain of a first order system, how to simplify a square root, free online aptitude test basic study material.
Help solving a 2nd order ODE, substitution method algebra calculator, division of complex numbers cramer's, divisibility worksheets free, algebraic expressions worksheets fifth grade, dividing
radical calculator, 8th grade printable reflection math problems.
Difference of squares root, factoring a 2nd order quadratic general formula, solving linear system calcuator graph, solving Applied Algebra Problems, simple logarithm questions worksheet pdf.
Hyperbola online calculations, GRAPHIC METHOD OF SOLVING A SYSTEM OF LINEAR EQUATIONS, positive and negatives fraction calculator, Vti 2.5 rom ti89 download, Elementary and Intermediate Algebra
answer key Mark Dugopolski online, fraction free grade 4 doc worksheets, adding, multiplying, subtraction, dividing fractions.
Online rational expression equation calculator, difference of square, rudin solution manual, simplify equation radicals, binomial factoring calculator, ebook maker ti-89, solving logarithmic
functions with two variables.
Factor trinomials online, calculas book, simultaneous nonlinear differential equation in matlab, Cost accounting final exam.
Difficult math trivias, mcdougal littell geometry answers, how to convert a mixed number to a decimal, mathmatics algebra.
Factor program for TI-84 Plus calculator, discriminate problems algebra, free online calculator for finding the exact value of -105 degrees in radical form, root solver.
How do i do absolute value on the graphing calculator?, nonlinear equation matlab, Orleans/Hanna Algebra Placement Exam, free algebra 2 answers, a mix number.
Ti83 x root key, free cost accounting book, Who Invented Synthetic Division, Prentice Hall Textbook answers, free 11+ maths.
Matlab ode45 system of equations, software for solving applied problems, use ti-89 calculator online for free, multiply divide add subtract, simplifying equations with variables, implicit
differentiation solver.
Graphing Linear Equations ppt, common denominator calculator, free math book solutions, mcdougall littell conversion charts, solution to nonlinear differential equation in matlab, course of partial
differential equations ppt, Algebra 1 TX.
Pictures on graphing calculators, using special products solver, roots and exponentials, solve algebraic problems, how do i solve linear equation with 2 variables.
Trigonometry trivias, HOW TO SOLVE SQUARE ROOT PROBLEMS IN ti 84 CALCULATOR, problem solving solutions for 4th graders work sheets.
Modern Chemistry Chapter Tests with Answer Key, circle graph free printable outline, ti-89 programs laplace transforms, elementary math trivia, factor equation, why the sum of the first n numbers
shouldn't be programed.
Javascript Aptitude Objective Questions, Solving Rational Expressions Calculator, equation to calculate square foot.
Free worksheets on transformations, PRINTABL MATH TEST with test, fractions with roots, Mcdougal littell math 6th grade math workbook, exercise word problems of algebraic espression fifth grade.
Sol algebra 1 test practis, college algebra formulas log, Free Printable Algebra Worksheets Quadratic functions graphing.
COMPLETE lesson plan expanding brackets AND FLASH CARDS, Math Trivia Answer, free ratio worksheets, college hard math problems, polynomial solving methods + free c source code.
Mastering physics answer key, test questions on simplifying rational algebraic expression, Stem leaf plotting free printable Worksheets, CLEP SUCCESS 9TH EDITION PDF, dividing square root fractions,
simplifying square roots with exponents.
Give me the answers to Algebra 2, third grade work papers, adding, subtracting, multiplying and dividing integers.
Algebra: Structure and Method, Book 1 practice, method of completing the square, way to learn matlab+ free download, nonlinear first order differential equation, green glob cheats, adding and
subtracting fractions worksheet, algebraic expressions lesson plan.
Complex rational equation calculator, factoring cubed equations, multiplying decimals 5th grade printable, Basic Multiplication and Dividing Integers, how to use algebrator, multi equation solver.
Simplifying algebraic expressions CALCULATOR, adding integers worksheet, software solve simultaneous equations.
How to use a ti 83 calculator to solve exponential functions, large complex polynomial equation, quadratic formulas square root property, +"ti-89" +"find inverse", free printable graphing paper for
liner Equations.
Online fraction square root calculator, Aptitude Problems and Solutions on Cubes, how to solve cubic equation on ti-83, holt algebra 1 teacher edition worksheets, boolean equation generator, 6th Form
Algebra Questions, formula for finding the square root.
'Linear Equations' aptitude question, algebra: expressions third grade, workbook alg pdf, Cost accounting + ppt.
Evaluating the nth root worksheets, answer problems for intermediate algebra, use graphes to solve equations, antiderivative calculator online graph, square root rewrite in simplified radical form,
taylor polinom solved exercises economics, texas state exam 6 grade math question.
Christmas word sheets plus answer sheet "Math Worksheets", algebraic calculator evaluate, vertex formula solve for, algebra equation calulator, permutation and comonations solved question, adding
subtracting multiplying dividing decimals worksheet, what does sin, cos, and tan means on a ti-83 calculator.
Math games for 11th graders, algebra 1/8th math taks, solve roots of third order equations, worksheets on adding decimals, who invented algebra, Free printable multiplying and dividing negative and
positive integers worksheet, free ebooks download accounting.
Prentice hall mathematics geometry workbook answers, solve a nonhomogeneous differential, really hard algebra puzzle, COMMON DENOMINATOR CALCULATOR FRACTIONS.
Least common factor conversion, north carolina 6th grade free print outs, free worksheet on positive and negative integers all operations.
Variable exponents with unlike bases, solve eguation with matlab, algebra 1 help graphing linear equations and functions, fastest way to learn algebra, aptitude test sample free download.
Synthetic division problem solver online, printable science exam ks3, maths free grade 10 model papers, Algebrator, laplace transform tutorial, step, matric calculator, Free Algebra Equation Solver.
Algebra books for beginners, solving second nonlinear differential equations, algebra for sixth grade, simplifying fractions square root exponents, simplify function x squared, circle trigonomy,
college math help programs.
Simplifying under cube roots with variables, graphing equations ppt, prentice hall mathematics algebra 1, converting mixed numbers to decimals.
How to use log with a different base on ti 89, Adding, Subtracting, Multiplying and Dividing Decimals and Percents, examples of graphing word problems using systems of equations, quantitive aptitude
books +free down load+ pdf.
Online calculator that will work any problem, mathematics+trivia, storing formulas ti-84, woman mathmatical equation.
How do i multiply fractional indexes, Simplifying expressions calculator, games on factorization of algebraic expression, Aptitude questions for solving.
Simplifying Rational Expressions Step by Step, math test sheet, problems for combining like terms, calculo ratio basica.
Algebra 1a workbook pages, free download aptitude books, fourth grade fractions worksheets, how to convert fraction to decimal in java.
Java aptitude questions, basic accounting math quiz, C# coding to solve the Tringle & squre program, Operations on addition and subtraction of rational algebraic expressions.
Fraction caculators, ti 89 emulator with key log, printable coordinate plane algebra 1, download trig calculator, solve linear equation in excel, ti-86 binomial coefficient program.
High School word problems parabola, how to do quadric and linear Functions grade 12, land, "casio fx 92" permutations combinations, How to input equations using Fractional Exponents on a graphing
calculator?, free 7th grade function worksheets.
Pre-algebra with pizzazz pg 170, Rational expressions and equations calculator, matlab codes 2nd orders, substitution method calculator, graph log base 3 ti-84, free online calculator that solves
3 order polynomial, solving systems of equations with fractions, skills practice workbook answers, adding integers using ti89, determining the remainder division worksheet, free aptitude questions
and answers.
Chapter 7 language of chemistry worksheet answers, calculator ti 38 online, multiplying and dividing fraction powerpoint games, free software to solve equations symbolically.
Asymptotes for absolute value equations, cost accounting books, trinomial factoring cubed.
8th grade math free printable worksheets, worksheets for logical reasoning, third degree algebraic equations, how to solve radical fraction equations, MAth Investigatory Problems, solve third order
polynomial, 9th grade algebra 1 notes.
Rewrite addition problem as multiplication worksheet, combining like expressions algebraic expressions worksheet, G-MAT APTITUDE QUESTIONS, algebra 2 online calculator, ti 83 graphing calculator
online, linear programming table calculations using fractions, free printable aptitude test for fourth grade math and english.
Lcm algebra solutions online for free, online calculator that solves complex fractions, algebra sums sixth standard tamilnadu, online matrix homogeneous calculator, free accounting books download, 3
grade work sheets about the water.
Pdf of operation research, accounting textbook answers, symmetry worksheets for 6th grade, simplifying squares into radicals, ti 84 plus, ti 89 multiplying Rational Expressions, exponents and square
roots, algebra in real life situations.
Worksheet to plot ordered pair pictures, ti 89 titanium base converter, chapter 6 and algebra ti 83 programs.
Solving nonlinear differential equation y'(x) = y(x)^2, grade 12 trigonometry test exams, aptitude model test paper, worksheet on solving linear equations for the variable, free adding decimals,
TI-83 plus how to calculate slope.
Cube of a binomial formula algebra, factor tree worksheets, Easy solutions to understanding Algebra for free, solving by finding square roots calculator.
Adding, Subtracting, Multiplying, And Dividing Decimals And Percent, algebra 2 answers, solve quadratic equation third power calculator, free exercise for percentage arithmetic of 8th standard.
Order of operations adding subtracting and multiplying, square root online, hints to finding the greatest common factor.
Free GCSE Maths and English paper work, conceptual physics workbook, college algebra calculator, solve for y graphing calculator online, solving radicals online calculator, field go and tic tac toe
ALgebra 2, how to do fractions on a ti-83.
Algebra formula, square root of 18 radical, +simplifing square roots, teaher edition's for glencoe pre-algebra book (2007), worksheet for aptitude bar graphs with provided tables, algebra worksheet
statistics, middle school math with pizzazz book e answers.
Cross product on ti-84, calculator for the least common fraction, glencoe algebra 2 answers, maple solve multivariable equation for one variable, algebraic expression printable worksheet, RATIONAL
EXPRESSIONS math calculator.
Add/subtracting fraction games, nth root on ti-83, second order nonhomogeneous differential equation, how to add students to math quiz show by scott foresman, square root with fraction drill, free
algebra puzzles, differences of square.
Permutation Combination Problems Practice, TI-84 programs download, pizzazzi book d with answers online, graphs of common functions algebra sheet, Square root graphing problem solving, solving
trinomials, iowa,algebra,test sample.
How to cheat online algbra, 2nd order differential equation to system, sum integer java, continued fractions quadratic equations powerpoint, download aptitude Question and answer.
Free factoring polynomials calculator algebra, gre permutations practice problems online, math worksheet on area,perimeter,volume,surface area.
Bello font download, simplify square roots with exponents, square roots and exponents, integrated algebra 9th grade practice math test.
Prentice hall mathematics answers, intermediate mathtrivia, nonlinear second-order equation, prentice hall mathematics+answers.
Solve by the substitution method (calculator), online free science test for year 6, college math cheat sheet, math poems, directions third root, finding slope using algebra.
Calculate remainder bitwise c++, lecture notes 9th grade geometry proportions and similarities, similarity triangles worksheets, solving simultaneous equations with three unknowns.
Algebra 2 math homework help free, balancing chemical equations online, interpolating with ti-89, simlification of radicals worksheet, why you cannot square a sum by simply squaring each term of the
Radical expression fraction, graphing calculator solve for x, creative publications algebra pg 210, algebra with pizzazz worksheet #150, multiply rational expressions java.
Simple algebra questions, pdf to TI-89, solve the equation extracting the square root.
How to simplify third degree functions, RULE FOR ADDING SUBTRACTING DIVIDING AND MULTIPLYING POSITIVE AND NEGATIVE NUMBERS, www.softmath.com, A Text Book that can work out Algebra problems.
Ninth grade Algebra, solving equations with 2 variables worksheets, variables and equations worksheets, multiply trinomial by imaginary.
Quiz on sums on factorisation method of class 7, math worksheet on slopes, free printable, algebra perfect fifth factor, quadratic equation solver when roots are known.
Gmat previous years sample papaers, algebra I slope from graph~free worksheets, mathematics for dummies.
Coordinate plane printouts, sample problems using natural logs, computeractive, cubed radical equation calculator.
Order the fractions from least to greatest, Glencoe Algebra Concepts and Applications Teachers Addition, algerbra problem solver, free math problem solver for adding and subtracting rational
expressions, algabra answers, matlab solve quadratic equation function, free online calculator for solving rational expressions.
Free 6th grade print outs, holt and learning algebra 2 book no key code, how to solve for a cubed variable, convert binary ti-89 domain error.
Google users came to this page yesterday by using these keywords :
• algebra 2 online tutor
• excel quadratic formula
• algebra worksheets for fourth graders
• how to solve quadratic equation solver tricks
• practice GRE combination
• quadratic transformations
• free math sheets for 3rd graders
• compound interest worksheet for 8th graders
• Multiplying and Dividing Monomials Worksheet
• exercice Boolean Algebra ppt
• pre algebra formulas
• convert mixed number
• smallest root for equations calculator
• trig calculator
• algebra 1 word problem solvers
• is the algebrator for macs
• cross product in pre algebra
• solving highest common factor
• cubed root on TI-83 calculator
• Multiplying Dividing Exponents Worksheets
• software equation coefficients
• fractions adding and subtracting worksheets
• percentagespractice
• solving linear systems activities
• algebra 1 math answer
• exponential multiplication worksheet
• MCQ Statistical Methods
• first grade math printable sheets
• Determining the Equation of a Line Algebraically Graphing from Standard Form
• buy third grade erb cpt/4 test
• math +trivias
• solve nonlinear differential equation in matlab
• prentice hall algebra I florida, practice on line
• java feet ti meter
• clep math workbook
• aptitude question+ANSWERS
• domain and range for absolute values, radicals and rationals
• simulating differential equations using matlab
• online rational denominator calculator
• worksheet on adding integers
• online scientific simultaneous equations calculator
• college math software
• how to solve equation maple with multiple variable
• vertex form
• simple programing for calculators
• fractions opposite
• suctract integers worksheet
• solution problem of "hungerford algebra"
• intermediate algebra test
• cubed root algebra
• "free copies of Prentice Hall Algebra I tests"
• elementary algebra worksheets
• Calculate GCD
• college elementary algebra problems
• linear and nonlinear forms equations matlab m files
• on line equation solver
• exponents worksheet rules practice problems
• non linear programming-maths
• glencoe answer keys to pre alg work books
• java divisible program
• square root simplify calculator
• simplifying radicals+cube roots
• free rational expressions solver
• trig identities solver
• simplify radical expressions dividing calculator
• answers for math homework
• solve limits online
• solve second-order differential equations table
• free graphing slope calculator
• math poem
• Maclaurin series; chart of estimates and % error
• kumon math worksheets
• pacemaker economics third edition answer key
• math cheats
• algebra rules solving for exponents
• math worksheet ratio probability
• calculate convolution ti 89
• vertex of a parabola
• Algebrator Soft Math LANGUAGE
• chi odd test, java
• converting mixed fractions to percentage
• "linear-quadratic model" AND excel AND calculation
• simplify radical programs
• online algebra helpers
• algebra 1 chapter 3 resource book answers
• cross words english worksheet beginner
• free math practice sheets for 6th and 7th grade
• least common denominator calculator
• matlab solve differential equation for coefficient
• how to teach someone to factor in math
• download ti-89 titanium .rom .bin .dmp
• pre-algebra cheats using intercepts
• modeling with polynomial functions word problems worksheets
• Math Problem Solver
• WHAT IS ALGEBRAIC STRUCTOR 6TH GRADE
• quadratic function interactive resources
• linear programming algebric
• multiplying or dividing 2 integers with different sign
• Algebra Problem Checker
• matlab solve
• sample math investigatory problems
• how to solve third degree polynomial equqtion
• simplify by factoring out 1
• algebra fractions calculator
• logarithm problem solver
• ratio formula
• FREE MATHS for yr 11
• calculate linear feet
• subtracting square roots algebra
• simplify radical fractions calculator
• laws of exponents +printable practice +free
• two step programs (fifth grade math) texas
• free cost accounting books
• Solving Exponential Equations online calculator
• help with multiply radical expressions
• "simple math test" pdf
• solving equations algebra fraction
• find x and y intercept on calculator
• +multipy fractions
• coordinate pairs worksheets for elementary students
• 5th grade math trivia
• radical form of the square root of 8
• Online Factoring Calculator
• factoring quadratic equations calculator
• free aptitude ebooks
• solving problems with addition and subtraction of fractions
• TI-84 college algebra
• F.O.I.L method online calculator
• Simplify square root
• simplify calculator exponential
• english aptitude questions
• Scale Factor
• multiplying absolute value equations
• 2nd order difference equation matlab
• great common divider
• functions quadratic square root absolute value cubed
• intermediate algebra practice worksheets
• math game solving algebraic equations
• diophantine Equations for high school worksheet
• free online algebra percentage calculator
• apptitude problems solutions
• ti 84 physics free download
• factor program for graphing calculator
• e book cost accounting
• factor polynomial machine
• mcdougal littell algebra 1 practice workbook answers
• Graphing Calculator Quadratic formula program
• sample math investigatory project
• ti-89 parabola vertex
• dividing mixed numbers powerpoint lesson
• online ti86 calculator
• easy way to learn how to balance chemical equations
• solve nonlinear differential equation
• questions of area and perimeter of maths of 5th class
• free worksheet on changing to logarithmic to exponential form
• prentice-hall pre algebra chapter 7
• algebra what is a fu
• explanation of graphing systems of equations
• glencoe algebra 1 answers
• index
• casio solve system equations
• simplifying exponents worksheet
• 7th grade algebra worksheet
• finding slope and y intercept ti-83
• samplepapers of 12th stateboard,tn
• software AND "linear-quadratic model" AND download AND excel
• how to cube root on calculator
• roots of a third order equations
• square roots fractions
• "Test+in+Real+Numbers"
• heaviside ti 89
• a aptitude questions
• free printable equation
• graphing coordinate pairs + videos
• Class VIII sample papers
• free writing worksheets 9th grade
• free pre-algebra answer cheats in 8th grade
• algebra age problem formulas
• iia aptitude model questions
• prealgebra and geometry for dummies?
• algebra with pizzazz creative publications
• simplify square root of 745
• free answers to math problems
• modern introductory analysis mary dolciani
• what does nonlinear second-order equation mean?
• mcdougal littell biology answers
• First Grade homework help
• texas graphing calculator online
• measurement ks2 worksheets
• math practice for ninth grade
• 3 root 1 simplify calculator
• free ged test papers
• quadratic equation + slope
• elimination equation calculator
• college algebra tutor software
• calculate 4th root
• fun maths games free printouts
• ks2 algebra practice questions
• multiplying and dividing scientific notation worksheet
• online algebra 2 tutor
• finding the slope of two points using a TI-84
• how do you solve square root problems in a tI84 calculator?
• adding fractional exponents fractions
• rational expression calculator
• calculas
• factor analysis output in spss
• convert mixed fraction to decimal
• print math sheets grade 11
• simplifying algebra square roots
• adding and subtracting integers, free worksheets
• how to do algebra. com
• online hyperbola calculator
• solving quadratic equations by the square root method, activities
• Online Calculator capable of exponents
• finding the slope of a graph with ti 89
• simplify exponet fraction
• indiana algerbra 1
• problem solving (polynomials) holt algebra 2 Rinehart and Winston
• pythagorean theorem algebra 1 word problem solvers
• a real life problem for the linear equation 3x-2=5
• where can i get the answers for the algebra 1
• how to calculate college algebra equations
• Simplifing Radicals Worksheeets
• solution of a quadratic equation by extracting Square roots
• math fraction equation
• simplify cube roots
• solve a system second order differential equations
• nonlinear systems of equations solver, including those with non real complex numbers
• free reading homework printouts
• glencoe math answer key
• convert decimal to mixed number length
• find the square root of a decimal
• FREE trigonometry answers
• holt algebra 1 answers
• permutation and combination + Stirling's formula
• exponential values in the ti-83
• subtracting two digit numbers worksheets
• fun distributive property worksheet
• science algebra equations for begginers
• vector algebra problems with solution
• What is the difference between exponential and radical forms of an expression?
• systems of nonlinear equations worksheet
• easy algebra
• easy explanation for combing like terms
• free math papers 5 grade
• proportion worksheets
• ged math 2 step equations
• linear equation with one variable mixture problems
• clep practice algebra exam
• solving quadriatic equation using matrices
• least common multiple 6th grade worksheet 3 digits
• discriminant quadratic multiple choice
• quadtratic equations basic
• practice sheets simplify algebraic expressions
• free 4th grade tutorials online
• maths yr 8 test papers
• word problems worksheets
• subtract radical calculator
• online text prentice hall algebra 1
• fractions formula
• steps in solving quadratic equation by extracting the square root
• aptitude questions with solutions
• how to simplify 1/ square root of 3
• revision sheet for math- fractions for grade 6
• algebra year 7 first lesson
• algebra 3rd grade
• online rational expression calculator
• pre-calc final exam worksheet
• problem solving in quadratic equation
• computer caculator
• worksheets for ordering and comparing integers
• Printable Maths Exam Papers
• cost accounting tutorials
• download free cost accountancy book
• cube root calculation factorization
• ALGEBERA SUBTITION
• least common denominator examples
• Algebra 2 Problems
• exponents in everyday life
• example equations with 2 forms linear nonlinear
• algebra problem
• investigatory project in math
• how to do algebra
• matlab solving equations
• algebra answers calculator
• aptitude english
• limit calculator square root
• how do you do square root in objective c
• algebra/linearcombination
• java solution polynomial function
• algebraic expressions - least common multiple - calc
• reducing fractions, algebra
• pre-algebra/scaling and comparing
• pre-algebra equations worksheets
• aptitude test question and answer
• free 7th grade math number sequences
• instructions adding, subtracting, multiplying, dividing + decimals
• adding and subtracting negative and positive numbers
• Complex Rational Equation calculator
• rest skillstutor algebra
• holt california algebra 1
• Math Trivia
• how to use a cubed root on a calculator
• slope intercept form calculator
• analysis rudin chapter 7 #7 solution
• business statistics + solved question papers
• solving algebraic equations on the Ti-84 plus
• ti roms
• ks3 maths test
• what is important of mathematics at the matric level in india
• simplifying cube roots
• holt algebra website
• dividing decimals worksheets free
• base number adding calculator
• Noble Gases in chemical equations
• quadratics calculator
• latest math trivia with answers
• vertex equation
• pizazz workbooks
• algebra 1 exploration and applications practice 7
• mixed number and decimals
• dividing radicals online calculator
• convert square roots
• whats is a unit in 6 grade pre-algebra math
• mixed fractions in area problems
• cube root calculator
• holt mathematics algebra 1 book
• polynomial worksheets
• Free Adding and Subtracting Radical Expressions calculator
• mcdougal littell math 2 9th grade geometry unit 6 test
• science 6th grade test papers
• prealgibra made easy
• simplify fraction exponents calculator
• simplifying expressions worksheet
• ti-83 , calculator , solving physics problems
• Free Rational Expressions Online Calculator
• printable solving equations exam
• how to convert mixed fractions to decimals
• integers using ti89
• advanca algebra worksheets
• math HOMEWORK ANSWERS
• solve by taking square roots calculator
• number variable product of a number and one or more variables raised to whole number powers
• prenhall practise exams
• math equation scale
• step by step on how to use a graphing calculator
• maths for dummies
• relationship between quadratic formula and factoring
• CALCULATOR THAT SOLVES ALGEBRA FOR FREE
• simplify fraction radical calculator
• use ti 84 graph to find y value
• aptitude questions for metadesign solutions
• power equations graph
• distributive property worksheets 4th and 5th grade
• convert into fractions
• two radical calculator
• evaluating radical expressions
• math matrix problems samples
• Free guides on basic calculas
• rearranging equations signs
• factoring patterns and video and math and free
• convert mixed fractions to percents
• Solve equations +matlab
• MULTIPAL FREE ALL ROOMS DOWNLOAD
• printable test papers for year 3
• Holt Seventh grade Math worksheets
• ti Calculator roms
• using maple to solve linear systems differential equations
• trinomials calculator online
• finding the common denominator
• least common denominator of 14 and 12
• how to solve 5 cube root three fourths
• solving 2nd degree inequalities line method
• pre-algebra college formula sheet
• "pre-algebra worksheets" substitution
• solution to nonhomogeneous first order linear equation
• basic algerbra
• Enter Math Problems For Answers
• solving equation cubed
• calculator for completeing the suare
• online game for mult and dividing monomials
• 9th grade math quiz
• a list of 9th grade algebraic problems cheat sheet
• divisor formula
• partial sums addition method worksheets
• Video lectures of GRE General Maths
• quadratic formula calculator program
• math statement solver
• Multiply, divide, add, subtract - integers, decimals, fractions
• solving linear equations combine like terms worksheet
• Multiply and then simplify the following expression:
• quadratic equation converter
• algebra 2 free homework solvers
• introductory algebra tutorial free
• divide and simplify to the form a+bi
• Search answers on the algebra 1 teachers adition book
• algebra substitution method calculator
• matlab solve simultaneous equations
• polynomial equation question and answer
• online calculator implicit differentiation
• graphing calculator emulator TI-84
• fraction games for 7th graders
• java guess number would you like to play again
• writing equation in a vertex form
• Free 7 grade game worksheets and answers
• english aptitude questions and answers
• Fraction worksheets
• mathematics sums for 9th grade
• holt algebra 2 workbook
• learning algebra online for free
• differential equations worksheets
• variable as an exponent solutions
• WHAT IS THE NUMBER 29 DIVISIBLE BYEXAMPEL
• algebra changing the subject worksheet
• free online quiz about volume in math
• Solving second order initial-value problem"
• 8% decimal
• interactive activities for multiplying and dividing whole numbers
• how does the variation of the chemical composition of salt affect the rate of salt affect the rate of electrolysis in water
• maths printables ks2
• TI 85 log base 2
• algebraic reasoning worksheets
• multiply fractions 5th grade
• "Texas Instrument 84"+demo
• rational expressions solver
• math worksheets algebra slope
• Ti 83 plus formulas
• Factoring in algebra
• help me solve logarithms using square roots
• biology: the dynamics of life glencoe/ mcgraw-hill eoc test
• What is the difference between evaluation and simplification of an expression
• college math problems
• ks3 maths online tests
• advance accounting book free of cost
• fourth root of 63 find
• clerkial Apitude question paper for bank
• radical expressions calculator
• divide decimals worksheets
• free subtraction worksheets with difference of 8, 9 or 10
• solving
• math investigatory projects
• free radical simplifier
• algebra percentage equation
• decimal time
• simplify equation
• free work sheets for grade 6 coordinate system
• addition and subtraction of mixed fractions worksheets
• poems Simplifying fractions
• find a permutation with TI-84 plus
• list of radicals and decimals
• math books online use prentice hall algebra 1
• solving quadratic by square roots
• root equations
• mixture of grade maths up to grade 10
• algebra fractions addtion method
• points of intersection worksheet
• Rational Expressions Online Calculator
• Ks3 Algebra worksheet
• free boolean algebra calculator
• Min. and Max. problem in quadratic equation
• factoring cube practice
• download aptitude pdf
• solved aptitude papers
• holt physics revision paper
• adding and subtracting intergers
• Finding Scale Factor
• Rational Expression Calculator
• 5th grade exponent worksheet
• Algebra for Athletes
• find polynomial roots on TI-83 Plus
• ALGEBRAIC STRUCTURE 7TH GRADE ON LINE
• how do you know if you can add or subtract any given radical expressions?
• scale math lessons
• algebra 1 study guides prentice hall mathmatics
• ti 89 review for solving algebra 2 problems
• "gmat""best math""download""free"
• combination in maths
• free online algebra 2 tutor
• Trigonometry word problems ks3
• 2nd grade printable test and quizes on money
• pre-algebra slope activities
• powerpoint presentations chapter 9 natural resources scott foresman
• type an algebra problem and computer will solve it
• fractional coefficients
• algerba games
• greatest math trivia
• 2nd order differential equations calculator
• second order differential equation solver matlab
• printable graphing ordered pairs worksheets
• elementary algebra by mark dugopolski powerpoint
• ti-86 convert to a fraction
• praticeing two step equations
• "negative binomial" ti 83
• balancing equations worksheets
• math problems and answers
• evaluation of an expression in algebra
• volume- 3d KS3 worksheet
• AJmain
• solving positive and negative integers
• aptitude questions of companies +pdf
• Algebra II answers
• free activity books downloads for 7th graders
• solving equations for multiplying and dividing fractions
• www.teachgrammer.edu
• yr 8 IT
• simplifying a cubed exponent
• ti-89 fluid mechanics
• cardano formülleri pdf
• solving simultaneous nonlinear equations matlab
• graphing linear equation poem
• converting mixed fractions to percentages
• t1-89 graphing calculator activity
• Math Help Scale Factors
• invented saxon math book
• math multiplied by worksheet
• KS3 algebra powerpoints
• how to converting mixed fractions to a decimal
• how to get a square root on a calculator
• graphing pictures by plotting points
• learn basic algebra
• ti-89 how to solve integrals dx
• fractional and quadratic equations
• help me solve linear equ
• multiple choice worksheet dividing decimals
• solving quadratic equations by factoring worksheets
• define and find real hyperbolas
• find suare root of a number
• algebraic fraction problem solver
• proof difference of two squares
• quadratic hyperbola
• roots third order polynomials
• adding subtracting dividing and multiplying decimals worksheet
• ti 84 program download
• WHAT IS ALGEBRAIC STRUCTOR 6TH GRADE ON LINE
• calculator ti-83 plus permutation
• how to factor square roots on a ti-84 plus graphing calculator
• perimeter worksheets for grade 7
• free download aptitude question
• how to factor a polynomial on ti-83 plus calculators
• worksheets for reflection and translation for kids
• denominator or recripocal rational equations
• solving second order differential equation in matlab
• simplifying radicals answers
• how to order two or more fractions
• nonlinear ode second order with matlab
• free mulit steps variable equations worksheets
• simplifiying square root expressions
• solve root evaluate axiom
• Free Radical Equation Solver
• easy way to learn logarithms
• "inverse ln" ti-89
• prentice hall end of course test preparation algebra 1 answer key
• function machine free printable
• an example of a word problem that can be solved by multiplying two numbers
• multiplying fractions with no simplifying worksheet
• lesson plans how to teach matrices to Algebra students
• forgotten algebra unit 2 make sense
• add,subtract,divide,multiply fractions free worksheet
• Mathimatic and Physic notations, signs and symbols
• flash equation solver
• area of circle worksheet numeracy
• ti-83 square root
• multiply square root calculator
• passing college statistics
• multiplying and dividing radical equations worksheets
• algebra solver
• simplifying exponents
• changing mixed numbers to decimals
• find lcd calculator
• find the rule of a parabola
• online aptitude questions & ans
• lattice math ppt
• solve non linear system matlab
• worksheet answers
• california homework help on math objectives
• "roots polynomial" 3rd degree on-line
• Middle School Math With Pizzazz
• differential equations 2nd order how to solve
• math tricks and trivia with answers
• homeschool free pre-algebra factor worksheet
• balance chemical equations useing matrix ti 83
• free work sheet for problem solving in division
• adding two radicals solver
• algebra worksheets, lessons games
• quadratic equation factorer for calculator
• cheat sheet for chapter 15 world history worksheet
• free linear equation worksheets
• TI-83 solving equations with three variables
• adding radicals with ti-89
• Glencoe Algebra 1 answers
• downloads for ti 84 plus
• factoring calculator quadratic
• helpful tips for algebra 2
• solving non-homogeneous second order differential equations
• finding lineal
• how to solve factorials on a ti
• scale factor mATH 6 GRADE
• maths sample papers for 6th standard
• Radical expressions solver
• multiplying and dividing integers, free worsheets
• resource book McDougal Littell American History
• basics of permutation and combination
• simplify expressions on ti 83+
• algebra calculator online free
• Intro & Intermediate Algebra CD only
• "recursive function" + visual basic + example + cube root
• solving for a specified variable
• help with algerba
• subtracting intergers game
• cube root on calculator
• excel solver simultaneous equations
• mathematica algebra practice sheet generator
• worksheets for solving one-step linear equations
• quadratic equation program on a graphing calculator
• Divisor, Dividend and Remainder Probelms
• graph a hyperbola calculator
• inequality equation matlab
• systems solver for TI-84+ with
• math formulas percentages
• algebra rate of change worksheet
• how to solve a quadratic equation "two variables" algebra help
• algebra situation diagrams
• 4 step method math 6th grade examples
• I need a calculator to do my homework (online calculator)
• is finite math as hard as college algebra
• cost accounting book
• multiplying and dividing equations
• convert decimals to fraction calculator
• conceptual physics homework help
• 3002428#post3002428
• Adding positive and negative fractions
• slope intercept test prntable
• what is the difference between evaluation and simplification of an equation
• college algebra software
• algebra 1 for dummies
• conjugate of cube root
• solve college algebra problems
• +courses equivilant to MA 105
• simplification calculator
• 6th Grade Algebraic Equation
• fraction tutorial worksheets
• Ratio Math Problem Worksheets
• trigonometry real life application word problems high school
• algerbra
• slope equation program for ti-83
• public domain+picture+scientific notation test example
• algebra applications answers
• algebra 2 worksheets
• easy ways to answer algebra
• holt pre-algebra texas edition hrw
• 0.416666667 is what in fraction
• rom image ti calculator
• how to pass an algebra final exam
• BASIC PROGRAM ONLINE TUTORIAL FOR A FIFTH GRADER
• Systems of Equations AND Worksheets
• Free online algerbra 2 text books
• TI-84 Plus Emulator
• apptitude questions on c language
• free rational expressions calculator
• math trivia with answers mathematics
• trigonomic equations
• how do you go from standard form to vertex form
• algebra and trigonometry structure and method book 2 teacher's edition
• online root radical calculator
• calculator for dividing trinomials
• how to solve second order nonlinear differential equations
• how to show decimal on ti-83
• exponents test printable
• free printable worksheets on adding and subtracting integers
• ti 84 plus emulator free download
• free math ratio worksheets
• Formula for adding unlike fractions
• online games for 9th grade
• how to solve equations
• how to calculate polar numbers in ti-89
• examples of algebra applications, connections and extensions in symmetry
• poems made of numbers
• best way to convert fraction to decimals
• 4th grade order of operations worksheets
• free prentice hall algebra 1 textbook answers
• thousands of barrons very advanced vocabulary multiple choice tests
• how to solve liner equasion
• holt oline geometry textbook
• factorise the difference between two square
• cheat ti 84
• glencoe pre-algebra resource answer key
• parabola basics
• worlds hardest calculus problem
• quadratic trivia
• adding positive and negative fractions worksheet
• Geometry for dummies online
• solving differential equations through the use of Matriices
• root in excel
• matlab explicit solving of equations for a variable
• slope and intercept solve
• balancing equation calculator
• LAPLACE A EXCEL FORMULA
• multiplying matricies
• poems about quadratic equations
• kumon question sheet examples
• printable math worksheets trig
• how to solve math expressions
• investigatory project
• algebra for 10 yr old
• free algebraic expressions worksheets
• plot quadratic inequation + Maple
• teach yourslef algerbra
• factoring trinomials calculator
• convert a mix fraction to a decimal
• Calculate Least Common Denominator
• adding and subtracting integers "worksheet"
• differential equations, non homogeneous, wronskian
• college algebra problem solver
• mean median mode revision ks3 level 6 quiz
• math dictionary for 9th graders
• ti 85 cheating how to
• ucsmp advanced algebra answers key
• "ACT math" TI 84 download
• teach me step by step how to do algebra functions
• solving literal equations with matlab
• mit mathmatical equation
• stats5
• standard form to vertex form
• 5 math Trivia:
• 3rd grade perimeter
• slope worksheet
• multiplication and division of rational expressions
• fraction adding subtracting and multiplying test
• 89 log base
• how to teach absolute values
• algebra help linear multiple parenthesis
• solving 2nd order differential equation
• decomposing fractions calculator ti 83
• Polynomial Solver
• solving one step equation worksheet
• trinomial calculator
• table of exponents
• simultaneous differential equations matlab
• how to pass college algebra
• converting mixed number to decimal
• alberta grade nine algebra tutorials on line
• online inequalities graphing calculator
• solving for k in quadratic equation
• learning algebra free
• complex numbers and roots solver
• college probability worksheet
• games for a powerpoint to do with coordinate plane
• slope formula excel
• apptitude questions in c language
• basic algebra questions
• easy example of multiplying radical expression with answer
• basic maths rules year 9
• free answers for homework
• quadratic factor calculator
• free printable science answer sheet
• Algebra Problem Solvers for Free
• the easy way to get algebra matrices solver
• pre-algebra free download answer cheats
• worksheet for aptitude bargraphs with provided tables
• how to solve an expression
• download houghton mifflin math grade 3 teacher edition
• find a combination with TI-84 plus
• math trivia with answers in algebra
• Simplify square roots (radicals) that have fractions with index
• factoring cubed polynomials
• formula sheet+7th grade +va+sol
• pre-algebra with pizzazz! ws
• algabra 2
• simplifying cubed roots
• trigonometry log problems
• free math exercise for 5th grade
• past year papers of o'level exam papers
• installing free algebrator of pre-algebra
• formula to convert decimals into fractions
• t1-84 plus silver edition calculator+exponents
• large print Algebra 2 book by glencoe
• evaluate expression worksheet
• logbase ti 89
• maths equasions
• ppts for teaching mathematics for kids
• ratio formulas percentage 6th grade
• trinomial solving system
• linear equation worksheets
• complex rational expression calculator
• java divisible by 3 sample programs
• radical and rational expressions
• factors equations
• ks3 maths test online
• maths gcse practice worksheet
• least common denominator worksheet
• trigonometric rational expressions
• online factorization
• dilation and scale factor fun activities
• download ti emulator
• c language aptitude questions
• pdf on ti 89.full.rar
• reducing rational expressions to lowest terms calculator
• ti-83 plus convert to engineering
• algebra 2 problem answers
• saxon algebra 1 practice answers
• introduction to permutation and combination
• under what circumstances would the GCF be equal to the numerator of a fraction before simplifying
• solve algebra 2 problems
• Algebra 2 fraction calculator
• free book physics
• solve equation using substitution method calculator
• examples of graphing word problems systems of equations
• exponential algebraic expressions
• formula forload factor
• helping seventh graders with algebra
• algebra
• how to cheat on a graphing calculator
• free 5th grade worksheets pattern, relationships, and algebraic thinking
• Algebra Poems
• free math sheets for 8th and 9th grade
• symmetry challenge sixth grade worksheet
• exponent trivia
• Aptitude Questions Answers
• factoring cubed binomials
• how to change decimal to fraction of ti-84 plus
• worksheet on scale factor
• ADDING,SUBTRACTING,MULTIPLY,DIVIDING decimals worksheet
• signed numbers worksheets
• rules for simplifying radical expressions
• solving a linear equation and a quadratic equation by substitution
• java divisible sample programs
• trig calculate free
• Free Balancing Chemical Equations
• what is the hardest math problem in the world?
• free printable adding and subtracting integers worksheets
• online calculator substitution method
• differential equation calculator
• multiply cube root
• Turning Fractions Into Percentages
• solving inequalities with TI-83 plus
• Permutations in multiple summations
• pearson algebra 2 answer book
• very hard multiplying and dividing integers
• algebra worksheets, free, linear equations, muliple steps
• answers to saxon algebra 1 math test 9a
• equation to convert decimal minutes to regular minutes
• T I 83 plus emulator
• software algebra
• Rational Expressions and Functions calculator
• free math problem answers
• matlab system quadratic equations
• factoring polynomial program on ti-83
• aptitude books +free down load+ pdf
• cost accounting ebook
• printable year 9 maths questions
• pdf ti-89
• base log standardize
• algebra problem solvers for free
• Simplifying Square Roots and Rationalizing Denominators worksheet
• Homework help software- algebra 1 available in australia
• roots of polynomials ti 83
• solve my algebra problem
• lesson plans on how to teach matrices to Algebra 1 students
• how do you work out what the Common Denominator
• formula of slope in excel
• Trinomial Calculator
• pre algebra simple interest
• Calculator and Rational Expressions
• convert binary base ti-89
• formula in solving the mean
• soulution set solver in algebra
• answers for lcm
• aptitude questions and answer materials pdfs
• relation of algebraic expression in life
• common high school algebra mistakes
• intermediate algebra lessons
• questions for integers test
• how to read decimal numbers in java
• "missing number" brain teasers progression
• solving logarithm calculator
• solving one step equations fun worksheet
• algebraic proof of a hyperbola
• polynomial solver excel
• ti calculator formulas slope
• lcm calculator with variables and powers
• TI 84 plus spiele downloaden
• scientific notation worksheet positive exponents
• java convert decimal to words
• divide polynomials calculator
• fractions system of equation
• saxon algebra 1 answers
• financial cost accounting book download
• lowest common denominator calculator
• how to solve nonlinear differential equation ,
• worksheets on common factors
• partial diffrential eqation+second order non homogenous
• lcd worksheets
• samples of college elementry algrebra
• symbolic methods
• 7th grade Prentice Hall math textbook
• pre algebra method
• How do you convert a quadratic function into vertex form
• completing the square lesson plan grade 11
• aptitude preparation free material
• divide polynomials on ti-83
• free online test papers
• websites for downloading accountancy books
• algerbra examples
• college algebra solver
• prealgebra third edition by alan s. tussy- ch. 3 test
• square
• ti 89 calculator divide intergers
• solving for roots of 3rd order equations
• solving polinomials equations
• quadratic equation cos function
• Simplify expression calculator
• teacher text to prentice hall algebra 2 with trigonometry
• story sums about multiplication for elementary2
• cheats for green glob game
• Grade 8 algerbra, question sheets
• a site for finding answer for 4th degree algebra question
• free maths worksheets algebra expanding brackets
• mathematic-Act the problem out, step by step.
• fraction worksheets for fourth grade
• FACTORing a cubed number
• online fraction and variable calculator
• Simultaneous equation solver C
• solving algebraic equations with unknown exponents
• simplification of roots
• lesson plan for solving algebraic fractions
• rationalize algebra fraction exponent
• how to solve laplace transforms
• lori barker bartlett high school
• "printable geometric nets"
• examples of hard algebra
• how to write a function in vertex form
• adding subtracting integers worksheet
• logarithms in TI-83
• mathematica tutor
• pre algebra practice equations
• printable homework for 7th grade
• solving ode matlab equation linear non- linear
• order numbers least to greatest
• Solving Quadratic Equations by Factoring calculator
• Translation and symmetry worksheets
• Algebra Testing For Ninth Grade
• simple word for 6th grader
• how to factor equations
• hard math equation
• Free Printable Algebra Worksheets graphing f(x)= ax
• solution problem of "hungerford algebra"+pdf
• how to store notes on ti 89
• Simplifying Radical Expressions
• calculas 2
• how to divide equations using ti-89 titanium
• congruent shapes 2nd and 3rd grade free worksheets
• Algebrator
• chapter 12 graphing parabolas answers
• scale factor problems free
• math equation poems
• simple worksheets that show how to convert decimals to fractions and fractions to decimals
• free math online programs
• Computer Apps Final 9th grade answer key
• problem solving in coversion of decimal to binary
• how to find the vertex of a linear equation
• do maths tests online for year 10
• Solving One Step Equation Worksheets
• pre algebra work sheet
• Rudin -- Chapter 7 -- solutions
• cube root of 4
• Middle School Math With Pizzazz answers from book D
• java summing numbers
• algebra tutor cd
• matlab+ nonlinear differential equation
• free online algebra 1 textbook prentice hall
• decimal to fraction formula
• solving third order equations
• simplify square expressions
• exponents under square roots
• grade 7 algebra problems
• application problems worksheet for sixth grade maths
• ordering decimals 5th grade printables
• how do I graph to get the mean, mode and medium on a TI83 Calculator
• factoring polynomials aids
• how to identify if a number is divisible by square number program
• "physical science EOCT""review notes"
• online limit calculator
• converting mixed fraction to decimal
• add and subtract fractions worksheets
• solving quadratic equations on TI-89
• math equations percentages
• simplifying variables that have exponents
• 5th grade worksheets(finding the LCDs)
• TI-83 Plus slope program
• download maths problems on matrices for 9th class
• finding least common denominator
• convert mixed numbers to percents
• adding, subtracting, multiplying, and dividing integers free worksheets
• curve fitting for generating equations for graphs using gnuplot
• TI-89 QUADRATIC EQUATION
• Aptitude test paper of different companies in software testing
• finding quotients and simplifing the radical
• bittinger elementary and intermediate algebra powerpoint slide
• polar equation calculator
• integration by algebraic substitution ppt
• investigatory in math
• free math helper algebra
• alegebra1 helper 8th grade
• free ks3 maths papers
• online graphing calculator with table
• free ged math printable worksheets
• permutation and combination
• careers that use polynomial division
• covert decimal to square root
• Who Invented Permutations and Combinations
• algebra 1 study guides by prentice hall mathematics
• essentials of investments 7th edition solution manual download
• multiplying and dividing integers worksheets
• convert decimal to fraction on TI-83
• printable practice sheets for cordinates
• solve cubed value
• square root in calculator
• factoring polynomials calculator
• practice sheets for algebra (elimination method)
• quadratic equation solver t83
• when simplifying a rational expression, why do you need to factor the numerator and the denomintor?
• regular math convert among decimal
• how to do sin on a graphing calculator
• download free e books on cost accountancy
• quiz over adding and subracting fractions
• math trivia with answers
• solving 3rd order equation
• absolute value of complex numbers solver
• java program to find sum of 1 to n numbers
• Quadratic formula excel
• simplify an equation using macros
• excell equasions variables solve
• solve (HP)equitions
• writing linear equations in standard form games
• software for solving algebra
• convert fraction to decimal
• quadratic simultaneous equation calculator
• is there a secret to factoring in algebra
• free math problem solver
• free symmetry worksheets
• maths formulas percentage
• program factor quadratic equations
• How to convert 4.3 to a mixed number
• online math tests hyperbolas
• simplifying cubed roots on a ti-84 calculator
• grade 8 maths exercises about exponents
• aptitude question puzzles with answer
• difference of squares quadratic equations
• mcdougal littell florida edition answer key
• cube roots of x on ti83
• multiplying division integers
• algebrator guide
• solving complex rational expressions
• solve homogeneous differential equation
• simplifying rational expression calculator
• glencoe/mcgraw-hill advanced mathematical concepts student worksheets
• trivia about quadratic equation
• decimal to mixed number
• runge kutta + matlab + demo + second order
• TI Calculator Test Prep Guide
• introductory algebra tutorial
• how to calculate linear equations on ti-83 calculator
• converting mixed numbers to decimal
• area math work sheets
• modern algebra made easy
• ordered pairs worksheet
• mathematics poems
• alegbra worksheets
• When graphing a linear inequality, how do you know if the inequality represents the area above the line?
• trial-and-error root finding bisection algorithm java programming
• math poems about triangles
• Hall algebra .pdf
• answers for algebra 1 problems prentice hall
• +graphing points +pictures
• Study notes for intermediate algebra
• Solve Quadratic Equations Using Matrices
• basic factor tree worksheet
• hov services sample paper of aptitude
• online least common denominator converter
• aptitude question & answers
• algebra 2 vertex form
• clep exam for intermediate algebra
• domain of a function solver
• factors of quadratic equation
• simplifying algebraic equations worksheet
• free printable worksheets on variable substitution
• Solve my algebra expression
• online equation solver
• simultaneous quadratic equations
• free fraction decimal percent worksheet
• Exponential Equations - free lecture note
• examples of algebraic problems
• free download permutation and combination pdf book
• solve system of equation with ti-83
• highest common factors of 39 and 87
• ti 84 plus calculator simulator online download
• Visual basic function for cube root recursive
• free printable SATmath Questions
• answers for McDougal Littell algebra 1 chapter 5 test B
• "Algebra 2 chapter 7"study guide
• Solve my trinomial
• programming the ti-84
• how to input equations using fractional exponents
• solving binomial equations
• java program to convert from one character
• math lessons plan for grade six children
• how to solve nonlinear differential equation
• quadratic formula calculator algebra
• write expression in simplified radical form
• online graphing calculator and table
• type in a fraction and get the answer in decimal form
• simplify square root fractions
• algebra 1 powerpoint answers
• simplifying integer exponents calculator
• ellipses, solutions, ti-83
• ti 89 solve inverse functions
• gre permutations free practice questions online
• when you add radical expressions what are you doing
• "Texas Instruments Calculators"+sample of TI84
• simplify radical forms
• scert class VIII solved paper, model paper
• integers worksheet
• solution to calculate real time problems by permutation and combination
• adding and subtracting integers
• aptitude questions of 6th standard
• math book answers for free
• solving quadratic equations with negative square roots
• free factoring, fundamental property solver
• year 6 maths free sheets
• solve equations in excel
• Forming Algebraic Expressions free worksheets
• free Mathematica tutorials
• fun worksheets for graphing lines
• review sheets for slope
• math exercise primary 1 kumon example
• gcse maths past paper practice online
• trigonomic functions ti-83 | {"url":"https://softmath.com/math-com-calculator/factoring-expressions/maple-newton-method-of-solving.html","timestamp":"2024-11-09T20:25:31Z","content_type":"text/html","content_length":"216812","record_id":"<urn:uuid:1e6afd5a-0b1d-4eec-b3fe-1ca614d7b75f>","cc-path":"CC-MAIN-2024-46/segments/1730477028142.18/warc/CC-MAIN-20241109182954-20241109212954-00093.warc.gz"} |
Category: algorithms Component type: function
Random_sample_n is an overloaded name; there are actually two random_sample_n functions.
template <class ForwardIterator, class OutputIterator, class Distance>
OutputIterator random_sample_n(ForwardIterator first, ForwardIterator last,
OutputIterator out, Distance n)
template <class ForwardIterator, class OutputIterator, class Distance,
class RandomNumberGenerator>
OutputIterator random_sample_n(ForwardIterator first, ForwardIterator last,
OutputIterator out, Distance n,
RandomNumberGenerator& rand)
Random_sample_n randomly copies a sample of the elements from the range [first, last) into the range [out, out + n). Each element in the input range appears at most once in the output range, and
samples are chosen with uniform probability. [1] Elements in the output range appear in the same relative order as their relative order within the input range. [2]
Random_sample copies m elements from [first, last) to [out, out + m), where m is min(last - first, n). The return value is out + m.
The first version uses an internal random number generator, and the second uses a Random Number Generator, a special kind of function object, that is explicitly passed as an argument.
Defined in the standard header algorithm, and in the nonstandard backward-compatibility header algo.h. This function is an SGI extension; it is not part of the C++ standard.
Requirements on types
For the first version:
• ForwardIterator is a model of Forward Iterator
• OutputIterator is a model of Output Iterator
• ForwardIterator's value type is convertible to a type in OutputIterator's set of value types.
• Distance is an integral type that is large enough to represent the value last - first.
For the second version:
• ForwardIterator is a model of Forward Iterator
• OutputIterator is a model of Output Iterator
• RandomNumberGenerator is a model of Random Number Generator
• Distance is an integral type that is large enough to represent the value last - first.
• ForwardIterator's value type is convertible to a type in OutputIterator's set of value types.
• Distance is convertible to RandomNumberGenerator's argument type.
• [first, last) is a valid range.
• n is nonnegative.
• [first, last) and [out, out + n) do not overlap.
• There is enough space to hold all of the elements being copied. More formally, the requirement is that [out, out + min(n, last - first)) is a valid range.
• last - first is less than rand's maximum value.
Linear in last - first. At most last - first elements from the input range are examined, and exactly min(n, last - first) elements are copied to the output range.
int main()
const int N = 10;
int A[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
random_sample_n(A, A+N, ostream_iterator<int>(cout, " "), 4);
// The printed value might be 3 5 6 10,
// or any of 209 other possibilities.
[1] This is "Algorithm S" from section 3.4.2 of Knuth (D. E. Knuth, The Art of Computer Programming. Volume 2: Seminumerical Algorithms, second edition. Addison-Wesley, 1981). Knuth credits C. T.
Fan, M. E. Muller, and I. Rezucha (1962) and T. G. Jones (1962). Note that there are N! / n! / (N - n)! ways of selecting a sample of n elements from a range of N elements. Random_sample_n yields
uniformly distributed results; that is, the probability of selecting any particular element is n / N, and the probability of any particular sampling is n! * (N - n)! / N!.
[2] In contrast, the random_sample algorithm does not preserve relative ordering within the input range. The other major distinction between the two algorithms is that random_sample_n requires its
input range to be Forward Iterators and only requires its output range to be Output Iterators, while random_sample only requires its input range to be Input Iterators and requires its output range to
be Random Access Iterators.
See also
random_shuffle, random_sample, Random Number Generator
STL Main Page | {"url":"http://ld2014.scusa.lsu.edu/STL_doc/random_sample_n.html","timestamp":"2024-11-11T20:35:47Z","content_type":"text/html","content_length":"9396","record_id":"<urn:uuid:bbaea813-4039-4b56-8aab-1031799a98b1>","cc-path":"CC-MAIN-2024-46/segments/1730477028239.20/warc/CC-MAIN-20241111190758-20241111220758-00751.warc.gz"} |
The Molecular Formula of Succinic Acid
The relative formula mass is the mass of 1 molecule of succinic acid
compared with 1/12th of the mass of an atom of carbon-12. This is
obtained by adding together the relative atomic masses of the atoms
within the molecule according to its written formula. However we do
not know the exact formula:
HOOC(CH )nCOOH Where n is a whole number
between 1 and 4
So to calculate the relative formula mass I must use the formula m = n
×Mr and rearrange it to make Mr the subject Mr = m
However I do not know the number of moles for a given mass. I can
calculate this by preparing a standard solution of the acid and
performing a titration experiment.
Firstly I would like to calculate a likely value of the relative
formula mass given the information above.
Suppose n = 3 then HOOC(CH ) COOH and Mr = 1+(2 x
= 132
To perform the titration I have chosen to use equal concentrations of
acid and alkali at 0.1mols/dm³. This is a low concentration as the
more concentrated the solution, the more rapidly the reaction takes
place. This can be explained by the collision theory as increasing the
concentration of the reactants increases the number of particles
resulting in an increased number of collisions. If the reaction takes
place too rapidly then it will be difficult to identify the exact
point at which the alkali is neutralised and the results will become
less accurate.
To prepare my acid solution I must dissolve an accurately weighed
amount of anhydrous succinic acid to 250cm³/0.25dm³ of water to
achieve a concentration of 0.1mols/dm³. What mass of acid is required
to achieve this concentration? | {"url":"https://www.123helpme.com/essay/The-Molecular-Formula-of-Succinic-Acid-149746","timestamp":"2024-11-13T11:26:48Z","content_type":"text/html","content_length":"70529","record_id":"<urn:uuid:3b23d0c2-38c2-4b7a-9401-8963ca0617a2>","cc-path":"CC-MAIN-2024-46/segments/1730477028347.28/warc/CC-MAIN-20241113103539-20241113133539-00175.warc.gz"} |
The Negative Binomial Distribution
NegBinomial {stats} R Documentation
The Negative Binomial Distribution
Density, distribution function, quantile function and random generation for the negative binomial distribution with parameters size and prob.
dnbinom(x, size, prob, mu, log = FALSE)
pnbinom(q, size, prob, mu, lower.tail = TRUE, log.p = FALSE)
qnbinom(p, size, prob, mu, lower.tail = TRUE, log.p = FALSE)
rnbinom(n, size, prob, mu)
x vector of (non-negative integer) quantiles.
q vector of quantiles.
p vector of probabilities.
n number of observations. If length(n) > 1, the length is taken to be the number required.
size target for number of successful trials, or dispersion parameter (the shape parameter of the gamma mixing distribution). Must be strictly positive, need not be integer.
prob probability of success in each trial. 0 < prob <= 1.
mu alternative parametrization via mean: see ‘Details’.
log, log.p logical; if TRUE, probabilities p are given as log(p).
lower.tail logical; if TRUE (default), probabilities are P[X \le x], otherwise, P[X > x].
The negative binomial distribution with size = n and prob = p has density
p(x) = \frac{\Gamma(x+n)}{\Gamma(n) x!} p^n (1-p)^x
for x = 0, 1, 2, \ldots, n > 0 and 0 < p \le 1.
This represents the number of failures which occur in a sequence of Bernoulli trials before a target number of successes is reached. The mean is \mu = n(1-p)/p and variance n(1-p)/p^2.
A negative binomial distribution can also arise as a mixture of Poisson distributions with mean distributed as a gamma distribution (see pgamma) with scale parameter (1 - prob)/prob and shape
parameter size. (This definition allows non-integer values of size.)
An alternative parametrization (often used in ecology) is by the mean mu (see above), and size, the dispersion parameter, where prob = size/(size+mu). The variance is mu + mu^2/size in this
If an element of x is not integer, the result of dnbinom is zero, with a warning.
The case size == 0 is the distribution concentrated at zero. This is the limiting distribution for size approaching zero, even if mu rather than prob is held constant. Notice though, that the mean of
the limit distribution is 0, whatever the value of mu.
The quantile is defined as the smallest value x such that F(x) \ge p, where F is the distribution function.
dnbinom gives the density, pnbinom gives the distribution function, qnbinom gives the quantile function, and rnbinom generates random deviates.
Invalid size or prob will result in return value NaN, with a warning.
The length of the result is determined by n for rnbinom, and is the maximum of the lengths of the numerical arguments for the other functions.
The numerical arguments other than n are recycled to the length of the result. Only the first elements of the logical arguments are used.
rnbinom returns a vector of type integer unless generated values exceed the maximum representable integer when double values are returned.
dnbinom computes via binomial probabilities, using code contributed by Catherine Loader (see dbinom).
pnbinom uses pbeta.
qnbinom uses the Cornish–Fisher Expansion to include a skewness correction to a normal approximation, followed by a search.
rnbinom uses the derivation as a gamma mixture of Poisson distributions, see
Devroye, L. (1986) Non-Uniform Random Variate Generation. Springer-Verlag, New York. Page 480.
See Also
Distributions for standard distributions, including dbinom for the binomial, dpois for the Poisson and dgeom for the geometric distribution, which is a special case of the negative binomial.
x <- 0:11
dnbinom(x, size = 1, prob = 1/2) * 2^(1 + x) # == 1
126 / dnbinom(0:8, size = 2, prob = 1/2) #- theoretically integer
## Cumulative ('p') = Sum of discrete prob.s ('d'); Relative error :
summary(1 - cumsum(dnbinom(x, size = 2, prob = 1/2)) /
pnbinom(x, size = 2, prob = 1/2))
x <- 0:15
size <- (1:20)/4
persp(x, size, dnb <- outer(x, size, function(x,s) dnbinom(x, s, prob = 0.4)),
xlab = "x", ylab = "s", zlab = "density", theta = 150)
title(tit <- "negative binomial density(x,s, pr = 0.4) vs. x & s")
image (x, size, log10(dnb), main = paste("log [", tit, "]"))
contour(x, size, log10(dnb), add = TRUE)
## Alternative parametrization
x1 <- rnbinom(500, mu = 4, size = 1)
x2 <- rnbinom(500, mu = 4, size = 10)
x3 <- rnbinom(500, mu = 4, size = 100)
h1 <- hist(x1, breaks = 20, plot = FALSE)
h2 <- hist(x2, breaks = h1$breaks, plot = FALSE)
h3 <- hist(x3, breaks = h1$breaks, plot = FALSE)
barplot(rbind(h1$counts, h2$counts, h3$counts),
beside = TRUE, col = c("red","blue","cyan"),
names.arg = round(h1$breaks[-length(h1$breaks)]))
version 4.4.1 | {"url":"https://stat.ethz.ch/R-manual/R-patched/library/stats/html/NegBinomial.html","timestamp":"2024-11-06T07:29:23Z","content_type":"text/html","content_length":"8500","record_id":"<urn:uuid:e7a20ba2-a4ba-4b3e-97ca-f1bfb6827cee>","cc-path":"CC-MAIN-2024-46/segments/1730477027910.12/warc/CC-MAIN-20241106065928-20241106095928-00228.warc.gz"} |
What is ANOVA and what can I use it for? | Qualtrics AU
What is ANOVA?
ANOVA, or Analysis of Variance, is a test used to determine differences between research results from three or more unrelated samples or groups.
You might use ANOVA when you want to test a particular hypothesis between groups, determining – in using one-way ANOVA – the relationship between an independent variable and one quantitative
dependent variable.
An example could be examining how the level of employee training impacts customer satisfaction ratings. Here the independent variable is the level of employee training; the quantitative dependent
variable is customer satisfaction.
You would use ANOVA to help you understand how employees of different training levels – for example, beginner, intermediate and advanced – with the null hypothesis for the test being that they have
the same customer satisfaction ratings. If there is a statistically significant result, it means the null hypothesis is rejected – meaning the employee groups performed differently.
The key word in ‘Analysis of Variance’ is the last one. ‘Variance’ represents the degree to which numerical values of a particular variable deviate from its overall mean. You could think of the
dispersion of those values plotted on a graph, with the average being at the centre of that graph. The variance provides a measure of how scattered the data points are from this central value.
Free eBook: The guide to modern agile research
While a one-way ANOVA is the most basic form, other variations exist that can be used in different situations:
How does ANOVA work?
ANOVA works by analysing the levels of variance within more than two groups through samples taken from each of them.
In an ANOVA test you first examine the variance within each group defined by the independent variable – this variance is calculated using the values of the dependent variable within each of these
groups. Then, you compare the variance within each group to the overall variance of the group means.
In general terms, a large difference in means combined with small variances within the groups signifies a greater difference between the groups. Here the independent variable significantly varies by
dependent variable, and the null hypothesis is rejected.
On the flip side, a small difference in means combined with large variances in the data suggests less variance between the groups. In this case, the independent variable does not significantly vary
by the dependent variable, and the null hypothesis is accepted.
Types of ANOVA
There are various approaches to using ANOVA for your data analysis. Here’s an introduction to some of the most common ones.
One-way ANOVA
One-way ANOVA is its most simple form – testing differences between three or more groups based on one independent variable. For example, comparing the sales performance of different stores in a
retail chain.
Two-way ANOVA
Used when there are two independent variables, two-way ANOVA allows for the evaluation of the individual and joint effects of the variables. For example, it could be used to understand the impact of
both advertising spend and product placement on sales revenue.
What’s the difference between one-way and two-way ANOVA tests?
This is defined by how many independent variables are included in the ANOVA test. One-way means the analysis of variance has one independent variable, two-way means the test has two independent
Factorial ANOVA
This variant of ANOVA is used when there are more than two independent variables. For example, a business might use a factorial ANOVA to examine the combined effects of age, income and education
level on consumer purchasing habits.
Welch’s F-test ANOVA
This type of ANOVA is used when the assumption of equal variances is not met. For example, a company might use Welch’s F-test to compare the job satisfaction levels of employees in different
departments, where each department has a different variance in job satisfaction scores.
Stats iQ from Qualtrics recommends an unranked Welch’s F test if two assumptions about the data hold:
• The sample size is greater than 10 times the number of groups in the calculation (groups with only one value are excluded)
• There are few or no outliers in the continuous/discrete data
Ranked ANOVA
This version of ANOVA is used with ordinal data, or when the assumptions are violated. For instance, a business might use it to compare customer satisfaction ratings (e.g., from ‘very unsatisfied’ to
‘very satisfied’) across different product lines.
Stats iQ rank-transforms the data (replaces values with their rank ordering) and then runs a ranked ANOVA on that transformed data.
Games-Howell pairwise test
This is essentially a t-test but is used when the assumption of homogeneity of variances has been violated, which means different groups have different variances. For example, a company might use the
Games-Howell test to compare the effectiveness of different training methods on employee performance, where the variances in performance are different between the methods.
Stats iQ runs Games-Howell tests regardless of the outcome of the ANOVA test (as per Zimmerman, 2010). Stats iQ shows unranked or ranked Games-Howell pairwise tests based on the same criteria as
those used for ranked vs. unranked ANOVA, so if you see ‘Ranked ANOVA’ in the advanced output, the pairwise tests will also be ranked.
Additionally, while Stats iQ does not show results of pairwise tests for any group with less than four values, those groups are included in calculating the degrees of freedom for the other pairwise
ANOVA assumptions
Like other types of statistical methods, ANOVA compares the means of different groups and shows you if there are any statistical differences between the means. ANOVA is classified as an omnibus test
statistic. This means that it can’t tell you which specific groups were statistically significantly different from each other, only that at least two of the groups were.
ANOVA relies on three main assumptions that must be met for the test results to be valid.
The first assumption is that the groups each fall into what is called a normal distribution. This means that the groups should have a bell-curve distribution with few or no outliers.
Homogeneity of variance
Also known as homoscedasticity, this means that the variances between each group are the same.
The final assumption is that each value is independent from each other. This means, for example, that unlike a conjoint analysis the same person shouldn’t be measured multiple times.
Why use ANOVA?
ANOVA is a versatile and powerful statistical technique, and the essential tool when researching multiple groups or categories. The one-way ANOVA can help you know whether or not there are
significant differences between the means of your independent variable.
Why is that useful? Because when you understand how the means of each group in your independent variable differ, you can begin to understand which of them has a connection to your dependent variable
(such as landing page clicks) and begin to learn what is driving that behaviour.
You could also repeat this test multiple times to see whether or not a single independent variable (such as temperature) affects multiple dependent variables (such as purchase rates of suncream,
attendance at outdoor venues and likelihood to hold a cook-out) and if so, which ones.
Benefits of ANOVA for businesses
ANOVA has a wide range of applications in research across numerous fields, from social sciences to medicine, and industrial research to marketing.
Its unique benefits make ANOVA particularly valuable to businesses. Here are its three main use cases in the business world.
Informing decision making
Businesses can use ANOVA to inform decisions about product development, marketing strategies and more.
Using resources
By identifying which variables have the most significant impact on a particular outcome, businesses can better allocate resources to those areas.
Understanding different variables
ANOVA doesn’t just tell you that differences exist between groups – it can also reveal the interaction between different variables. This can help businesses better understand complex relationships
and dynamics, leading to more effective interventions and strategies.
ROI from ANOVA
The Return on Investment (ROI) from using ANOVA can be significant.
It helps businesses to focus their resources on the most effective strategies by helping them make more informed decisions – potentially leading to increased efficiency, productivity and even
For instance, if ANOVA shows that one marketing strategy is significantly more effective than others, resources can be shifted to that strategy, potentially leading to increased sales and revenue.
ANOVA examples: When might you use it?
Here’s how different types of ANOVA test can be used to solve different questions a business could face.
Does the geographical region have an effect on the sales performance of a retail chain?
A one-way ANOVA can be used to answer this question, as you have one independent variable (region) and one dependent variable (sales performance).
You’ll need to collect data for different geographical regions where your retail chain operates – for example, the USA’s Northeast, Southeast, Midwest, Southwest and West regions. A one-way ANOVA can
then assess the effect of these regions on your dependent variable (sales performance) and determine whether there is a significant difference in sales performance across these regions.
Does the time of year and type of product have an effect on the sales of a company?
To answer this question, a two-way ANOVA can be used, as you have two independent variables (time of year and product type) and one dependent variable (sales).
You’ll need to collect data for different times of the year (such as Q1, Q2, Q3, Q4) and for the different types of products your company sells (like electronics, clothing, home goods, etc.). A
two-way ANOVA can then simultaneously assess the effect of these variables on your dependent variable (sales) and determine whether there is an interaction effect between the time of the year and the
type of product on the company’s sales.
Do age, sex or income have an effect on how much someone spends in your store per month?
To answer this question, a factorial ANOVA can be used, since you have three independent variables and one dependent variable.
You’ll need to collect data for different age groups (such as 0-20, 21-40, 41-70, 71+), different income brackets, and all relevant sexes. A factorial ANOVA can then simultaneously assess the effect
of these variables on your dependent variable (spending) and determine whether they make a difference.
How to conduct an ANOVA test
As with many of the older statistical tests, it’s possible to do ANOVA using a manual calculation based on formulas. However, you can run ANOVA tests much quicker using any number of popular stats
software packages and systems, such as R, SPSS or Minitab.
A more recent development is to use automated tools such as Stats iQ from Qualtrics, which makes statistical analysis more accessible and straightforward than ever before.
Stats iQ and ANOVA
When you select one categorical variable with three or more groups and one continuous or discrete variable, Stats iQ runs a one-way ANOVA (Welch’s F test) and a series of pairwise ‘post hoc’ tests
(Games-Howell tests).
The one-way ANOVA tests for an overall relationship between the two variables, and the pairwise tests test each possible pair of groups to see if one tends to have higher values than the other.
How to run an ANOVA test through Stats iQ
The Overall Stat Test of Averages in Stats iQ acts as an ANOVA, testing the relationship between a categorical and a numeric variable by testing the differences between two or more means. This test
produces a p-value to determine whether the relationship is significant or not.
To run an ANOVA in Stats iQ, take the following steps:
1. Select a variable with 3+ groups and one with numbers
2. Select ‘Relate’
3. You’ll then get an ANOVA, a related ‘effect size’ and a simple, easy to understand summary
Qualtrics Crosstabs and ANOVA
You can run an ANOVA test through the Qualtrics Crosstabs feature too. Here’s how:
1. Ensure your ‘banner’ (column) variable has 3+ groups and your ‘stub’ (rows) variable has numbers (like Age) or numeric recodes (like ‘Very Satisfied’ = 7)
2. Select ‘Overall stat test of averages’
3. You’ll see a basic ANOVA p-value
ANOVA analysis
Once you’ve performed your ANOVA test, you now need to analyse the data and capture your findings. There are two main steps to focus on here.
Interpret the output
The F-value, degrees of freedom and the p-value collectively form the backbone of hypothesis testing in ANOVA. They work together to provide a complete picture of your data and allow you to make an
informed decision about your research question.
The F-value and degrees of freedom are used together to compute the p-value; the p-value is used to determine whether or not differences between your groups are due to chance or not. Generally, if
this p-value is less than 0.05 we say that the results are statistically significant, meaning that it is unlikely that they are due to chance.
This measures the ratio of the variability between groups to the variability within groups. It’s the fundamental statistic in ANOVA that quantifies the relative extent to which the group means
Degrees of freedom (df)
This is necessary to adjust the F-value for the number of groups and the number of observations. It helps to take into account the sample size and the number of groups in the analysis, which
influences the reliability and accuracy of the F-value.
This translates the F-value (and its degrees of freedom) into a probability that helps you make a decision about the null hypothesis. It provides the statistical significance of the analysis and
allows for a more intuitive understanding of the results.
Post-hoc testing
If you find a significant effect using ANOVA, it means that there is a significant difference between at least two of the groups. But it doesn’t specify which groups are significantly different from
each other. For this, you’ll need to perform post-hoc tests.
Here are some of the most common types of post hoc test.
Tukey’s Honestly Significant Difference (HSD)
This test compares all possible pairs of means and controls for the familywise error rate. It is most appropriate when all groups have equal sample sizes.
This is a very conservative test that also compares all possible pairs of means. It adjusts the significance level by dividing it by the number of comparisons. It’s highly robust to type I errors,
but increases the chance of type II errors.
Scheffe’s Test
This is a very flexible test that allows for any type of comparison, not just pairwise comparisons. It is also very conservative.
Fisher’s Least Significant Difference (LSD)
This test does not control for familywise error rate, so it tends to be liberal in detecting significant differences.
What are the limitations of ANOVA?
While ANOVA will help you to analyse the difference in means between two independent variables, it won’t tell you which statistical groups were different from each other.
If your test returns a significant F-value (the value you get when you run an ANOVA test), you may need to run an ad hoc test (like the Least Significant Difference test) to tell you exactly which
groups had a difference in means.
Furthermore, ANOVA doesn’t provide information on the direction of the relationship between the independent and dependent variables – it only indicates if there is a statistically significant
difference between group means.
Additional considerations with ANOVA
ANOVA can be a very useful tool for analysing data, but there are some considerations you should keep in mind before deciding to use it.
Sample size
With smaller sample sizes, data can be visually inspected to determine if it is in fact normally distributed; if it is, unranked t-test results are still valid even for small samples. In practice,
this assessment can be difficult to make, so Stats iQ recommends ranked t-tests by default for small samples.
With larger sample sizes, outliers are less likely to negatively affect results. Stats iQ uses Tukey’s ‘outer fence’ to define outliers as points more than three times the interquartile range above
the 75th or below the 25th percentile point.
It’s worth highlighting that ANOVA is most reliable when the sample sizes for all groups are equal.
The type of data
ANOVA requires the dependent variable to be continuous (interval/ratio), and the independent variable to be categorical (nominal/ordinal). If your variables do not meet these requirements, then ANOVA
may not be the best choice.
Unambiguously ordinal data
Data like ‘Highest level of education completed’ or ‘Finishing order in marathon’ are unambiguously ordinal. While Likert scales (like a 1 to 7 scale, where 1 is ‘very dissatisfied’ and 7 is ‘very
satisfied’) are technically ordinal, it is common practice in social sciences to treat them as though they are continuous (i.e., with an unranked t-test).
Read more about additional statistical analysis types: | {"url":"https://www.qualtrics.com/en-au/experience-management/research/anova/","timestamp":"2024-11-14T22:24:25Z","content_type":"text/html","content_length":"145451","record_id":"<urn:uuid:afbb8d9c-8cb1-434b-9769-531b5c786462>","cc-path":"CC-MAIN-2024-46/segments/1730477395538.95/warc/CC-MAIN-20241114194152-20241114224152-00847.warc.gz"} |
2.5 ounces to grams
Convert 2.5 Ounces to Grams (oz to gm) with our conversion calculator. 2.5 ounces to grams equals 70.8738117296725 oz.
Enter ounces to convert to grams.
Formula for Converting Ounces to Grams (Oz to Gm):
grams = ounces * 28.3495
By multiplying the number of grams by 28.3495, you can easily obtain the equivalent weight in grams from ounces.
Understanding the Conversion from Ounces to Grams
When it comes to converting ounces to grams, it’s essential to know the conversion factor. One ounce is equivalent to approximately 28.3495 grams. This means that to convert ounces into grams, you
simply multiply the number of ounces by this conversion factor. This conversion is particularly important for those who work with both the imperial and metric systems, as it helps bridge the gap
between these two measurement systems.
The Formula for Converting Ounces to Grams
The formula to convert ounces (oz) to grams (g) is straightforward:
Grams = Ounces × 28.3495
Step-by-Step Calculation: Converting 2.5 Ounces to Grams
Let’s walk through the calculation of converting 2.5 ounces to grams:
1. Start with the number of ounces you want to convert: 2.5 ounces.
2. Use the conversion factor: 28.3495 grams per ounce.
3. Multiply the number of ounces by the conversion factor: 2.5 oz × 28.3495 g/oz.
4. Perform the multiplication: 2.5 × 28.3495 = 70.85625 grams.
5. Round the result to two decimal places for practical use: 70.86 grams.
The Importance of Ounce to Gram Conversion
This conversion is crucial for various applications, especially in cooking, where precise measurements can significantly affect the outcome of a recipe. For instance, if a recipe calls for 2.5 ounces
of flour, knowing that this is equivalent to 70.86 grams allows you to measure accurately using a kitchen scale that displays grams.
Practical Examples of Ounce to Gram Conversion
Beyond cooking, this conversion is also vital in scientific measurements, where accuracy is paramount. In laboratories, chemicals are often measured in grams, and converting ounces to grams ensures
that experiments are conducted with the correct quantities. Additionally, in everyday scenarios, such as when purchasing food items or supplements, understanding this conversion can help consumers
make informed choices about portion sizes and nutritional content.
In summary, converting 2.5 ounces to grams is a simple yet essential skill that enhances accuracy in various fields, from culinary arts to scientific research. By mastering this conversion, you can
ensure that your measurements are precise, bridging the gap between the imperial and metric systems with ease.
Here are 10 items that weigh close to 2.5 ounces to grams –
• Standard AA Battery
Shape: Cylindrical
Dimensions: 1.99 inches (50.5 mm) in length, 0.57 inches (14.5 mm) in diameter
Usage: Commonly used in remote controls, flashlights, and toys.
Fact: An AA battery can power a small LED light for up to 30 hours!
• Medium-Sized Apple
Shape: Round
Dimensions: Approximately 3 inches (7.6 cm) in diameter
Usage: Eaten raw, used in baking, or made into juice.
Fact: Apples float in water because 25% of their volume is air!
• Baseball
Shape: Spherical
Dimensions: 9 inches (22.9 cm) in circumference
Usage: Used in the sport of baseball for pitching, hitting, and catching.
Fact: A baseball is made of a cork center wrapped in layers of yarn and covered with leather.
• Small Pack of Sugar (1 packet)
Shape: Rectangular
Dimensions: 2 inches (5.1 cm) by 1.5 inches (3.8 cm)
Usage: Used to sweeten beverages like coffee and tea.
Fact: One packet of sugar contains about 4 grams of sugar, which is roughly a teaspoon!
• Standard Golf Ball
Shape: Spherical
Dimensions: 1.68 inches (4.27 cm) in diameter
Usage: Used in the sport of golf for driving, putting, and chipping.
Fact: A golf ball has about 336 dimples on its surface to improve aerodynamics!
• Small Bar of Soap
Shape: Rectangular
Dimensions: 3 inches (7.6 cm) by 2 inches (5.1 cm) by 1 inch (2.5 cm)
Usage: Used for personal hygiene and cleaning.
Fact: The first soap was made by the Babylonians around 2800 BC!
• Medium-Sized Tomato
Shape: Round
Dimensions: Approximately 2.5 inches (6.4 cm) in diameter
Usage: Used in salads, sauces, and various dishes.
Fact: Tomatoes are technically a fruit, but they are often treated as a vegetable in cooking!
• Small Pack of Playing Cards
Shape: Rectangular
Dimensions: 2.5 inches (6.4 cm) by 3.5 inches (8.9 cm)
Usage: Used for various card games and magic tricks.
Fact: A standard deck of playing cards has 52 cards, plus 2 jokers!
• Small Notebook
Shape: Rectangular
Dimensions: 4 inches (10.2 cm) by 6 inches (15.2 cm)
Usage: Used for jotting down notes, sketches, or ideas.
Fact: The first notebooks were made in the 15th century and were often bound with leather!
• Small Plastic Toy Figure
Shape: Various (typically humanoid)
Dimensions: Approximately 3 inches (7.6 cm) tall
Usage: Used for play, collection, or decoration.
Fact: The first plastic toys were made in the 1940s and have since become a staple in children’s play!
Other Oz <-> Gm Conversions – | {"url":"https://www.gptpromptshub.com/grams-ounce-converter/2-5-ounces-to-grams","timestamp":"2024-11-14T18:32:51Z","content_type":"text/html","content_length":"185427","record_id":"<urn:uuid:036fd1b2-3e6b-471c-a234-c2e650b7a74e>","cc-path":"CC-MAIN-2024-46/segments/1730477393980.94/warc/CC-MAIN-20241114162350-20241114192350-00142.warc.gz"} |
Significance of PCA and Explained Variance Ratio (explained_variance_ratio_)
I have two quesitons about the Principal Component Analysis (PCA) videos and labs.
1. What are some real-life use cases of PCA? I understand that it can help with visualization, but once you visualize the data in fewer dimensions using the new primary components as axes, what does
that mean for the data and next steps?
□ For example, in the lab we went from 1000 dimensions to 2 and then 3, and this shows that the data is clustered. But what does this clustering mean?
□ Do we then use k-means clustering to understand what the clusters are, and then using the PCA transformation know how much each of the 1000 dimensions contribute to the cluster?
□ It seems like we removed a bunch of data until we are able to find a pattern. It feels like a hack, like “if we prune the data using this systematic approach we end up with a pattern which
is good”, but what about all the information that is lost? Does that mean that the extra data is not useful for finding patterns?
□ My point is that it feels like there is a missing video explaining the significance, usefulness and real-life examples of PCA.
☆ We used PCA in the Math for ML Specialization to compress an image (which was pretty cool TBH), but this specialization says that’s an antiquated use case.
2. In the lab for PCA (see screenshots below), the explained_variance_ratio_ says that we were able to preserve about 15% of the variance using 2D and about 20% of the variance if we use 3D.
□ Is this a good percentage? I know we are going down from 1000 to 2 or 3 dimensions, so it seems good that only 3 dimensions have 20% of the information.
□ But 15% or 20% seems little, no? What’s the significance of finding these 8 to 10 clusters if they are missing most of the information in the original data?
Thanks in advance for any suggestions and clarifications!
The only current use I’m aware of is to trim off features which don’t contribute significantly to the cost.
In the classic “handwritten digit classification” example, you can take the original 400 features (20x20 pixel images) and reduce it to maybe 150 features. This will make training faster.
But PCA itself is not a free lunch, since you’re doing some complex math on a rather large matrix - in the handwritten digit example, the training matrix is size (5000 x 400). That takes resources
But since computers have become so big and fast and cheap, saving memory by discarding features just isn’t as important as it once was.
The standard for PCA used to be retaining 99% of the variance.
3 Likes
Thanks for the quick response.
How do we do that? Do we create new features by using the new dimensions/axes? Or do we find the variance added by each feature and pick the top N features with the most variance?
I wish the lab or videos were clearer on this.
Why does the lab highlight preserving around 15% of the variance as impressive? Is it because we preserve 15% of the variance with only 0.2% of the features?
And we preserved only around 14.6% of the variance! Quite impressive!
There is an optional lab which covers how PCA is implemented.
I’m not sure why this lab claims 15% is impressive.
1 Like
Yes. The screenshots and quotes are from the optional PCA lab, hence this post. I’m wondering if any of the course creators or editors are in this forum and can help clarify some of this content. | {"url":"https://community.deeplearning.ai/t/significance-of-pca-and-explained-variance-ratio-explained-variance-ratio/711208","timestamp":"2024-11-12T09:16:44Z","content_type":"text/html","content_length":"43505","record_id":"<urn:uuid:636278a1-ca69-4061-b4da-6070b2e58a06>","cc-path":"CC-MAIN-2024-46/segments/1730477028249.89/warc/CC-MAIN-20241112081532-20241112111532-00625.warc.gz"} |
Free Fall Calculator Free - A1Calculator
Discover the Thrill of Falling with our Free Fall Calculator. This handy calculator lets you easily figure out how fast objects fall and how far they drop during free fall. Whether you’re pondering
the descent of a falling apple or marveling at a skydiver’s daring plunge, our Free Fall Calculator is your go-to guide.
Dive deeper into the world of free fall as we unveil jaw-dropping examples, including a record-breaking plunge that shattered the sound barrier! We’ll also demystify the concept of constant free fall
acceleration and why it’s a pivotal element in understanding free fall.
Don’t stop here; we’ve got more in store for you. Explore our Projectile Motion Calculator, perfect for scenarios involving both vertical free fall and horizontal motion. Uncover the physics of
falling and motion with ease!
What is the free fall definition?
In the world of free fall, an object’s motion is solely dictated by gravity’s pull. The only force at play here is ‘g,’ representing gravitational acceleration. In this scenario, factors like air
resistance don’t come into play.
What’s fascinating is that in free fall, an object doesn’t necessarily have to fall downward. The Moon is a perfect example of this. It meets all the criteria – experiencing only Earth’s
gravitational pull with no air resistance, even in the vacuum of space.
But why doesn’t the Moon crash into Earth? The answer lies in the Moon’s velocity, which isn’t directed straight at Earth. Instead, it moves tangentially along its orbital path. This motion, at a
sufficient speed, generates a centrifugal force that counteracts gravity, keeping the Moon in its orbit.
For a deeper dive into the incredible force of gravity, explore our Gravitational Force Calculator. It’s an eye-opening journey into the immense power of gravity.
Free fall speed
Calculating a falling object’s speed is pretty straightforward using the velocity formula:
v = v₀ + gt
Here’s what it all means:
• v₀ is the initial speed (in m/s or ft/s).
• t is the time it’s been falling (in seconds).
• g is the acceleration due to gravity (in m/s² or ft/s²).
In a vacuum (without air resistance), objects in free fall accelerate at about 9.81 m/s² (or roughly 32.2 ft/s²) every second. But in reality, there’s a limit to how fast something can fall, and
that’s where terminal velocity comes into play.
So, what’s terminal velocity? As an object falls, gravity keeps pulling it down at a constant rate. However, air resistance increases as the object speeds up. Eventually, these forces balance out,
and according to Newton’s first law, the object stops accelerating and maintains a steady speed. That’s the terminal velocity.
Keep in mind that our free fall calculator doesn’t factor in air resistance. If you want to include it in your calculations, try our free fall with air resistance calculator.
Free fall equation
To figure out how far an object falls, let’s keep it simple. We use a straightforward equation:
Distance (s) = 1/2 * gravitational acceleration (g) * time squared (t^2)
Now, if that object starts with an initial speed (v0), just add it to the mix:
Distance (s) = initial speed (v0) * time (t) + 1/2 * gravitational acceleration (g) * time squared (t^2)
The cool part? The distance covered by the falling object increases rapidly as time goes by. In fact, it’s directly linked to the square of the time in free fall. So, each second, the object travels
much farther than the previous one.
What’s even more fascinating is that, regardless of the object’s mass, they should, in theory, hit the ground at the same time. Drop a feather or a brick, and they fall together, ignoring real-world
factors like air resistance. In a vacuum, where there’s no air to slow them down, they truly would hit the ground at the exact same moment
How to use the free fall formula: an example
Confused about how our Free Fall Calculator works? No worries, we’ve put together an easy-to-follow example to walk you through the process step by step.
Step 1: Know the gravitational acceleration, typically around 9.80665 meters per second squared, which is the default setting in our Free Fall Calculator.
Step 2: Determine if the object has an initial velocity. For our example, let’s assume it starts from rest (v₀ = 0 meters per second).
Step 3: Choose the time the object descends; in our case, it’s 8 seconds.
Step 4: Calculate the final free fall speed right before hitting the ground using this formula:
v = v₀ + gt = 0 + 9.80665 × 8 = 78.45 meters per second.
Step 5: Find the free fall distance using this equation:
s = (1/2)gt² = 0.5 × 9.80665 × 8² = 313.8 meters.
And if you know the object’s starting height but not the time it takes to fall, don’t worry – our Free Fall Calculator can help you find that too!
Highest free fall in history
Exploring the Thrill of Free Fall – Beyond Theory and Into Action
You’ve probably learned about free fall in theory, but experiencing it firsthand is a thrilling adventure. There are various ways to immerse yourself in the exhilaration of free falling. Think about
taking a leap with a parachute or even giving bungee jumping a shot!
Technically speaking, these jumps don’t meet all the conditions of pure free fall due to the significant air resistance involved. True free falling can only happen in a vacuum. However, these
experiences on Earth come as close as you can get to the real deal 😉
One extraordinary example of an almost scientifically precise free fall is the astounding leap made by Dr. Alan Eustace, who was Google’s VP of Knowledge in 2014. Eustace embarked on a heart-stopping
plunge from an astonishing height of 135,908 feet (41,425 meters), setting a groundbreaking record for a parachute jump.
You can witness this incredible feat on YouTube.
Remarkably, Eustace declined Google’s support for this daring feat and financed the project himself. It was no small feat, as this leap involved ascending in a specialized balloon and wearing a
custom-designed spacesuit to shield against abrupt temperature fluctuations (considering he was leaping from the edge of space). The descent itself lasted 15 minutes, with a maximum speed exceeding
800 miles per hour – well beyond the speed of sound!
Importance of Free Fall Calculator
Unleash the Power of a Free Fall Calculator! This versatile tool offers invaluable insights into science, engineering, and everyday scenarios. Here’s why it’s a must-have:
1. Safety in Sports: Whether you’re into extreme sports or just curious, calculate free fall time and velocity for a safe adventure.
2. Physics Learning: Perfect for classrooms, it simplifies gravity, acceleration, and motion concepts.
3. Engineering Marvels: Architects and engineers use it for designing elevators, rides, and more, ensuring safety and efficiency.
4. Space Wonders: Vital for rocket launches, spacecraft re-entries, and unraveling cosmic mysteries.
5. Celestial Exploration: Dive into free fall to understand celestial bodies and the universe’s secrets.
6. Forensic Clues: Crack cases by deducing how objects fell in accidents or incidents.
7. Product Perfection: Companies making safety gear, like parachutes and airbags, rely on these calculations.
8. Everyday Solutions: Solve practical problems, like estimating an object’s fall time, with ease.
9. Environmental Insights: In meteorology, it deciphers raindrops, snow, and atmospheric particles’ behavior.
10. Regulation Compliance: Industries follow rules; construction, aviation, and transportation rely on this for safety standards.
What is free fall speed?
The speed of an object in free fall near the surface of the Earth increases at a constant rate due to gravity, which is approximately 9.8 meters per second squared. This means that for every second
that an object is in free fall, its speed increases by 9.8 meters per second. Here’s a table showing the speed of the object at various times during free fall:
• 1 second after the object has begun falling: 9.8 m/s
• 2 seconds after the object has begun falling: 19.6 m/s
• 3 seconds after the object has begun falling: 29.4 m/s
• 4 seconds after the object has begun falling: 39.2 m/s
This pattern continues, with the speed increasing by 9.8 m/s for each additional second of free fall.
Why is the weight of a free-falling body zero?
In free fall, all objects, regardless of their weight, fall at the same speed. This surprising fact is due to the unchanging force of gravity, where weight is determined by the formula W = mg, with W
representing the weight, m as the mass, and g being gravity’s acceleration. However, it’s crucial to remember that an object’s weight doesn’t impact its falling speed. This means that objects of
different weights but the same shape will hit the ground simultaneously.
What is the difference between free fall and weightlessness?
Free fall is when an object falls due to gravity alone, and weightlessness happens when something with mass feels no gravity, making it feel light. You can experience weightlessness in space or by
applying an equal force to counteract gravity.
How do you find the free-fall acceleration of a planet?
Calculating a planet’s free-fall acceleration is as easy as 1-2-3:
1. Find the planet’s total mass in kilograms.
2. Measure the planet’s radius, the distance from its center to the surface, in meters.
3. Divide the total mass by the square of the radius and then multiply it by the universal Gravitational constant, which is approximately 6.67×10-11N·m2·kg-2.
The result you get is the planet’s gravitational acceleration, which is the same as its free-fall acceleration. It’s a simple and essential formula to understand how objects fall on different | {"url":"https://a1calculator.com/physics/free-fall-calculator/","timestamp":"2024-11-08T05:54:42Z","content_type":"text/html","content_length":"141477","record_id":"<urn:uuid:df5ee503-3e51-4154-a98e-60808f544be2>","cc-path":"CC-MAIN-2024-46/segments/1730477028025.14/warc/CC-MAIN-20241108035242-20241108065242-00850.warc.gz"} |
Statistics and Data Analysis
Semester 1
Itinerary HEP, ASTRO
Type Mandatory
ECTS 9
Hours 56
G. Bohm and G. Zech; “Introduction to Statistics and Data Analysis for Physicists”, 3rd Edition, 2017, Verlag Deutsches Elektronen-Synchrotron (available on-line https://s3.cern.ch/
inspire-prod-files-d/da9d786a06bf64d703e5c6665929ca01 )
F. James; “Statistical Methods in Experimental Physics”, 2nd Edition, 2006, World Scientific
G. Cowan; “Statistical Data Analysis”, 1998, Oxford University Press
A. Gelman, J. B. Carlin, H. S. Stern, et al. “Bayesian Data Analysis”, 3rd Edition, 2013, CRC Press
More Information
Course Guide in PDF | {"url":"https://mastercosmosbcn.cat/courses/02-statistics-and-data-analysis/","timestamp":"2024-11-07T22:57:00Z","content_type":"text/html","content_length":"12344","record_id":"<urn:uuid:0438f9b1-3073-404b-a901-e10ec23614b1>","cc-path":"CC-MAIN-2024-46/segments/1730477028017.48/warc/CC-MAIN-20241107212632-20241108002632-00494.warc.gz"} |
Getting Started
StatsBase.jl is a Julia package that provides basic support for statistics. Particularly, it implements a variety of statistics-related functions, such as scalar statistics, high-order moment
computation, counting, ranking, covariances, sampling, and empirical density estimation.
To install StatsBase through the Julia REPL, you can type ] add StatsBase or:
using Pkg
To load the package, use the command:
using StatsBase | {"url":"https://juliastats.org/StatsBase.jl/latest/","timestamp":"2024-11-04T14:29:48Z","content_type":"text/html","content_length":"10780","record_id":"<urn:uuid:d2c22dc4-6301-47c0-88a6-9acb6ea35a65>","cc-path":"CC-MAIN-2024-46/segments/1730477027829.31/warc/CC-MAIN-20241104131715-20241104161715-00748.warc.gz"} |
HOME | annimirabiles.com
top of page
The Miraculist
Liebert's Miracles in Quantum Mechanics +
The Holy Grail of Physics +
The first Thought Circuit +
Visit Light Tech on a different platform for Physics Frequency results
How to read the work:
Start at the beginning with Paper 1. Everything builds from there on proofs.
This page shows ALL proofs, including the supplemental proofs. There are section pages with just specific proofs.
Proofs are a math and physics protocol to proving work. All of my work is applied physics, based on Sirian knowledge from Einstein and Tesla, fellow Sirians. Newton, Marie Curie, and Pythagoras were
also Sirians.
The Miraculist
Formal Proofs of Tesla's Key of 3 is The Theory of Everything and the Holy Grail in between Quantum Physics and The Theory of Relativity
Proving Einstein + Liebert
Miracles in Quantum Mechanics
In Latin: “Primum Non Nocere”-“First, Do No Harm”
We live by a simple, best practice philosophies of Do No Harm The Golden Rule of "Treat others the way you want to be treated."
I am not responsible for you in any capacity,
because you are responsible for you.
Miracles in Quantum Mechanics are Non-religious + Microscopic in Elegant Cooperation and Partnership in
Physics, Nature, and Science.
Tesla's Key of 3 is The Theory of Everything.
bottom of page | {"url":"https://www.annimirabiles.com/","timestamp":"2024-11-09T10:12:03Z","content_type":"text/html","content_length":"1050483","record_id":"<urn:uuid:df32a610-9ca1-4939-bb43-4e5f2ec9297f>","cc-path":"CC-MAIN-2024-46/segments/1730477028116.75/warc/CC-MAIN-20241109085148-20241109115148-00243.warc.gz"} |
If I Add 0 Degrees Celsius To 0 Degrees Celsius, Does That Make It 64 Degrees Fahrenheit? - GEGCalculators
If I Add 0 Degrees Celsius To 0 Degrees Celsius, Does That Make It 64 Degrees Fahrenheit?
This article examines the validity of the claim that adding 0 degrees Celsius to 0 degrees Celsius results in a temperature of 64 degrees Fahrenheit.
It aims to provide an objective analysis by exploring the Celsius and Fahrenheit temperature scales, as well as the mathematical principles behind temperature conversions.
If I Add 0 Degrees Celsius To 0 Degrees Celsius, Does That Make It 64 Degrees Fahrenheit?
No, adding 0 degrees Celsius to 0 degrees Celsius does not result in 64 degrees Fahrenheit. The Celsius and Fahrenheit temperature scales have different conversion formulas. 0 degrees Celsius is
equal to 32 degrees Fahrenheit, so when you add two 0-degree Celsius temperatures together, the result is still 32 degrees Fahrenheit, not 64.
Temperature in Celsius (°C) Temperature in Fahrenheit (°F)
0°C 32°F
Key Takeaways
• Adding temperatures together does not result in a sum when converting between Celsius and Fahrenheit scales.
• Neglecting freezing point differences and incorrect formula application can lead to inaccuracies in temperature conversions.
• Rounding errors can introduce further inaccuracies in temperature conversions.
• Understanding temperature conversions is essential for accurate interpretation of data and informed decision-making regarding temperature-related matters.
Understanding the Celsius and Fahrenheit Temperature Scales
The Celsius and Fahrenheit temperature scales are distinct systems for measuring temperature. The historical development of temperature scales dates back to the 18th century, when various scientists
proposed different methods for quantifying temperature.
Anders Celsius developed the Celsius scale in 1742, which was based on dividing the range between freezing and boiling points of water into 100 equal intervals. On the other hand, Daniel Gabriel
Fahrenheit introduced the Fahrenheit scale in 1724, using a mixture of water, ice, and salt as reference points.
In everyday life, both scales are commonly used worldwide. The Celsius scale is widely adopted in scientific research and international conventions due to its simplicity and consistency with the
metric system. In contrast, the Fahrenheit scale is mostly used in countries like the United States for weather reports and household measurements such as oven temperatures or body temperatures.
Exploring the Math Behind Temperature Conversions
Exploring the mathematical relationships involved in converting temperatures allows for a deeper understanding of how different temperature scales relate to one another. Temperature conversions play
a crucial role in scientific research, as they enable scientists to compare and analyze data collected using different measurement systems.
In scientific experiments, it is often necessary to convert temperature values from one scale to another, such as Celsius to Fahrenheit or Kelvin. By understanding the formulas and calculations
behind these conversions, researchers can accurately interpret and compare results obtained from different experiments conducted under varying temperature conditions.
Additionally, temperature scales also have a significant impact on weather forecasting. Meteorologists rely on accurate temperature measurements and conversions to predict weather patterns, analyze
climate trends, and assess the severity of environmental phenomena like heatwaves or cold spells.
Therefore, exploring the mathematics underlying temperature conversions is essential for both scientific research and accurate weather prediction.
Debunking the Myth: Adding 0 Degrees Celsius to 0 Degrees Celsius
Debunking the myth of adding 0 degrees Celsius to 0 degrees Celsius requires an examination of the mathematical principles involved in temperature conversions. While it may seem intuitive that adding
two temperatures together would result in a sum, this is not the case when converting between different temperature scales.
Common misconceptions and errors arise due to a lack of understanding or miscalculations during temperature conversions. Here are three common temperature conversion errors:
1. Neglecting to account for the freezing point: The Celsius scale sets the freezing point of water at 0 degrees, while the Fahrenheit scale sets it at 32 degrees. Failing to adjust for this
difference can lead to inaccurate calculations.
2. Incorrectly applying conversion formulas: Different conversion formulas exist for converting between Celsius and Fahrenheit (and other scales). Using the wrong formula or incorrectly applying it
can lead to incorrect results.
3. Rounding errors: Temperature conversions often involve decimal values that should be rounded correctly according to significant figures. Failing to do so can introduce further inaccuracies into
the final result.
Frequently Asked Questions
How are the Celsius and Fahrenheit temperature scales defined?
The Celsius and Fahrenheit temperature scales are defined based on the historical development of temperature measurement.
The Celsius scale, also known as the centigrade scale, was developed by Anders Celsius in the 18th century and is based on dividing the range between the freezing and boiling points of water into 100
equal divisions.
On the other hand, the Fahrenheit scale was developed by Daniel Gabriel Fahrenheit in the early 18th century and is based on dividing this range into 180 equal divisions.
The Kelvin scale, which is commonly used in scientific contexts, is directly related to the Celsius scale through a simple conversion formula where Kelvin = Celsius + 273.15.
What is the mathematical formula for converting Celsius to Fahrenheit?
The mathematical formula for converting Celsius to Fahrenheit is as follows:
F = (C x 9/5) + 32.
This formula represents the conversion process between the two temperature scales.
The Celsius temperature value, denoted as C, is multiplied by 9/5 and then added to 32 in order to obtain the corresponding Fahrenheit temperature value, denoted as F.
This formula allows for precise and accurate conversion between the two scales.
Can I directly add or subtract temperatures in Celsius and Fahrenheit?
Temperature unit conversions in scientific experiments are crucial for accurate measurements and data analysis. However, directly adding or subtracting temperatures in Celsius and Fahrenheit is not
recommended due to the different scales and formulas used. It is essential to convert temperatures to a common unit before performing any mathematical operations. Failure to do so can lead to
erroneous results, affecting the reliability of scientific findings.
Furthermore, temperature plays a significant role in weather forecasting accuracy as it influences atmospheric conditions, such as air pressure and humidity. Precise temperature measurements are
vital for reliable weather predictions.
Are there any exceptions or special cases when converting temperatures between Celsius and Fahrenheit?
Temperature conversions are a fundamental aspect of scientific research and weather forecasting. Converting temperatures between Celsius and Fahrenheit is generally straightforward, following
established formulas. However, there are exceptions to consider.
For instance, extreme cold temperatures can lead to discrepancies in the conversion due to variations in the temperature scales. Additionally, certain scientific experiments or weather phenomena may
require more precise or specialized conversion methods.
Thus, it is crucial for researchers and meteorologists to be aware of any potential exceptions or special cases when converting temperatures for accurate data analysis and forecasting purposes.
Are there any other common misconceptions or myths related to temperature conversions that need to be debunked?
Common temperature conversion mistakes can arise from using incorrect formulas or assumptions. It is important to use the correct conversion formula when converting temperatures between Celsius and
Fahrenheit, as any deviation can lead to inaccurate results.
One common misconception is assuming that adding two identical temperatures in Celsius will result in a specific temperature in Fahrenheit, such as 64 degrees. However, this assumption is incorrect
and highlights the importance of understanding and applying the correct conversion formula for accurate temperature conversions.
GEG Calculators is a comprehensive online platform that offers a wide range of calculators to cater to various needs. With over 300 calculators covering finance, health, science, mathematics, and
more, GEG Calculators provides users with accurate and convenient tools for everyday calculations. The website’s user-friendly interface ensures easy navigation and accessibility, making it suitable
for people from all walks of life. Whether it’s financial planning, health assessments, or educational purposes, GEG Calculators has a calculator to suit every requirement. With its reliable and
up-to-date calculations, GEG Calculators has become a go-to resource for individuals, professionals, and students seeking quick and precise results for their calculations.
Leave a Comment | {"url":"https://gegcalculators.com/if-i-add-0-degrees-celsius-to-0-degrees-celsius-does-that-make-it-64-degrees-fahrenheit/","timestamp":"2024-11-08T20:59:17Z","content_type":"text/html","content_length":"183011","record_id":"<urn:uuid:e72d0f47-d545-4bd0-9fe7-89f722892bf5>","cc-path":"CC-MAIN-2024-46/segments/1730477028079.98/warc/CC-MAIN-20241108200128-20241108230128-00355.warc.gz"} |
ScanLex-ordliste, en-sv Anders Nøklestad engelska svenska
Ett komplementerande läromaterial för datastudenter som lär
LaTeX Basics Creating your first LaTeX document Choosing a LaTeX Compiler Paragraphs These { } have a variety of names; they are called braces, curly brackets, or squiggly brackets. Usually these
types of brackets are used for lists, but online, they Jun 24, 2014 In this post, I'm not so much interested in the definition of these notations, but rather in how to correctly typeset them in
LaTeX. Example of a big Nov 3, 2020 For example: $$ Stack Exchange network consists of 176 Q&A communities including Stack Overflow, the largest, most trusted online community Dec 31, 2020
Alternatively referred to as an open brace, close brace, and squiggly brackets, curly brackets are found on the same keys as the open bracket It depends on how you got the double-height curly
bracket in the first place. Here is a way to do it starting from scratch. From this Microsoft Answers article:. Latex Memes For Well Typeset Teens. 30413 likes · 10 talking about this.
Angle brackets are used in various sorts of mathematical expressions: 〈x, y〉 can denote an inner product or other such pairing, 〈a, b | ab = ba 2 〉 a presentation of a group, and k〈X〉 a free
associative algebra. On the typewriter, they are rendered using the greater-than and less-than signs, < and >. Notice that to get these in LaTeX you have to type like this: {\sc pc}, {\sc prolog}, \
ldots If you type upper case characters inside the \sc environment, they come out as big caps. Smileys: You can generate a smiley face by doing the following: $\ddot\smile$ There are various ways of
doing smileys around. I learned this one from Ivan Derzhanski. 2019-02-16 This is the 14th video in a series of 21 by Dr Vincent Knight of Cardiff University.
[ » Baddmadrass Superior Latex Split Baddmadrass Superior Latex
And, just like the parentheses, when it doesn't belong inside a word, it is keyboard) using a LaTeX-like notation with some additional shortcuts. Foil and latex balloons. Big data och programmering
hacking, djup dekryptering och kryptering, Set of rocky symbols left and right parentheses, number 0.
Automatic Detection of Grammar Errors in Primary - CiteSeerX
Notice that to get these in LaTeX you have to type like this: {\sc pc}, {\sc prolog}, \ldots If you type upper case characters inside the \sc environment, they come out as big caps. Smileys: You can
generate a smiley face by doing the following: $\ddot\smile$ There are various ways of doing smileys around. I learned this one from Ivan Derzhanski. 2019-02-16 This is the 14th video in a series of
21 by Dr Vincent Knight of Cardiff University. Here we present a list of algebraic operators commonly used in LaTeX equations.
RStudio – Cheatsheets Business Intelligence, Undervisningstips, Big Data, LaTeX function parentheses are hard (actually, LaTeX is just hard) Latex, Kodning. MediaWiki uses a subset of TeX markup,
including some extensions from LaTeX and AMS-LaTeX, for mathematical formulae. It generates Spara med Bigstock-prenumerationer. Big Pencil In Male Left Hand On Yellow Background With Text Happy Left
Handers Symbol left and right parentheses, male Male hand in blue latex protective medical glove points finger to the left, The global pandemic with Covid-19 creates a big uncertainty among our
customers and based latex molecules in the form of ethyl vinyl acetate (EVA), polyacrylates Numbers within parentheses refer to the preceding year The pattern, vintage 1960's from Bernat, is written
for size 10.
Mikael källström kramfors
Here is how they look (with the above workaround for comparison). One has to use sharper angles in these symbols than in the angle bracket symbols shown above, to keep the brackets from running too
close to the parentheses; I have made the angles 80° and 60°. http://www.freemathvideos.com In this video series I show you how to simplify an expression by following the order of operations. In
these examples we have a Feb 12, 2013 Here's a part of an equation from the book: Larger outer parentheses make the equation much The latter used left and right to tell LaTeX that the parentheses
should grow to I prefer to specify the size with bi LaTeX constructions sup sub. ˜ abc. \sp{sup}. \sb{sub}.
Viewed 12k times. 2. I would like to have more than on line in a big paranthesis, how can I do that. I have test this code but doesnt work for me: \begin {equation} p \big [ i, j \big]=min\Bigg ( p \
big [i-1, j-1 \big] + 2 \times d \big ( i, Large braces or brackets around objects can either be achieved using "\big operators", \left\right pairs, or *matrix-like environments. Share Improve this
answer 2014-09-20 Controlling types and sizes. The size of the brackets can be controlled explicitly. Manually sized brackets  \ [ \Bigg \langle 3x+7 \Bigg \rangle \] The commands \Bigg and \bigg
stablish the size of the delimiters < and > respectively.
Sjuktransport vasteras
6t ap_pendix et. = 6t. The numbers in parentheses are the page numbers where a particular place can örebro massage big cock sexiga underkläder tysk orgie svenskporr ring keta forum sexleksaker par
gratis sexsidor hobby escort fetish latex thaimassage i mimeTeX \big and \Big ops */ // make the normal ones in text mode jsMath. Layout(data.size,parse.table,columns); // Add parentheses, if needed
if n" #: convertrules.py:3069 msgid "Harmonic parentheses are part of the TabNoteHead msgstr "Bearbeta LilyPond-stycken i hybrid HTML-, LaTex-, texinfo- eller PostScript" #: main.cc:162 msgid
"generate big PDF files" msgstr "skapa stora smb-monterare krita krita latex latex-exportfilter greek grekiska hide göm finish avslutning rectangle rektangel large stor kab kab-importverktyg pilot
brackets hakparenteser msn msn-insticksprogram unicode unicode av SS Hashemi · Citerat av 1 — for loan of LATEX-manual and for always being helpful, Ulla Veres for help with recruitment My mother,
father, sister and my big little brother . violations are followed by the correct form within parentheses and preceded by.
Insert > Field. The size of brackets [ ] , (curly) braces { } and parentheses ( ) can be adjusted with these commands: $$-1+x ( x \big( 1+ x\Big(2 + x gonna put some parentheses around here because
I'm going to complete the square and then I have my Y terms I'll circle those in well the red looks too much Parenthesis can be made adjustable to the equation using the \left( . LaTeX Basics
Creating your first LaTeX document Choosing a LaTeX Compiler Paragraphs These { } have a variety of names; they are called braces, curly brackets, or squiggly brackets. Usually these types of
brackets are used for lists, but online, they Jun 24, 2014 In this post, I'm not so much interested in the definition of these notations, but rather in how to correctly typeset them in LaTeX.
Example of a big Nov 3, 2020 For example: $$ Stack Exchange network consists of 176 Q&A communities including Stack Overflow, the largest, most trusted online community Dec 31, 2020 Alternatively
referred to as an open brace, close brace, and squiggly brackets, curly brackets are found on the same keys as the open bracket It depends on how you got the double-height curly bracket in the first
place. Here is a way to do it starting from scratch.
Skatteberäkning kommanditbolag
hur gammal är man när man börjar gymnasietutrikesdepartementet kontaktapa muntlig källagraviditetstest 3 dagar innan menstrigonometriska fourierserier
[ » Baddmadrass Superior Latex Split Baddmadrass Superior Latex
Pleae, how do I get big brackets in math , so that I can put it arround the fraction? Many thanks! Aug 1, 2008 Above we shoved how to get LATEX to ignore the width of the subscript of When you want a
big parenthesis or bracket in a math display you Math via LaTeX in Piazza. January 12, 2016.
Unionensakassa logga invarnskatten
Nakna tjejer som söker män i orivesi att knulla med omedelbart
Now we just 0009059: [Usability] Rotated text frame corrupts large document. 0009108: [PDF] PDF bookmark adds reverse slash in front of bracket (jghali) - closed. 0007666: [Translation] Render
Frames => Latex config file => Polish LSB-conforming applications shall use big-endian byte ordering. | {"url":"https://investeringarbgkwfj.netlify.app/20481/43670.html","timestamp":"2024-11-14T08:37:27Z","content_type":"text/html","content_length":"19471","record_id":"<urn:uuid:dfe2b696-d5b9-4c03-8b5c-9f29b6eca602>","cc-path":"CC-MAIN-2024-46/segments/1730477028545.2/warc/CC-MAIN-20241114062951-20241114092951-00536.warc.gz"} |
3.1 Kinematics in Two Dimensions: An Introduction
Learning Objectives
Learning Objectives
By the end of this section, you will be able to do the following:
• Observe that motion in two dimensions consists of horizontal and vertical components
• Understand the independence of horizontal and vertical vectors in two-dimensional motion
The information presented in this section supports the following AP® learning objectives and science practices:
• 3.A.1.1 The student is able to express the motion of an object using narrative, mathematical, and graphical representations. (S.P. 1.5, 2.1, 2.2)
• 3.A.1.2 The student is able to design an experimental investigation of the motion of an object. (S.P. 4.2)
• 3.A.1.3 The student is able to analyze experimental data describing the motion of an object and is able to express the results of the analysis using narrative, mathematical, and graphical
representations. (S.P. 5.1)
Two-Dimensional Motion: Walking in a City
Two-Dimensional Motion: Walking in a City
Suppose you want to walk from one point to another in a city with uniform square blocks, as pictured in Figure 3.3.
The straight-line path that a helicopter might fly is blocked to you as a pedestrian, and so you are forced to take a two-dimensional path, such as the one shown. You walk 14 blocks in all, nine east
followed by five north. What is the straight-line distance?
An old adage states that the shortest distance between two points is a straight line. The two legs of the trip and the straight-line path form a right triangle, and so the Pythagorean theorem, $a2 +
b2 = c2a2 + b2 = c2 size 12{a rSup { size 8{2} } " + "b rSup { size 8{2} } " = "c rSup { size 8{2} } } {}$, can be used to find the straight-line distance.
The hypotenuse of the triangle is the straight-line path, and so in this case its length in units of city blocks is $(9 blocks)2+ (5 blocks)2= 10.3 blocks(9 blocks)2+ (5 blocks)2= 10.3 blocks size 12
{ sqrt { \( "9 blocks" \) rSup { size 8{2} } "+ " \( "5 blocks" \) rSup { size 8{2} } } "= 10" "." "3 blocks"} {}$, considerably shorter than the 14 blocks you walked. Note that we are using three
significant figures in the answer. Although it appears that 9 and 5 only have one significant digit, they are discrete numbers. In this case 9 blocks is the same as 9.0 or 9.00 blocks. We have
decided to use three significant figures in the answer in order to show the result more precisely.
The fact that the straight-line distance 10.3 blocks in Figure 3.5 is less than the total distance walked 14 blocks is one example of a general characteristic of vectors. Recall that vectors are
quantities that have both magnitude and direction.
As for one-dimensional kinematics, we use arrows to represent vectors. The length of the arrow is proportional to the vector's magnitude. The arrow's length is indicated by hash marks in Figure 3.3
and Figure 3.5. The arrow points in the same direction as the vector. For two-dimensional motion, the path of an object can be represented with three vectors: One vector shows the straight-line path
between the initial and final points of the motion, one vector shows the horizontal component of the motion, and one vector shows the vertical component of the motion. The horizontal and vertical
components of the motion add together to give the straight-line path. For example, observe the three vectors in Figure 3.5. The first represents a nine-block displacement east. The second represents
a five-block displacement north. These vectors are added to give the third vector, with a 10.3-block total displacement. The third vector is the straight-line path between the two points. Note that
in this example, the vectors that we are adding are perpendicular to each other and thus form a right triangle. This means that we can use the Pythagorean theorem to calculate the magnitude of the
total displacement. Note that we cannot use the Pythagorean theorem to add vectors that are not perpendicular. We will develop techniques for adding vectors having any direction, not just those
perpendicular to one another, in Vector Addition and Subtraction: Graphical Methods and Vector Addition and Subtraction: Analytical Methods.
The Independence of Perpendicular Motions
The Independence of Perpendicular Motions
The person taking the path shown in Figure 3.5 walks east and then north—two perpendicular directions. How far the person walks east is only affected by the person's motion eastward. Similarly, how
far the person walks north is only affected by the person's motion northward.
Independence of Motion
The horizontal and vertical components of two-dimensional motion are independent of each other. Any motion in the horizontal direction does not affect motion in the vertical direction, and vice
This is true in a simple scenario like that of walking in one direction first, followed by another. It is also true of more complicated motion involving movement in two directions at once. For
example, let's compare the motions of two baseballs. One baseball is dropped from rest. At the same instant, another is thrown horizontally from the same height and follows a curved path. A
stroboscope has captured the positions of the balls at fixed time intervals as they fall.
Applying the Science Practices: Independence of Horizontal and Vertical Motion or Maximum Height and Flight Time
Choose one of the following experiments to design.
Design an experiment to confirm what is shown in Figure 3.6, that the vertical motion of the two balls is independent of the horizontal motion. As you think about your experiment, consider the
following questions:
• How will you measure the horizontal and vertical positions of each ball over time? What equipment will this require?
• How will you measure the time interval between each of your position measurements? What equipment will this require?
• If you were to create separate graphs of the horizontal velocity for each ball versus time, what do you predict it would look like? Explain.
• If you were to compare graphs of the vertical velocity for each ball versus time, what do you predict it would look like? Explain.
• If there is a significant amount of air resistance, how will that affect each of your graphs?
Design a two-dimensional ballistic motion experiment that demonstrates the relationship between the maximum height reached by an object and the object's time of flight. As you think about your
experiment, consider the following questions:
• How will you measure the maximum height reached by your object?
• How can you take advantage of the symmetry of an object in ballistic motion launched from ground level, reaching maximum height, and returning to ground level?
• Will it make a difference if your object has no horizontal component to its velocity? Explain.
• Will you need to measure the time at multiple different positions? Why or why not?
• Predict what a graph of travel time versus maximum height will look like. Will it be linear, parabolic, or horizontal? Explain the shape of your predicted graph qualitatively or quantitatively.
• If there is a significant amount of air resistance, how will that affect your measurements and your results?
It is remarkable that for each flash of the strobe, the vertical positions of the two balls are the same. This similarity implies that the vertical motion is independent of whether or not the ball is
moving horizontally. Assuming no air resistance, the vertical motion of a falling object is influenced by gravity only, and not by any horizontal forces. Careful examination of the ball thrown
horizontally shows that it travels the same horizontal distance between flashes. This is due to the fact that there are no additional forces on the ball in the horizontal direction after it is
thrown. This result means that the horizontal velocity is constant, and affected neither by vertical motion nor by gravity, which is vertical. Note that this case is true only for ideal conditions.
In the real world, air resistance will affect the speed of the balls in both directions.
The two-dimensional curved path of the horizontally thrown ball is composed of two independent one-dimensional motions (horizontal and vertical). The key to analyzing such motion, called projectile
motion, is to resolve (break) it into motions along perpendicular directions. Resolving two-dimensional motion into perpendicular components is possible because the components are independent. We
shall see how to resolve vectors in Vector Addition and Subtraction: Graphical Methods and Vector Addition and Subtraction: Analytical Methods. We will find such techniques to be useful in many areas
of physics.
PhET Explorations: Ladybug Motion Two-Dimensional | {"url":"https://texasgateway.org/resource/31-kinematics-two-dimensions-introduction?book=79096&binder_id=78521","timestamp":"2024-11-02T18:12:44Z","content_type":"text/html","content_length":"64368","record_id":"<urn:uuid:678f0612-3215-4617-87b2-331a3ea5209e>","cc-path":"CC-MAIN-2024-46/segments/1730477027729.26/warc/CC-MAIN-20241102165015-20241102195015-00024.warc.gz"} |
Random Number Generators (RNGs) are often used when generating, drawing and computing properties or manipulating networks. NetworkX provides functions which use one of two standard RNGs: NumPy’s
package numpy.random or Python’s built-in package random. They each provide the same algorithm for generating numbers (Mersenne Twister). Their interfaces are similar (dangerously similar) and yet
distinct. They each provide a global default instance of their generator that is shared by all programs in a single session. For the most part you can use the RNGs as NetworkX has them set up and
you’ll get reasonable pseudorandom results (results that are statistically random, but created in a deterministic manner).
Sometimes you want more control over how the numbers are generated. In particular, you need to set the seed of the generator to make your results reproducible – either for scientific publication or
for debugging. Both RNG packages have easy functions to set the seed to any integer, thus determining the subsequent generated values. Since this package (and many others) use both RNGs you may need
to set the seed of both RNGs. Even if we strictly only used one of the RNGs, you may find yourself using another package that uses the other. Setting the state of the two global RNGs is as simple
setting the seed of each RNG to an arbitrary integer:
>>> import random
>>> random.seed(246) # or any integer
>>> import numpy
>>> numpy.random.seed(4812)
Many users will be satisfied with this level of control.
For people who want even more control, we include an optional argument to functions that use an RNG. This argument is called seed, but determines more than the seed of the RNG. It tells the function
which RNG package to use, and whether to use a global or local RNG.
>>> from networkx import path_graph, random_layout
>>> G = path_graph(9)
>>> pos = random_layout(G, seed=None) # use (either) global default RNG
>>> pos = random_layout(G, seed=42) # local RNG just for this call
>>> pos = random_layout(G, seed=numpy.random) # use numpy global RNG
>>> random_state = numpy.random.RandomState(42)
>>> pos = random_layout(G, seed=random_state) # use/reuse your own RNG
Each NetworkX function that uses an RNG was written with one RNG package in mind. It either uses random or numpy.random by default. But some users want to only use a single RNG for all their code.
This seed argument provides a mechanism so that any function can use a numpy.random RNG even if the function is written for random. It works as follows.
The default behavior (when seed=None) is to use the global RNG for the function’s preferred package. If seed is set to an integer value, a local RNG is created with the indicated seed value and is
used for the duration of that function (including any calls to other functions) and then discarded. Alternatively, you can specify seed=numpy.random to ensure that the global numpy RNG is used
whether the function expects it or not. Finally, you can provide a numpy RNG to be used by the function. The RNG is then available to use in other functions or even other package like sklearn. In
this way you can use a single RNG for all random numbers in your project.
While it is possible to assign seed a random-style RNG for NetworkX functions written for the random package API, the numpy RNG interface has too many nice features for us to ensure a random-style
RNG will work in all functions. In practice, you can do most things using only random RNGs (useful if numpy is not available). But your experience will be richer if numpy is available.
To summarize, you can easily ignore the seed argument and use the global RNGs. You can specify to use only the numpy global RNG with seed=numpy.random. You can use a local RNG by providing an integer
seed value. And you can provide your own numpy RNG, reusing it for all functions. It is easier to use numpy RNGs if you want a single RNG for your computations. | {"url":"https://networkx.org/documentation/networkx-2.8.8/reference/randomness.html","timestamp":"2024-11-09T09:41:17Z","content_type":"text/html","content_length":"27838","record_id":"<urn:uuid:890a4243-cd9b-421c-89ae-ba52ba0ebd38>","cc-path":"CC-MAIN-2024-46/segments/1730477028116.75/warc/CC-MAIN-20241109085148-20241109115148-00143.warc.gz"} |
Recent advances in mathematical neuroscience: cortically inspired models for vision and synaptic plasticityRecent advances in mathematical neuroscience: cortically inspired models for vision and synaptic plasticity
Recent advances in mathematical neuroscience: cortically inspired models for vision and synaptic plasticity
Tuesday, June 15 at 02:15am (PDT)Tuesday, June 15 at 10:15am (BST)Tuesday, June 15 06:15pm (KST)
Follow Monday (Tuesday) during the "MS05" time block.
Note: this minisymposia has multiple sessions. The second session is
MS17-NEUR (click here)
Luca Calatroni (Laboratoire I3S, CNRS, UCA & Inria Sophia Antipolis Méditerranée, France), Mathieu Desroches (MathNeuro Project-Team, Inria Sophia Antipolis Méditerranée & Université Côté d’Azur,
France), Valentina Franceschi (Dipartimento di Matematica, Università degli Studidi Padova, Italy), Dario Prandi (Université Paris-Saclay, CNRS, CentraleSupélec, L2S, France)
The purpose of this symposium is to gather together experts working in the field of mathematical neuroscience, with a focus on those working on cortical inspired models for vision and synaptic
plasticity. In particular the speakers will present recent results on variational and differential approaches to the understanding of the primary visual cortex as well as more recent models based on
neural networks and predictive coding.
Laurent Perrinet
(INT, CNRS - Aix-Marseille Université, France)
"Pooling in a predictive model of V1 explains functional and structural diversity across species"
Neurons in the primary visual cortex are selective to orientation with various degrees of selectivity to the spatial phase, from high selectivity in simple cells to low selectivity in complex cells.
Various computational models have suggested a possible link between the presence of phase invariant cells and the existence of cortical orientation maps in higher mammals’ V1. These models, however,
do not explain the emergence of complex cells in animals that do not show orientation maps. In this study, we build a model of V1 based on a convolutional network called Sparse Deep Predictive Coding
(SDPC) and show that a single computational mechanism, pooling, allows the SDPC model to account for the emergence of complex cells as well as cortical orientation maps in V1, as observed in distinct
species of mammals. By using different pooling functions, our model developed complex cells in networks that exhibit orientation maps (e.g., like in carnivores and primates) or not (e.g., rodents and
lagomorphs). The SDPC can therefore be viewed as a unifying framework that explains the diversity of structural and functional phenomena observed in V1. In particular, we show that orientation maps
emerge naturally as the most cost-efficient structure to generate complex cells under the predictive coding principle.
Rufin VanRullen
(CerCo, CNRS and ANITI, Universite de Toulouse, France)
"Deep predictive coding for more robust and human-like vision"
I will report on a series of experiments with deep convolutional neural networks augmented with feedback connections. The dynamics of the network are governed by predictive coding objectives, similar
to those that have been proposed to explain neural activity in the brain. Compared to the standard feed-forward networks, these predictive coding networks can be more robust to noise and against
certain adversarial attacks. They also respond to visual illusions (in particular, illusory contours from Kanisza shapes) in a way that is more similar to biological perception.
Yuri Elias Rodrigues
(INRIA/IPMC/Université Côte d'Azur, France)
"Modelling the experimental heterogeneity of synaptic plasticity"
Discovering the rules of synaptic plasticity is an important step for understanding brain learning. Existing plasticity models are either 1) top-down and interpretable, but not flexible enough to
account for experimental data, or 2) bottom-up and biologically realistic, but too intricate to interpret and hard to fit data. We fill the gap between these approaches by uncovering a new plasticity
rule based on a geometrical readout mechanism that flexibly maps synaptic enzyme dynamics to plasticity outcomes. We apply this readout to a multi-timescale model of hippocampal synaptic plasticity
induction that includes electrical dynamics, calcium, CaMKII and Calcineurin, and accurate representation of intrinsic noise sources. Using a single set of model parameters, we demonstrate the
robustness of this plasticity rule by reproducing nine published ex vivo experiments covering various spike-timing and frequency-dependent plasticity induction protocols, animal ages, and
experimental conditions. Our model should facilitate experimental design since each variable identify a biological counterpart bridging experiment and simulation.
Halgurd Taher
(Inria Sophia Antipolis-Méditerranée Research Centre, France)
"Bursting in a next generation neural mass model with synaptic dynamics: a slow-fast approach"
We report a detailed analysis on the emergence of bursting in a recently developed neural mass model, that takes short-term synaptic plasticity into account. Neural mass models are capable of
mimicking the collective dynamics of large scale neuronal populations in terms of a few macroscopic variables like mean membrane potential and firing rate. The one being used here particularly
important, as it represents an exact meanfield limit of synaptically coupled quadratic integrate & fire neurons, a canonical model for type I excitability. In absence of synaptic dynamics, a periodic
external current with a slow frequency ϵ can lead to burst-like dynamics. The firing patterns can be understood using techniques of singular perturbation theory, specifically slow-fast dissection. In
the model with synaptic dynamics the separation of timescales leads to a variety of slow-fast phenomena and their role for bursting is rendered inordinately more intricate. Canards are one of the
main slow-fast elements on the route to bursting. They describe trajectories evolving nearby otherwise repelling invariant sets of the system and are found in the transition region from subthreshold
dynamics to bursting. For values of the timescale separation nearby the singular limit ϵ → 0, we report peculiar jump-on canards, which block a continuous transition to bursting. In the biologically
more plausible regime this transition becomes continuous and bursts emerge via consecutive spike-adding. The onset of bursting is of complex nature and involves mixed-type like torus canards, that
form the very first spikes of the burst and revolve nearby repelling limit cycles. We provide numerical evidence for the same mechanisms to be responsible for the emergence of bursting in the
quadratic & fire network with plastic synapses. The main conclusions apply for the network, thanks to the exactness of the meanfield limit.
Hosted by SMB2021 Follow
Virtual conference of the Society for Mathematical Biology, 2021. | {"url":"http://2021.smb.org/MS05/NEUR-MS05.html","timestamp":"2024-11-11T10:20:19Z","content_type":"text/html","content_length":"24435","record_id":"<urn:uuid:e4a8c9d3-174e-4620-9c1f-3479509c5f4d>","cc-path":"CC-MAIN-2024-46/segments/1730477028228.41/warc/CC-MAIN-20241111091854-20241111121854-00580.warc.gz"} |
ICCV 2021 Open Access Repository
Provably Approximated Point Cloud Registration
The goal of the alignment problem is to align a (given) point cloud P = \ p_1,\cdots,p_n\ to another (observed) point cloud Q = \ q_1,\cdots,q_n\ . That is, to compute a rotation matrix R \in \
mathbb R ^ 3 x3 and a translation vector t \in \mathbb R ^ 3 that minimize the sum of paired distances between every transformed point Rp_i-t, to its corresponding point q_i, over every i\in \br
1,\cdots,n . A harder version is the registration problem, where the correspondence is unknown, and the minimum is also over all possible correspondence functions from P to Q. Algorithms such as
the Iterative Closest Point (ICP) and its variants were suggested for these problems, but none yield a provable non-trivial approximation for the global optimum. We prove that there always exists
a "witness" set of 3 pairs in P xQ that, via novel alignment algorithm, defines a constant factor approximation (in the worst case) to this global optimum. We then provide algorithms that recover
this witness set and yield the first provable constant factor approximation for the: (i) alignment problem in O(n) expected time, and (ii) registration problem in polynomial time. Such small
witness sets exist for many variants including points in d-dimensional space, outlier-resistant cost functions, and different correspondence types. Extensive experimental results on real and
synthetic datasets show that, in practice, our approximation constants are close to 1 and our error is up to x10 times smaller than state-of-the-art algorithms.
Related Material
[pdf] [supp]
@InProceedings{Jubran_2021_ICCV, author = {Jubran, Ibrahim and Maalouf, Alaa and Kimmel, Ron and Feldman, Dan}, title = {Provably Approximated Point Cloud Registration}, booktitle = {Proceedings
of the IEEE/CVF International Conference on Computer Vision (ICCV)}, month = {October}, year = {2021}, pages = {13269-13278} } | {"url":"https://openaccess.thecvf.com/content/ICCV2021/html/Jubran_Provably_Approximated_Point_Cloud_Registration_ICCV_2021_paper.html","timestamp":"2024-11-02T02:59:35Z","content_type":"text/html","content_length":"6780","record_id":"<urn:uuid:96970285-3dea-439a-99bc-8297bbe38793>","cc-path":"CC-MAIN-2024-46/segments/1730477027632.4/warc/CC-MAIN-20241102010035-20241102040035-00679.warc.gz"} |
How to Find the Moments of the Binomial Distribution - dummies
Moments are summary measures of a probability distribution, and include the expected value, variance, and standard deviation. The expected value represents the mean or average value of a
distribution. The expected value is sometimes known as the first moment of a probability distribution. You calculate the expected value by taking each possible value of the distribution, weighting it
by its probability, and then summing the results. The expected value is comparable to the mean of a population or sample.
The variance and standard deviation represent the dispersion among the possible values of a probability distribution. The variance and standard deviation of a probability distribution are equivalent
to the variance and standard deviation of a population or sample. The variance is sometimes known as the second central moment of a probability distribution; the standard deviation isn't a separate
moment, but simply the square root of the variance.
Luckily, for the binomial distribution, you can reduce computation time by using a series of simplified formulas.
How to calculate the expected value of the binomial distribution
The expected value of a probability distribution is its average value. You get it by weighing each possible value by its probability of occurring. For the binomial distribution, the calculation of
the expected value can be simplified to
E(X) = np
For example, suppose that 10 percent of all people are left-handed, and 90 percent are right-handed (which happens to be true). In a class of 40 students, what's the expected number of left-handed
students? You can calculate the expected value by thinking of each student as a "trial," with a 10 percent chance of being left-handed (a "success") and 90 percent chance of being right-handed (a
"failure"). Therefore, n = 40 and p = 0.10. The expected number of left-handed students in the class is E(X) = np = (40)(0.10) = 4.
How to compute the variance and standard deviation of the binomial distribution
The variance of a distribution is the average squared distance between each possible outcome and the expected value. For the binomial distribution, you may compute the variance with the following
simplified formula:
The standard deviation of a distribution equals the square root of the variance. For the binomial distribution, you calculate the standard deviation as
For the example of left-handed students,
• The expected value is E(X) = np = (40)(0.10) = 4.
• The variance is
• The standard deviation is
About This Article
This article is from the book:
This article can be found in the category: | {"url":"https://www.dummies.com/article/business-careers-money/business/accounting/calculation-analysis/how-to-find-the-moments-of-the-binomial-distribution-146049/","timestamp":"2024-11-09T16:38:38Z","content_type":"text/html","content_length":"80151","record_id":"<urn:uuid:e0272255-c854-4b59-abbb-f3d793ce8d38>","cc-path":"CC-MAIN-2024-46/segments/1730477028125.59/warc/CC-MAIN-20241109151915-20241109181915-00239.warc.gz"} |
am drunk when this post happened
Spaughtyena All-Right Member
Jul 20, 2011
Likes Received:
I am dumb, I decided to drink like lots of beeer and I am alone, so i am bored a s all hell. I thought it would be funny to reda this post thwn i am somber so I can laugh.
If anyone else has gotten drunk and tried to type her, you sho9uld tell me, Im bet I will laugh.
I only had like seven so it cant be that bad, but im skinny so i got drunk to fast and im alone.
I hould do something funny
I am out of drinks, which is good because I ORBLY WILL get sick if i drink anymre. I don't feel the best, but I am still typeing fiarly dfast an d stuff. I havent' had too mush stuff to drink
only normal beers but i am still enhjoying the taste of them so don ANYBODYT DIS THE NIORMAL SHIT
Sometimes I think that it would be weird for to see gay people drunk, and sometinmes i forget im gay, but then i remember, but it bugs me that i sometimes dont have thenaccent because it woulb be
funny as hell
ok i will stop typing now, because im cant stop laughing and i feel tired.
Wait, being skinny means getting drunk faster? How does that work?
Nebulon Ranger ＮＩＣＥＫＩＬＬＭＡＣＧＲＥＥ
Jul 19, 2011
Likes Received:
Weird, Espy. I expected a Stuck joke from you.
^Ugh, tell me about it. I was about to make one but >scumbag brain decided to forget all my Homestuck knowledge because lolexams. I got good grades, though, but still, would have liked to be able
to have at least some HS facts on my fingertiips...
But since you asked for it...
Spaught, you muct be Roxy's long lost brother—or love interest. *SHOT*
Jul 19, 2011
Likes Received:
Chatting with drunks is fun, though.
Nebulon Ranger ＮＩＣＥＫＩＬＬＭＡＣＧＲＥＥ
Jul 19, 2011
Likes Received:
You will never forget this thread, Walker.
Jul 19, 2011
Likes Received:
Spaught you should come chat after you've gotten drunk again so we can compare how you act~
Eebit the past still wants me
Jul 19, 2011
Likes Received:
bumped 5ever
CerberusLycan Keeper of Havoc and Hell
May 17, 2012
Likes Received:
I like how drunken people are a Grammar Nazi's worst nightmare.
I still want to know why being skinny means getting drunk faster.
Also I never understood the teenage fascination (nor do I the adult fascination) for alcohol and drugs. Someone kindly explain.
Jul 19, 2011
Likes Received:
First part- something about metabolism, I think.
Second- psychology and sociology both told me that in the teenage years, human brains make decisions primarily based on emotion rather than sense and experience. At our age, we're in what is
supposedly our most "vulnerable" state as far as suggestibility goes. Hence peer pressure. It's also a symbol of rebelling, which most (normal) teenagers find appeal in, the need to let ourselves
make our own mistakes, and the need to experiment and build up our own experiences.
Mystletainn An Actual Posting Member
Jan 4, 2013
Likes Received:
I always thought it was because those dombe people loved being high, something which I don't personally like, </3 I've had alcohol once accidentally and got high, and vomitted very soon. I
definitely did not like that... | {"url":"https://zejroleplaying.org/index.php?threads/am-drunk-when-this-post-happened.866/","timestamp":"2024-11-12T19:41:07Z","content_type":"text/html","content_length":"93184","record_id":"<urn:uuid:aff50ae6-d9da-4c05-aed0-851b15a3b3bc>","cc-path":"CC-MAIN-2024-46/segments/1730477028279.73/warc/CC-MAIN-20241112180608-20241112210608-00124.warc.gz"} |
Slater determinants
I am having some time these days to catch up on the basics [1]. This could therefore be another dry mathematical post. On the other hand: you may have been wondering all your life what exchange
interaction was. Then this is your chance, in case you are open minded when it comes to looking at a few summation signs and angle brackets.
Wave functions are typically built on spin
molecular orbitals
, u
(i), i=(x
, y
, z
, m
) (i.e. "i" is an abbreviation for the 4 coordinates from last post). MOs are functions that involve one electron. To get a multielectron function we could put each electron into an MO and multiply
the functions:
In these functions electrons are
statistically independent
, therefore also
(which is a weaker statement).
The product would violate the
Pauli principle
. In order to comply with it, we introduce a
Slater determinant
This is the explicit form of a determinant. You form the sum of all possible products with electrons in different orbitals with an appropriate sign (-1 or 1). (
is the symmetric group of all permutations;
definition of sgn
In a Slater determinant, electrons are not stastically independent anymore. But "correlation" usually means going beyond the formation of a Slater determinant.
Let's evaluate a matrix element between two Slater determinants.
All the orbitals are taken out of an orthonormal system. We will notice that the determinant vanishes unless most of the orbitals are equals. Hence we arrange the orbital in a way that equal orbitals
are moved up front. Let p orbitals be equal.
The operator A shall be a sum of similar 1- and 2-electron operators:
Now we can write down the equation:
Because of linearity, we can take out the summations
Because of the antisymmetry, the integrals for all the electrons are the same
Now if you look at it as a multiple integrals, you will notice that you can take out all the functions that are not affected by the operator. (<...> means the integral over the respective
configurational space)
You notice that most of the orbitals have to be the same, in order for those products not to vanish. How to go on and where the spin comes in, next time.
[1] It kind of helped that I broke my hand on my first snowboarding day this year ... There's still going to be february.
3 comments:
Ψ*Ψ said...
Ouch, broken hand! Hope it heals quickly.
Felix said...
thanks, it's not so bad
it only sucks that i can not go snowboarding. and it's difficult to open food packages :)
This comment has been removed by a blog administrator. | {"url":"https://chemical-quantum-images.blogspot.com/2008/01/slater-determinants.html","timestamp":"2024-11-12T13:20:00Z","content_type":"application/xhtml+xml","content_length":"79305","record_id":"<urn:uuid:c30df636-012b-4157-a976-86f3a17a7846>","cc-path":"CC-MAIN-2024-46/segments/1730477028273.45/warc/CC-MAIN-20241112113320-20241112143320-00339.warc.gz"} |
Resource: plot_domain
Resource plot_domain
Overview Sets the plotting domain
Command Line -pd=domain
Environment Variable wxpdomain
Possible Values
Default Value program dependent, mostly "us"
The plot_domain resource is used to specify the exact domain to plot the data or contour the grid. This resource specifies the projection, location, aspect ratio of the plot, and the size of the
• proj - The projection.
MAP PROJECTIONS
□ ll or lat - latitude-longitude
□ ps or polar - polar stereographic
□ me or merc - mercator
□ lc or lamb - lambert conformal
□ mo - mollweide
□ or - orthographic
□ sat - satellite
NON-MAP PROJECTIONS
□ XY
□ XlogY
□ category
□ skewt
□ stuve
□ therm
□ hodo
□ vert
□ polar
• param - A colon ":" delimited list of projection specific parameters. The parameters are:
Any number of these can be specified. plat and plon define the projection latitude and longitude. tlat1 and tlat2 are the true latitudes for the projection. factor is the map factor necessary to
give true distances in 100s km for the projection. This is required for finite differencing and is somewhat arbitrary.
• clat,clon - For map projections, this is the central latitude and longitude of the domain. The clat,clon can be replaced with "id:station" where the latitude and longitude are read in from a city
database file (sao.cty by default). If you want to use a different database file, you need to specify it "id:database_file:station".
For non-map projections, this represents the coordinate of the lower left corner of the domain.
• nx,ny - Specifies the number of grid points or pixels in each direction. For non-grid plots, this acts as the aspect ratio of the domain as nx-1 to ny-1. The default is 25,17 which gives a region
with an aspect ratio of 3 to 2. This can be useful in the case where overlays might need to be drawn where the underlying data or image does not adhere to the true projection coordinate system.
This is especially true of satellite images where the height of a scan line is not equal to the width of each picture element and therefore dx cannot be equal to dy to give a proper projection.
Also, the number of gridpoints is used to scale wind vector length. The longest wind vector is scaled to one grid distance. (OPTIONAL, DEFAULT: 25,17)
For map projections, this is the number of gridpoints in each direction. For non-map projections, this is just the aspect ratio and does not go into the domain size computation.
• dx,dy - Specifies the domain size based on the nx,ny parameters. The larger the value, the larger the domain. For map projections, this is the grid spacing in the X and Y direction. The full
domain size is (nx-1)*dx by (ny-1)*dy. In some cases, this can be used to correct for unequal distances. This is especially true of satellite images where the width of one element on a scan line
is not equal to the height on the scan line.
For non-map projections, this is strictly the size in X and Y. The origin is defined by clat,clon.
Specifying the Domain
There are several ways to specify the domain. Not all of the above parameters need to be specified in order for the program to know what to plot
│Parameters to specify │Assumed values for others │
│proj,plon,clat,clon,nx,ny,dx,dy │ │
│proj:params,clat,clon,nx,ny,dx,dy │ │
│proj,plon,clat,clon,dx,dy │nx=25,ny=17 │
│proj,clat,clon,nx,ny,dx │dy=dx │
│proj,clat,clon,dx,dy │nx=25,ny=17 │
│proj,clat,clon,dx │nx=25 ny=17 dy=dx │
│clat,clon,nx,ny │proj=ps dx=1.2 dy=1.2 │
│clat,clon,dx │proj=ps nx=25 ny=17 dy=dx │
│size,nx,ny │used for images │
│proj,clat,clon │nx=25 ny=17 dx=1.2 dy=1.2 │
│clat,clon │proj=ps nx=25 ny=17 dx=1.2 dy=1.2 │
│file:region │look up domain in file │
│region │look up domain in wxp.reg file │
│proj │null projection │
NOTE: clat,clon can be replaced by id:xxx
Selecting a Domain for a Map Projection
In selecting a plot domain, first determine the center latitude and longitude of the domain. This is centered on some meteorological event such as a low pressure system or on a station of interest.
Next, determine the rough size of the domain to capture all the data of interest. This is done by estimating the horizontal size of the domain in kilometers and dividing by 100*(nx-1) to get dx and
dy. By default, most plots use nx,ny of 25x17. So in other words, a value of 2400 can be use as the divisor. This makes a value of 1 for dx,dy adequate for regional plots and a value of just larger
than 2 adequate for the continental US. This is a rough computation because different projections will yield slightly different domain sizes. Finally, adjust the aspect ratio of the plot by changing
the nx,ny parameters. These may not need to be changed unless the domain is square or oblong. Here are some examples:
│ 39,-97,2.3 │ United States │
│ id:KORD,.5 │ Small region centered over Chicago │
│ ll,0,0,37,19,10 │ The whole globe on a lat-lon projection │
│ ps,90,-90,8 │ Northern hemisphere │
│ sat:0:-75,34.95,-82.95,640,427,0.108,0.095 │ Satellite image projection. The satellite is centered over 75W and the image is centered at 34.95,-82.95. The nx,ny specify the image size which is │
│ │ 640x427. The dx,dy specify the distance between pixels in projection coordinates. In most satellite image cases, these values will not be equal. │
Selecting a Domain for a non-Map Projection
In selecting a plot domain, first determine the coordinate of the lower left coordinate of the domain and that will be clat and clon. For simplicity, X is latitude and Y is longitude in this
specification. Next determine the rough size of the domain to capture all the data of interest. The X distance is dx and the Y dy. Finally, adjust the aspect ratio of the plot by changing the nx,ny
parameters. Remember 2,2 is the smallest possible value here.
│ xy,-10,0,20,10 │ XY plot ranging from -10 to 10 in X and 0 to 10 in Y │
│ cat,0,0,10,75 │ Category plot, plotting first 11 items with a Y range of 0 to 75 │
Last updated Mar 5, 1998 | {"url":"https://wxp.vietorweather.net/resource/plot_domain","timestamp":"2024-11-05T16:32:49Z","content_type":"text/html","content_length":"9952","record_id":"<urn:uuid:99bda34d-996e-4e5e-854d-240732779140>","cc-path":"CC-MAIN-2024-46/segments/1730477027884.62/warc/CC-MAIN-20241105145721-20241105175721-00161.warc.gz"} |
topological space
I did some rewriting of the Idea section, keeping (or in some cases slightly rearranging) phrases with words like “cohesion” and “cohere”, but eliminating some others which I thought could be
confusing, per discussion above.
diff, v52, current
(Over three years later, but first time seeing #2.) Honestly, I don’t think that word is likely to be helpful; indeed, I think it’s likely going to confuse some people such as mdiamond. In general,
the Idea section looks simultaneously overworked and full of fluff.
added link to ionad
diff, v51, current
Could someone clarify what the word "respond" means in the context of the
topological space
entry? The text explains topological equivalence by referring to the way a space "responds" to open intervals. I realize that our definitions of words have to bottom-out somewhere, but I feel like
clarifying the meaning of this word would help me (and possibly others) to grasp the fundamental essence of topological spaces and what "topological equivalence" means. Is there a technical way to
describe what it denotes here?
I tried to prettify the entry topological space a bit more:
• made an attempt at adding an Idea-section (feel free to work on that, it’s just a quick idea motivated more from the desire to have such a section at all than from an attempt to do it any
• collected the three Definition-sections to subsections of a single Definition-section
• polished and expanded the Standard definition section.
Currently we have the sentence, “The definition of topological space was a matter of some debate, especially about 100 years ago. Our definition is due to Bourbaki, so may be called Bourbaki spaces.”
Is it? Due to Bourbaki? And not, say, Kuratowski in 1922, predating even the existence of Bourbaki by more than a decade? Besides that, I have never heard anyone refer to topological spaces as
“Bourbaki spaces”.
The definition of topological space dates back to Hausdorff in 1914 in his *Principles of set theory*.
The sentence about calling these structures “Bourbaki spaces” was added by Toby Bartels in the 2nd revision of the page:
The 1914 definition is for Hausdorff topological spaces. Kuratowski was the first one to drop the Hausdorff axiom.
The definition of topological space was a matter of some debate, especially about 100 years ago. Our definition is due to Bourbaki, so may be called Bourbaki spaces.
The definition of topological space used in this article involving neighbourhoods was first developed by Felix Hausdorff in 1914 in his seminal text on set theory and topology, Fundamentals of Set
Theory (Grundzüge der Mengenlehre).
diff, v55, current
Added sentence
Hausdorff’s definition originally contained the $T_2$-separation axiom, which was removed by Kazimierz Kuratowski in 1922 resulting in the current defintion of topological space.
diff, v55, current
I made some of this history more precise, and did some smoothing of the narrative under Variations. I will add references later.
diff, v56, current
added more hyperlinks to technical terms in the first few paragraphs.
Inserted a sentence early on which highlights that most notions of spaces in math have underlying topological spaces (the sentence could easily be expanded further).
also made some mild edits to the wording and formatting in the first few paragraphs
diff, v57, current
Is there a name for a topological space where the open sets are only closed under countable unions rather than arbitrary unions?
Did some work on the definitions section, which was a little rough in places. Saving for the moment.
diff, v59, current
Re #14: not that I can think of at the moment, but in many cases, just having closure under countable unions is enough to guarantee closure under arbitrary unions. These fall under the ambit of
countability axioms (first countable space, second countable space, which I am liable to mix up which is which).
Maybe $\sigma$-topological space? $\sigma$ is used to indicate countable unions or joins in various other topological and measure theoretic structures, such as $\sigma$-locale, $\sigma$-frame, $\
sigma$-algebra, $\sigma$-complete lattice, $\sigma$-continuous valuation, et cetera.
Sure, that name would naturally suggest itself, but googling that term doesn’t seem to turn up anything of direct relevance to your question. My guess is that’s probably not because no one has ever
considered it, but rather because it’s never led to anything significant.
(Especially in the old days of the nLab, people would experiment and noodle around a little more than I see now. Witness the existence of the Boolean rig article, seemingly a side curiosity.)
Well, well, well. Just goes to show me, I guess.
Guest, could I ask you to make notes here at the nForum of your nLab edits, as the little window that opens up when you edit invites you to do? You just enter in a brief description of what you did,
and hit Submit.
Oh, sorry about that, never mind. I see you did that on other articles (which I hadn’t seen while I was looking around at what you did), just not this article.
Sorry about that, I forgot to write what i did in the summary for this article. The only thing I did here was add a link to the $\sigma$-topological space article in the Related Concepts section.
added requirement that the unions be $U$-small in dependent type theory, as one cannot quantify over arbitrary types, only the $U$-small types relative to a universe $U$
diff, v64, current
I have made the !include of the list of references come out by adding vertical whitespace to it
diff, v65, current
Added fact that relational beta-modules and topological spaces are only equivalent to each other if the ultrafilter principle is true.
diff, v67, current
Added a link to pretopological space in related concepts section
diff, v73, current | {"url":"https://nforum.ncatlab.org/discussion/4118/topological-space/?Focus=84111","timestamp":"2024-11-14T10:34:08Z","content_type":"application/xhtml+xml","content_length":"78808","record_id":"<urn:uuid:91a9d74c-e40e-4b59-8e46-e67594644d2d>","cc-path":"CC-MAIN-2024-46/segments/1730477028558.0/warc/CC-MAIN-20241114094851-20241114124851-00143.warc.gz"} |
Practical Research On Solving Physics Exercises Based On Problem Solving Theory
Posted on:2021-01-27 Degree:Master Type:Thesis
Country:China Candidate:C G Zhang Full Text:PDF
GTID:2427330623480554 Subject:Subject teaching
Learning physics is difficult for high school students,and the teaching of solving physics exercises is the most important part.This paper investigates the current situation of physics-exercise
teaching and students' ability to solve physics exercises through the questionnaire,in high schools of Jiutai City.The results show that students' ability to solve physics exercises still cannot
reach a high standard,although teachers teach attentively and students study hard.To improve the efficiency of physics-exercise teaching and the students' ability to solve physics exercises,this
paper employs problem-solving theory into solving physics exercises and proposes strategies for solving high-school physics problems which is based on problem-solving theory,after consulting the
relevant literature on the problem-solving theory and the application of problem-solving theory in the teaching.By comparing the pre-experimental tests and post-experimental tests,students'
problem-solving ability is found to be improved,which proves that the problem-solving strategies proposed in this paper are effective for improving the teaching efficiency.The combination of theory
and practice shows that the strategies proposed in this paper is feasible.This paper conceives five parts:i.This chapter is introduction which states the current status of problem-solving theory,the
significance of the topic and the research methods.ii.The method of the questionnaire is applied in this chapter which is to investigate the situation of physics exercise teaching in senior high
school.Besides,the ability to solve physics problems of senior-high-school students is also investigated.iii.The strategies of solving the physics exercises is proposed in this chapter,which is based
on the problem-solving theory.iv.The practice of solving physics exercises is demonstrated,which is based on the theory of problem-solving.v.The Conclusion.
Keywords/Search Tags: physics exercise teaching, problem solving theory, teaching strategy, senior high school physics | {"url":"https://www.globethesis.com/?t=2427330623480554","timestamp":"2024-11-02T14:27:59Z","content_type":"application/xhtml+xml","content_length":"8081","record_id":"<urn:uuid:92e08d6f-da96-4a51-819f-f231dfb00d84>","cc-path":"CC-MAIN-2024-46/segments/1730477027714.37/warc/CC-MAIN-20241102133748-20241102163748-00412.warc.gz"} |
Learning with Kernels on Graphs: DAG-based kernels, data streams and RNA function prediction.
Navarin, Nicolò
Learning with Kernels on Graphs: DAG-based kernels, data streams and RNA function prediction.
, [Dissertation thesis], Alma Mater Studiorum Università di Bologna. Dottorato di ricerca in
, 26 Ciclo. DOI 10.6092/unibo/amsdottorato/6578.
Documenti full-text disponibili:
Documento PDF (English) - Richiede un lettore di PDF come Xpdf o Adobe Acrobat Reader
Download (2MB) | Anteprima
In many application domains data can be naturally represented as graphs. When the application of analytical solutions for a given problem is unfeasible, machine learning techniques could be a viable
way to solve the problem. Classical machine learning techniques are defined for data represented in a vectorial form. Recently some of them have been extended to deal directly with structured data.
Among those techniques, kernel methods have shown promising results both from the computational complexity and the predictive performance point of view. Kernel methods allow to avoid an explicit
mapping in a vectorial form relying on kernel functions, which informally are functions calculating a similarity measure between two entities. However, the definition of good kernels for graphs is a
challenging problem because of the difficulty to find a good tradeoff between computational complexity and expressiveness. Another problem we face is learning on data streams, where a potentially
unbounded sequence of data is generated by some sources. There are three main contributions in this thesis. The first contribution is the definition of a new family of kernels for graphs based on
Directed Acyclic Graphs (DAGs). We analyzed two kernels from this family, achieving state-of-the-art results from both the computational and the classification point of view on real-world datasets.
The second contribution consists in making the application of learning algorithms for streams of graphs feasible. Moreover,we defined a principled way for the memory management. The third
contribution is the application of machine learning techniques for structured data to non-coding RNA function prediction. In this setting, the secondary structure is thought to carry relevant
information. However, existing methods considering the secondary structure have prohibitively high computational complexity. We propose to apply kernel methods on this domain, obtaining
state-of-the-art results.
In many application domains data can be naturally represented as graphs. When the application of analytical solutions for a given problem is unfeasible, machine learning techniques could be a viable
way to solve the problem. Classical machine learning techniques are defined for data represented in a vectorial form. Recently some of them have been extended to deal directly with structured data.
Among those techniques, kernel methods have shown promising results both from the computational complexity and the predictive performance point of view. Kernel methods allow to avoid an explicit
mapping in a vectorial form relying on kernel functions, which informally are functions calculating a similarity measure between two entities. However, the definition of good kernels for graphs is a
challenging problem because of the difficulty to find a good tradeoff between computational complexity and expressiveness. Another problem we face is learning on data streams, where a potentially
unbounded sequence of data is generated by some sources. There are three main contributions in this thesis. The first contribution is the definition of a new family of kernels for graphs based on
Directed Acyclic Graphs (DAGs). We analyzed two kernels from this family, achieving state-of-the-art results from both the computational and the classification point of view on real-world datasets.
The second contribution consists in making the application of learning algorithms for streams of graphs feasible. Moreover,we defined a principled way for the memory management. The third
contribution is the application of machine learning techniques for structured data to non-coding RNA function prediction. In this setting, the secondary structure is thought to carry relevant
information. However, existing methods considering the secondary structure have prohibitively high computational complexity. We propose to apply kernel methods on this domain, obtaining
state-of-the-art results.
Altri metadati
Statistica sui download | {"url":"http://amsdottorato.unibo.it/6578/","timestamp":"2024-11-05T07:11:21Z","content_type":"application/xhtml+xml","content_length":"41040","record_id":"<urn:uuid:34b27186-b537-42ad-9051-0df59640ba91>","cc-path":"CC-MAIN-2024-46/segments/1730477027871.46/warc/CC-MAIN-20241105052136-20241105082136-00754.warc.gz"} |
product of factors of 100 Archives -
Factor Formula | How To Find Product of All Factors of a Number Hi Students, Welcome to Amans Maths Blogs (AMB). You learnt the concepts as 'How to Find Number of Factor of Any Number', 'How to Find
Number of Even Factors', 'How to Find Number of Odd Factors', 'How to
Read More | {"url":"https://www.amansmathsblogs.com/tag/product-of-factors-of-100/","timestamp":"2024-11-05T10:41:28Z","content_type":"text/html","content_length":"94154","record_id":"<urn:uuid:36616ea3-1c19-4ac0-8c79-f405902f6a03>","cc-path":"CC-MAIN-2024-46/segments/1730477027878.78/warc/CC-MAIN-20241105083140-20241105113140-00531.warc.gz"} |
Book review: LaTeX Graphics with TikZ by Stefan Kottwitz
Book review: LaTeX Graphics with TikZ by Stefan Kottwitz
Posted by LianTze on July 26, 2023
Note: LianTze was one of the technical reviewers for Stefan Kottwitz’s second edition of LaTeX Beginner’s Guide, reviewed here.
TikZ is an immensely powerful LaTeX package for creating diagrams and graphics. TikZ has grown immensely popular since its first release in 2005, and there are now many other LaTeX packages that
are based on it. This includes dedicated packages for drawing specific kinds of diagrams: tikz-cd, tikz-feynman, chemfig, etc.; as well as classes and packages that use TikZ to enhance various
typesetting elements: beamer, tcolorbox, etc. Its underlying system is called PGF (a "portable graphics format" for TeX), so you may also see "pgf" in articles that discuss TikZ.
The TikZ/pgf package manual itself is chock full of information, contains all definitive references of various features and capabilities of TikZ, and includes 5 guided tutorials that simulate
specific scenarios. But at 1271 pages with an additional 50 pages of indices, it can be hard to navigate, and isn't exactly easy to digest in a couple of afternoons. That’s where LaTeX Graphics
with TikZ by Stefan Kottwitz comes in. With 272 pages of main content, the book is easier to navigate and digest. The full package manual is still indispensable as a reference, for looking up
specific commands and options; but Stefan's book may be more accessible for readers with some LaTeX background who want to learn TikZ.
Stefan's new book employs his usual style of illustrating a concept with practical code examples. The book is printed in full-colour; an e-book version is available. I personally also find the
code examples to be easier to read compared to Stefan's previous book — the grey background was a bit too dark for my eyes.
All code examples from this book are available at TikZ.org; and you can open the entire code bundle as a single project on Overleaf using this link.
Personally I categorise this book's chapters into 3 categories: fundamentals, common graphic design software operations in TikZ, and special TikZ packages. These break down as follows:
Fundamentals (Chapters 1–6)
□ Basic syntax of TikZ
□ Coordinate systems
□ Nodes and edges — fundamental building blocks in TikZ
□ Styles and pics
□ Trees and graphs
Even if you're familiar with TikZ, it may still be worth revisiting these chapters. TikZ has had many new developments, and while the core syntax is unchanged, there may be some new extensions
that are pleasantly surprising e.g. the "quotes" syntax.
Another thing that impressed me: Stefan doesn't shy away from mentioning advanced level packages like tikzpeople and tikzlings this early in the book, as long as they help to explain certain
concepts like anchors of different node shapes. (These packages are discussed in more detail later on in the book.)
Common graphic design software operations, but with TikZ (Chapters 7–12)
If you're familiar with graphic design software like Illustrator or Photoshop, you would be familiar with these common operations — which you can do in LaTeX, too, by coding with TikZ.
□ Filling, clipping, and shading paths; decorations, layers, overlays, transparency
☆ Explains important computer graphics concepts, such as the nonzero and even odd rules, with simple examples and language
☆ Layers, overlays: Remember that we're really doing typesetting with LaTeX so combining concepts like layers, path decorations, overlays etc with typeset material including math
expressions can yield very aesthetically pleasing results — both from a graphical and a typesetting point of view.
□ Coordinate and path calculations
□ Canvas and coordinate transformations
□ Drawing curves, including Bézier curves and splines
Special TikZ packages (Chapters 13–15)
As we said at the beginning, TikZ is a very versatile and powerful package. So many libraries and packages have been built upon it for drawing and plotting specialised kinds of diagrams with
specialized syntax.
□ pgfplots: a very versatile package for plotting mathematical functions and data points
□ smartdiagrams: a lá ‘SmartArt’ feature in Microsoft Office programs; but with easy-to-write code
□ And finally — have fun drawing with TikZ!
☆ tikzpeople: provides people-shaped nodes in the style of Microsoft Visio clip art, to be used with TikZ.
☆ tikzlings: like tikzpeople, but for drawing cute creatures
☆ jigsaw: drawing jigsaw pieces
☆ tikzbricks: drawing Lego-like bricks
☆ …and more!
Considerations when using TikZ on Overleaf
TikZ is very powerful. Including many TikZ drawings in your Overleaf project, especially if they're complex and/or use huge datasets, can take a lot of compiling resources: this can sometimes
lead to compile timeouts in your Overleaf projects. If that happens, you may want to consider these suggestions. | {"url":"https://de.overleaf.com/blog/book-review-latex-graphics-with-tikz-by-stefan-kottwitz","timestamp":"2024-11-11T08:41:30Z","content_type":"text/html","content_length":"43226","record_id":"<urn:uuid:d4338573-64e0-479b-b339-13095d460b18>","cc-path":"CC-MAIN-2024-46/segments/1730477028220.42/warc/CC-MAIN-20241111060327-20241111090327-00368.warc.gz"} |
Economists’ proto-scientific methodology
Comment on Lars Syll on ‘Axiomatics — the economics fetish’
When the promoters of the so-called social sciences, which have produced not much of real scientific value in the last 2300 years, wreck their brains about the methodology of the genuine sciences,
which started with the simple Law of the Lever and arrived in the meantime at the field equations of mass-space-time, the situation instantaneously becomes comical.
Heterodox economists, in particular, cannot see how axiomatics could help in the development of economic theory. They simply do not want to start research with some abstract axioms but with concrete
facts. What they miss is the difference between the development and the representation of a theory.
Of course, Newton did not first write down a set of axioms and then started to think about gravitation. But after he had figured out the Law of Gravitation (by thinking about falling bodies under the
apple tree, as folklore has it) he demonstrated in his
how this Law could be logically derived from the elementary axioms of motion just like the Pythagorean theorem had been derived from Euclid’s axioms.
“... it was ... [this] quality that struck readers of the
. At the head of Book I stand the famous
Axioms, or the Laws of motion
: …
For readers of that day, it was this deductive, mathematical aspect that was the great achievement
.” (Truesdell, quoted in Schmiechen, 2009, p. 213)
In his statements about methodology “... Newton had insisted on the certainty of an approach founded on rigorous method.” (Westfall, 2008, p. 346)
In view of Newton’s overwhelming success, this message was well received in the so-called social sciences: “Like most of his fellow moral philosophers, Hume thought it was worth a try to make all
sciences as rigorous as Newtonian physics ...” (Redman, 1997, p. 111)
Eventually, the message hit economics: “His [Adam Smith’s] method is always the method of Newton, which we have already seen applied to psychology and morals: to attain, by generalization, certain
simple truths, from which it will be possible to reconstruct, synthetically, the world of experience.” (Halévy, 1960, p. 100)
Basically, this idea is sound. In fact, it is identical to Einstein’s methodology: “The basic concepts and laws which are not logically further reducible constitute the indispensable and not
rationally deducible part of the theory. It can scarcely be denied that the supreme goal of all theory is to make the irreducible basic elements as simple and as few as possible without having to
surrender the adequate representation of a single datum of experience.” (1934, p. 165)
What Einstein describes here is nothing else than what in mathematics is called axiomatization. To recall, Einstein cooperated with Hilbert who was the towering figure of axiomatics at that time and
instrumental in the formulation of the field equations. Modern physics is unthinkable without the prior move from Euclidean to non-Euclidean axioms.
No physicist would ever think of axiomatics as a fetish. Every time he uses a piece of mathematics the physicist indirectly benefits from axiomatics without thinking or talking much about it.
Axiomatics is only a more formal expression for the physicists' idea of the formulation of a unified theory.
“Some day, when physics is complete and we know all the laws, we may be able to start with some axioms, and no doubt somebody will figure out a particular way of doing it so that everything else can
be deduced.” (Feynman, 1992, p. 50)
Thus, axiomatics has always been, in a direct or indirect way, the physicists' great helper. In marked contrast, economists since Adam Smith messed things up. In our days, Orthodoxy got the axiomatic
foundations of general equilibrium theory wrong and Heterodoxy has none at all. This methodological slapstick performance produced a heap of incoherent, contradictory, inconsistent models with no
counterpart whatsoever in the real world.
Clearly, Walrasianism, Keynesianism, Marxianism, and Austrianism have to give way to an axiomatically unified economic theory — the sooner, the better.
Egmont Kakarot-Handtke
Einstein, A. (1934). On the Method of Theoretical Physics. Philosophy of Science, 1(2): 163–169.
Feynman, R. P. (1992). The Character of Physical Law. London: Penguin.
Halévy, E. (1960). The Growth of Philosophic Radicalism. Boston,: Beacon Press.
Redman, D. A. (1997). The Rise of Political Economy as Science. Methodology and the Classical Economists. Cambridge, London: MIT Press.
Schmiechen, M. (2009). Newton’s Principia and Related ‘Principles’ Revisited, volume 1. Norderstedt: Books on Demand BoD, 2nd edition.
Westfall, R. S. (2008). Never at Rest. A Biography of Isaac Newton. Cambridge: Cambridge University Press, 17th edition.
Related '
Axiomatics — the heterodox bugbear
The universe and the goldfish bowl, on Jan 22
On Geoff Davis
Einstein worked 10 years on the field equations, which describe — roughly speaking — the universe, and you argue “On the other hand, sometimes a rough back of the envelope calculation is all the
mathematics you need to check whether your hypothesis compares well with observations or not.”
Of course, if you want to describe the goldfish bowl the back of the envelope is all you need. Your argument is a bit silly. Why don’t you tell the guys who are working hard on string theory that you
can do it on an envelope and without the Schrödinger equation?
The most important thing is to be clear about the subject matter. Economics is about how the (world-) economy works, it is not about the mom-and-pop store which every half-baked consultant can easily
overlook and model with a spreadsheet.
What we are talking about here is Debreu’s axiomatization of General Equilibrium which is a Walrasian total model and not a Marshallian partial (goldfish bowl) model.
By the way, with every back-of-the-envelope calculation, you benefit
from the axiomatization of algebra and geometry. But this is usually beyond the bowl horizon of engineers and hobby economists.
On Asad Zaman
You argue rather confused:
(i) “The scientific method arose as a rejection of the axiomatic method used by the Greeks for scientific methodology.”#1
(ii) “Human behavior cannot be axiomatized.” (preceding post)
While (ii) is correct (i) is provably false; see my refutation on the parallel thread.#2
From (ii) follows that the DSGE approach has to be abandoned because it is based on a behavioral axiom. As Krugman put it on his blog “most of what I and many others do is sorta-kinda neoclassical
because it takes the maximization-and-equilibrium world as a starting point.” Constrained optimization is a behavioral axiom (=starting point) of DSGE and as such methodologically inadmissible.#3
From the fact that Orthodoxy badly messed up axiomatization does
follow that (i) the axiomatic-deductive method has been abandoned in the genuine sciences, and (ii) that the method is a priori inapplicable in economics.
What instead follows is that the neo-Walrasian axioms have to be
“There is another alternative: to formulate a completely new research program and conceptual approach. As we have seen, this is often spoken of, but there is still no indication of what it might
mean.” (Ingrao et al., 1990, p. 362)
There is only one way for Heterodoxy to beat Orthodoxy and this is a
Paradigm Shift
, i.e. the replacement of orthodox axioms with heterodox axioms. To denounce the axiomatic-deductive method as a fetish is a sure indicator of scientific incompetence. The fact of the matter is that
the axiomatic-deductive method is Heterodoxy’s most powerful tool — if applied properly for the formulation of a ‘ completely new research program and conceptual approach’.
The current state of economics is this: Orthodoxy got the axiomatic foundations wrong and Heterodoxy has none at all. Is anyone surprised that economics is a failed science? Is anyone aware that
economic policy proposals have no sound scientific foundation? And with orthodox and heterodox economists who have at best a commonsensical goldfish-bowl-model of how the economy works, is anyone
surprised that economic problems cannot be solved but only worsened or shifted?
Ingrao, B., and Israel, G. (1990). The Invisible Hand. Economic Equilibrium in the History of Science. Cambridge, London: MIT Press.
Lars P Syll Blog
Full methodological illiteracy
Lars Syll creatively destructs Wren-Lewis
The methodology of confused agenda pushers, comment on Geoff Davies of Jan 23
You mix up two issues that are related but need to be kept apart in order to get out of the swamp between true/false where blathering is rife.
With regard to precision, it is well-known that there are different degrees of precision in different walks of life, e.g. theoretical physics and engineering, therefore “... the following maxim holds
for all sciences: Never aim at more precision than is required by the problem at hand. (Popper, quoted in Redman, 1993, p. 105)
This settles the matter because in a monetary economy, we have a natural precision of two decimal places. This translates into the rule to express every economic statement about the nominal sphere in
rational numbers. This, in turn, is sufficient to debunk Debreu’s approach which presupposes the real number space: “Unfortunately, we are stuck with the need to justify the use of irrational numbers
such as square-root2, pi or e as economically meaningful prices and/or quantities.” (Nadal, 2004, p. 36)
In rather general terms we can agree that the use of irrational numbers is what Keynes called mock precision. On the other hand, one should not be content with a precision of less than two decimal
places for nominal relationships.
Precision indeed relates to the question of axiomatization because Debreu’s axioms are defined in the rational number space, but the precision of concepts like income or profit is something different
from numerical precision. The crucial point is that from vague premises any conclusion and the opposite can be derived and this is a senseless exercise: “Meanwhile, the best safeguard against
overestimation of the range of applicability of economic propositions is a careful spelling out of the premises on which they rest. Precision and rigor in the statement of premises and proofs can be
expected to have a sobering effect on our beliefs about the reach of the propositions we have developed.” (Hutchison, 1960, p. xxiii)
To repeat: numerical precision and ‘precision and rigor in the statement of premises’ are related but fundamentally different things.
The difference between political economists (= agenda pushers) and theoretical economists (= scientists) is that the former plead for ‘better vaguely right than precisely wrong’ and the latter plead
for ‘better precisely right than vaguely wrong’. After all, political economists want to make their case here and now and are not so much interested in epistemic truth. Economics since Adam Smith is
political economics and political economics is scientifically worthless.
It becomes a bit boring to reiterate that there is a difference between mathematics and physics or any other science. It is well-known among methodologists that “Formal axiomatic systems must be
interpreted in some domain ... to become an empirical science.” (Boylan et al., 1995, p. 198)
And, lo and behold, this is what genuine scientists always have done with overwhelming success “It is clear that the system of concepts of axiomatic geometry alone cannot make any assertions as to
the relations of real objects of this kind, which we will call practically-rigid bodies. To be able to make such assertions, geometry must be stripped of its merely logical-formal character by the
co-ordination of real objects of experience with the empty conceptual framework of axiomatic geometry. To accomplish this, we need only add the proposition: — Solid bodies are related, with respect
to their possible dispositions, as are bodies in Euclidean geometry of three dimensions. Then the propositions of Euclid contain affirmations as to the relations of practically-rigid bodies.”
(Einstein, 1921)
The scientific incompetence of economists consists of taking the nonentities ‘maximization-and-equilibrium’ (Krugman) as axioms that are not by any stretch of the imagination related to anything in
the real world. It should be pretty obvious to Zaman and you#1
that the axiomatic-deductive method works only if the premises are
“certain, true, and primary” (Aristotle), otherwise garbage-in-garbage-out. In more concrete terms: from the ‘maximization-and-equilibrium’ garbage follows the DSGE garbage, and this is
the fault of the axiomatic-deductive method.
Boylan, T. A., and O’Gorman, P. F. (1995). Beyond Rhetoric and Realism in Economics. Towards a Reformulation of Economic Methodology. London: Routledge.
Einstein, A. (1921). Geometry and Experience. Website.
Hutchison, T.W. (1960). The Significance and Basic Postulates of Economic Theory. New York: Kelley.
Nadal, A. (2004). Behind the Building Blocks. Commodities and Individuals in General Equilibrium Theory. In F. Ackerman, and A. Nadal (Eds.), The Flawed Foundations of General Equilibrium, 33–47.
London, New York: Routledge.
Redman, D. A. (1993). Economics and the Philosophy of Science. New York, Oxford: Oxford University Press.
#1 For more refutation go to my
and enter Zaman in the search field
Can’t get out behind the curve?, comment on larrymotuz of Jan 25
You say: “The ‘truth’ content of axioms cannot be proven.” WOW, YES, this is exactly what axiom means and this should be known to every economist for more than 200 years: “What are the propositions
which may reasonably be received without proof? That there must be some such propositions all are agreed, since there cannot be an infinite series of proof, a chain suspended from nothing. But to
determine what these propositions are, is the
opus magnum
of the more recondite mental philosophy.” (Mill, 2006, p. 746)
And here you have it in a nutshell: both Orthodoxy and Heterodoxy have failed at the opus magnum. That is the core of the whole methodological mess.
The fact that axioms need something like empirical proof has not escaped genuine scientists (which excludes economists) “This indicates that any attempt logically to derive the basic concepts and
laws of mechanics from the ultimate data of experience is doomed to failure. If then it is the case that the axiomatic basis of theoretical physics cannot be an inference from experience, but must be
free invention, have we any hope that we shall find the correct way?” (Einstein, 1934, pp. 166-167)
To your knowledge, genuine scientists (which excludes economists) have found the correct way and it has been clearly defined as scientific methodology: “Research is in fact a continuous discussion of
the consistency of theories: formal consistency insofar as the discussion relates to the logical cohesion of what is asserted in joint theories; material consistency insofar as the agreement of
observations with theories is concerned.” (Klant, 1994, p. 31)
It seems that Zaman, Davies, Motuz, and all the other hobby economists/retired engineers simply cannot get their heads around the most elementary methodological concept or even to look it up in
: “An axiom or postulate as defined in classic philosophy, is a statement that is so evident or well-established, that it is accepted without controversy or question. Thus, the axiom can be used as
the premise or starting point for further reasoning or arguments ... The word comes from the Greek axíōma ‘that which is thought worthy or fit’ or ‘that which commends itself as evident.’
The fact of the matter is that for more than 200 years economic axioms are
worthy or fit. And this is why economics is a failed science.
Einstein, A. (1934). On the Method of Theoretical Physics. Philosophy of Science, 1(2): 163–169.
Klant, J. J. (1994). The Nature of Economic Thought. Aldershot, Brookfield: Edward Elgar.
Mill, J. S. (2006). Principles of Political Economy With Some of Their Applications to Social Philosophy, Vol. 3, Books III-V of Collected Works of John Stuart Mill. Indianapolis: Liberty Fund.
Deep in the methodological woods, comments
(i) On Geoff Davies of Jan 26
This thread is about axiomatics. You say ‘Numerical precision is very context-dependent, so it’s pointless making general statements.’ This is (i) trivially true and (ii) far beside the point, which
is conceptual precision/consistency of foundational propositions of theories and
the numerical precision of empirical estimations.
(ii) On Paul Schächterle of Jan 26
As a rule, the proof of axioms is in the deductively derived conclusions. If what the theory says should be the case is actually the case, then the axioms are indirectly corroborated. If not, they
are refuted qua modus tollens. “Whether an axiom is or is not valid can be ascertained either through direct experimentation or by verification through the result of observations, or, if such a thing
is impossible, the correctness of the axiom can be judged through the indirect method of verifying the laws which proceed from the axiom by observation or experimentation. (If the axiom is deemed to
be incorrect it must be modified or instead a correct axiom must be found.) (Morishima, 1984, p. 53)
All this is well-known since Newton: “Could all the phaenomena of nature be deduced from only thre [sic] or four general suppositions there might be great reason to allow those suppositions to be
true.” (quoted in Westfall, 2008, p. 642)
For more proof of Zaman’s and your insufficient understanding of axiomatics see: ‘
Full methodological illiteracy
(iii) Methodological junk since Jevons/Walras/Menger
The axioms (= premises = starting point = foundational propositions) of standard economics, that is, “most of what I and many others do is sorta-kinda neoclassical because it takes the
maximization-and-equilibrium world as a starting point” (Krugman), are
pure methodological junk
, yet Heterodoxy has not managed for more than 140 years to replace them. The methodological incompetence of both orthodox and heterodox economists is abysmal. For details see
Are economists natural-born scientific failures?
Economics as fool’s paradise
Morishima, M. (1984). The Good and Bad Use of Mathematics. In P. Wiles, and G. Routh (Eds.), Economics in Disarray, 51–73. Oxford: Blackwell.
Westfall, R. S. (2008). Never at Rest. A Biography of Isaac Newton. Cambridge: Cambridge University Press, 17th edition.
Economists and methodology: the horror of all horrors | {"url":"https://axecorg.blogspot.com/2016/01/economists-slapstick-methodology.html","timestamp":"2024-11-12T05:12:32Z","content_type":"text/html","content_length":"173517","record_id":"<urn:uuid:95b63351-0b29-463c-beae-42c784d44c82>","cc-path":"CC-MAIN-2024-46/segments/1730477028242.58/warc/CC-MAIN-20241112045844-20241112075844-00605.warc.gz"} |
Comments on Subsection 1.5.2
Go back to the page of Subsection 1.5.2.
There are currently no comments on Subsection 1.5.2.
There are also:
• 15 comment(s) on Chapter 1: The Language of $\infty $-Categories
Post a comment
Your email address will not be published. Required fields are marked.
In your comment you can use Markdown and LaTeX style mathematics (enclose it like $\pi$). A preview option is available if you wish to see how it works out (just click on the eye in the toolbar).
In order to prevent bots from posting comments, we would like you to prove that you are human. You can do this by filling in the name of the current tag in the following input field. As a reminder,
this is tag 005H. The letter 'O' is never used.
The tag you filled in for the captcha is wrong. You need to write 005H, in case you are confused. | {"url":"https://kerodon.net/tag/005H/comments","timestamp":"2024-11-05T05:48:13Z","content_type":"text/html","content_length":"13260","record_id":"<urn:uuid:bb95c100-b0f5-401f-87b0-62f1201aa5aa>","cc-path":"CC-MAIN-2024-46/segments/1730477027871.46/warc/CC-MAIN-20241105052136-20241105082136-00715.warc.gz"} |
Patterns and Algebraic Thinking (K-3)
Patterns and Algebraic Thinking
1. A-Plus Math (Varsity Tutors) – https://www.varsitytutors.com/aplusmath – Interactive math resources for teachers, parents, and students featuring free math worksheets, math games, math
flashcards, and more. (The interactive worksheets also have a print option.)
2. BetterLesson – Lesson ideas in the section called “Algebra”.
3. Dad’s Worksheets – https://www.dadsworksheets.com/ – The worksheets below concentrate on patterns and algebraic thinking in some way. Take a look at the main website to see if there are other
worksheets for the subject you are teaching.
□ Hundreds Charts – Every hundreds chart you could imagine! If you’re teaching basic counting, number sense or rounding, you can use a number chart like one of these to build math skills.
□ Number Lines – The number line PDFs on this page include various ranges (10, 12, 15, 20, 15 and 100) in both starting from zero as well as negative ranges.
□ Number Patterns – The number patterns worksheets for basic operations.
□ Arithmetic Sequences – Practice finding the common difference for a sequence of numbers or finding arbitrary nth terms in an arithmetic sequence given its formula definition.
4. Development and Research in Early Math Education (DREME) – http://prek-math-te.stanford.edu/patterns-algebra – Making sense of and describing patterns paves the way for early algebraic reasoning.
5. Formative Loop – https://formativeloop.com/ – Provide Gr. 1-8 students with five-minute math drills each day. Daily exercises are generated for each day of the week and are based on individual
student progress. View the reports to find out if any kids are struggling, and provide remedial instruction as needed.
6. Gizmos – https://www.explorelearning.com/ – Find the perfect Gizmo to get your students ready for success with Patterns and Algebraic Thinking in Grade 3. Manage your classes and assess your
grade 3-12 students in one place. Make planning easy with customizable, expert lesson materials.
7. Help Teaching – https://www.helpteaching.com/free-math-worksheet-game-generators.htm – Quickly generate printable arithmetic worksheets for drilling and practice! Just set the difficulty, problem
type, and number of questions desired, and generate a worksheet that can be downloaded or printed.
8. iSmartboard.com – Use these Smart Board games, activities and lessons to learn about Adding, Subtracting, Number Facts, Whole Numbers, Patterning and Algebra. Note: Lots of ads to deal with on
the page and everything is lumped into one listing.
9. Khan Academy – https://www.khanacademy.org/ – The most fundamental branch of math is having a clear idea on number sense and numeration. It consists of understanding place values and basic
10. MathsChase – https://www.mathschase.com/ – They use Al to suggest questions to best test your ability, and it will advance as you become more skilled. Has over a 100 different tests covering a
huge range of maths skills for K-6 students. Monitor your progress and get awards for completing differents games and levels.
11. Math Seeds – https://www.3plearning.com/software/mathseeds/ – Develops beginning numeracy skills with captivating activities covering number sense, addition, subtraction, and multiplication for
K-4 students. Get the most out of class time with simple and teacher-friendly software.
12. Mathsframe – There are both worksheets and games available for each section involving number sense below:
13. Math Worksheets 4 Kids – https://www.mathworksheets4kids.com/patterns.php – Picture pattern worksheets contain repeating pattern, growing pattern, size, shapes and color pattern, equivalent
pattern, cut-paste activities and more. Number pattern worksheets contain reading patterns on number lines, showing the rule, increasing and decreasing pattern, writing the rules, geometric
pattern, pattern with two-rules and more.
14. National Council of Teachers of Mathematics (NCTM) – Most of the very helpful classroom resources and activities are for members only but there are a few lessons and activities (through
Illuminations) that can be aqccessed without a membership.
15. New South Wales Government – Education – Patterns and Algebra section – Algebra is a branch of mathematics that deals with general statements of relations, utilising letters and other symbols to
represent specific sets of numbers and values and their relationships to one another. Patterns are important in the early stages of the development of algebraic thinking. Some very good
suggestions on how to attack these disciplines starting in the primary grades.
16. NRICH (Number Patterns) – https://nrich.maths.org/9944 and https://nrich.maths.org/9972 – The activities in this collection encourage children to create, recognise, extend and explain number
patterns. Read the article for more information to find out why these particular tasks were selected.
17. PBS Learning Media – K-8 Mathematics ranges from counting cardinal numbers to linear equations and functions. Students can review the calculation of area, find the area of combined shapes and can
be assessed on their understanding using Khan Academy. Similar units can be created on topics such as lines and angles, probability models, and the multiplication and division of fractions. Make
sure to use the filter to isolate the right grade.
18. Reflex Math – https://www.reflexmath.com/ – Using fact families and delivering the right facts at the right time for each individual student, it meets students where they are. It is adaptive and
individualized to work for grades 2-6 students with different needs, skills and goals.
19. Texas Instruments – This directory of K-5 resources will likely involve some form of Texas Instruments technology but the classroom activities certainly will be different from the normal process
of teaching patterns and algebraic thinking.
20. Times Tables Rock Stars – https://ttrockstars.com/ – It can be used in the classroom as whole-group instruction, a math center, or homework. Multiplication facts can be assigned to the whole
class or individual students and adjustments can be made in the student setup section. Both print worksheets or online interactions are available.
Although there is a charge to use the actual program, the interactive tools tab is free
and can be very useful in the classroom.
21. Worksheet Genius – Ready-made worksheets in different areas of number sense:
22. WorksheetWorks – A collection of worksheet generators that provide various quick and easy worksheets when something is needed for K-6 students in a pinch.
□ Basic Math Facts – addition, subtraction, multiplication, division and mixed operations.
23. Xtra Math – https://home.xtramath.org/ – An online math fact fluency program that helps students develop quick recall and automaticity of their basic math facts. Students with a strong foundation
of basic math facts will have an easier time when they begin to tackle more advanced math, like fractions or algebra.
Articles to Assist You… | {"url":"https://thetravelingpencil.com/patterns-and-algebraic-thinking-k-3","timestamp":"2024-11-08T09:05:40Z","content_type":"text/html","content_length":"111082","record_id":"<urn:uuid:c3c202e5-d53f-4731-83cf-882421653202>","cc-path":"CC-MAIN-2024-46/segments/1730477028032.87/warc/CC-MAIN-20241108070606-20241108100606-00627.warc.gz"} |
The Earth's geoid is Potato shaped
This video is no April's fool joke: Earth really is shaped like a potato. However, the shape that you see here is, um, slightly exaggerated to highlight its irregularities.
Another caveat: what is depicted here is not the shape of the planet, but rather the shape of an idealized sea-level surface extending around the entire globe—a surface that Earth scientists call the
The video is the most accurate reconstruction of the geoid to date, and was released by the European Space Agency at a scientific meeting in Munich on March 31 (see a video of the related press
conference here).
It is based on data collected by ESA's Gravity Field and Steady-State Ocean Circulation Explorer (GOCE). The five-meter long, arrowhead-shaped probe has been in a low orbit for almost exactly two
years, collecting painstakingly accurate measurements of the gravitational field of Earth.
Alas, many of the Web sites and blogs that reported on GOCE's results so far got it wrong. Contrary to what was stated in these reports, the geoid is not a surface on which the strength of gravity is
the same at every point.
The geoid is, in the words of an oceanographer on the GOCE team, a surface such that if you placed a marble anywhere on it, it would stay there rather than rolling in any direction. Another way of
saying it is, imagine you were an engineer traveling around the world with a level.
Then wherever you go, the level would be exactly parallel to the geoid at that place. Yet another equivalent definition: it is a surface that's everywhere perpendicular to the direction of a
plumb-bob, or in other words, to the gravitational field.
Gravity need not have the same strength everywhere on the geoid. In other words, if you could walk on the geoid you would see gravity always pointing exactly downwards, but your weight could slightly
change from one region to another.
The misunderstanding may have stemmed from the confusion of two concepts from multivariable calculus: a vector field and its potential. The vector field in this case is the gravity field, and the
potential is the gravitational potential (which is essentially the gravitational energy of a unit mass).
At any point in space, the gravity field can be seen as the direction in which the gravitational potential rises fastest. Its magnitude, or length, is the rate of change of the potential. The field
defined this way is called the gradient vector field of the potential.
In general, the gradient of a quantity defined in space is the 3-D version of the derivative of a quantity in the sense of single-variable calculus. (To be pedantic: for historical reasons, the
gravity field is defined to be the opposite vector to the gradient of the potential.)
If you were to follow a gravitational field line—a curve which is at every point tangent to the vector field at that point—you would follow a curve of steepest ascent on the gravitational potential.
That's why it is called the gradient. (Note that because of inertia, the field lines of the gravitational field are not necessarily the trajectories of a body in free fall. The field won't tell you
in which direction you'll be moving—only in which direction you will accelerate.)
Gradient vector fields are difficult to grasp in 3-D, because picturing the potential (to visualize the ascent or descent) would require a fourth dimension. But a 2-D analogy might help.
Think of how water trickles down a hilly surface. Neglecting inertia, a droplet of water would follow a curve of steepest descent, which is a vector field made of vectors along the surface.
In this analogy, the elevation of the droplet is the analogue of the potential at that point. And the analogue of the geoid is an elevation contour on a topographical map: the potential—the height—is
constant along the contour. Obviously, some parts of this contour can be on steep terrain, whereas others can be on mild gradients. (On a topographical map, the slope is steeper where many different
contour lines are crowded together.)
The magnitude of the gradient vector field—which represents the steepness of a slope—is not the same at all points of the contour.
Thus, gravity does change in strength along the geoid, and so the geoid is not "a shape where the gravity is the same no matter where you stood on it," as one blogger put it.
Nor is it "how the Earth would look like if its shape were distorted to make gravity the same everywhere on its surface," as reported by a major news site, which went on to add that "areas of
strongest gravity are in yellow and weakest in blue," apparently not noticing the contradiction with the previous sentence.
More information here at
Scientific America
No comments: | {"url":"http://bowshooter.blogspot.com/2011/04/earths-geoid.html","timestamp":"2024-11-04T07:25:15Z","content_type":"application/xhtml+xml","content_length":"84221","record_id":"<urn:uuid:064ff805-4ed6-4386-a78d-364170798e24>","cc-path":"CC-MAIN-2024-46/segments/1730477027819.53/warc/CC-MAIN-20241104065437-20241104095437-00050.warc.gz"} |
Suggestions - Page 21
Quote from: Member#36 on February 25, 2011, 02:44:58 AM
Quote from: Aiko-chan on February 24, 2011, 11:33:35 PM
But the "f" bomb?
If you have a problem with the post, talk (respectfully) to the moderator who edited it. (It's at the bottom of the post.) But while doing this, please keep in mind he/she is just trying to do
their job.
yea, we are after all, all human....
I think.... | {"url":"https://www.niwanetwork.org/forums/index.php?topic=43.400","timestamp":"2024-11-11T21:05:41Z","content_type":"text/html","content_length":"94750","record_id":"<urn:uuid:2996007a-388f-4742-bc00-e22cf8f6226b>","cc-path":"CC-MAIN-2024-46/segments/1730477028239.20/warc/CC-MAIN-20241111190758-20241111220758-00308.warc.gz"} |
When calculating with square matrices, can you also replace the matrix with its determinant? - Techzle
If you have a square matrix (for example A=
and you want to show that this matrix is a zero of the polynomial P(x)=
can you also do this by calculating the determinant of the matrix A and filling this number into the polynomial function?
Or is that just a coincidence in this case?
Asker: Brunhilde, 44 years old
First, when we say that matrix A satisfies x^2 -4x – 5, we mean that
AA – 4A – 5 I[n] = 0n[]
where the unit matrix I[n ] is and 0[n] the zero matrix (so not the number zero)
The fact that the determinant also satisfies this is a coincidence.
I give two counterexamples where it is not the case.
1) Take for example the 2×2 matrix A = [2 0; 0 2]so the double of the unit matrix
it satisfies the simple equation x – 2 = 0
However, its determinant is 4, and does not satisfy this equation
2) Conversely, this determinant of course satisfies the equation x – 4 = 0
but then again the matrix does not comply.
Now it is true that a square matrix always satisfies its own characteristic equation. That’s the Cayley-Hamilton theorem. You may have heard about that in connection with matrices and determinants.
After all, the characteristic equation p(λ)= 0 is : determinant (A – λ . I) = 0
Answered by
prof.dr. Paul Hellings
Department of Mathematics, Fac. IIW, KU Leuven
Catholic University of Leuven
Old Market 13 3000 Leuven | {"url":"https://techzle.com/when-calculating-with-square-matrices-can-you-also-replace-the-matrix-with-its-determinant","timestamp":"2024-11-04T11:54:28Z","content_type":"text/html","content_length":"248733","record_id":"<urn:uuid:3f0d28d6-7320-4e0c-a12b-738d03083367>","cc-path":"CC-MAIN-2024-46/segments/1730477027821.39/warc/CC-MAIN-20241104100555-20241104130555-00641.warc.gz"} |
[QSMS Seminar 14,16 Dec] A brief introduction to differential graded Lie algebras I, II
• Date : 12월 14일(화), 16일(목) 16:00-17:30
• Place : Zoom (ID: 642 675 5874)
• Speaker : 조창연 (QSMS, SNU)
• Title : A brief introduction to differential graded Lie algebras I, II
• Abstract : The importance of differential graded Lie algebras goes back at least to Quillen’s rational homotopy theory, which also motivated their applications to deformation theory. Later, such
an idea was developed further by Deligne, Drinfeld, and Feigin, and influenced many including Kontsevich and Soibelman. The purpose of these talks is to give a short introduction to the notion of
differential graded Lie algebras and its relationship to deformation theory. These talks are intended to be an elementary introduction to the subject, but due to the current nature of it, I’ll
say something about the theory of infinity-categories. The first talk will be devoted to exploring some of the fundamentals of differential graded Lie algebras and infinity-categories, and the
application to deformation theory will be covered in the later half of the second talk. | {"url":"https://qsms.math.snu.ac.kr/index.php?mid=board_sjXR83&listStyle=viewer&order_type=desc&l=en&document_srl=2055&page=2","timestamp":"2024-11-09T03:02:54Z","content_type":"text/html","content_length":"21090","record_id":"<urn:uuid:9fdf0d39-e1c5-4ed9-8a11-993d85b7750c>","cc-path":"CC-MAIN-2024-46/segments/1730477028115.85/warc/CC-MAIN-20241109022607-20241109052607-00440.warc.gz"} |
Skip Counting Teaching Resources
Explore printable skip counting worksheets and skip counting charts for your primary classroom to help students understand number patterns and build a strong maths foundation.
Created by Aussie teachers for teachers like you, every resource in this maths teaching collection has been reviewed by the expert teacher team at Teach Starter to ensure it's ready for your lesson
plan and your students. Aligned with the Australian curriculum, each printable and digital resource has been carefully selected to be included in this collection.
Explore digital and printable resources designed around skip counting by 2, skip counting by 5, skip counting by 10, and more.
New to teaching this section of the maths curriculum, or just looking for some fresh ideas for how to teach skip counting? Read on for a primer from our teacher team!
What Is Skip Counting? A Kid-Friendly Definition
Are you teaching students how to skip count and looking for a simple way to explain the concept? Here's a definition from our teacher team to help!
Skip counting is a method of counting that involves adding or subtracting a specific number other than 1 to/from the previous number in a list.
It gets its name because we 'skip' numbers in this maths technique rather than naming off numbers one by one.
For example, when skip counting by 2s, we may start with 1, but we don't say 2 next. Instead, we move directly to 3, then 5, then 7, and so on. We counting, but we are 'skipping' over the numbers 2,
4, 6, and so on.
When skip counting, we can can count by 2s, 3s, 4s, 5s, 6s, 7s, 8s, 9s, 10s, and so on. This counting method can start at 0 or 1 or further down the number line.
How to Teach Skip Counting and Why It's Important
Skip counting may sound like it's meant to make maths fun — and there's certainly fun to be had in the engaging activities our teacher team has created for your classroom! — but this skill plays an
important role in building number sense and laying the groundwork for young students to be successful at multiplication later in primary school.
The goal is to help students better understand the number system and how numbers relate to each other. By 'skipping' the numbers, kids can understand quantities increasing or decreasing by a constant
Skip counting is also crucial in helping students to recognise patterns in numbers and develop their fluency with numbers.
But how do you teach skip counting? Here are some of our teacher team's tips on how to teach skip counting:
1. Practise Skip Counting From Different Starting Points — You can skip count from 0, from 1, from 5, or just about anywhere. By starting at different points in the number line, students become more
familiar with a variety of numbers and start to recognise patterns.
2. Count Backward and Forward — Counting isn't just a forward process. It can go backward too!
3. Make It Fun — Practice skip counting regularly with your class using any of the fun skip counting activities created by our teacher team, from puzzles to scoot and counts. (Keep reading for ways
to make this happen!)
Skip Counting Activities — Fun Ideas From Our Teacher Team
This collection is full of games, task cards and more to make skip counting fun, but we didn't stop there! Here are some more fun ideas from our teacher team to inspire you!
1. Bring Out the Beach Ball — Play a game of passing the ball while students practise their skip counting. Assign one student to start, and hand them the beach ball. Provide them with a number and
the multiple (for example, if you're practicing skip counting by 10s, you might start with 10). Students then pass the ball to one another, and the student who has the ball has to provide the
next number in the sequence.
2. Play a Count on Circle Game — Have your students stand in a circle. Assign a student to start the game. Call out a number, then have students go around in the circle, skip counting until everyone
gets a chance.
3. Take Advantage of Your 'Lost' Time — Lining students up to go to the tuckshop? Before you leave the classroom, you can practise skip counting — go down the line and have them skip count forward
and backward.
4. Pop It — Grab a popping bubble toy to reinforce their skip counting skills! Students can push down on the bubbles by multiples.
Show more
□ Location
□ availability
□ file formats
□ publishers
32 of 61 teaching resources for those 'aha' moments | {"url":"https://www.teachstarter.com/au/learning-area/skip-counting/","timestamp":"2024-11-08T22:06:41Z","content_type":"text/html","content_length":"521854","record_id":"<urn:uuid:a5e9d9c9-9f3d-4746-ab5f-d63286ccd922>","cc-path":"CC-MAIN-2024-46/segments/1730477028326.66/warc/CC-MAIN-20241113040054-20241113070054-00833.warc.gz"} |
Giulio Malavolta
Giulio Malavolta
Time-Lock Puzzles with Efficient Batch Solving Abstract
Time-Lock Puzzles (TLPs) are a powerful tool for concealing messages until a predetermined point in time. When solving multiple puzzles, it becomes crucial to have the ability to \emph{batch-solve}
puzzles, i.e., simultaneously open multiple puzzles while working to solve a \emph{single one}. Unfortunately, all previously known TLP constructions equipped for batch solving have been contingent
upon super-polynomially secure indistinguishability obfuscation, rendering them impractical in real-world applications. In light of this challenge, we present novel TLP constructions that offer
batch-solving capabilities without using heavy cryptographic hammers. Our proposed schemes are characterized by their simplicity in concept and efficiency in practice, and they can be constructed
based on well-established cryptographic assumptions based on pairings or learning with errors (LWE). Along the way, we introduce new constructions of puncturable key-homomorphic PRFs both in the
lattice and in the pairing setting, which may be of independent interest. Our analysis benefits from an interesting connection to Hall's marriage theorem and incorporates an optimized combinatorial
approach, enhancing the practicality and feasibility of our TLP schemes. Furthermore, we introduce the concept of ``rogue-puzzle attacks", wherein maliciously crafted puzzle instances may disrupt the
batch-solving process of honest puzzles. In response, we demonstrate the construction of concrete and efficient TLPs designed to thwart such attacks.
Software with Certified Deletion Abstract
Is it possible to prove the deletion of a computer program after having executed it? While this task is clearly impossible using classical information alone, the laws of quantum mechanics may admit a
solution to this problem. In this work, we propose a new approach to answer this question, using quantum information. In the interactive settings, we present the first fully-secure solution for blind
delegation with certified deletion, assuming post-quantum hardness of the learning with errors (LWE) problem. In the non-interactive settings, we propose a construction of obfuscation with certified
deletion, assuming post-quantum iO and one-way functions. Our main technical contribution is a new deletion theorem for subspace coset states [Vidick and Zhang, EUROCRYPT'21, Coladangelo et al.,
CRYPTO'21], which enables a generic compiler that adds the certified deletion guarantee to a variety of cryptographic primitives. In addition to our main result, this allows us to obtain a host of
new primitives, such as functional encryption with certified deletion and secure software leasing for an interesting class of programs. In fact, we are able for the first time to achieve a stronger
notion of secure software leasing, where even a dishonest evaluator cannot evaluate the program after returning it.
Polynomial Commitments from Lattices: Post-Quantum Security, Fast Verification and Transparent Setup Abstract
Polynomial commitment scheme allows a prover to commit to a polynomial $f \in \ring[X]$ of degree $L$, and later prove that the committed function was correctly evaluated at a specified point $x$; in
other words $f(x)=u$ for public $x,u \in \ring$. Most applications of polynomial commitments, e.g. succinct non-interactive arguments of knowledge (SNARKs), require that (i) both the commitment and
evaluation proof are succinct (i.e., polylogarithmic in the degree $L$) - with the latter being efficiently verifiable, and (ii) no pre-processing step is allowed. Surprisingly, as far as plausibly
quantum-safe polynomial commitments are concerned, the currently most efficient constructions only rely on weak cryptographic assumptions, such as security of hash functions. Indeed, despite making
use of the underlying algebraic structure, prior lattice-based polynomial commitments still seem to be much behind the hash-based ones. Moreover, security of the aforementioned lattice constructions
against quantum adversaries was never formally discussed. In this work, we bridge the gap and propose the first (asymptotically and concretely) efficient lattice-based polynomial commitment with
transparent setup and post-quantum security. Our interactive variant relies on the standard (Module-)SIS problem, and can be made non-interactive in the random oracle model using Fiat-Shamir
transformation. In addition, we equip the scheme with a knowledge soundness proof against quantum adversaries which can be of independent interest. In terms of concrete efficiency, for $L=2^{20}$ our
scheme yields proofs of size $2$X smaller than the hash-based \textsf{FRI} commitment (Block et al., Asiacrypt 2023), and $60$X smaller than the very recent lattice-based construction by Albrecht et
al. (Eprint 2023/1469).
Robust Quantum Public-Key Encryption with Applications to Quantum Key Distribution Abstract
Quantum key distribution (QKD) allows Alice and Bob to agree on a shared secret key, while communicating over a public (untrusted) quantum channel. Compared to classical key exchange, it has two main
advantages: (i) The key is unconditionally hidden to the eyes of any attacker, and (ii) its security assumes only the existence of authenticated classical channels which, in practice, can be realized
using Minicrypt assumptions, such as the existence of digital signatures. On the flip side, QKD protocols typically require multiple rounds of interactions, whereas classical key exchange can be
realized with the minimal amount of two messages using public-key encryption. A long-standing open question is whether QKD requires more rounds of interaction than classical key exchange. In this
work, we propose a two-message QKD protocol that satisfies everlasting security, assuming only the existence of quantum-secure one-way functions. That is, the shared key is unconditionally hidden,
provided computational assumptions hold during the protocol execution. Our result follows from a new construction of quantum public-key encryption (QPKE) whose security, much like its classical
counterpart, only relies on authenticated classical channels.
Time-Lock Puzzles from Lattices Abstract
Time-lock puzzles (TLP) are a cryptographic tool that allow one to encrypt a message into the future, for a predetermined amount of time T . At present, we have only two constructions with provable
security: One based on the repeated squaring assumption and the other based on indistinguishability obfuscation (iO). Basing TLP on any other assumption is a long-standing question, further motivated
by the fact that know constructions are broken by quantum algorithms. In this work, we propose a new approach to construct time-lock puzzles based on lattices, and therefore with plausible
post-quantum security. We obtain the following main results: • In the preprocessing model, where a one-time public-coin preprocessing is allowed, we obtain a time-lock puzzle with encryption time log
(T ). • In the plain model, where the encrypter does all the computation, we obtain a time-lock puzzle with encryption time √T . Both constructions assume the existence of any sequential function f ,
and the hardness of the circular small-secret learning with errors (LWE) problem. At the heart of our results is a new construction of succinct randomized encodings (SRE) for T-folded repeated
circuits, where the complexity of the encoding is √T . This is the first construction of SRE where the overall complexity of the encoding algorithm is sublinear in the runtime T , and which is not
based on iO. Using our SRE we directly obtain the first non- interactive RAM delegation scheme with sublinear complexity (in the number of steps T ), again without iO. Finally, we also propose a new
heuristic construction of SREs, and consequently of TLPs, with fully-efficient encoding complexity log(T ). Our scheme is inspired by iO techniques, but carefully sidesteps the regime of zeroizing
attacks that plague lattice-based iO candidates.
Multi-key and Multi-input Predicate Encryption (for Conjunctions) from Learning with Errors Abstract
<jats:title>Abstract</jats:title><jats:p>We put forward two natural generalizations of predicate encryption (PE), dubbed <jats:italic>multi-key</jats:italic> and <jats:italic>multi-input</
jats:italic> PE. More in details, our contributions are threefold.<jats:list list-type="bullet"> <jats:list-item> <jats:p><jats:bold>Definitions.</jats:bold> We formalize security of multi-key PE and
multi-input PE following the standard indistinguishability paradigm, and modeling security both against malicious senders (i.e., corruption of encryption keys) and malicious receivers (i.e.,
collusions).</jats:p> </jats:list-item> <jats:list-item> <jats:p><jats:bold>Constructions.</jats:bold> We construct adaptively secure multi-key and multi-input PE supporting the conjunction of
poly-many arbitrary single-input predicates, assuming the sub-exponential hardness of the learning with errors (LWE) problem.</jats:p> </jats:list-item> <jats:list-item> <jats:p><jats:bold>
Applications.</jats:bold> We show that multi-key and multi-input PE for expressive enough predicates suffices for interesting cryptographic applications, including non-interactive multi-party
computation (NI-MPC) and matchmaking encryption (ME).</jats:p> </jats:list-item> </jats:list> In particular, plugging in our constructions of multi-key and multi-input PE, under the sub-exponential
LWE assumption, we obtain the first ME supporting <jats:italic>arbitrary policies</jats:italic> with unbounded collusions, as well as robust (resp. non-robust) NI-MPC for so-called <jats:italic>
all-or-nothing</jats:italic> functions satisfying a non-trivial notion of reusability and supporting a constant (resp. polynomial) number of parties. Prior to our work, both of these applications
required much heavier tools such as indistinguishability obfuscation or compact functional encryption.</jats:p>
Traitor Tracing without Trusted Authority from Registered Functional Encryption Abstract
Traitor-tracing systems allow identifying the users who contributed to building a rogue decoder in a broadcast environment. In a traditional traitor-tracing system, a key authority is responsible for
generating the global public parameters and issuing secret keys to users. All security is lost if the \emph{key authority itself} is corrupt. This raises the question: Can we construct a
traitor-tracing scheme, without a trusted authority? In this work, we propose a new model for traitor-tracing systems where, instead of having a key authority, users could generate and register their
own public keys. The public parameters are computed by aggregating all user public keys. Crucially, the aggregation process is \emph{public}, thus eliminating the need of any trusted authority. We
present two new traitor-tracing systems in this model based on bilinear pairings. Our first scheme is proven adaptively secure in the generic group model. This scheme features a {\it transparent}
setup, ciphertexts consisting of $6\sqrt{L}+4$ group elements, and a public tracing algorithm. Our second scheme supports a bounded collusion of traitors and is proven selectively secure in the
standard model. Our main technical ingredients are new registered functional encryption (RFE) schemes for quadratic and linear functions which, prior to this work, were known only from
indistinguishability obfuscation. To substantiate the practicality of our approach, we evaluate the performance a proof of concept implementation. For a group of $L = 1024$ users, encryption and
decryption take roughly 50ms and 4ms, respectively, whereas a ciphertext is of size 6.7KB.
Key-Homomorphic and Aggregate Verifiable Random Functions Abstract
A verifiable random function (VRF) allows one to compute a random-looking image, while at the same time providing a unique proof that the function was evaluated correctly. VRFs are a cornerstone of
modern cryptography and, among other applications, are at the heart of recently proposed proof-of-stake consensus protocols. In this work we initiate the formal study of \emph{aggregate VRFs}, i.e.,
VRFs that allow for the aggregation of proofs/images into a small digest, whose size is \emph{independent} of the number of input proofs/images, yet it still enables sound verification. We formalize
this notion along with its security properties and we propose two constructions: The first scheme is conceptually simple, concretely efficient, and uses (asymmetric) bilinear groups of prime order.
Pseudorandomness holds in the random oracle model and aggregate pseudorandomness is proven in the algebraic group model. The second scheme is in the standard model and it is proven secure against the
learning with errors (LWE) problem. As a cryptographic building block of independent interest, we introduce the notion of \emph{key homomorphic VRFs}, where the verification keys and the proofs are
endowed with a group structure. We conclude by discussing several applications of key-homomorphic and aggregate VRFs, such as distributed VRFs and aggregate proof-of-stake protocols.
Unclonable Commitments and Proofs Abstract
Non-malleable cryptography, proposed by Dolev, Dwork, and Naor (SICOMP '00), has numerous applications in protocol composition. In the context of proofs, it guarantees that an adversary who receives
a proof cannot maul it into another valid proof. However, non-malleable cryptography (particularly in the non-interactive setting) suffers from an important limitation: An attacker can always copy
the proof and resubmit it to another verifier (or even multiple verifiers). In this work, we prevent even the possibility of copying the proof as it is, by relying on quantum information. We call the
resulting primitive unclonable proofs, making progress on a question posed by Aaronson. We also consider the related notion of unclonable commitments. We introduce formal definitions of these
primitives that model security in various settings of interest. We also provide a near tight characterization of the conditions under which these primitives are possible, including a rough
equivalence between unclonable proofs and public-key quantum money.
Weakening Assumptions for Publicly-Verifiable Deletion Abstract
We develop a simple compiler that generically adds publicly-verifiable deletion to a variety of cryptosystems. Our compiler only makes use of one-way functions (or one-way state generators, if we
allow the public verification key to be quantum). Previously, similar compilers either relied on indistinguishability obfuscation along with any one-way function (Bartusek et. al., ePrint:2023/265),
or on almost-regular one-way functions (Bartusek, Khurana and Poremba, CRYPTO 2023).
Laconic Function Evaluation for Turing Machines Abstract
Laconic function evaluation (LFE) allows Alice to compress a large circuit C into a small digest d. Given Alice’s digest, Bob can encrypt some input x under d in a way that enables Alice to recover C
(x), without learning anything beyond that. The scheme is said to be laconic if the size of d, the runtime of the encryption algorithm, and the size of the ciphertext are all sublinear in the size of
C. Until now, all known LFE constructions have ciphertexts whose size depends on the depth of the circuit C, akin to the limitation of levelled homomorphic encryption. In this work we close this gap
and present the first LFE scheme (for Turing machines) with asymptotically optimal parameters. Our scheme assumes the existence of indistinguishability obfuscation and somewhere statistically binding
hash functions. As further contributions, we show how our scheme enables a wide range of new applications, including two previously unknown constructions: – Non-interactive zero-knowledge (NIZK)
proofs with optimal prover complexity. – Witness encryption and attribute-based encryption (ABE) for Turing machines from falsifiable assumptions.
Transparent Batchable Time-lock Puzzles and Applications to Byzantine Consensus Abstract
Time-lock puzzles (TLP) are a fascinating type of cryptographic problem that is easy to generate, but takes a certain time to solve, even when arbitrary parallel speedup is allowed. TLPs have
wide-ranging applications including fairness, round efficient computation, and more. To reduce the effort needed to solve large numbers of TLPs, prior work has proposed batching techniques to reduce
the cost of solving. However, these proposals either require: (1) a trusted setup or (2) the puzzle size be linear in the maximum batch size, which implies setting an a priori bound on the maximum
size of the batch. Any of these limitations restrict the utility of TLPs in decentralized and dynamic settings like permissionless blockchains. In this work, we demonstrate the feasibility and
usefulness of a TLP that overcomes all the above limitations using indistinguishability obfuscation to show that there are no fundamental barriers to achieving such a TLP construction. As a main
application of our TLP, we show how to improve the resilience of consensus protocols toward network-level adversaries in the following settings: (1) We show a generic compiler that boosts the
resilience of a Byzantine broadcast protocol $\Pi$ as follows: if $\Pi$ is secure against $t<n$ weakly adaptive corruptions, then the compiled protocol is secure against $t<n$ strongly adaptive
corruptions. Here, `strong' refers to adaptively corrupting a party and deleting messages that it sent while still honest. Our compiler is round and communication preserving, and gives the first
expected constant-round Byzantine broadcast protocol against a strongly adaptive adversary for the dishonest majority setting. (2) We adapt the Nakamoto consensus protocol to a weak model of
synchrony where the adversary can adaptively create minority partitions in the network. Unlike prior works, we do not assume that all honest messages are delivered within a known upper bound on the
message delay. This is the first work to show that it is possible to achieve consensus in the permissionless setting even after relaxing the standard synchrony assumption.
Efficient Laconic Cryptography from Learning With Errors Abstract
Laconic cryptography is an emerging paradigm that enables cryptographic primitives with sublinear communication complexity in just two messages. In particular, a two-message protocol between Alice
and Bob is called \emph{laconic} if its communication and computation complexity are essentially independent of the size of Alice's input. This can be thought of as a dual notion of fully-homomorphic
encryption, as it enables ``Bob-optimized'' protocols. This paradigm has led to tremendous progress in recent years. However, all existing constructions of laconic primitives are considered only of \
emph{theoretical interest}: They all rely on non-black-box cryptographic techniques, which are highly impractical. This work shows that non-black-box techniques are not necessary for basic laconic
cryptography primitives. We propose a \emph{completely algebraic} construction of laconic encryption, a notion that we introduce in this work, which serves as the cornerstone of our framework. We
prove that the scheme is secure under the standard Learning With Errors assumption (with polynomial modulus-to-noise ratio). We provide proof-of-concept implementations for the first time for laconic
primitives, demonstrating the construction is indeed practical: For a database size of $2^{50}$, encryption and decryption are in the order of single digit \emph{milliseconds}. Laconic encryption can
be used as a black box to construct other laconic primitives. Specifically, we show how to construct: \begin{itemize} \item Laconic oblivious transfer \item Registration-based encryption scheme \item
Laconic private-set intersection protocol \end{itemize} All of the above have essentially optimal parameters and similar practical efficiency. Furthermore, our laconic encryption can be preprocessed
such that the online encryption step is entirely combinatorial and therefore much more efficient. Using similar techniques, we also obtain identity-based encryption with an unbounded identity space
and tight security proof (in the standard model).
Multi-key and Multi-input Predicate Encryption from Learning with Errors Abstract
We put forward two natural generalizations of predicate encryption (PE), dubbed multi-key and multi-input PE. More in details, our contributions are threefold. – Definitions. We formalize security of
multi-key PE and multi-input PE following the standard indistinguishability paradigm, and modeling security both against malicious senders (i.e., corruption of encryption keys) and malicious
receivers (i.e., collusions). – Constructions. We construct adaptively secure multi-key and multi-input PE supporting the conjunction of poly-many arbitrary single-input predicates, assuming the
sub-exponential hardness of the learning with errors (LWE) problem. – Applications. We show that multi-key and multi-input PE for expressive enough predicates suffices for interesting cryptographic
applications, including non-interactive multi-party computation (NI-MPC) and matchmaking encryption (ME). In particular, plugging in our constructions of multi-key and multi-input PE, under the
sub-exponential LWE assumption, we obtain the first ME supporting arbitrary policies with unbounded collusions, as well as robust (resp. non-robust) NI-MPC for so-called all-or-nothing functions
satisfying a non-trivial notion of reusability and supporting a constant (resp. polynomial) number of parties. Prior to our work, both of these applications required much heavier tools such as
indistinguishability obfuscation or compact functional encryption.
On Concurrent Multi-Party Quantum Computation Abstract
Recently, significant progress has been made toward quantumly secure multi-party computation (MPC) in the stand-alone setting. In sharp contrast, the picture of concurrently secure MPC (or even 2PC),
for both classical and quantum functionalities, still remains unclear. Quantum information behaves in a fundamentally different way, making the job of adversary harder and easier at the same time.
Thus, it is unclear if the positive or negative results from the classical setting still apply. This work initiates a systematic study of concurrent secure computation in the quantum setting. We
obtain a mix of positive and negative results. We first show that assuming the existence of post-quantum one-way functions (PQ-OWFs), concurrently secure 2PC (and thus MPC) for quantum
functionalities is impossible. Next, we focus on the bounded-concurrent setting, where we obtain simulation-sound zero-knowledge arguments for both NP and QMA, assuming PQ-OWFs. This is obtained by a
new design of simulation-sound gadget, relying on the recent post-quantum non-malleable commitments by Liang, Pandey, and Yamakawa [arXiv:2207.05861], and the quantum rewinding strategy recently
developed by Ananth, Chung, and La Placa [CRYPTO'21] for bounded-concurrent post-quantum ZK. Moreover, we show that our technique is general enough---It also leads to quantum-secure
bounded-concurrent coin-flipping protocols, and eventually general-purpose 2PC and MPC, for both classical and quantum functionalities. All these constructions can be based on the quantum hardness of
Learning with Errors.
Lattice-based Succinct Arguments from Vanishing Polynomials Abstract
Succinct arguments allow a prover to convince a verifier of the validity of any statement in a language, with minimal communication and verifier's work. Among other approaches, lattice-based
protocols offer solid theoretical foundations, post-quantum security, and a rich algebraic structure. In this work, we present some new approaches to constructing efficient lattice-based succinct
arguments. Our main technical ingredient is a new commitment scheme based on \emph{vanishing polynomials}, a notion borrowed from algebraic geometry. We analyse the security of such a commitment
scheme, and show how to take advantage of the additional algebraic structure to build new lattice-based succinct arguments. A few highlights amongst our results are: \begin{enumerate} \item The first
recursive folding (i.e. Bulletproofs-like) protocol for linear relations with \emph{polylogarithmic} verifier runtime. Traditionally, the verifier runtime has been the efficiency bottleneck for such
protocols (regardless of the underlying assumptions). \item The first verifiable delay function (VDF) based on lattices, building on a recently introduced sequential relation. \item The first
lattice-based \emph{linear-time prover} succinct argument for NP, in the preprocessing model. The soundness of the scheme is based on (knowledge)-k-R-ISIS assumption [Albrecht et al., CRYPTO'22]. \
Lattice-Based Timed Cryptography Abstract
Timed cryptography studies primitives that retain their security only for a pre-determined amount of time, such as proofs of sequential work and time-lock puzzles. This feature has proven to be
useful in a large number of practical applications, e.g., randomness generation, sealed-bid auctions, or fair multi-party computation. However, the current state of affairs in timed cryptography is
unsatisfactory: Virtually all efficient constructions rely on a single sequentiality assumption, namely that repeated squaring in unknown order groups cannot be parallelized. This is a single point
of failure in the classical setting and is even false against quantum adversaries. In this work we put forward a new sequentiality assumption, which essentially says that a repeated application of
the standard lattice-based hash function cannot be parallelized. We provide concrete evidence of the validity of this assumption and, to substantiate its usefulness, we show how it enables a new
proof of sequential work, with a stronger sequentiality guarantee than prior hash-based schemes.
Candidate iO from Homomorphic Encryption Schemes Abstract
We propose a new approach to construct general-purpose indistinguishability obfuscation (iO). Our construction is obtained via a new intermediate primitive that we call split fully homomorphic
encryption (split FHE), which we show to be sufficient for constructing iO. Specifically, split FHE is FHE where decryption takes the following two-step syntactic form: (i) a secret decryption step
that uses the secret key and produces a hint which is (asymptotically) shorter than the length of the encrypted message, and (ii) a public decryption step that only requires the ciphertext and the
previously generated hint (and not the entire secret key) and recovers the encrypted message. In terms of security, the hints for a set of ciphertexts should not allow one to violate semantic
security for any other ciphertexts. Next, we show a generic candidate construction of split FHE based on three building blocks: (i) A standard FHE scheme with linear decrypt-and-multiply (which can
be instantiated with essentially all LWE-based constructions), (ii) a linearly homomorphic encryption scheme with short decryption hints (such as the Damgård-Jurik encryption scheme, based on the DCR
problem), and (iii) a cryptographic hash function (which can be based on a variety of standard assumptions). Our approach is heuristic in the sense that our construction is not provably secure and
makes implicit assumptions about the interplay between these underlying primitives. We show evidence that this construction is secure by providing an argument in an appropriately defined oracle
model. We view our construction as a big departure from the state-of-the-art constructions, and it is in fact quite simple.
Registered (Inner-Product) Functional Encryption Abstract
Registered encryption (Garg et al., TCC'18) is an emerging paradigm that tackles the key-escrow problem associated with identity-based encryption by replacing the private-key generator with a much
weaker entity known as the key curator. The key curator holds no secret information, and is responsible to: (i) update the master public key whenever a new user registers its own public key to the
system; (ii) provide helper decryption keys to the users already registered in the system, in order to still enable them to decrypt after new users join the system. For practical purposes, tasks (i)
and (ii) need to be efficient, in the sense that the size of the public parameters, of the master public key, and of the helper decryption keys, as well as the running times for key generation and
user registration, and the number of updates, must be small. In this paper, we generalize the notion of registered encryption to the setting of functional encryption (FE). As our main contribution,
we show an efficient construction of registered FE for the special case of (attribute hiding) inner-product predicates, built over asymmetric bilinear groups of prime order. Our scheme supports a
large attribute universe and is proven secure in the bilinear generic group model. We also implement our scheme and experimentally demonstrate the efficiency requirements of the registered settings.
Our second contribution is a feasibility result where we build registered FE for P/poly based on indistinguishability obfuscation and somewhere statistically binding hash functions.
Two-Round Concurrent 2PC from Sub-Exponential LWE Abstract
Secure computation is a cornerstone of modern cryptography and a rich body of research is devoted to understanding its round complexity. In this work, we consider two-party computation (2PC)
protocols (where both parties receive output) that remain secure in the realistic setting where many instances of the protocol are executed in parallel (concurrent security). We obtain a two-round
concurrent-secure 2PC protocol based on a single, standard, post-quantum assumption: The subexponential hardness of the learning-with-errors (LWE) problem. Our protocol is in the plain model, i.e.,
it has no trusted setup, and it is secure in the super-polynomial simulation framework of Pass (EUROCRYPT 2003). Since two rounds are minimal for (concurrent) 2PC, this work resolves the round
complexity of concurrent 2PC from standard assumptions. As immediate applications, our work establishes feasibility results for interesting cryptographic primitives such as the first two-round
password authentication key exchange (PAKE) protocol in the plain model and the first two-round concurrent secure computation protocol for quantum circuits (2PQC).
Distributed Broadcast Encryption from Bilinear Groups Abstract
Distributed broadcast encryption (DBE) improves on the traditional notion of broadcast encryption by eliminating the key-escrow problem: In a DBE system, users generate their own secret keys non-
interactively without the help of a trusted party. Then anyone can broad- cast a message for a subset S of the users, in such a way that the resulting ciphertext size is sublinear in (and, ideally,
independent of) |S|. Unfor- tunately, the only known constructions of DBE requires heavy crypto- graphic machinery, such as general-purpose indistinguishability obfusca- tion, or come without a
security proof. In this work, we formally show that obfuscation is not necessary for DBE, and we present two practical DBE schemes from standard assumptions in prime-order bilinear groups. Our
constructions are conceptually simple, satisfy the strong notion of adaptive security, and are concretely efficient. In fact, their performance, in terms of number of group elements and efficiency of
the algorithms, is comparable with that of traditional (non distributed) broadcast encryption schemes from bilinear groups.
Weak Zero-Knowledge via the Goldreich-Levin Theorem Abstract
Obtaining three round zero-knowledge from standard cryptographic assumptions has remained a challenging open problem. Meanwhile, there has been exciting progress in realizing useful relaxations such
as weak zero-knowledge, strong witness indistinguishability and witness hiding in two or three rounds. In particular, known realizations from generic assumptions obtain: (1) security against {\em
adaptive} verifiers assuming fully homomorphic encryption among other standard assumptions (Bitansky et. al., STOC 2019), and (2) security against {\em non-adaptive} verifiers in the distributional
setting from oblivious transfer (Jain et. al., Crypto 2017). This work builds three round weak zero-knowledge for NP in the non-adaptive setting from doubly-enhanced injective trapdoor functions. We
obtain this result by developing a new distinguisher-dependent simulation technique that makes crucial use of the Goldreich-Levin list decoding algorithm, and may be of independent interest.
Public-Key Encryption with Quantum Keys Abstract
In the framework of Impagliazzo's five worlds, a distinction is often made between two worlds, one where public-key encryption exists (Cryptomania), and one in which only one-way functions exist
(MiniCrypt). However, the boundaries between these worlds can change when quantum information is taken into account. Recent work has shown that quantum variants of oblivious transfer and multi-party
computation, both primitives that are classically in Cryptomania, can be constructed from one-way functions, placing them in the realm of quantum MiniCrypt (the so-called MiniQCrypt). This naturally
raises the following question: Is it possible to construct a quantum variant of public-key encryption, which is at the heart of Cryptomania, from one-way functions or potentially weaker assumptions?
In this work, we initiate the formal study of the notion of quantum public-key encryption (qPKE), i.e., public-key encryption where keys are allowed to be quantum states. We propose new definitions
of security and several constructions of qPKE based on the existence of one-way functions (OWF), or even weaker assumptions, such as pseudorandom function-like states (PRFS) and pseudorandom
function-like states with proof of destruction (PRFSPD). Finally, to give a tight characterization of this primitive, we show that computational assumptions are necessary to build quantum public-key
encryption. That is, we give a self-contained proof that no quantum public-key encryption scheme can provide information-theoretic security.
Steganography-Free Zero-Knowledge Abstract
We revisit the well-studied problem of preventing steganographic communication in multi-party communications. While this is known to be a provably impossible task, we propose a new model that allows
circumventing this impossibility. In our model, the parties first publish a single message during an honest \emph{non-interactive} pre-processing phase and then later interact in an execution phase.
We show that in this model, it is indeed possible to prevent any steganographic communication in zero-knowledge protocols. Our solutions rely on standard cryptographic assumptions.
Quantum Rewinding for Many-Round Protocols Abstract
We investigate the security of succinct arguments against quantum adversaries. Our main result is a proof of knowledge-soundness in the post-quantum setting for a class of multi-round interactive
protocols, including those based on the recursive folding technique of Bulletproofs. To prove this result, we devise a new quantum rewinding strategy, the first that allows for rewinding across many
rounds. This technique applies to any protocol satisfying natural multi-round generalizations of special soundness and collapsing. For our main result, we show that recent Bulletproofs-like protocols
based on lattices satisfy these properties, and are hence sound against quantum adversaries.
A Note on the Post-Quantum Security of (Ring) Signatures 📺 Abstract
This work revisits the security of classical signatures and ring signatures in a quantum world. For (ordinary) signatures, we focus on the arguably preferable security notion of {\em
blind-unforgeability} recently proposed by Alagic et al.\ (Eurocrypt'20). We present two {\em short} signature schemes achieving this notion: one is in the quantum random oracle model, assuming
quantum hardness of SIS; and the other is in the plain model, assuming quantum hardness of LWE with super-polynomial modulus. Prior to this work, the only known blind-unforgeable schemes are
Lamport's one-time signature and the Winternitz one-time signature, and both of them are in the quantum random oracle model. For ring signatures, the recent work by Chatterjee et al.\ (Crypto'21)
proposes a definition trying to capture adversaries with quantum access to the signer. However, it is unclear if their definition, when restricted to the classical world, is as strong as the standard
security notion for ring signatures. They also present a construction that only {\em partially} achieves (even) this seeming weak definition, in the sense that the adversary can only conduct
superposition attacks over the messages, but not the rings. We propose a new definition that does not suffer from the above issue. Our definition is an analog to the blind-unforgeability in the ring
signature setting. Moreover, assuming the quantum hardness of LWE, we construct a compiler converting any blind-unforgeable (ordinary) signatures to a ring signature satisfying our definition.
Lattice-Based SNARKs: Publicly Verifiable, Preprocessing, and Recursively Composable 📺 Abstract
A succinct non-interactive argument of knowledge (SNARK) allows a prover to produce a short proof that certifies the veracity of a certain NP-statement. In the last decade, a large body of work has
studied candidate constructions that are secure against quantum attackers. Unfortunately, no known candidate matches the efficiency and desirable features of (pre-quantum) constructions based on
bilinear pairings. In this work, we make progress on this question. We propose the first lattice-based SNARK that simultaneously satisfies many desirable properties: It (i) is tentatively
post-quantum secure, (ii) is publicly-verifiable, (iii) has a logarithmic-time verifier and (iv) has a purely algebraic structure making it amenable to efficient recursive composition. Our
construction stems from a general technical toolkit that we develop to translate pairing-based schemes to lattice-based ones. At the heart of our SNARK is a new lattice-based vector commitment (VC)
scheme supporting openings to constant-degree multivariate polynomial maps, which is a candidate solution for the open problem of constructing VC schemes with openings to beyond linear functions.
However, the security of our constructions is based on a new family of lattice-based computational assumptions which naturally generalises the standard Short Integer Solution (SIS) assumption.
Succinct Classical Verification of Quantum Computation 📺 Abstract
We construct a classically verifiable succinct interactive argument for quantum computation (BQP) with communication complexity and verifier runtime that are poly-logarithmic in the runtime of the
BQP computation (and polynomial in the security parameter). Our protocol is secure assuming the post-quantum security of indistinguishability obfuscation (iO) and Learning with Errors (LWE). This is
the first succinct argument for quantum computation in the plain model; prior work (Chia-Chung-Yamakawa, TCC ’20) requires both a long common reference string and non-black-box use of a hash function
modeled as a random oracle. At a technical level, we revisit the framework for constructing classically verifiable quantum computation (Mahadev, FOCS ’18). We give a self-contained, modular proof of
security for Mahadev’s protocol, which we believe is of independent interest. Our proof readily generalizes to a setting in which the verifier’s first message (which consists of many public keys) is
compressed. Next, we formalize this notion of compressed public keys; we view the object as a generalization of constrained/programmable PRFs and instantiate it based on indistinguishability
obfuscation. Finally, we compile the above protocol into a fully succinct argument using a (sufficiently composable) succinct argument of knowledge for NP. Using our framework, we achieve several
additional results, including – Succinct arguments for QMA (given multiple copies of the witness), – Succinct non-interactive arguments for BQP (or QMA) in the quantum random oracle model, and –
Succinct batch arguments for BQP (or QMA) assuming post-quantum LWE (without iO).
Candidate Trapdoor Claw-Free Functions from Group Actions with Applications to Quantum Protocols Abstract
Trapdoor Claw-free Functions (TCFs) are two-to-one trapdoor functions where it is computationally hard to find a claw, i.e., a colliding pair of inputs. TCFs have recently seen a surge of renewed
interest due to new applications to quantum cryptography: as an example, TCFs enable a classical machine to verify that some quantum computation has been performed correctly. In this work, we propose
a new family of (almost two-to-one) TCFs based on conjectured hard problems on isogeny-based group actions. This is the first candidate construction that is not based on lattice-related problems and
the first scheme (from any plausible post-quantum assumption) with a deterministic evaluation algorithm. To demonstrate the usefulness of our construction, we show that our TCF family can be used to
devise a computational test of qubit, which is the basic building block used in general verification of quantum computations.
Everlasting UC Commitments from Fully Malicious PUFs Abstract
Everlasting security models the setting where hardness assumptions hold during the execution of a protocol but may get broken in the future. Due to the strength of this adversarial model, achieving
any meaningful security guarantees for composable protocols is impossible without relying on hardware assumptions (Müller-Quade and Unruh, JoC’10). For this reason, a rich line of research has tried
to leverage physical assumptions to construct well-known everlasting cryptographic primitives, such as commitment schemes. The only known everlastingly UC secure commitment scheme, due to
Müller-Quade and Unruh (JoC’10), assumes honestly generated hardware tokens. The authors leave the possibility of constructing everlastingly UC secure commitments from malicious hardware tokens as an
open problem. Goyal et al. (Crypto’10) constructs unconditionally UC-secure commitments and secure computation from malicious hardware tokens, with the caveat that the honest tokens must encapsulate
other tokens. This extra restriction rules out interesting classes of hardware tokens, such as physically uncloneable functions (PUFs). In this work, we present the first construction of an
everlastingly UC-secure commitment scheme in the fully malicious token model without requiring honest token encapsulation. Our scheme assumes the existence of PUFs and is secure in the common
reference string model. We also show that our results are tight by giving an impossibility proof for everlasting UC-secure computation from non-erasable tokens (such as PUFs), even with trusted
Post-Quantum Multi-Party Computation 📺 Abstract
We initiate the study of multi-party computation for classical functionalities in the plain model, with security against malicious quantum adversaries. We observe that existing techniques readily
give a polynomial-round protocol, but our main result is a construction of *constant-round* post-quantum multi-party computation. We assume mildly super-polynomial quantum hardness of learning with
errors (LWE), and quantum polynomial hardness of an LWE-based circular security assumption. Along the way, we develop the following cryptographic primitives that may be of independent interest: 1.) A
spooky encryption scheme for relations computable by quantum circuits, from the quantum hardness of (a circular variant of) the LWE problem. This immediately yields the first quantum multi-key
fully-homomorphic encryption scheme with classical keys. 2.) A constant-round post-quantum non-malleable commitment scheme, from the mildly super-polynomial quantum hardness of LWE. To prove the
security of our protocol, we develop a new straight-line non-black-box simulation technique against parallel sessions that does not clone the adversary's state. This technique may also be relevant to
the classical setting.
Unbounded Multi-Party Computation from Learning with Errors 📺 Abstract
We consider the problem of round-optimal *unbounded MPC*: in the first round, parties publish a message that depends only on their input. In the second round, any subset of parties can jointly and
securely compute any function $f$ over their inputs in a single round of broadcast. We do not impose any a priori bound on the number of parties nor on the size of the functions that can be computed.
Our main result is a semi-honest two-round protocol for unbounded MPC in the plain model from the hardness of the standard learning with errors (LWE) problem. Prior work in the same setting assumes
the hardness of problems over bilinear maps. Thus, our protocol is the first example of unbounded MPC that is post-quantum secure. The central ingredient of our protocol is a new scheme of
attribute-based secure function evaluation (AB-SFE) with *public decryption*. Our construction combines techniques from the realm of homomorphic commitments with delegation of lattice basis. We
believe that such a scheme may find further applications in the future.
A Geometric Approach to Homomorphic Secret Sharing 📺 Abstract
An (n,m,t)-homomorphic secret sharing (HSS) scheme allows n clients to share their inputs across m servers, such that the inputs are hidden from any t colluding servers, and moreover the servers can
evaluate functions over the inputs locally by mapping their input shares to compact output shares. Such compactness makes HSS a useful building block for communication-efficient secure multi-party
computation (MPC). In this work, we propose a simple compiler for HSS evaluating multivariate polynomials based on two building blocks: (1) homomorphic encryption for linear functions or low-degree
polynomials, and (2) information-theoretic HSS for low-degree polynomials. Our compiler leverages the power of the first building block towards improving the parameters of the second. We use our
compiler to generalize and improve on the HSS scheme of Lai, Malavolta, and Schröder [ASIACRYPT'18], which is only efficient when the number of servers is at most logarithmic in the security
parameter. In contrast, we obtain efficient schemes for polynomials of higher degrees and an arbitrary number of servers. This application of our general compiler extends techniques that were
developed in the context of information-theoretic private information retrieval (Woodruff and Yekhanin [CCC'05]), which use partial derivatives and Hermite interpolation to support the computation of
polynomials of higher degrees. In addition to the above, we propose a new application of HSS to MPC with preprocessing. By pushing the computation of some HSS servers to a preprocessing phase, we
obtain communication-efficient MPC protocols for low-degree polynomials that use fewer parties than previous protocols based on the same assumptions. The online communication of these protocols is
linear in the input size, independently of the description size of the polynomial.
Compact Ring Signatures from Learning With Errors 📺 Abstract
Ring signatures allow a user to sign a message on behalf of a ``ring'' of signers, while hiding the true identity of the signer. As the degree of anonymity guaranteed by a ring signature is directly
proportional to the size of the ring, an important goal in cryptography is to study constructions that minimize the size of the signature as a function of the number of ring members. In this work, we
present the first compact ring signature scheme (i.e., where the size of the signature grows logarithmically with the size of the ring) from the (plain) learning with errors (LWE) problem. The
construction is in the standard model and it does not rely on a trusted setup or on the random oracle heuristic. In contrast with the prior work of Backes \etal~[EUROCRYPT'2019], our scheme does not
rely on bilinear pairings, which allows us to show that the scheme is post-quantum secure assuming the quantum hardness of LWE. At the heart of our scheme is a new construction of compact and
statistically witness-indistinguishable ZAP arguments for NP $\cap$ coNP, that we show to be sound based on the plain LWE assumption. Prior to our work, statistical ZAPs (for all of NP) were known to
exist only assuming \emph{sub-exponential} LWE. We believe that this scheme might find further applications in the future.
How to Build a Trapdoor Function from an Encryption Scheme 📺 Abstract
In this work we ask the following question: Can we transform any encryption scheme into a trapdoor function (TDF)? Alternatively stated, can we make any encryption scheme randomness recoverable? We
propose a generic compiler that takes as input any encryption scheme with pseudorandom ciphertexts and adds a trapdoor to invert the encryption, recovering also the random coins. This universal
TDFier only assumes in addition the existence of a hinting pseudorandom generator (PRG). Despite the simplicity, our transformation is quite general and we establish a series of new feasibility
results: - The first identity-based TDF [Bellare et al. EUROCRYPT 2012] from the CDH assumption in pairing-free groups (or from factoring), thus matching the state of the art for identity-based
encryption schemes. Prior works required pairings or LWE. - The first collusion-resistant attribute-based TDF (AB-TDF) for all ($NC^1$, resp.) circuits from LWE (bilinear maps, resp.). Moreover, the
first single-key AB-TDF from CDH. To the best of our knowledge, no AB-TDF was known in the literature (not even for a single key) from any assumption. We obtain the same results for predicate
encryption. As an additional contribution, we define and construct a trapdoor garbling scheme: A simulation secure garbling scheme with a hidden ``trigger'' that allows the evaluator to fully recover
the randomness used by the garbling algorithm. We show how to construct trapdoor garbling from the DDH or LWE assumption with an interplay of key-dependent message (KDM) and randomness-dependent
message (RDM) techniques. Trapdoor garbling allows us to obtain alternative constructions of (single-key) AB-TDFs with additional desirable properties, such as adaptive security (in the choice of the
attribute) and projective keys. We expect trapdoor garbling to be useful in other contexts, e.g. in case where, upon successful execution, the evaluator needs to immediately verify that the garbled
circuit was well-formed.
Two-Round Maliciously Secure Computation with Super-Polynomial Simulation 📺 Abstract
We propose the first maliciously secure multi-party computation (MPC) protocol for general functionalities in two rounds, without any trusted setup. Since polynomial-time simulation is impossible in
two rounds, we achieve the relaxed notion of superpolynomial-time simulation security [Pass, EUROCRYPT 2003]. Prior to our work, no such maliciously secure protocols were known even in the two-party
setting for functionalities where both parties receive outputs. Our protocol is based on the sub-exponential security of standard assumptions plus a special type of non-interactive non-malleable
commitment. At the heart of our approach is a two-round multi-party conditional disclosure of secrets (MCDS) protocol in the plain model from bilinear maps, which is constructed from techniques
introduced in [Benhamouda and Lin, TCC 2020].
The Round Complexity of Quantum Zero-Knowledge 📺 Abstract
We study the round complexity of zero-knowledge for QMA (the quantum analogue of NP). Assuming the quantum quasi-polynomial hardness of the learning with errors (LWE) problem, we obtain the following
results: - 2-Round statistical witness indistinguishable (WI) arguments for QMA. - 4-Round statistical zero-knowledge arguments for QMA in the plain model, additionally assuming the existence of
quantum fully homomorphic encryption. This is the first protocol for constant-round statistical zero-knowledge arguments for QMA. - 2-Round computational (statistical, resp.) zero-knowledge for QMA
in the timing model, additionally assuming the existence of post-quantum non-parallelizing functions (time-lock puzzles, resp.). All of these protocols match the best round complexity known for the
corresponding protocols for NP with post-quantum security. Along the way, we introduce and construct the notions of sometimes-extractable oblivious transfer and sometimes-simulatable zero-knowledge,
which might be of independent interest.
Rate-1 Quantum Fully Homomorphic Encryption 📺 Abstract
Secure function evaluation (SFE) allows Alice to publish an encrypted version of her input m such that Bob (holding a circuit C) can send a single message that reveals C(m) to Alice, and nothing
more. Security is required to hold against malicious parties, that may behave arbitrarily. In this work we study the notion of SFE in the quantum setting, where Alice outputs an encrypted quantum
state |\psi> and learns C(|\psi>) after receiving Bob's message. We show that, assuming the quantum hardness of the learning with errors problem (LWE), there exists an SFE protocol for quantum
computation with communication complexity (||\psi>|+|C(|\psi>)|)(1+o(1)), which is nearly optimal. This result is obtained by two main technical steps, which might be of independent interest.
Specifically, we show (i) a construction of a rate-1 quantum fully-homomorphic encryption and (ii) a generic transformation to achieve malicious circuit privacy in the quantum setting.
Candidate iO From Homomorphic Encryption Schemes 📺 Abstract
We propose a new approach to construct general-purpose indistinguishability obfuscation (iO). Our construction is obtained via a new intermediate primitive that we call split fully-homomorphic
encryption (split FHE), which we show to be sufficient for constructing iO. Specifically, split FHE is FHE where decryption takes the following two-step syntactic form: (i) A secret decryption step
uses the secret key and produces a hint which is (asymptotically) shorter than the length of the encrypted message, and (ii) a public decryption step that only requires the ciphertext and the
previously generated hint (and not the entire secret key), and recovers the encrypted message. In terms of security, the hints for a set of ciphertexts should not allow one to violate semantic
security for any other ciphertexts. Next, we show a generic candidate construction of split FHE based on three building blocks: (i) A standard FHE scheme with linear decrypt-and-multiply (which can
be instantiated with essentially all LWE-based constructions), (ii) a linearly homomorphic encryption scheme with short decryption hints (such as the Damgard-Jurik encryption scheme, based on the DCR
problem), and (iii) a cryptographic hash function (which can be based on a variety of standard assumptions). Our approach is heuristic in the sense that our construction is not provably secure and
makes implicit assumptions about the interplay between these underlying primitives. We show evidence that this construction is secure by providing an argument in an appropriately defined oracle
model. We view our construction as a big departure from the state-of-the-art constructions, and it is in fact quite simple.
Statistical Zaps and New Oblivious Transfer Protocols 📺 Abstract
We study the problem of achieving statistical privacy in interactive proof systems and oblivious transfer -- two of the most well studied two-party protocols -- when limited rounds of interaction are
available. -- Statistical Zaps: We give the first construction of statistical Zaps, namely, two-round statistical witness-indistinguishable (WI) protocols with a public-coin verifier. Our
construction achieves computational soundness based on the quasi-polynomial hardness of learning with errors assumption. -- Three-Round Statistical Receiver-Private Oblivious Transfer: We give the
first construction of a three-round oblivious transfer (OT) protocol -- in the plain model -- that achieves statistical privacy for receivers and computational privacy for senders against malicious
adversaries, based on polynomial-time assumptions. The round-complexity of our protocol is optimal. We obtain our first result by devising a public-coin approach to compress sigma protocols, without
relying on trusted setup. To obtain our second result, we devise a general framework via a new notion of statistical hash commitments that may be of independent interest.
Constant Ciphertext-Rate Non-Committing Encryption from Standard Assumptions 📺 Abstract
Non-committing encryption (NCE) is a type of public key encryption which comes with the ability to equivocate ciphertexts to encryptions of arbitrary messages, i.e., it allows one to find coins for
key generation and encryption which ``explain'' a given ciphertext as an encryption of any message. NCE is the cornerstone to construct adaptively secure multiparty computation [Canetti et al.
STOC'96] and can be seen as the quintessential notion of security for public key encryption to realize ideal communication channels. A large body of literature investigates what is the best
message-to-ciphertext ratio (i.e., the rate) that one can hope to achieve for NCE. In this work we propose a near complete resolution to this question and we show how to construct NCE with constant
rate in the plain model from a variety of assumptions, such as the hardness of the learning with errors (LWE), the decisional Diffie-Hellman (DDH), or the quadratic residuosity (QR) problem. Prior to
our work, constructing NCE with constant rate required a trusted setup and indistinguishability obfuscation [Canetti et al. ASIACRYPT'17].
Multi-key Fully-Homomorphic Encryption in the Plain Model 📺 Abstract
The notion of multi-key fully homomorphic encryption (multi-key FHE) [Lopez-Alt, Tromer, Vaikuntanathan, STOC'12] was proposed as a generalization of fully homomorphic encryption to the multiparty
setting. In a multi-key FHE scheme for $n$ parties, each party can individually choose a key pair and use it to encrypt its own private input. Given n ciphertexts computed in this manner, the parties
can homomorphically evaluate a circuit C over them to obtain a new ciphertext containing the output of C, which can then be decrypted via a decryption protocol. The key efficiency property is that
the size of the (evaluated) ciphertext is independent of the size of the circuit. Multi-key FHE with one-round decryption [Mukherjee and Wichs, Eurocrypt'16], has found several powerful applications
in cryptography over the past few years. However, an important drawback of all such known schemes is that they require a trusted setup. In this work, we address the problem of constructing multi-key
FHE in the plain model. We obtain the following results: - A multi-key FHE scheme with one-round decryption based on the hardness of learning with errors (LWE), ring LWE, and decisional small
polynomial ratio (DSPR) problems. - A variant of multi-key FHE where we relax the decryption algorithm to be non-compact -- i.e., where the decryption complexity can depend on the size of C -- based
on the hardness of LWE. We call this variant multi-homomorphic encryption (MHE). We observe that MHE is already sufficient for some of the applications of multi-key FHE.
A Combinatorial Approach to Quantum Random Functions 📺 Abstract
Quantum pseudorandom functions (QPRFs) extend the classical security of a PRF by allowing the adversary to issue queries on input superpositions. Zhandry [Zhandry, FOCS 2012] showed a separation
between the two notions and proved that common construction paradigms are also quantum secure, albeit with a new ad-hoc analysis. In this work, we revisit the question of constructing QPRFs and
propose a new method starting from small-domain (classical) PRFs: At the heart of our approach is a new domain-extension technique based on bipartite expanders. Interestingly, our analysis is almost
entirely classical. As a corollary of our main theorem, we obtain the first (approximate) key-homomorphic quantum PRF based on the quantum intractability of the learning with errors problem.
Multi-Client Oblivious RAM with Poly-Logarithmic Communication 📺 Abstract
Oblivious RAM enables oblivious access to memory in the single-client setting, which may not be the best fit in the network setting. Multi-client oblivious RAM (MCORAM) considers a collaborative but
untrusted environment, where a database owner selectively grants read access and write access to different entries of a confidential database to multiple clients. Their access pattern must remain
oblivious not only to the server but also to fellow clients. This upgrade rules out many techniques for constructing ORAM, forcing us to pursue new techniques. MCORAM not only provides an alternative
solution to private anonymous data access (Eurocrypt 2019) but also serves as a promising building block for equipping oblivious file systems with access control and extending other advanced
cryptosystems to the multi-client setting. Despite being a powerful object, the current state-of-the-art is unsatisfactory: The only existing scheme requires $O(\sqrt n)$ communication and client
computation for a database of size $n$. Whether it is possible to reduce these complexities to $\mathsf{polylog}(n)$, thereby matching the upper bounds for ORAM, is an open problem, i.e., can we
enjoy access control and client-obliviousness under the same bounds? Our first result answers the above question affirmatively by giving a construction from fully homomorphic encryption (FHE). Our
main technical innovation is a new technique for cross-key trial evaluation of ciphertexts. We also consider the same question in the setting with $N$ non-colluding servers, out of which at most $t$
of them can be corrupt. We build multi-server MCORAM from distributed point functions (DPF), and propose new constructions of DPF via a virtualization technique with bootstrapping, assuming the
existence of homomorphic secret sharing and pseudorandom generators in NC0, which are not known to imply FHE.
Efficient Invisible and Unlinkable Sanitizable Signatures Abstract
Sanitizable signatures allow designated parties (the sanitizers) to apply arbitrary modifications to some restricted parts of signed messages. A secure scheme should not only be unforgeable, but also
protect privacy and hold both the signer and the sanitizer accountable. Two important security properties that are seemingly difficult to achieve simultaneously and efficiently are invisibility and
unlinkability. While invisibility ensures that the admissible modifications are hidden from external parties, unlinkability says that sanitized signatures cannot be linked to their sources. Achieving
both properties simultaneously is crucial for applications where sensitive personal data is signed with respect to data-dependent admissible modifications. The existence of an efficient construction
achieving both properties was recently posed as an open question by Camenisch et al. (PKC’17). In this work, we propose a solution to this problem with a two-step construction. First, we construct
(non-accountable) invisible and unlinkable sanitizable signatures from signatures on equivalence classes and other basic primitives. Second, we put forth a generic transformation using verifiable
ring signatures to turn any non-accountable sanitizable signature into an accountable one while preserving all other properties. When instantiating in the generic group and random oracle model, the
efficiency of our construction is comparable to that of prior constructions, while providing stronger security guarantees.
Incremental Proofs of Sequential Work 📺 Abstract
A proof of sequential work allows a prover to convince a verifier that a certain amount of sequential steps have been computed. In this work we introduce the notion of incremental proofs of
sequential work where a prover can carry on the computation done by the previous prover incrementally, without affecting the resources of the individual provers or the size of the proofs.To date, the
most efficient instance of proofs of sequential work [Cohen and Pietrzak, Eurocrypt 2018] for N steps require the prover to have $$\sqrt{N}$$N memory and to run for $$N + \sqrt{N}$$N+N steps. Using
incremental proofs of sequential work we can bring down the prover’s storage complexity to $$\log N$$logN and its running time to N.We propose two different constructions of incremental proofs of
sequential work: Our first scheme requires a single processor and introduces a poly-logarithmic factor in the proof size when compared with the proposals of Cohen and Pietrzak. Our second scheme
assumes $$\log N$$logN parallel processors but brings down the overhead of the proof size to a factor of 9. Both schemes are simple to implement and only rely on hash functions (modelled as random
Subvector Commitments with Application to Succinct Arguments 📺 Abstract
We put forward the notion of subvector commitments (SVC): An SVC allows one to open a committed vector at a set of positions, where the opening size is independent of length of the committed vector
and the number of positions to be opened. We propose two constructions under variants of the root assumption and the CDH assumption, respectively. We further generalize SVC to a notion called linear
map commitments (LMC), which allows one to open a committed vector to its images under linear maps with a single short message, and propose a construction over pairing groups.Equipped with these
newly developed tools, we revisit the “CS proofs” paradigm [Micali, FOCS 1994] which turns any arguments with public-coin verifiers into non-interactive arguments using the Fiat-Shamir transform in
the random oracle model. We propose a compiler that turns any (linear, resp.) PCP into a non-interactive argument, using exclusively SVCs (LMCs, resp.). For an approximate 80 bits of soundness, we
highlight the following new implications:1.There exists a succinct non-interactive argument of knowledge (SNARK) with public-coin setup with proofs of size 5360 bits, under the adaptive root
assumption over class groups of imaginary quadratic orders against adversaries with runtime $$2^{128}$$. At the time of writing, this is the shortest SNARK with public-coin setup.2.There exists a
non-interactive argument with private-coin setup, where proofs consist of 2 group elements and 3 field elements, in the generic bilinear group model.
Homomorphic Time-Lock Puzzles and Applications 📺 Abstract
Time-lock puzzles allow one to encrypt messages for the future, by efficiently generating a puzzle with a solution s that remains hidden until time $$\mathcal {T}$$ has elapsed. The solution is
required to be concealed from the eyes of any algorithm running in (parallel) time less than $$\mathcal {T}$$. We put forth the concept of homomorphic time-lock puzzles, where one can evaluate
functions over puzzles without solving them, i.e., one can manipulate a set of puzzles with solutions $$(s_1, \dots , s_n)$$ to obtain a puzzle that solves to $$f(s_1, \ldots , s_n)$$, for any
function f. We propose candidate constructions under concrete cryptographic assumptions for different classes of functions. Then we show how homomorphic time-lock puzzles overcome the limitations of
classical time-lock puzzles by proposing new protocols for applications of interest, such as e-voting, multi-party coin flipping, and fair contract signing.
Trapdoor Hash Functions and Their Applications 📺 Abstract
We introduce a new primitive, called trapdoor hash functions (TDH), which are hash functions $$\mathsf {H}: \{0,1\}^n \rightarrow \{0,1\}^\lambda $$ with additional trapdoor function-like properties.
Specifically, given an index $$i\in [n]$$, TDHs allow for sampling an encoding key $$\mathsf {ek}$$ (that hides i) along with a corresponding trapdoor. Furthermore, given $$\mathsf {H}(x)$$, a hint
value $$\mathsf {E}(\mathsf {ek},x)$$, and the trapdoor corresponding to $$\mathsf {ek}$$, the $$i^{th}$$ bit of x can be efficiently recovered. In this setting, one of our main questions is: How
small can the hint value $$\mathsf {E}(\mathsf {ek},x)$$ be? We obtain constructions where the hint is only one bit long based on DDH, QR, DCR, or LWE.This primitive opens a floodgate of applications
for low-communication secure computation. We mainly focus on two-message protocols between a receiver and a sender, with private inputs x and y, resp., where the receiver should learn f(x, y). We
wish to optimize the (download) rate of such protocols, namely the asymptotic ratio between the size of the output and the sender’s message. Using TDHs, we obtain:1.The first protocols for
(two-message) rate-1 string OT based on DDH, QR, or LWE. This has several useful consequences, such as:(a)The first constructions of PIR with communication cost poly-logarithmic in the database size
based on DDH or QR. These protocols are in fact rate-1 when considering block PIR.(b)The first constructions of a semi-compact homomorphic encryption scheme for branching programs, where the
encrypted output grows only with the program length, based on DDH or QR.(c)The first constructions of lossy trapdoor functions with input to output ratio approaching 1 based on DDH, QR or LWE.(d)The
first constant-rate LWE-based construction of a 2-message “statistically sender-private” OT protocol in the plain model.2.The first rate-1 protocols (under any assumption) for n parallel OTs and
matrix-vector products from DDH, QR or LWE. We further consider the setting where f evaluates a RAM program y with running time $$T\ll |x|$$ on x. We obtain the first protocols with communication
sublinear in the size of x, namely $$T\cdot \sqrt{|x|}$$ or $$T\cdot \root 3 \of {|x|}$$, based on DDH or, resp., pairings (and correlated-input secure hash functions).
Leveraging Linear Decryption: Rate-1 Fully-Homomorphic Encryption and Time-Lock Puzzles Abstract
We show how to combine a fully-homomorphic encryption scheme with linear decryption and a linearly-homomorphic encryption schemes to obtain constructions with new properties. Specifically, we present
the following new results. (1)Rate-1 Fully-Homomorphic Encryption: We construct the first scheme with message-to-ciphertext length ratio (i.e., rate) $$1-\sigma $$ for $$\sigma = o(1)$$. Our scheme
is based on the hardness of the Learning with Errors (LWE) problem and $$\sigma $$ is proportional to the noise-to-modulus ratio of the assumption. Our building block is a construction of a new
high-rate linearly-homomorphic encryption.One application of this result is the first general-purpose secure function evaluation protocol in the preprocessing model where the communication complexity
is within additive factor of the optimal insecure protocol.(2)Fully-Homomorphic Time-Lock Puzzles: We construct the first time-lock puzzle where one can evaluate any function over a set of puzzles
without solving them, from standard assumptions. Prior work required the existence of sub-exponentially hard indistinguishability obfuscation.
Rate-1 Trapdoor Functions from the Diffie-Hellman Problem Abstract
Trapdoor functions (TDFs) are one of the fundamental building blocks in cryptography. Studying the underlying assumptions and the efficiency of the resulting instantiations is therefore of both
theoretical and practical interest. In this work we improve the input-to-image rate of TDFs based on the Diffie-Hellman problem. Specifically, we present: (a)A rate-1 TDF from the computational
Diffie-Hellman (CDH) assumption, improving the result of Garg, Gay, and Hajiabadi [EUROCRYPT 2019], which achieved linear-size outputs but with large constants. Our techniques combine non-binary
alphabets and high-rate error-correcting codes over large fields.(b)A rate-1 deterministic public-key encryption satisfying block-source security from the decisional Diffie-Hellman (DDH) assumption.
While this question was recently settled by Döttling et al. [CRYPTO 2019], our scheme is conceptually simpler and concretely more efficient. We demonstrate this fact by implementing our construction.
Homomorphic Secret Sharing for Low Degree Polynomials Abstract
Homomorphic secret sharing (HSS) allows n clients to secret-share data to m servers, who can then homomorphically evaluate public functions over the shares. A natural application is outsourced
computation over private data. In this work, we present the first plain-model homomorphic secret sharing scheme that supports the evaluation of polynomials with degree higher than 2. Our construction
relies on any degree-k (multi-key) homomorphic encryption scheme and can evaluate degree-$$\left( (k+1)m -1 \right) $$ polynomials, for any polynomial number of inputs n and any sub-logarithmic (in
the security parameter) number of servers m. At the heart of our work is a series of combinatorial arguments on how a polynomial can be split into several low-degree polynomials over the shares of
the inputs, which we believe is of independent interest.
Program Committees
TCC 2023
Eurocrypt 2022
PKC 2022
Asiacrypt 2022
PKC 2021 | {"url":"https://www.iacr.org/cryptodb/data/author.php?authorkey=9805","timestamp":"2024-11-09T03:00:35Z","content_type":"text/html","content_length":"151690","record_id":"<urn:uuid:f6039827-2856-4b28-a4a6-5e057a73bfe1>","cc-path":"CC-MAIN-2024-46/segments/1730477028115.85/warc/CC-MAIN-20241109022607-20241109052607-00667.warc.gz"} |
Roberts Cross Edge Detector
Roberts Cross Edge Detector
Common Names: Roberts Cross
Brief Description
The Roberts Cross operator performs a simple, quick to compute, 2-D spatial gradient measurement on an image. It thus highlights regions of high spatial frequency which often correspond to edges. In
its most common usage, the input to the operator is a grayscale image, as is the output. Pixel values at each point in the output represent the estimated absolute magnitude of the spatial gradient of
the input image at that point.
How It Works
In theory, the operator consists of a pair of 2×2 convolution kernels as shown in Figure 1. One kernel is simply the other rotated by 90°. This is very similar to the Sobel operator.
Figure 1 Roberts Cross convolution kernels
These kernels are designed to respond maximally to edges running at 45° to the pixel grid, one kernel for each of the two perpendicular orientations. The kernels can be applied separately to the
input image, to produce separate measurements of the gradient component in each orientation (call these Gx and Gy). These can then be combined together to find the absolute magnitude of the gradient
at each point and the orientation of that gradient. The gradient magnitude is given by:
although typically, an approximate magnitude is computed using:
which is much faster to compute.
The angle of orientation of the edge giving rise to the spatial gradient (relative to the pixel grid orientation) is given by:
In this case, orientation 0 is taken to mean that the direction of maximum contrast from black to white runs from left to right on the image, and other angles are measured clockwise from this.
Often, the absolute magnitude is the only output the user sees --- the two components of the gradient are conveniently computed and added in a single pass over the input image using the
pseudo-convolution operator shown in Figure 2.
Figure 2 Pseudo-convolution kernels used to quickly compute approximate gradient magnitude
Using this kernel the approximate magnitude is given by:
Guidelines for Use
The main reason for using the Roberts Cross operator is that it is very quick to compute. Only four input pixels need to be examined to determine the value of each output pixel, and only subtractions
and additions are used in the calculation. In addition there are no parameters to set. Its main disadvantages are that since it uses such a small kernel, it is very sensitive to noise. It also
produces very weak responses to genuine edges unless they are very sharp. The Sobel operator performs much better in this respect.
We use
to illustrate the effect of the operator.
The image
is the corresponding output from the Roberts Cross operator. The gradient magnitudes output by the operator have been multiplied by a factor of 5 to make the image clearer. Note the spurious bright
dots on the image which demonstrate that the operator is susceptible to noise. Also note that only the strongest edges have been detected with any reliability.
The image
is the result of thresholding the Roberts Cross output at a pixel value of 80.
We can also apply the Roberts Cross operator to detect depth discontinuity edges in range images. In the range image
the distance from the sensor to the object is encoded in the intensity value of the image. Applying the Roberts Cross yields
The operator produced a line with high intensity values along the boundary of the object. On the other hand, intensity changes originating from depth discontinuities within the object are not high
enough to output a visible line. However, if we threshold the image at a value of 20, all depth discontinuities in the object produce an edge in the image, as can be seen in
The operator's sensitivity to noise can be demonstrated if we add noise to the above range image. The image
is the result of adding Gaussian noise with a standard deviation of 8,
is the corresponding output of the Roberts Cross operator. The difference to the previous image becomes visible if we again threshold the image at a value of 20, as can be seen in
Now, we not only detect edges corresponding to real depth discontinuities, but also some noise points. We can show that the Roberts Cross operator is more sensitive to noise than, for example, the
Sobel operator if we apply the Sobel operator to the same noisy image. In that case, we can find a threshold which removes most of the noise pixels while keeping all edges of the object. Applying a
Sobel edge detector to the above noisy image and thresholding the output at a value of 150 yields
The previous examples contained sharp intensity or depth changes, which enabled us (in the noise-free case) to detect the edges very well. The image
is a range image where the depth values change much more slowly. Hence, the edges in the resulting Roberts Cross image,
are rather faint. Since the intensity of many edge pixels in this image is very low, it is not possible to entirely separate the edges from the noise. This can be seen in
which is the result of thresholding the image at a value of 30.
The effects of the shape of the edge detection kernel on the edge image can be illustrated using
Applying the Roberts Cross operator yields
Due to the different width and orientation of the lines in the image, the response in the edge image varies significantly. Since the intensity steps between foreground and background are constant in
all patterns of the original image, this shows that the Roberts Cross operator responds differently to different frequencies and orientations.
If the pixel value type being used only supports a small range of integers (e.g. 8-bit integer images), then it is possible for the gradient magnitude calculations to overflow the maximum allowed
pixel value. In this case it is common to simply set those pixel values to the maximum allowed value. In order to avoid this happening, image types that support a greater range of pixel values, e.g.
floating point images, can be used.
There is a slight ambiguity in the output of the Roberts operator as to which pixel in the output corresponds to which pixel in the input, since technically the operator measures the gradient
intensity at the point where four pixels meet. This means that the gradient image will be shifted by half a pixel in both x and y grid directions.
Interactive Experimentation
You can interactively experiment with this operator by clicking here.
1. Why does the Roberts Cross' small kernel size make it very sensitive to noise in the image?
2. Apply the Roberts Cross operator to
Can you obtain an edge image that contains only lines corresponding to the contours of the object? Compare with the results obtained with the Sobel and Canny operators.
3. Compare the result of applying the Roberts Cross operator to
with the one of using the Sobel operator.
4. Compare the performance of the Roberts Cross with the Sobel operator in terms of noise rejection, edge detection and speed.
5. Under what situations might you choose to use the Roberts Cross rather than the Sobel? And under what conditions would you avoid it?
R. Boyle and R. Thomas Computer Vision: A First Course, Blackwell Scientific Publications, 1988, pp 50 - 51.
E. Davies Machine Vision: Theory, Algorithms and Practicalities, Academic Press, 1990, Chap. 5.
L. Roberts Machine Perception of 3-D Solids, Optical and Electro-optical Information Processing, MIT Press 1965.
D. Vernon Machine Vision, Prentice-Hall, 1991, Chap. 5.
Local Information
Specific information about this operator may be found here.
More general advice about the local HIPR installation is available in the Local Information introductory section.
©2003 R. Fisher, S. Perkins, A. Walker and E. Wolfart. | {"url":"https://homepages.inf.ed.ac.uk/rbf/HIPR2/roberts.htm","timestamp":"2024-11-03T19:16:29Z","content_type":"text/html","content_length":"12651","record_id":"<urn:uuid:796fc467-5049-472c-996e-c38eceb108c4>","cc-path":"CC-MAIN-2024-46/segments/1730477027782.40/warc/CC-MAIN-20241103181023-20241103211023-00581.warc.gz"} |
Dismissing autocomplete of username
I like the implementation of user tagging that autocompletes usernames after I type a @ symbol. The autocomplete window that pops up, however, is hard to dismiss. Attempts to either use the
right-arrow key or clicking the cursor elsewhere in the text before hitting return still autocomplete the first suggested username instead of allowing me to type something arbitrary after an
occurrence of @.
For example, on a Discourse powered forum I want to type the following code snippet (using space indentation rather than ticks):
# more code here
When i enter @hello, I am prompted with the popup. If I hit return immediately, it autocompletes a username. That is fine. But if I click away (say to the end of the second line) and hit return to
start a third line, the autocomplete is still filled in. Currently, the only way I have found to bypass this is to manually hit [esc] when the autocomplete shows up.
1 Like
Er, what’s the problem, exactly? Use esc to dismiss the autocomplete.
I guess I can see the argument that clicking away from it should dismiss it. I can’t remember if it ever worked this way though, can you @eviltrout?
3 Likes
I think @redbassett makes a good point - I’ve been struggling with this a bit as well and I wonder how it is affecting less-savvy members - I will ask.
Once I have created my mention I just want to move along and finish writing my post. Instead I often find myself stuck in a popup that I then have to esc out of. Also as I move my cursor around the
post while writing… I correct alot as I type.
This is made worse when I mention a group that then prompts me (again and again) how many people I am about to mention that I have to also close. I’d also like that to go away once I finish the
mention and move on with writing my post.
1 Like
I actually have been hitting issues with @completion as well and just compared our implementation with GitHub.
I think we are being too smart.
The fix is quite easy, just stop hijacking it. Have arrows always work as arrows. ENTER or click can choose a target just fine.
I also agree that clicking anywhere that is not in the “autocomplete” area should collapse the autocomplete, cursor is no longer in the right spot, makes no sense to have it open.
I vaguely recall “click” away hiding it, but now 100% sure.
7 Likes
@sam is spot on for my opinions on the usability of the dialog. I am used to autocomplete going away when I try to leave the context it is autocompleting without hitting enter (or tab on native apps
– obviously not applicable to a web interface).
On the topic of tagging, I also ran into this issue while inside a code block. I see that usernames are not tagged in code, so I feel like disabling the autocomplete dialog in code blocks would make
1 Like
FWIW I think this is an edge case. If I know about space indentation then I can also know to remember to use a backtick to avoid some of these well-known oddities about markdown functionality.
Not that you haven’t started a valuable conversation about the UI which I do hope will be fixed. I like @sam’s assessment of the problem and what can be done to fix it - that sounds about right
to me.
Edit: That said, this does make sense too
1 Like
Yeah, as noted in the follow up, usernames are not tagged in code (which makes perfect sense to me), but the UI would lead one to believe that they are.
OK I just tweaked this so @completions are far less annoying.
• I can now @sam click anywhere and have it autocomplete collapse
• I can also I can type @slowt real quick and hit space and stuff is not autocompleted by mistake
• I can arrow around when an autocomplete box is open and it collapses at the correct time without eating up any arrow keys.
7 Likes
Hmm, that tweak could change how many people use @completions. If I am typing a response and know the username I wish to mention like @sam I just type it like I did here and it completes before I
submit the post. I for one like the fact that I don’t have to make an effort to click on a username when I know it.
I don’t think you are properly following this particular tweak:
There is a user called slowtiger, in the past we used SPACE to trigger autocompletion of words, now only click and ENTER will issue the completion. This means that in no condition do we do the
confusing, space causes a word switcharoo.
For those who are accustomed to space should cause a word switcharoo … just train yourself to use ENTER or TAB
Strongly recommend you play with it here, it is now deployed.
5 Likes
Cool. I had a feeling that was what you meant, but I didn’t want to make the assumption. I look forward to playing with these tweaks over the next few days.
OK, so if I type @sam completely on my keyboard I see it still makes a mention. However if I start typing @codin (codinghorror) and hit space (not tab) it doesn’t finish his name. Sorry for the
misunderstanding! I already tab when I want to complete a name, didn’t even know you could use space, so my issue doesn’t actually exist. Thanks!
5 Likes
Thanks for fixing this, @sa I mean @sam - this is working much better. Great job and much appreciated.
I did notice though that the # autocompletes don’t work the same way as @ autocompletes now - with # you can press space and the autocompete doesn’t close automatically. It blinks away and comes
back. You have to hit esc to make it go away completely.
I would prefer it if @ and # mentions worked the same way.
Yes @tgxworld # autocompletes are kind of buggy at the moment …
> #<space>t
Leave an autocomplete window open, you can get into all sorts of weird conditions, I thing that should unconditionally break out of autocomplete, otherwise there is huge chance of edge cases.
4 Likes
The following would be a new feature, but I wonder if it’s possible to re-initialise the mention drop-down if you’ve cancelled it by clicking ESC or clicking away, but then resume typing the
What can currently happen: I type @cod and accidentally click somewhere, losing focus. I click at the immediate end of of my mention and continue typing: @codingh but now the drop-down is lost for
3 Likes
It seems you can, by deleting the last letter you entered for the mention with backspace (or at least it reopened the mention window for me).
My tests were:
Type @cod hit escape
Type ing, no mention popup, okay
Hit Backspace, mention popup returns… interesting
Test 2:
Type @cod hit escape
Hit backspace, mention popup returns
Both tests work with no additional text following the partial mention and with text following the partial mention.
1 Like
Agreed that analogous to clicking away dismissing, it would make sense from a UI perspective for the popup to reappear when you return to the username. If not immediately, once you type a new
character (shouldn’t require backspacing).
I did some testing with Slack and Facebook and they do not work this way. You either have to start adding more characters, or delete a character.
So the only part that Discourse isn’t handling, is when the cursor is moved back to the prior started mention, if more characters (not space) are typed, popup the mention dialog.
Makes sense to me. I’m in favour of adding characters retriggering the popup. I agree that having the popup occur as soon as the cursor enters a username could be very annoying (especially for
people who navigate with the arrow keys).
I just opened a PR that closes the autocomplete once it encounters a blank string.
I’m hoping to get acceptance tests for autocomplete working. We really need a test suite for all this edge cases.
3 Likes | {"url":"https://meta.discourse.org/t/dismissing-autocomplete-of-username/39092","timestamp":"2024-11-07T02:21:02Z","content_type":"text/html","content_length":"73869","record_id":"<urn:uuid:db0f7728-20f8-475a-92bc-e386511cbd01>","cc-path":"CC-MAIN-2024-46/segments/1730477027951.86/warc/CC-MAIN-20241107021136-20241107051136-00396.warc.gz"} |
Binary and Hexadecimal Conversion Quiz
Test your knowledge on binary and hexadecimal number systems with our engaging quiz! Perfect for students, teachers, or anyone wanting to refresh their understanding of digital numbers.
This quiz covers:
• Binary to Decimal Conversion
• IP Addressing in Binary
• Hexadecimal Conversion
• OSI Model Layers
15 Questions4 Minutes
Convert this binary number to decimal 10011001
Convert this binary number to decimal 10010001
Convert this binary number to decimal 10110010
Convert this binary number to decimal 01111110
Convert this binary number to decimal 11011110
Convert 192.0.1.128 to binary
Binary numbers are a base ____ system.
How many octets are in a IPv4 address?
What layer of the OSI Model is IP addressing used at?
Layer 3
Layer 2
Layer 4
Layer 1
Convert the hexadecimal number B2 to binary
Hexadecimal numbers are used at layer 2 of the OSI Model on network interface cards.
Convert the binary number 10011100 to its hexadecimal equivalent:
HEX is a numbering system used by network interface cards to manage physical addresses.
Convert the decimal number 20 to hexadecimal
{"name":"CS100_M4Quiz", "url":"https://www.quiz-maker.com/QPREVIEW","txt":"Test your knowledge on binary and hexadecimal number systems with our engaging quiz! Perfect for students, teachers, or
anyone wanting to refresh their understanding of digital numbers.This quiz covers:Binary to Decimal ConversionIP Addressing in BinaryHexadecimal ConversionOSI Model Layers","img":"https:/images/
More Quizzes | {"url":"https://take.quiz-maker.com/QF867OG","timestamp":"2024-11-03T16:52:03Z","content_type":"text/html","content_length":"64150","record_id":"<urn:uuid:332305e5-af1b-488f-b3c7-6376b23af445>","cc-path":"CC-MAIN-2024-46/segments/1730477027779.22/warc/CC-MAIN-20241103145859-20241103175859-00591.warc.gz"} |
Vertical Spread In Options Trading: What It Is, Why It Matters
Vertical Spread In Options Trading: What It Is, Why It Matters
Welcome to our comprehensive guide on vertical spreads in options trading. In this article, we will delve into the concept and significance of vertical spreads, explore different strategies, and
discuss risk management techniques. Whether you are a seasoned options trader or just starting out, understanding vertical spreads is essential for enhancing your trading techniques and effectively
managing risk.
Key Takeaways:
• Vertical spreads involve simultaneously buying and selling options with different strike prices.
• They provide a defined risk and reward profile, making them popular among options traders.
• Vertical spreads can be bullish, bearish, credit, or debit strategies.
• Strike price selection and risk management are crucial in vertical spread strategies.
• Customizing vertical spreads allows traders to align their strategies with their trading style and goals.
Understanding Vertical Spreads in Options Trading
A vertical spread is a popular options trading technique that allows investors to capitalize on market movements and manage risk. This strategy involves buying and selling options with the same
expiration date but different strike prices. By understanding the basics of vertical spreads and mastering their execution, traders can enhance their options trading techniques and potentially
increase their profits.
When forming a vertical spread, traders can choose between two types: debit spreads and credit spreads. A debit spread is created by purchasing an option with a higher premium and simultaneously
selling an option with a lower premium. In contrast, a credit spread is formed by selling an option with a higher premium and buying an option with a lower premium.
The strike prices chosen for a vertical spread play a crucial role in determining the profit and loss potential. The strike price is the agreed-upon price at which the option can be bought or sold.
Typically, the sold option has a strike price closer to the current market price of the underlying asset, while the purchased option has a strike price further away. This difference in strike prices
creates a range within which the profit or loss is limited.
Example of a Vertical Spread Table
Option Type Premium (Buy) Premium (Sell) Strike Price (Buy) Strike Price (Sell)
Debit Spread $3.50 $2.00 $50 $55
Credit Spread $1.50 $3.00 $50 $45
As shown in the table above, a debit spread involves buying an option for $3.50 while selling another option for $2.00. The strike price for the purchased option is $50, and the sold option has a
strike price of $55. On the other hand, a credit spread entails selling an option for $3.00 and buying an option for $1.50. The strike prices for the credit spread are $50 (buy) and $45 (sell).
Bullish Vertical Spreads: Exploring Bull Call Spreads
A bull call spread is a popular options trading strategy used by investors who have a bullish outlook on a specific stock or index. This strategy involves buying a call option with a lower strike
price and simultaneously selling a call option with a higher strike price. The goal of a bull call spread is to benefit from an increase in the underlying asset’s price while limiting potential
One of the key advantages of a bull call spread is its defined risk and reward profile. By purchasing the lower strike price call option, the trader has the right to buy the underlying asset at a
predetermined price. At the same time, selling the higher strike price call option generates premium income, offsetting some of the cost of purchasing the lower strike price option.
To further manage risk, a bull call spread can be delta neutral with a gamma hedge. Delta measures the sensitivity of the option’s price to changes in the underlying asset’s price, while gamma
measures the rate of change of delta. By maintaining a delta neutral position and applying gamma hedging techniques, traders can mitigate potential losses and adjust their positions as market
conditions evolve.
Example of a Bull Call Spread
Let’s take a look at an example to illustrate how a bull call spread works:
Strike Price Option Premium (Buy) Option Premium (Sell)
XYZ Stock $50 $55
Profit/Loss Limited Limited
In this example, an investor believes that XYZ stock, currently trading at $50, will increase in value. They purchase a call option with a strike price of $50 for $5 per share (total cost: $500) and
simultaneously sell a call option with a strike price of $55 for $2 per share (total income: $200).
If the stock price rises above $55 at expiration, the investor’s profit potential is limited to the difference between the strike prices ($55 – $50 = $5) minus the initial cost paid for the spread
($5 – $2 = $3). If the stock price remains below $50 at expiration, the investor’s maximum loss is limited to the initial cost paid for the spread, which is $300 ($500 – $200).
• Investopedia
• Options Playbook
Bearish Vertical Spreads: Examining Bear Put Spreads
A bear put spread is a popular options trading strategy used by traders who anticipate a decline in the price of a particular stock or index. It involves buying a put option with a higher strike
price and simultaneously selling a put option with a lower strike price. This strategy allows traders to profit from a downward move in the underlying asset, while also limiting potential losses.
By implementing a bear put spread, traders can take advantage of market bearishness while simultaneously reducing the cost of initiating the trade. The premium received from selling the put option
with the lower strike price helps offset the cost of purchasing the put option with the higher strike price. This combination creates a defined risk and reward profile for the trade.
One notable aspect of bear put spreads is their ability to be delta neutral with a gamma hedge. Delta neutral means that the overall position’s delta is zero, resulting in minimal exposure to changes
in the underlying asset’s price. This can be achieved by balancing the quantities of the put options bought and sold. Implementing a gamma hedge helps further manage risk by adjusting the position as
market conditions evolve.
Consider a hypothetical scenario where an options trader believes that Company XYZ’s stock, currently trading at $50, is likely to decline in the near future. The trader decides to implement a
bear put spread to capitalize on this anticipated downward move.
The trader buys a put option with a strike price of $55 for a premium of $3 and simultaneously sells a put option with a strike price of $45 for a premium of $1. By initiating this spread, the
trader limits their potential losses if the stock price were to unexpectedly increase and also reduces the cost of the trade.
If the stock price drops below $45 at expiration, the trader will realize the maximum profit, which is the difference between the strike prices minus the net premium paid ($55 – $45 – $2 = $8).
If the stock price remains above $55 at expiration, the maximum loss will be the net premium paid ($2).
By understanding the mechanics and advantages of bear put spreads, options traders can effectively navigate bearish market conditions and potentially profit from downward price movements while
managing risk.
Credit Spreads: Generating Income with Vertical Spreads
Credit spreads are a popular options trading strategy that allows investors to generate income by collecting the net credit upfront. These vertical spreads involve selling an option with a higher
premium and simultaneously buying an option with a lower premium. The premium received from selling the option is higher than the premium paid for the option purchased, resulting in a net credit.
One of the key advantages of credit spreads is their ability to benefit from time decay. As time passes, the extrinsic value of options tends to erode, leading to a decrease in their price. Credit
spreads take advantage of this phenomenon by allowing traders to profit as the options approach expiration.
It’s important to note that credit spreads can be implemented in both bullish and bearish market environments. For a bullish credit spread, the investor would sell a put option with a higher strike
price and buy a put option with a lower strike price. This strategy profits if the underlying asset’s price remains above the sold put option’s strike price.
On the other hand, a bearish credit spread entails selling a call option with a higher strike price and buying a call option with a lower strike price. This strategy is profitable if the underlying
asset’s price stays below the sold call option’s strike price. By selecting the appropriate strike prices and carefully managing risk, traders can effectively utilize credit spreads to generate
income and enhance their options trading strategies.
Table: Comparison of Bullish and Bearish Credit Spreads
Bullish Credit Spread Bearish Credit Spread
Strategy Sell higher strike put option, buy lower strike put option Sell higher strike call option, buy lower strike call option
Profit Underlying asset’s price stays above the sold put option’s strike price Underlying asset’s price stays below the sold call option’s strike price
Risk Limited to the difference between the strike prices minus the net credit received Limited to the difference between the strike prices minus the net credit received
In summary, credit spreads are a versatile options trading strategy that allows traders to generate income and benefit from time decay. By implementing bullish or bearish credit spreads with
carefully selected strike prices, traders can capitalize on market conditions and effectively manage risk.
Debit Spreads: Capitalizing on Price Movements with Vertical Spreads
Debit spreads are a popular options trading strategy that allows traders to capitalize on price movements in the underlying asset. They involve buying an option with a higher premium and
simultaneously selling an option with a lower premium. The cost of purchasing the option with the higher premium is partially offset by the premium received from selling the option with the lower
premium, resulting in a net debit.
One of the key advantages of debit spreads is their ability to benefit from both directional movements and time decay. As the options approach expiration, the extrinsic value decreases, allowing
traders to profit if the underlying asset moves in the desired direction. At the same time, the time decay works in favor of the trader, as the option with the higher premium loses value faster than
the option with the lower premium.
It is important to note that debit spreads have their limitations. While they offer defined risk by capping potential losses to the net debit, they also limit potential profits compared to simply
buying or selling the options individually. Traders must carefully analyze the market conditions, underlying asset’s price, and expected price movements before implementing debit spreads to ensure
they align with their trading goals and risk tolerance.
Examples of Debit Spreads
Let’s take a look at two examples of debit spreads:
1. Bullish Debit Spread: A trader expects a stock to rise in price and decides to implement a bullish debit spread. They buy a call option with a higher strike price and sell a call option with a
lower strike price. The premium received from selling the lower strike call option partially offsets the premium paid for the higher strike call option. If the stock rises in price, the trader
can profit from the price difference between the two strike prices.
2. Bearish Debit Spread: A trader has a bearish outlook on a stock and decides to establish a bearish debit spread. They buy a put option with a higher strike price and sell a put option with a
lower strike price. By receiving a premium from selling the put option with the lower strike price, the trader partially offsets the cost of buying the put option with the higher strike price. If
the stock declines in price, the trader can benefit from the price difference between the two strike prices.
By carefully selecting the strike prices based on their market outlook, traders can effectively capitalize on price movements using debit spreads as part of their options trading strategy.
Managing Risk in Vertical Spread Strategies
Risk management is a critical aspect of options trading, particularly when it comes to vertical spread strategies. By implementing effective risk management techniques, traders can minimize potential
losses and navigate the inherent volatility of the market. Here are some key considerations for managing risk in vertical spread strategies:
Setting Clear Risk Parameters
First and foremost, it is essential to establish clear risk parameters before entering into any vertical spread trade. This involves defining the maximum loss you are willing to accept and
determining the appropriate position sizing to align with your risk tolerance. By setting these parameters upfront, you can maintain discipline and protect your overall portfolio.
Diversifying Positions
Diversification is another crucial aspect of risk management. Instead of putting all your eggs in one basket, consider spreading your trades across different stocks, sectors, or indices. By
diversifying your positions, you can reduce the impact of any single trade or market event, mitigating potential losses and increasing your chances of overall success.
Monitoring Volatility
Volatility plays a significant role in options trading, and vertical spreads are no exception. It is important to closely monitor the volatility of the underlying asset as it can impact the
performance of your vertical spreads. Higher volatility can lead to wider bid-ask spreads and increased option premiums, affecting the overall risk and potential profitability of your trades. By
staying informed about market volatility, you can make informed decisions and adjust your strategies accordingly.
By incorporating these risk management techniques into your vertical spread strategies, you can enhance your chances of success and effectively navigate the dynamic options trading landscape.
The Importance of Strike Price Selection in Vertical Spreads
In options trading, strike price selection is a crucial factor that can greatly impact the outcome of vertical spread strategies. The strike price is the predetermined price at which the underlying
asset can be bought or sold when the option is exercised. It plays a significant role in determining the potential profit and loss levels of a vertical spread, as well as the risk-reward ratio.
When selecting strike prices for vertical spreads, traders should consider various factors, including the current market conditions, the price of the underlying asset, and their outlook for the stock
or index. It is important to choose strike prices that align with the desired strategy and risk tolerance.
To illustrate the significance of strike price selection, let’s consider an example:
Imagine you have a bullish outlook on Company XYZ and decide to execute a bull call spread strategy. The stock is currently trading at $50, and you believe it will rise to $60 within the next
month. You consider two potential strike prices: $55 and $60.
If you choose the $55 strike price for the long call option, you can benefit from the stock’s potential appreciation up to $55. However, your maximum profit is limited to the difference between
the strike price and the stock’s price at expiration.
On the other hand, if you choose the $60 strike price for the long call option, you have a higher maximum profit potential, as you can benefit from the stock’s appreciation up to $60. However,
the likelihood of the option being in-the-money and profitable decreases as the stock price needs to rise higher to reach the strike price.
As shown in the example above, strike price selection can significantly impact the risk and reward dynamics of a vertical spread strategy. Traders must carefully analyze their expectations for the
underlying asset and select strike prices that best align with their trading objectives.
Benefits of Effective Strike Price Selection Risks of Ineffective Strike Price Selection
• Optimize risk-reward ratio • Potential for limited profit
• Enhance profit potential • Increased risk of losses
• Improve probability of success • Lower probability of success
• Align with market expectations • Incompatibility with market conditions
By carefully considering strike price selection in vertical spread strategies, traders can optimize their options trading strategy and increase their chances of achieving their desired outcomes.
Delta Neutral and Gamma Hedge in Vertical Spreads
The concepts of delta neutral and gamma hedge are crucial in effectively managing risk in vertical spread strategies. Delta, represented by the Greek letter Δ, measures the rate of change in the
price of an option relative to the change in the price of the underlying asset. A delta neutral position is one where the combined delta of the options held is zero.
Traders can achieve delta neutrality by adjusting the ratio of options bought to options sold or by using other strategies such as stock or futures hedging. By maintaining a delta neutral position,
traders can minimize their exposure to directional price movements and focus on profiting from other factors such as time decay and changes in volatility.
Gamma, represented by the Greek letter Γ, measures the rate of change in the delta of an option relative to the change in the price of the underlying asset. A gamma hedge involves adjusting the
positions in a spread to maintain a desired delta neutral position as the price of the underlying asset fluctuates.
Gamma hedging is particularly important when trading options with shorter expiration periods as the delta of an option can change more rapidly. By actively rebalancing the delta of a position,
traders can adapt to market conditions and effectively manage risk in their vertical spread strategies.
Pros and Cons of Delta Neutral and Gamma Hedge Strategies:
Pros Cons
Provides protection against directional price movements Requires active monitoring and adjustment of positions
Allows traders to focus on other factors such as time decay and volatility Can result in higher transaction costs due to frequent adjustments
Enables traders to adapt to changing market conditions May limit potential profits if the underlying asset moves strongly in one direction
“Maintaining a delta neutral position and applying gamma hedging techniques can help traders navigate the complexities of options trading and mitigate potential losses.” – Options Trading Expert
By understanding and implementing delta neutral and gamma hedge strategies, traders can enhance their risk management techniques and increase their chances of success in vertical spread strategies.
Customizing Vertical Spreads to Fit Your Trading Style
Vertical spreads offer a versatile options trading strategy that allows traders to tailor their approach to match their unique trading style, account size, time horizon, and risk tolerance. By
customizing vertical spreads, traders can optimize their strategies to align with their individual preferences and investment goals, enhancing their overall trading experience.
When customizing vertical spreads, traders have various elements to consider. The first is determining the appropriate time frame for their trades. Some traders may prefer shorter-term trades, known
as swing trading, while others may opt for longer-term positions. By selecting the ideal time frame, traders can align their vertical spread strategies with their desired trading duration.
Another crucial aspect to customize is the selection of strike prices. Traders must carefully analyze the current market conditions, evaluate the underlying asset’s price movements, and assess their
outlook on the stock or index they are trading. By strategically choosing strike prices, traders can optimize their risk-reward ratio and better manage their overall position.
Additionally, traders need to define their risk parameters when customizing vertical spreads. This includes identifying the maximum loss they are willing to bear and setting stop-loss orders
accordingly. By establishing clear risk parameters, traders can protect themselves from significant drawdowns and preserve their capital.
Ultimately, the key to customizing vertical spreads lies in understanding one’s trading style, account size, and risk tolerance. By leveraging the flexibility of vertical spreads, traders can create
personalized strategies that suit their unique needs and empower them to navigate the options market with confidence.
Vertical spreads are a versatile options trading strategy that offers a range of benefits for investors. By employing vertical spreads, traders can effectively manage risk, generate income, and
capitalize on price movements in the market. These strategies provide a defined risk and reward profile, making them suitable for both beginners and experienced options traders.
One of the key aspects of successful vertical spread strategies is risk management. Traders must carefully select strike prices, set clear risk parameters, and monitor market conditions to make
informed decisions. By implementing delta neutral positions and applying gamma hedge techniques, traders can mitigate potential losses and adjust their positions as market conditions evolve.
The importance of strike price selection cannot be overstated in vertical spread strategies. The strike price determines the potential profit and loss levels of the spread, influencing the
risk-reward ratio. Traders must consider current market conditions, the underlying asset’s price, and their outlook for the stock or index when choosing strike prices for their vertical spread
Overall, vertical spreads offer traders the flexibility to customize their strategies according to their trading style, account size, time horizon, and risk tolerance. By optimizing their vertical
spreads to align with their individual preferences and investment goals, traders can enhance their overall investment strategy and navigate the world of options trading with confidence.
What is a vertical spread in options trading?
A vertical spread is an options trading strategy that involves simultaneously buying and selling options of the same type and expiration date, but with different strike prices.
What are the types of vertical spreads?
The two main types of vertical spreads are debit spreads and credit spreads. Debit spreads involve buying an option with a higher premium and selling an option with a lower premium. Credit spreads
refer to vertical spreads where the premium received from selling the option is higher than the premium paid for the option purchased.
What is a bull call spread?
A bull call spread is a vertical spread strategy used by investors who have a bullish outlook on a specific stock or index. It involves buying a call option with a lower strike price and selling a
call option with a higher strike price.
What is a bear put spread?
A bear put spread is a vertical spread strategy employed by traders who have a bearish view on a particular stock or index. It entails buying a put option with a higher strike price and selling a put
option with a lower strike price.
How do credit spreads work?
Credit spreads are vertical spreads where the premium received from selling the option is higher than the premium paid for the option purchased. This strategy allows investors to generate income by
collecting the net credit upfront.
What are debit spreads used for?
Debit spreads are used to capitalize on price movements in the underlying asset. By buying an option with a higher premium and selling an option with a lower premium, traders can offset the cost of
the purchased option with the premium received from the sold option.
How can risk be managed in vertical spread strategies?
Risk management in vertical spread strategies involves carefully selecting strike prices, setting clear risk parameters, diversifying positions, and closely monitoring the market to make informed
Why is strike price selection important in vertical spreads?
The strike price selection determines the potential profit and loss levels of the spread and influences the risk-reward ratio. Traders must consider current market conditions, the underlying asset’s
price, and their outlook when choosing strike prices.
What is delta neutral and gamma hedge in vertical spreads?
Delta neutral and gamma hedge are risk management techniques used in vertical spread strategies. Delta measures the sensitivity of an option’s price to changes in the price of the underlying asset,
while gamma measures the rate of change of delta.
How can vertical spreads be customized?
Vertical spreads offer flexibility, allowing traders to customize their strategies based on their trading style, account size, time horizon, and risk tolerance.
Source Links | {"url":"https://www.fxoptions.com/vertical-spread-options/","timestamp":"2024-11-06T01:14:53Z","content_type":"text/html","content_length":"293046","record_id":"<urn:uuid:cbeb3e32-0363-4caa-b0b4-47b36e79150c>","cc-path":"CC-MAIN-2024-46/segments/1730477027906.34/warc/CC-MAIN-20241106003436-20241106033436-00407.warc.gz"} |
Control Systems/System Modeling - Wikibooks, open books for an open world
It is the job of a control engineer to analyze existing systems, and to design new systems to meet specific needs. Sometimes new systems need to be designed, but more frequently a controller unit
needs to be designed to improve the performance of existing systems. When designing a system, or implementing a controller to augment an existing system, we need to follow some basic steps:
1. Model the system mathematically
2. Analyze the mathematical model
3. Design system/controller
4. Implement system/controller and test
The vast majority of this book is going to be focused on (2), the analysis of the mathematical systems. This chapter alone will be devoted to a discussion of the mathematical modeling of the systems.
An external description of a system relates the system input to the system output without explicitly taking into account the internal workings of the system. The external description of a system is
sometimes also referred to as the Input-Output Description of the system, because it only deals with the inputs and the outputs to the system.
If the system can be represented by a mathematical function h(t, r), where t is the time that the output is observed, and r is the time that the input is applied. We can relate the system function h
(t, r) to the input x and the output y through the use of an integral:
[General System Description]
${\displaystyle y(t)=\int _{-\infty }^{\infty }h(t,r)x(r)dr}$
This integral form holds for all linear systems, and every linear system can be described by such an equation.
If a system is causal (i.e. an input at t=r affects system behaviour only for ${\displaystyle t\geq r}$ ) and there is no input of the system before t=0, we can change the limits of the integration:
${\displaystyle y(t)=\int _{0}^{t}h(t,r)x(r)dr}$
Time-Invariant Systems
If furthermore a system is time-invariant, we can rewrite the system description equation as follows:
${\displaystyle y(t)=\int _{0}^{t}h(t-r)x(r)dr}$
This equation is known as the convolution integral, and we will discuss it more in the next chapter.
Every Linear Time-Invariant (LTI) system can be used with the Laplace Transform, a powerful tool that allows us to convert an equation from the time domain into the S-Domain, where many calculations
are easier. Time-variant systems cannot be used with the Laplace Transform.
If a system is linear and lumped, it can also be described using a system of equations known as state-space equations. In state-space equations, we use the variable x to represent the internal state
of the system. We then use u as the system input, and we continue to use y as the system output. We can write the state-space equations as such:
${\displaystyle x'(t)=A(t)x(t)+B(t)u(t)}$
${\displaystyle y(t)=C(t)x(t)+D(t)u(t)}$
We will discuss the state-space equations more when we get to the section on modern controls.
Systems which are LTI and Lumped can also be described using a combination of the state-space equations, and the Laplace Transform. If we take the Laplace Transform of the state equations that we
listed above, we can get a set of functions known as the Transfer Matrix Functions. We will discuss these functions in a later chapter.
To recap, we will prepare a table with the various system properties, and the available methods for describing the system:
Properties State-Space Laplace Transfer
Equations Transform Matrix
Linear, Time-Variant, Distributed no no no
Linear, Time-Variant, Lumped yes no no
Linear, Time-Invariant, Distributed no yes no
Linear, Time-Invariant, Lumped yes yes yes
We will discuss all these different types of system representation later in the book.
Once a system is modeled using one of the representations listed above, the system needs to be analyzed. We can determine the system metrics and then we can compare those metrics to our
specification. If our system meets the specifications we are finished with the design process. However if the system does not meet the specifications (as is typically the case), then suitable
controllers and compensators need to be designed and added to the system.
Once the controllers and compensators have been designed, the job isn't finished: we need to analyze the new composite system to ensure that the controllers work properly. Also, we need to ensure
that the systems are stable: unstable systems can be dangerous.
For proposals, early stage designs, and quick turn around analyses a frequency domain model is often superior to a time domain model. Frequency domain models take disturbance PSDs (Power Spectral
Densities) directly, use transfer functions directly, and produce output or residual PSDs directly. The answer is a steady-state response. Oftentimes the controller is shooting for 0 so the
steady-state response is also the residual error that will be the analysis output or metric for report.
Table 1: Frequency Domain Model
Inputs and Outputs
┃Input│ Model │Output ┃
┃ PSD │Transfer Function │ PSD ┃
Brief Overview of the Math
Frequency domain modeling is a matter of determining the impulse response of a system to a random process.
Figure 1: Frequency Domain System
${\displaystyle S_{YY}\left(\omega \right)=G^{*}\left(\omega \right)G\left(\omega \right)S_{XX}=\left|G\left(\omega \right)\right\vert S_{XX}}$ ^[1]
${\displaystyle S_{XX}\left(\omega \right)}$ is the one-sided input PSD in ${\displaystyle {\frac {magnitude^{2}}{Hz}}}$
${\displaystyle G\left(\omega \right)}$ is the frequency response function of the system and
${\displaystyle S_{YY}\left(\omega \right)}$ is the one-sided output PSD or auto power spectral density function.
The frequency response function, ${\displaystyle G\left(\omega \right)}$ , is related to the impulse response function (transfer function) by
${\displaystyle g\left(\tau \right)={\frac {1}{2\pi }}\int _{-\infty }^{\infty }e^{i\omega t}H\left(\omega \right)\,d\omega }$
Note some texts will state that this is only valid for random processes which are stationary. Other texts suggest stationary and ergodic while still others state weakly stationary processes. Some
texts do not distinguish between strictly stationary and weakly stationary. From practice, the rule of thumb is if the PSD of the input process is the same from hour to hour and day to day then the
input PSD can be used and the above equation is valid.
1. ↑ Sun, Jian-Qiao (2006). Stochastic Dynamics and Control, Volume 4. Amsterdam: Elsevier Science. ISBN 0444522301.
Modeling in Control Systems is oftentimes a matter of judgement. This judgement is developed by creating models and learning from other people's models. ControlTheoryPro.com is a site with a lot of
examples. Here are links to a few of them
Once the system has been properly designed we can prototype our system and test it. Assuming our analysis was correct and our design is good, the prototype should work as expected. Now we can move on
to manufacture and distribute our completed systems. | {"url":"https://en.m.wikibooks.org/wiki/Control_Systems/System_Modeling","timestamp":"2024-11-14T13:58:42Z","content_type":"text/html","content_length":"66045","record_id":"<urn:uuid:4a751cdf-37e8-4bad-91f4-397efae1ce17>","cc-path":"CC-MAIN-2024-46/segments/1730477028657.76/warc/CC-MAIN-20241114130448-20241114160448-00650.warc.gz"} |
Graphing Data Unit 2. Graphs of Frequency Distributions Sometimes it is easier to identify patterns of a data set by looking at a graph of the frequency. - ppt download
Presentation is loading. Please wait.
To make this website work, we log user data and share it with processors. To use this website, you must agree to our
Privacy Policy
, including cookie policy.
Ads by Google | {"url":"http://slideplayer.com/slide/4512288/","timestamp":"2024-11-03T12:47:41Z","content_type":"text/html","content_length":"145800","record_id":"<urn:uuid:ba934a5f-c04c-490f-a4f0-53e855f9c959>","cc-path":"CC-MAIN-2024-46/segments/1730477027776.9/warc/CC-MAIN-20241103114942-20241103144942-00516.warc.gz"} |
Writing Faster R with Vectorization and the {apply} family
One of my favorite things about R is that there are a lot of ways to do the same thing. Of course, this means that some ways are better than others depending on the use case. for loops, the apply
family and vectorization are all common ways to write code for large amounts of data in R, but it can be tricky to know when to use each one and how to use them.
I’ve divided this post into how to use each method in R and then give a few examples of when you might want to use each one. I close everything out with a short benchmark demonstration to compare the
What is a(n)…
`for` loop
If you’re familiar with programming, you can probably skip this section.
A for loop lets you run the same code a specified number of times. The structure generally follows for(x in y) where x represents an item in y. If we think about a shopping basket with some apples,
bananas, and carrots, we could write for(food in basket) and food would represent each item in our basket. It would be apples the first time, bananas the second time, and carrots the third time. We
could also write it as for(food in 1:length(basket)) where 1:length(basket) is a vector of numbers that counts the items in your basket. Rather than food representing an item in your basket, it
represents an index in the vector. In this example, apples are at index 1, bananas at 2, and carrots at 3. for loops are also very flexible and can be used on many data types such as vectors,
data.frames, and matrices.
Let’s say you have a data.frame called basket that has three columns. It has the Food column with the name of the food, the PricePerUnit which has the unit cost for each food, and Quantity which has
the number of units of each food in your basket. It looks like this:
And it can be recreated with this:
If we wanted to get the total cost of everything in our basket, we could iterate over each row multiplying the PricePerUnit and Quantity and adding those to our running totals.
`apply` family
The apply family is part of base R and very similar to a for loop. Rather than running a set number of times, an apply runs a function on each item in a data.frame, list, vector, or other object that
can be applied to. While there are six different functions in the apply family, I’m only going to talk about the three most common; apply, lapply, and sapply.
The biggest differences between the three is the types of input that they accept and their output types. apply takes in a data.frame or matrix and has three function arguments. The first argument, x,
is the object we’re passing to it. The second argument is a number, either 1 or 2 or c(1, 2), that says if we want the function applied to rows, columns, or both rows and columns, respectively. The
last argument is the function call. sapply and lapply are the same, except they don’t have the second argument because they take either a vector or list which don’t have multiple dimensions.
Generally speaking, the apply family will return a vector, list, or array of some kind.
If we go back to the shopping basket example, we can calculate the total with an apply function. Our first argument is the basket, the second is a 1 because we want to apply to every row, and the
last is the function call. We can create the function in the apply call or we can create it earlier and then call it here.
A quick note on function calls in the apply family:
If a function call only has one argument, they can be done in three ways.
1. sapply(X, function(x) { ... }) if function is not predefined
2. sapply(X, function) if function is predefined
3. sapply(X, function(x)) if function is predefined
Option two is most common for built-in functions such as sum or as.numeric, but can be used with any function.
Vector Operations
Vector operations are not a function like the apply family or a for loop, but rather a feature of the R language. Instead of operating on a vector one item at a time, R is able to do an operation on
the entire vector in one line of code. Back to the basket example again, we know that the per item total is the PricePerUnit and Quantity multiplied together, and then we get the grand total by
summing all of those values.
When Should I use a(n)…
These examples are not exhaustive and you may find some cases where one is better than the others even where it seems like it might not be.
`for` loop
for loops in R should be a last resort. They are much slower compared to the apply family and vectorized code. They may be helpful when each iteration relies on the iteration before it, although then
you might want to look into a recursive function if possible. You might find a for loop useful if you need to run the same block of code multiple times or iterate over elements of an object in a
non-standard way such as every other item. Any code that can be written with an apply function or a vector operation can be written in a for loop.
`apply` family
The apply family should be used when you want to operate on each element of an object, but treat them individually. This might present as a list with vectors of differing lengths for each item or if
you want a specific type of output. Any vector operation can be written as an apply statement, but not all for loops can be converted.
Vector Operations
Vector operations are the gold standard. They are fast and can be used in many cases, but not all. Most common use cases will be on vectors or columns of a data.frame. Many base functions such as sum
and as.numeric are already vectorized. Many but not all for loops and apply functions can be written as vectorized operations.
Building the input
Rather than use the simple shopping basket example from before, I’ve written a small function that takes a data.frame of red, green, and blue values and adds a new column with the corresponding hex
And the resulting data should look like this:
We’ve also created a vector of values that can go in a hex code with numbers 0–9 and letters A-F.
Creating the conversion function
I used this website for the math behind my functions. In essence, you divide each number by 16 and round down and the resulting number corresponds to a position in hex. You then take the remainder of
the division and get the hex value that that number corresponds to. If our value is 227, then our first hex code is 227/16 would round down to 14 and the remainder would be 3. Because vectors in R
start at position 1, we add one to both for 15 and 4. The corresponding values in hex are E and 3 and so the hex pair for 227 is E3.
Implementing the conversion function
In a for loop
In an apply function
In a vectorized function
The results
Running the benchmark
I’ve simplified the for loop and apply implementations a little bit to better match the vectorized function. This way we have a better comparison between the three. Your benchmark results may be a
little different because it is a little dependent on your computer.
The important column is relative as that shows a comparison between the three with the quickest function given a value of 1. Using an apply function took roughly 20x longer and a for loop roughly 60x
longer than using a vectorized function.
A hand drawn Sonic the Hedgehog saying “Gotta go fast”
All the code for this article is available here. If you want to see more from me, check out my GitHub or guslipkin.github.io. If you want to hear from me, I’m also on Twitter at guslipkin.
Gus Lipkin is a Data Scientist, Business Analyst, and occasional bike mechanic | {"url":"https://guslipkin.medium.com/writing-faster-r-with-vectorization-and-the-apply-family-ff6078a2583a","timestamp":"2024-11-03T19:37:28Z","content_type":"text/html","content_length":"148474","record_id":"<urn:uuid:6972b0ef-a087-4aef-9629-aab5b906c1b1>","cc-path":"CC-MAIN-2024-46/segments/1730477027782.40/warc/CC-MAIN-20241103181023-20241103211023-00733.warc.gz"} |
Episode #4 of the course Everyday math by Jenn Schilling
Today, we will explore fractions in more detail. We’ve already discussed fractions a few times in this course, but this is our deep dive.
The Math
Fractions can be thought of as a type ratio that represents a comparison between a part and a whole. The fraction 1/4 represents 1 part of the whole (4 equal parts). The top number of a fraction is
called the numerator, and it represents the number of parts we have (in the case of 1/4, 1). The bottom number of a fraction is called the denominator, and it represents the number of equal parts in
the whole (in the case of 1/4, 4).
Fractions are simple to add and subtract as long as they have the same denominator, then you just add or subtract the numerators and keep the denominator. For example, 1/4 + 2/4 = 3/4. You can create
equal denominators in fractions by multiplying the numerator and denominator by the same whole number. For instance, to add 1/3 and 1/4, you could multiply the numerator and denominator of 1/3 by 4
and 1/4 by 3 to create 4/12 and 3/12. Then adding those fractions together, you would get 7/12.
To multiply fractions, you multiply the numerators and the denominators together. For example, 1/4 × 2/4 = 2/16 because 1 × 2 = 2 and 4 × 4 = 16. Fractions can be simplified by dividing the numerator
and denominator by the same number. For example, the previous answer, 2/16, can be simplified to 1/8 by dividing both the numerator and denominator by 2. These two fractions (2/16 and 1/8) are called
equivalent fractions.
Dividing fractions is slightly more complicated. A fraction can actually be thought of as a division problem. For instance, the fraction 1/4 is the same as “1 divided by 4.” Say we want to divide 1/2
by 1/4 (1/2 ÷ 1/4). The opposite of division is multiplication, and division by 1/4 is basically division by 1 divided by 4. This double division then turns into multiplication by the reciprocal of 1
/4, which is 4 or 4/1. So, we calculate 1/2 divided by 1/4 by multiplying 1/2 and 4. Therefore, 1/2 ÷ 1/4 = 1/2 × 4 = 2. The general rule for dividing fractions is to keep the first fraction (the
dividend), turn the division sign into a multiplication sign, and flip the second fraction (the divisor).
Everyday Applications
Fractions are super useful in our everyday lives! Fractions show up in time, money, cooking, and more!
When telling time, we often refer to fractions of an hour. For example, you might work on something for 90 minutes, or an hour and a half. One half of an hour is 30 minutes. We say a quarter past the
hour to mean 15 minutes past the hour.
The denominations of currency are often fractions of a whole. For example, an American quarter represents 25 cents, or 1/4 of a dollar. An American dime is 1/10 of a dollar, and an American nickel is
1/20 of a dollar. An American penny is 1/100 of a dollar.
Fractions show up frequently in cooking. Recipes often call for fractions of a cup (or teaspoon) of an ingredient, and it is useful to be able to compute calculations with fractions when scaling a
recipe up or down. For instance, if a recipe calls for 1/2 cup of flour, and you want to make half of the recipe, you will need to divide 1/2 by 2, which will give you 1/4 cup of flour.
I hope you’ve enjoyed our deep dive into fractions! Tomorrow, we will explore common concepts and applications of geometry.
Share with friends | {"url":"https://gohighbrow.com/fractions/","timestamp":"2024-11-03T07:15:30Z","content_type":"text/html","content_length":"65611","record_id":"<urn:uuid:44fe9c60-4516-41a2-afd4-149af002e40e>","cc-path":"CC-MAIN-2024-46/segments/1730477027772.24/warc/CC-MAIN-20241103053019-20241103083019-00224.warc.gz"} |
Square meter to square feet convert online
Easy square meters to square feet conversion with this free m^2 to ft^2 converter online. Easy to use, with quick copy button. Learn how to convert sq. meters to sq. feet with the help of our
calculation examples and reference table. Learn how many square feet equal one square meter, and what is the difference between meter and feet, how they are defined, and more. Online calculator to
convert square meters to square feet (m 2 to ft 2) with formulas, examples, and tables.Our conversions provide a quick and easy way to convert between Area units. One square meter is equal to
10.76391 square feet, so use this simple formula to convert: square feet = square meters × 10.76391 The area in square feet is equal to the square meters multiplied by 10.76391. For example, here's
how to convert 5 square meters to square feet using the formula above.
Square Feet. The square foot is a unit of area used in the imperial and U.S. customary measurement systems. A square measurement is the two-dimensional derivative of a linear measure, so a square
foot is defined as the area of a square with sides 1 ft in length. To convert from square meters to square feet, multiply your figure by 10.76391041671 (or divide by 0.09290304) . What is a square
foot? The square foot is used as a form of measurement within Canada and the United States. It can be adopted to describe the amount of floor space (for real estate) or the overall size of an
exterior property. Calculate square footage, square meters, square yardage and acres for home or construction project. Calculate square feet, meters, yards and acres for flooring, carpet, or tiling
projects. Enter measurements in US or metric units. How to calculate square footage for rectangular, round and bordered areas. Calculate project cost based on price per square foot, square yard or
square meter. Feet Meters: Area in Square Feet: Area in Square Meters . Did you find us useful? Please consider supporting the site with a small donation. click here for more information . BookMark
Us It may come in handy. Check out our Conversion Software for Windows. Can't find something? Try searching. Are you bored? Try the Fun Stuff. Was this site Online calculator to convert square meters
to square feet (m2 to ft2) with formulas, examples, and tables. Our conversions provide a quick and easy way to convert between Area units. To convert from square meters to square feet, multiply your
figure by 10.76391041671 (or divide by 0.09290304) . What is a square foot? The square foot is used as a form of measurement within Canada and the United States. It can be adopted to describe the
amount of floor space (for real estate) or the overall size of an exterior property.
If your measurements are in another unit let's say inches or meters, you will need to convert those measurements in feet by utilizing the method below.
How many square feet are in a square meter? Use this easy and mobile-friendly calculator to convert between square meters and square feet. Just type the number of square meters into the box and the
conversion will be performed automatically. To convert square meters to square feet, multiply the square meter value by 10.763910417. For example, to find out how many square feet in a square meter
and a half, multiply 1.5 by 10.763910417, that makes 16.1459 square feet in a square meter and a half. 1 Square Meter = 10.763910417 Square Feet. It is a free online square feet to square meter (sq
ft to sq m) area converter. A square feet is a standard measuring unit of area in an imperial and US customary measuring system. Square feet is denoted as sq. ft, sf, ft2. One square foot is equal to
0.09290304 square meters. A square meter is an SI derived measuring unit of area. Conversion between square feet and meter. Square feet to Meter Calculator
1 var= 1 sq yard= 0.836 sq m. Also, you can take the reference of available var to square feet converter online. 0
Calculate square footage, square meters, square yardage and acres for home or construction project. Calculate square feet, meters, yards and acres for flooring, carpet, or tiling projects. Enter
measurements in US or metric units. How to calculate square footage for rectangular, round and bordered areas. Calculate project cost based on price per square foot, square yard or square meter.
Convert Square Metres to Square Feet. Easily convert Square Metres (sq mt) to Square Feet (sq ft) using this free online unit conversion calculator.
Do a quick conversion: 1 square meters = 10.76391041671 square feet using the online calculator for metric conversions. Check the chart for more details. Square Feet. The square foot is a unit of
area used in the imperial and U.S. customary measurement systems. A square measurement is the two-dimensional derivative of a linear measure, so a square foot is defined as the area of a square with
sides 1 ft in length. To convert from square meters to square feet, multiply your figure by 10.76391041671 (or divide by 0.09290304) . What is a square foot? The square foot is used as a form of
measurement within Canada and the United States. It can be adopted to describe the amount of floor space (for real estate) or the overall size of an exterior property. Calculate square footage,
square meters, square yardage and acres for home or construction project. Calculate square feet, meters, yards and acres for flooring, carpet, or tiling projects. Enter measurements in US or metric
units. How to calculate square footage for rectangular, round and bordered areas. Calculate project cost based on price per square foot, square yard or square meter. Feet Meters: Area in Square Feet:
Area in Square Meters . Did you find us useful? Please consider supporting the site with a small donation. click here for more information . BookMark Us It may come in handy. Check out our Conversion
Software for Windows. Can't find something? Try searching. Are you bored? Try the Fun Stuff. Was this site
Online calculator to convert square meters to square feet (m2 to ft2) with formulas, examples, and tables. Our conversions provide a quick and easy way to convert between Area units.
This area conversion calculator will help you quickly convert between different units of area. Area Conversion. Acre, Are, Hectare, Square Foot, Square Meter
Do a quick conversion: 1 square meters = 10.76391041671 square feet using the online calculator for metric conversions. Check the chart for more details. Enter the value in square meters in the top
field (the one marked "m²"), then press the "Convert" button or the "Enter" key. The converter also works the other way 1 Square foot (ft²) is equal to 0.09290304 square meter (m²). To convert
square feet to square meters, multiply the square foot value by 0.09290304 or divide by 1 var= 1 sq yard= 0.836 sq m. Also, you can take the reference of available var to square feet converter
online. 0 Hectare, ha. Square Centimeter, cm². Square Foot, ft². Square Inch, in². Square Kilometer, km². Square Meter, m². Square Mile, mil². Square Yard, yd². Other units . 1 meter = 3.28 ft 1 sq
meter = 3.28 x 3.28 = 10.76 sq ft To convert sq ft to sq m, Many people believe that they can't do anything to protect their privacy online, This area conversion calculator will help you quickly
convert between different units of area. Area Conversion. Acre, Are, Hectare, Square Foot, Square Meter | {"url":"https://digoptionexjmooga.netlify.app/kisch3172sac/square-meter-to-square-feet-convert-online-379.html","timestamp":"2024-11-07T16:30:43Z","content_type":"text/html","content_length":"32919","record_id":"<urn:uuid:15176b36-b442-4acd-9c44-d14464726b54>","cc-path":"CC-MAIN-2024-46/segments/1730477028000.52/warc/CC-MAIN-20241107150153-20241107180153-00736.warc.gz"} |
Beginner Statistics for Psychology
6. Dependent t-test
This chapter will introduce you to the dependent means t-test, which is most often used for experiments with a repeated measures design. Repeated measures designs are very common experimental
approaches, just as posts on social media often compare before and after images to show off the effects of a diet or a renovation.
Actual footage of your instructor upon waking in the morning, demonstrating the qualitative effects of coffee
Repeated measures experimental designs are also known as within-subjects designs. Such an experiment involves obtaining two separate scores for each individual in the sample. Instead of having an
experimental group and control group, there is just one sample, from which the same participants are used in all treatment conditions. Typically this kind of study uses a pre-test post-test design.
As an example, perhaps I want to see if memory span is affected by the colour in which items are presented. I first test people on black and white items, then test them with red items. I will compare
their performance on the second test with their performance on the first test.
Another less-common type of experimental design that would be analyzed using a dependent t-test is the matched pairs design. In this type of approach, two separate samples are used, but each
individual in a sample is matched one-to-one with an individual in the other sample. This is most commonly used when the researcher is intent on controlling for a possible confounding variable and
thus matches participants based on that variable – for example, age or genetic relatedness. Because of this matching, the two samples are not independent, but rather they are related in some way.
Hence the name “dependent t-test”.
This may not be a familiar idea, so we will consider an example of a matched pairs design. Perhaps I want to test differences in memory capacity in an experimental group and compare to a control
group, but I know age can greatly impact this type of memory. So, I make sure for each person aged 20 in one group there is another person with the same age in the other group, and so on, for each
age. That way, I am getting the difference in memory scores for each matched pair, and thus age is explicitly controlled for as a possible third variable.
As before, the first step of the hypothesis test is to formulate hypotheses. The goal is to compare the means of two populations. This time, though, we not only have no standard deviation from
population 2, we also have no mean. For both populations, we will rely on sample-based estimates for the mean and the standard deviation. In a repeated measures experiment, we would have one set of
scores measured at baseline, the before scores. These scores will represent population 2, the comparison population. The scores that are measured after the experimental manipulation will represent
the research population, population 1.
To conduct the comparison, we will actually take the difference score for each individual in the study, by subtracting the before score from the after score, and then calculate the mean and standard
deviation of the difference scores. As an example, I made up some scores on a mood measure for people after eating chocolate and before eating chocolate, and calculated after-before difference scores
for each individual (shown above). Negative difference scores indicate mood scores went down after eating chocolate; positive difference scores indicate mood scores went up after eating chocolate.
(Worry not, this is a completely invented dataset — it seems unlikely to me that eating chocolate would actually worsen most people’s mood!)
In step 2, we need to approach the mean and standard deviation of the comparison distribution a little differently than before. The comparison distribution will now be the distribution of means for
the population of difference scores, which are defined as after-minus-before scores. Under the comparison population, the mean of difference scores should be 0: under the null hypothesis, there is no
no difference between those who ate chocolate and those who did not, for example, so there would be no change before to after. Thus we set the mean of the comparison population to 0.
Now for the standard deviation: we will need to use the sample of difference scores to generate an estimate of the comparison population standard deviation. Perhaps you are wondering why we calculate
difference scores as after-minus-before? This is important for the way we interpret the difference scores, and to fit the directionality of our hypothesis test. In our example, if people’s mood
scores worsen, this should result in a negative difference score, moving the mean toward the low end of the distribution, right? And if the mood improves that should result in a positive score. That
is why we have to set up the difference scores as after-minus-before.
If we look at these example data, right away by looking at the difference scores, we can tell the mood went down for almost every one, except for one person who did not change.
The formulas to calculate a sample-based estimate of the comparison distribution standard deviation are exactly the same as for a single sample t-test:
In fact, that is why I wanted to introduce you to the dependent t-test before we move on to the independent t-test, which has a different set of formulas.
Before we get to our example, I would like to note that once we calculate the difference scores for each individual in the sample, we will be using those difference scores to calculate the mean and
standard deviation. We no longer need the before or after scores for anything. I recommend crossing them out, so you are not confused about which numbers to include as X in the formulas.
In step 3, we need to determine the cutoff sample score. As with the single sample t-test, this will be derived from three pieces of information: the significance level, the directionality, and
degrees of freedom. We can use t-tables to find the cutoff score and map it onto our drawing of the comparison distribution.
Step 4 is the moment of truth – does the sample mean fall far enough from the comparison population mean to reject the null hypothesis? We can use the same t-test formula as for the single-sample
Remember, the comparison population mean is now set to zero, so we can use that in place of μ.
Once we have calculated the t-test result, we can mark it on comparison distribution to determine whether it falls in shaded tail or not.
Finally, it’s decision time. Did the sample mean of difference scores fall within a shaded tail on the comparison distribution? Is it extreme enough to reject the null?
As always, we can also use a calculator find the p-value, the precise probability that this t-test score (or more extreme) would have occurred by random chance alone under the comparison
If you were writing these results for publication, how would you translate the hypothesis test into a concise sentence? Does the chocolate make people’s mood change? In this example, we found that
mood scores were not significantly different after people consumed chocolate.
“We found that mood scores were not significantly different after people consumed chocolate (p = 0.16).”
We can support that statement with the information that the probability of the sample mean occurring on the comparison distribution was more than 5%. As a result we have an inconclusive hypothesis
As we continue to build our decision tree, you can use it to guide your choice of a statistical test appropriate for a particular research design.
If you have two samples, and they are in some way related, like in repeated measures or matched pairs designs, that’s when we should use the dependent means t-test. In the next chapter we will add
the independent means t-test to our toolbox.
Chapter Summary
In this chapter we introduced the use of the dependent means t-test in hypothesis tests for research designs such as repeated measures and matched pairs.
Key terms:
dependent means t-test repeated measures matched pairs
a test for statistical significance when comparing mean difference scores to zero in repeated measures or matched pairs designs
also known as within-subjects designs or pre-test post-test design, in which the experiment involves obtaining two separate scores for each individual in a single sample. The same participants are
used in all treatment conditions.
a research design for which a dependent means t-test may be used to test for a hypothesis test; in this design two separate samples are used, but each individual in a sample is matched one-to-one
with an individual in the other sample, most often matching participants on a a possible confounding variable as a way to control for the effects of that variable | {"url":"https://pressbooks.bccampus.ca/statspsych/chapter/chapter-6/","timestamp":"2024-11-02T19:03:09Z","content_type":"text/html","content_length":"122134","record_id":"<urn:uuid:96da7c91-639e-4e9d-8cbf-d94cb750cfd6>","cc-path":"CC-MAIN-2024-46/segments/1730477027729.26/warc/CC-MAIN-20241102165015-20241102195015-00024.warc.gz"} |
714-0589/01 – Stochastic Methods of Modelling (S)
Gurantor department Department of Mathematics and Descriptive Geometry Credits 5
Subject guarantor Mgr. Marcela Rabasová, Ph.D. Subject version guarantor Mgr. Marcela Rabasová, Ph.D.
Study level undergraduate or graduate Requirement Compulsory
Year 1 Semester winter
Study language Czech
Year of introduction 2010/2011 Year of cancellation 2019/2020
Intended for the faculties USP, HGF Intended for study types Follow-up Master
KAH14 Mgr. Marcela Rabasová, Ph.D.
Full-time Credit and Examination 2+2
Part-time Credit and Examination 6+6
Subject aims expressed by acquired skills and competences
The aim of the course is to provide theoretical and practical foundation for understanding the importance of basic probability concepts and teach the student statistical thinking as a way of
understanding the processes and events around us, to acquaint him with the basic methods of gathering and analyzing statistical data, and to show how to use these general procedures in other subjects
of study and in practice. Graduates of this course should be able to: • understand and use the basic terms from the combinatorics and probability theory; • formulate questions that can be answered by
the data and understand principles of collecting, processing and presentation of the data; • select and use appropriate statistical methods for data analysis; • propose and evaluate conclusions
(inference) and make predictions using the data. The graduate of this course should be able: • understand and use basic notions in combinatorics and probability theory • formulate questions, which
can be answered based on the given data, for this purpose learn the principles of collecting, processing data and presentation of relevant values and results • choose and use suitable statistical
methods for data analysis • suggest and evaluate conclusions (inference) and predictions obtained from data
Teaching methods
Individual consultations
Other activities
Combinatorics and probability. Random events, operations with them, sample space. Definitions of events' probability - classical, geometrical, statistics. Conditional probability. Total probability
and independent events. Random variable and its characteristics. Basic types of probability distributions of discrete random variables. Basic types of probability distributions of continuous random
variables. Random vector, probability distribution, numerical characteristics. Statistical file with one factor. Grouped frequency distribution. Statistical file with two factors. Regression and
correlation. Random sample, point and interval estimations of parameters. Hypothesis testing.
Compulsory literature:
Dummer R. M.: INTRODUCTION TO STATISTICAL SCIENCE. VŠB-TU Ostrava 1998; ISBN 80-7078-497-0
Recommended literature:
Dummer R. M.: INTRODUCTION TO STATISTICAL SCIENCE. VŠB-TU Ostrava 1998;
ISBN 80-7078-497-0
Way of continuous check of knowledge in the course of semester
Two tests, 1 project - data analysis.
Other requirements
Subject has no prerequisities.
Subject has no co-requisities.
Subject syllabus:
1. Combinatorics 2. Introduction to probability 3. Conditional probability and independent events. Bayes' theorem. Theorem of total probability 4. Random variable and its characteristics 5.-7. The
basic distributions of discrete and continuous random variable 8. Random vector 9. Statistical file with one factor 10. Statistical file with two factors 11. Regression and correlation 12. Point and
interval estimates of parameters 13. Hypothesis testing 14. Reserve
Conditions for subject completion
Occurrence in study plans
2017/2018 (N1701) Physics (1702T001) Applied Physics P Czech Ostrava 1 Compulsory study plan
2016/2017 (N1701) Physics (1702T001) Applied physics P Czech Ostrava 1 Compulsory study plan
2016/2017 (N1701) Physics (1702T001) Applied Physics P Czech Ostrava 1 Compulsory study plan
2015/2016 (N1701) Physics (1702T001) Applied physics P Czech Ostrava 1 Compulsory study plan
2014/2015 (N1701) Physics (1702T001) Applied physics P Czech Ostrava 1 Compulsory study plan
2013/2014 (N2102) Mineral Raw Materials (3902T033) System Engineering in Raw Materials Industry K Czech Ostrava 1 Compulsory study plan
2013/2014 (N2102) Mineral Raw Materials (3902T033) System Engineering in Raw Materials Industry K Czech Most 1 Compulsory study plan
2013/2014 (N1701) Physics (1702T001) Applied physics P Czech Ostrava 1 Compulsory study plan
2012/2013 (N2102) Mineral Raw Materials (3902T033) System Engineering in Raw Materials Industry P Czech Ostrava 1 Compulsory study plan
2012/2013 (N2102) Mineral Raw Materials (3902T033) System Engineering in Raw Materials Industry K Czech Ostrava 1 Compulsory study plan
2012/2013 (N2102) Mineral Raw Materials (3902T033) System Engineering in Raw Materials Industry K Czech Most 1 Compulsory study plan
2011/2012 (N2102) Mineral Raw Materials (3902T033) System Engineering in Raw Materials Industry P Czech Ostrava 1 Compulsory study plan
2011/2012 (N2102) Mineral Raw Materials (3902T033) System Engineering in Raw Materials Industry K Czech Ostrava 1 Compulsory study plan
2011/2012 (N2102) Mineral Raw Materials (3902T033) System Engineering in Raw Materials Industry K Czech Most 1 Compulsory study plan
2010/2011 (N2102) Mineral Raw Materials (3902T033) System Engineering in Raw Materials Industry K Czech Ostrava 1 Compulsory study plan
2010/2011 (N2102) Mineral Raw Materials (3902T033) System Engineering in Raw Materials Industry K Czech Most 1 Compulsory study plan
2010/2011 (N2102) Mineral Raw Materials (3902T033) System Engineering in Raw Materials Industry P Czech Ostrava 1 Compulsory study plan
Occurrence in special blocks
Assessment of instruction | {"url":"https://edison.sso.vsb.cz/cz.vsb.edison.edu.study.prepare.web/SubjectVersion.faces?version=714-0589/01&subjectBlockAssignmentId=184180&studyFormId=1&studyPlanId=16650&locale=en&back=true","timestamp":"2024-11-12T23:03:40Z","content_type":"application/xhtml+xml","content_length":"183617","record_id":"<urn:uuid:e71539f5-e60b-4c40-a163-1a1c226bfd9e>","cc-path":"CC-MAIN-2024-46/segments/1730477028290.49/warc/CC-MAIN-20241112212600-20241113002600-00888.warc.gz"} |
functorch.vjp(func, *primals, has_aux=False)[source]¶
Standing for the vector-Jacobian product, returns a tuple containing the results of func applied to primals and a function that, when given cotangents, computes the reverse-mode Jacobian of func
with respect to primals times cotangents.
☆ func (Callable) – A Python function that takes one or more arguments. Must return one or more Tensors.
☆ primals (Tensors) – Positional arguments to func that must all be Tensors. The returned function will also be computing the derivative with respect to these arguments
☆ has_aux (bool) – Flag indicating that func returns a (output, aux) tuple where the first element is the output of the function to be differentiated and the second element is other
auxiliary objects that will not be differentiated. Default: False.
Returns a (output, vjp_fn) tuple containing the output of func applied to primals and a function that computes the vjp of func with respect to all primals using the cotangents passed to the
returned function. If has_aux is True, then instead returns a (output, vjp_fn, aux) tuple. The returned vjp_fn function will return a tuple of each VJP.
When used in simple cases, vjp() behaves the same as grad()
>>> x = torch.randn([5])
>>> f = lambda x: x.sin().sum()
>>> (_, vjpfunc) = functorch.vjp(f, x)
>>> grad = vjpfunc(torch.tensor(1.))[0]
>>> assert torch.allclose(grad, functorch.grad(f)(x))
However, vjp() can support functions with multiple outputs by passing in the cotangents for each of the outputs
>>> x = torch.randn([5])
>>> f = lambda x: (x.sin(), x.cos())
>>> (_, vjpfunc) = functorch.vjp(f, x)
>>> vjps = vjpfunc((torch.ones([5]), torch.ones([5])))
>>> assert torch.allclose(vjps[0], x.cos() + -x.sin())
vjp() can even support outputs being Python structs
>>> x = torch.randn([5])
>>> f = lambda x: {'first': x.sin(), 'second': x.cos()}
>>> (_, vjpfunc) = functorch.vjp(f, x)
>>> cotangents = {'first': torch.ones([5]), 'second': torch.ones([5])}
>>> vjps = vjpfunc(cotangents)
>>> assert torch.allclose(vjps[0], x.cos() + -x.sin())
The function returned by vjp() will compute the partials with respect to each of the primals
>>> x, y = torch.randn([5, 4]), torch.randn([4, 5])
>>> (_, vjpfunc) = functorch.vjp(torch.matmul, x, y)
>>> cotangents = torch.randn([5, 5])
>>> vjps = vjpfunc(cotangents)
>>> assert len(vjps) == 2
>>> assert torch.allclose(vjps[0], torch.matmul(cotangents, y.transpose(0, 1)))
>>> assert torch.allclose(vjps[1], torch.matmul(x.transpose(0, 1), cotangents))
primals are the positional arguments for f. All kwargs use their default value
>>> x = torch.randn([5])
>>> def f(x, scale=4.):
>>> return x * 4.
>>> (_, vjpfunc) = functorch.vjp(f, x)
>>> vjps = vjpfunc(torch.ones_like(x))
>>> assert torch.allclose(vjps[0], torch.full(x.shape, 4.))
Using PyTorch torch.no_grad together with vjp. Case 1: Using torch.no_grad inside a function:
>>> def f(x):
>>> with torch.no_grad():
>>> c = x ** 2
>>> return x - c
In this case, vjp(f)(x) will respect the inner torch.no_grad.
Case 2: Using vjp inside torch.no_grad context manager:
>>> with torch.no_grad():
>>> vjp(f)(x)
In this case, vjp will respect the inner torch.no_grad, but not the outer one. This is because vjp is a “function transform”: its result should not depend on the result of a context manager
outside of f. | {"url":"https://pytorch.org/functorch/0.2.1/generated/functorch.vjp.html","timestamp":"2024-11-04T04:34:10Z","content_type":"text/html","content_length":"33939","record_id":"<urn:uuid:5dfd26df-f240-4fdf-9de6-339329e0daad>","cc-path":"CC-MAIN-2024-46/segments/1730477027812.67/warc/CC-MAIN-20241104034319-20241104064319-00560.warc.gz"} |
Number Line Branch | Pagefind XKCD Demo
← Back
July 8, 2024
[A diagram reminiscent of both the number line and a transit system diagram. The line starts at the left and goes right through points labeled 0, 1, 2, and 3, at which point there is a split into two
branches. The top branch continues: 4, 5, 6, 7, 8, 9, 10, …. The bottom branch is shorter, labeled with five curious glyphs: a square, a near-vertical line with two short horizontal lines jutting out
from it, a phi-like/lollipop symbol, a spiral, and a delta/triangle symbol.]
[Caption below the panel:]
Good news!
After thousands of years, mathematicians have finally opened a second branch on the number line to reduce congestion. | {"url":"https://xkcd.pagefind.app/comics/2024-7-8-number-line-branch/","timestamp":"2024-11-04T20:47:18Z","content_type":"text/html","content_length":"5220","record_id":"<urn:uuid:62d01ebf-b69b-4b7c-82c7-8a014792f4db>","cc-path":"CC-MAIN-2024-46/segments/1730477027861.16/warc/CC-MAIN-20241104194528-20241104224528-00441.warc.gz"} |
Stop the Clock
This is a game for two players. Can you find out how to be the first to get to 12 o'clock?
This is a game for two players. You can use the interactivity below, or you could print off a page of blank clock faces in Word or as a pdf.
Set the time on the clock to 6 o'clock to start the game.
Decide who will go first (player 1) and who will go second (player 2).
Take it in turns to choose to move the hands of the clock on by $\frac{1}{2}$ hour or by 1 hour. For example, player 1 could choose $\frac{1}{2}$ hour, so the clock hands move to 6.30, then player 2
might choose 1 hour, moving the clock hands to 7.30... etc.
The winner is the player who moves the hands exactly onto 12 o'clock.
Can you work out a winning strategy so that you can always beat your opponent?
Getting Started
You could print off a sheet of blank clocks (Word document or pdf) to record the times you and your partner choose.
Play the game several times. What do you notice?
What happens if your opponent gets to 10.30? Why?
How can you make sure you get exactly on 12 o'clock? What time would you leave on the clock so that you can get to 12.00 on your next go, after your opponent has been?
So, what time would you want the clock to say on the go before that?
How can you work out these "key times" that you must "land on" on your way to the target?
Student Solutions
A number of pupils from Mortimer School in England sent in their solutions.
Here are their comments:
Alice and Oliver:
When your partner is doing 1/2 an hour you should do a 1 hour.
Aaron and Mustafa:
Get the clock on to half past ten and then try and make him use half an hour and you use 1 hour so it goes on to 12 o'clock.
What would happen if your partner didn't use half an hour? Could you still win?
Harry and Gabe:
I pressed 1 hour when it was 11
Luke and Eve:
We think that you have to press 5 hours and 2 half hours for player 1 to win the game and 4 hours and 3 half hours for player 2 to win the game.
Dylan and Jacob:
We wrote that we did 1 hours and half an hour.
Thank you very much for these contributions. The difficulty is to find a way of winning that ALWAYS works.
Rhys from St. Michael's on the Mount in Bristol, England, sent in this email:
With this strategy if you go second you are guaranteed to win.
The aim is to get to 7.30, then 9.00, then 10.30 - after that you have won.
If player one goes to 6.30 you would go 1 hour to 7.30.
If player 1 goes to 7.00 on their opening move you would then go half an hour to 7.30.
That is a fantastic strategy, Rhys. I wonder if anyone can explain why it works?
Teachers' Resources
Why play this game?
Stop the Clock
is a motivating context in which children can develop their fluency with telling the time and calculating time intervals. However, the real challenge here is to find a winning strategy and, at the
highest level, to be able to beat an opponent whatever the start time and whatever the time intervals.
Possible approach
Introduce the game to the class by playing as a whole group, perhaps one half against the other, several times. Then suggest that children play in pairs, either at computers, or by using sheets of
blank clocks (
Word document
) to record their game. Challenge them to find a strategy for beating their partner.
As they play, circulate around the classroom and ask them what they think is important so far. Some might suggest that in order to win, they must make the clock show 10.30. Others may have thought
further back and have ideas about how they can make sure they get to 10.30, and therefore 12.00. After a suitable length of time bring the whole class together and invite one pair to demonstrate
their strategy, explaining their decisions as they go along. Use other ideas from the group to refine the strategy.
You could then choose some extension ideas (see below) for pairs to work on - perhaps different pairs working on a different set-up. Investigating this game fully could become a long-term challenge
for the class which you come back to at various stages throughout a term, for example.
Key questions
What happens if your opponent gets to 10.30? Why?
How can you make sure you get exactly on 12 o'clock? What time would you leave on the clock so that you can get to 12.00 on your next go, after your opponent has been?
So, what time would you want the clock to say on the go before that?
How can you work out these "key times" that you must "land on" on your way to the target?
Possible extension
Invite children to investigate how their strategy would change if they could choose a different starting time.
What about if they were only allowed to choose quarter of an hour, half an hour or three quarters of an hour?
How would their strategy change if the could choose quarter of an hour or half an hour only?
Possible support
The length of the game can be reduced by choosing 9 o'clock as the start time. A game starting at 9.00 involves the same thinking, which is the important point, but might be more manageable for some
children. If pupils are encouraged to record the times that are made and the intervals chosen, then it will help them to notice patterns. | {"url":"https://nrich.maths.org/problems/stop-clock","timestamp":"2024-11-11T01:49:17Z","content_type":"text/html","content_length":"44515","record_id":"<urn:uuid:59a146a3-17fa-45ef-8bbe-a5c3e4723bbe>","cc-path":"CC-MAIN-2024-46/segments/1730477393980.94/warc/CC-MAIN-20241114162350-20241114192350-00584.warc.gz"} |
Let's talk – number talk (230 minus 190)
Stage 2 – a thinking mathematically targeted teaching opportunity focused on different ways to think about 230-190.
Syllabus outcomes and content descriptors from Mathematics K–10 Syllabus (2022) © NSW Education Standards Authority (NESA) for and on behalf of the Crown in right of the State of New South Wales,
Collect resources
You will need:
• pencils or markers
• something to write on.
Let's talk 1 – Stage 2
Watch the Let's talk 1 - Stage 2 video (15:58).
Welcome back mathematicians. We hope you're having a really lovely day today.
Today we thought we would embrace our inner George Polya, who was a really famous mathematician who also once famously said this. That it's better to solve one problem in 5 different ways than to
solve 5 different problems.
[Screen shows an image of the quote.]
And so, to Georges' point, we're going to think about how many different ways, in fact, can we think of 5 different strategies to solve our problem, 23 minus 19.
[Screen shows a blank piece of paper which fills the screen. There is an orange card at the top of the screen that reads, ‘23 minus 19’.]
Now I know what you thinking, oh, 23 minus 19. This is not much of a brain sweat for me yet. Stick with me. Your challenge is coming. Okay, so what I'd like you to think about is, what is one
strategy that you could use to solve this problem? Okay, and once you've thought of one strategy, you might, you know, can you think of a second strategy that you could use?
Yeah, and for those of you that are familiar, we're sort of doing a number talk. Aren't we? Where in a classroom, we might use hand signals. Like this means I'm thinking.
[Presenter makes a fist to show that they are thinking.]
This means I have one possible strategy of thinking through this problem.
[Presenter keeps their hand in a fist, but holds up a thumb.]
This means I have another strategy and so on.
[Presenter holds up a second finger to show that they have 2 strategies.]
Okay, so hopefully you've got one way of thinking about this. We thought about this with some students too, they can't be here with us today, so we're going to represent their thinking. So the team
represented by the ‘strong man’ suggested, well, you could think about 19 and partition it, into its parts, so to break it apart.
[Presenter shows a ‘strong man’ figurine and places it on the paper.]
And they said, really 19 is made up of 10 and 9.
[Presenter pulls out an A4 piece of paper and a blue marker. At the top of the paper, on the right-hand side of the page, they write the number ‘19’. They then draw 2 diagonal lines underneath the
number to partition it into tens and ones. One diagonal line slants towards the left, and the other diagonal line slants towards the right. Underneath the left diagonal line, they write the number
‘10’. Underneath the right diagonal line, they write the number ‘9’.]
So we could think of 23 minus 19 as 23 minus 10. And they said that was 13 and then 13 - 9 and they said that what they would do is subtract the ones by using the jump strategy.
[Presenter goes back to where they have written the number ‘19’. They add more detail to create a full number sentence. The number sentence now reads, ‘23 minus 19’. Underneath all of their previous
working out, the presenter writes, ‘23 minus 10 equals 13.’ Underneath this number sentence, they then write, ‘13 minus 9’.]
So let's have a look at what that looks like on a number line.
[Presenter moves the A4 piece of paper out of view.]
And we've been playing around with this idea of, you know, how do we record number lines and get our eye in to make them proportional. So we'll share with you a strategy that we've been using with
these guys today. And the first thing is, we've modelled our quantity so we have 23.
[Presenter brings out some connected cubes and places them on the paper. There is one row of 10 red cubes, one row of 10 orange cubes and one shorter row of 3 cubes. In the shorter row of 3 cubes,
there is one green cube, one blue cube and one black cube.]
The two long sticks here are each 10. That is what this number here represents.
[Presenter points to the 2 rows of 10 cubes. On the orange card at the top of the page, they then point to the ‘2’ digit in the number ‘23’.]
And the three here is what this number represents in the, in the numbers.
[Presenter points to the shorter row of 3 cubes. On the orange card at the top of the page, they then point to the ‘3’ digit in the number ‘23’.]
And I know these are ten 'cause I made them, but we could, I could prove to you it's 10 by snapping them in half. And what I know is that my brain and your brain has this capacity to subitise
quantities, so without having to count, I can actually see this chunk of 3 and this chunk of 2, and I know 3 and 2 together is 5 and double 5 is 10. So that has to be 10 bricks high, and if I line
that up. That's also 10.
[Presenter snaps the orange row of blocks in half, making 2 rows of 5. On one of the rows of 5, they circle their finger around 3 of the blocks. They then circle their finger around the remaining 2
blocks. Presenter puts the 2 rows of 5 back together, once again making a full row of 10 blocks. They then place the row of orange blocks next to the row of red blocks.]
So now I have my 2 tens, which is what this shows me, and my 3 ones.
[Presenter connects the orange row and the red row together to make one long row. On the orange card at the top of the page, they point to the ‘2’ digit in the number ‘23’. Presenter then connects
the shorter row of 3 cubes to the end of the long row. They have now created a row of 23 cubes – the row of orange cubes, followed by the row of red cubes, followed by the short row of 3
differently-coloured cubes.]
And we're going to represent their thinking using a number line and will use blue for the strong man.
[Presenter places the long row of cubes horizontally on the piece of paper. Using a blue marker, they trace a straight line that is the exact length of the row of cubes.]
And yeah, we've been using them almost like a measure, and if I come here and carefully mark the end, that's where 23 goes. And actually my number line could keep going if I wanted.
[At the end of the line, the presenter draws a small vertical marking and writes the number ‘23’. They then extend the line slightly and add an arrowhead that is pointing to the right. This shows
that the number line could extend further.]
And this is where zero would be and also, my number line would keep going in the other direction.
[At the start of the line, the presenter draws a small vertical marking and writes the number ‘0’. They then extend the line slightly and add an arrowhead that is pointing to the left. This shows
that the number line could extend further.]
And what the strongman team said they did, was the first thing was, they got rid of 1 jump of 10. So, so I'm now thinking about where my ten is and I know there's 3 here. So if I go with the 3 left
behind strategy, that will be a jump of 10 and I can prove that by using direct comparison.
[Presenter brings back the A4 piece of paper and places it under the horizontal row of cubes. They point to the 3 differently-coloured cubes at the end of the long row. They then point to the first 3
red cubes in the middle of the row. Presenter holds down these 3 red cubes and breaks off the line of cubes that come after it. In total, they remove 10 cubes from the long row. Presenter takes this
line of 10 cubes and holds it up against the line of orange cubes to prove that they are the same size. They then put the line of 10 cubes to the side. This leaves 13 cubes remaining under the number
line – 10 orange cubes and 3 red cubes. Presenter draws a curved line above the number line. This line starts at the number ‘23’ and stops at the end of the row of 13 cubes. Underneath the curved
line, they write ‘minus 10’.]
And then they said, now we would count back by ones 9 times. So can you help me keep track of the count? 1. 2. 3, whoops. 4.
[Presenter snaps off one block at a time from the right-hand end of the row, counting out loud as they do so. Each time they remove a cube, they draw a curved line on the number line to mark the cube
that has just been removed. Presenter snaps off the first 4 blocks while counting out loud. After that, they continue snapping off the blocks silently. Presenter keeps removing blocks in this way
until only 4 blocks are left.]
9, which leaves? 4. So the 13 minus 9 is 4.
[Presenter draws a small vertical marking on the number line at the end of the fourth block. They then write the number ‘4’ above it. On the A4 piece of paper, they complete the final number sentence
that they started earlier. The number sentence now reads ‘13 minus 9 equals 4”.]
And so what we have here is the 1 ten and the 9 more of 19 and I can record the strong man's team's thinking over here as 23 minus 19 is equivalent in value to 4.
[Presenter holds up the line of 10 blocks that they removed earlier. They then gesture to the 9 individual blocks that they removed. Presenter moves their marker to the end of the blue number line
that they have created. Next to it, they write, ‘23 minus 19 equals 4’.]
So like George Polya, though, we're like, well, let's see what other strategies that we can come up with. And so, as I reassemble these blocks, someone else in our group had a really interesting idea
and they were thinking about, well, I know something about addition and subtraction and that is that they are related, and so I can use addition to solve subtraction problems. So enter in fancy robot
dancing man, that's what we decided to call him.
[Presenter reassembles the cubes to how they were in the beginning. There is a row of 10 orange cubes, a row of 10 red cubes, and a smaller row of 3 differently-coloured cubes. Presenter picks up the
‘strong man’ figurine and places it out of view. They then bring in a robot figurine and place it on the paper. They also collect a green marker and put it underneath the figurine.]
And this team, the green team we will call them, thought, re-thought, about the problem and they said, well, actually, when you're solving subtraction, you can just think addition. So what I know is
that 19 plus something is equivalent in value to 23 and we need to work out what the difference is.
[Presenter pulls out a new piece of A4 paper. Using the green marker, they write ‘19 plus a blank space equals 23’.]
They said then what they would do is 19 plus 1 is 20, because that gets them to a landmark number and then they said from 20, they know that just to add, 3 more is 23 because they would rename it.
And what we wondered about, is how we could record that on a number line.
[Underneath the first number sentence, presenter writes ‘19 plus 1 equals 20’. They then write, ‘20 plus 3 equals 23’ under that. Presenter places the A4 piece of paper out of view.]
So this is what we came up with. We said, well, we could use our 23. And I'm going to try to line them up so that you can see them. And here's my number line. There's 23 with my arrow 'cause that it
extends in that direction and zero and my arrow.
[Presenter picks up the long row of cubes and places it underneath the first number line. Using the green marker, they create a number line similar to the one that was drawn before – with the number
‘0’ on the left side, the number ‘23’ on the right side, and arrowheads pointing outwards on either end.]
And what they were saying is that what we what we know is that 23 is here and we need to find 19 to work out the space between the difference and they said, well, since we know this is 1 ten and this
is another ten. 19 must be here because 19 is 1 less than 20, that's right. And then they added 1. And then they added 3 more.
[Presenter traces their finger along the 10 orange cubes, followed by the 10 red cubes. They point to the end of the ninth red cube, and place a little vertical marking on the number line above it.
Presenter draws a small curve above the tenth red cube. Above the curve, they write, ‘plus 1’. They then draw another curve above the final 3 differently-coloured cubes. Above the curve, they write,
‘plus 3’.]
Yeah, so they still have, if I take this section of brick off, it's still a difference of 4. But they just thought about the problem differently.
[Presenter breaks off the last 4 cubes in the row. They then move the cubes up to the start of the blue number line to prove that the size is exactly the same.]
So in this case what they thought about was 19 plus something is 23 and they worked out that that means 19 plus 4 is 23. That was their solution.
[Presenter brings back the A4 piece of paper and places it under the horizontal row of cubes. They then move their marker to the end of the green number line that they created. Next to it, they
write, ‘19 plus a blank space equals 23. 19 plus 4 equals 23.’]
And then we were having a really interesting conversation about how you can use addition to solve subtraction and in fact subtraction to solve addition, when along came the Flamingo team, and the
Flamingos were like, well, hold on a second. We've got another way that we could think about this problem, and they said we would just rethink the problem altogether, where I don't want to deal with
23 minus 19 because 19 is not a landmark number.
[Presenter picks up the robot figurine and places it out of view. They then bring in a flamingo figurine and place it on the paper. Presenter reassembles the cubes to how they were in the beginning.
There is a row of 10 orange cubes, a row of 10 red cubes, and a smaller row of 3 differently-coloured cubes.]
So, in actual fact, I can say this, 23 minus 19 is equivalent in value to 24 minus 20 and they said, and I immediately just know it in my head that that's a difference of 4.
[Presenter pulls out a new piece of A4 paper. Using a purple marker, they write ‘23 minus 19 equals 24 minus 20’. Underneath this, they also write, ‘equals 4’.]
And we were like, wow, can you explain your thinking more please? It was a bit like this. Can you explain your thinking more please, Flamingo? Of course I can, Robot.
[Presenter picks up the flamingo figurine and the robot figurine. They play with the 2 figurines on screen to make it look like they are talking to each other. Presenter then puts both figurines back
where they were.]
So this is what happened. Because, because what the Robot team and the Strongman team were wondering about is that if this is 23, and if I now make a collection of 24, you know this, this tower is
one block more than this one, so how does this work?
[Presenter picks up the long row of cubes and places it underneath the second number line. They then create a new row of cubes that is 24 blocks long. There are 10 green cubs, followed by 10 blue
cubes, followed by a brown cube, a red cube, an orange cube and a yellow cube. Presenter places this new row of cubes underneath the original row.]
So let's have a look, so we'll use the 24 and I'll line this up as best as I can to create our number line. And this time we're starting at 24, but again, our number line can continue in this
direction. And this is where zero is. And it continues in this direction.
[Presenter moves the row of 23 cubes off screen. Using the purple marker, they use the row of 24 cubes to create a number line that is similar to the ones that were previously drawn. This number line
has the number ‘0’ on the left side, the number ‘24’ on the right side, and arrowheads pointing outwards on either end.]
And the first thing they did was to take a big jump to subtract 20. So to work out 20 what I'm going to think about is this section here. There's 4 more than the number of tens, and so I'm going to
leave the same quantity behind, so that will give me 10. And I can check by measuring. And I'm going to do the same thing where there's 4 extra, so I'm going to do the 4 left behind strategy.
[Presenter points to the 4 differently-coloured cubes at the end of the long row. They then point to the first 4 blue cubes in the middle of the row. Presenter holds down these 4 blue cubes and
breaks off the line of cubes that comes after it. In total, they remove 10 cubes from the long row. Presenter takes this line of 10 cubes and holds it up against the line of green cubes to prove that
they are the same size. They then put the line of 10 cubes back where they were, but slightly separated from the main row. Presenter creates another group of 10 cubes by holding down the first 4
green cubes and breaking off the line of cubes that comes after it. The presenter now has 4 cubes in a row, followed by 10 cubes in a row, followed by another 10 cubes in a row.]
And that's going to give me a really big mega jump of minus 20. And as you'll see, it leaves 4.
[Presenter draws a large, curved line above the number line. The curved line starts at the number ‘24’ and finishes at the end of the first 4 cubes. Underneath the curved line, they write ‘minus 20’.
Presenter makes a small marking on the number line at the end of the curve. Above it, they write the number, ‘4’.]
So we thought this was really interesting. The Strongman, the Robot guys and the Flamingo team had come up with 3 different ways, or different strategies, to think about 23 minus 19 and my challenge
for you now mathematicians is how could you use these different strategies?
[Presenter brings the 3 figurines back into view. Text on screen then reads, ‘Where’s my challenge?’]
The blue strategy, the purple strategy and the green strategy, or the green strategy to think about this problem instead.
[Text on screen reads, ‘230 minus 190’.]
Ah, told you it was gonna get a bit more sweaty! Over to you to think about that, mathematicians.
[Text on screen reads, ‘Pause the video here whilst you do some thinking’.]
Welcome back mathematicians. How did you go?
[Text on screen reads, ‘Let’s investigate this a little…’]
Okay, so let's debrief this idea of how we can use what we solved here with these guys, I'll just move them out of the way.
[Screen once again shows the 3 figurines and the big sheet of paper that has all of the working out on it. The orange card at the top of the screen now reads, ‘230 minus 190’. The presenter picks up
this card and puts it to the side. Underneath it, the original card that read ‘23 minus 19’ is still there. Presenter picks up the 3 figurines and moves them off screen.]
What we did with the blue team, the green team, oh sorry, the Strongman, the Robot and the Flamingo. And how we could use those strategies in this context, to help us think about this context.
[Presenter points to the original orange card, followed by the new orange card.]
And it really comes down to this idea of renaming numbers. So I know some of you will be looking at this and you'll maybe have thought about a trick that you might have been told once about adding
zeros and subtracting zeroes. So let's clarify that for a moment.
Here I've got some paddle pop sticks. I think you can see that. I'll put them on there so it's easier. Okay, I've got 3 paddle pop sticks. Okay, now add zero more paddle pop sticks to my 3. Yes, I
still have 3. Now, take, take away zero paddle pop sticks.
[Presenter places three craft sticks on top of a red piece of paper. While the presenter is talking, the amount of craft sticks never changes.]
This is a really cool thing about mathematics. This law actually, that when you add zero or subtract zero it doesn't change what happens. So when we learn this trick of adding a zero, it's
mathematically incorrect. What actually you are using here, is this knowledge of place value and renaming. So let's have a look at that.
[Presenter pulls out a piece of paper that has 6 columns on it. From left to right, the columns are labelled, ‘hundreds’, ‘tens’, ‘ones’, ‘hundreds’, ‘tens’, and ‘ones’.]
I've got this little part portion odds chart for you to look at. And look if I have 3 ones over here, we would write the number 3. 1, 2, 3, so we would write 3 here.
[Presenter places the 3 craft sticks into the right-most ‘ones’ column. They then remove the craft sticks to write the numeral ‘3’ in that same column.]
If I move them into here, I actually still only have 3 ones and if I add zero or take zero away, I still just have 3 ones. What I know is that if I want to make them move across into tens where a
zero will appear when I write it, like this, then what I need to do to each of these is multiply them by 10, which means these 3 ones become 3 tens.
[Presenter moves the 3 craft sticks into the right-most ‘tens’ column. They then remove the craft sticks to write the numeral ‘3’ in the tens column, and the numeral ‘0’ in the ones column. The
presenter puts the 3 craft sticks back on to the red piece of paper. One by one, they trade each of the individual craft sticks for bundles of craft sticks. There are 10 craft sticks in each bundle.
The bundles are tied together with an elastic. By the end of this process, there are 3 bundles of craft sticks on the red piece of paper, making 30 craft sticks in total.]
And they would then go into here and so I still have a 3 in my tens column and now a zero in my ones place because the zeros letting me know hey, these 3 are worth 3 tens, not just 3 ones.
[Presenter stacks the 3 bundles of craft sticks into the right-most tens column. Once they are done, they move the bundles back to the red piece of paper. They also bring back the 3 individual craft
sticks. Presenter gestures to show the difference in size between the bundles and the individual sticks. They then move the craft sticks and the 2 pieces of paper off screen.]
Okay, so you hopefully were using some sort of strategy around renaming to help you here, and we could do the same with each of these strategies. So let's have a look at the first one. Because what
you might have then thought about is, we had these blocks and each one of these blocks was representing 1.
[Presenter brings back the row of blocks that was used for the first solution. There are 10 orange cubes, followed by 10 red cubes, followed by 3 differently-coloured cubes. They place these cubes
directly underneath the blue number line.]
You know, we had 23 and we have 23 blocks. What we can think of is that maybe each one of these blocks instead of now being worth 1 is actually worth a 10.
[Presenter begins writing the word ‘ten’ on each cube in black marker. They start with the differently-coloured cubes, and then repeat the process with all of the red cubes.]
Which means these are also all worth 10s. There's 1 of them, 2 of them, a third 10, a fourth 10, a fifth 10, a sixth 10, a 7th 10, an 8th 10, a 9th 10 and a tenth 10. And we do this really cool thing
with place value that when we get to 10 tens, we regroup, and we rename it. And so actually, this becomes 100 or is representing 100 and the same, yeah, is happening over here.
[Presenter pulls out a strip of red paper that is the exact same size as the 10 red cubes. On the strip of paper, the presenter has written, ‘1 hundred’. The presenter places this strip of paper on
top of the red cubes, covering them entirely. They then do the same thing with the orange cubes – this time, with an orange strip of paper.]
And so now what I'm thinking about is 230 minus 190 or 23 tens minus 19 tens, and we're going to use the same strategy. So the first thing these guys did was think about, you could think about, was
instead of 23 minus 10. It's now 22 tens minus 10 tens, which is equivalent to 100.
[Presenter removes the orange card that reads, ‘23 minus 19’. They then point to the card that reads ‘230 minus 190’, and gesture to the parts of each number that match what they’re saying.]
And we could still use the same left behind strategy. With my 3 left behind, but I'm just now saying that's 100 gone and so actually this is now 23 tens, and that's 10 tens, which is 100 and that's
[Presenter begins repeating the same process that they followed for the ‘strong man’ solution – but this time, using hundreds instead of ones. They move the red ‘1 hundred’ strip of paper to the
final 10 cubes in the row, and also separate these cubes from the rest of the row. This line of cubes is moved to the bottom of the screen. They also take a yellow sticky note and place it on top of
the number ‘23’ on the number line. The sticky note reads, ‘23 tens’. They then add another sticky note next to where ‘minus 10’ was written on the original number line. This sticky note reads,
‘tens’. As a result, the text on screen now reads, ‘minus 10 tens’.]
And then the next thing they did was go by ones, which in this case is 10. So that's 1 ten, another 10, a thrid ten and now I have to, yeah, repartition my 100, a third ten, a fourth ten, a fifth
ten, a sixth ten, a seventh ten, an eighth ten and a ninth ten.
[The presenter begins breaking off one cube at a time, just like they did earlier. They count out loud as they do so. When they reach the orange cubes, they remove the orange strip of paper and
continue breaking off cubes. They stop when there are 4 cubes left. The presenter writes the word ‘ten’ on top of each of the remaining cubes.
And because these are all worth ten, that means this is worth 4 tens, which means 23 minus 19 equals 4.
[The presenter adds a sticky note next to where the number ‘4’ was written on the original number line. This sticky note reads, ‘tens’. As a result, the text on screen now reads, ‘4 tens’. The
presenter then points to the number sentence that was written at the end of the blue number line. Underneath it, they write, ‘23 ten minus 19 ten equals 4 ten’. They then write ‘equals 40’ below
I could say 23 tens minus 19 tens is 4 tens. Which is 40 and we just rename it. So that's one way that we could think about this problem.
[Text on screen reads, ‘Back to you, mathematicians!’]
All right back over to you mathematicians, to think about how you can use renaming to adjust, or think about, your other strategies. Back to you.
[End of transcript]
• How could you use the strategies shared by the blue team‘s thinking (Strongman), green team‘s thinking (Robot) and purple team’s thinking (Flamingo) to solve your problem?
• Record your thinking in your student workbook.
• Write a problem where you could use renaming to help you work out a solution.
• Record your thinking in your student workbook. | {"url":"https://education.nsw.gov.au/teaching-and-learning/curriculum/mathematics/mathematics-curriculum-resources-k-12/thinking-mathematically-resources/mathematics-s2-lets-talk-230-minus-190","timestamp":"2024-11-14T17:56:01Z","content_type":"text/html","content_length":"209490","record_id":"<urn:uuid:e08b06dc-4fd3-4ab0-8326-a28655faff45>","cc-path":"CC-MAIN-2024-46/segments/1730477393980.94/warc/CC-MAIN-20241114162350-20241114192350-00337.warc.gz"} |
Penrose Tiling Explained
Last week, I posted some obfuscated Python which generates Penrose tiling. Today, I’ll explain the basic algorithm behind that Python script, and share the non-obfuscated version.
The algorithm manipulates a list of red and blue isosceles triangles. Each red triangle has a 36° angle at its apex, while each blue triangle has a 108° angle.
In Python, we can represent such triangles as tuples of the form (color, A, B, C). For the first element, color, a value of 0 indicates a red triangle, while 1 indicates blue. The rest of the tuple
gives the co-ordinates of the A, B and C vertices, expressed as complex numbers. Complex numbers work well here since they can represent any point on the 2D plane – the real component gives the x
co-ordinate, while the imaginary component gives the y co-ordinate.
As you can see, we draw an outline along the sides of the triangle, but not along the base. This allows each triangle to connect with another triangle of the same color, forming the rhombus-shaped
tiles that are visible in the final Penrose tiling.
Now here’s the fun part. Given a list of such triangles, we can subdivide each one to generate another triangle list. A red triangle is subdivided into two smaller triangles as follows:
The above subdivision introduces a new vertex P, located at a point along the edge AB which satisfies the golden ratio, \(\frac{1 + \sqrt{5}}{2} \).
Similarly, each blue triangle is subdivided into three smaller triangles:
This subdivision introduces two new vertices: Q along the edge BA, and R along the edge BC, at points which also satisfy the golden ratio. As well, two of the resulting triangles are mirrored – I’ve
drawn a highlight in the corner of each triangle to help identify which ones are mirrored and which are not.
All of the above steps can be performed using just a few lines of Python. This function accepts a list of triangles represented as tuples, subdivides each one, and returns the new triangle list:
goldenRatio = (1 + math.sqrt(5)) / 2
def subdivide(triangles):
result = []
for color, A, B, C in triangles:
if color == 0:
# Subdivide red triangle
P = A + (B - A) / goldenRatio
result += [(0, C, P, B), (1, P, C, A)]
# Subdivide blue triangle
Q = B + (A - B) / goldenRatio
R = B + (C - B) / goldenRatio
result += [(1, R, C, A), (1, Q, R, B), (0, R, Q, A)]
return result
And here’s some code to actually draw the triangle list. It uses pycairo, a Python wrapper around the excellent cairo drawing library.
# Draw red triangles
for color, A, B, C in triangles:
if color == 0:
cr.move_to(A.real, A.imag)
cr.line_to(B.real, B.imag)
cr.line_to(C.real, C.imag)
cr.set_source_rgb(1.0, 0.35, 0.35)
# Draw blue triangles
for color, A, B, C in triangles:
if color == 1:
cr.move_to(A.real, A.imag)
cr.line_to(B.real, B.imag)
cr.line_to(C.real, C.imag)
cr.set_source_rgb(0.4, 0.4, 1.0)
# Determine line width from size of first triangle
color, A, B, C = triangles[0]
cr.set_line_width(abs(B - A) / 10.0)
# Draw outlines
for color, A, B, C in triangles:
cr.move_to(C.real, C.imag)
cr.line_to(A.real, A.imag)
cr.line_to(B.real, B.imag)
cr.set_source_rgb(0.2, 0.2, 0.2)
Using all of the above code, we can, for example, start with a single red triangle, subdivide it several times, and draw the result after each subdivision. You can see the tiling pattern begin to
You can even begin the sequence using another triangle list. Here’s some code to start with a “wheel” shape consisting of 10 red triangles:
# Create wheel of red triangles around the origin
triangles = []
for i in xrange(10):
B = cmath.rect(1, (2*i - 1) * math.pi / 10)
C = cmath.rect(1, (2*i + 1) * math.pi / 10)
if i % 2 == 0:
B, C = C, B # Make sure to mirror every second triangle
triangles.append((0, 0j, B, C))
If we subdivide this wheel shape repeatedly, we get the following sequence of tilings. Notice that each tiling contains a lot of symmetry – both reflective and rotational symmetry around 5 different
If you study either the top or bottom row of this sequence carefully, you’ll notice that for each tiling except the first, an upside-down copy appears in the tiling to the right. I’ve drawn some
yellow outlines to make this more obvious. Looking at it another way: if you take any of these tilings, subdivide it twice, flip it vertically and enlarge the result, you’ve basically added another
ring around the tiling. By repeating this process indefinitely, you can see how a Penrose tiling could be made to completely fill the entire plane.
Finally, here’s a (non-obfuscated) Python script which ties everything together: download penrose.py. It starts with a wheel pattern, subdivides it 10 times, and renders the enlarged, cropped result
inside a 1000x1000 image.
I pieced this explanation together from various sources: mainly this page at UBC and the Wikipedia entry. Mind you, this is not the only algorithm which can generate a Penrose tiling. Another method
involves projecting a 5-dimensional set of lattice points onto a 2D plane. I haven’t taken the time to fully understand that one, but it seems to open up the possibility of interesting color patterns | {"url":"https://preshing.com/20110831/penrose-tiling-explained/","timestamp":"2024-11-06T21:36:02Z","content_type":"text/html","content_length":"17339","record_id":"<urn:uuid:e091af33-833a-4d49-8c04-c146becb918f>","cc-path":"CC-MAIN-2024-46/segments/1730477027942.47/warc/CC-MAIN-20241106194801-20241106224801-00417.warc.gz"} |
"Exploring beyond the Standard Model with Lattice QCD" - Department of Physics and Astronomy
UNC-CH Nuclear Colloquium
Amy Nicholson, Berkeley
“Exploring beyond the Standard Model with Lattice QCD”
While the Standard Model (SM) of particle physics has been enormously successful in describing the world around us, there still remain many important and unanswered questions requiring Beyond the SM
(BSM) physics. One way to experimentally test the fundamental symmetries of the SM in searches for potential violations is to utilize properties of atomic nuclei which enhance these rare events.
Connecting experimental signals from nuclear environments to a particular BSM model requires the numerical solution of Quantum Chromodynamics (QCD), a cornerstone of the SM which governs nuclear
interactions. In this talk I will discuss the use of Lattice QCD as a tool for numerically calculating matrix elements relevant for experimental BSM searches. I will use neutrinoless double beta
decay, which, if observed, offers an explanation for the observed matter-antimatter asymmetry of the universe, as a key example. | {"url":"https://physics.unc.edu/event/astro-nuclear-talk-2017-02-20/","timestamp":"2024-11-05T10:54:13Z","content_type":"text/html","content_length":"95690","record_id":"<urn:uuid:20ed94f1-e97c-47d6-bf81-56bf40e23a97>","cc-path":"CC-MAIN-2024-46/segments/1730477027878.78/warc/CC-MAIN-20241105083140-20241105113140-00168.warc.gz"} |
NCERT Book for Class 7 Mathematics Download PDF
Free download NCERT Book for Class 7 Mathematics English and Hindi medium for 2021 academic year. By clicking on the links below for the ebooks you can download in pdf for Class 7 Mathematics. If you
need the full textbook issued by NCERT or whether you require the relevant PDF of the chapter in the textbook, all options are given below for NCERT Book for Class 7 Mathematics. You can download the
entire textbook or each chapter in pdf, All these books are strongly suggested by Class 7 Mathematics teachers in your school as they have been carefully designed as per the latest syllabus issued by
CBSE. Students of Class 7 are recommended to download and read latest NCERT books and also remember to refer to NCERT Solutions for Class 7 Mathematics
NCERT Mathematics Book Class 7 PDF Free Download
Students in Class 7 should strictly follow NCERT book for Class 7 Mathematics issued as per the syllabus designed by CBSE. These books have bee designed by the best Mathematics teachers and if you
follow these books then you will be able to understand all topics and concepts properly and get good marks in class tests and examinations
Download entire book for Class 7 Mathematics here
NCERT Book for Class 7 Maths Ganit
NCERT Book for Class 7 Maths Mathmatics
NCERT Book for Class 7 Maths Hisab (Urdu)
NCERT Book for Class 7 Maths Exemplar Problem (English)
NCERT Books For Class 7 Maths
Chapter 2: Fractions and Decimals
Chapter 6: The Triangles and Its Properties
Chapter 7: Congruence of Triangles
Chapter 8: Comparing Quantities
Chapter 10: Practical Geometry
Chapter 11: Perimeter and Area
Chapter 12: Algebraic Expressions
Chapter 13: Exponents and Powers
Chapter 15: Visualising Solid Shapes
NCERT Class 7 Maths Activities
NCERT Books For Class 7 Maths Hindi Medium
अध्याय 7: त्रिभुजों की सर्वांगसमता
अध्याय 11: परिमाप और क्षेत्रफल
अध्याय 15: ठोस आकारों का चित्रण
NCERT Books for Class 7 Mathematics are published by the National Council of Educational Research and Training (NCERT) for latest 2021 academic session for Class 7. These books issued are by NCERT
for Mathematics Class 7. They are recommended by all schools and is being implemented in almost all states in India as questions on exams for Class 7 Mathematics normally comes from Books by NCERT
only. Standard 7 students studying Mathematics should strictly follow the chapters and topics given here while studying for class tests and exams, and if they use these only then they can be sure
that their preparation for Class 7 exams is as per suggested syllabus. Students should also note that there are unsolved problems in class 7 books for Mathematics. You should solve them and refer to
NCERT Solutions for Class 7 Mathematics. Solve the questions first and then see the solutions designed by our teachers Class 7.
Advantages of NCERT Books for Class 7 Mathematics
a) NCERT Book for Class 7 Mathematics has been developed by experienced Mathematics teachers at the board based on the best educational tools available.
b) They have been developed to help all types of Class 7 students so that when they refer to NCERT Books and solutions for Class 7 Mathematics then they can understand all topics in a simple and
logical manner.
c) In your exams and class tests you will see that Class 7 teachers give most of the questions from these books only.
d) As the books have been designed as per 2021 CBSE syllabus, Class 7 students can study based on these.
NCERT Books and Solutions of CBSE Class 7 Mathematics are available for free download. We bring here best collection of free downloadable ebooks for grade 1 to grade 12. You can easily click on given
links and download PDF for each chapter in your book. PDF Download latest Class 7 Mathematics chapter wise PDF ebooks and read them daily as it will help you in exam preparation. On daily basis you
should study one important chapter of CBSE Grade 7 Mathematics book.
All latest study material for Class 7 for Mathematics has been developed for free download by best teachers of schools in India
Frequently Asked Questions
I need latest 2021 NCERT Book for Class 7 Mathematics in PDF, where can I get it ?
You can easily download latest 2021 NCERT Book for Class 7 Mathematics from https://www.cbsencertsolutions.com
I need the full ebook of NCERT for class 7 Mathematics in PDF, from where can I get it for download?
Its easy, you can simply click on the links provided here and in one click download entire book or even each chapter of PDFs for standard 7 Mathematics
For which academic session the books are available for?
Yes – The ebooks issued by NCERT have been made available here for latest 2021 session
How can I download the NCERT ebooks ?
Just click on links above for Class 7 books in Mathematics and download the for each chapter
Can I also download NCERT solutions for Class 7 Mathematics ?
Yes – our team of teachers have prepared free solutions for all problems given in NCERT Class 7 Mathematics textbook
Are the books and solutions free to download for all students?
The books and solutions for Class 7 are free and can be easily downloaded
I want books for all other subjects too, can I get it here?
Yes – you can download books and solutions for all other classes and subjects in Class 7 in both English and Hindi Medium for year 2021 | {"url":"https://www.cbsencertsolutions.com/ncert-book-for-class-7-mathematics-download-pdf/","timestamp":"2024-11-03T09:58:27Z","content_type":"text/html","content_length":"148300","record_id":"<urn:uuid:5cdf30ec-98ca-4d79-8b8d-a0dc5ad7686f>","cc-path":"CC-MAIN-2024-46/segments/1730477027774.6/warc/CC-MAIN-20241103083929-20241103113929-00451.warc.gz"} |
matematicasVisuales | Truncations of the cube and octahedron
Truncating a polyhedron means that the corners (or the edges) are cut off.
Starting with Platonic solids (regular polyhedra) and symmetrically slicing away the corners we get some Archimedean solids (semi-regular polyhedra).
We have already study the truncated tetrahedron that is the single archimedean polyhedron that is obtained by truncating the tetrahedron.
The truncated tetrahedron is an Archimedean solid made by 4 triangles and 4 hexagons.
We are going to investigate truncations of a cube and an octahedron. They are related because cube and octahedron are dual polyhedra.
Starting with a cube you can remove the corners to make equilateral triangles.
If we remove the eight corners in such a way that the original square faces of the cube become regular octagons the results is the truncated cube.
The truncated cube (or truncated hexahedron) is an archimedean solid. It has 14 regular faces (6 octogons and 8 triangles).
You can make a truncated cube very easily with cardboard and rubber bands:
Truncated cube lamp in the Palau Baro of Quadras, a modernist building in Barcelona (Spain)
If our truncation is deeper we get another archimedean solid, the cuboctahedron. It has six squares and eight triangles.
A cuboctahedron is an Archimedean solid. It can be seen as made by cutting off the corners of a cube.
You can also get a cuboctahedron truncating an octahedron.
A cuboctahedron is an Archimedean solid. It can be seen as made by cutting off the corners of an octahedron.
Another truncation of the octahedron is called the truncated octahedron with six square faces and eight hexagonal faces. Since four faces meet at the vertexes of the octahedron, cutting off its
corners makes squares, and the original triangular faces become hexagons. It is another archimedean solid.
The truncated octahedron is an Archimedean solid. It has 8 regular hexagonal faces and 6 square faces. Its volume can be calculated knowing the volume of an octahedron.
These polyhedra pack together to fill space, forming a 3 dimensional space tessellation or tilling.
The volume of an octahedron is four times the volume of a tetrahedron. It is easy to calculate and then we can get the volume of a tetrahedron.
The cuboctahedron is related with the duality between the cube and the octahedron:
Kepler was aware of this relation:
The first stellation of the cuboctahedron is the compound of a cube and its dual octahedron, with the vertices of the cuboctahedron located at the midpoints of the edges. It is the same to say that
the solid common to both the cube and the octahedron in a cube-octahedron compound is a cuboctahedron.
The compound polyhedron of a cube and an octahedron is an stellated cuboctahedron.It is the same to say that the cuboctahedron is the solid common to the cube and the octahedron in this polyhedron.
The vertices of a stellated cuboctahedron are the vertices of a rhombic dodecahedron (that is the dual polyhedra of a cuboctahedron).
W.W. Rouse Ball and H.S.M. Coxeter - 'Matematical Recreations & Essays', The MacMillan Company, 1947.
Magnus Wenninger - 'Polyhedron Models', Cambridge University Press.
Peter R. Cromwell - 'Polyhedra', Cambridge University Press, 1999.
You can chamfer a cube and then you get a polyhedron similar (but not equal) to a truncated octahedron. You can get also a rhombic dodecahedron.
A cuboctahedron is an Archimedean solid. It can be seen as made by cutting off the corners of a cube.
A cuboctahedron is an Archimedean solid. It can be seen as made by cutting off the corners of an octahedron.
The truncated octahedron is an Archimedean solid. It has 8 regular hexagonal faces and 6 square faces. Its volume can be calculated knowing the volume of an octahedron.
These polyhedra pack together to fill space, forming a 3 dimensional space tessellation or tilling.
Leonardo da Vinci made several drawings of polyhedra for Luca Pacioli's book 'De divina proportione'. Here we can see an adaptation of the truncated octahedron.
Leonardo da Vinci made several drawings of polyhedra for Luca Pacioli's book 'De divina proportione'. Here we can see an adaptation of the cuboctahedron.
Using eight half cubes we can make a truncated octahedron. The cube tesselate the space an so do the truncated octahedron. We can calculate the volume of a truncated octahedron.
A very simple technique to build complex and colorful polyhedra.
The volume of an octahedron is four times the volume of a tetrahedron. It is easy to calculate and then we can get the volume of a tetrahedron.
We study different prisms and we can see how they develop into a plane net. Then we explain how to calculate the lateral surface area.
We study different cylinders and we can see how they develop into a plane. Then we explain how to calculate the lateral surface area.
Plane net of pyramids and pyramidal frustrum. How to calculate the lateral surface area.
Plane developments of cones and conical frustum. How to calculate the lateral surface area.
The first drawing of a plane net of a regular dodecahedron was published by Dürer in his book 'Underweysung der Messung' ('Four Books of Measurement'), published in 1525 . | {"url":"http://matematicasvisuales.com/english/html/geometry/space/truncatedcubeoctahedron.html","timestamp":"2024-11-05T10:15:04Z","content_type":"text/html","content_length":"28991","record_id":"<urn:uuid:3196f6bb-35de-4002-936b-9af0ae192c36>","cc-path":"CC-MAIN-2024-46/segments/1730477027878.78/warc/CC-MAIN-20241105083140-20241105113140-00228.warc.gz"} |
Building Trees with Elm
This post is about trees — the computer science kind, as illustrated in Figure 1 below. Our goal is to see how trees can be derived from text and, conversely, how trees can be turned back into text.
Along the way, we will see how to display trees graphically, as below.
Let’s establish some terminology. In the Figure, we see blue dots — nodes—labeled by integers and some more text. The node labeled 1 is the root of the tree. It has two children, the subtrees with
roots labeled 3 and 4. We say that the node labeled 1 is the parent of the nodes labeled 3 and 4. Etc. Our tree is a rose tree because a node can have any number of children. Nodes without children
are called leaf nodes. If all nodes have either zero or two children, the tree is called binary tree .
A tree can be represented as outline, where indentation expresses the parent-child relationship. Here is the outline corresponding to the tree of our figure:
1 Home
2 Important things (according to Cicero)
3 Library
4 Garden
5 Pond
6 Grasses
7 Flowers Figure 2
In addition to outlines for essays, as above, trees can be used to represent genealogies, the “tree of life,” which expresses the relationship among species both living and extinct, the file system
of a computer, etc.
Representing Trees in Elm
We will use the package zwilias/elm-rosetree for our work. Consider a tree whose nodes are of type a. The root of such a tree has a label of type a and has zero, one, two, or many children. We
express the node + children nature of trees like this:
type Tree a = Tree a (List (Tree a))
By way of example, the tree pictured in the Figure 3 below is given by
Tree 1 [Tree 2 [Tree 3 [],Tree 4 []]]
The root node is labeled by the integer 1; the list of children of this node has just one element, the tree Tree 2 [Tree 3 [], Tree []]. Its root is labeled 2, and its children are given by
two-element list with elements Tree 3 [] and Tree 4 []. The latter two nodes are leaves; they have no children.
Figure 3
What we would like is a function
Build.fromString : node -> (String -> node) -> String -> Result Error (Tree node)
forestFromString defaultNode makeNode renderNode str = ...
that operates like this:
> Build.fromString "?" identity "1\n 2\n 3\n 4"
Ok (Tree "1" [Tree "2" [Tree "3" [],Tree "4" []]])
You can find the code for these on GitHub; the code is also published in jxxcarlson/elm-tree-builder as an Elm package.
To build a tree from an outline, we first transform it into list of blocks, where
type alias Block = { indent : Int, content: String }
While content is given by a single line, here by a single line, one can also have multi-line blocks. Here we have
blocks = [ {indent = 0, content = "1"}
, {indent = 1, content = "2" }
, {indent = 1, content = "3" }
, {indent = 2 , content = "4"}
To transform the list of blocks into a tree, we use the notion of a zipper, which is a tree with a focus: the subtree which we currently interested in. In module Tree.Zipper of zwilias/elm-rose-tree
you will find functions for moving the focus, e.g., parent and lastChild. Using Tree and Tree.Zipper, one can rig up a function for attaching a new tree at the focus of a given zipper:
attachAtFocus : Tree a -> Zipper a -> Zipper a
The function call attachAtFocus t z replaces the subtree of z defined by the focus with the tree t. This function, combined with the moves just mentioned, provide the ingredients for the
Now to the heart of the matter. Our goal is to grow the tree beginning with the root, then attach nodes in preorder — 1, 2, 3, … as shown below. Each time we move to a lower level of the tree, we
move the focus of the zipper using the lastChild function. Moving down corresponds to an increase in indentation level. No move of focus is needed when we stay at the same level, so no move is needed
after attaching node 4 to the tree before we attach node 5. But for node 6, we move up a level, corresponding to a decrease in indentation level. For this we apply the parent function. It can happen
that one has to move the focus back several levels.
You can find the code for building the tree right here. We use the kind of functional loop described in this article.
Rendering and Testing
In module Tree.Render one finds the function
toString : Int -> (a -> String) -> Tree a -> String
toString quantum renderNode tree =
where renderNode tells how to convert a label of type a to a string. If a is of type String, the identity function will do. The toString function is useful for testing. Take an outline and use it to
build a tree. Convert the tree back into a string. You should end up with the original string. We call this an identity test, since the composite of fromStringand toString quantum renderNode is the
identity function.
To take this a step further, in module Tree.Random, there are functions
generateOutline : Int -> Int -> String
generateOutline maxEntries seed = ...
generate : Int -> Int -> Result Error (Tree String)
generate maxNodes seed = ...
which can be used to generate random outlines and random trees. Thus one can run “identity tests” as described above on large numbers of random outlines and trees, e.g., 18.5 seconds for tests of
trees with 1000 nodes. | {"url":"https://jxxcarlson.medium.com/building-trees-with-elm-75e0dc5da35d","timestamp":"2024-11-08T14:54:11Z","content_type":"text/html","content_length":"126424","record_id":"<urn:uuid:921fbce3-6676-43d9-ac4a-190023e193c0>","cc-path":"CC-MAIN-2024-46/segments/1730477028067.32/warc/CC-MAIN-20241108133114-20241108163114-00710.warc.gz"} |
Re: [tlaplus] Problem with instance substitutions
The instantiated module (called motion) has a constant parameter M and a variable parameter mState. When you declare an instance of that module, you have to specify the substitutions for these
parameters by writing
INSTANCE motion WITH M <- ..., mState <- ...
As a shorthand, you may omit the substitutions when you wish the parameters to be instantiated by symbols of the same name that exist at the place of instantiation. In other words, your declaration
boils down to
INSTANCE motion WITH M <- M, mState <- mState
However, the symbols M and mState have no meaning at the place where this INSTANCE declaration appears, hence the error.
From what you have shown, it is not clear to me why you wish to instantiate module motion in module case: the specification given by CInit and CNext doesn't make any use of operators defined in
module motion. If you intend to relate the specifications in the two modules, it would perhaps make sense to move the INSTANCE declaration further down in module case, to a point where you actually
make use of what module motion defines.
Hope this helps,
The M doesn't have an error, but that would be because the spec now believes M to be a CONSTANT in the spec. But the same error occurs with INSTANCE, just with a new line number and only
complaining about "mState."
You received this message because you are subscribed to the Google Groups "tlaplus" group.
To unsubscribe from this group and stop receiving emails from it, send an email to
To post to this group, send email to
Visit this group at
For more options, visit
You received this message because you are subscribed to the Google Groups "tlaplus" group.
To unsubscribe from this group and stop receiving emails from it, send an email to tlaplus+unsubscribe@xxxxxxxxxxxxxxxx.
To post to this group, send email to tlaplus@xxxxxxxxxxxxxxxx.
Visit this group at https://groups.google.com/group/tlaplus.
For more options, visit https://groups.google.com/d/optout. | {"url":"https://discuss.tlapl.us/msg02556.html","timestamp":"2024-11-12T23:17:01Z","content_type":"text/html","content_length":"8048","record_id":"<urn:uuid:2ea14855-c87d-4398-8d9c-cb0652f75511>","cc-path":"CC-MAIN-2024-46/segments/1730477028290.49/warc/CC-MAIN-20241112212600-20241113002600-00080.warc.gz"} |
[GAP Forum] Is it possible to step through the program, like GNU GDB debugger, against built-in functions(ex. DerivedSubgroup, ClosureSubgroupNC )?
[GAP Forum] Is it possible to step through the program, like GNU GDB debugger, against built-in functions(ex. DerivedSubgroup, ClosureSubgroupNC )?
Alexander Konovalov alexk at mcs.st-andrews.ac.uk
Wed Sep 17 22:19:55 BST 2014
On 17 Sep 2014, at 14:51, buynnnmmm1 at yahoo.co.jp wrote:
> Dear Alexander Konovalov,
> Thank you very much for your help.
>> Not really - the method for IsSolvable did not evolve from the code similar to
>> myIsSolvable at all.
>> Perhaps the key is to read about GAP method selection and learn the concept of
>> methods as bundles of functions:
>> http://www.gap-system.org/Manuals/doc/tut/chap8.html#X7AEED9AB824CD4DA
>> - that is, IsSolvable(G) will select the best available method to apply to G,
>> taking into account what's known about G at the moment. With myIsSolvable,
>> you enforce the calculation of DerivedSeries, while some of the methods may need
>> not to know the derived series at all to give an answer. The profile below just
>> illustrates this, since the number of methods involved in the calls to GAP's
>> IsSolvable is much smaller.
> IsSolvable in lib/grp.gi is the same as the method for determining whether or not solvable group I have learned .
> I'll try to understand that the method for determining whether or not solvable group I have learned is the same the built-in IsSolvable function.
> I think it will be the good study of group theory .
> I'll try to be able to understand "Operations and Methods of GAP" with the document, too.
> Thank you very much for your help.
> With best regards
> buynnnmmm1
Note also that several lines above there is an immediate method which
expresses the famous Feit–Thompson theorem stating that any group of
odd order is solvable:
InstallImmediateMethod( IsSolvableGroup, IsGroup and HasSize, 10,
function( G )
G:= Size( G );
if IsInt( G ) and G mod 2 = 1 then
return true;
end );
The method to which you refer is generic, as its description says - like a
fallback method that is deemed to work for any group:
InstallMethod( IsSolvableGroup,
"generic method for groups",
[ IsGroup ],
function ( G )
local S; # derived series of <G>
# compute the derived series of <G>
S := DerivedSeriesOfGroup( G );
# the group is solvable if the derived series reaches the trivial group
return IsTrivial( S[ Length( S ) ] );
end );
You may trace how the method selection works adding the optional argument "full".
For example, for S(3) the method ``IsSolvableGroup: for permgrp'' will be used
quite early:
gap> ApplicableMethod(IsSolvableGroup,[SymmetricGroup(3)],"full");
#I Searching Method for IsSolvableGroup with 1 arguments:
#I Total: 11 entries
#I Method 1: ``IsSolvableGroup: system getter'', value: 2*SUM_FLAGS+21
#I - 1st argument needs [ "Tester(IsSolvableGroup)" ]
#I Method 2: ``IsSolvableGroup: handled by nice monomorphism: Attribute'', value: 360
#I - 1st argument needs [ "IsHandledByNiceMonomorphism",
"Tester(IsHandledByNiceMonomorphism)" ]
#I Method 3: ``IsSolvableGroup: for permgrp'', value: 48
#I Function Body:
function ( G )
local pcgs;
pcgs := TryPcgsPermGroup( G, false, false, true );
if IsPcgs( pcgs ) then
SetIndicesEANormalSteps( pcgs, pcgs!.permpcgsNormalSteps );
SetIsPcgsElementaryAbelianSeries( pcgs, true );
if not HasPcgs( G ) then
SetPcgs( G, pcgs );
if not HasPcgsElementaryAbelianSeries( G ) then
SetPcgsElementaryAbelianSeries( G, pcgs );
return true;
return false;
endfunction( G ) ... end
To give an example of a group for which method selection descends to the
fallback method, let's construct a dihedral group of order 16 as a finitely
presented group:
gap> f:=FreeGroup("x","y");
<free group on the generators [ x, y ]>
gap> r:=ParseRelators(GeneratorsOfGroup(f),"x^8=y^2=1,yxy=x^-1");
[ x^8, y^2, (x^-1*y^-1)^2 ]
gap> G:=f/r;
<fp group on the generators [ x, y ]>
Now after some information about other available methods,
the last one is precisely the generic method:
gap> ApplicableMethod(IsSolvableGroup,[G],"full");
#I Searching Method for IsSolvableGroup with 1 arguments:
#I Total: 11 entries
#I Method 1: ``IsSolvableGroup: system getter'', value: 2*SUM_FLAGS+21
#I - 1st argument needs [ "Tester(IsSolvableGroup)" ]
#I Method 2: ``IsSolvableGroup: handled by nice monomorphism: Attribute'', value: 360
#I - 1st argument needs [ "IsHandledByNiceMonomorphism",
"Tester(IsHandledByNiceMonomorphism)" ]
#I Method 3: ``IsSolvableGroup: for permgrp'', value: 48
#I - 1st argument needs [ "CategoryCollections(IsPerm)" ]
#I Method 4: ``IsSolvableGroup: for AffineCrystGroup, via PointGroup'', value: 43
#I - 1st argument needs [ "IsAffineCrystGroupOnLeftOrRight",
"Tester(IsAffineCrystGroupOnLeftOrRight)" ]
#I Method 5: ``IsSolvableGroup: for rational matrix groups (Polenta)'', value: 40
#I - 1st argument needs [ "IsRationalMatrixGroup", "Tester(IsRationalMatrixGroup)" ]
#I Method
6: ``IsSolvableGroup: for matrix groups over a finte field (Polenta)'', value: 38
#I - 1st argument needs
", "CategoryCollections(CategoryCollections(CategoryCollections(IsFFE)))" ]
#I Method 7: ``IsSolvableGroup: fallback method to test conditions'', value: 38
#I - 1st argument needs
", "CategoryCollections(CategoryCollections(CategoryCollections(IsCyclotomic)))" ]
#I Method 8: ``IsSolvableGroup'', value: 27
#I - 1st argument needs [ "Tester(Size)" ]
#I Method 9: ``IsSolvableGroup: for direct products'', value: 26
#I - 1st argument needs [ "Tester(DirectProductInfo)" ]
#I Method 10: ``IsSolvableGroup: generic method for groups'', value: 25
#I Function Body:
function ( G )
local S;
S := DerivedSeriesOfGroup( G );
return IsTrivial( S[Length( S )] );
endfunction( G ) ... end
However, if you create D_16 as permutation group, ApplicableMethod
will return the same ``IsSolvableGroup: for permgrp'' as for S(3)
gap> G:=Group([ (1,2,3,4,5,6,7,8), (2,8)(3,7)(4,6) ]);
Group([ (1,2,3,4,5,6,7,8), (2,8)(3,7)(4,6) ])
gap> ApplicableMethod(IsSolvableGroup,[G],"full");
#I Method 3: ``IsSolvableGroup: for permgrp'', value: 48
#I Function Body:
function ( G )
local pcgs;
pcgs := TryPcgsPermGroup( G, false, false, true );
so as you may see, different methods may be used dependently on how the
group is represented. Hope that clarifies some more details!
More information about the Forum mailing list | {"url":"https://www.gap-system.org/ForumArchive2/2014/004677.html","timestamp":"2024-11-02T21:13:48Z","content_type":"text/html","content_length":"11478","record_id":"<urn:uuid:8d68a266-d46c-4c1b-82e7-cfe14bacbc32>","cc-path":"CC-MAIN-2024-46/segments/1730477027730.21/warc/CC-MAIN-20241102200033-20241102230033-00415.warc.gz"} |
Designing a Speed Measurement System Using Altair Embed
In a series of previous blog posts, we have been using the power of Altair to simulate the necessary subsystems of a small robotic car as we progress through the process of constructing it in the
real world.
Previously, we designed and constructed an encoder subsystem so that we can generate a square wave representing the angular frequency of the drive tires. Figure 1 shows a reminder of the encoder we
created and the output of this portion of the project. In this post, we will continue this work to transform this signal into useful information. This will involve two main steps: devising a method
to read the frequency from the encoder and converting that frequency into a linear velocity.
Fig 1. Encoder Wheel (left) and encoder subsystem output signal (right).
Step One: Reading Frequency from the Encoder
There are many approaches available to convert this signal into a linear speed; a common approach for this scale of project is to use a frequency-to-voltage converter. The integrated circuit (IC)
that I had on hand for this task was an LM2907, which can be used, in conjunction with a simple circuit of passive elements, to convert a known frequency range to a known voltage range in a linear
fashion. The sample schematic for this circuit is shown in Figure 2 below. However, this encoder outputs a relatively low frequency (approximately 15 Hz at max speed), which makes it challenging to
use the LM2907 due to the very large values needed for passive components.
Fig 2. Sample tachometer schematic using LM2907 IC.
Instead, we will use a digital approach to measure this signal. We can get a very good approximation using a microcontroller to read the time between peaks in our encoder output signal. We will use
Altair Embed to assist in the design and simulation of this measurement. Embed is a powerful software that uses a ‘block diagram’ interface to create and analyze the performance of embedded systems,
and it has true hardware-in-the-loop (HIL) simulation capabilities. To begin this phase, we will use the software to generate a representative square wave in place of the output of the encoder.
Figure 3 shows the signal that we will use, and there are a few things to note: we can use a combination of the multiplication and summing junctions to scale the square wave to the same range as our
real-world values (2 V – 5 V), and there is no noise in this simulated signal. That is acceptable for our purposes, as we will only consider when the signal switches from a high voltage to a low
Fig 3. Simulation setup in Altair Embed to generate encoder output.
To extract the useful information from this signal, we will implement a crossing detection block, and we will specify the crossover value to be halfway point between the two extremes of the input
signal (3.5 V is the middle of 2 V and 5 V). Traditionally, this block will produce a positive value if the signal is going up when it crosses 3.5 V, and a negative value when it is decreasing
through the crossover value. We are only interested in seeing one ‘spike’ per cycle, so we will limit this output to remain positive. Figure 4 depicts this setup, comparing the input signal and the
output cycle detector; we can use a variable block to save this signal as “0x-trigger” or our ‘zero-crossing’ trigger, which generates a pulse for each whole cycle.
Fig 4. Pulse train generated by cycle detection in encoder signal in Altair Embed.
Now, we can design perhaps the most intricate part of this subsystem: the period approximator. For this, we will take the pulse train (“0x-trigger” signal) from earlier, and introduce some new logic.
First, we will use a Sample & Hold (S&H) block with the 0x-trigger signal and a ramp signal that increases linearly with time (i.e., the value of the ramp is equal to the current time relative to the
start of the simulation). This will generate an output equal to the “real-world” time for each pulse of the 0x-trigger. Next, we will use the 0x-trigger again and the output of the S&H as inputs to
the Unit Delay (1/Z) block. This will allow us to preserve the “real-world” time value from the pulse immediately preceding the current pulse from the 0x-trigger.
With these pieces of information, we now have the time values for two consecutive pulses, and taking the difference between them will provide us with the time between them, which is equal to the
period of our encoder signal. Figure 5 depicts the Embed schematic to accomplish these calculations. You will also notice that we add a very small value to the period and calculate the inverse. The
small value is to ensure that we do not divide by zero when inverting the period, and the inversion provides the measured frequency of the encoder wheel in Hertz.
Fig 5. Frequency measurement operators in Altair Embed.
In Figure 5, it is difficult to see the measured wheel frequency (red line), as it very closely matches the true frequency set by the “wheelFreqHz” variable (brown line), so a display has been added
to view the exact calculated value. We know that our system is working as anticipated, as the measurement states 14.9925 Hz, which is very close to the actual value of 15 Hz. Finally, we will convert
this frequency into a linear speed using the equation below. The ¼ comes from the fact that the encoder wheel has the pattern repeated 4 whole times in one rotation of the wheel, and the remainder of
the calculation is a trivial conversion from rotations per second to linear velocity using the circumference (the diameter d [m] multiplied by π). With the diameter measured to be 0.065 m, and the
encoder frequency at a maximum of 15 Hz, this will yield a linear speed of 0.766 m/s, or roughly 77 cm/s.
Step Two: Implementation and Conversion to Linear Velocity
We are now ready to implement this logic into the real-world device. We can do this by using the Code Generation capabilities of Embed to automatically create the code that will execute our designed
logic. The software will consider many aspects, such as the target device (which kind of microcontroller you are using), any inputs or output pins on the target device (which can be defined within
the block diagram), and any custom logic implemented via block diagrams. Figure 6 below shows an example of automatically generated code based on the schematic we have created so far.
Fig 6. Automatic Code Generation in Altair Embed.
Now it is time to test the code with an actual input signal. For this initial test, I provided an input of a 12 Hz square wave oscillating from 2 V to 5 V. Figure 7 displays the measured frequency
(in Hz) of this signal. Each line on the output is generated on each new rising edge, as defined in the Embed schematic. We can see some slight variation in the results, which is most likely due to
the fact that we are handling multiplication and division using numbers with many decimal places, such as the timestamps we are using to find the time between pulses. We can also see that the initial
measurement is very low (~0.0004), which is due to the fact that this is the first pulse measured, so it has no actual previous time value to determine the period and subsequent frequency.
Fig 7. Output of Frequency Estimator when true frequency is 12 Hz on microcontroller.
To get a better understanding of how this measurement works in the real world, Figure 8 shows the comparison of the true input frequency and the calculated frequency using our devised logic. To
demonstrate its capabilities, the input frequency increases over the time frame of the trial. This shows that the speed measurement is fast and accurate enough for our system.
Fig 8. Comparison of True and Measured Frequency over a range of values on microcontroller.
Similarly, we can convert these frequencies values to a linear speed using the equation mentioned earlier. Figure 9 displays this information, which, as expected, is effectively the same as Figure 8,
but the y-axis now shows us the linear speed of the wheel. This allows us to understand how fast the car will potentially be moving once all the parts are put together.
Fig 9. Comparison of True and Measured velocity over a range of values on microcontroller.
We now have everything we need to close the loop on our motor control! We will incorporate this speed measurement as feedback to compare against a desired speed, which will allow our microcontroller
to implement the necessary control scheme to adjust the buck converter powering the drive motors accordingly. Once that is complete, we will be ready to tackle the steering system in a similar
approach, but we will need to use different inputs and feedback. Be sure to check out our blog often and subscribe to our YouTube channel to stay up to date on this project, to learn about more tips
and tricks in Altair Embed and other tools, and to see how the powerful suite of Altair engineering software can help you! | {"url":"https://www.trueinsight.io/blog/speed-measurement-system","timestamp":"2024-11-12T02:19:04Z","content_type":"text/html","content_length":"500236","record_id":"<urn:uuid:3c526c48-6bab-4d81-ab58-fb83357a2b94>","cc-path":"CC-MAIN-2024-46/segments/1730477028242.50/warc/CC-MAIN-20241112014152-20241112044152-00149.warc.gz"} |
Transactions Online
Li TAN, Xiaojiang TANG, Anbar HUSSAIN, Haoyu WANG, "A Weighted Voronoi Diagram-Based Self-Deployment Algorithm for Heterogeneous Directional Mobile Sensor Networks in Three-Dimensional Space" in
IEICE TRANSACTIONS on Communications, vol. E103-B, no. 5, pp. 545-558, May 2020, doi: 10.1587/transcom.2019EBP3111.
Abstract: To solve the problem of the self-deployment of heterogeneous directional wireless sensor networks in 3D space, this paper proposes a weighted Voronoi diagram-based self-deployment algorithm
(3DV-HDDA) in 3D space. To improve the network coverage ratio of the monitoring area, the 3DV-HDDA algorithm uses the weighted Voronoi diagram to move the sensor nodes and introduces virtual boundary
torque to rotate the sensor nodes, so that the sensor nodes can reach the optimal position. This work also includes an improvement algorithm (3DV-HDDA-I) based on the positions of the centralized
sensor nodes. The difference between the 3DV-HDDA and the 3DV-HDDA-I algorithms is that in the latter the movement of the node is determined by both the weighted Voronoi graph and virtual force.
Simulations show that compared to the virtual force algorithm and the unweighted Voronoi graph-based algorithm, the 3DV-HDDA and 3DV-HDDA-I algorithms effectively improve the network coverage ratio
of the monitoring area. Compared to the virtual force algorithm, the 3DV-HDDA algorithm increases the coverage from 75.93% to 91.46% while the 3DV-HDDA-I algorithm increases coverage from 76.27% to
91.31%. When compared to the unweighted Voronoi graph-based algorithm, the 3DV-HDDA algorithm improves the coverage from 80.19% to 91.46% while the 3DV-HDDA-I algorithm improves the coverage from
72.25% to 91.31%. Further, the energy consumption of the proposed algorithms after 60 iterations is smaller than the energy consumption using a virtual force algorithm. Experimental results
demonstrate the accuracy and effectiveness of the 3DV-HDDA and the 3DV-HDDA-I algorithms.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.2019EBP3111/_p
author={Li TAN, Xiaojiang TANG, Anbar HUSSAIN, Haoyu WANG, },
journal={IEICE TRANSACTIONS on Communications},
title={A Weighted Voronoi Diagram-Based Self-Deployment Algorithm for Heterogeneous Directional Mobile Sensor Networks in Three-Dimensional Space},
abstract={To solve the problem of the self-deployment of heterogeneous directional wireless sensor networks in 3D space, this paper proposes a weighted Voronoi diagram-based self-deployment algorithm
(3DV-HDDA) in 3D space. To improve the network coverage ratio of the monitoring area, the 3DV-HDDA algorithm uses the weighted Voronoi diagram to move the sensor nodes and introduces virtual boundary
torque to rotate the sensor nodes, so that the sensor nodes can reach the optimal position. This work also includes an improvement algorithm (3DV-HDDA-I) based on the positions of the centralized
sensor nodes. The difference between the 3DV-HDDA and the 3DV-HDDA-I algorithms is that in the latter the movement of the node is determined by both the weighted Voronoi graph and virtual force.
Simulations show that compared to the virtual force algorithm and the unweighted Voronoi graph-based algorithm, the 3DV-HDDA and 3DV-HDDA-I algorithms effectively improve the network coverage ratio
of the monitoring area. Compared to the virtual force algorithm, the 3DV-HDDA algorithm increases the coverage from 75.93% to 91.46% while the 3DV-HDDA-I algorithm increases coverage from 76.27% to
91.31%. When compared to the unweighted Voronoi graph-based algorithm, the 3DV-HDDA algorithm improves the coverage from 80.19% to 91.46% while the 3DV-HDDA-I algorithm improves the coverage from
72.25% to 91.31%. Further, the energy consumption of the proposed algorithms after 60 iterations is smaller than the energy consumption using a virtual force algorithm. Experimental results
demonstrate the accuracy and effectiveness of the 3DV-HDDA and the 3DV-HDDA-I algorithms.},
TY - JOUR
TI - A Weighted Voronoi Diagram-Based Self-Deployment Algorithm for Heterogeneous Directional Mobile Sensor Networks in Three-Dimensional Space
T2 - IEICE TRANSACTIONS on Communications
SP - 545
EP - 558
AU - Li TAN
AU - Xiaojiang TANG
AU - Anbar HUSSAIN
AU - Haoyu WANG
PY - 2020
DO - 10.1587/transcom.2019EBP3111
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E103-B
IS - 5
JA - IEICE TRANSACTIONS on Communications
Y1 - May 2020
AB - To solve the problem of the self-deployment of heterogeneous directional wireless sensor networks in 3D space, this paper proposes a weighted Voronoi diagram-based self-deployment algorithm
(3DV-HDDA) in 3D space. To improve the network coverage ratio of the monitoring area, the 3DV-HDDA algorithm uses the weighted Voronoi diagram to move the sensor nodes and introduces virtual boundary
torque to rotate the sensor nodes, so that the sensor nodes can reach the optimal position. This work also includes an improvement algorithm (3DV-HDDA-I) based on the positions of the centralized
sensor nodes. The difference between the 3DV-HDDA and the 3DV-HDDA-I algorithms is that in the latter the movement of the node is determined by both the weighted Voronoi graph and virtual force.
Simulations show that compared to the virtual force algorithm and the unweighted Voronoi graph-based algorithm, the 3DV-HDDA and 3DV-HDDA-I algorithms effectively improve the network coverage ratio
of the monitoring area. Compared to the virtual force algorithm, the 3DV-HDDA algorithm increases the coverage from 75.93% to 91.46% while the 3DV-HDDA-I algorithm increases coverage from 76.27% to
91.31%. When compared to the unweighted Voronoi graph-based algorithm, the 3DV-HDDA algorithm improves the coverage from 80.19% to 91.46% while the 3DV-HDDA-I algorithm improves the coverage from
72.25% to 91.31%. Further, the energy consumption of the proposed algorithms after 60 iterations is smaller than the energy consumption using a virtual force algorithm. Experimental results
demonstrate the accuracy and effectiveness of the 3DV-HDDA and the 3DV-HDDA-I algorithms.
ER - | {"url":"https://global.ieice.org/en_transactions/communications/10.1587/transcom.2019EBP3111/_p","timestamp":"2024-11-05T13:48:58Z","content_type":"text/html","content_length":"67798","record_id":"<urn:uuid:a8b27268-c8b3-4e0c-b253-7bf5a81243e1>","cc-path":"CC-MAIN-2024-46/segments/1730477027881.88/warc/CC-MAIN-20241105114407-20241105144407-00108.warc.gz"} |
Divide Complicated Problem: Implement a Calculator | algo-en
Divide Complicated Problem: Implement a Calculator
Translator: Zero
Author: labuladong
The calculator function we will eventually implement is as follows:
1、Enter a string that can include +-* /, numbers, brackets, and spaces. Your algorithm returns the structure of the operation.
2、To comply with the algorithm, parentheses have the highest priority, multiply and divide first, then add and subtract.
3、The division sign is an integer division, rounded to zero regardless of the sign (5/2 = 2, -5 / 2 = -2).
4、It can be assumed that the input formula must be legal, and there will be no integer overflow in the calculation process, and there will be no unexpected situation where the divisor is 0.
For example, if you enter the following string, the algorithm will return 9:
3 * (2-6 /(3 -7))
As you can see, this is very close to the calculator we use in real life. Although we have definitely used the calculator before, if we think about its algorithm implementation, we will find that it
is not easy to implment:
1、To handle parentheses according to common sense, first calculate the innermost parentheses, and then gradually simplify them outward. This process is easy to make mistakes, let alone write
2、It is not difficult to teach children to multiply and divide first, then add and subtract, but it may be difficult to teach computers.
3、To handle spaces. For the sake of beauty, we habitually put spaces between numbers and operators, but we have to figure out ways to ignore these spaces.
I remember a lot of textbooks on university data structure. When talking about data structures like stacks, they may use calculators as examples, but most can't make it clear. I don’t know how many
future computer scientists may quit because of such a simple data structure .
Then this article talks about how to implement one of the above-mentioned full-featured calculator functions.The key lies in dismantling the problems layer by layer and solving the problems one by
one, I believe that this way of thinking can help everyone solve various complex problems.
Let's take apart. Starting with the simplest question.
1.Convert string to integer
Yes, it is such a simple question. First tell me, how to convert a positive integer in the form of a string into an int?
string s = "458";
int n = 0;
for (int i = 0; i < s.size(); i++) {
char c = s[i];
n = 10 * n + (c - '0');
// n is now equal to 458
This is still very simple, old-fashioned. But even so simple, there are still issues that need attention: This bracket in (c - '0') cannot be omitted, otherwise it may cause integer overflow
Because the variable c is an ASCII code, if there is no parentheses, it will be added first and then subtracted. Imagine thats will overflow if it approaches INT_MAX. So use parentheses to ensure
that you subtract before adding.
2.Processing addition and subtraction
Now further more, If the input formula only contains addition and subtraction, and there are no spaces, how do you calculate the result? Let's take the string expression 1-12 + 3 as an example. A
very simple idea is implemented below:
1、First add a default symbol + to the first number and change it to + 1-12 + 3.
2、Combine an operator and a number into a pair, that is, three pairs of + 1,-12, + 3, convert them into numbers, and put them on a stack.
3、Summing all the numbers in the stack , which is the result of the original calculation.
Let's look directly at the code and see it in combination with a picture:
int calculate(string s) {
stack<int> stk;
// Record numbers in calculations
int num = 0;
// Record the sign before num, initialized to +
char sign = '+';
for (int i = 0; i < s.size(); i++) {
char c = s[i];
// If it is a number, assign it continuously to num
if (isdigit(c))
num = 10 * num + (c - '0');
// If it's not a number, it must be the next symbol,
// the previous numbers and symbols should be stored on the stack
if (!isdigit(c) || i == s.size() - 1) {
switch (sign) {
case '+':
stk.push(num); break;
case '-':
stk.push(-num); break;
// Update the symbol to the current symbol and clear the number
sign = c;
num = 0;
// Sum all the results in the stack is the answer
int res = 0;
while (!stk.empty()) {
res += stk.top();
return res;
I guess the part with the switch statement in the middle is a bit hard to understand. i is scanned from left to right, and sign and num follow it. When s [i] encounters an operator, the situation is
Therefore, at this time, the sign of nums should be selected according to the case ofsign, stored in the stack, and then sign is updated and thenums is cleared to record the next pair of sign and
Also note that not only the new symbol will trigger the stack. When i reaches the end of the expression (i == s.size ()-1), the previous number should also be pushed on the stack for subsequent
calculate the final result.
At this point, the algorithm for processing only the compact addition and subtraction strings is complete. Please ensure that you understand the above. The subsequent content will be modified based
on this framework.
3.Multiplication and division
In fact, the idea is no different from just adding and subtracting. Take the string 2-3 * 4 + 5 as an example. The core idea is still to decompose the string into a combination of symbols and
For example, the above example can be decomposed into + 2,-3, * 4,+ 5. We have not dealt with the multiplication and division signs just now. It is very simple. No other parts need to be changed, add
the corresponding case to the switch section:
for (int i = 0; i < s.size(); i++) {
char c = s[i];
if (isdigit(c))
num = 10 * num + (c - '0');
if (!isdigit(c) || i == s.size() - 1) {
switch (sign) {
int pre;
case '+':
stk.push(num); break;
case '-':
stk.push(-num); break;
// Just take out the previous number and do the corresponding operation
case '*':
pre = stk.top();
stk.push(pre * num);
case '/':
pre = stk.top();
stk.push(pre / num);
// Update the symbol to the current symbol and clear the number
sign = c;
num = 0;
Multiplication and division take precedence over addition and subtraction in that multiplication and division can be combined with numbers on the top of the stack, and addition and subtraction can
only put themselves on the stack .
Now let's think about how to deal with the possible space characters in a string. In fact, it is very simple. Think about what part of our existing code whil be affected by the appearance of the
space character.
// If c is not a number
if (!isdigit(c) || i == s.size() - 1) {
switch (c) {...}
sign = c;
num = 0;
Obviously spaces will enter this if statement, but we don't want to let spaces enter this if, because sign will be updated and nums will be cleared. Spaces are not operators at all and should be
Then just add one more condition:
if ((!isdigit(c) && c != ' ') || i == s.size() - 1) {
Well, now our algorithm can calculate addition, subtraction, multiplication and division according to the correct rules, and automatically ignore the space characters. The rest is how to make the
algorithm recognize the brackets correctly.
4.Handling parentheses
Dealing with parentheses in calculations should seem the hardest, but it's not as difficult as it seems.
To avoid the tedious details of the programming language, I translated the previous solution code into a Python version:
def calculate(s: str) -> int:
def helper(s: List) -> int:
stack = []
sign = '+'
num = 0
while len(s) > 0:
c = s.pop(0)
if c.isdigit():
num = 10 * num + int(c)
if (not c.isdigit() and c != ' ') or len(s) == 0:
if sign == '+':
elif sign == '-':
elif sign == '*':
stack[-1] = stack[-1] * num
elif sign == '/':
# Python division to 0 rounding
stack[-1] = int(stack[-1] / float(num))
num = 0
sign = c
return sum(stack)
# Need to turn strings into lists for easy operation
return helper(list(s))
This code is exactly the same as the C ++ code just now. The only difference is that instead of traversing the string from left to right, it continues to pop out characters from the left.
So why isn't it so hard to deal with parentheses, because parentheses are recursive Let's take the string 3 * (4-5 / 2) -6 as an example:
calculate(3*(4-5/2)-6) = 3 calculate(4-5/2) - 6 = 3 2 - 6 = 0
In fact, no matter how many levels of parentheses are nested, you can reduce the calculation in the parentheses to a number by calling itself recursively through the calculate function. In other
words, the calculations in parentheses are just a number.
The question is, what are the start and end conditions for recursion? Meet ( begin recursion, encounter ) end recursion:
def calculate(s: str) -> int:
def helper(s: List) -> int:
stack = []
sign = '+'
num = 0
while len(s) > 0:
c = s.pop(0)
if c.isdigit():
num = 10 * num + int(c)
# Meet the left parenthesis and start recursive calculation of num
if c == '(':
num = helper(s)
if (not c.isdigit() and c != ' ') or len(s) == 0:
if sign == '+': ...
elif sign == '-': ...
elif sign == '*': ...
elif sign == '/': ...
num = 0
sign = c
# Return recursive result when encountering right parenthesis
if c == ')': break
return sum(stack)
return helper(list(s))
As you can see, with two or three lines of code, you can handle parentheses, which is the charm of recursion. At this point, all the functions of the calculator have been realized. By dismantling the
problem layer by layer and solving the problems one by one, the problem does not seem so complicated.
5. Final summary
In this article, I want to express the idea of dealing with complex problems by implementing the functions of a calculator.
We start with the simple problem of converting strings to numbers, and then work with expressions that only include addition and subtraction, then work with expressions that include four operations:
addition, subtraction, multiplication, and division, then space characters, and then expressions that include parentheses.
It can be seen that for some difficult problems, the solution is not achieved overnight, but it is advanced step by step and spirally rises. If you give you the original question at the beginning,
you may fail to handel it, and you even can't understand the answer. It ’s normal. The key lies in how we simplify the problem ourselves and how to retreat for the sake of advancing.
It's a very clever strategy to retreat and take the second best。Think about it, assuming this is an exam question, you won't implement this calculator, but you wrote the string to integer algorithm
and pointed out the easy-to-overflow trap, then at least you can get 20 points; if you can handle addition and subtraction, you can get 40 points; if you can handle addition, subtraction,
multiplication and division, that is at least 70 points; plus the space character, 80. I just don't handle parentheses, so forget it, 80 is OK, OK? | {"url":"https://labuladong.gitbook.io/algo-en/iii.-algorithmic-thinking/implementing_the_functions_of_a_calculator","timestamp":"2024-11-02T17:40:06Z","content_type":"text/html","content_length":"742914","record_id":"<urn:uuid:338d9487-2d5c-4bb3-9102-61a286af80ff>","cc-path":"CC-MAIN-2024-46/segments/1730477027729.26/warc/CC-MAIN-20241102165015-20241102195015-00314.warc.gz"} |
Thermal Energy in context of frequency to energy
30 Aug 2024
Title: Theoretical Analysis of Thermal Energy Conversion through Frequency Modulation: A Novel Approach to Harnessing Energy from Ambient Temperatures
This study explores the theoretical framework for converting thermal energy into a usable form through frequency modulation. By leveraging the principles of thermodynamics and electromagnetism, we
propose a novel approach to harnessing energy from ambient temperatures. Theoretical models are developed to describe the conversion process, and mathematical formulations are presented in ASCII
Thermal energy is a ubiquitous resource that surrounds us, yet its efficient utilization remains a significant challenge. Conventional methods of thermal energy harvesting often rely on mechanical or
thermoelectric principles, which can be cumbersome and inefficient. In contrast, this study focuses on the theoretical analysis of frequency modulation as a means to convert thermal energy into a
usable form.
Theoretical Background:
Thermal energy is a manifestation of molecular motion, where particles vibrate at various frequencies due to temperature fluctuations. By modulating these frequencies, it is possible to generate an
electrical signal that can be harnessed and utilized. The theoretical framework for this process involves the following steps:
1. Thermal Energy Harvesting: Thermal energy is collected from a heat source (e.g., ambient air or water) using a thermally conductive material.
2. Frequency Modulation: The thermal energy is converted into a frequency-modulated signal through a non-linear process, such as a Josephson junction or a superconducting circuit.
3. Energy Conversion: The frequency-modulated signal is then converted into electrical energy using an electromagnetic induction process.
Mathematical Formulations:
The following mathematical formulations describe the conversion process:
1. Thermal Energy Harvesting:
where Q is the thermal energy harvested, k is the thermal conductivity of the material, and ΔT is the temperature difference between the heat source and the ambient environment.
2. Frequency Modulation:
where f(t) is the frequency-modulated signal, A is the amplitude of the signal, ω is the angular frequency, t is time, and φ is the phase angle.
3. Energy Conversion:
where E is the electrical energy generated, μ is the magnetic permeability of the material, and f(t) is the frequency-modulated signal.
This study presents a theoretical framework for converting thermal energy into a usable form through frequency modulation. The mathematical formulations provided describe the conversion process,
which can be leveraged to develop novel energy-harvesting technologies. Further research is needed to experimentally validate these findings and explore their practical applications.
Related articles for ‘frequency to energy’ :
• Reading: Thermal Energy in context of frequency to energy
Calculators for ‘frequency to energy’ | {"url":"https://blog.truegeometry.com/tutorials/education/d3cbb2f0020bb503be424b8ed3a5ebbf/JSON_TO_ARTCL_Thermal_Energy_in_context_of_frequency_to_energy.html","timestamp":"2024-11-09T07:24:16Z","content_type":"text/html","content_length":"16668","record_id":"<urn:uuid:cd9fe60f-abcf-47ed-b037-2a728c328418>","cc-path":"CC-MAIN-2024-46/segments/1730477028116.30/warc/CC-MAIN-20241109053958-20241109083958-00057.warc.gz"} |
Binary versus Ternary
The relation between the binary and the ternary expansion of a given positive integer or a class of integers is still not completely understood. For example, we know almost nothing about the binary
expansion of powers of 3. Only recently Spiegelhofer proved a "folklore conjecture" saying that there are infinitely many $n$ with $s_2(n) = s_3(n)$, where $s_2(n)$ and $s_3(n)$ denote the binary and
ternary sum-of-digits functions, respectively.The purpose of this talk is to present a far reaching generalization of this result. It is show that the set of pairs $(s_2(n),s_3(n))$ covers almost the
whole first quadrant of lattice points (only with possible gaps in the boundary region). Interestingly the proof requires a combination of techniques from analytic number theory (Gowers norms,
level-of-distribution results, exponential sums) and Diophantine approximation (Baker's theorem, $p$-adic subspace theorem).This is joint work with Lukas Spiegelhofer. | {"url":"https://indico.math.cnrs.fr/event/12591/","timestamp":"2024-11-05T20:29:12Z","content_type":"text/html","content_length":"95217","record_id":"<urn:uuid:a76fecb9-f347-4c8d-919c-7beef93288b0>","cc-path":"CC-MAIN-2024-46/segments/1730477027889.1/warc/CC-MAIN-20241105180955-20241105210955-00351.warc.gz"} |
Why do Spread Charts have different Daily and Intraday calculations?
Intraday OHLC and daily OHLC of spread charts are calculated separately.
Now, imagine that we have 2 charts. Let's pretend that the first chart consists of only two intraday candles: candle A and candle B. Say, the high value of candle A is 2, of candle B is 3. The daily
high of that chart will show the high of 3.
Then let's imagine the second chart of the spread. By a happy coincidence, we also have only two intraday candles here: candles Y and Z. The high of the Y is 5, Z's high is 4. The daily high quite
predictably gives us the high of 5.
Here comes the tricky part, though. To create the spread candle we need to multiply those respective candles by each other and that yields us the following: A×Y = 10, B×Z = 12, which would make you
believe that the daily should be 12. But no! The daily would be 5×3 = 15, because you multiply the previously acquired daily values separately.
Let's have a look at some examples. Here's a spread BXP-BA. We take the close values of each 1-min candle and calculate the difference as follows:
Here's another example, in this case we multiply two candles:
The symbols from the formula can have a low/high value at different periods of time, but the formula uses the respective candles (e.g., 12:00 candle and 12:00 candle), hence the difference between
intraday and daily values. This is an expected behavior.
Here's an initial article on Spread Charts which can be also useful to you. | {"url":"https://in.tradingview.com/support/solutions/43000690935-why-do-spread-charts-have-different-daily-and-intraday-calculations/","timestamp":"2024-11-03T02:48:57Z","content_type":"text/html","content_length":"371047","record_id":"<urn:uuid:87cadc12-ffb4-4b25-a864-8aa83240add7>","cc-path":"CC-MAIN-2024-46/segments/1730477027770.74/warc/CC-MAIN-20241103022018-20241103052018-00860.warc.gz"} |
Area Of A Triangle Worksheets
Triangles are shapes with three sides, and we can find the space inside them by calculating their area.
To do this, we will use a simple formula:
Area = (base × height) ÷ 2
The “base” is the bottom side of the triangle, and the “height” is the distance from the top point straight down to the base. We multiply the base and the height together and then divide the result
by 2 to find the area.
Now let’s look at the worksheet. You’ll see different triangles with their base and height measurements provided. For each triangle, you need to use the formula to find the area.
Here’s an example:
Triangle 1: Base = 4 units Height = 3 units
To find the area, we’ll use the formula:
Area = (base × height) ÷ 2 Area = (4 × 3) ÷ 2 Area = 12 ÷ 2 Area = 6 square units
So the area of Triangle 1 is 6 square units.
Printable Area Of A Triangle Worksheets
Answer Key | {"url":"https://www.worksheetsgo.com/area-of-a-triangle-worksheets/","timestamp":"2024-11-09T00:12:42Z","content_type":"text/html","content_length":"107644","record_id":"<urn:uuid:08b59f1d-26cb-4f6f-986b-189555a4832f>","cc-path":"CC-MAIN-2024-46/segments/1730477028106.80/warc/CC-MAIN-20241108231327-20241109021327-00103.warc.gz"} |
field calculat
Travel + Leisure is a one-stop resource for sophisticated travelers who crave travel tips, news and information about the most exciting destinations in the world. Owners Chris and Ros Baiz provide a
history of the Fork's viticulture as they
, in this case, the temperature), and second-order if the energy is continuous, but its first derivative with respect to the order parameter is discontinuous, etc. Mean, median and mode calculator
for statistics. Calculate mean, median, mode, range and average for any data set with this calculator. Free online statistics calculators. Arithmetic Mean = 525/5; Arithmetic Mean= 105; The geometric
mean is less than the arithmetic means and is generally the case and it cannot be more than the arithmetic mean. Conclusion. Average or mean are used and computed almost daily and for many different
reasons especially in the field of the capital market, science, statistics, etc.
1 Monte Carlo and mean field models. 3. 1.1 Linear evolution equations . possibility to calculate Z, without the need of diagonalizing the Hamiltonian 5, 153 (1926)) and the curve is the mean-field
approximation considering S=1/2.
I am trying to add a new field to the attribute table which will take the "mean" of these three and populate that value in the new field created. I could manually do it through an editing session and
using a calculator but just wanted to know if there is an easier way to actually do it through field calculator?
Reliable transition properties from excited-state mean-field calculations J. Chem. Phys. 154, 124106 (2021); 53 3023 MEAN FIELD CALCULATIONS OF NUCLEON-NUCLEUS SCATTERING. the arguments of Ref. @ 2
#, the projection operator Q. 0.
Mean-field calculations. Karel Jelínek, Filip Uhlík, Zuzana Limpouchová, Pavel Matějíček and Karel Procházka* Copolymer Micelles with Polyelectrolyte Shell in Aqueous Media. A Mean-Field Study 2006,
Vol. 71, Issue 5, pp. 756–768
2021-03-22 · Gilbert, N. A. Besley, and P. M. W. Gill, “ Self-consistent field calculations of excited states using the maximum overlap method (MOM),” J. Phys. Chem. A 112 , 13164– 13171 (2008).
https://doi.org/10.1021/jp801738f later argued that imposing orthogonality in this way led to wavefunctions that were no longer solutions of the full SCF equations and propagated errors and
approximations in the ground state.
Finally, in Section4we formulate the conclusion. 2. The Cascading Mean Field Approach Apparently, the driving force determining the behavior of an MAE sample under an Nuclear Ground-State Properties
from Mean-Field Calculations Conference Dobaczewski, J Calculation of the effective rotational transition probabilities for excitation by electron impact from the ground state N/sub 2/X/sup 1/.
sigma. /sup +//sub g/ (v = 0, k) to the excited state N/sup +//sub 2/B/sup 2/. sigma.
Peter dahlgren civic culture
Instituto de Estructura de la Materia, The salt concentration inside the gel, c gs, is the result of our calculation, determined by the equivalence of chemical potentials of mobile ions in the bulk
and in the It is a static local approximation of the two-particle irreducible vertex, the kernel of a potentially singular Bethe-Salpeter equation.
Frequently used notation xxxix. Symbol description xlv. I Introduction. 1.
Saoirse ronan instagram
skatteverket lommaswedbank aktie rekommendationmagisk realisme defpsykologi 2a hermodsrising damp symptoms
av P Frankelius · 2020 · Citerat av 1 — not, in the IPCC calculations, considered as a positive climate contribution from 2014, and has since been developed by means of obser- vations of The two
kinds of carbon-binding in crop fields: Soil organic carbon and
The Cascading Mean Field Approach Apparently, the driving force determining the behavior of an MAE sample under an Nuclear Ground-State Properties from Mean-Field Calculations Conference Dobaczewski,
J Calculation of the effective rotational transition probabilities for excitation by electron impact from the ground state N/sub 2/X/sup 1/. sigma. /sup +//sub g/ (v = 0, k) to the excited state N/
sup +//sub 2/B/sup 2/. sigma. /sup +//sub u/(b', k') of nitrogen Field calculations cannot be undone. | {"url":"https://forsaljningavaktierarla.web.app/38762/33445.html","timestamp":"2024-11-06T15:26:33Z","content_type":"text/html","content_length":"9807","record_id":"<urn:uuid:8df847b5-b174-48fa-906f-2868d45e57e2>","cc-path":"CC-MAIN-2024-46/segments/1730477027932.70/warc/CC-MAIN-20241106132104-20241106162104-00031.warc.gz"} |
cptrfs.f - Linux Manuals (3)
cptrfs.f (3) - Linux Manuals
cptrfs.f -
subroutine cptrfs (UPLO, N, NRHS, D, E, DF, EF, B, LDB, X, LDX, FERR, BERR, WORK, RWORK, INFO)
Function/Subroutine Documentation
subroutine cptrfs (characterUPLO, integerN, integerNRHS, real, dimension( * )D, complex, dimension( * )E, real, dimension( * )DF, complex, dimension( * )EF, complex, dimension( ldb, * )B, integerLDB,
complex, dimension( ldx, * )X, integerLDX, real, dimension( * )FERR, real, dimension( * )BERR, complex, dimension( * )WORK, real, dimension( * )RWORK, integerINFO)
CPTRFS improves the computed solution to a system of linear
equations when the coefficient matrix is Hermitian positive definite
and tridiagonal, and provides error bounds and backward error
estimates for the solution.
UPLO is CHARACTER*1
Specifies whether the superdiagonal or the subdiagonal of the
tridiagonal matrix A is stored and the form of the
= 'U': E is the superdiagonal of A, and A = U**H*D*U;
= 'L': E is the subdiagonal of A, and A = L*D*L**H.
(The two forms are equivalent if A is real.)
N is INTEGER
The order of the matrix A. N >= 0.
NRHS is INTEGER
The number of right hand sides, i.e., the number of columns
of the matrix B. NRHS >= 0.
D is REAL array, dimension (N)
The n real diagonal elements of the tridiagonal matrix A.
E is COMPLEX array, dimension (N-1)
The (n-1) off-diagonal elements of the tridiagonal matrix A
(see UPLO).
DF is REAL array, dimension (N)
The n diagonal elements of the diagonal matrix D from
the factorization computed by CPTTRF.
EF is COMPLEX array, dimension (N-1)
The (n-1) off-diagonal elements of the unit bidiagonal
factor U or L from the factorization computed by CPTTRF
(see UPLO).
B is COMPLEX array, dimension (LDB,NRHS)
The right hand side matrix B.
LDB is INTEGER
The leading dimension of the array B. LDB >= max(1,N).
X is COMPLEX array, dimension (LDX,NRHS)
On entry, the solution matrix X, as computed by CPTTRS.
On exit, the improved solution matrix X.
LDX is INTEGER
The leading dimension of the array X. LDX >= max(1,N).
FERR is REAL array, dimension (NRHS)
The forward error bound for each solution vector
X(j) (the j-th column of the solution matrix X).
If XTRUE is the true solution corresponding to X(j), FERR(j)
is an estimated upper bound for the magnitude of the largest
element in (X(j) - XTRUE) divided by the magnitude of the
largest element in X(j).
BERR is REAL array, dimension (NRHS)
The componentwise relative backward error of each solution
vector X(j) (i.e., the smallest relative change in
any element of A or B that makes X(j) an exact solution).
WORK is COMPLEX array, dimension (N)
RWORK is REAL array, dimension (N)
INFO is INTEGER
= 0: successful exit
< 0: if INFO = -i, the i-th argument had an illegal value
Internal Parameters:
ITMAX is the maximum number of steps of iterative refinement.
Univ. of Tennessee
Univ. of California Berkeley
Univ. of Colorado Denver
NAG Ltd.
September 2012
Definition at line 183 of file cptrfs.f.
Generated automatically by Doxygen for LAPACK from the source code. | {"url":"https://www.systutorials.com/docs/linux/man/3-cptrfs.f/","timestamp":"2024-11-10T06:33:55Z","content_type":"text/html","content_length":"10708","record_id":"<urn:uuid:df49f1ea-b8bb-4110-9494-50388a996d9e>","cc-path":"CC-MAIN-2024-46/segments/1730477028166.65/warc/CC-MAIN-20241110040813-20241110070813-00290.warc.gz"} |
Surge Impedance
Surge Impedance in power transmission is the natural impedance of a transmission line that determines how power waves propagate through it. It is used in the study of power systems, especially when
analyzing wave propagation and surge phenomena, such as lightning strikes or switching surges. Surge impedance defines how voltage and current waves behave along a transmission line and helps
engineers design transmission systems that efficiently manage power flow and surges.
Key Points about Surge Impedance
Power Flow in Transmission Lines
- When a transmission line is terminated by its surge impedance, there is no reflection of the wave, which results in efficient transmission of power (maximum power transfer). This condition is
surge impedance loading
Wave Propagation - When a surge, such as a lightning strike or switching operation, travels through a transmission line, the surge will be reflected and transmitted based on the impedance mismatches.
Surge impedance is critical in understanding how these surges will behave.
Typical Values - For overhead transmission lines, surge impedance typically ranges between 200 to 400 ohms. For underground cables, it is lower, usually around 40 to 60 ohms, due to different
inductance and capacitance characteristics.
Surge Impedance Formula
Symbol English Metric
\( Z_s \) = Surge Impedance - \(ohm\)
\( L \) = Inductance per Unit Length of the Transmission Line - \(H\)
\( C \) = Capacitance per Unit Length of the Transmission Line - \(F\)
Tags: Communication System | {"url":"https://www.piping-designer.com/index.php/disciplines/electrical/908-telecommunications-engineering/3778-surge-impedance","timestamp":"2024-11-07T07:49:31Z","content_type":"text/html","content_length":"28988","record_id":"<urn:uuid:e4c1a826-2078-449e-ba47-f5279c9a1b73>","cc-path":"CC-MAIN-2024-46/segments/1730477027957.23/warc/CC-MAIN-20241107052447-20241107082447-00367.warc.gz"} |
Clausius-Clapeyron equation calculator
Navigating through the world of thermodynamics, the Clausius-Clapeyron equation stands as a cornerstone for understanding phase transitions. Wondering about its significance, applications, or how to
use our calculator? Dive into the comprehensive guide below!
How to use the Clausius-Clapeyron Calculator?
Understanding the terms used in our calculator is essential:
• Temperature (T) - The temperature at which the substance is observed, measured in Kelvin (K).
• Enthalpy of Vaporization (ΔHvap) - The energy required to turn the substance from a liquid into a gas, given in Joules per mole (J/mol).
• Pressure (P) - The vapor pressure of the substance, provided in Pascals (Pa).
What is the Clausius-Clapeyron equation?
The Clausius-Clapeyron equation is a pivotal concept in thermodynamics, defining the relation between the vapor pressure of a substance and its temperature. It serves as a tool to explore phase
transitions and understand the behavior of substances in their gas and liquid phases.
Defined as: \dfrac{d \ln P}{dT} = \dfrac{\Delta H_{\text{vap}}}{RT^2}
The equation finds extensive applications across fields like meteorology, material science, and chemical engineering, aiding in the prediction and study of phenomena like cloud formation, properties
of materials under varying temperatures, and design of processes involving phase transitions.
Clausius-Clapeyron Calculation Formulas
To calculate using the Clausius-Clapeyron equation, the following formula is applied:
Rate of Change in Vapor Pressure:\dfrac{dP}{dT} = \dfrac{P \Delta H_{\text{vap}}}{RT^2}
• dP/dT - Rate of change of vapor pressure with respect to temperature.
• P - Vapor Pressure.
• ΔHvap - Enthalpy of Vaporization.
• R - Universal Gas Constant.
• T - Temperature in Kelvin. | {"url":"https://owlcalculator.com/chemistry/clausius-clapeyron-equation-calculator","timestamp":"2024-11-06T06:20:03Z","content_type":"text/html","content_length":"271618","record_id":"<urn:uuid:94f7c089-0450-4d53-abc1-77a89d878947>","cc-path":"CC-MAIN-2024-46/segments/1730477027909.44/warc/CC-MAIN-20241106034659-20241106064659-00544.warc.gz"} |
What is Quantum Computing?
Is quantum computing a reality or mere science fiction? Do quantum computers already exist or are they still in the realm of speculation? Will quantum computers substitute general-purpose computers?
How far are we from witnessing their commercial production, if it ever happens?
In this blog post, we explore facts, myths, and concerns surrounding the advent of a new technological revolution.
What is quantum computing?
Quantum computing is a field in computer science that draws upon the principles of quantum theory. Traditional computers rely on manipulating electrical impulses represented by binary digits (1s and
0s) to store and process information. (In binary code, the digit 1 stands for an “on” state or a high voltage, while the digit 0 signifies an “off” state or a low voltage.) Quantum computing uses the
properties of subatomic particles such as electrons or photons. Quantum bits, or qubits can exist in multiple states simultaneously. Check out this video to find out how this paradox works.
This feature, known as superposition, allows qubits to represent both 1 and 0 simultaneously. Consequently, quantum computers can perform computations on an unparalleled scale that would take regular
computers millions of years by cleverly manipulating and using the interference between their quantum states.
The concept of quantum superposition suggests that when a physical system has multiple potential configurations or arrangements of particles or fields, its most comprehensive state can be described
as a combination of all these possibilities. In this combined state, the proportion of each configuration is determined by a complex number.
In contrast, classical computers are limited by their reliance on binary encoding, which restricts their processing capabilities, particularly when facing complex problems.
Watch this video for a more comprehensive explanation of quantum computation.
The described working principles of quantum computers led to the misconception that quantum computers can perform calculations at orders of magnitude faster than the computers we now use and that
they are more powerful and superior in functionality. However, scientists mention that there are many tasks in which quantum computers do not have any significant advantage over classical computers
unless the algorithm being used exploits quantum parallelism. In the following discussion, we will evaluate the potential of quantum computing and determine the cases in which quantum computers
demonstrate unbeatable results, and when they fail.
What is the difference between quantum computers and supercomputers?
Quantum computers and supercomputers have different ways of processing information, each with its own strengths and limitations.
In quantum computing, the building block is the qubit, or quantum bit. Supercomputers use traditional bits and parallel processing with multiple processors to handle different parts of a problem at
once. The difference in computation in quantum computers and supercomputers is grounded on the idea that the former use continuous variables (CV) as their base element, while the latter employ
discrete values (DV). Read a detailed explanation of approaches to working with DV and CV here.
Quantum computers are great at solving certain problems faster, such as optimization and simulation tasks like drug design or supply chain optimization. Supercomputers excel at data-intensive tasks,
like analyzing large datasets, pattern recognition, or modeling complex systems commonly used in weather forecasting, scientific research, and military simulations.
However, both quantum computers and supercomputers have their barriers.
Quantum computers limitations
• Fragility: Quantum computers are susceptible to their environment, including temperature changes, and can easily be disrupted by noise and vibrations. Any disturbance can cause the system to lose
coherence, resulting in calculation errors.
• Error correction: Due to their sensitivity to noise, quantum computers require error correction. However, it involves additional hardware and software that can increase the complexity and cost of
the system.
• Limited qubits: Quantum computers have a limited number of qubits, which restricts their computational power. While researchers are working to increase the number of qubits, it is still a major
• Limited applicability: Quantum computers have shown promise in simulating quantum systems, factoring large integers, and optimizing certain search algorithms. Currently, they are inferior in
efficiency compared to the supercomputers working with general-purpose computing tasks such as word processing or browsing the internet.
Quantum computers are still in the early stages of development. They are also very expensive to build and maintain, requiring specialized expertise. Supercomputers, while also costly, are more
accessible and easier to manufacture. They are generally more reliable and have longer lifespans compared to quantum computers.
What are the principles behind quantum computers?
Quantum computers are based on the principles of quantum mechanics, namely superposition, entanglement, and decoherence. Let’s look at each of these concepts.
In quantum mechanics, superposition is the ability to combine multiple quantum states, similarly to how classical physics deals with the addition of waves. By adding two or more quantum states, you
can obtain a new valid quantum state. Conversely, any quantum state can be represented as a combination of two or more different states. The superposition of qubits in quantum computers enables them
to process numerous operations concurrently.
Quantum entanglement occurs when two systems become intricately connected, allowing for immediate information transfer between them, regardless of their spatial separation. In quantum processors,
measuring one particle enables you to make a conclusion about another particle. For example, if one qubit is observed to spin upwards, its entangled partner will always be found spinning downwards,
and vice versa.
Through entanglement, qubits can form connections with other qubits, which greatly enhances their computational power. However, when a quantum state is measured, its wave function collapses,
revealing either a zero or a one. We have been familiar with it for quite some time through simulations of quantum computers using conventional CPUs. However, these simulations can only be performed
for a small number of qubits. In practice, if you were to attempt using the IBM API for this purpose, you would consistently encounter ‘unclean readings.’ Resolving this issue is one of the many
aspects that scientists are currently working on.
Decoherence is the deterioration or loss of a qubit’s quantum state due to factors like radiation. To build a quantum computer, it’s important to overcome this challenge. Engineers design specialized
components to prolong the coherence of the quantum state. This involves constructing protective structures that shield the qubits from external fields, reducing the negative effects of decoherence.
This video explains the concepts of superposition, entanglement and decoherence more in detail:
Do full-fledged quantum computers already exist?
In 1998, I. Chuang from the Los Alamos National Laboratory, M. Kubinec from the University of California, and N. Gershenfeld from the Massachusetts Institute of Technology achieved a significant
milestone by creating the first 2-qubit quantum computer. However, even in the year 2023, there continues to be ongoing debates regarding whether fully functional quantum computers have truly become
our present reality.
According to researchers, the answer depends on how we define quantum computers and the specific problems we expect them to solve. Experts point out that the lack of a demonstrated working logical
qubit on any experimental platform adds complexity to estimating progress in this field. These estimates are often based on noise models, which initially align with experimental findings. However, as
experiments scale up, deficiencies in these models become apparent, leading to frequent updates and rapidly changing numbers.
In summary, the readiness of quantum computers for practical applications is still subject to ongoing research and refinement, with various factors contributing to the uncertainty surrounding their
What is the architecture of the quantum computer?
The architecture of a quantum computer consists of several planes:
• The “quantum data plane” houses the qubits.
• The “control and measurement plane” executes operations and measurements on the qubits as needed.
• The “control processor plane” determines the sequence of operations and measurements the algorithm requires, possibly utilizing measurement results to guide subsequent quantum operations.
• The “host processor” is a classical computer that manages network access, extensive storage, and graphical user interfaces (GUI).
Which companies are developing quantum computers?
In the race to develop quantum computers, a competition for supremacy is unfolding. While it’s hard to identify a clear frontrunner these five contenders stand out as frontrunners.
IBM is among the pioneers in the quantum computing race so far.
In 2019, the company introduced the IBM Quantum System One – a fully integrated quantum computing system developed for commercial applications. It supports multiple processors, including the Falcon
processor with 27 qubits, the Hummingbird processor with 65 qubits, and the Eagle processor with an impressive 127 qubits.
In November 2022, the IBM Quantum System Two was unveiled. This modular and expandable system was designed as a fundamental component of the quantum-centric supercomputer. By integrating classical
compute resources and efficient cooling systems, it has the capacity to accommodate large processors and future architectures, including modular devices.
Microsoft has successfully developed all the essential components necessary to realize a topological qubit—a novel type of qubit that promises superior speed, compactness, and reliability compared to
other qubit designs, competing with IBM for leadership in quantum computer development. As this technology progresses, topological qubits will be the foundation for Microsoft’s fully scalable and
highly secure next-generation quantum computer.
Moreover, Microsoft’s Azure cloud platform provides a remarkable advantage by granting companies access to quantum resources without the burdensome expenses and infrastructure costs typically
associated with such endeavors. Through Azure, users can conveniently access resources from various providers, including QCI, Honeywell, Toshiba, IONQ, and 1Qloud.
The Google Quantum AI lab in Santa Barbara is dedicated to creating a quantum computer that can solve real-world challenges, thereby establishing Google as one of the top three quantum computer
developers. Their goal is to develop practical applications that align with their long-term objective of building a universal quantum computer with error-correction capabilities. Google aims to
bridge the gap between theory and real-world impact, making quantum advancements accessible and beneficial to various industries.
D-Wave’s quantum computers utilize a specialized technique called quantum annealing, specifically designed for optimization problems. When users input a problem into the system, the quantum
processing unit considers all possible configurations at once, generating calculations corresponding to the most optimal arrangement of qubits. These calculations provide the best possible solutions,
resulting in higher-quality results, particularly for large-scale problems. D-Wave systems are employed by some of the world’s biggest companies, including Google, NASA Ames, Oak Ridge National
Laboratory, and Volkswagen.
Amazon is actively developing the infrastructure for quantum computing. The company recently founded the AWS Centre for Quantum Networking, a central hub for research on quantum networking.
Furthermore, through Amazon Braket, developers gain access to quantum computers from leading providers like IonQ, Oxford Quantum Circuits, Rigetti, and D-Wave. Amazon also runs the AWS Center for
Quantum Computing in Pasadena, California, and operates the Amazon Quantum Solutions Lab. These initiatives aim to promote advancements and solutions in quantum computing, making it more accessible
and practical for users.
There are other companies and research institutes involved in quantum computing, find out more in the video:
What is the current state of quantum computing?
Quantum computers are still in an early stage called the Noisy Intermediate Scale Quantum (NISQ) era. They have limitations in terms of the number of qubits and their sensitivity to errors caused by
the environment. However, despite these limitations, NISQ devices show the potential of quantum computing.
Researchers are improving NISQ computers to reach the next phase, Fault Tolerant Quantum Computing (FTQC). FTQC aims to reduce errors by using redundancy, but it requires more physical qubits.
The transition from NISQ to FTQC will take time, and quantum computers will gradually solve a broader range of problems. In the meantime, NISQ systems are valuable for businesses interested in
adopting quantum computing. To save costs, it’s practical to start experimenting with algorithms on classical simulators before moving to quantum hardware.
It’s important to note that quantum computers are unlikely to replace classical computers completely. Business solutions will involve a combination of classical and quantum hardware, with quantum
processors handling specific parts of the problem.
What are the challenges of developing a quantum computer?
Advancements in qubit technologies have led to the introduction of small gate-based quantum computers. However, significant challenges remain, which are currently the focus of numerous developers and
researchers. Some of the problems that are yet to be solved are listed below:
Quantum decoherence: Decoherence occurs when the delicate quantum states that encode information interact with the surrounding environment, causing the loss of quantum properties. It poses a
significant challenge in maintaining the stability of qubits.
Qubit reliability and scalability: Qubits are fragile and susceptible to errors. Developing qubits that are both highly reliable and scalable is a significant challenge. Researchers are exploring
various physical implementations, such as superconducting circuits, trapped ions, topological qubits, and others, to achieve more stable and scalable qubit architectures.
Quantum error correction: Error correction is crucial in quantum computing due to the inherent susceptibility of qubits to noise and errors. Today, systems are limited by two-qubit gate error rates
above the surface code threshold. Error rates need to be at least an order of magnitude better. Improving the physical error rate to 10^-4 decreases the logical error rate to 10^-18. Quantum error
correction techniques aim to protect the fragile quantum states against decoherence and other errors.
Quantum gate operations: Developing and implementing a universal set of quantum gates that are accurate and efficient. The control and manipulation of qubits at the quantum level require precise and
stable control over physical systems.
Hardware and infrastructure: Building a quantum computer requires sophisticated infrastructure with extreme environmental conditions, such as ultra-low temperatures, low electromagnetic interference,
and highly stable experimental setups.
Software and algorithms: Quantum computing requires the development of new efficient quantum algorithms, optimizing quantum circuits and software tools tailored to quantum systems.
When will quantum computers arrive?
In the coming years, big players in quantum computing, alongside start-ups, will be gradually increasing the qubit capacity and reducing qubit error rates of their computers. However, progress is
likely to be slow. McKinsey projects that by 2030, around 5,000 operational quantum computers will be available. Developing the necessary hardware and software may take until 2035 or even later.
Nonetheless, certain businesses will begin to derive value from quantum computing well before this timeframe. Initially, these businesses will have access to quantum services through cloud-based
platforms provided by the companies they currently work with. Several major computing companies have already announced their forthcoming quantum cloud offerings.
How will quantum computing change the world?
Thanks to its ability to solve complex optimization problems, quantum computing may have far-reaching implications across many industries. While still in its early stages, this technology holds
immense possibilities for the future.
One of the most notable advancements brought about by quantum computing is its ability to transform cybersecurity and data encryption. Today, data security heavily relies on encryption keys for
secure transmission. However, hackers can replicate these keys, thus gaining unauthorized access to sensitive information. By employing the principles of probability theory, quantum machines make
processed information inherently immune to duplication or replication.
In quantum computing and physics, data processing is remarkably secure. Attempts to unlawfully access data in the quantum-backed security system result in the dissolution of the original data
composite, rendering it unhackable. Although it may sound like science fiction, data transmission in the quantum world resembles teleportation. Altering one particle affects the other through
entanglement. Therefore, unauthorized access of data would necessitate breaking the fundamental rules of quantum physics.
Drug development
With the advancements in quantum mechanics, there has been a significant improvement in our understanding of atomic interactions. Moreover, the enhanced processing power offered by quantum computers
enables researchers to conduct experiments on molecules and particles at an unprecedented pace, accelerating the search for treatments for presently incurable conditions.
The scientific community is enthusiastic about the potential of quantum computers in modeling intricate quantum processes fundamental to chemical reactions, which is still a challenge even for the
most powerful supercomputers.
Experts are actively exploring the implications of quantum computing in diverse domains, such as machine learning, to unveil novel patterns in nature and advance the capabilities of artificial
intelligence. Quantum computers can enhance data analysis capabilities. Their computational power can expedite complex data processing tasks, leading to more accurate and efficient pattern
recognition, classification, and data clustering. This can benefit various domains, including image and speech recognition, fraud detection, and natural language processing.
Quantum computers can also enable faster model training, parameter optimization, and improved algorithmic performance. This can lead to advancements in fields like predictive modeling, recommendation
systems, and autonomous decision-making.
Financial automation
Quantum computing applications offer significant advantages to businesses, allowing them to perform investment calculations and forecast stock market trends quickly and efficiently. They can also aid
in identifying potential risks and developing strategies to mitigate them, as well as conducting computationally intensive simulations. The remarkable speed of quantum computers enables them to carry
out these operations exponentially faster than traditional computing systems.
Fraud detection
Industries such as healthcare, banking, and marketing require reliable solutions for detecting fraud through entity relationships and data patterns. Quantum computing can enhance data modeling,
offering a resource-efficient method for neural network training and improving the effectiveness of fraud detection rates.
Traffic optimization
Quantum computing applications focused on data extraction and pattern analysis can help improve organic traffic for businesses, enabling marketing firms to offer precise and quick services to a
targeted audience.
Logistics optimization
It’s natural for businesses to seek a system that provides improved data analysis and reliable performance modeling to enhance supply chain management. Subsequently, the implementation of quantum
computing in logistics would offer robust computational solutions.
Industry Applications
FinTech Algorithmic trading, fraud detection, portfolio optimization, loans scoring
Manufacturing Workforce and job scheduling, supply chain and inventory optimization, demand prediction
Transportation Route optimization, traffic management, vehicle loading and dispatch
Healthcare Drug discovery, gene sequencing and annotation, molecular simulation, organ exchange
What are the concerns about quantum computing?
Previous technology advancements highlighted the importance of establishing governance and standards early on. The impact of quantum technology remains uncertain, making necessary the development of
responsible deployment policies and equitable access. Overall, it is crucial to focus on societal impact and unintended consequences.
Cyber security
According to the US National Institute of Standards and Technology (NIST), by 2029, quantum computers will be able to break current public key infrastructure, including 128-bit AES encryption. This
encryption is currently used to protect sensitive information transmitted over the Internet.
The need to address this encryption challenge drives the demand for large-scale quantum computers with 10,000 or more qubits. These machines could be employed for intelligence operations,
specifically decrypting data with relatively low levels of encryption.
DNN black box problem
If quantum computing is used in machine learning, it could create a big problem called the “ultimate black box problem.” Deep neural networks are already hard to understand, and with quantum machine
learning, it becomes even harder to evaluate them and understand how they make decisions.
Warfare vulnerability
Quantum technology can address complex societal challenges, but it can also be used maliciously by nation-states during warfare. If a military force possesses quantum computing capabilities while its
opponent does not, the information imbalance may leave the latter unable to protect its assets and vulnerable to strategic disadvantages.
Societal risks
The widespread adoption of quantum computing poses a significant societal risk: the exponential expansion of the digital divide. Due to the high costs associated with quantum computing, only the
wealthiest individuals and organizations will likely have access to its immense power. This situation could perpetuate and amplify existing disparities between privileged and underprivileged groups,
potentially leaving those unable to afford quantum computing services at a disadvantage and further behind in various aspects of life.
Limited helium supply
Quantum technology depends on cooling particles with helium to maintain their stability. However, the limited supply and high cost of helium present two potential risks. Firstly, companies must
ensure a reliable source of helium to keep their equipment running. Secondly, there is a risk of a concentration of capabilities in the hands of a few operators, leading to a potential imbalance of
power and access to quantum technology.
The future is happening now
The quantum revolution is no longer a distant concept; it is happening right now, although on a smaller scale. Governments, tech giants, and private investors are engaged in a race to invest in
research and development of quantum physics, hardware, and software. Businesses start considering quantum computing in their projections and initiate preparations for the impending large-scale
With the integration of quantum computing across different disciplines, we can even come closer to understanding black holes and, who knows, maybe explore constellations millions of light years away. | {"url":"https://serokell.io/blog/what-is-quantum-computing","timestamp":"2024-11-03T19:53:09Z","content_type":"text/html","content_length":"237805","record_id":"<urn:uuid:457951f0-8d6b-4c89-8063-d9b3501d4535>","cc-path":"CC-MAIN-2024-46/segments/1730477027782.40/warc/CC-MAIN-20241103181023-20241103211023-00263.warc.gz"} |
Some notes about Free Monads - Cacher Snippet
It doesn't use stack when running computation, it uses the heap ("stack safety"). It uses TCE, tail call elimination strategy (otherwise, that would be useless). That replaces recursion with simple
"jumps" in the code (think loop). This is called trampolining ("trading" stack for heap).
Note that a trampoline is a Free monad with a simple Function0. (ie: () -> A) Free is simply a generalization of a trampoline.
sealed trait Trampoline[+A] { final/* eliminate tail call*/ def runT: A = this match { case More(k) => k().runT case Done(v) => v } } case class More[+A](k: () => Trampoline[A]) extends Trampoline[A]
case class Done[+A](result: A) extends Trampoline[A] def continue(t: (Int, Double)): Trampoline[(Int, Double)] = { println(s"iteration ${t._1} (previous ${t._2})") val r = math.random() if (r >
0.999999) Done((t._1 + 1, r)) else continue((t._1 + 1, r)) } println(More(() => continue((1, math.random))).runT) | {"url":"https://snippets.cacher.io/snippet/c80dd229083fc7a7e055","timestamp":"2024-11-06T17:54:09Z","content_type":"text/html","content_length":"31550","record_id":"<urn:uuid:39247481-6c1a-42f2-902e-79aa79f91f8f>","cc-path":"CC-MAIN-2024-46/segments/1730477027933.5/warc/CC-MAIN-20241106163535-20241106193535-00331.warc.gz"} |
Contrapositive Implications as Dominoes
June 26, 2017
If you’ve ever learned logic, you know that jumping from one piece of information to another (through implication) isn’t always clear. You might remember something about if A implies B, then not B
implies not A, and the like. What I want to do today is try and explore these concepts in a more visual way, which hopefully will let you remember these concepts with greater ease.
To do this, we’re going to use an analogy that involves dominoes. We will start with three propositions or statements, and call them A, B, and C. These will each be represented by a domino, and they
will be lined up in the same order. Also note that I will just refer to these dominoes as A, B, and C from now on.
Let’s begin by imagining that we can only push a domino forward. That is, if we decide to knock down a domino, we need to push it to the right. This isn’t any special condition, but it’s just
something that we will impose for now to make the situation more clear.
What happens if we push A? First, it will hit B, and then B will hit C. As such, we can say that A implies B, and B implies C. But, as we know from a chain of dominoes, the act of pushing A
guarantees that C will fall, too (assuming you build your line well). As such, we can also say that A implies C.
Let’s look at a slightly different situation. What if I tell you that C falls? What can you tell me about A and B?
You might be tempted to say that A and B fall, but you should resist this conclusion! Remember, we want a statement that always applies, so it’s helpful to go back to your dominoes to test the
implications. If C falls, what are the options for what happened?
There are three different possibilities for what could have happened.
• A was pushed, which we have already seen will guarantee that C falls. In this case, all three dominoes will fall.
• B is pushed, which we have also seen will cause C to fall. In this case, A is still upright, but the other two have fallen.
• C is pushed, which means it obviously falls. In this case, the other two are still standing.
Because having C fall means any one of these three options occurred, we cannot say with certainty what happened to the other dominoes. Both could have fallen, or only B could have fallen. We know
that it can’t be only A that fell, since that would imply the other two fell as well.
This might seem like a waste of time, because the conclusion we’ve come to is that having C fall tells us precisely nothing about the state of the other two. However, there’s another way to look at
these results that will give us insight. What if C had not fell? What could we say about the other two dominoes?
Let’s look at it case by case. We know that pushing A automatically means C will fall. Likewise, pushing B means C will fall. Therefore, if we don’t find that C has fallen, then we can be sure that
neither A or B were pushed. There’s simply no way to push the two first dominoes without causing the last one to fall.
This kind of statement is called the contrapositive. Formally, if we have a conditional statement, which is just a fancy way of saying that one smaller statement implies another, and it is of the
form A implies B, then the contrapositive is given by not B implies not A. The way we write it is like this:
Hopefully, the example of dominoes makes sense for why the contrapositive works. It’s because we have a direct relationship of one domino causing a chain reaction with a bunch of other dominoes. If
one part of the train further down has not fell, it has to be that the other parts have not fallen.
Practically, this means that you won’t succumb to the error of thinking that if one event implies a second, then automatically having the second event occur implies the first. It could be true, just
like we saw with our three options above, but when we are making use of logical implications, we want to use the fact that one thing guarantees the other. Therefore, when you’re dealing with logical
statements, think of the dominoes. Does having one statement happen imply the next, or is there another way it could have happened (without the first)? | {"url":"https://jeremycote.net/2017/06/26/contrapositive-implication","timestamp":"2024-11-14T08:48:33Z","content_type":"text/html","content_length":"7030","record_id":"<urn:uuid:b6a19389-8f39-4e62-8c98-f33b0467077e>","cc-path":"CC-MAIN-2024-46/segments/1730477028545.2/warc/CC-MAIN-20241114062951-20241114092951-00880.warc.gz"} |
S&P 500 Elliott Wave Technical Analysis – 23rd February, 2015
Upwards movement was expected, but so far a small second wave correction is moving price slowly lower. The target remains the same.
Summary: I expect more upwards movement to a target at 2,133. This may be reached this week.
Click charts to enlarge.
Bullish Wave Count
Upwards movement from the low at 666.79 subdivides as an incomplete 5-3-5. For the bull wave count this is seen as primary waves 1-2-3.
The aqua blue trend lines are traditional technical analysis trend lines. These lines are long held (the lower one has its first anchor in November, 2011), repeatedly tested, and shallow enough to be
highly technically significant. When the lower of these double trend lines is breached by a close of 3% or more of market value that should indicate a trend change. It does not indicate what degree
the trend change should be though. It looks like the last four corrections may have ended about the lower aqua blue trend line, which gives the wave count a typical look. To see a weekly chart where
I have drawn these trend lines go here.
I have pulled the upper trend line down a little to touch the low of minute wave a within minor wave 4. This may be a better position for recent movement.
The wave count looks at intermediate wave (5) as an ending contracting diagonal. Ending diagonals require all sub waves to be zigzags. So far this is a perfect fit. Minor wave 3 has stronger momentum
than minor wave 5 on the daily chart.
The diagonal is contracting. The only problem with this possibility is that minor waves 2 and 4 are more shallow than second and fourth waves within diagonals normally are. In this case they may have
been forced to be more shallow by support offered from the double aqua blue trend lines.
Because the third wave within the contracting diagonal is shorter than the first wave and a third wave may never be the shortest wave, this limits the final fifth wave to no longer than equality with
the third wave at 2,253.79.
Within intermediate wave (5) minor wave 1 lasted 238 days (5 days longer than a Fibonacci 233), minor wave 2 lasted 18 days (2 short of a Fibonacci 21), minor wave 3 lasted 51 days (4 short of a
Fibonacci 55) and minor wave 4 lasted 23 days (2 longer than a Fibonacci 21). While none of these durations are perfect Fibonacci numbers, they are all reasonably close. So far minor wave 5 has
lasted 13 days and the structure is incomplete. It may not exhibit a Fibonacci duration nor ratio to minor waves 1, 2, 3 or 4.
Within minor wave 5 minute wave b may not move beyond the start of minute wave a below 1,980.90.
At 2,133 minute wave c would reach equality in length with minute wave a.
Contracting diagonals normally have fifth waves which end with a slight overshoot of the 1-3 trend line. This is still my expectation.
Minuette wave (v) is so far showing the subdivision of subminuette wave ii on the daily chart. This is unfolding as a shallow zigzag, so far. The structure is incomplete on the five minute chart. If
subminuette wave ii shows on the daily chart then I would expect subminuette wave iv to also show on the daily chart, so that minuette wave (v) looks like a five wave structure (not a three) and has
the right look at the daily chart level. This indicates that minuette wave (v) may last a few more days. It might end this week or may even require a little longer.
Subminuette wave ii may not move beyond the start of subminuette wave i below 2,085.44.
Draw a channel about minute wave c using Elliott’s second technique: draw the first trend line from the ends of minuette waves (ii) to (iv) then place a parallel copy on the high of minuette wave
(iii). I would expect along the way up to the target downwards corrections to find support at the lower green trend line. Minuette wave (v) may end about the upper edge of this channel, when it
overshoots the blue 1-3 trend line.
Alternate Bull Wave Count
This wave count is an alternate because it does not fit well with momentum at either the daily or the hourly chart levels.
Within intermediate wave (5) minor wave 3 has weaker momentum than minor waves 1 and 5. This is opposite to how it should behave. However, at the weekly chart level minor wave 3 has stronger momentum
than minor wave 5 so this could still fit.
At 2,191 primary wave 3 would reach 1.618 the length of primary wave 1. This would expect that within minor wave 5 minute wave iii will be shorter than minute wave i, and minute wave v will be
shorter still, which would be a repeat of the pattern seen within minor wave 1. Or the target is wrong.
At 2,140 minute wave iii would reach 0.618 the length of minute wave i.
Draw the channel for this idea using Elliott’s first technique. Minuette wave (v) may end about the upper edge of this trend line.
Subminuette wave ii may not move beyond the start of subminuette wave i below 2,085.44.
Bear Wave Count
The subdivisions within primary waves A-B-C are seen in absolutely exactly the same way as primary waves 1-2-3 for the bull wave count. The alternate bull wave count idea also works perfectly for
this bear wave count.
To see the difference at the monthly chart level between the bull and bear ideas look at the last historical analysis here.
At cycle degree wave b is over the maximum common length of 138% the length of cycle wave a, at 167% the length of cycle wave a. At 2,393 cycle wave b would be twice the length of cycle wave a and at
that point this bear wave count should be discarded.
While we have no confirmation of this wave count we should assume the trend remains the same, upwards. This wave count requires confirmation before I have confidence in it.
This analysis is published about 04:00 p.m. EST. | {"url":"https://elliottwavestockmarket.com/2015/02/23/sp-500-elliott-wave-technical-analysis-23rd-february-2015/","timestamp":"2024-11-07T12:28:26Z","content_type":"text/html","content_length":"44357","record_id":"<urn:uuid:8fbf6976-f713-4f5c-a8f9-3cbd08b72433>","cc-path":"CC-MAIN-2024-46/segments/1730477027999.92/warc/CC-MAIN-20241107114930-20241107144930-00441.warc.gz"} |
inverse cosecant,
(arc-cosecant, inverse cosecant, acsc)
The arc-cosecant is the inverse of the cosecant function. Calcute implements it with the acsc function. The inverse cosecant of a value x is the value y for which the cosecant of y is x. In other
words if y = acsc(x) then x = csc(y). And since the cosecant takes an angle as input parameter, the arccosecant produces an angle as its output.
The acsc value is expressed by Calcute using the currently-selected angle unit: radian, degree or gradient. In the above example, the result is in radians.
The arc-cosecant function is undefined in the open range (-1, +1); this matches the output domain of the cosecant function. Note also that the cosecant function is periodic: its values repeat
infinitely for angles that represent more than one complete rotation. Conversely, the arccosecant is a multi-valued function: any parameter value matches an infinite number of possible angles. But
the acsc function generates a single value refered to as the principal value. This is the "nearest" valid angle that remains within one whole revolution. All other possibilities can be obtained by
adding or subtracting any whole number of rotations from the return value of acsc.
In some mathematical texts and hand-held calculators, the notation csc^-1 is sometimes used to represent the arc-cosecant function. This is an unfortunate notational choice since it could also stand
for the multiplicative inverse 1/csc, which is a different function.
Yet another term also used to represent the inverse cosecant function is "arccsc". | {"url":"http://calcute.com/arccosecant.html","timestamp":"2024-11-13T23:09:29Z","content_type":"text/html","content_length":"3509","record_id":"<urn:uuid:c9231890-dbed-45d0-a6eb-5c371b0fea6b>","cc-path":"CC-MAIN-2024-46/segments/1730477028402.57/warc/CC-MAIN-20241113203454-20241113233454-00497.warc.gz"} |
Feature Column from the AMS
Trees: A Mathematical Tool for All Seasons
Posted January 2006.
I hope to convince you that mathematical trees are no less lovely than their biological counterparts...
Mail to a friend Print this article
Trees have been the inspiration of poets and no one doubts the beauty of many wood sculptures nor the ubiquitous uses for lumber. The leaves of trees are beautiful and varied. Many find the
spectacular fall colors of trees an inspiration and travel great distances to see the fall foliage. No wonder that mathematicians use the suggestive term "tree" for the special class of structures
sampled below, where two rather different drawings of the same tree structure are shown.
I hope to convince you that mathematical trees are no less lovely than their biological counterparts.
Basic ideas
A powerful way to represent relationships between objects in visual form can be done using a mathematics structure called a graph. One uses dots called vertices to represent objects and line segments
which join the dots, called edges, to represent some relationship between the object which the dots represent. For example, a chemist might draw the diagram below to represent a methane molecule:
In a graph the number of edges that meet a vertex of the graph is called the degree or valence of a vertex. The use of the term valence here reflects the fact that in forming molecules certain atoms
"hook up" with a fixed number of other atoms. Hydrogen has a valence of 1 and carbon a valence of 4. In the graph of the methane molecule we see that the hydrogen atoms have valence (degree) 1, while
the carbon atom has valence (degree) 4. The vertices of valence 1 in a tree are often known as leaves (singular: leaf) of a tree.
Another example would be:
Here the diagram shows a person's ancestors.
The two graphs we have just drawn are special because they lack cycles. A cycle in a graph is a collection of edges which make it possible to start at a vertex and move to other vertices along edges,
returning to the start vertex without repeating either edges or vertices (other than the start vertex). The graph below has a variety of cycles, abda, adea, adfcba, and bdfcb. The cycles dbcfd and
dfcbd are considered the same as the cycle bdfcb because the same edges are used. Can you find a list of all of the cycles in this graph?
All the graphs we have drawn are also special because they have the property that given any two vertices of the graph, they can be joined by a path: a collection of edges that does not repeat any
edges or vertices and that joins a vertex to a distinct vertex. For example, aedbcf is a path while adeab is not because the vertex a was repeated. A graph which has the property that any pair of
vertices in the graph can be joined by a path is called connected. We will define a tree to be a connected graph which has no cycles. A pioneer in the study of the mathematical properties of trees
was the British mathematician Arthur Cayley (1821-1895).
Trees have a variety of very nice properties:
a. Given two distinct vertices u and v in a tree, there is a unique path from u to v. (For technical reasons it is convenient to allow a graph with a single vertex to be a tree.)
b. If we cut (or remove) any edge of a tree, the graph is no longer connected. (Thus, trees are examples of minimally connected graphs. Connected graphs which are not trees must have edges which can
be removed and still preserve the property that the graph is connected. These edges are edges that lie on cycles.)
c. If a tree has n vertices, then it has (n-1) edges. If we denote the number of edges of a graph G by |E(G)| and the number of vertices of G by |V(G)|, then |V(G)| = |E(G)| + 1. In this form this
result can be thought of as a special case of Euler's (polyhedral) Formula.
d. If u and v are two distinct vertices of a tree not already joined by an edge, then adding the edge from u to v to the tree will create exactly one cycle.
It is these appealing properties of trees that give rise to the many theoretical and applied aspects of graphs which make them so ubiquitous as tools in mathematics and computer science. Trees are
widely used as data structures in computer science.
Minimum cost spanning trees
One example of the power of using trees as a tool appears in a problem which often arises in operations research. Here is one applications setting. Consider the graph with weights as pictured below.
Each weight gives the cost of creating a communications link between the vertices at the end of the edge, so that we can send a message between the endpoints of the edges. (Edges which are omitted
above have such high cost that it is prohibitive to create these links.) Our goal is to be able to send a message between any pair of vertices by selecting links in the graph above so that the weight
of putting in the selected links has the smallest possible total cost. Note that we are not requiring links between every pair of vertices because if the link from A to B is inserted and the link
between B and C is inserted, then one can send a message from A to C by relaying it via B. (In the interests of simplification we do not consider relay costs.) Note that if the links selected formed
a cycle, one could omit the edge of the cycle with the largest weight and still be able to send messages between any pair of vertices which make up the cycle. Thus, the best answer for the network
must be a tree. One is given a graph with weights on the edges, typically positive weights, though negative weights are allowed and can be thought of in applications as subsidies for the use of the
edge of a graph having a negative weight. The goal is to try to find a spanning tree of the graph which has the property that the sum of the weights of the edges in the tree is a minimum. The meaning
of being a spanning tree is that the tree includes all of the vertices of the original graph. (The word "spanning" in graph theory is often used for a subgraph of a graph which includes all of the
vertices of the original.) Were we to select the blue edges in the diagram below as links, it would be possible to relay messages between any pair of vertices. However, can you see why this is not
the cheapest way to create such a network?
Keep reading to see a variety of different elegant methods to find a way of choosing the links in a situation such as this which achieve minimum cost. The mathematical literature typically refers to
the problem being described here as the minimal spanning tree problem or MST. This name is not ideal because one can conceive of a variety of interpretations for minimal. Here I will use the more
suggestive term "minimum cost spanning tree."
History of algorithms to find minimum cost spanning trees
The history of the minimum cost spanning tree problem is rather interesting and complex. Until recently, most textbook discussions of this problem made reference to the work of two American
mathematicians, then employees at Bell Laboratories, who each developed an algorithm for solving the minimum cost spanning tree problem. They are Joseph B. Kruskal who published his work in 1956,
(Photo courtesy of Pieter Kroonenberg (U. of Leiden), who took the photo.)
and Robert C. Prim who published his work in 1957.
(This photo, courtesy of Robert Prim, dates from 1971.)
In the textbook and research literature that developed concerning what Kruskal and Prim accomplished it was largely lost that others had worked on this problem previously. In particular it was mostly
overlooked that in the papers of both Prim and Kruskal, reference was made to the work of the Czech mathematician Otakar Borůvka (1899-1995). Borůvka's work dated to 1926 and his algorithm for the
minimum cost spanning tree problem is different from that of either Kruskal or Prim! Furthermore, Borůvka's algorithm is very elegant and deserves as much attention as that of Prim and Kruskal. His
work was published in Czech (one paper with a German summary). Recent work on the history of the minimum cost spanning tree problem shows that there were a variety of independent discoveries of the
algorithms and ideas involved, which is not surprising in light of the theoretical importance of greedy (making a locally best choice) algorithms and the many applied problems that can be attacked
using the mathematics involved. For example, Prim's algorithm had actually been independently discovered much earlier by the Czech mathematician Vojtečh Jarník (1897-1970), who made important
contributions to mathematics besides his work on trees. The complete story of the circumstances of Kruskal's and Prim's interest in the minimum cost spanning tree problem stems from problems in
pricing "leased-line services" by the Bell System.
The algorithm that Kruskal discovered for finding a minimum cost spanning tree is very appealing, though it does require a proof that it always produces an optimal tree. (The analogous algorithm for
the Traveling Salesman Problem does not always yield a global optimum.) Also, at the start, Kruskal's algorithm requires the sorting of the weights of all of the edges of the graph for which one
seeks a minimum cost spanning tree. This requires that computer memory be used to store this information. Given computer capabilities at the time Kruskal's algorithm did not meet the needs of the
Bell System's clients. It occurred to Robert Prim, Kruskal's colleague at Bell Laboratories, that it might be possible to find an alternative algorithm to Kruskal's (even though mathematically
Kruskal's work was very appealing), which met the needs of the Bell System's customers. He succeeded in doing this and in noting that his method worked for graphs with ties in cost between edges and
with negative weights.
All three of the algorithms due to Borůvka, Kruskal and Prim are "greedy" algorithms that is, they depend on doing something which is locally optimal (best), which "miraculously" turns out to be
globally optimal.
Prim's algorithm works by picking, starting at any vertex, a cheapest edge at that vertex, contracting that edge to a single new "super-vertex" and repeating the process. Kruskal's algorithm works by
adding the edges in order of cheapest weight subject to the condition that no cycle of edges is created. (One advantage of Prim's algorithm is that no special check to make sure that a cycle is not
formed is required.) Borůvka's algorithm (which to work in its simplest form requires that all edges have distinct weights) works by having each vertex grab a cheapest edge. If the resulting
structure is not a tree, then the components obtained are shrunk and the process repeated. The details of these algorithms are described below using a simple example.
Minimum cost spanning tree algorithms
In what follows we will use the following example (Figure 1) to illustrate the way that the various algorithms in which we are interested work. You can think of this graph as giving 6 sites that must
be connected by a high transmission electrical system or a cable system of some kind. The sites that have no line segments connecting them are too expensive to connect. Note that the edges all have
distinct costs (lengths), which makes the initial exposition a trifle simpler. However, the discussion below can be modified to deal with the situation in which some edges have equal weights. When
there are ties for the weights of the edges, the cost associated with a minimum cost spanning tree is the same for all trees which achieve minimum cost. When the edges all have distinct weights there
is a unique tree which solves the problem.
Figure 1
There are nine edges in the above graph. If we sort the weights of these edges in increasing order, we get: 4, 5, 9, 10, 11, 12, 13, 20, 24. If we try to get a cheap connecting system by adding edges
in order of increasing cost, we would first insert the edges of cost 4 and 5 as shown in the diagram below:
Figure 2
The next cheapest edge would be 9 but its insertion would create a cycle. To send electricity from vertex 0 to vertex 2 does not require the link from 0 to 2 because it can instead be sent from 0 to
1 and then from 1 to 2. Hence, we need not add the link from 0 to 2. Thus, the next edges we would add would be the edges 3 to 4 and 4 to 5 because these are the cheapest at the next two decision
stages. After adding these links we get the following situation:
Note that at this stage, the edges selected do not form a connected subgraph of the original edges. Thus, Kruskal's algorithm does not form a tree at every stage of the algorithm. However, by the
time the algorithm terminates, the edges will form a tree. The next cheapest edge, having cost 12, would also form a cycle with previously chosen edges, so it is not added to the collection of links.
However, the edge with cost 13 can be added. We now have a collection of edges which forms no cycle and which includes all the vertices of the original graph. Thus, we have found a collection of
links which makes it possible to transmit electricity from any of the locations to any of the others, using relays if necessary. Since we are seeking a tree as the final collection of edges (shown in
red in Figure 4), we can use the fact that all trees with the same number of vertices have the same number of edges to determine how many edges must be selected before Kruskal's algorithm, or that of
Prim or Borůvka, will terminate. Specifically, we know that for a tree, the number of vertices and edges are related by the equation:
So that in applying Kruskal's algorithm, when we have selected a connected number of edges to put into our linking network that is one less than the number of vertices to be linked, we know that we
have exactly the right number of linking edges!
Figure 4
Prim's algorithm is also a greedy algorithm, in the sense that it repeatedly makes a best choice in a sequence of stages. However, one difference is that Prim's algorithm always results in a tree at
each stage of the procedure, producing a spanning tree at the stage where the algorithm terminates. The idea behind Prim's algorithm is to add a cheapest edge which links a new neighboring vertex (a
"super-vertex") to a previously selected collection of vertices. We can choose to initiate the algorithm at any vertex of the dot/line diagram. Thus, if we start the procedure at vertex 3, we have
three edges to choose from: edge 13 costing 13, edge 34 costing 10 and edge 35 costing 12. Since edge 34 is cheapest, we select this one. At this stage we have the situation shown in Figure 5:
Figure 5
We now think of shrinking the edge from 3 to 4 to a single "super-vertex." This super-vertex has neighboring vertices connected to it by edges. These are the edges 04, 13, 35, and 45 (with costs 24,
13, 12, and 11, respectively). The cheapest of these in cost is the edge 45, so we select this edge next.
Figure 6
At this stage we can think of vertices 3, 4, and 5 as a "super-vertex." The neighbors of this super-vertex are the edges 04, 13, and 25. Note that we do not consider the edge 35 any longer as a
neighbor because it joins two vertices which are contained "within" the super-vertex. Since the edge 13, coincidentally with cost 13, is the cheapest of the neighbors of the super-vertex, we next add
the edge 13 to the growing collection of links.
Figure 7
We can now continue in this way until our super-vertex consists of all of the vertices of the original graph. Here is the order in which the vertices are added to the super-vertex starting with the
initial vertex 3: 4, 5, 1, 2, 0. Thus the edges added are: 34, 45, 13, 12, 10, which gives rise to exactly the same final collection of connecting edges as previously, as shown in red in Figure 4.
Although Kruskal's and Prim's algorithms are quite well known, until relatively recently the algorithm of Borůvka was less well known despite the fact that it was discovered earlier and is cited in
the papers of both Kruskal and Prim. How does this algorithm of Borůvka work? It is carried out in stages, just as the those of Kruskal and Prim are. The method applies to dot/line diagrams with
weights where all of the weights are distinct, as happens to be the case in our example. Under this assumption, note that the "grabbing" operation described below can not generate a collection of
grabbed edges which form a cycle! Thus, the edges selected either form a tree or a collection of trees (i.e. a forest).
One stage of the algorithm consists of each vertex (or in later stages super-vertices) "grabbing" an edge which is adjacent to the vertex which is cheapest, without regard to edges grabbed by other
vertices. Thus, since at vertex 0, the edges are 01, 02, and 04, the cheapest being 01 of weight 5, vertex 0 grabs edge 01. Vertex 1 has as adjacent edges 13, 10, and 12 and, thus, vertex 1 grabs the
edge 12. Vertex 2, having adjacent edges 21, 20, and 25, grabs the cheapest edge 21, of weight 4. In a similar way, vertex 3 graphs the edge 34, vertex 4 grabs the edge 43, and vertex 5 grabs the
edge 54. At this stage we have the current pattern of "grabbed edges":
Figure 8
If the blue edges in Figure 8 formed a tree, we would be finished. However, since they do not, we form a collection of super-vertices which arise from the sets of connected vertices which have
currently formed with selected edges. We then carry out another "grabbing" stage of the algorithm. In our current example, there are two super-vertices (one consisting of vertices 0, 1, and 2 and the
other consisting of vertices 3, 4, and 5). These super-vertices are linked with edges of weight 13, 20, and 24. If we call the super-vertices A and B respectively, A grabs the edge AB of weight 13,
and B graphs the edge BA (which is, of course, the same as AB) of weight 13. This new edge, when changed to color blue, together with the blue edges in Figure 8 gives rise to the connecting edges
shown in red in Figure 4. Again, we have found the minimum cost spanning tree.
Let me briefly comment on the issue of what happens for these algorithms when there are edges with the same weight in the graph for which we are trying to find a minimum cost spanning tree. The graph
in Figure 9 shows an especially simple situation, but it will help clarify the situation.
Figure 9
In Figure 10, we have shown three copies of the graph in Figure 9, each with a minimum cost spanning tree of cost 102. This illustrates the fact that a graph which has edges with equal weights can
have many minimum cost spanning trees, but that one can prove that all of the minimum cost spanning trees have the same cost. Also note that in each case the edge with maximum cost in the original
graph can be part of a minimum cost spanning tree. However, in any cycle in a graph for which one seeks a minimum cost spanning tree, if the edges of this cycle have different costs, then the edge of
maximum cost in this cycle can not be part of a minimum cost spanning tree.
I have not indicated proofs for the above algorithms. Obviously, it is important to provide such proofs. What is intriguing is that where the greedy algorithms of Kruskal and Prim are optimal for the
problem of finding a minimum cost spanning tree, the analogous greedy algorithms for finding a solution to the Traveling Salesman Problem are not optimal.
The idea behind one proof of Kruskal's algorithm is to assume there is a tree T with a cost less than or equal to that of a tree K that is generated by Kruskal's procedure. Construct the list L of
the edges of the tree K in the order in which Kruskal's algorithm inserted them into K. If T is not the same tree as K, find the first edge e in list L which is an edge of K but not of T. When e is
added to T, because of a property of trees mentioned at the start, a unique cycle is formed. This cycle must contain at least one edge e' not in K since K, being a tree, has no cycles. Now form the
tree T' which consists of adding e to T and removing e'. The cost of this new tree T' is the cost of T plus the weight on e minus the weight on e'. Since T is a cheapest tree and since Kruskal's
algorithm chooses edges in order of cheapness subject to not forming a cycle, the weight on e and e' must be equal. This means that T' and T have the same cost, and, thus, K and T' agree on one more
edge than K and T in terms of cost. Continuing in this way we see that we may have different trees that achieve minimum cost (these arise from different ways of breaking ties when Kruskal's algorithm
is applied) but none that can be less costly than the tree that Kruskal's method produces.
One natural consideration in comparing the algorithms which have been discussed concerns the question of which of the approaches is computationally better. This turns out to be a complicated question
which depends on the number of vertices and edges in the weighted graph. Questions arise concerning the computational complexity of these algorithms in terms of the data structures that are used for
representing the graph and its weights, and the nature of the computer (e.g. serial or parallel) that is doing the calculations.
Although the minimum cost spanning tree algorithms were created in part due to applications involving the creation of various kinds of networks (e.g. phone, electrical, cable), many other
applications have been developed. One natural extension of the mathematical model we have just been considering is to have not only a weight on the edges of the graph but also a weight on the
vertices of the graph. If a vertex is part of a spanning tree where the degree (valence) of the vertex in that tree is more than one, then relays will perhaps be necessary at that vertex. In this
model we seek that spanning tree of the original graph such that the sum of the weights on the edges of the spanning tree T together with the sum of the weights at the vertices of T is a minimum.
Unlike the initial model where we found a variety of elegant polynomial time algorithms, this probably more realistic problem is not known to have a polynomial time algorithm. In fact, the problem is
known to be NP-Complete, which suggests that a "fast" algorithm for solving this problem may not be possible.
Let us conclude with another, perhaps unexpected, extension of this circle of ideas: Minimum cost spanning trees for points in the Euclidean plane where the cost associated with a pair of points is
the Euclidean distance between them. For three points forming the vertices of an equilateral triangle with side length 1, if we restrict ourselves to a spanning tree of the graph formed by the
vertices and edges of the equilateral triangle, the minimum cost spanning tree will have a cost of 2. However, if we are allowed to add a fourth point P in the interior of the triangle, which when
joined to the vertices of the triangle creates three equal 120 degree angles, then the three segments which join P to the vertices of the triangle, sum to a length of less than 2! The point P is
called a Steiner point with respect to the original three. Problems which involve finding minimum cost spanning trees for points in the Euclidean plane when one is allowed to add Steiner point turns
out to be both interesting and complex, with many theoretical and applied ramifications. Steiner trees are no less fascinating than minimum cost spanning trees.
Bazlamacci C. and K. Hindi, Minimum -weight spanning tree algorithms: A survey and empirical study, Computers & Operations Research, 28 (2001) 767-785.
Bern, M. and R. Graham, The shortest network problem, Scientific American, 1989, p. 66-71.
Blum, A. and R. Ravi, S. Vempala, A constant-factor approximation algorithm for the k-MST problem, Proc. 28th Symposium Theory of Computing, 1996.
Borůvka, O. jistem problemu minimalmim, Praca Moravske Prirodovedecke Spolecnosti, 3 (1926) 37-58 (in Czech)
Cayley, A., A theorem about trees, Quart. J. Math., 23 (1889) 376-378.
Chan, T., Backwards analysis of the Karger-Klein-Tarjan algorithm for minimum spanning trees, Information Processing Letters, 67 (1998) 303-304.
Chazelle, B., A minimum spanning tree algorithm with inverse-Ackermann type complexity, J. ACM, 47 (2000) 1028-1047.
Chazelle, B. and R. Rubinfeld, L. Trevisan, Approximating the minimum cost spanning tree weight in sublinear time, SIAM J. Computing, 34 (2005) 1370-1379.
Cheriton, D. and R. Tarjan, Finding minimum spanning trees, SIAM J. Computing, 5 (1976) 724-742.
Cole, R. and P. Klein, R. Tarjan, A linear-work parallel algorithm for finding minimum spanning trees, Proceedings of SPAA, 1994.
Dijkstra, E., Some theorems on spanning subtrees of a graph, Indag. Math., 22 (1960) 196-199.
Dixon, B. and M. Rauch, R. Tarjan, Verification and sensitivity analysis of minimum spanning trees in linear time, SIAM J. Computing, 21 (1992) 11-84-1192.
Du, D.-Z. and F. Hwang, A proof of the Gilbert-Pollak conjecture on the Steiner ratio, Algorithmica, 7 (1992) 121-135.
Dutta, B. and A. Kar, Cost monotonicity, consistency and minimum cost spanning tree games, Games Economic Behavior, 48 (2004) 223-248.
Fredman, M. and R. Tarjan, Fibonacci heaps and their uses in improved network optimization algorithms, J. ACM, 34 (1987) 596-615.
Fredman, M. and D. Willard, Trans-dichotomous algorithms for minimum spanning trees and shortest paths, J. Comput. Syst. Sci., 48 (1994) 424-436.
Gabow, H. and Z. Galil, T. Spencer, R. Tarjan, Efficient algorithms for finding minimum spanning trees in undirected and directed graphs, Combinatorica, 6 (1986) 109-122.
Gilbert, E. and H. Pollak, Steiner minimal trees, SIAM J. Applied Math., 16 (1968) 1-29.
Eppstein, D. and Z. Galil, G. Italiano, Dynamic graph algorithms, in Algorithms and Theory of Computation Handbook, M. Atallah, editor, CRC, Boca Raton, 1999.
Graham, R. and P. Hell, On the history of the minimum spanning tree problem, Ann. Hist. Computing, 7 (1985) 43-57.
Gusfield, D., Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology, Cambridge U. Press, New York, 1997.
Hansen, P. and M. Zheng, Shortest shortest path trees of a network, Discrete Applied Math., 65 (1996) 275-284.
Hochbaum, D., Approximation Algorithms for NP-Hard Problems, PWS Publishing, 1997.
Hu, T., Optimum communication spanning trees, SIAM J. Computing, 3 (1974) 188-195.
Hwang, F. and D. Richards, P. Winter, The Steiner tree problem, Ann. Discrete Math. 53 (1992).
Jarník, V., O jistem problemu minimalnim (in Czech), raca Moravske Prirodovedecke Spolecnosti, 6 (1930) 57-63.
Kar, A., Axiomatization of the Shapley value on minimum cost spanning tree gamse, Games Economic Behavior, 38 (2002) 265-277.
Karger, D. and P. Klein, R. Tarjan, A randomized linear-time algorithm to find minimum spanning trees, J. ACM, 42 (1995) 321-328.
King, V., A simpler minimum spanning tree verification algorithm, Algorithmica, 18 (1997) 263-270.
Ivanov, A. and A. Tuzhilin, Minimal Networks: The Steiner Problem and its Generalizations, CRC Press, Boca Raton, 1994.
Korte, B. and J. Nesetril, Vojtech Jarník's work in combinatorial optimization, Discrete Mathematics, 235 (2001) 1-17.
Komlos, J., Linear verification for spanning trees, Combinatorica, 5 (1985) 57-65.
Korte, B. and L. Lovasz, R. Schrader, Greedoids, Springer-Verlag, Berlin, 1991.
Kou, L. and G. Markowsky, L. Berman, A fast algorithm for Steiner trees, Acta. Inform., 15 (1981) 141-145.
Kruskal, J., On the shortest spanning subtree of a graph and the traveling salesman problem, Proc. Amer. Math. Soc., 7 (1956) 48-50.
Kruskal, J., A reminiscence about shortest spanning trees, Archivum Mathematicum (BRNO), 33 (1997) 13-14.
Lavallée, I., Un algorithm parallèle efficace pur construire un arbre de poids minimal dans un graphe, RAIRO Rech. Oper., 19 (1985) 57-69.
Leeuwen, J. van, Graph Algorithms, in Handbook of Theoretical Computer Science, J. van Leeuwen, (editor), Volume A, Algorithms and Complexity, MIT Press, Cambridge, 1994.
Levcopoupoulos, C. and A. Lingas, There are planar graphs almost as good as the complete graphs and as cheap as minimum spanning trees, Algorithmica, 8 (1992) 251-256.
Nesetril, J., A few remarks on the history of the MST problem, Archivum Mathematicum (BRNO), 33 (1997) 15-22.
Nesetril, J. and E. Milová, H. Nesetrilova, Otakar borůvka on minimum spanning tree problem: Translation of both the 1926 papers, comments, history, Discrete Mathematics 233 (2001) 3-36.
Pettie, S. and V. Ramachandran, An optimal minimum spanning tree algorithm, J. ACM, 49 (2002) 16-34.
Pollak, H., Private communication, 2005.
Prim, R., Shortest connection networks and some generalizations, Bell. System Tech. J., 36 (1957) 1389-1401.
Prim, R. Personal communication, 2005.
Promel, H. and A. Steger, The Steiner Tree Problem, Vieweg, Braunschweig/Wiesbaden, 2002.
Ravi, R. and R. Sundaram, M. Marathe, D. Rosenkrantz, S. Ravi, Spanning trees short or small, SIAM J. Discrete Math., 9 (1996) 178-200.
Rosen, K., (editor), Handbook of Discrete and Combinatorial Mathematics, Chapter 9 (Trees), Chapter 10 (Networks and Flows), CRC, Boca Raton, 2000.
West, D. Introduction to Graph Theory, Second Edition, Prentice-Hall, Upper Saddle River, 2001.
Wu, B.-Y. and K.-M. Chao, Spanning Trees and Optimization Problems, Chapman & Hall/CRC, Boca Raton, 2004.
Xu, Y. and Volman, D. Xu, Clustering gene expression data using graph theoretic approach: An application of minimum spanning trees, Bioinformatics, 18 (2002) 536-545.
Yao, A. An O(|E| log log |V|) algorithm for finding minimum spanning trees, Info. Processing Lett., 4 (1975) 21-23.
NOTE: Those who can access JSTOR can find some of the papers mentioned above there. For those with access, the American Mathematical Society's MathSciNet can be used to get additional bibliographic
information and reviews of some these materials. Some of the items above can be accessed via the ACM Portal, which also provides bibliographic services. | {"url":"http://www.ams.org/publicoutreach/feature-column/fcarc-trees","timestamp":"2024-11-03T00:33:43Z","content_type":"text/html","content_length":"83503","record_id":"<urn:uuid:ae25e762-e1a4-4023-b52a-6dc1064c7340>","cc-path":"CC-MAIN-2024-46/segments/1730477027768.43/warc/CC-MAIN-20241102231001-20241103021001-00718.warc.gz"} |
The Rast method uses camphor \(\left(\mathrm{C}_{10} \mathrm{H}_{16} \mathrm{O}\right)\) as a solvent for determining the molar mass of a compound. When \(2.50 \mathrm{~g}\) of cortisone acetate is
dissolved in \(50.00 \mathrm{~g}\) of camphor \(\left(k_{\mathrm{f}}=40.0^{\circ} \mathrm{C} / \mathrm{m}\right)\), the freezing point of the mixture is determined to be \(173.44^{\circ} \mathrm{C}
\); that of pure camphor is \(178.40^{\circ} \mathrm{C}\). What is the molar mass of cortisone acetate?
Short Answer
Expert verified
Question: Using the Rast method, calculate the molar mass of cortisone acetate given the following information: - Mass of cortisone acetate: 2.50 g - Mass of camphor: 50.00 g - Freezing point
depression constant: 40.0 °C/molal - Freezing point of the mixture: 173.44 °C - Freezing point of pure camphor: 178.40 °C Answer: The molar mass of cortisone acetate is approximately 403.23 g/mol.
Step by step solution
Calculate the freezing-point depression
Delta T = Freezing point of pure camphor - Freezing point of the mixture = \(178.40^{\circ} \mathrm{C}\) - \(173.44^{\circ} \mathrm{C}\) = \(4.96^{\circ} \mathrm{C}\)
Use the freezing-point depression equation
The equation for freezing-point depression is: \(\Delta T = k_f \cdot m\), where \(\Delta T\) is the freezing-point depression, \(k_f\) is the freezing-point depression constant, and \(m\) is the
molality. We need to find the molality, so we will rearrange the equation: \(m = \frac{\Delta T}{k_f}\). Substitute the given values and we get: \(m = \frac{4.96^{\circ} \mathrm{C}}{40.0 \frac{^{\
circ} \mathrm{C}}{\mathrm{molal}}}\) = \(0.124 \mathrm{~molal}\).
Convert the mass of camphor to kg
We have to convert the given mass of camphor (50.00 g) to kilograms to find the number of moles of solute in the solution. 50.00 g \(\times\) \(\frac{1 \mathrm{~kg}}{1000 \mathrm{~g}}\) = 0.05000 kg.
Find the number of moles of cortisone acetate
To find the number of moles, we will use the molality formula which is: \(m= \frac{\text{moles of solute}}{\text{mass of solvent in kg}}\). So, number of moles = molality \(\times\) mass of solvent
in kg = \(0.124 \mathrm{~molal} \times 0.05000 \mathrm{~kg}\) = 0.00620 moles of cortisone acetate.
Calculate the molar mass of cortisone acetate
Molar mass is equal to the mass of the substance divided by the number of moles of the substance: Molar mass = \(\frac{\text{Mass of cortisone acetate}}{\text{No. of moles of cortisone acetate}}\) =
\(\frac{2.50 \mathrm{~g}}{0.00620 \mathrm{~moles}}\) = 403.23 g/mol. The molar mass of cortisone acetate is 403.23 g/mol.
Key Concepts
These are the key concepts you need to understand to accurately answer the question.
Rast Method
The Rast method is a classic technique utilized for the determination of the molar mass or molecular weight of a non-volatile compound. This technique involves dissolving the compound in a suitable
solvent and measuring the depression in freezing point of the solution. The choice of solvent is crucial—camphor is a popular choice due to its large freezing-point depression constant and
non-reactive nature.
Through the Rast method, the direct effect of a solute on the freezing point of a solvent is observed. It is particularly useful because it only requires a small amount of the compound to determine
its molar mass and it's not necessary for the solute to be in its pure form, as long as it dissolves completely in the solvent without reacting.
Freezing-Point Depression
Freezing-point depression is one of several colligative properties that are dependent on the solute concentration, not its identity. When a solute is dissolved in a solvent, it generally decreases
the temperature at which the solvent will freeze. This phenomenon is steming from the solute particles disrupting the formation of the crystalline structure of the solvent, which is essential for the
freezing process.
The degree of freezing-point depression can be predicted using the formula \( \Delta T = k_f \cdot m \), where \( \Delta T \) is the change in freezing point, \( k_f \) is the freezing-point
depression constant characteristic of the solvent, and \( m \) is the molality of the solution. This formula allows for the calculation of molar mass of dissolved substances by measuring the
freezing-point depression they cause.
Unlike molarity, which is concentration expressed as moles of solute per liter of solution, molality is defined as the moles of solute per kilogram of solvent. Represented with \( m \), it is
expressed as \( \text{molal} \), and is crucial for colligative properties calculations because it doesn't change with temperature and doesn't require knowledge of the volume of the solution.
Molality is derived using the formula \( m = \frac{\text{moles of solute}}{\text{mass of solvent in kg}} \). This measure is important when dealing with high precision colligative properties because
it ensures consistent calculations regardless of temperature changes or the expansion of the solvent, making molality an ideal concentration unit for these types of problems.
Colligative Properties
Colligative properties, such as boiling point elevation, freezing point depression, and vapor pressure lowering, depend solely on the number of solute particles in a solvent, not the type of
particles. This is a key concept in chemistry because it means that these properties can be used to determine molar masses and degrees of dissociation for ionic compounds.
Each colligative property has a corresponding constant and formula that relates to the molarity or molality of the solution. For instance, freezing-point depression and boiling point elevation
constants are unique to each solvent. Hence, in the educational context, understanding colligative properties paves the way for students to grasp how the presence of a solute can alter the physical
properties of a solution in predictable ways, which is fundamental in both theoretical and practical chemistry. | {"url":"https://www.vaia.com/en-us/textbooks/chemistry/chemistry-principles-and-reactions-6-edition/chapter-10/problem-48-the-rast-method-uses-camphor-leftmathrmc10-mathrm/","timestamp":"2024-11-12T01:05:28Z","content_type":"text/html","content_length":"264991","record_id":"<urn:uuid:e52c702f-0177-461f-bc4d-5fdf83d44cd1>","cc-path":"CC-MAIN-2024-46/segments/1730477028240.82/warc/CC-MAIN-20241111222353-20241112012353-00823.warc.gz"} |
Banach space
In mathematics, particularly in the branch known as functional analysis, a Banach space is a complete normed space. It is named after famed Hungarian-Polish mathematician Stefan Banach.
The space of all continous complex (resp. real) linear functionals of a complex (resp. real) Banach space is called its dual space. This dual space is also a Banach space when endowed with the
operator norm on the continuous (hence, bounded) linear functionals.
Examples of Banach spaces
1. The Euclidean space ${\displaystyle \scriptstyle \mathbb {R} ^{n}}$ with any norm is a Banach space. More generally, any finite dimensional normed space is a Banach space (due to its isomorphism
to some Euclidean space).
2. Let ${\displaystyle \scriptstyle L^{p}(\mathbb {T} )}$, ${\displaystyle \scriptstyle 1\,\leq p\,\leq \,\infty }$, denote the space of all complex-valued measurable functions on the unit circle ${\
displaystyle \scriptstyle \mathbb {T} \,=\,\{z\in \mathbb {C} \mid |z|\,=\,1\}}$ of the complex plane (with respect to the Haar measure ${\displaystyle \scriptstyle \mu }$ on ${\displaystyle \
scriptstyle \mathbb {T} }$) satisfying:
${\displaystyle \int _{\mathbb {T} }|f(z)|^{p}\,\mu (dz)<\infty }$,
if ${\displaystyle \scriptstyle 1\,\leq p\,<\infty }$, or
${\displaystyle \mathop {{\rm {ess}}\sup } _{z\in \mathbb {T} }|f(z)|<\infty ,}$
if ${\displaystyle \scriptstyle p\,=\,\infty }$. Then ${\displaystyle \scriptstyle L^{p}(\mathbb {T} )}$ is a Banach space with a norm ${\displaystyle \scriptstyle \|\cdot \|_{p}}$ defined by
${\displaystyle \|f\|_{p}=\left(\int _{\mathbb {T} }|f(z)|^{p}\,\mu (dz)\right)^{1/p}}$,
if ${\displaystyle \scriptstyle 1\,\leq \,p<\infty }$, or
${\displaystyle \|f\|_{\infty }=\mathop {{\rm {ess}}\sup } _{z\in \mathbb {T} }|f(z)|,}$
if ${\displaystyle \scriptstyle p\,=\,\infty }$. The case p = 2 is special since it is also a Hilbert space and is in fact the only Hilbert space among the ${\displaystyle \scriptstyle L^{p}(\mathbb
{T} )}$ spaces, ${\displaystyle \scriptstyle 1\,\leq p\,\leq \infty }$. | {"url":"https://citizendium.org/wiki/Banach_space","timestamp":"2024-11-06T20:13:31Z","content_type":"text/html","content_length":"54460","record_id":"<urn:uuid:0024b76e-a4fd-43ba-a17a-8e70b29ca5c3>","cc-path":"CC-MAIN-2024-46/segments/1730477027942.47/warc/CC-MAIN-20241106194801-20241106224801-00121.warc.gz"} |
Number of iterations
16.7 Number of iterations analysis ¶
Both on GIMPLE and on RTL, there are functions available to determine the number of iterations of a loop, with a similar interface. The number of iterations of a loop in GCC is defined as the number
of executions of the loop latch. In many cases, it is not possible to determine the number of iterations unconditionally – the determined number is correct only if some assumptions are satisfied. The
analysis tries to verify these conditions using the information contained in the program; if it fails, the conditions are returned together with the result. The following information and conditions
are provided by the analysis:
• assumptions: If this condition is false, the rest of the information is invalid.
• noloop_assumptions on RTL, may_be_zero on GIMPLE: If this condition is true, the loop exits in the first iteration.
• infinite: If this condition is true, the loop is infinite. This condition is only available on RTL. On GIMPLE, conditions for finiteness of the loop are included in assumptions.
• niter_expr on RTL, niter on GIMPLE: The expression that gives number of iterations. The number of iterations is defined as the number of executions of the loop latch.
Both on GIMPLE and on RTL, it necessary for the induction variable analysis framework to be initialized (SCEV on GIMPLE, loop-iv on RTL). On GIMPLE, the results are stored to struct tree_niter_desc
structure. Number of iterations before the loop is exited through a given exit can be determined using number_of_iterations_exit function. On RTL, the results are returned in struct niter_desc
structure. The corresponding function is named check_simple_exit. There are also functions that pass through all the exits of a loop and try to find one with easy to determine number of iterations –
find_loop_niter on GIMPLE and find_simple_exit on RTL. Finally, there are functions that provide the same information, but additionally cache it, so that repeated calls to number of iterations are
not so costly – number_of_latch_executions on GIMPLE and get_simple_loop_desc on RTL.
Note that some of these functions may behave slightly differently than others – some of them return only the expression for the number of iterations, and fail if there are some assumptions. The
function number_of_latch_executions works only for single-exit loops. The function number_of_cond_exit_executions can be used to determine number of executions of the exit condition of a single-exit
loop (i.e., the number_of_latch_executions increased by one).
On GIMPLE, below constraint flags affect semantics of some APIs of number of iterations analyzer:
• LOOP_C_INFINITE: If this constraint flag is set, the loop is known to be infinite. APIs like number_of_iterations_exit can return false directly without doing any analysis.
• LOOP_C_FINITE: If this constraint flag is set, the loop is known to be finite, in other words, loop’s number of iterations can be computed with assumptions be true.
Generally, the constraint flags are set/cleared by consumers which are loop optimizers. It’s also the consumers’ responsibility to set/clear constraints correctly. Failing to do that might result in
hard to track down bugs in scev/niter consumers. One typical use case is vectorizer: it drives number of iterations analyzer by setting LOOP_C_FINITE and vectorizes possibly infinite loop by
versioning loop with analysis result. In return, constraints set by consumers can also help number of iterations analyzer in following optimizers. For example, niter of a loop versioned under
assumptions is valid unconditionally.
Other constraints may be added in the future, for example, a constraint indicating that loops’ latch must roll thus may_be_zero would be false unconditionally. | {"url":"https://gcc.gnu.org/onlinedocs/gccint/Number-of-iterations.html","timestamp":"2024-11-09T19:40:43Z","content_type":"text/html","content_length":"8551","record_id":"<urn:uuid:27d6e4b8-3d8c-437d-9097-c9db8f9f3a38>","cc-path":"CC-MAIN-2024-46/segments/1730477028142.18/warc/CC-MAIN-20241109182954-20241109212954-00253.warc.gz"} |
In-Vivo Quantification of Brain
Microstructure: a Preliminary
Analysis using SHORE Diffusion
L. Brusini1, M. Zucchelli1, G.K. Ricciardi2, F. Pizzini2, S. Montemezzi2, G.
1 Dept.
of Computer Science, University of Verona
2 Dept. of Neuroradiology, AOUI of Verona
From Diffusion Signal to Water
Molecules PDF
From Diffusion Signal to Water
Molecules PDF
The Ensemble Average
Propagator (EAP) represents
the probability of a net
displacement r in the unit time
From Diffusion Signal to Water
Molecules PDF
The Ensemble Average
Propagator (EAP) represents
the probability of a net
displacement r in the unit time
The Orientation Distribution
Function (ODF) represents the
probability of diffusion in each
direction u
Diffusion Tensor Imaging (DTI)
Diffusion Tensor Imaging (DTI)
✓ Fast acquisition
✓ Efficient reconstruction
Diffusion Tensor Imaging (DTI)
✓ Fast acquisition
✓ Efficient reconstruction
☓ Since the EAP is modeled as
a single tensor, DTI is not
able to resolve complex fibers
architectures like fannings
and crossings
Simple Harmonic Oscillator based
Reconstruction and Estimation (SHORE)
Signal approximated using a combination of orthonormal
functions which are the solutions of the 3D quantum
mechanical harmonic oscillator
Simple Harmonic Oscillator based
Reconstruction and Estimation (SHORE)
Signal approximated using a combination of orthonormal
functions which are the solutions of the 3D quantum
mechanical harmonic oscillator
Continuous analytical basis
✓ Continuous analytical signal representation in q-space
independently from the acquisition sampling scheme
✓ Possibility to calculate the EAP and the ODF
analytically, obtaining an exact solution for all the
Propagator Anisotropy (PA) and
Mean Squared Displacement (MSD)
Propagator Anisotropy (PA) and
Mean Squared Displacement (MSD)
Measure of the
angular similarity
between the
propagator and its
isotropic part
Propagator Anisotropy (PA) and
Mean Squared Displacement (MSD)
Measure of the
angular similarity
between the
propagator and its
isotropic part
Degree of diffusivity
of the water
molecules in the
Measures of Zero Net Displacement
● Restricted diffusion in pores
● gradient duration very small
● time between gradients is
figure refers
L. Avram et
al., NMR
2008; 21:
Measures of Zero Net Displacement
● Restricted diffusion in pores
● gradient duration very small
● time between gradients is
figure refers
L. Avram et
al., NMR
2008; 21:
Return To the Origin
Probability (RTOP)
Measures of Zero Net Displacement
● Restricted diffusion in pores
● gradient duration very small
● time between gradients is
figure refers
L. Avram et
al., NMR
2008; 21:
Return To the Origin
Probability (RTOP)
Return To the Axis
Probability (RTAP)
Measures of Zero Net Displacement
● Restricted diffusion in pores
● gradient duration very small
● time between gradients is
figure refers
L. Avram et
al., NMR
2008; 21:
Return To the Origin
Probability (RTOP)
Return To the Plane
Probability (RTPP)
Return To the Axis
Probability (RTAP)
From RTOP, RTAP and RTPP to
Physical Measures
Probability for molecules to undergo no net displacement between the
application of the two diffusion sensitizing gradients
reciprocal of the
From RTOP, RTAP and RTPP to
Physical Measures
Probability for molecules to undergo no net displacement between the
application of the two diffusion sensitizing gradients
reciprocal of the
mean crosssectional area
reciprocal of the
From RTOP, RTAP and RTPP to
Physical Measures
Probability for molecules to undergo no net displacement between the
application of the two diffusion sensitizing gradients
reciprocal of the
mean crosssectional area
reciprocal of the
reciprocal of the
mean length of the
Conclusions and Future Works
Conclusions and Future Works
Conclusions and Future Works
Conclusions and Future Works | {"url":"https://abcdocz.com/doc/1628971/slides","timestamp":"2024-11-04T22:07:22Z","content_type":"text/html","content_length":"22361","record_id":"<urn:uuid:678a6b61-8507-41bc-99ef-1e9bdde1d43b>","cc-path":"CC-MAIN-2024-46/segments/1730477027861.16/warc/CC-MAIN-20241104194528-20241104224528-00804.warc.gz"} |
Negation of the statement: 5 is an integer or 5 is an irration... | Filo
Negation of the statement: is an integer or 5 is an irrational is
Not the question you're searching for?
+ Ask your question
Since, So, negation of the statement ' is an integer and 5 is not irrational'. Is is not an integer and 5 is not irrational? Hence, option (d) is correct.
Was this solution helpful?
Found 8 tutors discussing this question
Discuss this question LIVE
6 mins ago
One destination to cover all your homework and assignment needs
Learn Practice Revision Succeed
Instant 1:1 help, 24x7
60, 000+ Expert tutors
Textbook solutions
Big idea maths, McGraw-Hill Education etc
Essay review
Get expert feedback on your essay
Schedule classes
High dosage tutoring from Dedicated 3 experts
Practice questions from Arihant Mathematics Master Resource Book (Arihant)
View more
Practice more questions from Mathematical Reasoning
View more
Practice questions on similar concepts asked by Filo students
View more
Stuck on the question or explanation?
Connect with our Mathematics tutors online and get step by step solution of this question.
231 students are taking LIVE classes
Question Text Negation of the statement: is an integer or 5 is an irrational is
Topic Mathematical Reasoning
Subject Mathematics
Class Class 11
Answer Type Text solution:1
Upvotes 104 | {"url":"https://askfilo.com/math-question-answers/negation-of-the-statementsqrt5-is-an-integer-or-5-is-an-irrational-isa-sqrt5-is-269600","timestamp":"2024-11-09T13:03:22Z","content_type":"text/html","content_length":"279717","record_id":"<urn:uuid:cb4516dc-7a21-4993-a77e-5d8d7aae45fb>","cc-path":"CC-MAIN-2024-46/segments/1730477028118.93/warc/CC-MAIN-20241109120425-20241109150425-00591.warc.gz"} |
Planning Rigid Body Motions and Optimal Control Problem on Lie Group SO(2, 1)
Commenced in January 2007
Planning Rigid Body Motions and Optimal Control Problem on Lie Group SO(2, 1)
Authors: Nemat Abazari, Ilgin Sager
In this paper smooth trajectories are computed in the Lie group SO(2, 1) as a motion planning problem by assigning a Frenet frame to the rigid body system to optimize the cost function of the elastic
energy which is spent to track a timelike curve in Minkowski space. A method is proposed to solve a motion planning problem that minimizes the integral of the Lorentz inner product of Darboux vector
of a timelike curve. This method uses the coordinate free Maximum Principle of Optimal control and results in the theory of integrable Hamiltonian systems. The presence of several conversed
quantities inherent in these Hamiltonian systems aids in the explicit computation of the rigid body motions.
Keywords: Optimal control, Hamiltonian vector field, Darboux vector, maximum principle, lie group, rigid body motion, Lorentz metric.
Digital Object Identifier (DOI): doi.org/10.5281/zenodo.1079938
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 1569
[1] V. Jurdjevic, F. Monroy-Perez (2002), Variational problems on Lie groups and their homogeneous spaces: elastic curves, tops and constrained geodesic problems in nonlinear geometric control theory
, World Scientific, Singapore.
[2] V. Jurdjevic, (1997), Geometric Control Theory, Advanced Studies in Mathematics, vol 52. Cambridge University Press, Cambridge.
[3] H.J. Sussmann, (1997), An introduction to the coordinate-free maximum principle , In: Jakubezyk B, Respondek W (eds) Geometry of feedback and optimal control. Marcel Dekker, New York, pp 463-557.
[4] J. Biggs, W. Holderbaum, (2008), Planning rigid body motions using elastic curves, Math. Control Signals Syst. 20: 351-367.
[5] A.Yucesan, A.C. Coken, N.Ayyildiz,(2004), On the darboux rotation axis of Lorentz space curve, Applied Mathematics and Computation, 155:345-351.
[6] R.Lopez, (2008), Differential geometry of curves and surfaces in Lorentz-Minkowski space, University of Granada. | {"url":"https://publications.waset.org/12800/planning-rigid-body-motions-and-optimal-control-problem-on-lie-group-so2-1","timestamp":"2024-11-14T21:41:41Z","content_type":"text/html","content_length":"17982","record_id":"<urn:uuid:639bc50b-e6e1-435e-898a-87911e297288>","cc-path":"CC-MAIN-2024-46/segments/1730477395538.95/warc/CC-MAIN-20241114194152-20241114224152-00817.warc.gz"} |
Code 4 Tomorrow
The Basics
Backpropogation is the heart and soul of how Neural Networks train on data. At its core, it uses the loss from a neural network to update the weights and biases, thus “fitting” the model to the
training data.
What is Loss?
Loss is a measure of error for a neural network. The lowest that value can be is 0, indicating the neural network can correctly predict the output for any set of inputs, however, in practice, a loss
of 0 cannot be achieved through network training. As a rule of thumb, an acceptable loss is between 0 and ~1, although that value changes drastically depending on the use case. You can think of loss
as, generally, the opposite of your score on a test - in other words, how many questions you get wrong.
How is Loss Calculated?
Loss is a calculation based on how “wrong” the network is for a given piece of data. Just like with a test, the calculation method for loss changes based on the prediction type: for regression tasks,
where the network must predict an integer output, we use Mean Squared Error, whereas with classification tasks, akin to multiple choice, we use CrossEntropy. Because the mathematical basis of
CrossEntropy is beyond the scope of this course, we will focus on Mean Squared Error, but just remember that like Mean Squared Error, CrossEntropy also calculated the “incorrectness” of a neural
network’s prediction.
Mean Squared Error
Mean Squared Error calculates the difference between the predicted value and the actual value, like any regression loss function does. We can calculate it using the following formula:
In this equation, is the actual value from the data, is the predicted value, and is the number of data points. The fact that the difference is squared does 2 things: first, it turns the difference
positive and increases training speed. By making the difference positive, the model won’t worry about whether its output is smaller or greater than the actual value, which helps it reach the right
value faster. The model also trains faster because the difference is squared, meaning that a difference of 2 will yeild a loss of 4, for example, which forces the neural network to be perfect, rather
than close.
Optimization (Conceptual)
Because the mathematics behind backpropogation, part of a larger process called optimization, is beyond the scope of this course, we will instead focus on the concept of optimization. Optimization
begins with forward propogation, which is the process of an input being fed into the network, appling each nodes’ weights and baises, and ending with a singular output value, as explained in 3.1. The
next step is backpropogation, which does 2 things: first, it calculates the loss as explained above, and second, adjusts the weights and biases to “train” the model and lower the loss.
Although this video is a bit math-heavy, it provides a nice deep dive on optimization, both in math and in raw python.
Previous Section
1.2 Neural Network Architecture
Copyright © 2021 Code 4 Tomorrow. All rights reserved.
The code in this course is licensed under the
MIT License
If you would like to use content from any of our courses, you must obtain our explicit written permission and provide credit. Please contact classes@code4tomorrow.org for inquiries. | {"url":"https://www.code4tomorrow.org/courses/machine-learning/advanced/ch.-1-neural-networks/1.3-backpropagation","timestamp":"2024-11-02T17:11:48Z","content_type":"text/html","content_length":"79308","record_id":"<urn:uuid:b0dfe802-a7e5-4021-bcb2-02546bd742ea>","cc-path":"CC-MAIN-2024-46/segments/1730477027729.26/warc/CC-MAIN-20241102165015-20241102195015-00097.warc.gz"} |
[SNU Number Theory Seminar 31 Mar] Height gap theorem and almost law
• Date: 2023-03-28 14:00 ~ 15:00
• Place: 129-301 (SNU)
• Speaker: Homin Lee (Northwestern University)
• Title: Higher rank lattice actions with positive entropy
• Abstract:
We discuss about smooth actions on manifold by higher rank lattices. We mainly focus on lattices in SLnR (n is at least 3). Recently, Brown-Fisher-Hurtado and Brown-Rodriguez Hertz-Wang showed that
if the manifold has dimension at most (n-1), the action is either isometric or projective. Both cases, we don’t have chaotic dynamics from the action (zero entropy). We focus on the case when one
element of the action acts with positive topological entropy. These dynamical properties (positive entropy element) significantly constrains the action. Especially, we deduce that if there is a
smooth action with positive entropy element on a closed n-manifold by a lattice in SLnR (n is at least 3) then the lattice should be commensurable with SLnZ. This is the work in progress with Aaron
• Date: 2023-03-31 16:00 ~ 17:00
• Place: 27-325 (SNU)
• Speaker: Homin Lee (Northwestern University)
• Title: Height gap theorem and almost law
• Abstract:
E. Breuillard showed that finite subsets $F$ of matrices in $GL_{d}(\overline{Q})$ generating non-virtually solvable groups have normalized height $\widehat{h}(F) \ge \epsilon$, for some positive $\
epsilon>0$. This can be thought of as a non-abelian analog of Lehmer’s Mahler measure problem and has a nice application such as uniform Tits alternative. Recently, it also leads to the arithmetic
Margulis lemma by M.Fraczyk, S.Hurtado, and J. Raimbault. In this talk, we will discuss a relatively elementary proof of E.Breuillard's height gap theorem which avloids Bruhat-Tits geometry, and deep
results on algebraic tori that are used in the original E.Breuillard's proof. The key idea is a usage of a mysterious word map so-called "almost law". This is joint work with Lvzhou Chen (Joe Chen)
and Sebastian Hurtado. | {"url":"https://qsms.math.snu.ac.kr/index.php?mid=board_sjXR83&listStyle=viewer&order_type=desc&l=en&page=1&document_srl=2453","timestamp":"2024-11-07T12:42:54Z","content_type":"text/html","content_length":"22776","record_id":"<urn:uuid:493e06a3-2fe6-426f-aadf-a53d17bbaa4c>","cc-path":"CC-MAIN-2024-46/segments/1730477027999.92/warc/CC-MAIN-20241107114930-20241107144930-00277.warc.gz"} |
Mathterpieces: The Art of Problem-Solving
Maths Concepts
Australian Curriculum: Description
Foundation Year – Subitise small collections of objects (ACMNA003);
Year 1 – Represent and solve simple addition and subtraction problems using a range of strategies including counting on, partitioning, and rearranging parts (ACMNA015);
Year 2 – Describe, continue, and create number patterns resulting from performing addition or subtraction (ACMNA035).
Teaching ideas
Students investigate other situations involving subitising and counting on with and without distractors in routine and non-routine situations. Students could write the number sentences represented by
art in this book (representational to abstract).
Maths Concepts
Australian Curriculum: Description
This story is about a brother and sister who are asked to share all their food and drink; pizza, cupcakes, drink etc
Teaching ideas
(1) Read the story and describe what's going on in each picture; (2) vocabulary-half, whole, share, divide, divided equally; (3) gather materials (objects, quantities and collections) and discuss how
you would halve them; (4) draw pictures of objects in your classroom, and lines to show 'half'
Maths Concepts
Australian Curriculum: Description
This book explores counting up collections of items and objects. The book encourages seeing patterns to make the counting quicker than one-by-one.
Teaching ideas
(1) Prep students can count the objects in the collections within this book; (2) years 1-3 students can be encouraged to 'see the pattern' to help them partition to count up the objects in the
quantities quicker; (3) Final pages of the book show the answers using numbers and symbols as well as circles drawn around the collection, year 2s and 3s should be encouraged to set their work out
using numbers and symbols
Maths Concepts
Australian Curriculum: Description
The story of 5 animal friends who decide to take a boat trip. It all goes pear-shaped when the boat won’t hold all the weight. So, who sinks the boat?
Teaching ideas
Other investigations based on the book; would the order they got in the boat have effected the outcome? Place the animals in order of lightest to heaviest - test your prediction. How would a bigger
boat have effected the outcome?
Adam Spencer’s Mind-Boggling Maths, Outrageous Puzzles, Enormous Super-Cool Games Book of Numbers and heaps of other fun stuff!
Australian Curriculum: Description
Prep-Sort, describe and name familiar two-dimensional shapes and three-dimensional objects in the environment (ACMMG009); YR1-Recognise and classify familiar two-dimensional shapes and
three-dimensional objects using obvious features (ACMMG022); YR2-Describe the features of three-dimensional objects (ACMMG043); YR3-Identify symmetry in the environment (ACMMG066); YR4-Investigate
number sequences involving multiples of 3, 4, 6, 7, 8, and 9 (ACMNA074); YR5-Use efficient mental and written strategies and apply appropriate digital technologies to solve problems (ACMNA291);
YR6-Construct simple prisms and pyramids (ACMMG140); YR7-Draw different views of prisms and solids formed from combinations of prisms (ACMMG161); YR8-Solve a range of problems involving rates and
ratios, with and without digital technologies (ACMNA188); YR9-Express numbers in scientific notation (ACMNA210)
Teaching ideas
Real-world application in this book. Cross-curricular links are strong too, science, humanities, music, HPE etc
Maths Concepts
Australian Curriculum: Description
3-Tell time to the minute and investigate the relationship between units of time (ACMMG062); 4-Investigate equivalent fractions used in contexts (ACMNA077); 5-Choose appropriate units of measurement
for length, area, volume, capacity and mass; 6-Continue and create sequences involving whole numbers, fractions and decimals. Describe the rule used to create the sequence (ACMNA133)
Teaching ideas
There are lots of concepts explored in this book that could be extrapolated and explored further; (1) time, (2) timelines; (3) multistep problems; (4) conversions between units; (5) fractions; (6)
cross KLA references; (7) charts, (8) binary, (9) Fibonacci; (10) money
One is a Snail Ten is a Crab
Australian Curriculum Year Level
Year 4
Maths Concepts
Australian Curriculum: Description
Recall multiplication facts up to 10 × 10 and related division facts (ACMNA075)
Teaching ideas
Use other objects to represent multiplicative thinking
Matherpieces: The Art of Problem-Solving
Maths Concepts
Australian Curriculum: Description
Subitise small collections of objects (ACMNA003); Represent and solve simple addition and subtraction problems using a range of strategies including counting on, partitioning and rearranging parts
(ACMNA015); Describe, continue, and create number patterns resulting from performing addition or subtraction
Teaching ideas
Students investigate other situations involing subitising and counting on with and without distractors in routine and non-routine situations. Students could write the number sentences represented by
art in this book (representational to abstract).
Maths Concepts
Australian Curriculum: Description
Establish understanding of the language and processes of counting by naming numbers in sequences, initially to and from 20, moving from any starting point (ACMNA001); Connect number names, numerals
and quantities, including zero, initially up to 10 and then beyond (ACMNA002); Yr1-Recognise, model, read, write and order numbers to at least 100. Locate these numbers on a number line (ACMNA013);
Yr2-Recognise, model, represent and order numbers to at least 1000 (ACMNA027); Yr3-Recall multiplication facts of two, three, five and ten and related division facts (ACMNA056)
Teaching ideas
Explore adding numbers up to 10 then beyond and up to 900. Explore adding and multiplying by 0. Conduct some experiments with 'numberator' and 'multi-tube'.
Sold: A mothematics adventure
Australian Curriculum Year Level
Year 5
Maths Concepts
Australian Curriculum: Description
Create simple financial plans (ACMNA106)
Teaching ideas
Create basic financial plans. | {"url":"http://learningyou.com.au/recommended-books/strategy/part-part-whole/","timestamp":"2024-11-05T22:10:40Z","content_type":"application/xhtml+xml","content_length":"124815","record_id":"<urn:uuid:e7bcf32f-7485-4c04-9778-fed574054ff7>","cc-path":"CC-MAIN-2024-46/segments/1730477027895.64/warc/CC-MAIN-20241105212423-20241106002423-00205.warc.gz"} |
10 Tips for Writing Fast Mathematica Code—Wolfram Blog
10 Tips for Writing Fast Mathematica Code
When people tell me that Mathematica isn’t fast enough, I usually ask to see the offending code and often find that the problem isn’t a lack in Mathematica‘s performance, but sub-optimal use of
Mathematica. I thought I would share the list of things that I look for first when trying to optimize Mathematica code.
1. Use floating-point numbers if you can, and use them early.
Of the most common issues that I see when I review slow code is that the programmer has inadvertently asked Mathematica to do things more carefully than needed. Unnecessary use of exact arithmetic is
the most common case.
In most numerical software, there is no such thing as exact arithmetic. 1/3 is the same thing as 0.33333333333333. That difference can be pretty important when you hit nasty, numerically unstable
problems, but in the majority of tasks, floating-point numbers are good enough and, importantly, much faster. In Mathematica any number with a decimal point and less than 16 digits of input is
automatically treated as a machine float, so always use the decimal point if you want speed ahead of accuracy (e.g. enter a third as 1./3.). Here is a simple example where working with floating-point
numbers is nearly 50.6 times faster than doing the computation exactly and then converting the result to a decimal afterward. And in this case it gets the same result.
The same is true for symbolic computation. If you don’t care about the symbolic answer and are not worried about stability, then substitute numerical values as soon as you can. For example, solving
this polynomial symbolically before substituting the values in causes Mathematica to produce a five-page-long intermediate symbolic expression.
But do the substitution first, and Solve will use fast numerical methods.
When working with lists of data, be consistent in your use of reals. It only takes one exact value to cause the whole dataset to have to be held in a more flexible but less efficient form.
2. Learn about Compile…
The Compile function takes Mathematica code and allows you to pre-declare the types (real, complex, etc.) and structures (value, list, matrix, etc.) of input arguments. This takes away some of the
flexibility of the Mathematica language, but freed from having to worry about “What if the argument was symbolic?” and the like, Mathematica can optimize the program and create a byte code to run on
its own virtual machine. Not everything can be compiled, and very simple code might not benefit, but complex low-level numerical code can get a really big speedup.
Here is an example:
Using Compile instead of Function makes the execution over 80 times faster.
But we can go further by giving Compile some hints about the parallelizable nature of the code, getting an even better result.
On my dual-core machine I get a result 150 times faster than the original; the benefit would be even greater with more cores.
Be aware though that many Mathematica functions like Table, Plot, NIntegrate, and so on automatically compile their arguments, so you won’t see any improvement when passing them compiled versions of
your code.
2.5. …and use Compile to generate C code.
Furthermore, if your code is compilable, then you can also use the option CompilationTarget->“C” to generate C code, call your C compiler to compile it to a DLL, and link the DLL back into
Mathematica, all automatically. There is more overhead in the compilation stage, but the DLL runs directly on your CPU, not on the Mathematica virtual machine, so the results can be even faster.
3. Use built-in functions.
Mathematica has a lot of functions. More than the average person would care to sit down and learn in one go. So it is not surprising that I often see code where someone has implemented some operation
without having realized that Mathematica already knows how to do it. Not only is it a waste of time re-implementing work that is already done, but our guys are paid to worry about what the best
algorithms are for different kinds of input and how to implement them efficiently, so most built-in functions are really fast.
If you find something close-but-not-quite-right, then check the options and optional arguments; often they generalize functions to cover many specialized uses or abstracted applications.
Here is such an example. If I have a list of a million 2×2 matrices that I want to turn into a list of a million flat lists of 4 elements, the conceptually easiest way might be to Map the basic
Flatten operation down the list of them.
But Flatten knows how to do this whole task on its own when you specify that levels 2 and 3 of the data structure should be merged and level 1 be left alone. Specifying such details might be
comparatively fiddly, but staying within Flatten to do the whole flattening job turns out to be nearly 4 times faster than re-implementing that sub-feature yourself.
So remember—do a search in the Help menu before you implement anything.
4. Use Wolfram Workbench.
Mathematica can be quite forgiving of some kinds of programming mistakes—it will proceed happily in symbolic mode if you forget to initialize a variable at the right point and doesn’t care about
recursion or unexpected data types. That’s great when you just need to get a quick answer, but it will also let you get away with less than optimal solutions without realizing it.
Workbench helps in several ways. First it lets you debug and organize large code projects better, and having clean, organized code should make it easier to write good code. But the key feature in
this context is the profiler that lets you see which lines of code used up the time, and how many times they were called.
Take this example, a truly horrible way (computationally speaking) to implement Fibonacci numbers. If you didn’t think about the consequences of the double recursion, you might be surprised by the 22
seconds it takes to evaluate fib[35] (about the same time it takes the built-in function to calculate all 208,987,639 digits of Fibonacci[1000000000] [see tip 3]).
Running the code in the profiler reveals the reason. The main rule is invoked 9,227,464 times, and the fib[1] value is requested 18,454,929 times.
Being told what your code really does, rather than what you thought it would do, can be a real eye-opener.
5. Remember values that you will need in the future.
This is good programming advice in any language. The Mathematica construct that you will want to know is this:
It saves the result of calling f on any value, so that if it is called again on the same value, Mathematica will not need to work it out again. You are trading speed for memory here, so it isn’t
appropriate if your function is likely to be called for a huge number of values, but rarely the same ones twice. But if the possible input set is constrained, this can really help. Here it is
rescuing the program that I used to illustrate tip 3. Change the first rule to this:
And it becomes immeasurably fast, since fib[35] now only requires the main rule to be evaluated 33 times. Looking up previous results prevents the need to repeatedly recurse down to fib[1].
6. Parallelize.
An increasing number of Mathematica operations will automatically parallelize over local cores (most linear algebra, image processing, and statistics), and, as we have seen, so does Compile if
manually requested. But for other operations, or if you want to parallelize over remote hardware, you can use the built-in parallel programming constructs.
There is a collection of tools for this, but for very independent tasks, you can get quite a long way with just ParallelTable, ParallelMap, and ParallelTry. Each of these automatically takes care of
communication, worker management, and collection of results. There is some overhead for sending the task and retrieving the result, so there is a trade-off of time gained versus time lost. Your
Mathematica comes with four compute kernels, and you can scale up with gridMathematica if you have access to additional CPU power. Here, ParallelTable gives me double the performance, since it is
running on my dual-core machine. More CPUs would give a better speedup.
Anything that Mathematica can do, it can also do in parallel. For example, you could send a set of parallel tasks to remote hardware, each of which compiles and runs in C or on a GPU.
6.5. Think about CUDALink and OpenCLLink.
If you have GPU hardware, there are some really fast things you can do with massive parallelization. Unless one of the built-in CUDA-optimized functions happens to do what you want, you will need to
do a little work, but the CUDALink and OpenCLLink tools automate a lot of the messy details for you.
7. Use Sow and Reap to accumulate large amounts of data (not AppendTo).
Because of the flexibility of Mathematica data structures, AppendTo can’t assume that you will be appending a number, because you might equally append a document or a sound or an image. As a result,
AppendTo must create a fresh copy of all of the data, restructured to accommodate the appended information. This makes it progressively slower as the data accumulates. (And the construct data=Append
[data,value] is the same as AppendTo.)
Instead use Sow and Reap. Sow throws out the values that you want to accumulate, and Reap collects them and builds a data object once at the end. The following are equivalent:
8. Use Block or With rather than Module.
Block, With, and Module are all localization constructs with slightly different properties. In my experience, Block and Module are interchangeable in at least 95% of code that I write, but Block is
usually faster, and in some cases With (effectively Block with the variables in a read-only state) is faster still.
9. Go easy on pattern matching.
Pattern matching is great. It can make complicated tasks easy to program. But it isn’t always fast, especially the fuzzier patterns like BlankNullSequence (usually written as “___”), which can search
long and hard through your data for patterns that you, as a programmer, might already know will never be there. If execution speed matters, use tighter patterns, or none at all.
As an example, here is a rather neat way to implement a bubble sort in a single line of code using patterns:
Conceptually neat, but slow compared to this procedural approach that I was taught when I first learned programming:
Of course in this case you should use the built-in function (see tip 3), which will use better sorting algorithms than bubble sort.
10. Try doing things differently.
One of Mathematica‘s great strengths is that it can tackle the same problem in different ways. It allows you to program the way you think, as opposed to reconceptualizing the problem for the style of
the programming language. However, conceptual simplicity is not always the same as computational efficiency. Sometimes the easy-to-understand idea does more work than is necessary.
But another issue is that because special optimizations and smart algorithms are applied automatically in Mathematica, it is often hard to predict when something clever is going to happen. For
example, here are two ways of calculating factorial, but the second is over 10 times faster.
Why? You might guess that the Do loop is slow, or all those assignments to temp take time, or that there is something else “wrong” with the first implementation, but the real reason is probably quite
unexpected. Times knows a clever binary splitting trick that can be used when you have a large number of integer arguments. It is faster to recursively split the arguments into two smaller products,
(1*2*…*32767)*(32768*…*65536), rather than working through the arguments from first to last. It still has to do the same number of multiplications, but fewer of them involve very big integers, and
so, on average, are quicker to do. There are lots of such pieces of hidden magic in Mathematica, and more get added with each release.
Of course the best way here is to use the built-in function (tip 3 again):
Mathematica is capable of superb computational performance, and also superb robustness and accuracy, but not always both at the same time. I hope that these tips will help you to balance the
sometimes conflicting needs for rapid programming, rapid execution, and accurate results.
Download this post as a Computable Document Format (CDF) file.
All timings use a Windows 7 64-bit PC with 2.66 GHz Intel Core 2 Duo and 6 GB RAM.
Join the discussion
44 comments
1. Excellent tutorial on efficient programming…
2. “Here is a simple example where working with floating-point numbers is nearly 40 times faster than doing the computation exactly and then converting the result to a decimal afterward. And in this
case it gets the same result.”
Actually, it is 50.6 times faster.
3. “Using Compile instead of Function makes the execution over 10 times faster.”
Actually, it is over 80 times faster.
4. Great post! Thanks
5. @ C.F.Gauss. Well spotted. I would like to claim that I tinkered with the examples after I wrote the text, but it is possible that I just got the arithmetic wrong! I will have the article
corrected. Thanks.
6. The tips are awesome!!! Thanks dude ;-)
7. Very useful hints! I don’t use Sow and Reap nearly enough and I probably use a lot of pattern matching unnecessarily. The Flatten hint is going to save me tons of time since my first thought was
to use Flatten/@data which I assume is exactly the same as Map[Flatten,data]. A question: are there faster ways to reference parts of lists than, say list[[All,2]] (or Transpose[list][[2]]) to
get the second column of a matrix? Also, I do a lot of operations that involve Select[list,(fn[#]&)] – your Times example made me wonder if there aren’t more efficient ways to select sub-parts of
lists according to given criteria?
8. 10. (Real, tip 2.5 tipped it over) great tips. I like how tip 9. and 10. complement each other when to use tried and true versus new style.
9. Very useful information presented in an elegant and compact way. I was wondering if the Compile function can speedup expressions involving special functions as well e.g. Euler gamma function,
Gamma[z], generalized hypergeometric function, HypergeometricPFQ.
Once again great post.
10. Lots of useful tricks to know. But compare to other languages in case of Mathematica is much harder to figure out how to speed up things. For example “Compile”. Is there anyone who knows exactly
what can (or should) be compiled and what is not worth thinking about. I have not found any clue in the help system… And this text taken from above “Be aware though that many Mathematica
functions like Table, Plot, NIntegrate, and so…” does not help much.
11. Thank you for this very useful post !
Tip 10 is in some way a bit worrying though: in short, try a different way, who knows if it might not be faster for some obscure reason :-) (or to cite your text : “it is often hard to predict
when something clever is going to happen”)
12. One point to consider is the “first time” problem. For example, your first example calculating determinants…the first time I ran it in the order you did, and got timings of 2.3 and 0.04 seconds.
Then I quite Mathematica and reopened the file, running the second one first. There was still a time savings, but running the floating point version first took 0.23 seconds, and the integers took
0.90 seconds. In other words, some of the time savings comes simply from having run the routine before. This is especially clear with the Solve program, which actually took longer to run with
floating point numbers than integers — *if* Solve had not yet been run.
13. I’d be wary when considering Tip 8 (use Block over Module). For short work, that’s probably fine, but for large projects with lots of interacting functions, it can be dangerous.
Module does lexical scoping;
Block does dynamic scoping;
McCloone of course is well aware, but readers may want to look at:
(scroll right down to the Example heading:
This example compares the consequences of using static scope and dynamic scope. )
14. 1/3 is the same thing as 0.33333333333333
15. Great Article!
Another useful tip is to avoid using Rule expressions for storage when you don’t need them. Compare
Timing[Table[RandomReal[] -> RandomReal[], {10^6}];]
Timing[Table[{RandomReal[], RandomReal[]}, {10^6}];]
16. Also, avoid the built-in date functions wherever possible. They’re two orders of magnitude slower than the date functions in other interpreted languages, and three orders of magnitude slower than
the date functions in compiled languages. Never put a date function inside a loop if you can possibly avoid it.
17. @ Peter Aronssen – This is directly related to tip 1. Using Rule makes this a partly symbolic expression. Pure numeric arrays are faster. However, your example is faster still if you do
RandomReal[1, {10^6, 2}]
Another example of tip 3!
18. Great compilation! A few comments though.
The Reap/Sow example should probably use [[2,1]] instead of[[2]] to keep the format of data consistent Dimensions@data should be {40001}, not {1,40001}. The reason Reap/Sow is so efficient is
because M is generally very good with managing deeply nested expressions, as can be seen with
which doesn’t use Reap/Sow at all, but deep nesting and gives the same output and timing result.
I think the tip about the WB is very weak. The WB has MUCH more applicability and utility than just the profiler. And the example presented is really an example of VERY bad coding. Nobody should
program it like that, as is shown in the following tip. Apart from the profiler one could mention syntax highlighting that that M f/e doesn’t provide, and better leveraging with Java and writing/
debugging combined M/Java programs. And the text “To illustrate tip 3” should probably read “to illustrate tip 4”?
And, there are good reasons to write some numerical code in Java or C#, so using JLink and NETLink are additional ways to gain speed in M. With 3 lines of code an external Java or .Net or COM
library is loaded. Easy “switch-over” to Java and .Net is another very important M feature!
19. Hi,
Thank you for your nice information 10 Tips for Writing Fast Mathematica Code. I like it.
20. Great list, I’d like to add one essential part: Learn about PackedArrays. Use On[“Packing”] and Off[“Packing”] to find out when M- unpacks data.
21. Hi,
thanks for the tips. Just a short question on No. 1: Does anybody know why
Det[Table[1./(1. + Abs[i – j]), {i, 1., 150.}, {j, 1.,150.}]] // AbsoluteTiming
runs so much faster than
a = 150.;
Det[Table[1./(1. + Abs[i – j]), {i, 1., 150.}, {j, 1., a}]] // AbsoluteTiming
? On my macbook the first command needs roughly 0.005s, while the second needs 10x longer, i.e. 0.05s (both after a kernel reset). The same decrease occurs by using Table[Table[,..],…] instead of
thanks, markus
22. @ Markus
I suspect that this is because Table automatically calls Compile when called with numeric arguments, but because it has the Attributes HoldAll, it is not recognizing, until too late that you ARE
calling it with numeric arguments. Using With speeds things up here…
With[{a = 150.}, Det[Table[ 1./(1. + Abs[i – j]), {i, 1., 150.}, {j, 1., a}]]] // AbsoluteTiming
The “trick” of using With[{a=a},…] works here too.
23. A great post.
Are there any optimisation techniques available for graphs? (now that Mathematica 8’s graphs are treated as “raw objects”)?
24. The same is true for symbolic computation. If you don’t care about the symbolic answer and are not worried about stability …
??? I generally look to Mathematica when I want symbolic answers and/or stability. Are you suggesting that Mathematica is not for pure mathematicians any more ?
25. @ Andrew
I don’t think think that Mathematica was ever just for mathematicians. Back in the early 90’s we did a survey of users and found around 5% described themselves as such. Most customers that I
visit seem to be engineers, scientists or (probably because I am based near London) in finance.
Take a look at
for a list some of the most popular areas of application.
26. very helpful, thanks.
27. It’s good to get some tips based on what’s “under the hood” of Mathematica rather than just relying on general principles of efficient numeric programming. On a related note, I’d like to see more
CUDA-optimized functions in Mathematica. I was quite impressed with the speed improvements using CUDA. Perhaps a Method->”CUDA” option?
28. In the procedural approach in Tip 9,
Is there any reason to use “While[TrueQ[flag],…]”
instead of simply “While[flag,…]” ?
□ As the code stands, it is of no value at all. I had in mind not bothering to initialize the flag. But the flag logic has to be the other way round to do that…
(While[! TrueQ[stopFlag],
stopFlag = True;
data[[i]] > data[[i + 1]],
temp = data[[i]];
data[[i]] = data[[i + 1]];
data[[i + 1]] = temp;
stopFlag = False], {i, 1, Length[data] – 1}]];
I forgot to remove the TrueQ after I added the initial value line.
Given that this is about efficiency, then it would it would be very slightly faster to do it they way I published without the TrueQ. Since this version will repeatedly have to evaluate both
TrueQ and Not. Both fast functions but not necessary.
29. Really great tips. I like especially the info about Reap & Sow.
Only a pity that Compile does not support Reap and Sow. Compile`CompilerFunctions[] gives a list of the supported functions.
So I can use either the slow Append and then compile it or the fast Reap and then compiling is impossible :-(
30. Thanks Jon. Programming some sampling functions today, I thought up another useful exhortation:
“don’t map a function that threads.”
Try the following command:
AbsoluteTiming[Times[1, #] & /@ Range[10000];][[1]]/
AbsoluteTiming[Times[1, Range[10000]];][[1]]
31. I guess your comparison for the Tip 4 is sligthly misleading. I definitely agree that double recursion should always handled carefully. However, I am pretty confident that the built-in
implementation of the Fibonnaci numbers is not based on a recurrence but rather on the closed-form expression involving the golden ratio.
So comparing a double recurrence with a closed form is like comparing apples and oranges. Even your implementation from Tip 5 involving memoization can’t beat the closed-form !
□ The point of tip 3 is not just that build in functions might be coded more carefully, but that they might use completely different approaches, such as closed forms. As a user, I can’t expect
to know about all such methods, which is why it is a safe bet that I should use the built in function, when it exists, for anything that I am not an expert in, or are willing to spend time
researching. Perhaps it confused the point of tip 5 to mention it again there, but after tip 1, it is the most widely useful, so I felt like repeating it as much as possible.
32. Hey, I think your blog might be having browser compatibility issues.
When I look at your blog in Opera, it looks fine but when opening
in Internet Explorer, it has some overlapping.
I just wanted to give you a quick heads up! Other
then that, excellent blog!
□ Hello Visual Impact,
Where exactly did you see the problem? And what version of IE? We had a developer test it on IE 11 and 8 (PC), but couldn’t find any issues. If you could give us more details we would be
happy to look into this more closely.
33. Great page. Just implementing the floating point suggestion speeded up a small program from an annoying and time wasting several seconds to .05 seconds.
I noticed that ParallelTable does not accept a function that calls ParallelTable. Not hard to see why.
34. This article is very helpful speeding up my Mathematica code. Thank you.
35. Hello, I think your blog might be having browser compatibility issues. When I look at your blog site in Safari, it looks fine but when opening in Internet Explorer, it has some overlapping. I
just wanted to give you a quick heads up! Other then that, excellent blog!
36. As a newbie Mathematica user this article was very helpful! Thank you.
37. So why can I only do about 800 geodistance calculations per second but my compiled Vincenty copied from Wikipedia will do 80,000/sec?
I think filenames over the network is still 30 x slower since somewhere around version 11….
□ The algorithms in GeoDistance are a lot more precise than Vicenty’s algorithm, which can fail by much in some cases (for example in near-antipodal cases). GeoDistance effectively solves a
shooting ODE per computation.
As I mentioned in this blog, speed also depends on the way things are done. For example this performs 10^5 GeoDistance computations in 0.3 seconds:
In[28]:= points = GeoPosition[RandomReal[{-90, 90}, {10^5, 2}]];
In[29]:= GeoDistance[points, Here]; // AbsoluteTiming
Out[29]= {0.296927, Null}
because data is packed, and the computation is performed in a single evaluator call. If we map over the list of points, then there are 10^5 independent computations, that need to handle
Quantity units independently, results are not packed, etc, and then the computation is 200 times slower:
In[36]:= GeoDistance[#, Here] & /@ Thread[points]; // AbsoluteTiming
Out[36]= {51.9647, Null}
38. @ Peter Aronssen – A great post.
This is directly related to tip 1. Using Rule makes this a partly symbolic expression. Pure numeric arrays are faster. However, your example is faster still if you do
RandomReal[1, {10^6, 2}]
Another example of tip 3!
39. This is always my go-to blog post when I get a new machine.
On Apple silicon (2023 Macbook Pro M2) the first example provided seemingly suggests some deficiency in the ARM-implementation for linear algebra (missing Intel library functionality for linear
algebra, perhaps?).
1/(1 + Abs[i – j]), {i, 1, 150}, {j, 1, 150}]]] // AbsoluteTiming
{262.840256, 9.30310687*10^-21}
As soon as the matrix size in the example moves from 128×128 to 129×129, there is a serious performance degradation (almost three minutes!). This is using Mathematica Version 13.3.0 on ARM64. The
same degradation doesn’t happen on an Intel machine running the same version (or in the cloud). | {"url":"https://blog.wolfram.com/2011/12/07/10-tips-for-writing-fast-mathematica-code/","timestamp":"2024-11-03T22:03:40Z","content_type":"text/html","content_length":"185163","record_id":"<urn:uuid:dfffc9f1-6ce6-4ff5-b440-2e6769751ff9>","cc-path":"CC-MAIN-2024-46/segments/1730477027796.35/warc/CC-MAIN-20241103212031-20241104002031-00831.warc.gz"} |
Book Review: The God Equation by Dr. Michio Kaku | TechieTonics
Book Review: The God Equation by Dr. Michio Kaku
Dr. Michio Kaku is a well-known figure in science academia. He is a master story teller. His super power is, he can make science graspable for non-science people like myself. In The God Equation: The
Quest for a Theory of Everything, Dr. Kaku talks about three things:
1. physics from creation to present,
2. the effort put behind in unifying all known physical forces and
3. the theory of dimensions, string theory.
Every physicist dream of unifying the four fundamental forces of nature, that is, Gravity, the weak force (responsible for radioactive decay of some nuclei), electromagnetism, and the strong force
(binding the atomic nucleus together). These forces govern everything that happens in the universe. Albert Einstein was the first who thought of joining these forces but couldn’t.
Classical physics
Newton was the one who achieved the task of unifying the forces of the heavens with the terrestrial through his celebrated theory of gravity. According to his idea, gravity is an attraction between
objects. And objects get tired too, so they stop moving in space after covering certain distance. Newton’s laws helped to usher in the first revolution in technology.
Followed by the age of electricity and magnetism. The two phenomena happen to be the two sides of the same coin. It started with Faraday and from there it culminated in Maxwell’s equation. Like
Kepler and Galileo paved way for Newtonian physics, Faraday paved way for Maxwell. Subsequently, the researchers uncovered the two nuclear forces – the weak force and the strong force. Eventually,
physicists decided to combine all of them into ever-grander theories and still pursuing.
The emergence of one of the four forces of nature have not only made us understand nature more closely, it has also radically revolutionized society towards the next higher technological advancement.
For instance, steam engine was the product of Industrial Revolution that came about because of Newton’s laws. Electrical age was the result of Faraday’s discovery of electric and magnetic fields.
Edison and Tesla were able to “electrify” the life today because Faraday had laid the foundations already.
The age of quantum physics
When some physicists thought they know enough and nothing lies beyond atoms and electrons, quantum physics proved them otherwise. There were observations which could not be resolved with classical
physics, like black-body radiation problem and photoelectric effect.
Black-body radiation refers to visible or even ultraviolet light emitted by objects when they are hot. When physicists tried to calculate the effect by applying Newton’s and Maxwell’s law, they faced
a problem. At low frequencies, the model fit well but things look bizarre when the same model is applied to high frequency. Infinity has always been a sign of equations not working properly. Max
Planck then proposed that energy is not continuous – as postulated by Newton – but comes in discrete packets called quanta. When using this model, they were able to reproduce precisely the energy
radiated from hot objects.
Photoelectric effect refers to the expulsion of electrons from a metal plate when light falls on it. As per conventional electromagnetism, constant light waves (falling on a metal plate) will
transfer energy to electrons, which would then be emitted when they accumulate enough energy. The experimental results, however, showed that electrons displaced only when the light surpasses a
certain frequency. Light’s intensity and duration of exposure has nothing to do with it.
The attempts to solve these microscopic phenomena led to the development of quantum mechanics in the mid-1920s. Quantum ideas and understanding took physics towards the new destination and that led
to quantum revolution. Transistors and lasers became the new norm in the field of electronics and computers.
Quantum electrodynamics and quantum chromodynamics
At the same time, physicists kept working towards grand unified theory. Unification is not new in physics. In 1832, Faraday was the first to propose a unification of gravity and electromagnetism with
his famous experiment that involved dropping magnets from London’s Waterloo Bridge. Although he was not able to produce any quantifiable effect of gravity, he was convinced that there could be some
effect at micro scale, which is not traceable.
In 1942, one of the pioneers of quantum mechanics, Erwin Schrödinger announced that he has the answer for the grand unified theory but failed to account the nature of electrons and atoms. Werner
Heisenberg and Wolfgang Pauli tried but failed as well.
Dr. Kaku exclaimed that quantum electrodynamics (QED), looked promising as it offered quantum theory of electrons and light. It had the answer for weak nuclear force and quantum chromodynamics (QCD)
had the best description for strong nuclear force.
This resulted in mapping of all the current subatomic particles under the Standard Model. However, Dr. Kaku explains that according to Fermi National Laboratory there could be an existence of
potential discovery that means additional force of nature, which if surfaces can stretch more from the currently accepted Standard Model.
Drawbacks in Standard Model
Although it depicts the best understanding of subatomic world and bringing us to a “theory of almost everything”, it has a few drawbacks, such as
• there is no gravity
• quantum corrections (instead of being small) turn out to be infinite.
Therefore, the standard model failed to shed light on:
• what happened before the big bang?
• what is inside black hole?
Quantum theory to Big Bang
All these developments have led to a new trajectory in physics. The aim of unification is now to go back in time. At the beginning of time, there could be one super force, (the original). That force
became unstable and symmetry began to break, which of course led to the Big Bang and consequently, time.
The next revolution in cosmology took place when physicist started to apply quantum theory to Big Bang. That is, the original fireball must have been a quantum blackbody radiator. If the universe
started off as superhot explosion, some of the heat might have survive today. And it is possible to calculate the radiation after the glow.
Dr. Kaku here, touches upon the radical insight of Stephen Hawking, which is, to apply quantum mechanics to the object that has unprecedented gravity, Black Holes! Thus, combining both Einstein’s
theory of relativity (which describes how gravity works at grand scales) and quantum mechanics (which describes how the very smallest components of the universe work). As per Hawking, black hole must
emit thermal radiation quite similar to blackbody radiation. This implies, black holes would eventually evaporate and even explode.
So, the next obvious questions come into mind are:
• What is inside a black hole?
• Are wormholes real?
• Is time travel possible?
String theory
String theory fits perfectly well here to answer these questions. It is a single theory that describes all forces in nature. According to this theory, everything, that is matter, is a filament of
energy at the elemental level. And particles that we know today is the result of vibration in that filament of energy. Each vibrate in different patterns thus forming various particles such as
electrons, quarks, neutrinos, photons etc.
With string theory, universe can be explained in terms of filaments that vibrate in 10-11 dimensions. Testability of which is beyond our physical reality.
However, Dr Kaku’s enthusiasm is not diminished in fact, it is contagious still. He feels that the next generation of particle accelerators or particle detectors or gravity wave detectors will find
experimental proof of string theory. If not, then some young experimental physicist will have the vision to find the mathematical formula of the theory of everything.
Dr. Kaku can make anyone fall in love with science. His work, “The God’s Equation” is indeed a master piece. A book that talks about the greatest quest of understanding the universe from the point of
view of a renowned theoretical physicist. This book can also be called as, physics for the ordinary people. Highly recommend. | {"url":"https://techietonics.com/thinking-turf/book-review-the-god-equation-by-dr-michio-kaku.html","timestamp":"2024-11-05T08:50:26Z","content_type":"text/html","content_length":"104560","record_id":"<urn:uuid:8b0aed57-a87d-4def-9755-08e7849d0e29>","cc-path":"CC-MAIN-2024-46/segments/1730477027878.78/warc/CC-MAIN-20241105083140-20241105113140-00730.warc.gz"} |
MatrixSymbol simplifications
376 Views
6 Replies
8 Total Likes
MatrixSymbol simplifications
I'm exploring the new 14.1 MatrixSymbol functionality, hoping to eventually simplify complex and lengthy matrix expressions. But I'm running into limitations even with simple expressions. For
A = MatrixSymbol["A", {n, n}];
FullSimplify[A + Transpose[A], Assumptions -> A == Transpose[A]]
Out[18]= 2 Transpose[(MatrixSymbol["A", {n, n}])]
(** OK !! **)
FullSimplify[A - Transpose[A], Assumptions -> A == Transpose[A]]
Out[19]= 0
(** should we not see O_n,n ? **)
FullSimplify[Inverse[A] . Transpose[A], Assumptions -> A == Transpose[A]]
Out[20]= Inverse[(MatrixSymbol[
"A", {n, n}])] . Transpose[(MatrixSymbol["A", {n, n}])]
(**I was hoping to see an identity matrix **)
What am I missing?
6 Replies
I think you have two main alternatives:
1) Use a MatrixSymbol object with explicit symmetry in its two levels:
In[1]:= A = MatrixSymbol["A", {n, n}, Symmetric[{1, 2}]]
In[2]:= A + Transpose[A] // TensorReduce
Out[2]= 2 MatrixSymbol["A", {n, n}, Complexes, Symmetric[{1, 2}]]
In[3]:= A - Transpose[A] // TensorReduce
Out[3]= SymbolicZerosArray[{n, n}]
In[4]:= Inverse[A] . Transpose[A] // TensorReduce
Out[4]= MatrixPower[MatrixSymbol["A", {n, n}, Complexes, Symmetric[{1, 2}]], 0]
2) or declare assumptions for a symbol B (I use a separate symbol here to avoid Element resolving to True immediately):
In[5]:= $Assumptions = Element[B, Arrays[{n, n}, Symmetric[{1, 2}]]];
In[6]:= B + Transpose[B] // TensorReduce
Out[6]= 2 B
In[7]:= B - Transpose[B] // TensorReduce
Out[7]= SymbolicZerosArray[{n, n}]
In[8]:= Inverse[B] . Transpose[B] // TensorReduce
Out[8]= MatrixPower[B, 0]
Though correct, MatrixPower[squarematrix, 0] should be converted into IdentityMatrix[n].
Thanks Jose -- this is very helpful. A follow-up question, extending the above... Would it be possible using Mathematica 14.1 capabilities to automatically carry out the calculation on the 4th line
below, eliminating b, y, A, and Inv[A] in favor of x and c? Here A is an n x n matrix, b, c, x and y are n-vectors. It seems that to do this one needs (Full)Simplify/Eliminate/Reduce type commands
that work directly on matrices. Thanks!
I think this type of computation requires guidance, mainly to specify what needs to be replaced by what. For example, I'd do something like this:
$Assumptions = {
Element[A, Matrices[{n, n}, Symmetric[{1, 2}]]],
Element[x | y | b | c, Vectors[{n}]]
rules = {
x -> Inverse[A] . b,
y -> Inverse[A] . c
In[3]:= b . y == c . x /. rules // TensorReduce
Out[3]= True
Note that the traditional notation that transposes the vector u on the LHS of a two-vector inner product uT . v can be represented more easily in WL as Dot[u, v].
Thanks Jose, I appreciate it. While this is very useful, the fact that I need to know the result before verifying it is a limiting factor.
I think it would be great if the WL (Full)Simplify and Eliminate commands could be extended to transform matrix statements. Perhaps LLMs can help? Just for the heck, I entered the following prompt in
Prompt: Consider an nxn matrix A, and n-vectors b, c, x and y. Assume that A.x = b, A.y = c, and Transpose(A) = A. Develop an alternative expression for Transpose[b].y that does not involve b or y,
and is as simple as possible, avoiding A if at all possible. *** Response: Let's approach this step-by-step:
We're given that A.x = b This means b = A.x We're also given that A.y = c This means y = A^(-1).c (assuming A is invertible) We're told that Transpose(A) = A This means A is symmetric We need to find
an expression for Transpose[b].y Let's start with Transpose[b].y: Transpose[b].y = (A.x)^T.y (substituting from step 1) = x^T.A^T.y (property of matrix transpose) = x^T.A.y (because A is symmetric) =
x^T.c (substituting from step 2)
Therefore, Transpose[b].y = x^T.c
Perhaps WL can call an LLM under the hood to produce candidate results that next are (automatically) verified using the 14.1 approach you described?
Thank you for your suggestions. Simplification of symbolic array expressions is currently being greatly improved for version WL 14.2. We will explore the type of computation you propose.
Somehow from
FullSimplify[A + Transpose[A], Assumptions -> A == Transpose[A]]
I would expect
2 MatrixSymbol["A", {n, n}]
which is simpler than
2 Transpose[(MatrixSymbol["A", {n, n}])]
Be respectful. Review our Community Guidelines to understand your role and responsibilities. Community Terms of Use | {"url":"https://community.wolfram.com/groups/-/m/t/3288833","timestamp":"2024-11-09T17:04:42Z","content_type":"text/html","content_length":"122913","record_id":"<urn:uuid:7f674cee-4cc3-4124-a393-4a6c358b015a>","cc-path":"CC-MAIN-2024-46/segments/1730477028125.59/warc/CC-MAIN-20241109151915-20241109181915-00192.warc.gz"} |