|
|
| Line 1: |
Line 1: |
| {{orphan|date = April 2012}}
| | Buenas tardes mi nombre es Luz y estoy en Asturias y soy una mama primeriza que me he enterado que muchas fabricantes entregan miniprestamos del prestamo con el fin de ser valorados por los padres y así decidir si quieren comprarlos para su prestamo<br><br>my blog; [https://www.academia.edu/8887747/Prestamos_Rapidos_Online https://www.academia.edu/8887747/Prestamos_Rapidos_Online] |
| | |
| '''Network operator matrix (NOM)''' is a representation of [[mathematical expression]]s in [[computer memory]].
| |
| | |
| NOM is a new approach to the problem of automatic search of mathematical equations. The researcher defines the sets of operations, variables and parameters.<ref>Diveyev A.I., Sofronova E.A. Application of network operator method for synthesis of optimal structure and parameters of automatic control system. ''Proceedings of 17-th IFAC World Congress'', Seoul, Korea 05 – 12 July 2008</ref> The computer program generates a number of mathematical equations that satisfy given restrictions. Then the optimization [[algorithm]] finds the structure of appropriate mathematical expression and its parameters.
| |
| [[File:Graph1 for mathematical expression1 reduced.JPG|thumb|Fig. 1. Graph for Expression 1]]
| |
| Network operator is a directed graph that corresponds to some mathematical expressions. Every source [[Node (computer science)|nodes]] of the graph are variables or constants of mathematical expression, inner nodes correspond to [[binary operation]]s and edges correspond to unary operations. The calculation’s result of mathematical expression is kept in the last sink node.<ref>{{cite web|title=Network Operator|url=http://www.network-operator.com/papers.php|publisher=Network Operator, Inc|accessdate=24 January 2012}}</ref>
| |
| | |
| ==Example==
| |
| | |
| Consider the following mathematical expression
| |
| {{NumBlk|:|<math>y = x_1 + \sin (x_1) + q_1 x_1 e^{-x_2}</math>|{{EquationRef|1}}}}
| |
| | |
| The graph for Expression ({{EquationNote|1}}), is presented in Fig. 1.
| |
| | |
| On the edges we place [[unary operation]]s
| |
| | |
| <math>\rho_1(z)= z \, ;</math><br>
| |
| <math>\rho_3(z)= -z \,;</math><br>
| |
| <math>\rho_6(n) =
| |
| \begin{cases}
| |
| \varepsilon\!^{ -1}, & \text{if }z>\ln \varepsilon \!\\
| |
| e^z, & \text{ otherwise}
| |
| \end{cases}
| |
| ;</math> <br>
| |
| <math>\rho_{12}(z)= \sin z \,;</math>
| |
| <br>
| |
| <br>
| |
| In the inner and sink nodes we place binary operations<br>
| |
| <math>\chi_0(z',z'')= z'+z'' \, ;</math><br>
| |
| <math>\chi_1(z',z'')= z' \times z'' \, ;</math>
| |
| | |
| Expression 1 can be presented in the PC memory as a NOM
| |
| | |
| : <math>\Psi = \begin{bmatrix} | |
| 0 & 0 & 0 & 1 & 1 & 0 & 0 & 12 \\
| |
| 0 & 0 & 0 & 0 & 1 & 0 & 0 & 0 \\
| |
| 0 & 0 & 0 & 0 & 0 & 3 & 0 & 0 \\
| |
| 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 \\
| |
| 0 & 0 & 0 & 0 & 1 & 0 & 1 & 0 \\
| |
| 0 & 0 & 0 & 0 & 0 & 0 & 6 & 0 \\
| |
| 0 & 0 & 0 & 0 & 0 & 0 & 1 & 1 \\
| |
| 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0
| |
| \end{bmatrix}</math>
| |
| | |
| Any mathematical expression can be presented as a network operator matrix.<ref>A.I. Diveev, E.A. Sofronova The synthesis of optimal control system by the network operator method ''IFAC Workshop on Control Applications and Optimization, CAO’09'', 6–8 May, University of Jyväskylä, Agora, Finland.</ref><ref>Diveev A.I., Sofronova E.A. Numerical method of network operator for multi-objective synthesis of optimal control system, ''Proceedings of 7-th International Conference on Control and Automation (ICCA’09)'', Christchurch, New Zealand, December 9–11, 2009.</ref><ref>Diveev A.I. A multiobjective synthesis of optimal control system by the network operator method. ''Proceedings of international conference «Optimization and applications» (OPTIMA 2009)'', Petrovac, Montenegro, September 21–25, 2009</ref><ref>{{cite web|title=A.I. Diveev, E.A. Sofronova The Network Operator Method for Search of the Most Suitable Mathematical equation // Bio-inspired computational algorithms and their applications.|url=http://www.intechopen.com/books/bio-inspired-computational-algorithms-and-their-applications/the-network-operator-method-for-search-of-the-most-suitable-mathematical-equation|publisher=Soft_NOM, Inc|accessdate=7 March 2012}}</ref>
| |
| <br>
| |
| To calculate the mathematical expression by the network operator matrix the node vector is used.
| |
| <br>
| |
| Each component of node vector corresponds to the nodes of the network operator graph. Initially each component is equal to the argument for the given node or the unit element of binary operation.
| |
| <br>
| |
| For addition and multiplication the number of operation equals its unit element. For addition it is 0, for multiplication it is 1.
| |
| The node vector for the given example<br>
| |
| <br>
| |
| <math>\mathbf{z}=[x_1\ q_1\ x_2\ 0\ 1\ 0\ 1\ 0]^T</math><br>
| |
| <br>
| |
| The calculation by matrix <math>\Psi </math> is performed for nonzero nondaigonal elements <math>\psi_{(i,j)}\neq 0</math> by <br>
| |
| <br>
| |
| <math>z_j=\chi_{\psi_{j,j}}(z_j,\rho_{\psi_{i,j}}(z_i))</math>
| |
| | |
| Follow the rows of the matrix.<br>
| |
| For the Row 1 we have <math>\psi_{1,4}=1</math>, that is <math>i=1</math>, <math>j=4</math>, <math>\psi_{j,j}=\psi_{4,4}=0</math>.
| |
| | |
| Take arguments from <math>\mathbf{z}=[x_1\ q_1\ x_2\ 0\ 1\ 0\ 1\ 0]^T</math>
| |
| | |
| <math>z_1=x_1</math>, <math>z_4=0</math> then <br>
| |
| <br>
| |
| <math>z_4=\chi_{\psi_{4,4}}(z_4,\rho_{\psi_{1,4}}(z_1))=\chi_0(z_4,\rho_1(z_1))=0+x_1=x_1</math><br>
| |
| <br>
| |
| Further in Row 1 we have <math>\psi_{1,5}=1</math><br>
| |
| <br>
| |
| <math>z_5=\chi_{\psi_{5,5}}(z_5,\rho_{\psi_{1,5}}(z_1))=\chi_1(z_5,\rho_1(z_1))=1\times x_1=x_1</math><br>
| |
| <br>
| |
| <math>\psi_{1,8}=12</math><br>
| |
| <br>
| |
| <math>z_8=\chi_{\psi_{8,8}}(z_8,\rho_{\psi_{1,8}}(z_1))=\chi_0(z_8,\rho_{12}(z_1))=0+\sin x_1=\sin x_1</math>.<br>
| |
| <br>
| |
| As a result after Row 1 we have <math>\mathbf{z}=[x_1\ q_1\ x_2\ x_1\ x_1\ 0\ 1\ \sin x_1]^T</math>.<br>
| |
| <br>
| |
| For the Row 2 we have
| |
| <math>\psi_{2,5}=1</math>
| |
| <br>
| |
| <math>z_5=\chi_{\psi_{5,5}}(z_5,\rho_{\psi_{2,5}}(z_2))=\chi_1(z_5,\rho_{1}(z_1))=x_1q_1</math><br>
| |
| <br>
| |
| then follow the rows
| |
| | |
| <math>\psi_{3,6}=3</math><br>
| |
| <math>z_6=\chi_{\psi_{6,6}}(z_6,\rho_{\psi_{3,6}}(z_3))=\chi_0(z_6,\rho_{3}(z_3))=0+(-x_2)=-x_2</math><br>
| |
| <br>
| |
| <br>
| |
| <math>\psi_{4,8}=1</math><br>
| |
| <br>
| |
| <math>z_8=\chi_{\psi_{8,8}}(z_8,\rho_{\psi_{4,8}}(z_4))=\chi_0(z_8,\rho_{1}(z_4))=\sin x_1+x_1</math><br>
| |
| <br>
| |
| <br>
| |
| <math>\psi_{5,7}=1</math><br>
| |
| <br>
| |
| <math>z_7=\chi_{\psi_{7,7}}(z_7,\rho_{\psi_{5,7}}(z_5))=\chi_1(z_7,\rho_{1}(z_5))=1x_1q_1=x_1q_1</math><br>
| |
| <br>
| |
| <br>
| |
| <math>\psi_{6,7}=6</math><br>
| |
| <br>
| |
| <math>z_7=\chi_{\psi_{7,7}}(z_7,\rho_{\psi_{6,7}}(z_6))=\chi_1(z_7,\rho_{6}(z_6))=x_1q_1e^{-x_2}</math><br>
| |
| <br>
| |
| <br>
| |
| <math>\psi_{7,8}=1</math><br>
| |
| <br>
| |
| <math>z_8=\chi_{\psi_{8,8}}(z_8,\rho_{\psi_{7,8}}(z_7))=\chi_0(z_8,\rho_{1}(z_7))=\sin x_1+x_1+x_1q_1e^{-x_2}</math>.
| |
| | |
| == References ==
| |
| {{reflist}}
| |
| | |
| [[Category:Matrices]]
| |