Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Concept Videos

Punnett Squares01:00

Punnett Squares

125.3K
Overview
125.3K
Root Mean Square00:57

Root Mean Square

3.8K
If in an experiment, data values have a probability of being both positive and negative, neither the arithmetic mean, the geometric mean, nor the harmonic mean can be used to calculate the central tendency of the data set. In particular, if the positive and negative values are equally likely, the arithmetic mean is close to zero.
For example, consider the velocity of gas molecules in a container. The gas molecules are moving in different directions, which might impart positive and negative...
3.8K
Chi-square Analysis02:46

Chi-square Analysis

43.9K
The chi-square test is a statistical hypothesis test. It is used to check whether there is a significant difference between an expected value and an observed value. In the context of genetics, it enables us to either accept or reject a hypothesis, based on how much the observed values deviate from the expected values.
The chi-square test was developed by Pearson in 1990.
The first step of performing a Chi-square analysis is to establish a null hypothesis, which assumes that there is no real...
43.9K
Chi-square Distribution01:10

Chi-square Distribution

6.8K
How does one determine if bingo numbers are evenly distributed or if some numbers occurred with a greater frequency? Or if the types of movies people preferred were different across different age groups or if a coffee machine dispensed approximately the same amount of coffee each time. These questions can be addressed by conducting a hypothesis test. One distribution that can be used to find answers to such questions is known as the chi-square distribution. The chi-square distribution has...
6.8K
Residuals and Least-Squares Property01:11

Residuals and Least-Squares Property

9.4K
The vertical distance between the actual value of y and the estimated value of y. In other words, it measures the vertical distance between the actual data point and the predicted point on the line
If the observed data point lies above the line, the residual is positive, and the line underestimates the actual data value for y. If the observed data point lies below the line, the residual is negative, and the line overestimates the actual data value for y.
The process of fitting the best-fit...
9.4K
Calibration Curves: Linear Least Squares01:20

Calibration Curves: Linear Least Squares

4.4K
A calibration curve is a plot of the instrument's response against a series of known concentrations of a substance. This curve is used to set the instrument response levels, using the substance and its concentrations as standards. Alternatively, or additionally, an equation is fitted to the calibration curve plot and subsequently used to calculate the unknown concentrations of other samples reliably.
For data that follow a straight line, the standard method for fitting is the linear...
4.4K

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

The Born Rule-100 Years Ago and Today.

Entropy (Basel, Switzerland)·2025
Same author

A new limited memory method for unconstrained nonlinear least squares.

Soft computing·2022
Same author

Improved interval methods for solving circle packing problems in the unit square.

Journal of global optimization : an international journal dealing with theoretical and computational aspects of seeking global optima and their applications in science, management and engineering·2021
Same author

Computing the noncentral-<i>F</i> distribution and the power of the <i>F</i>-test with guaranteed accuracy.

Computational statistics·2020
Same author

A manifold-based approach to sparse global constraint satisfaction problems.

Journal of global optimization : an international journal dealing with theoretical and computational aspects of seeking global optima and their applications in science, management and engineering·2019
Same author

Bounding basis reduction properties.

Designs, codes, and cryptography·2019
Same journal

Minimum flow decomposition in graphs with cycles using integer linear programming.

Journal of global optimization : an international journal dealing with theoretical and computational aspects of seeking global optima and their applications in science, management and engineering·2025
Same journal

Tropical gradient descent.

Journal of global optimization : an international journal dealing with theoretical and computational aspects of seeking global optima and their applications in science, management and engineering·2025
Same journal

A new mathematical approach for handling DVH criteria in IMRT planning.

Journal of global optimization : an international journal dealing with theoretical and computational aspects of seeking global optima and their applications in science, management and engineering·2023
Same journal

Exchange rates and multicommodity international trade: insights from spatial price equilibrium modeling with policy instruments via variational inequalities.

Journal of global optimization : an international journal dealing with theoretical and computational aspects of seeking global optima and their applications in science, management and engineering·2023
Same journal

A three-stage stochastic optimization model integrating 5G technology and UAVs for disaster management.

Journal of global optimization : an international journal dealing with theoretical and computational aspects of seeking global optima and their applications in science, management and engineering·2023
Same journal

Distributionally robust mean-absolute deviation portfolio optimization using wasserstein metric.

Journal of global optimization : an international journal dealing with theoretical and computational aspects of seeking global optima and their applications in science, management and engineering·2022
See all related articles

Related Experiment Video

Updated: Jan 27, 2026

Protocol for Isolating the Mouse Circle of Willis
06:30

Protocol for Isolating the Mouse Circle of Willis

Published on: October 22, 2016

13.6K

Rigorous packing of unit squares into a circle.

Tiago Montanher1,2, Arnold Neumaier2, Mihály Csaba Markót1,2

  • 11Wolfgang Pauli Institute, Oskar-Morgenstern-Platz 1, 1090 Vienna, Austria.

Journal of Global Optimization : an International Journal Dealing with Theoretical and Computational Aspects of Seeking Global Optima and Their Applications in Science, Management and Engineering
|March 19, 2019
PubMed
Summary
This summary is machine-generated.

Researchers found the optimal way to pack three rotating unit squares into the smallest circle. This computer-assisted method, using interval arithmetic, solves a complex geometric packing problem previously limited to two squares.

Keywords:
Computer-assisted proofInterval branch-and-boundSquare packing into a circleTiling constraints

More Related Videos

Simultaneous Quantification of T-Cell Receptor Excision Circles TRECs and K-Deleting Recombination Excision Circles KRECs by Real-time PCR
14:14

Simultaneous Quantification of T-Cell Receptor Excision Circles TRECs and K-Deleting Recombination Excision Circles KRECs by Real-time PCR

Published on: December 6, 2014

17.3K
CMAP Scan MUNE MScan - A Novel Motor Unit Number Estimation MUNE Method
08:25

CMAP Scan MUNE MScan - A Novel Motor Unit Number Estimation MUNE Method

Published on: June 7, 2018

12.9K

Related Experiment Videos

Last Updated: Jan 27, 2026

Protocol for Isolating the Mouse Circle of Willis
06:30

Protocol for Isolating the Mouse Circle of Willis

Published on: October 22, 2016

13.6K
Simultaneous Quantification of T-Cell Receptor Excision Circles TRECs and K-Deleting Recombination Excision Circles KRECs by Real-time PCR
14:14

Simultaneous Quantification of T-Cell Receptor Excision Circles TRECs and K-Deleting Recombination Excision Circles KRECs by Real-time PCR

Published on: December 6, 2014

17.3K
CMAP Scan MUNE MScan - A Novel Motor Unit Number Estimation MUNE Method
08:25

CMAP Scan MUNE MScan - A Novel Motor Unit Number Estimation MUNE Method

Published on: June 7, 2018

12.9K

Area of Science:

  • Computational Geometry
  • Optimization Problems
  • Applied Mathematics

Background:

  • Packing problems involve fitting shapes into a container.
  • Rotating unit squares in a circle is complex due to orientation freedom.
  • Previous optimal solutions were only proven for packing one or two squares.

Purpose of the Study:

  • To determine the smallest circle capable of containing three non-overlapping, rotatable unit squares.
  • To develop a rigorous method for solving complex packing problems with rotational freedom.
  • To establish optimal arrangements for packing three unit squares.

Main Methods:

  • Modeling the packing problem as a constraint satisfaction problem (CSP).
  • Employing computer-assisted methods with interval arithmetic techniques.
  • Decomposing the CSP into subproblems by constraining square centers to overcome computational complexity.

Main Results:

  • Rigorous enclosures for all optimal arrangements of three unit squares in a circle were found.
  • The method successfully solved the packing problem for three squares, extending previous results.
  • The approach required solving 6, 43, and 12 subproblems for 1, 2, and 3 squares, respectively.

Conclusions:

  • The developed interval arithmetic-based method provides a generalizable solution for packing any number of rotating unit squares into the smallest circle.
  • This study advances the understanding of optimal packing configurations for rotatable objects.
  • The computer-assisted approach offers a robust way to solve complex geometric optimization problems.