All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 27 Next

Displaying 521 – 540 of 572

Showing per page

Un algoritmo de descomposición de funciones racionales mediante polinomios casi-separados.

César Alonso, Jaime Gutiérrez, Tomás Recio (1996)

Extracta Mathematicae

Dado un polinomio f perteneciente a K[x], determinar si existen otros dos g y h de grado mayor que uno tales que f(x) = g(h(x)) = g o h, y, en caso de que existan, encontrarlos, es conocido como problema de descomposición para polinomios. Cuando dicha descomposición existe, problemas como la evaluación de f en un punto o la resolución de la ecuación f = 0 se pueden resolver de manera más simple. La generalización del problema de la descomposición al caso de funciones racionales es sin duda un problema...

Unified computational approach to nilpotent algebra classification problems

Shirali Kadyrov, Farukh Mashurov (2021)

Communications in Mathematics

In this article, we provide an algorithm with Wolfram Mathematica code that gives a unified computational power in classification of finite dimensional nilpotent algebras using Skjelbred-Sund method. To illustrate the code, we obtain new finite dimensional Moufang algebras.

Unit rectangle visibility graphs.

Dean, Alice M., Ellis-Monaghan, Joanna A., Hamilton, Sarah, Pangborn, Greta (2008)

The Electronic Journal of Combinatorics [electronic only]

Using symbolic computation in the characterization of frictional instabilities involving orthotropic materials

Mohamed A. Agwa, António Pinto da Costa (2015)

International Journal of Applied Mathematics and Computer Science

The present work addresses the problem of determining under what conditions the impending slip state or the steady sliding of a linear elastic orthotropic layer or half space with respect to a rigid flat obstacle is dynamically unstable. In other words, we search the conditions for the occurrence of smooth exponentially growing dynamic solutions with perturbed initial conditions arbitrarily close to the steady sliding state, taking the system away from the equilibrium state or the steady sliding...

What is the inverse of repeated square and multiply algorithm?

H. Gopalkrishna Gadiyar, K. M. Sangeeta Maini, R. Padma, Mario Romsy (2009)

Colloquium Mathematicae

It is well known that the repeated square and multiply algorithm is an efficient way of modular exponentiation. The obvious question to ask is if this algorithm has an inverse which would calculate the discrete logarithm and what is its time compexity. The technical hitch is in fixing the right sign of the square root and this is the heart of the discrete logarithm problem over finite fields of characteristic not equal to 2. In this paper a couple of probabilistic algorithms to compute the discrete...

Wildfires identification: Semantic segmentation using support vector machine classifier

Pecha, Marek, Langford, Zachary, Horák, David, Tran Mills, Richard (2023)

Programs and Algorithms of Numerical Mathematics

This paper deals with wildfire identification in the Alaska regions as a semantic segmentation task using support vector machine classifiers. Instead of colour information represented by means of BGR channels, we proceed with a normalized reflectance over 152 days so that such time series is assigned to each pixel. We compare models associated with 𝓁 1 -loss and 𝓁 2 -loss functions and stopping criteria based on a projected gradient and duality gap in the presented benchmarks.

WWW-based Boolean function minimization

Sebastian Tomaszewski, Ilgaz Celik, George Antoniou (2003)

International Journal of Applied Mathematics and Computer Science

In this paper a Boolean minimization algorithm is considered and implemented as an applet in Java. The application is based on the Quine-McCluskey simplification technique with some modifications. The given application can be accessed on line since it is posted on the World Wide Web (WWW), with up to four variables, at the URL http://www.csam.montclair.edu/~antoniou/bs. After extensive testing, the performance of the algorithm has been found to be excellent. The proposed application is a useful...

Currently displaying 521 – 540 of 572