No Arabic abstract
REC (Regular Expression Compiler) is a concise programming language development in mayor Mexican Universities at end of 60s which allows students to write programs without knowledge of the complicated syntax of languages like FORTRAN and ALGOL. The language is recursive and contains only four elements for control. This paper describes use of the interpreter of REC written in FORTRAN on IBM1130 Simulator from -Computer History Simulation- Project.
REC (REGULAR EXPRESSION COMPILER) is a programming language of simple structure developed originally for the PDP-8 computer of the Digital Equipment, Corporation, but readily adaptable to any other general purpose computer. It has been used extensively in teaching Algebra and Numerical Analysis in the Escuela Superior de Fisica y Matematicas of the Instituto Politecnico Nacional. Moreover, the fact that the same control language, REC, is equally applicable and equally efficient over the whole range of computer facilities available to the students gives a very welcome coherence to the entire teaching program, including the course of Mathematical Logic which is devoted to the theoretical aspects of such matters. REC; derives its appeal from the fact that computers can be regarded reasonably well as Turing Machines. The REC notation is simply a manner of writing regular expression, somewhat more amenable to programming the Turing Machine which they control. If one does not wish to think so strictly in terms of Turing Machines, REC expressions still provide a means of defining the flow of control in a program which is quite convenient for many applications.
A modification to the gnomonic factor using the concept of triangle of Plato is presented. With the aid of the platonic gnomonic factor (fgp) as we called it, we find that the oracles mentioned by Herodotus in his History, Dodona in Greece and Ammon in Oasis Siwa, Libya, were placed there because the noon shadow of Sun of a gnomon formed, back in 2500BC, the triangle of Plato the former, and the Egyptian sacred triangle the latter. This means that both concepts were known by Egyptians form Thebes long before they were formalized by the Greeks. The right angled triangle concept is an idealization, as said by D. Magdolen, of an astronomical observation; i. e. it is the shadow cast by a gnomon. ----- Se presenta una modificacion al factor gnomonico usando el concepto de triangulo de Platon. Con la ayuda de lo que llamamos factor gnomonico platonico (fgp) nosotros encontramos que los oraculos mencionados por Herodoto en su Historia, Dodona en Grecia, y Ammon en el Oasis Siwa, Libia, fueron ubicados ahi porque, hacia el anio 2500AC, la sombra proyectada por un gnomon vertical formo el triangulo de Platon en el primero y el triangulo sagrado Egipcio el ultimo. Esto significa que ambos conceptos eran conocidos por los Egipcios de Tebas, a decir de Herodoto, bastante antes de estos fueran formalizados por los griegos. El concepto de triangulo rectangulo seria la idealizacion, como dice D. Magdolen, de una observacion astronomica; esto es, la proyeccion de la sombra por un gnomon.
This paper presents a finite-volume method, together with fully adaptive multi-resolution scheme to obtain spatial adaptation, and a Runge-Kutta-Fehlberg scheme with a local time-varying step to obtain temporal adaptation, to solve numerically the known bidominio equations that model the electrical activity of the tissue in the myocardium. Two simple models are considered for membrane flows and ionic currents. First we define an approximate solution and we verify its convergence to the corresponding weak solution of the continuum problem, obtaining in this way an alternative demonstration that the continuum problem is well-posed. Next we introduce the multiresolution technique and derive an optimal noise reduction threshold. The efficiency and precision of our method is seen in the reduction of machine time, memory usage, and errors in comparison to other methods. ----- En este trabajo se presenta un metodo de volumenes finitos enriquecido con un esquema de multiresolucion completamente adaptativo para obtener adaptatividad espacial, y un esquema Runge-Kutta-Fehlberg con paso temporal de variacion local para obtener adaptatividad temporal, para resolver numericamente las conocidas ecuaciones bidominio que modelan la actividad electrica del tejido en el miocardio. Se consideran dos modelos simples para las corrientes de membrana y corrientes ionicas. En primer lugar definimos una solucion aproximada y nos referimos a su convergencia a la correspondiente solucion debil del problema continuo, obteniendo de este modo una demostracion alternativa de que el problema continuo es bien puesto. Luego de introducir la tecnica de multiresolucion, se deriva un umbral optimo para descartar la informacion no significativa, y tanto la eficiencia como la precision de nuestro metodo es vista en terminos de la aceleracion de tiempo de maquina, compresion de memoria computacional y errores en diferentes normas.
Institutional repositories are deposits of different types of digital files for access, disseminate and preserve them. This paper aims to explain the importance of repositories in the academic field of engineering as a way to democratize knowledge by teachers, researchers and students to contribute to social and human development. These repositories, usually framed in the Open Access Initiative, allow to ensure access free and open (unrestricted legal and economic) to different sectors of society and, thus, can make use of the services they offer. Finally, that repositories are evolving in the academic and scientific, and different disciplines of engineering should be prepared to provide a range of services through these systems to society of today and tomorrow.
An alternative definition of the concept is given of functional dependence among the attributes of the relational schema in the Relational Model, this definition is obtained in terms of the set theory. For that which a theorem is demonstrated that establishes equivalence and on the basis theorem an algorithm is built for the search of the functional dependences among the attributes. The algorithm is illustrated by a concrete example