New Application Center Additions
https://www.maplesoft.com/applications
en-us2019 Maplesoft, A Division of Waterloo Maple Inc.Maplesoft Document SystemMon, 18 Feb 2019 22:19:10 GMTMon, 18 Feb 2019 22:19:10 GMTThe latest content added to the Application Centerhttps://www.maplesoft.com/images/Application_center_hp.jpgNew Application Center Additions
https://www.maplesoft.com/applications
Structured characteristic and bifurcation polynomials for polynomial maps
https://www.maplesoft.com/applications/view.aspx?SID=154515&ref=Feed
The worksheet computes linear transformation matrix T and its characteristic polynomial that belongs to a given polynomial map F (at least degree 2 in z) that can depend on parameters. The fastest computations are for the Mandelbrot map z^2+alpha, but other polynomial can be used. Matrix T represents multiplication by derivative of the map in a certain cyclic polynomial basis, the vector space that it works in is a cyclic polynomial factor ring according to ideal that belongs to k-cycles. The basis is chosen in a proper way to structure the matrix T into blocks that belong to cycle branches of known period d, d|k. The d-cycle branches degenerate at izolated parameter values with lambda = 1, where branches cross, so we can compute Guckenheimer's bifurcation points of a known type at connections of Mandelbrot bulbs and roots of newborn bulbs. Minimal bifurcation polynomials of d-cycles can be computed by this method. The characteristic polynomial for the Mandelbrot map transforms to the logistic map characteristic polynomial by a parameter change, since the maps are topologically equivalent. Fold bifurcation points of the logistic map are roots of the characteristic polynomials (more precisely their proper factors) for lambda = 1 and flip bifurcation points for lambda = -1. For k = 8 and lambda = -1 the worksheet computes the bifurcation polynomial for the B4 point of the logistic map. Since the basis have 36 cyclic polynomials, it computes determinant 36x36. Compared to the Groebner Basis method (see Kotsireas, Ilias S., and Kostas Karamanos. "Exact computation of the bifurcation point B4 of the logistic map and the Bailey-Broadhurst conjectures." International Journal of Bifurcation and Chaos 14.07 (2004): 2417-2423.) this method is relatively rapid (around 90 seconds, depending on the computer performance). The procedure matrixT with argument k (length of the cycle) is restricted to 150 polynomials in the cyclic basis to avoid time consuming operations, but you can change it. The same worksheet for the cubic Mandelbrot map z^3+alpha works analogously and computes the structure in the basis of dimension 130, but it takes more time to compute.<img src="https://www.maplesoft.com/view.aspx?si=154515/logisticMandelbrot.jpg" alt="Structured characteristic and bifurcation polynomials for polynomial maps" style="max-width: 25%;" align="left"/>The worksheet computes linear transformation matrix T and its characteristic polynomial that belongs to a given polynomial map F (at least degree 2 in z) that can depend on parameters. The fastest computations are for the Mandelbrot map z^2+alpha, but other polynomial can be used. Matrix T represents multiplication by derivative of the map in a certain cyclic polynomial basis, the vector space that it works in is a cyclic polynomial factor ring according to ideal that belongs to k-cycles. The basis is chosen in a proper way to structure the matrix T into blocks that belong to cycle branches of known period d, d|k. The d-cycle branches degenerate at izolated parameter values with lambda = 1, where branches cross, so we can compute Guckenheimer's bifurcation points of a known type at connections of Mandelbrot bulbs and roots of newborn bulbs. Minimal bifurcation polynomials of d-cycles can be computed by this method. The characteristic polynomial for the Mandelbrot map transforms to the logistic map characteristic polynomial by a parameter change, since the maps are topologically equivalent. Fold bifurcation points of the logistic map are roots of the characteristic polynomials (more precisely their proper factors) for lambda = 1 and flip bifurcation points for lambda = -1. For k = 8 and lambda = -1 the worksheet computes the bifurcation polynomial for the B4 point of the logistic map. Since the basis have 36 cyclic polynomials, it computes determinant 36x36. Compared to the Groebner Basis method (see Kotsireas, Ilias S., and Kostas Karamanos. "Exact computation of the bifurcation point B4 of the logistic map and the Bailey-Broadhurst conjectures." International Journal of Bifurcation and Chaos 14.07 (2004): 2417-2423.) this method is relatively rapid (around 90 seconds, depending on the computer performance). The procedure matrixT with argument k (length of the cycle) is restricted to 150 polynomials in the cyclic basis to avoid time consuming operations, but you can change it. The same worksheet for the cubic Mandelbrot map z^3+alpha works analogously and computes the structure in the basis of dimension 130, but it takes more time to compute.https://www.maplesoft.com/applications/view.aspx?SID=154515&ref=FeedSat, 02 Feb 2019 05:00:00 ZLenka PribylovaLenka PribylovaMaplet pour creer des forteresses en Etoile
https://www.maplesoft.com/applications/view.aspx?SID=154513&ref=Feed
Cette maplet permet de rajouter sur chaque étoile imbriquée des "pointes" entre deux branches pour former des sortes de forteresses.
Le i eme "rapport1" x le rayon "interne" de la i eme etoile est egale a la distance et l'extremité d'une de ses pointes.
Le i eme "rapport2" x la longueur du coté d'une branche de la i eme etoile est egale à la longueur entre un point de base de la branche et le point de base de la "pointe".
"rapport-distance entre les etoiles" x le rayon "interne" de la i ème etoile est egale au rayon "externe" de la (i+1) ème etoile imbriquée.
"rapport1" et "rapport2" sont des sequences comme pour "angle des branches de l'étoiles".<img src="https://www.maplesoft.com/view.aspx?si=154513/forteresse-etoile.gif" alt="Maplet pour creer des forteresses en Etoile" style="max-width: 25%;" align="left"/>Cette maplet permet de rajouter sur chaque étoile imbriquée des "pointes" entre deux branches pour former des sortes de forteresses.
Le i eme "rapport1" x le rayon "interne" de la i eme etoile est egale a la distance et l'extremité d'une de ses pointes.
Le i eme "rapport2" x la longueur du coté d'une branche de la i eme etoile est egale à la longueur entre un point de base de la branche et le point de base de la "pointe".
"rapport-distance entre les etoiles" x le rayon "interne" de la i ème etoile est egale au rayon "externe" de la (i+1) ème etoile imbriquée.
"rapport1" et "rapport2" sont des sequences comme pour "angle des branches de l'étoiles".https://www.maplesoft.com/applications/view.aspx?SID=154513&ref=FeedThu, 24 Jan 2019 05:00:00 Zxavier cormierxavier cormierMaplet pour créer une Etoile
https://www.maplesoft.com/applications/view.aspx?SID=154511&ref=Feed
Cette Maplet permet de dessiner des étoiles en fonction du rayon de l'étoile,l'angle de ses branches,et le nombre de branches.On peut sauvegarder l'étoile en fichier .gif.C'est une application du théorème d'Al-Kashi.<img src="https://www.maplesoft.com/view.aspx?si=154511/etoile.gif" alt="Maplet pour créer une Etoile" style="max-width: 25%;" align="left"/>Cette Maplet permet de dessiner des étoiles en fonction du rayon de l'étoile,l'angle de ses branches,et le nombre de branches.On peut sauvegarder l'étoile en fichier .gif.C'est une application du théorème d'Al-Kashi.https://www.maplesoft.com/applications/view.aspx?SID=154511&ref=FeedTue, 15 Jan 2019 05:00:00 Zxavier cormierxavier cormierSolving the 15-puzzle
https://www.maplesoft.com/applications/view.aspx?SID=154509&ref=Feed
The 15-puzzle is a classic "sliding tile" puzzle that consists of tiles arranged in a 4 by 4 grid with one tile missing. The objective is to arrange the tiles in a sorted order only by making moves that slide a tile into the empty space. In this worksheet we demonstrate how this puzzle can be solved by encoding its rules into Boolean logic and using Maple's SAT solver.<img src="https://www.maplesoft.com/applications/images/app_image_blank_lg.jpg" alt="Solving the 15-puzzle" style="max-width: 25%;" align="left"/>The 15-puzzle is a classic "sliding tile" puzzle that consists of tiles arranged in a 4 by 4 grid with one tile missing. The objective is to arrange the tiles in a sorted order only by making moves that slide a tile into the empty space. In this worksheet we demonstrate how this puzzle can be solved by encoding its rules into Boolean logic and using Maple's SAT solver.https://www.maplesoft.com/applications/view.aspx?SID=154509&ref=FeedWed, 19 Dec 2018 05:00:00 ZCurtis BrightCurtis BrightInteractive Sudoku
https://www.maplesoft.com/applications/view.aspx?SID=154507&ref=Feed
This worksheet contains an interactive Sudoku game that allows one to play a game of Sudoku in Maple. New puzzles can be randomly generated, read from a file, or loaded an online source, and puzzles can be automatically solved.
No knowledge of Sudoku solving or puzzle generation was used in the implementation. Instead, the rules of Sudoku were encoded into Boolean logic and Maple's built-in SAT solver was used; source code and implementation details are included.<img src="https://www.maplesoft.com/view.aspx?si=154507/suduko.png" alt="Interactive Sudoku" style="max-width: 25%;" align="left"/>This worksheet contains an interactive Sudoku game that allows one to play a game of Sudoku in Maple. New puzzles can be randomly generated, read from a file, or loaded an online source, and puzzles can be automatically solved.
No knowledge of Sudoku solving or puzzle generation was used in the implementation. Instead, the rules of Sudoku were encoded into Boolean logic and Maple's built-in SAT solver was used; source code and implementation details are included.https://www.maplesoft.com/applications/view.aspx?SID=154507&ref=FeedMon, 03 Dec 2018 05:00:00 ZCurtis BrightCurtis BrightFord and Fulkerson's Max-Flow Algorithm
https://www.maplesoft.com/applications/view.aspx?SID=154503&ref=Feed
The Ford-Fulkerson algorithm is a method to solve the maximum flow problem in a connected weighted network. Proposes to look for routes in a network in which the flow can be increased, until the flow is reached maximum flow. The idea is to find a route of penetration with a net positive flow that links the origin and destination nodes.
<br>
This work is part of a project in the master's degree in financial optimization destined to be used as didactic material in courses related to graph theory.<img src="https://www.maplesoft.com/view.aspx?si=154503/Imagen1.png" alt="Ford and Fulkerson's Max-Flow Algorithm" style="max-width: 25%;" align="left"/>The Ford-Fulkerson algorithm is a method to solve the maximum flow problem in a connected weighted network. Proposes to look for routes in a network in which the flow can be increased, until the flow is reached maximum flow. The idea is to find a route of penetration with a net positive flow that links the origin and destination nodes.
<br>
This work is part of a project in the master's degree in financial optimization destined to be used as didactic material in courses related to graph theory.https://www.maplesoft.com/applications/view.aspx?SID=154503&ref=FeedFri, 30 Nov 2018 05:00:00 ZJorge Alberto CalvilloJorge Alberto CalvilloClique Finding with SAT
https://www.maplesoft.com/applications/view.aspx?SID=154502&ref=Feed
A clique of a graph is a subset of its vertices that are all mutually connected. Finding a clique of a given size in a graph is a difficult problem in general.
In this worksheet we demonstrate how to solve the clique finding problem by translating it into Boolean logic and using Maple's built-in efficient SAT solver. This approach even can out-perform the built-in Maple function FindClique which also solves the clique finding problem.<img src="https://www.maplesoft.com/view.aspx?si=154502/graph20.png" alt="Clique Finding with SAT" style="max-width: 25%;" align="left"/>A clique of a graph is a subset of its vertices that are all mutually connected. Finding a clique of a given size in a graph is a difficult problem in general.
In this worksheet we demonstrate how to solve the clique finding problem by translating it into Boolean logic and using Maple's built-in efficient SAT solver. This approach even can out-perform the built-in Maple function FindClique which also solves the clique finding problem.https://www.maplesoft.com/applications/view.aspx?SID=154502&ref=FeedThu, 15 Nov 2018 05:00:00 ZCurtis BrightCurtis BrightFinding Graeco-Latin Squares
https://www.maplesoft.com/applications/view.aspx?SID=154499&ref=Feed
A Latin square is an n by n arrangement of n items such that each item appears exactly once in each row and column. A Graeco-Latin square is a pair of two Latin squares such that all n^2 pairs of the items arise when one square is superimposed onto the other.
In this worksheet we use Maple's built-in efficient SAT solver to find Graeco-Latin squares without using any knowledge of search algorithms or construction methods.<img src="https://www.maplesoft.com/view.aspx?si=154499/Graeco-Latin-10.png" alt="Finding Graeco-Latin Squares" style="max-width: 25%;" align="left"/>A Latin square is an n by n arrangement of n items such that each item appears exactly once in each row and column. A Graeco-Latin square is a pair of two Latin squares such that all n^2 pairs of the items arise when one square is superimposed onto the other.
In this worksheet we use Maple's built-in efficient SAT solver to find Graeco-Latin squares without using any knowledge of search algorithms or construction methods.https://www.maplesoft.com/applications/view.aspx?SID=154499&ref=FeedWed, 07 Nov 2018 05:00:00 ZCurtis BrightCurtis BrightCharacteristic (bifurcation) polynomials for Mandelbrot and logistic maps
https://www.maplesoft.com/applications/view.aspx?SID=154498&ref=Feed
The worksheet computes linear transformation matrix T and its characteristic polynomial that belongs to the Mandelbrot map and represents multiplication by derivative of the map in a certain cyclic polynomial basis. Eigenvalues of the characteristic polynomial for given k are eigenvalues of k-cycles (possibly degenerated cycles) of the Mandelbrot map. The characteristic polynomial transforms to the logistic map characteristic polynomial. Fold bifurcation points of the logistic map are roots of the polynomial for lambda = 1 and flip bifurcation points for lambda = -1. For
k = 8 and lambda = -1 it computes the bifurcation polynomial for the B4 point of the logistic map. Since the basis have 36 cyclic polynomials, it computes determinant 36x36. Compared to the Groebner Basis method (see Kotsireas, Ilias S., and Kostas Karamanos. "Exact computation of the bifurcation point B4 of the logistic map and the Bailey-Broadhurst conjectures." International Journal of Bifurcation and Chaos 14.07 (2004): 2417-2423.) used method is relatively rapid (around a minute, depending on the computer performance). The procedure matrixT with argument k - length of the cycle - is restricted to 50 polynomials in the cyclic basis to avoid overflow, but you can change it...<img src="https://www.maplesoft.com/view.aspx?si=154498/logisticMandelbrot.jpg" alt="Characteristic (bifurcation) polynomials for Mandelbrot and logistic maps" style="max-width: 25%;" align="left"/>The worksheet computes linear transformation matrix T and its characteristic polynomial that belongs to the Mandelbrot map and represents multiplication by derivative of the map in a certain cyclic polynomial basis. Eigenvalues of the characteristic polynomial for given k are eigenvalues of k-cycles (possibly degenerated cycles) of the Mandelbrot map. The characteristic polynomial transforms to the logistic map characteristic polynomial. Fold bifurcation points of the logistic map are roots of the polynomial for lambda = 1 and flip bifurcation points for lambda = -1. For
k = 8 and lambda = -1 it computes the bifurcation polynomial for the B4 point of the logistic map. Since the basis have 36 cyclic polynomials, it computes determinant 36x36. Compared to the Groebner Basis method (see Kotsireas, Ilias S., and Kostas Karamanos. "Exact computation of the bifurcation point B4 of the logistic map and the Bailey-Broadhurst conjectures." International Journal of Bifurcation and Chaos 14.07 (2004): 2417-2423.) used method is relatively rapid (around a minute, depending on the computer performance). The procedure matrixT with argument k - length of the cycle - is restricted to 50 polynomials in the cyclic basis to avoid overflow, but you can change it...https://www.maplesoft.com/applications/view.aspx?SID=154498&ref=FeedWed, 10 Oct 2018 04:00:00 ZLenka PribylovaLenka PribylovaSunspot Periodicity
https://www.maplesoft.com/applications/view.aspx?SID=154013&ref=Feed
This application will find the periodicity of sunspots with two separate approaches:
<UL>
<LI>a periodogram, which plots the frequency domain tranformation of the data
<LI>autocorrelation
</UL>
Both approaches should yield the same result.
<BR><BR>
Yearly sunspot data since 1700 is downloaded from a web-based source provided by the Royal Observatory of Belgium<img src="https://www.maplesoft.com/view.aspx?si=154013/sunspotPeriodicity.jpg" alt="Sunspot Periodicity" style="max-width: 25%;" align="left"/>This application will find the periodicity of sunspots with two separate approaches:
<UL>
<LI>a periodogram, which plots the frequency domain tranformation of the data
<LI>autocorrelation
</UL>
Both approaches should yield the same result.
<BR><BR>
Yearly sunspot data since 1700 is downloaded from a web-based source provided by the Royal Observatory of Belgiumhttps://www.maplesoft.com/applications/view.aspx?SID=154013&ref=FeedFri, 05 Oct 2018 04:00:00 ZSamir KhanSamir KhanThe n-Queens Problem
https://www.maplesoft.com/applications/view.aspx?SID=154482&ref=Feed
The n-Queens problem is to place n queens on an n by n chessboard such that no two queens are mutually attacking. We can use Maple's built-in efficient SAT solver to quickly solve this problem.<img src="https://www.maplesoft.com/view.aspx?si=154482/nQueens.PNG" alt="The n-Queens Problem" style="max-width: 25%;" align="left"/>The n-Queens problem is to place n queens on an n by n chessboard such that no two queens are mutually attacking. We can use Maple's built-in efficient SAT solver to quickly solve this problem.https://www.maplesoft.com/applications/view.aspx?SID=154482&ref=FeedThu, 04 Oct 2018 04:00:00 ZCurtis BrightCurtis BrightSolving the World's Hardest Sudoku
https://www.maplesoft.com/applications/view.aspx?SID=154483&ref=Feed
Sudoku is a popular puzzle that appears in many puzzle books and newspapers. We can use Maple's built-in efficient SAT solver to quickly solve the "world's hardest Sudoku" without any knowledge of Sudoku solving techniques.<img src="https://www.maplesoft.com/view.aspx?si=154483/72f8a9282f0b80d9423ca565563bb9d6.gif" alt="Solving the World's Hardest Sudoku" style="max-width: 25%;" align="left"/>Sudoku is a popular puzzle that appears in many puzzle books and newspapers. We can use Maple's built-in efficient SAT solver to quickly solve the "world's hardest Sudoku" without any knowledge of Sudoku solving techniques.https://www.maplesoft.com/applications/view.aspx?SID=154483&ref=FeedThu, 04 Oct 2018 04:00:00 ZCurtis BrightCurtis BrightSolving the Einstein Riddle
https://www.maplesoft.com/applications/view.aspx?SID=154484&ref=Feed
The "Einstein Riddle" is a logic puzzle apocryphally attributed to Albert Einstein and is often stated with the remark that it is only solvable by 2% of the world's population. We can solve this puzzle using Maple's built-in efficient SAT solver.<img src="https://www.maplesoft.com/view.aspx?si=154484/Einstein_Riddle.jpg" alt="Solving the Einstein Riddle" style="max-width: 25%;" align="left"/>The "Einstein Riddle" is a logic puzzle apocryphally attributed to Albert Einstein and is often stated with the remark that it is only solvable by 2% of the world's population. We can solve this puzzle using Maple's built-in efficient SAT solver.https://www.maplesoft.com/applications/view.aspx?SID=154484&ref=FeedThu, 04 Oct 2018 04:00:00 ZCurtis BrightCurtis BrightEquilibrium Positions of Two Objects Connected by Ropes
https://www.maplesoft.com/applications/view.aspx?SID=154495&ref=Feed
Two objects are connected and suspended by a system of ropes, as illustrated below.
<BR><BR>
These parameters are known
<UL>
<LI>the object weights, w1 and w2
<LI>the length of the ropes L1, L2, and L3
<LI>the anchor points (x1, y1) and (x4, y4)
</UL>
The objects positions and the rope tensions are calculated from a numeric solution of the equations that describe
<UL>
<LI>horizontal and vertical force balances
<LI>and the constraints imposed by the lengths of the ropes
</UL><img src="https://www.maplesoft.com/view.aspx?si=154495/equilibrium.png" alt="Equilibrium Positions of Two Objects Connected by Ropes" style="max-width: 25%;" align="left"/>Two objects are connected and suspended by a system of ropes, as illustrated below.
<BR><BR>
These parameters are known
<UL>
<LI>the object weights, w1 and w2
<LI>the length of the ropes L1, L2, and L3
<LI>the anchor points (x1, y1) and (x4, y4)
</UL>
The objects positions and the rope tensions are calculated from a numeric solution of the equations that describe
<UL>
<LI>horizontal and vertical force balances
<LI>and the constraints imposed by the lengths of the ropes
</UL>https://www.maplesoft.com/applications/view.aspx?SID=154495&ref=FeedThu, 04 Oct 2018 04:00:00 ZSamir KhanSamir KhanCenter and Radius of Sphere Given Four Points
https://www.maplesoft.com/applications/view.aspx?SID=154492&ref=Feed
This application will derive symbolic expressions that gives the center point (xc, yc, zc) and radius r of a sphere whose surface passes through four known (but symbolic) points (x1, y1), (x2, y2), (x3, y3) and (x4, y4).
<BR><BR>
The solve command is used to rearrange some seemingly simple equations. The resulting equations, however, are large, and would be difficult to derive by hand. This demonstrates Maple's utility in deriving and manipulating large symbolic expressions.<img src="https://www.maplesoft.com/view.aspx?si=154492/centerradius.jpg" alt="Center and Radius of Sphere Given Four Points" style="max-width: 25%;" align="left"/>This application will derive symbolic expressions that gives the center point (xc, yc, zc) and radius r of a sphere whose surface passes through four known (but symbolic) points (x1, y1), (x2, y2), (x3, y3) and (x4, y4).
<BR><BR>
The solve command is used to rearrange some seemingly simple equations. The resulting equations, however, are large, and would be difficult to derive by hand. This demonstrates Maple's utility in deriving and manipulating large symbolic expressions.https://www.maplesoft.com/applications/view.aspx?SID=154492&ref=FeedWed, 03 Oct 2018 04:00:00 ZSamir KhanSamir KhanThermal Engineering with Maple – Application Collection
https://www.maplesoft.com/applications/view.aspx?SID=154123&ref=Feed
This e-book contains many Maple applications covering topics in thermodynamics, including combustion, psychrometric modeling, refrigeration, heat transfer and more. With practical examples, it demonstrates how you can use Maple to solve various problems in thermal engineering.
<BR><BR>
Maple’s thermophysical and thermodymamic data library is used throughout; if you change the working fluid or operating conditions, Maple updates the application with accurate physical properties.
<BR><BR>
You can explore the e-book using the Navigator or the table of contents.
<BR><BR>
These applications are packaged together in the Workbook file format. You will need Maple 2018 (or later) to use this workbook. If you do not have Maple 2018, download the <A HREF="http://www.maplesoft.com/products/maple/Mapleplayer/">free Maple Player</A> to view the applications and interact with a select few.
<B<img src="https://www.maplesoft.com/view.aspx?si=154123/thermal_1018.png" alt="Thermal Engineering with Maple – Application Collection" style="max-width: 25%;" align="left"/>This e-book contains many Maple applications covering topics in thermodynamics, including combustion, psychrometric modeling, refrigeration, heat transfer and more. With practical examples, it demonstrates how you can use Maple to solve various problems in thermal engineering.
<BR><BR>
Maple’s thermophysical and thermodymamic data library is used throughout; if you change the working fluid or operating conditions, Maple updates the application with accurate physical properties.
<BR><BR>
You can explore the e-book using the Navigator or the table of contents.
<BR><BR>
These applications are packaged together in the Workbook file format. You will need Maple 2018 (or later) to use this workbook. If you do not have Maple 2018, download the <A HREF="http://www.maplesoft.com/products/maple/Mapleplayer/">free Maple Player</A> to view the applications and interact with a select few.
<Bhttps://www.maplesoft.com/applications/view.aspx?SID=154123&ref=FeedTue, 02 Oct 2018 04:00:00 ZSamir KhanSamir KhanMedallion and Frieze Patterns
https://www.maplesoft.com/applications/view.aspx?SID=154491&ref=Feed
Bruijn (1991) describes a sequence that can be used to generate visualizations that look like medallions and friezes. Here, we implement the algorithm in Maple, and reproduce the visualizations from Bruijn (1991)
<BR><BR>
Arithmetical medallions and friezes, Nieuw Archief Wiskunde, de Bruijn, N. G., (4) vol 9 (1991) 339-350<img src="https://www.maplesoft.com/view.aspx?si=154491/medallion.png" alt="Medallion and Frieze Patterns" style="max-width: 25%;" align="left"/>Bruijn (1991) describes a sequence that can be used to generate visualizations that look like medallions and friezes. Here, we implement the algorithm in Maple, and reproduce the visualizations from Bruijn (1991)
<BR><BR>
Arithmetical medallions and friezes, Nieuw Archief Wiskunde, de Bruijn, N. G., (4) vol 9 (1991) 339-350https://www.maplesoft.com/applications/view.aspx?SID=154491&ref=FeedMon, 01 Oct 2018 04:00:00 ZSamir KhanSamir KhanIdentificacion de ecuaciones de paraboloides
https://www.maplesoft.com/applications/view.aspx?SID=154490&ref=Feed
Esta hoja permite al alumno entrenar su razonamiento para identificar la ecuación correspondiente a cada uno de los distintos paraboloides mostrados en la misma, entre un conjunto de opciones de respuesta.
<BR><BR>
Se enfatiza, a través de un ejemplo, que el estudiante debe observar aspectos como orientación del paraboloide, coordenadas del vértice, entre otros, para tratar de deducir la ecuación que le corresponde, entre un conjunto de opciones.
<BR><BR>
Al final de la hoja se proporcionan las respuestas a los ejercicios propuestos.<img src="https://www.maplesoft.com/view.aspx?si=154490/Figura_12.png" alt="Identificacion de ecuaciones de paraboloides" style="max-width: 25%;" align="left"/>Esta hoja permite al alumno entrenar su razonamiento para identificar la ecuación correspondiente a cada uno de los distintos paraboloides mostrados en la misma, entre un conjunto de opciones de respuesta.
<BR><BR>
Se enfatiza, a través de un ejemplo, que el estudiante debe observar aspectos como orientación del paraboloide, coordenadas del vértice, entre otros, para tratar de deducir la ecuación que le corresponde, entre un conjunto de opciones.
<BR><BR>
Al final de la hoja se proporcionan las respuestas a los ejercicios propuestos.https://www.maplesoft.com/applications/view.aspx?SID=154490&ref=FeedTue, 18 Sep 2018 04:00:00 ZRanferi GutierrezRanferi GutierrezHybrid Image of a Cat and a Dog
https://www.maplesoft.com/applications/view.aspx?SID=154489&ref=Feed
This application merges images of a cat and a dog to create a hybrid image with an unusual property.
<UL>
<LI>When you view the image from arm's length, you see a cat.
<LI>However, if you move further away (or reduce the size of the image), you see a dog.
</UL>
<P>
To create the image, the high spatial frequency data from an image of a cat is added to the low spatial frequency data from an image of a dog.
<P>
This approach was pioneered by Oliva et al. (2006), and is based on the multiscale processing of human vision.
<UL>
<LI>When we view objects near us, we see fine detail (that is, higher spatial frequencies dominate).
<LI>However, when we view objects at a distance, the broad outline has greater influence (that is, lower spatial frequencies dominate).
</UL><img src="https://www.maplesoft.com/view.aspx?si=154489/catdog.png" alt="Hybrid Image of a Cat and a Dog" style="max-width: 25%;" align="left"/>This application merges images of a cat and a dog to create a hybrid image with an unusual property.
<UL>
<LI>When you view the image from arm's length, you see a cat.
<LI>However, if you move further away (or reduce the size of the image), you see a dog.
</UL>
<P>
To create the image, the high spatial frequency data from an image of a cat is added to the low spatial frequency data from an image of a dog.
<P>
This approach was pioneered by Oliva et al. (2006), and is based on the multiscale processing of human vision.
<UL>
<LI>When we view objects near us, we see fine detail (that is, higher spatial frequencies dominate).
<LI>However, when we view objects at a distance, the broad outline has greater influence (that is, lower spatial frequencies dominate).
</UL>https://www.maplesoft.com/applications/view.aspx?SID=154489&ref=FeedTue, 11 Sep 2018 04:00:00 ZSamir KhanSamir KhanPolynomizing Lukasiewicz's Many-Valued Logics by Maple
https://www.maplesoft.com/applications/view.aspx?SID=154488&ref=Feed
Maple Procedures are presented to express propositions and connectives of propositional Lukasiewicz's n-valued logic for n≤4 in terms of certain polynomials. Evaluations and checking of tautologies are done by procedures based on Groebner’s bases.<img src="https://www.maplesoft.com/applications/images/app_image_blank_lg.jpg" alt="Polynomizing Lukasiewicz's Many-Valued Logics by Maple" style="max-width: 25%;" align="left"/>Maple Procedures are presented to express propositions and connectives of propositional Lukasiewicz's n-valued logic for n≤4 in terms of certain polynomials. Evaluations and checking of tautologies are done by procedures based on Groebner’s bases.https://www.maplesoft.com/applications/view.aspx?SID=154488&ref=FeedMon, 10 Sep 2018 04:00:00 ZKahtan H. AlzubaidyKahtan H. Alzubaidy