The document discusses using the GeoGebra mathematical software package in mathematics teaching. It presents 14 propositions about ellipses, hyperbolas, and parabolas. Students used GeoGebra's interactive features to construct the curves as loci of points and solve problems of varying complexity based on the propositions. This reinforced their understanding of concepts from the "Second-Order Curves" course material from sources like textbooks and papers.
METRIC DIMENSION AND UNCERTAINTY OF TRAVERSING ROBOTS IN A NETWORKgraphhoc
Metric dimension in graph theory has many applications in the real world. It has been applied to the
optimization problems in complex networks, analyzing electrical networks; show the business relations,
robotics, control of production processes etc. This paper studies the metric dimension of graphs with
respect to contraction and its bijection between them. Also an algorithm to avoid the overlapping between
the robots in a network is introduced.
This document provides an overview of Chapter 3 from the textbook "Introductory Mathematical Analysis" which covers topics related to lines, parabolas, and systems of equations. The chapter objectives are to develop concepts of slope, demand/supply curves, quadratic functions, and solving systems of linear and nonlinear equations. Examples are provided for finding equations of lines from points, graphing linear and quadratic functions, and applying systems of equations to equilibrium points and break-even analysis. Key concepts explained include slope, forms of linear equations, parallel/perpendicular lines, demand/supply curves, and solving systems using elimination or substitution.
This document defines and provides examples of various graph concepts from discrete mathematics including:
- Complete graphs, cycle graphs, wheel graphs, and hypercubes as special types of simple graphs
- Bipartite graphs and complete bipartite graphs
- Subgraphs and unions of graphs
- Representing graphs using adjacency lists and matrices
- Graph isomorphism
It includes over 20 examples applying these graph concepts and definitions.
Iaetsd an enhanced circular detection technique rpsw using circular hough t...Iaetsd Iaetsd
This document proposes a new technique for detecting circular features in satellite images that combines Rotational Pixel Swapping (RPSW) and Circular Hough Transform. RPSW enhances circular patterns by multiplying the original image with rotated versions. Circular Hough Transform then identifies the center and radius of circles. Applying both allows detecting simple and complex circles while finding the area, improving on existing methods. RPSW alone only identifies circle centers, so the addition of Circular Hough Transform provides radius and area information. The combined approach accurately detects circular features from planetary images.
The document discusses morphological image operations and mathematical morphology. It provides examples of basic morphological operations like dilation, erosion, opening and closing. It also discusses morphological algorithms for tasks like boundary extraction, region filling, connected component extraction, skeletonization, and using morphological operations for applications like detecting foreign objects. The key concepts covered are binary morphological operations, connectivity in images, and algorithms for thinning, boundary detection, and segmentation.
This document summarizes Chapter 9 from a textbook on introductory mathematical analysis. Section 9.1 discusses discrete random variables and expected value. Section 9.2 covers the binomial distribution and how it relates to the binomial theorem. Section 9.3 introduces Markov chains and their associated transition matrices. Examples are provided for each topic to illustrate key concepts like calculating expected values, applying the binomial distribution formula, and determining probabilities using Markov chains.
Overlapping T-block analysis and genetic optimization of rectangular grooves ...Yong Heui Cho
This document analyzes and optimizes the scattering characteristics of rectangular grooves in a parallel-plate waveguide using an overlapping T-block method and genetic algorithm. The fields within the waveguide are represented by the summation of fields within overlapping T-blocks. Insertion loss behaviors are computed and optimized using a genetic algorithm. The optimized results are compared to experimental measurements and show good agreement when considering 4 modes or more in the analysis.
METRIC DIMENSION AND UNCERTAINTY OF TRAVERSING ROBOTS IN A NETWORKgraphhoc
Metric dimension in graph theory has many applications in the real world. It has been applied to the
optimization problems in complex networks, analyzing electrical networks; show the business relations,
robotics, control of production processes etc. This paper studies the metric dimension of graphs with
respect to contraction and its bijection between them. Also an algorithm to avoid the overlapping between
the robots in a network is introduced.
This document provides an overview of Chapter 3 from the textbook "Introductory Mathematical Analysis" which covers topics related to lines, parabolas, and systems of equations. The chapter objectives are to develop concepts of slope, demand/supply curves, quadratic functions, and solving systems of linear and nonlinear equations. Examples are provided for finding equations of lines from points, graphing linear and quadratic functions, and applying systems of equations to equilibrium points and break-even analysis. Key concepts explained include slope, forms of linear equations, parallel/perpendicular lines, demand/supply curves, and solving systems using elimination or substitution.
This document defines and provides examples of various graph concepts from discrete mathematics including:
- Complete graphs, cycle graphs, wheel graphs, and hypercubes as special types of simple graphs
- Bipartite graphs and complete bipartite graphs
- Subgraphs and unions of graphs
- Representing graphs using adjacency lists and matrices
- Graph isomorphism
It includes over 20 examples applying these graph concepts and definitions.
Iaetsd an enhanced circular detection technique rpsw using circular hough t...Iaetsd Iaetsd
This document proposes a new technique for detecting circular features in satellite images that combines Rotational Pixel Swapping (RPSW) and Circular Hough Transform. RPSW enhances circular patterns by multiplying the original image with rotated versions. Circular Hough Transform then identifies the center and radius of circles. Applying both allows detecting simple and complex circles while finding the area, improving on existing methods. RPSW alone only identifies circle centers, so the addition of Circular Hough Transform provides radius and area information. The combined approach accurately detects circular features from planetary images.
The document discusses morphological image operations and mathematical morphology. It provides examples of basic morphological operations like dilation, erosion, opening and closing. It also discusses morphological algorithms for tasks like boundary extraction, region filling, connected component extraction, skeletonization, and using morphological operations for applications like detecting foreign objects. The key concepts covered are binary morphological operations, connectivity in images, and algorithms for thinning, boundary detection, and segmentation.
This document summarizes Chapter 9 from a textbook on introductory mathematical analysis. Section 9.1 discusses discrete random variables and expected value. Section 9.2 covers the binomial distribution and how it relates to the binomial theorem. Section 9.3 introduces Markov chains and their associated transition matrices. Examples are provided for each topic to illustrate key concepts like calculating expected values, applying the binomial distribution formula, and determining probabilities using Markov chains.
Overlapping T-block analysis and genetic optimization of rectangular grooves ...Yong Heui Cho
This document analyzes and optimizes the scattering characteristics of rectangular grooves in a parallel-plate waveguide using an overlapping T-block method and genetic algorithm. The fields within the waveguide are represented by the summation of fields within overlapping T-blocks. Insertion loss behaviors are computed and optimized using a genetic algorithm. The optimized results are compared to experimental measurements and show good agreement when considering 4 modes or more in the analysis.
1) The document presents a novel approach for pose estimation, normalization, and face recognition using multi-class SVM, affine transformation, and DCT.
2) The training section uses affine transformation for pose normalization and DCT for illumination removal. During testing, multi-class SVM estimates pose and affine transformation and DCT are applied to normalize pose and remove illumination before recognition.
3) PCA is used to extract features for matching during recognition. Experimental results on FERET datasets show the approach achieves 100% recognition rate after pose normalization and illumination removal.
The document discusses functions and graphs in chapter 2 of an introductory mathematical analysis textbook. It introduces key concepts such as functions, domains, ranges, combinations of functions, inverse functions, and graphs in rectangular coordinates. It provides examples of determining equality of functions, finding function values, combining functions, and finding inverses. It also discusses special functions, graphs, symmetry, and intercepts. The chapter aims to define functions and domains, introduce different types of functions and their operations, and familiarize students with graphing equations and basic function shapes.
This document summarizes and compares different types of math education assessments used in China, including school-based assessments, entrance examinations, and competitions. It discusses the purposes and formats of exams at different levels from junior high school to university entrance. It also describes the processes of setting exam papers and marking assessments. While exams are useful, over-reliance on them can have drawbacks for long-term student development.
Lesson 19: The Mean Value Theorem (Section 021 handout)Matthew Leingang
The Mean Value Theorem is the most important theorem in calculus. It is the first theorem which allows us to infer information about a function from information about its derivative. From the MVT we can derive tests for the monotonicity (increase or decrease) and concavity of a function.
This document provides examples and explanations for graphing translations of figures on a coordinate plane. It defines translation notation and shows how to determine the coordinates of a figure after it has been translated based on the original coordinates and the translation amounts. Examples are provided of translating triangles, rectangles, and single points and writing the new coordinates using prime notation for the translated figure.
The midpoint method or technique is a “measurement” and as each measurement it has a tolerance, but
worst of all it can be invalid, called Out-of-Control or OoC. The core of all midpoint methods is the accurate
measurement of the difference of the squared distances of two points to the “polar” of their midpoint
with respect to the conic. When this measurement is valid, it also measures the difference of the squared
distances of these points to the conic, although it may be inaccurate, called Out-of-Accuracy or OoA. The
primary condition is the necessary and sufficient condition that a measurement is valid. It is comletely
new and it can be checked ultra fast and before the actual measurement starts. .
Modeling an incremental algorithm, shows that the curve must be subdivided into “piecewise monotonic”
sections, the start point must be optimal, and it explains that the 2D-incremental method can find, locally,
the global Least Square Distance. Locally means that there are at most three candidate points for a given
monotonic direction; therefore the 2D-midpoint method has, locally, at most three measurements.
When all the possible measurements are invalid, the midpoint method cannot be applied, and in that case
the ultra fast “OoC-rule” selects the candidate point. This guarantees, for the first time, a 100% stable,
ultra-fast, berserkless midpoint algorithm, which can be easily transformed to hardware. The new algorithm
is on average (26.5±5)% faster than Mathematica, using the same resolution and tested using 42
different conics. Both programs are completely written in Mathematica and only ContourPlot[] has been
replaced with a module to generate the grid-points, drawn with Mathematica’s
Graphics[Line{gridpoints}] function.
The document summarizes a two-stage image segmentation method and super pixels. It discusses a two-stage convex image segmentation method that transforms an image into a piecewise smooth one that can be segmented based on pixel values. It introduces super pixels, which group pixels into perceptually meaningful atomic regions. The document studied these methods through MATLAB and also explored applications like saliency detection based on super pixel segmentation. It focused on understanding the algorithms through code implementation and improving the efficiency of methods like the SLIC super pixel algorithm.
linear feature extraction from topographic maps using energy density and shea...Abhiram Subhagan
linear feature extraction from topographic maps using energy density and shear transform
this paper is based on MATLAB to extract linear features such as roads and rivers from geographic maps
The document discusses various concepts related to digital image processing including:
1) The relationships between pixels in an image including 4-neighbors, 8-neighbors, and m-neighbors of a pixel.
2) The concepts of adjacency and connectivity between pixels based on their intensity values and whether they are neighbors.
3) Computing the shortest path between two pixels using 4, 8, or m-adjacency and examples calculating these paths.
The document summarizes research analyzing the optimal cross-sectional shape for curved beams. It presents bending stress equations customized for different cross-sections of curved beams. A computer program was developed to calculate stresses in curved beams with various cross-sections, including circular, rectangular, triangular, trapezoidal, T-shaped, and I-beams. Results found that the trapezoidal cross-section produced the highest total stresses with the minimum eccentricity shift between the centroidal and neutral axes, indicating it is the most suitable shape among those analyzed.
This document describes a geometric constraint solving method that takes a declarative description of a geometric diagram as input and outputs a sequence of construction steps to build the diagram using only a ruler and compass. The key aspects of the method are: (1) It uses global propagation to determine the position of points from all relevant constraints, not just those directly involving the point. (2) It represents lines and circles implicitly in terms of characteristic points. (3) It propagates partial properties of geometric objects like direction or points on a line to solve constraints.
Research on Image Classification Model of Probability Fusion Spectrum-Spatial...CSCJournals
For insufficient information of imaging spectrum with high spatial resolution, detailed imaging information, reduction of mixed pixels, increase of pure pixels and problems of image characteristic extraction and model classification produced from this, we provide a classifier model of a united spectrum-spatial multi-characteristic based on SVM, and use this model to finish the image classification. The model completely uses the multi-characteristic information, and overcomes the over-fitting problems produced by accumulating high-dimensional characteristics. The model includes three classifications of spectrum-spatial characteristics, namely spectral characteristics-spectral characteristic of multi-scale morphology, spectral characteristics-physical characteristics of underlaying surfaces of multi-scale morphology and spectral characteristics-features spatial extension characteristics of multi-scale morphology. Firstly the three classifications of spectrum-spatial characteristics are classified through SVM, then carries out the probability fusion for the classification results based on the pixels to obtain the final image classification results. This article respectively uses WorldView-2 image and ROSIS image to experiment, and the results show that the model has better classification effect compared with VS-SVM algorithm.
This document presents an overview of the differential transform method (DTM) for solving differential equations. DTM uses Taylor series to obtain approximate or exact solutions. The document defines 1D, 2D, and 3D DTM and lists common operations. Examples are provided of applying DTM to solve systems of linear/non-linear differential equations. The document concludes with references for further applications of DTM in engineering and mathematics.
Linear Feature Separation From Topographic Maps Using Energy Density and The ...Rojith Thomas
This document presents a method for automatically separating linear features from backgrounds in digital topographic maps. It is difficult to separate lines and backgrounds when their colors are similar using traditional color-based methods. The proposed method uses shear transform, energy density concepts, and template matching. Lines are separated from backgrounds based on the rule that energy density is higher for lines distributed in small areas compared to backgrounds distributed in large areas. The method was tested on a 342x198 topographic map with similar line and background colors and was able to extract the linear features.
This document appears to be the table of contents and problems from Chapter 0 of a mathematics textbook. The table of contents lists 17 chapters and their corresponding page numbers. The problems cover a range of algebra topics including integers, rational numbers, properties of operations, solving equations, and rational expressions. There are over 70 problems presented without solutions for students to work through.
Java3D is an Application Programming Interface used for writing 3D graphics applications and applets. This paper gives a short introduction of java3D, analyses the mathematics of Hermite, Bezier, FourPoints, B-Splines curve, and describes implementation of curve creation and curve
operations using Java3D API.
Бум мобильных технологий неоспорим, а популярность мобильных устройств зашкаливает. Тот факт, что их на земле больше чем людей - очередное доказательство. Крупнейшие компании мира, лидеры отраслей (я постарался привести по кейсу на отрасль) уже имеют свои мобильные программы лояльности. Я по прежнему не устаю повторять “Чтобы запустить успешную программу лояльности в СНГ, достаточно уметь читать по английски”.
1) The document presents a novel approach for pose estimation, normalization, and face recognition using multi-class SVM, affine transformation, and DCT.
2) The training section uses affine transformation for pose normalization and DCT for illumination removal. During testing, multi-class SVM estimates pose and affine transformation and DCT are applied to normalize pose and remove illumination before recognition.
3) PCA is used to extract features for matching during recognition. Experimental results on FERET datasets show the approach achieves 100% recognition rate after pose normalization and illumination removal.
The document discusses functions and graphs in chapter 2 of an introductory mathematical analysis textbook. It introduces key concepts such as functions, domains, ranges, combinations of functions, inverse functions, and graphs in rectangular coordinates. It provides examples of determining equality of functions, finding function values, combining functions, and finding inverses. It also discusses special functions, graphs, symmetry, and intercepts. The chapter aims to define functions and domains, introduce different types of functions and their operations, and familiarize students with graphing equations and basic function shapes.
This document summarizes and compares different types of math education assessments used in China, including school-based assessments, entrance examinations, and competitions. It discusses the purposes and formats of exams at different levels from junior high school to university entrance. It also describes the processes of setting exam papers and marking assessments. While exams are useful, over-reliance on them can have drawbacks for long-term student development.
Lesson 19: The Mean Value Theorem (Section 021 handout)Matthew Leingang
The Mean Value Theorem is the most important theorem in calculus. It is the first theorem which allows us to infer information about a function from information about its derivative. From the MVT we can derive tests for the monotonicity (increase or decrease) and concavity of a function.
This document provides examples and explanations for graphing translations of figures on a coordinate plane. It defines translation notation and shows how to determine the coordinates of a figure after it has been translated based on the original coordinates and the translation amounts. Examples are provided of translating triangles, rectangles, and single points and writing the new coordinates using prime notation for the translated figure.
The midpoint method or technique is a “measurement” and as each measurement it has a tolerance, but
worst of all it can be invalid, called Out-of-Control or OoC. The core of all midpoint methods is the accurate
measurement of the difference of the squared distances of two points to the “polar” of their midpoint
with respect to the conic. When this measurement is valid, it also measures the difference of the squared
distances of these points to the conic, although it may be inaccurate, called Out-of-Accuracy or OoA. The
primary condition is the necessary and sufficient condition that a measurement is valid. It is comletely
new and it can be checked ultra fast and before the actual measurement starts. .
Modeling an incremental algorithm, shows that the curve must be subdivided into “piecewise monotonic”
sections, the start point must be optimal, and it explains that the 2D-incremental method can find, locally,
the global Least Square Distance. Locally means that there are at most three candidate points for a given
monotonic direction; therefore the 2D-midpoint method has, locally, at most three measurements.
When all the possible measurements are invalid, the midpoint method cannot be applied, and in that case
the ultra fast “OoC-rule” selects the candidate point. This guarantees, for the first time, a 100% stable,
ultra-fast, berserkless midpoint algorithm, which can be easily transformed to hardware. The new algorithm
is on average (26.5±5)% faster than Mathematica, using the same resolution and tested using 42
different conics. Both programs are completely written in Mathematica and only ContourPlot[] has been
replaced with a module to generate the grid-points, drawn with Mathematica’s
Graphics[Line{gridpoints}] function.
The document summarizes a two-stage image segmentation method and super pixels. It discusses a two-stage convex image segmentation method that transforms an image into a piecewise smooth one that can be segmented based on pixel values. It introduces super pixels, which group pixels into perceptually meaningful atomic regions. The document studied these methods through MATLAB and also explored applications like saliency detection based on super pixel segmentation. It focused on understanding the algorithms through code implementation and improving the efficiency of methods like the SLIC super pixel algorithm.
linear feature extraction from topographic maps using energy density and shea...Abhiram Subhagan
linear feature extraction from topographic maps using energy density and shear transform
this paper is based on MATLAB to extract linear features such as roads and rivers from geographic maps
The document discusses various concepts related to digital image processing including:
1) The relationships between pixels in an image including 4-neighbors, 8-neighbors, and m-neighbors of a pixel.
2) The concepts of adjacency and connectivity between pixels based on their intensity values and whether they are neighbors.
3) Computing the shortest path between two pixels using 4, 8, or m-adjacency and examples calculating these paths.
The document summarizes research analyzing the optimal cross-sectional shape for curved beams. It presents bending stress equations customized for different cross-sections of curved beams. A computer program was developed to calculate stresses in curved beams with various cross-sections, including circular, rectangular, triangular, trapezoidal, T-shaped, and I-beams. Results found that the trapezoidal cross-section produced the highest total stresses with the minimum eccentricity shift between the centroidal and neutral axes, indicating it is the most suitable shape among those analyzed.
This document describes a geometric constraint solving method that takes a declarative description of a geometric diagram as input and outputs a sequence of construction steps to build the diagram using only a ruler and compass. The key aspects of the method are: (1) It uses global propagation to determine the position of points from all relevant constraints, not just those directly involving the point. (2) It represents lines and circles implicitly in terms of characteristic points. (3) It propagates partial properties of geometric objects like direction or points on a line to solve constraints.
Research on Image Classification Model of Probability Fusion Spectrum-Spatial...CSCJournals
For insufficient information of imaging spectrum with high spatial resolution, detailed imaging information, reduction of mixed pixels, increase of pure pixels and problems of image characteristic extraction and model classification produced from this, we provide a classifier model of a united spectrum-spatial multi-characteristic based on SVM, and use this model to finish the image classification. The model completely uses the multi-characteristic information, and overcomes the over-fitting problems produced by accumulating high-dimensional characteristics. The model includes three classifications of spectrum-spatial characteristics, namely spectral characteristics-spectral characteristic of multi-scale morphology, spectral characteristics-physical characteristics of underlaying surfaces of multi-scale morphology and spectral characteristics-features spatial extension characteristics of multi-scale morphology. Firstly the three classifications of spectrum-spatial characteristics are classified through SVM, then carries out the probability fusion for the classification results based on the pixels to obtain the final image classification results. This article respectively uses WorldView-2 image and ROSIS image to experiment, and the results show that the model has better classification effect compared with VS-SVM algorithm.
This document presents an overview of the differential transform method (DTM) for solving differential equations. DTM uses Taylor series to obtain approximate or exact solutions. The document defines 1D, 2D, and 3D DTM and lists common operations. Examples are provided of applying DTM to solve systems of linear/non-linear differential equations. The document concludes with references for further applications of DTM in engineering and mathematics.
Linear Feature Separation From Topographic Maps Using Energy Density and The ...Rojith Thomas
This document presents a method for automatically separating linear features from backgrounds in digital topographic maps. It is difficult to separate lines and backgrounds when their colors are similar using traditional color-based methods. The proposed method uses shear transform, energy density concepts, and template matching. Lines are separated from backgrounds based on the rule that energy density is higher for lines distributed in small areas compared to backgrounds distributed in large areas. The method was tested on a 342x198 topographic map with similar line and background colors and was able to extract the linear features.
This document appears to be the table of contents and problems from Chapter 0 of a mathematics textbook. The table of contents lists 17 chapters and their corresponding page numbers. The problems cover a range of algebra topics including integers, rational numbers, properties of operations, solving equations, and rational expressions. There are over 70 problems presented without solutions for students to work through.
Java3D is an Application Programming Interface used for writing 3D graphics applications and applets. This paper gives a short introduction of java3D, analyses the mathematics of Hermite, Bezier, FourPoints, B-Splines curve, and describes implementation of curve creation and curve
operations using Java3D API.
Бум мобильных технологий неоспорим, а популярность мобильных устройств зашкаливает. Тот факт, что их на земле больше чем людей - очередное доказательство. Крупнейшие компании мира, лидеры отраслей (я постарался привести по кейсу на отрасль) уже имеют свои мобильные программы лояльности. Я по прежнему не устаю повторять “Чтобы запустить успешную программу лояльности в СНГ, достаточно уметь читать по английски”.
На мой взгляд, доклад будет интересен специалистам с любом уровнем знаний по одной простой причине, что тех, кто рисует — очень много, а тех, кто собирает данные и при этом умеет это делать, очень мало, тогда как без данных рисовать-то и нечего
В общей проблематике сбора данных есть явный крен в сторону проведения usability-тестирования. Т.е. есть продукт, мы его тестируем, пытаемся понять, что не так, а что так, что улучшить, а что уже неплохо. Есть хорошие специалисты (Миша Фролов, Рита Титова), которые об этом рассказывали не раз и делали это хорошо. Тогда как докладов где бы то ни было про сбор первоначальных данных (когда проект еще только в стадии разработки), как это делать, почему так, что делать потом с этими данными, как они перекочуют в дальнейшем в продукт и интерфейс, было крайне мало. Между тем, это важнейший этап при создании нового продукта (именно на создании нового продукта я фокусируюсь) и то, какие данные будут получены, насколько они правдивы, честны, откровенны и при этом полезны, критично в плане достижения успеха будущего продукта кратчайшим путем.
Я занимаюсь сбором данных достаточно регулярно ввиду того, что регулярно принимаю участие в создании разных новых продуктов, в том числе, владельцем которых являюсь сам. Этим я занимаюсь примерно 7 лет, в ходе которых постепенно формировались определенные практики и механизмы проведения интервью таким образом, чтобы получить максимум полезной информации из потенциального клиента, реакции на различные нестандартные ситуации, благодаря чему сформировался некий best practicies list. Ввиду того, что я преподаю вводный курс по ux и уделяю на нем особое внимание сбору данных, я обращал внимание, что даже после определенных тренировок даже люди, кому общение с незнакомыми людьми дается достаточно просто, при постановке конкретной задачи по сбору данных допускают большое количество ошибок, результатом которых, прежде всего, является небольшой объем собранных полезных данных, определенный объем данных, которые не являются достоверными и не надуманными.
Как и когда использовать айтрекер на юзабилити тестированииПрофсоUX
Доклад ориентирован на юзабилити исследователей, которые открыты к новым знаниям, и их не устраивает уровень данных, которые они получают сейчас. Так же доклад будет полезен руководителям проектов и дизайнерам, которые хотят повысить показатели в своих проектах, но не догадываются как это можно сделать с помощью юзабилити тестирования.
В последнее время технология айтрекинга стала доступне. Уже за 99 долларов можно купить не дорой айтрекер. И почти у каждого возникает проблема, как его использовать после покупки. Что означают эти точки и что с ними можно делать. Я расскажу, как использую я.
UX-дизайнер, ты ли это? Навыки проектировщика в стилизации интерфейсов.ПрофсоUX
Доклад предполагает общение о завершающих этапах проектирования, о месте перехода прототипа в графический дизайн. Освещение тем акцентов, шрифтов и цвета. Доклад будет построен вокруг разбора примеров.
Мы делаем продукты и сервисы для людей. Придумываем облик и механику. Чтобы наши творения действительно работали и помогали, нужно понимать других, их мотивы и привычки.
При этом в работе мы часто забиваем на себя. Живем в погоне за гармонией. И всегда немного не дотягиваемся до нее.
Я расскажу о блокноте. Это инструмент, в котором мы создаем себя и находим дзен.
This document discusses hyperbolas, including:
1) Hyperbolas are defined as sets of points where the difference between the distances to two fixed points (foci) is a constant. They can be graphed using the standard form equation.
2) Hyperbolas have two branches, two axes of symmetry, vertices, co-vertices, and asymptotes. The standard form equation depends on whether the transverse axis is horizontal or vertical.
3) Examples show how to write the standard form equation, find vertices/co-vertices/asymptotes, and graph hyperbolas. Parameters like the center, foci and axes can change the graph of the hyperbola.
An ellipse is a curve in a plane where the sum of the distances to two fixed points (foci) is a constant. The two foci, along with the major and minor axes and vertices, are used to define an ellipse. The standard equation of an ellipse depends on whether the foci lie along the x-axis or y-axis. Key properties including eccentricity and the latus rectum are also described.
The document discusses ellipses and their key properties. It defines an ellipse as the set of points where the sum of the distances to two fixed foci is constant. Examples are given showing how to identify the center, vertices, covertices, and foci of ellipses given their equations. It also explains how to write the standard form of the equation of an ellipse and determines whether it has a horizontal or vertical major axis. Activities are provided for students to practice identifying parts of ellipses and writing their standard forms from equations.
IOSR Journal of Mathematics(IOSR-JM) is a double blind peer reviewed International Journal that provides rapid publication (within a month) of articles in all areas of mathemetics and its applications. The journal welcomes publications of high quality papers on theoretical developments and practical applications in mathematics. Original research papers, state-of-the-art reviews, and high quality technical notes are invited for publications.
Graph Dynamical System on Graph ColouringClyde Shen
This document discusses using a graph dynamical system to model the vertex coloring problem. It proposes using a Graph-cellular Automaton (GA), which is an extension of cellular automata, to distribute the coloring process. In the GA model, each vertex independently chooses its optimal color based on the colors of its adjacent vertices. The document outlines testing the GA approach on different types of graphs and analyzing whether it can find colorings for them. It provides background on graph coloring, planar graphs, and introduces the graph dynamical system and GA models.
This document provides an introduction to topological graph theory. It begins with definitions of basic graph theory concepts from a topological perspective, such as representing graphs with curved arcs instead of straight lines. It then discusses graph drawings, incidence matrices, vertex valence, and graph maps/isomorphisms. Important classes of graphs are introduced, such as trees, paths, cycles, and complete graphs. The document aims to introduce preliminary concepts of topological graph theory to students in a simple manner.
Motivated by presenting mathematics visually and interestingly to common people based on calculus and its extension, parametric curves are explored here to have two and three dimensional objects such that these objects can be used for demonstrating mathematics.
Epicycloid, hypocycloid are particular curves that are implemented in MATLAB programs and the motifs are presented here. The obtained curves are considered to be domains for complex mappings to have new variation of Figures and objects. Additionally Voronoi mapping is also implemented to some parametric curves and some resulting complex mappings.
Some obtained 3 dimensional objects are considered as flowers and animals inspiring to be mathematical ornaments of hypocycloid dance which is also illustrated here.
This module discusses coordinate proofs and properties of circles on the coordinate plane. It introduces coordinate proofs as an analytical method of proving geometric theorems by using the coordinates of points and algebraic relationships. Examples demonstrate proving properties of triangles and quadrilaterals analytically. The standard form of the equation of a circle is derived from the distance formula as (x - h)2 + (y - k)2 = r2, where (h, k) is the center and r is the radius. Finding the center, radius, and equation of circles in various forms are illustrated.
This document contains information for three math items:
1. An item about modeling population growth using an exponential function. It provides context and formulas.
2. An item about choosing a sine function to model periodic phenomena. It discusses amplitude, frequency, and midline.
3. An item about understanding the construction of inverse trigonometric functions by restricting domains. It includes a graph.
This document provides an introduction to graph theory concepts. It defines what a graph is consisting of vertices and edges. It discusses different types of graphs like simple graphs, multigraphs, digraphs and their properties. It introduces concepts like degrees of vertices, handshaking lemma, planar graphs, Euler's formula, bipartite graphs and graph coloring. It provides examples of special graphs like complete graphs, cycles, wheels and hypercubes. It discusses applications of graphs in areas like job assignments and local area networks. The document also summarizes theorems regarding planar graphs like Kuratowski's theorem stating conditions for a graph to be non-planar.
The document discusses hyperbolas. It begins by providing an algebraic definition of a hyperbola as the set of points where the difference between the distances to two fixed points (foci) is a constant. It then provides steps for graphing a hyperbola from its standard form equation, including identifying the center, vertices, transverse/conjugate axes, asymptotes, and foci. Examples of graphing hyperbolas are shown.
This document contains a geometry lesson on perpendicular bisectors and angle bisectors. It begins with definitions of perpendicular bisectors and angle bisectors. It then provides examples of using theorems about perpendicular bisectors and angle bisectors to find unknown measures in geometric figures. It also gives examples of writing equations of perpendicular bisectors and angle bisectors in the coordinate plane. The document aims to prove and apply theorems about perpendicular bisectors and angle bisectors.
This document contains a geometry lesson on perpendicular bisectors and angle bisectors. It begins with definitions of perpendicular bisectors and angle bisectors. It then provides examples of using theorems about perpendicular bisectors and angle bisectors to find unknown measures in geometric figures. It also gives examples of writing equations of perpendicular bisectors and angle bisectors in the coordinate plane. The document aims to prove and apply theorems about perpendicular bisectors and angle bisectors.
This document provides information about circles and conic sections. It begins with an overview of circles, including definitions of key terms like radius, diameter, chord, and equations of circles given the center and radius or three points. It then covers conic sections, defining ellipses, parabolas and hyperbolas based on eccentricity. Equations of various conic sections are derived based on the location of foci, directrix, vertex and other geometric properties. Sample problems are provided to demonstrate solving problems involving different geometric configurations of circles and conic sections.
The document discusses graph theory and provides definitions and examples of various graph concepts. It defines what a graph is consisting of vertices and edges. It also defines different types of graphs such as simple graphs, multigraphs, digraphs and provides examples. It discusses graph terminology, models, degree of graphs, handshaking lemma, special graphs and applications. It also provides explanations of planar graphs, Euler's formula and graph coloring.
11 - 3
Experiment 11
Simple Harmonic Motion
Questions
How are swinging pendulums and masses on springs related? Why are these types of
problems so important in Physics? What is a spring’s force constant and how can you measure
it? What is linear regression? How do you use graphs to ascertain physical meaning from
equations? Again, how do you compare two numbers, which have errors?
Note: This week all students must write a very brief lab report during the lab period. It is
due at the end of the period. The explanation of the equations used, the introduction and the
conclusion are not necessary this week. The discussion section can be as little as three sentences
commenting on whether the two measurements of the spring constant are equivalent given the
propagated errors. This mini-lab report will be graded out of 50 points
Concept
When an object (of mass m) is suspended from the end of a spring, the spring will stretch
a distance x and the mass will come to equilibrium when the tension F in the spring balances the
weight of the body, when F = - kx = mg. This is known as Hooke's Law. k is the force constant
of the spring, and its units are Newtons / meter. This is the basis for Part 1.
In Part 2 the object hanging from the spring is allowed to oscillate after being displaced
down from its equilibrium position a distance -x. In this situation, Newton's Second Law gives
for the acceleration of the mass:
Fnet = m a or
The force of gravity can be omitted from this analysis because it only serves to move the
equilibrium position and doesn’t affect the oscillations. Acceleration is the second time-
derivative of x, so this last equation is a differential equation.
To solve: we make an educated guess:
Here A and w are constants yet to be determined. At t = 0 this solution gives x(t=0) = A,
which indicates that A is the initial distance the spring stretches before it oscillates. If friction is
negligible, the mass will continue to oscillate with amplitude A. Now, does this guess actually
solve the (differential) equation? A second time-derivative gives:
Comparing this equation to the original differential equation, the correct solution was
chosen if w2 = k / m. To understand w, consider the first derivative of the solution:
−kx = ma
a = −
k
m
⎛
⎝
⎜⎜⎜⎜
⎞
⎠
⎟⎟⎟⎟
x
d 2x
dt 2
= −
k
m
x x(t) = A cos(ωt)
d 2x(t)
dt 2
= −Aω2 cos(ωt) = −ω2x(t)
James Gering
Florida Institute of Technology
11 - 4
Integrating gives
We assume the object completes one oscillation in a certain period of time, T. This helps
set the limits of integration. Initially, we pull the object a distance A from equilibrium and
release it. So at t = 0 and x = A. (one.
This document summarizes a research paper that was presented at the seventh International Conference on Urban Climate from June 29th to July 3rd, 2009 in Yokohama, Japan. The paper describes the development of a new 1-D Urban Canopy Model to simulate the effects of urban structures on atmospheric flow. Large Eddy Simulations were used to validate the model for different building configurations. The paper also introduces a new method for representing complex urban geometries with a simplified, equivalent representation of regularly spaced buildings that can be used as input for Urban Canopy Models.
The document discusses hyperbolas, which are conic sections that have two disconnected branches. Key elements of a hyperbola include its foci, vertices, transverse/conjugate axes, center, and asymptotes. The eccentricity measures the "bendiness" of the hyperbola. Equations of hyperbolas depend on whether the transverse axis is horizontal or vertical. The document provides examples and exercises on finding equations and properties of hyperbolas given certain information.
This document discusses diagrams in geometry. It begins by defining diagrams as structures that provide information about rank 2 residues of geometries. Section 2.1 introduces digon diagrams, which capture local structure by showing which rank 2 residues are generalized digons. The direct sum theorem states that elements in disconnected components of a digon diagram are always incident. Sections 2.2-2.6 discuss different types of diagrams and how they relate to classification of geometries.
x2 y2
Standard Equation of hyperbola is a 2 – b2 = 1
(i) Definition hyperbola : A Hyperbola is the locus of a point in a plane which moves in the plane in such a way that the ratio of its distance from a fixed point (called focus) in the same plane to its distance from a fixed line (called directrix) is always constant which is always greater than unity.
The hyperbola whose transverse and conjugate axes are respectively the conjugate and transverse axes of a given hyperbola is called conjugate hyperbola.
Note :
(i) If e1 and e2 are the eccentricities of the
(ii) Vertices : The point A and A where the curve meets the line joining the foci S and S
hyperbola and its conjugate then
1 +
e 2 e
1 = 1
2
are called vertices of hyperbola.
(iii) Transverse and Conjugate axes : The straight line joining the vertices A and A is called transverse axes of the hyperbola. Straight line perpendicular to the transverse axes and passes through its centre called conjugate axes.
(iv) Latus Rectum : The chord of the hyperbola which passes through the focus and is perpendicular to its transverse axes is called
2b2
latus rectum. Length of latus rectum = a .
(ii) The focus of hyperbola and its1 conju2gate are concyclic.
Standard Equation and Difinitions
Ex.1 Find the equation of the hyperbola whose directrix is 2x + y = 1, focus (1,2) and
eccentricity 3 .
Sol. Let P (x,y) be any point on the hyperbola. Draw PM perpendicular from P on the directrix.
Then by definition SP = e PM
(v) Eccentricity : For the hyperbola
x2 y2
a 2 – b2
= 1,
(SP)2 = e2(PM)2
2x y 12
b2 = a2 (e2 – 1)
(x–1)2 + (y–2)2 = 3
Conjugate axes 2
5(x2 + y2 – 2x – 4y + 5} =
e = =
1
Transverse
axes
3(4x2 + y2 + 1+ 4xy – 2y – 4x)
7x2 – 2y2 + 12xy – 2x + 14y – 22 = 0
(vi) Focal distance : The distance of any point on the hyperbola from the focus is called the focal distance of the point.
Note : The difference of the focal distance of a point on the hyperbola is constant and is equal to the length
of the transverse axes. |SP – SP| = 2a (const.)
which is the required hyperbola.
Ex.2 Find the lengths of transverse axis and conjugate axis, eccentricity and the co- ordinates of foci and vertices; lengths of the latus rectum, equations of the directrices of the hyperbola 16x2 – 9y2 = –144
Sol. The equation 16x2 – 9y2 = – 144 can be
Sol. y= m1(x –a),y= m2(x + a) where m1m2 = k, given
x 2
written as 9
x2
y 2
– 16 = – 1. This is of the form
y2
In order to find the locus of their point of intersection we have to eliminate the unknown
m1 and m2. Multiplying, we get
y2 = m1m2 (x2 – a2) or y2 = k(x2–a2)
a 2 – b2 = – 1
a2 = 9, b2 = 16 a = 3, b = 4
or x – y
1 k
= a2
which represents a hyperbola.
Length of transverse axis :
The length of transverse axis = 2b = 8
Length of conjugate axis :
The length of conjugate axis = 2a = 6
5
Ex.5 T
Adaptive learning does not make teachers out-of-date. The ways of development of adaptive technology in education are considered. The possibility of using the deep learning model in adaptive learning systems is indicated.
Презентация на XXVII Международной научно-практической конференции «Информационные технологии: наука, техника, технология, образование, здоровье» (MicroCAD-2019). 15-17 мая 2019 года, Харьков, Украина.
Американский предприниматель и гуру в области геймификации, Ю-кай Чоу, разработал структуру Octalysis (octagon+analysis), основой которой является анализ восьми основных факторов или ключевых побуждений (CD - core drive) мотивации человека выполнить некоторую работу. Тщательный разбор этих факторов и примеры их применения в качестве основных поведенческих стимулов Ю-кай Чоу осуществил в уроках по геймификации. Уроки поставлялись электронной почтой членам группы Octalysis Explorers Facebook осенью 2016 года, накануне всемирного конгресса по геймификации (GWC Conference 2016).
1. Some aspects of using of the GeoGebra package
in mathematics teacher’s activity
A. Stolyarevska
The Eastern-Ukrainian Branch of the International Solomon University, Kharkiv, Ukraine
The mathematical package GeoGebra provides for both graphical and algebraic input. It includes interactive
graphics, algebra and spreadsheet, free learning materials - from elementary school to university level. One of
the useful built-in capabilities of GeoGebra is the logging of the solution. This provides the students with ample
opportunity not only to see the result of decision, but also to trace the steps of its construction. In addition to
visualization it is also possible to use an algorithmic approach, which is equivalent to the problem solving
abilities. This work gives the problems of different levels of complexity from the course of analytic geometry
and translates their representation into one type of computer language – the series of instructions for the
package GeoGebra.
1. Introduction
“Mathematics is the part of our culture that has investigated algorithmic thought in the most profound and
systematic way. Now mathematics has a great deal to say about algorithmic thought” (Byers W., 2007). In
fact, the question “Is thought algorithmic?” could be replaced by “Can a computer do mathematics?” or “Is
mathematics algorithmic?” What aspects of mathematical activity can computers duplicate? Consider the
relationship between computing and mathematics, between mathematical thought and computer
simulations of thought processes. Normally using mathematics to investigate some subject means
creating a mathematical model, using mathematical techniques to draw out the mathematical
consequences of that model, and, finally, translating the conclusions back to the original situation.
Due to its possibility of using the algorithmic approach the package GeoGebra was chosen as the
assistant for the students of the computer science faculty in their learning of analytic geometry. The main
idea was to detect a gradual increase in students’ level (for the students, who mostly use mathematics
instrumentally) from remembering and understanding till applying, analyzing, evaluating, and creating.
2. The practice block
The definition of locus. The set of all points that satisfy specified conditions is called the locus of the point
under the conditions. For example, the locus of points with distance a from the origin is the circle
222
ayx with center at (0, 0) and radius a .
The posing of the problem. For given straight line g , called the directrix, and point F, called the focus, try
to find the locus of points for which the distance to the point F is in a constant ratio to the distance from
the line g . The number is the eccentricity. The number p is called the focal parameter, it is the
distance from the focus to the curve along a line parallel to the directrix. All sorts of curves are described
by the following equation for different and p : 2222
21 ppxyx . The curves are divided
into three classes, depending on the value of : if 1 , the curve is called an ellipse, if 1 -
parabola, and otherwise - hyperbola.
Fig. 1. The ratio of MF to KM is equal to the eccentricity
2.1. Ellipse. Propositions and instructions
Proposition 1. The ellipse can be described by
comparing with the circle of radius a centered at
the center of the ellipse:
222
ayx .
1 Enter a=2
2 Enter b=1
2. Fig. 2. Proposition 1
For each x such that ax , there are two points
E, D on the ellipse, and two points A, C on the
circle.
Conclusions:
1) The ratio of ordinates of the points E, A and D, C
is equal to ab .
2) The ellipse is obtained from the circle by
compressing it to the horizontal axis, the
coordinates decrease in the same ratio ab .
3) The axes of the canonical coordinate system are
the symmetry axes of the ellipse
x² / a² + y² / b² = 1, and the origin of the coordinate
system is its center of symmetry.
3
Enter ellipse
c: x² / a² + y² / b² = 1
4 Enter circle d: x² + y² = a²
5 New point A on the circle
6
Perpendicular line a to X-axis
through point A
7
The intersection points for d and
a are B and C (B coincides with
A; hide B)
8
The intersection points for c and
a are D and F
9
The intersection point for a and
X-axis is F
10
Create segment b=AF, e=EF,
g=FC, f=FD
11 Enter k1 = e / b; k2 = f / g
12
Save the construction.
Note. Several files are created when you save file
in Geogebra:
• HTML file – this file includes the worksheet itself,
• GGB file – this file includes GeoGebra
construction,
• JAR (several files) – these files include GeoGebra
and make the worksheet interactive.
Table 1. Instruction 1 and explanations
Supplementary problems:
1) Create point O as intersection of X-axis and Y-axis;
2) Show that the point O is the center of symmetry.
Proposition 2.
The ellipse with foci 1F and 2F , and the major
semiaxis a is the locus of points for which the sum
of distances to the 1F and 2F is equal to a2 .
Fig. 3. Proposition 2
Proposition 3.
The distance from an arbitrary point ),( yxM on the
ellipse to each of the foci is a linear function of its
abscissa x :
xaMFrxaMFr 2211 , .
1
Create two sliders a: 0..5 and
b: 0..5; set a=2, b=1
2
Enter ellipse
el: x² / a² + y² / b² = 1
3 Enter c= sqrt(a² - b²) ;e=c/a
4
Enter points F1=(c,0) and
F2=(-c,0)
5 New point A on ellipse
6 Segment d=F2M
7 Segment f=F1M
8 Enter aa=2 a
9 Enter ff=d+f
10 Save the construction
11
Apply the drag test to check if
the construction is correct.
Table 2. Instruction 2
3. The image on the Fig. 3 has one free element in the dynamical construction: the point M.
Supplementary problem: Change the position of ),( yxM and watch the value of aa and ff .
Are they equal?
Proposition 4.
The ratio of the distance between point ),( yxM
and the focus to the distance between point
),( yxM and the directrix is equal to the
eccentricity of the ellipse.
Proposition 5.
The tangent to the ellipse at the point ),( yxM is the
bisector of the angle adjacent to the angle between
the segments that connect this point with the foci.
Fig. 4. Proposition 4 Fig. 5. Proposition 5
Table 3. The images from dynamic worksheets
The images on the Fig. 4, 5 have one free element in its dynamical construction: point M on the ellipse.
Supplementary problems:
1) Change the position of ),( yxM (Proposition 4) and watch the value of e and g/i.
2) Change the position of ),( yxM (Proposition 5) and watch the value of the angles AMB and AMC.
2.2. Hyperbola. Propositions and instructions
Proposition 6. The axes of the canonical coordinate
system are the symmetry axes of the hyperbola
1// 2222
byax , and the origin of the coordinate
system is its center of symmetry.
Fig. 6. Proposition 6
Conclusions:
MN=NM1, MA=AM2, and MO=OM’ for an arbitrary
point ),( yxM , therefore the ellipse has the
symmetry axes and the center of symmetry.
1
Create two sliders a: 0..5 and b:
0..5; set a=2, b=1
2
Enter hyperbola
c: x² / a² - y² / b² = 1
3 New point M on hyperbola
4 Create O – the point of origin
5 Create line j through O and M
6
Reflect M at the Y-axis and
X-axis to get its images M1 and
M2.
7
Reflect M at the point O to get
its image M’
8 Segments d=MM1 and e=MM2
9
Intersection point N of d and
Y-axis
10
Intersection point A of e and
Х-axis
11
Segments MN, NM1, MA, AM2,
MO, OM’
Table 4. Instruction 3
Supplementary problems:
Proposition 7.
Show that if a point moves along the hyperbola so that absolute value of its abscissa increases
indefinitely, then the distance from point to one of the asymptotes has zero as its limit.
Proposition 8.
4. Show that the distances 21,rr from an arbitrary point ),( yxM on the hyperbola to each of the focuses
dependent on its abscissa x in the following manner: xaMFrxaMFr 2211 , , where
ac/ - eccentricity, a - the major semiaxis.
Proposition 9.
The product of the distances from the point
),( yxM to the hyperbola’s asymptotes is constant
and is equal to 2222
/ baba .
Short instructions:
1) Set a and b .
2) Create hyperbola.
3) Create two asymptotes.
4) Create a point ),( yxM on hyperbola.
5) Create perpendicular lines f and g to
asymptotes through the point M.
6) Create segments BMh and MCi .
7) Show that 2222
/ babaih Fig. 7. Proposition 9
Proposition 10.
The hyperbola with foci 1F and 2F and the
semiaxis a is a locus of points for which the
absolute value of difference between the distances
to the foci is equal to the real axis of the hyperbola .
Proposition 11.
Tangent to the hyperbola at the point ),(0 yxM is
the bisector of angle between the segments, which
connect this point with the foci.
Fig. 8. Proposition 10 Fig. 9. Proposition 11
Table 5. The propositions of the different level of complexity
Supplementary problems:
1) Write short instruction for the problems in prepositions 10, 11 and perform them in GeoGebra.
2) Prove that the vertices of the hyperbola and the points of intersection of its asymptotes with directrices
belong to a circle.
3) The focus of the ellipse (hyperbola or parabola) divides the chord passing through it into segments u
and v. Prove that the sum uv /1/1 is constant.
4) Let u and v - the length of two perpendicular radii of the ellipse. Find the sum
22
/1/1 uv .
5) Prove that the segment of the tangent concluded between the asymptotes of the hyperbola is halved in
the point of contact.
2.3. Parabola. Propositions and instructions
Proposition 12. The distance from an arbitrary point
),( yxM on the parabola to the focus is equal to
2/pxr .
Note. Actually the square of distance from M to F is equal
to pxpxypxr 22/2/
2222
2
2/px . Hence, due to the fact that 0x ,
it follows that 2/pxr .
Proposition 13. The parabola is the locus of points
equally distant from the focus and the directrix.
1 Create slider p: 0..5 and set p=1
2 Enter parabola c: y² - 2 p x = 0
3 Enter focus F=(p/2, 0)
4 Enter directrix x=-p/2
5 New point M on parabola
5. Fig. 10. Propositions 12-13
6
Perpendicular line to directrix
through point M
7 Segment d=MF
8 Enter r=x(M)+p/2
9 Segment f=AM
10 Enter e= d/f
Table 6. Instruction 4
Supplementary problem: What is the value for the eccentricity of the parabola?
Proposition 14. The tangent to the parabola at the
point ),( yxM is the bisector of the angle adjacent
to the angle between the segment, which connects
),( yxM with focus, and the ray emerging from this
point in the direction of the axis of the parabola.
Fig. 11. Proposition 14
1 Create slider p: 0..5 and set p=1
2 Enter parabola c: y² - 2 p x = 0
3 Enter focus F=(p/2, 0)
4 Enter directrix x=-p/2
5 New point M on parabola
6 Tangent at M to parabola
7
Perpendicular line to directrix
through point M
8 Create line through F and M
Table 7. Instruction 5
Supplementary problems:
1) Try to measure the angles (Fig. 11) and draw the conclusion.
2) Two tangents drawn to the parabola from a point located on the directrix. Prove that they are mutually
perpendicular, and the segment connecting the point of contact passes through the focus.
3. Conclusions
With using the GeoGebra’s interactive construction protocol (Hohenwarter, 2008) the students have
constructed the curves as the loci of points and have solved the problems of different level of complexity.
This paper is oriented on the teaching material “The second-order curves”. The fourteen propositions,
according to Beklemishev (2005, pp.65-88), are considered. Among the teaching materials were also
used the books “Theory and problems of precalculus” (Safier, 1998), and “Geometry” (Rich, 2009).
References
Beklemishev D.V. (2005) The course of analytical geometry and linear algebra. Moscow. (In Russian)
Byers W. (2007) How mathematicians think: using ambiguity, contradiction, and paradox to create
mathematics. Princeton, New Jersey
Hohenwarter J., Hohenwarter M. (2008) Introduction to GeoGebra. Retrieved July 19, 2008 from
http://www.geogebra.org/cms/en/help
Il'in V.A., Poznyak E.G. (1999) Analytical geometry, Moscow. (In Russian)
Rich B. (2009) Geometry includes plane, analytic, and transformational geometries. Shaum's outline of
geometry. Brooklyn Technical High School, New York City.
Safier F. (1998) Theory and problems of Precalculus. Shaum's outline of geometry. McGRAW-HILL.