2024-03-29T07:59:54Zhttps://idus.us.es/oai/requestoai:idus.us.es:11441/1149252021-06-29T08:09:22Zcom_11441_10893com_11441_10802com_11441_10690col_11441_10896
Homological perturbation theory and computability of Hochschild and cyclic homologies of CDGAs
Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
We establish an algorithm computing the homology of commutative differential graded algebras (briefly, CDGAs). The main tool in this approach is given by the Homological Perturbation Theory particularized for the algebra category (see \cite{Rea96a}). Taking into account these results, we develop and refine some methods already known about the computation of the Hochschild and cyclic homologies of CDGAs. In the last section of the paper, we analyze the $p$-local homology of the iterated bar construction of a CDGA ($p$ prime).
2021-06-29
2021-06-29
1997
info:eu-repo/semantics/conferenceObject
Álvarez Solano, V., Armario Sampalo, J.A., Real Jurado, P. y Silva Gallardo, B. (1997). Homological perturbation theory and computability of Hochschild and cyclic homologies of CDGAs. En SCCP 1997: The International Conference on Secondary Calculus and Cohomological Physic Moscow, Russia: Diffiety Institute of the Russian Academy of Natural Sciences.
https://hdl.handle.net/11441/114925
eng
SCCP 1997: The International Conference on Secondary Calculus and Cohomological Physic (1997).
https://www.emis.de/proceedings/SCCP97/10.html
Moscow, Russia
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Diffiety Institute of the Russian Academy of Natural Sciences
oai:idus.us.es:11441/691472024-02-14T08:47:45Zcom_11441_10893com_11441_10802com_11441_10690col_11441_10896
Autotopism stabilized colouring games on rook's graphs
Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
Based on the fact that every partial colouring of the rook’s graph Kr✷Ks is uniquely related to an r × s partial Latin rectangle, this work deals with the Θ-stabilized colouring game on the graph Kr✷Ks. This is a variant of the classical colouring game on finite graphs [1,2,6,7] so that each move must respect a given autotopism Θ of the resulting partial Latin rectangle. The complexity of this variant is examined by means of its Θ-stabilized game chromatic number, which depends in turn on the cycle structure of the autotopism under consideration. Based on the known classification of such cycle structures [3,4,5,8], we determine in a constructive way the game chromatic number associated to those rook’s graphs Kr✷Ks, for which r ≤ s ≤ 8.
2018-01-18
2018-01-18
2017-06-29
info:eu-repo/semantics/conferenceObject
Andres, S.D. y Falcón Ganfornina, R.M. (2017). Autotopism stabilized colouring games on rook's graphs. En The Second Malta Conference in Graph Theory and Combinatorics, Qawra, Malta.
https://hdl.handle.net/11441/69147
eng
The Second Malta Conference in Graph Theory and Combinatorics (2017),
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
oai:idus.us.es:11441/236062019-03-12T11:55:26Zcom_11441_10803com_11441_10802com_11441_10690com_11441_10893col_11441_10804col_11441_10896
Nouvelle Cuisine for the Computation of the Annihilating Ideal of $f^s$
Universidad de Sevilla. Departamento de Álgebra
Bernstein-Sato ideals
Let $f_1,\ldots, f_p$ be polynomials in ${\bf C}[x_1,\ldots, x_n]$
and let $D = D_n$ be the $n$-th Weyl algebra. The annihilating
ideal of $f^s=f_1^{s_1}\cdots f_p^{s_p}$ in
$D[s]=D[s_1,\ldots,s_p]$ is a necessary step for the computation
of the Bernstein-Sato ideals of $f_1,\ldots, f_p$.
We point out experimental differences among the efficiency of the
available methods to obtain this annihilating ideal and provide
some upper bounds for the complexity of its computation.
2015-03-27
2015-03-27
2005
info:eu-repo/semantics/bookPart
978-3-540-28966-1
http://hdl.handle.net/11441/23606
https://idus.us.es/xmlui/handle/11441/23606
eng
Gago-Vargas, J., Hartillo, I., Ucha, J.M., (2005), Nouvelle Cuisine for the Computation of the Annihilating Ideal of F^s. Computer algebra in scientific computing (CASC 2005), Lecture Notes in Computer Science. Vol. 3718. p. 162-173.
10.1007/11555964_14
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
oai:idus.us.es:11441/869292024-02-13T09:37:49Zcom_11441_10893com_11441_10802com_11441_10690col_11441_10896
Optimal domain for the Hardy operator
Universidad de Sevilla. Departamento de Matemáticas Aplicadas I
Universidad de Sevilla. FQM262: Teoría de la Aproximación
Hardy operator
2019-05-29
2019-05-29
2007
info:eu-repo/semantics/conferenceObject
Delgado Garrido, O. (2007). Optimal domain for the Hardy operator. En X Encuentros de Análisis Real y Complejo, Palma de Mallorca.
https://hdl.handle.net/11441/86929
21710216
eng
X Encuentros de Análisis Real y Complejo (2007), pp. 1-1.
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
oai:idus.us.es:11441/1264742024-02-17T17:36:07Zcom_11441_10893com_11441_10802com_11441_10690col_11441_10896
Parallel Homology Computation of Meshes
Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
Ministerio de Economía y Competitividad (MINECO). España
Agence Nationale de la Recherche. France
Homology groups computation
2D combinatorial maps
Parallel Algorithms
In this paper, we propose a method to compute, in parallel,
the homology groups of closed meshes (i.e., orientable 2D manifolds
without boundary) represented by combinatorial maps. Our experiments
illustrate the interest of our approach which is really fast on big meshes
and which obtains good speed-up when increasing the number of threads.
2021-10-06
2021-10-06
2016
info:eu-repo/semantics/conferenceObject
Damiand, G. y González Díaz, R. (2016). Parallel Homology Computation of Meshes. En CTIC 2016: 6th International Workshop on Computational Topology in Image Context (53-64), Marseille, France: Springer.
978-3-319-39440-4
0302-9743
https://hdl.handle.net/11441/126474
10.1007/978-3-319-39441-1_6
21604474
eng
CTIC 2016: 6th International Workshop on Computational Topology in Image Context (2016), pp. 53-64.
MTM2015-67072-P
SoLStiCe ANR-13-BS02-0002-01
https://link.springer.com/chapter/10.1007/978-3-319-39441-1_6
Cham, Switzerland
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Springer
oai:idus.us.es:11441/395902024-02-14T19:35:09Zcom_11441_33181com_11441_30105com_11441_11301com_11441_11290com_11441_10690com_11441_10893com_11441_10802col_11441_34361col_11441_11304col_11441_10896
Smoothing Problem in 2D Images with Tissue-like P Systems and Parallel Implementation
Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial
Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
Universidad de Sevilla. TIC193: Computación Natural
Universidad de Sevilla. FQM296: Topología Computacional y Matemática Aplicada
Smoothing is often used in Digital Imagery to reduce noise within an image.
In this paper we present a Membrane Computing algorithm for smoothing 2D images in
the framework of tissue-like P systems. The algorithm has been implemented by using a
novel device architecture called CUDATM, (Compute Unified Device Architecture). We
present some examples, compare the obtained time and present some research lines for
the future.
2016-04-06
2016-04-06
2011
info:eu-repo/semantics/conferenceObject
9788461518371
http://hdl.handle.net/11441/39590
https://idus.us.es/xmlui/handle/11441/39590
eng
Proceedings of the Ninth Brainstorming Week on Membrane Computing, 317-328. Sevilla, E.T.S. de Ingeniería Informática, 31 de enero-4 de febrero, 2011
TIN2008-04487-E
TIN-2009-13192
P08-TIC-04200
PO6-TIC-02268
MTM2009-12716
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Fénix Editora
oai:idus.us.es:11441/877962024-02-14T09:03:50Zcom_11441_10893com_11441_10802com_11441_10690col_11441_10896
Designing a Topological Algorithm for 3D Activity Recognition
Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
3D video sequence
Voxel carving
Volume reconstruction
Persistent homology
Activity recognition
Voxel carving is a non-invasive and low-cost technique that
is used for the reconstruction of a 3D volume from images captured from
a set of cameras placed around the object of interest. In this paper we
propose a method to topologically analyze a video sequence of 3D reconstructions
representing a tennis player performing different forehand and
backhand strokes with the aim of providing an approach that could be
useful in other sport activities.
2019-07-03
2019-07-03
2016
info:eu-repo/semantics/conferenceObject
Jiménez Rodríguez, M.J., Medrano Garfia, B., Monaghan, D.S. y O'Connor, N.E. (2016). Designing a Topological Algorithm for 3D Activity Recognition. En CTIC 2016 : 6th International Workshop on Computational Topology in Image Contex (193-203), Marseille, France: Springer.
978-3-319-39440-4
0302-9743
https://hdl.handle.net/11441/87796
10.1007/978-3-319-39441-1_18
eng
CTIC 2016 : 6th International Workshop on Computational Topology in Image Contex (2016), p 193-203
FQM-369
MTM2012-32706
MTM2015-67072-P
https://link.springer.com/chapter/10.1007/978-3-319-39441-1_18
Berlin
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Springer
oai:idus.us.es:11441/691682024-02-17T17:20:34Zcom_11441_10893com_11441_10802com_11441_10690col_11441_10896
3D-Dynamical geometry in building construction
Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
3D-modeling
Building construction modeling
Perspectives and projections
Dynamic geometry
GeoGebra
In Architecture and Technical Architecture Degrees, students use CAD tools (ComputerAided Design) which are not capable, in general, of representing graphically curves orsurfaces starting from its corresponding equations. To get it, users have to definespecific macros or they have to create a table of points in order to convert a set of nodesinto polylines.
CAS tools used in Math classes allow this graphical representation of curves and surfaces starting from their parametric equations. However, they lack the dynamical development given by CAD tools, which plays a main role in the mentioned degrees. Inthis sense, the complementation of the algebraic and geometric tools included in the software of dynamic geometry, GeoGebra, is an attractive alternative to design and model, from a mathematical point of view, curves and rigid objects in the space. Theuse of sliders related to the Euler’s angles and the possibility of generating tools which project 3D into 2D, makes easier this kind of modeling.
In the current workshop, we will show how to construct 3D-models of several architectonical constructions which have been made in the context of the subject called Mathematics for Building Construction II, corresponding to the Building Construction Engineering of the University of Seville, which has been implemented this academicyear 2009-10.
2018-01-18
2018-01-18
2010
info:eu-repo/semantics/conferenceObject
Falcón Ganfornina, R.M. (2010). 3D-Dynamical geometry in building construction. En TIME 2010. Technology and Its Integration Into Mathematics Education, Málaga, Andalucía.
https://hdl.handle.net/11441/69168
eng
TIME 2010. Technology and Its Integration Into Mathematics Education (2010),
http://www.time2010.uma.es/Proceedings/FalconR.html
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
oai:idus.us.es:11441/1150552024-02-14T13:25:00Zcom_11441_10893com_11441_10802com_11441_10690col_11441_10896
New advances concerning critical sets based on Latin square autotopisms
Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
2021-07-02
2021-07-02
2021
info:eu-repo/semantics/conferenceObject
Falcón Ganfornina, R.M. (2021). New advances concerning critical sets based on Latin square autotopisms. En ICCSPAM 2021: 4th International Conference on Current Scenario in Pure and Applied Mathematics Tamil Nadu, India: Kongunadu Arts and Science College.
https://hdl.handle.net/11441/115055
eng
ICCSPAM 2021: 4th International Conference on Current Scenario in Pure and Applied Mathematics (2021).
https://sites.google.com/kongunaducollege.ac.in/iccspam2021
Tamil Nadu, India
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Kongunadu Arts and Science College
oai:idus.us.es:11441/691432024-02-17T17:34:44Zcom_11441_10883com_11441_10802com_11441_10690com_11441_10893col_11441_10886col_11441_10896
Santilli's autotopism of associative partial quasigroups
Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
Universidad de Sevilla. Departamento de Geometría y Topología
Latin square
Santilli's isotopism
In this paper, given an isotopism Θ ∈ In, we study some properties of the set SAPLS(Θ) of those partial Latin squares being the multiplication table of an associative partial quasigroup having Θ as a Santilli’s autotopism.
2018-01-18
2018-01-18
2007
info:eu-repo/semantics/conferenceObject
Falcón Ganfornina, R.M. y Núñez Valdés, J. (2007). Santilli's autotopism of associative partial quasigroups. En International Conference on Dynamical systems (24-40), International Academic Press.
1-57485-065-2
https://hdl.handle.net/11441/69143
eng
International Conference on Dynamical systems (2007), p 24-40
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
International Academic Press
oai:idus.us.es:11441/1442872024-02-13T20:01:31Zcom_11441_10893com_11441_10802com_11441_10690col_11441_10896
A Step Towards Learning Contraction Kernels for Irregular Image Pyramid
Universidad de Sevilla. Departamento de Matemática Aplicada I
A structure preserving irregular image pyramid can be computed by applying basic graph operations (contraction and removal of edges) on the 4 adjacent neighbourhood graph of an image. In this paper, we derive an objective function that classifies the edges as contractible or removable for building an irregular graph pyramid. The objective function is based on the cost of the edges in the contraction kernel (sub-graph selected for
contraction) together with the size of the contraction kernel. Based on the objective function, we also provide an algorithm that decomposes a 2D image into monotonically connected regions of the image surface, called slope regions. We proved that the proposed algorithm results in a graph-based irregular image pyramid that preserves the structure and the topology of the critical points (the local maxima, the local minima, and the saddles). Later we introduce the concept of the dictionary for the connected components of the contraction kernel, consisting of sub-graphs that can be combined together to form a set of contraction kernels. A favorable contraction kernel can be selected that best satisfies the objective function. Lastly, we show the experimental verification for the claims related to the objective function and the cost of the contraction kernel. The outcome of this paper can be envisioned as a step towards learning the contraction kernel for the construction of an irregular image pyramid
2023-04-13
2023-04-13
2022-02
info:eu-repo/semantics/conferenceObject
Batavia, D., González Díaz, M.d.R. y Kropatsch, W.G. (2022). A Step Towards Learning Contraction Kernels for Irregular Image Pyramid. En Proceedings of the 11th International Conference on Pattern Recognition Applications and Methods (ICPRAM) (60-70), Online Streaming: SciTePress.
978-989-758-549-4
2184-4313
https://hdl.handle.net/11441/144287
10.5220/0010840900003122
eng
Proceedings of the 11th International Conference on Pattern Recognition Applications and Methods (ICPRAM) (2022), pp. 60-70.
https://www.scitepress.org/Link.aspx?doi=10.5220/0010840900003122
Setúbal, Portugal
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
SciTePress
oai:idus.us.es:11441/1264552024-02-17T17:26:28Zcom_11441_10893com_11441_10802com_11441_10690col_11441_10896
A topological entropy‐based approach for damage detection of civil engineering structures
Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
Universidad de Sevilla. Departamento de Mecánica de Medios Continuos y Teoría de Estructuras
Ministerio de Ciencia, Innovación y Universidades (MICINN). España
Damage detection
Structural health monitoring
Topological data analysis
Persistent homology
Persistent entropy
Supervised classification
In this study, a new method based on topological entropy, the so‐called persistent entropy, is
presented for addressing the damage detection problem in civil engineering structures. The efficiency
of the algorithm is certificated by the stability theorem for persistent entropy. The method, which has
been previously used for the classification of DC electrical motors, has been adapted herein to solve
the supervised classification damage detection problem. For this purpose, a laboratory footbridge was
designed, built and subsequently damaged. Two states of the structure were considered: (i)
undamaged and (ii) damaged. Its response under ambient conditions was recorded both numerically
and experimentally. Later, its persistent entropy was computed under the different situations. Finally,
it was checked that there is a clear relationship between the stiffness of the structure and its
persistent entropy. Therefore, the proposed method can be considered as an available tool for the
damage detection of civil engineering structures.
2021-10-05
2021-10-05
2019
info:eu-repo/semantics/conferenceObject
Jiménez Alonso, J.F., López Martínez, J., Blanco Claraco, J.L., González Díaz, R. y Sáez Pérez, A. (2019). A topological entropy‐based approach for damage detection of civil engineering structures. En CMMoST 2019: 5th International Conference on Mechanical Models in Structural Engineering (35-42), Escuela Politécnica de Alicante: Editorial Club Universitario.
978-84-17924-58-4
https://hdl.handle.net/11441/126455
eng
CMMoST 2019: 5th International Conference on Mechanical Models in Structural Engineering (2019), pp. 35-42.
RTI2018‐ 094945‐B‐C21
http://rua.ua.es/dspace/handle/10045/104638
Alicante, España
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Editorial Club Universitario
oai:idus.us.es:11441/691672024-02-14T13:51:57Zcom_11441_10893com_11441_10802com_11441_10690col_11441_10896
Decomposition of principal autotopisms into triples of a Latin square
Universidad de Sevilla. Departamento de Matemática Aplicada I
Triples of a Latin square L and isotopisms of its autotopism group U (L) can be used to get a secret sharing scheme in Cryptography. Although the weight of in formation given by the latter is usually greater than that given by the former, the size of an isotopism is generally much larger than that of a triple. As this problem rises with n, it is necessary to identify an isotopism with a set of shares of a smaller size. In this paper we give an algorithm to decompose any non-trivial principal autotopism into triples of a Latin square.
2018-01-18
2018-01-18
2006
info:eu-repo/semantics/conferenceObject
Falcón Ganfornina, R.M. (2006). Decomposition of principal autotopisms into triples of a Latin square. En X Encuentro de Álgebra Computacional y Aplicaciones, Sevilla.
84-611-2311-5
https://hdl.handle.net/11441/69167
eng
X Encuentro de Álgebra Computacional y Aplicaciones (2006), p 95-98
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
oai:idus.us.es:11441/325262024-02-13T22:28:02Zcom_11441_10893com_11441_10802com_11441_10690col_11441_10896
Una perspectiva de los métodos distributivos y su aplicación a las ecuaciones de transporte de sedimentos
Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
2016-01-14
2016-01-14
2005
info:eu-repo/semantics/conferenceObject
8480215232
http://hdl.handle.net/11441/32526
https://idus.us.es/xmlui/handle/11441/32526
spa
Modelización matemática de la sedimentación en la costa : [Actas del Congreso]/ Joaquín Castelló, Vicente Martínez, eds.(pp. 41-68)
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Castellón : Universidad Jaime I
oai:idus.us.es:11441/1039642024-02-12T21:49:22Zcom_11441_10893com_11441_10802com_11441_10690col_11441_10896
An Integrated Methodology for the Rapid Transit Network Design
Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
Universidad de Sevilla. Departamento de Matemática Aplicada II (ETSI)
Ministerio de Ciencia Y Tecnología (MCYT). España
Ministerio de Fomento. España
Network design
Rapid Transit Systems
The Rapid Transit System Network Design Problem consists
of two intertwined location problems: the determination of alignments
and that of the stations. The underlying space, a network or a region of
the plane, mainly depends on the place in which the system is being constructed,
at grade or elevated, or underground, respectively. For solving
the problem some relevant criteria, among them cost and future utilisation,
are applied. Urban planners and engineering consulting usually
select a small number of corridors to be combined and then analysed. The
way of selecting and comparing these alternatives is performed by the
application of the four-stage transit planning model. Due to the complexity
of the overall problem, during last ten years some efforts have been
dedicated to modelling some aspects as optimisation problems and to
provide Operations Research methods for solving them. This approach
leads to the consideration of a higher number of candidates than that of
the classic corridor analysis. The main aim of this paper is to integrate
the steps of the transit planning model (trip attraction and generation,
trip distribution, mode choice and traffic equilibrium) into an optimisation
process.
2021-01-20
2021-01-20
2004
info:eu-repo/semantics/conferenceObject
Laporte, G., Marín, Á., Mesa López-Colmenar, J.A. y Ortega Riejos, F.A. (2004). An Integrated Methodology for the Rapid Transit Network Design. En ATMOS 2004: 4th International Workshop on Algorithmic Methods and Models for Optimization of Railways (187-199), Bergen, Norway: Springer.
978-3-540-74245-6
0302-9743
https://hdl.handle.net/11441/103964
10.1007/978-3-540-74247-0_9
6516594
eng
ATMOS 2004: 4th International Workshop on Algorithmic Methods and Models for Optimization of Railways (2004), pp. 187-199.
BFM2003-04062/MATE
2003/1360
https://link.springer.com/chapter/10.1007/978-3-540-74247-0_9
Berlin
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Springer
oai:idus.us.es:11441/1258922024-02-14T13:32:06Zcom_11441_10893com_11441_10802com_11441_10690col_11441_10896
An example in combinatorial cohomology
Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
Steenrod cohomology operations are algebraic tools for distinguishing non–homeomorphic
topological spaces. In this paper, starting off from the general method developed
in [4] for Steenrod squares and Steenrod reduced powers, we present an explicit
combinatorial formulation for the Steenrod reduced power Pp
1 : Hq(X;Fp) !
Hqp−1(X;Fp), at cocycle level, where p is an odd prime, q a non–negative integer, X
a simplicial set and Fp the finite field with p elements. We design an algorithm for
computing Pp
1 on the cohomology of the classifying space of Zp and we generalize this
process to any simplicial set at cohomology level.
2021-09-16
2021-09-16
2001
info:eu-repo/semantics/conferenceObject
González Díaz, R. y Real Jurado, P. (2001). An example in combinatorial cohomology. En EACA 2001: 7º Encuentro de Álgebra Computacional y Aplicaciones (172-176), Ezcaray, La Rioja: Universidad de La Rioja.
84-95301-52-0
https://hdl.handle.net/11441/125892
eng
EACA 2001: 7º Encuentro de Álgebra Computacional y Aplicaciones (2001), pp. 172-176.
https://documat.unirioja.es/servlet/articulo?codigo=1113501
Ezcaray, La Rioja
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Universidad de La Rioja
oai:idus.us.es:11441/1261222024-02-12T21:28:03Zcom_11441_10893com_11441_10802com_11441_10690col_11441_10896
Computing the cohomology ring on simplicial complexes
Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
Junta de Andalucía
Ministerio de Educación y Ciencia (MEC). España
2021-09-23
2021-09-23
2003
info:eu-repo/semantics/conferenceObject
González Díaz, R. y Real Jurado, P. (2003). Computing the cohomology ring on simplicial complexes. En EGC 2003: X Encuentros de Geometría Computacional Sevilla, España: Universidad de Sevilla, Departamento de Matemática Aplicada I.
https://hdl.handle.net/11441/126122
eng
EGC 2003: X Encuentros de Geometría Computacional (2003).
FQM-296
PB98-1621-C02-02
http://congresos.us.es/egc03/inicio.htm
Sevilla, España
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Universidad de Sevilla, Departamento de Matemática Aplicada I
oai:idus.us.es:11441/691272024-02-14T19:37:53Zcom_11441_10883com_11441_10802com_11441_10690com_11441_10893col_11441_10886col_11441_10896
Isotopisms of Lie algebras
Universidad de Sevilla. Departamento de Matemática Aplicada I
Universidad de Sevilla. Departamento de Geometría y Topología
Universidad de Sevilla. FQM016: Códigos, Diseños, Criptografía y Optimización
Universidad de Sevilla. FQM326: Geometria Diferencial y Teoria de Lie
The distribution of algebras into equivalence classes is usually done according to the concept of isomorphism. However, such a distribution
can also be done into isotopism classes. The concept of isotopism was explicitly introduced in 1942 by Abraham Adrian Albert to classify non-associative algebras. In this poster we deal with the study of isotopisms of Lie algebras. The reasons for using both criteria, isotopisms and isomorphisms, to classify Lie algebras is due to that classifications by isotopisms are different from those by isomorphisms, which involves obtaining new information about these algebras. On a sake of example, we indicate some recent results obtained by ourselves, which are related to the distribution into isomorphism and isotopism classes of filiform Lie algebras over finite fields.
2018-01-17
2018-01-17
2015
info:eu-repo/semantics/conferenceObject
Falcón Ganfornina, Ó.J., Falcón Ganfornina, R.M. y Núñez Valdés, J. (2015). Isotopisms of Lie algebras. En Congreso de la RSME 2015 (2-6 de febrero), Granada.
https://hdl.handle.net/11441/69127
eng
Congreso de la RSME 2015 (2-6 de febrero) (2015), p 1-1
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
oai:idus.us.es:11441/869282024-02-12T22:09:58Zcom_11441_10893com_11441_10802com_11441_10690col_11441_10896
Anchura de un convexo en la esfera.
Universidad de Sevilla. Departamento de Matemáticas Aplicadas I
Universidad de Sevilla. FQM164: Matemática Discreta: Teoría de Grafos y Geometría Computacional
Movimientos rígidos
Anchura
Esfera
Conjuntos convexos
Se generaliza el concepto de anchura de un conjunto en el plano a la superficie de la esfera, dando condiciones necesarias y suficientes para que un conjunto convexo sobre la superficie de la esfera puede pasar
a través de un intervalo esférico mediante movimientos rígidos sobre dicha superficie.
2019-05-29
2019-05-29
1997-01
info:eu-repo/semantics/conferenceObject
Grima Ruiz, C.I., Dana Jiménez, J.C., Cobos Aguirre, F.J. y Márquez Pérez, A. (1997). Anchura de un convexo en la esfera.. En Canadian Conference on Computational Geometry., Kingston (Canadá)..
https://hdl.handle.net/11441/86928
spa
Canadian Conference on Computational Geometry. (1997), pp. 1-11.
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
oai:idus.us.es:11441/752922024-02-13T09:32:09Zcom_11441_33995com_11441_30105com_11441_10893com_11441_10802com_11441_10690col_11441_75277col_11441_10896
Algunas notas sobre mosaicos de Penrose
Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
Universidad de Sevilla. FQM164: Matemática Discreta: Teoría de Grafos y Geometría Computacional
2018-05-29
2018-05-29
2002
info:eu-repo/semantics/conferenceObject
Cáceres González, J., Gegúndez Arias, M.E.,...,Márquez Pérez, A. (2002). Algunas notas sobre mosaicos de Penrose. (pp. 60-67). Santander: Alberto Márquez
8460752704
https://hdl.handle.net/11441/75292
spa
Santander
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Atribución-NoComercial-SinDerivadas 3.0 Estados Unidos de América
Alberto Márquez
oai:idus.us.es:11441/936502024-02-17T16:47:01Zcom_11441_11291com_11441_11290com_11441_10690com_11441_10893com_11441_10802col_11441_11294col_11441_10896
Generating Second Order (Co)homological Information within AT-Model Context
Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
Universidad de Sevilla. Departamento de Arquitectura y Tecnología de Computadores
Cell complex
Algebraic-topological model
Homology computation
Primal and dual AT-segmentation
AT-model region-incidence-graph
nD digital object
In this paper we design a new family of relations between
(co)homology classes, working with coefficients in a field and starting
from an AT-model (Algebraic Topological Model) AT(C) of a finite cell
complex C These relations are induced by elementary relations of type
“to be in the (co)boundary of” between cells. This high-order connectivity
information is embedded into a graph-based representation model,
called Second Order AT-Region-Incidence Graph (or AT-RIG) of C. This
graph, having as nodes the different homology classes of C, is in turn,
computed from two generalized abstract cell complexes, called primal
and dual AT-segmentations of C. The respective cells of these two complexes
are connected regions (set of cells) of the original cell complex C,
which are specified by the integral operator of AT(C). In this work in
progress, we successfully use this model (a) in experiments for discriminating
topologically different 3D digital objects, having the same Euler
characteristic and (b) in designing a parallel algorithm for computing
potentially significant (co)homological information of 3D digital objects.
2020-02-26
2020-02-26
2019
info:eu-repo/semantics/conferenceObject
Real Jurado, P., Molina Abril, H., Díaz del Río, F. y Onchis, D.M. (2019). Generating Second Order (Co)homological Information within AT-Model Context. En CTIC 2019 : 7th International Workshop on Computational Topology in Image Contex (68-81), Málaga, España: Springer.
978-3-030-10827-4
0302-9743
https://hdl.handle.net/11441/93650
10.1007/978-3-030-10828-1_6
eng
CTIC 2019 : 7th International Workshop on Computational Topology in Image Contex (2019), p 68-81
MTM2016-81030-P
TEC2012-37868-C04-02
https://link.springer.com/chapter/10.1007/978-3-030-10828-1_6
Cham, Switzerland
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Springer
oai:idus.us.es:11441/498062024-02-12T22:13:39Zcom_11441_33181com_11441_30105com_11441_11301com_11441_11290com_11441_10690com_11441_10893com_11441_10802col_11441_33344col_11441_11304col_11441_10896
Semantics of Deductive Databases in a Membrane Computing Connectionist Model
Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial
Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
Universidad de Sevilla. TIC193 : Computación Natural
Universidad de Sevilla. FQM296 : Topología Computacional y Matemática Aplicada
The integration of symbolic reasoning systems based on logic and connectionist
systems based on the functioning of living neurons is a vivid research area in
computer science. In the literature, one can found many e orts where di erent reasoning
systems based on di erent logics are linked to classic arti cial neural networks. In this
paper, we study the relation between the semantics of reasoning systems based on propositional
logic and the connectionist model in the framework of membrane computing,
namely, spiking neural P systems. We prove that the xed point semantics of deductive
databases and the immediate consequence operator can be implemented in the spiking
neural P systems model.
2016-12-07
2016-12-07
2016
info:eu-repo/semantics/conferenceObject
Díaz Pernil, D. y Gutiérrez Naranjo, M.Á. (2016). Semantics of Deductive Databases in a Membrane Computing Connectionist Model. En BWMC 2016 : 14th Brainstorming Week on Membrane Computing : Sevilla, E. T. S. de Ingeniería Informática, February 1-5 (173-184), Sevilla: Fénix.
http://hdl.handle.net/11441/49806
https://idus.us.es/xmlui/handle/11441/49806
eng
BWMC 2016 : 14th Brainstorming Week on Membrane Computing : Sevilla, E. T. S. de Ingeniería Informática, February 1-5 (2016), p 173-184
http://www.gcn.us.es/files/14bwmc/173_dani_miguel_semantics.pdf
Sevilla
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Fénix
oai:idus.us.es:11441/1039732024-02-13T20:02:02Zcom_11441_10893com_11441_10802com_11441_10690col_11441_10896
Analysis of the Parameters of Transfers in Rapid Transit Network Design
Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
Universidad de Sevilla. Departamento de Matemática Aplicada II (ETSI)
Ministerio de Fomento. España
Ministerio de Ciencia Y Tecnología (MCYT). España
The rapid transit network design problem consists of the location
of train alignments and stations in an urban traffic context. The
originality of our study is to incorporate into the location model the
decisions about the transportation mode and the route, to be chosen
for urban trips. This paper proposes a new design model which includes
transfers between train lines. The objective of the model is to maximize
the number of expected users in the transit network taking limited budgets
into consideration, in addition to location and allocation constraints.
Furthermore, the transfer costs are considered in the generalized public
costs when the users change lines. Waiting time to take the metro and
walking time to transfer is included in the formulation of the costs. The
analysis of transfer parameters is carried out using a test network. Some
computational experience is included in the paper.
2021-01-20
2021-01-20
2006
info:eu-repo/semantics/conferenceObject
García, R., Garzón Astolfi, A., Marín, Á., Mesa López-Colmenar, J.A. y Ortega Riejos, F.A. (2006). Analysis of the Parameters of Transfers in Rapid Transit Network Design. En ATMOS 2005: 5th Workshop on Algorithmic Methods and Models for Optimization of Railways Dagstuhl, Germany: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik.
978-3-939897-00-2
2190-6807
https://hdl.handle.net/11441/103973
10.4230/OASIcs.ATMOS.2005.658
6421964
eng
ATMOS 2005: 5th Workshop on Algorithmic Methods and Models for Optimization of Railways (2006).
2003/1360
BFM2003-04062/MATE
https://drops.dagstuhl.de/opus/volltexte/2006/658/
Dagstuhl, Germany
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
oai:idus.us.es:11441/877122024-02-14T09:26:23Zcom_11441_10893com_11441_10802com_11441_10690col_11441_10896
Separating Topological Noise from Features Using Persistent Entropy
Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
Persistent homology
Persistence barcodes
Shannon entropy
Topological noise
Topological feature
Topology is the branch of mathematics that studies shapes
and maps among them. From the algebraic definition of topology a new
set of algorithms have been derived. These algorithms are identified
with “computational topology” or often pointed out as Topological Data
Analysis (TDA) and are used for investigating high-dimensional data in a
quantitative manner. Persistent homology appears as a fundamental tool
in Topological Data Analysis. It studies the evolution of k−dimensional
holes along a sequence of simplicial complexes (i.e. a filtration). The set
of intervals representing birth and death times of k−dimensional holes
along such sequence is called the persistence barcode. k−dimensional
holes with short lifetimes are informally considered to be topological
noise, and those with a long lifetime are considered to be topological
feature associated to the given data (i.e. the filtration). In this paper, we
derive a simple method for separating topological noise from topological
features using a novel measure for comparing persistence barcodes called
persistent entropy.
2019-07-01
2019-07-01
2016
info:eu-repo/semantics/conferenceObject
Atienza Martínez, M.N., González Díaz, R. y Rucco, M. (2016). Separating Topological Noise from Features Using Persistent Entropy. En STAF 2016: Collocated Workshops: DataMod, GCM, HOFM, MELO, SEMS, VeryComp (3-12), Vienna Austria: Springer.
978-3-319-50229-8
0302-9743
https://hdl.handle.net/11441/87712
10.1007/978-3-319-50230-4_1
eng
STAF 2016: Collocated Workshops: DataMod, GCM, HOFM, MELO, SEMS, VeryComp (2016), p 3-12
MTM2015-67072-P
https://link.springer.com/chapter/10.1007/978-3-319-50230-4_1
Berlin
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Springer
oai:idus.us.es:11441/389972024-02-17T17:36:52Zcom_11441_33181com_11441_30105com_11441_11301com_11441_11290com_11441_10690com_11441_10893com_11441_10802col_11441_34360col_11441_11304col_11441_10896
A Cellular Way to Obtain Homology Groups in Binary 2D Images
Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial
Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
Universidad de Sevilla. TIC193: Computación Natural
Universidad de Sevilla. FQM296: Topología Computacional y Matemática Aplicada
In this paper we present a P systems-based solution for the Homology Groups
of Binary 2D Image (HGB2I) Problem, a classical problem in Homology Theory. To this
aim, we present a family of P systems which solves all the instances of the problem in
the framework of Tissue-like P systems with catalysts. This new framework combines the
membrane structure and symport-antiport communication rules of tissue-like P systems
with the power of catalysts and inhibitors.
2016-03-28
2016-03-28
2010
info:eu-repo/semantics/conferenceObject
9788461423576
http://hdl.handle.net/11441/38997
https://idus.us.es/xmlui/handle/11441/38997
eng
Proceedings of the Eighth Brainstorming Week on Membrane Computing, 89-99. Sevilla, E.T.S. de Ingeniería Informática, 1-5 de Febrero, 2010
TIN2008-04487-E
TIN-2009-13192
P08-TIC-04200
MTM2006-03722
PO6-TIC-02268
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Fénix Editora
oai:idus.us.es:11441/181602024-02-12T21:54:54Zcom_11441_10893com_11441_10802com_11441_10690col_11441_10896
Un paseo matemático por las bóvedas a través de la Historia
Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
2015-01-20
2015-01-20
2000
info:eu-repo/semantics/conferenceObject
http://www.sedhc.es/biblioteca/actas/CNHC3_026.pdf
http://hdl.handle.net/11441/18160
https://idus.us.es/xmlui/handle/11441/18160
spa
Tercer Congreso Nacional de Historia de la construcción : Sevilla, 26 a 28 de octubre de 2000 ( Vol.: 1 ). Pag: 221 - 230
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
oai:idus.us.es:11441/339492019-04-03T05:43:17Zcom_11441_33181com_11441_30105com_11441_11301com_11441_11290com_11441_10690com_11441_10893com_11441_10802col_11441_33341col_11441_11304col_11441_10896
Counting Cells with Tissue-like P Systems
Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial
Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
Universidad de Sevilla. TIC193: Computación Natural
Universidad de Sevilla. FQM296: Topología Computacional y Matemática Aplicada
Ministerio de Ciencia e Innovación (MICIN). España
Junta de Andalucía
Counting the number of cells obtained in an experiment is crucial in many
areas in Biology. Nonetheless, this is usually performed by hand by the researcher due the
intrinsic difficulty of the task. In this paper, we present a set of techniques for counting
cells inspired in the treatment of Digital Images via tissue-like P systems with promoters.
2016-02-03
2016-02-03
2012
info:eu-repo/semantics/conferenceObject
978-84-940056-5-7
http://hdl.handle.net/11441/33949
https://idus.us.es/xmlui/handle/11441/33949
eng
Proceedings of the Tenth Brainstorming Week on Membrane Computing, 69-78. Sevilla, E.T.S. de Ingeniería Informática, 30 de Enero-3 de Febrero, 2012,
TIN-2009-13192
P08-TIC-04200
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Fénix Editora
oai:idus.us.es:11441/869272019-05-29T06:11:29Zcom_11441_10893com_11441_10802com_11441_10690col_11441_10896
Homomorphisms and Polynomial Invariants of Graphs
Universidad de Sevilla. Departamento de Matemáticas Aplicadas I
Universidad de Sevilla. FQM164: Matemática Discreta: Teoría de Grafos y Geometría Computacional
Homomorphism
Tutte polynomial
Polynomial invariant
This paper initiates a study of the connection between graph
homomorphisms and the Tutte polynomial. This connection enables us to extend the study to other important polynomial invariants associated with graphs, and closely related to the Tutte polynomial. We then obtain applications of these relationships in several areas, including Abelian Groups and Statistical Physics. A new type of uniqueness of graphs, strongly related to chromatically-unique graphs and Tutte-unique graphs, is introduced in order to provide a new point of view of the conjectures about uniqueness of graphs stated by Bollobas, Peabody and Riordan.
2019-05-29
2019-05-29
2007
info:eu-repo/semantics/conferenceObject
Revuelta Marchena, M.P., Garijo Royo, D. y Nesetril, J. (2007). Homomorphisms and Polynomial Invariants of Graphs. En Avances en Matemática Discreta en Andalucía., Cádiz.
https://hdl.handle.net/11441/86927
eng
Avances en Matemática Discreta en Andalucía. (2007), pp. 1-7.
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
oai:idus.us.es:11441/498052017-01-17T09:33:44Zcom_11441_33181com_11441_30105com_11441_11301com_11441_11290com_11441_10690com_11441_10893com_11441_10802col_11441_33344col_11441_11304col_11441_10896
Solving the 3-COL Problem by Using Tissue P Systems without Environment and Proteins on Cells
Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial
Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
Universidad de Sevilla. TIC193 : Computación Natural
Universidad de Sevilla. FQM296 : Topología Computacional y Matemática Aplicada
The 3-COL problem consists on deciding if the regions of a map can be
coloured with only three colors bearing in mind that two adjacent regions must be
coloured with di erent colors. It is a NP problem and it has been previously used in
complexity studies in membrane computing to check the ability of a model for solving
problems of such complexity class. Recently, tissue P systems with proteins on cells have
been presented and its ability to solve NP-problems has been proved, but it remained
as an open question to know if such model was still able to solve such problems if the
environment was removed. In this paper we provide an a rmative answer to this question
by showing a uniform family of tissue P systems without environment and with proteins
on cells which solves the 3-COL problem in linear time.
2016-12-07
2016-12-07
2016
info:eu-repo/semantics/conferenceObject
Díaz Pernil, D., Christinal, H.A. y Gutiérrez Naranjo, M.Á. (2016). Solving the 3-COL Problem by Using Tissue P Systems without Environment and Proteins on Cells. En BWMC 2016 : 14th Brainstorming Week on Membrane Computing : Sevilla, E. T. S. de Ingeniería Informática, February 1-5 (163-172), Sevilla: Fénix.
http://hdl.handle.net/11441/49805
https://idus.us.es/xmlui/handle/11441/49805
eng
BWMC 2016 : 14th Brainstorming Week on Membrane Computing : Sevilla, E. T. S. de Ingeniería Informática, February 1-5 (2016), p 163-172
http://www.gcn.us.es/files/14bwmc/163_dani_hepzi_miguel.pdf
Sevilla
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Fénix
oai:idus.us.es:11441/957312024-02-15T07:28:17Zcom_11441_11291com_11441_11290com_11441_10690com_11441_10893com_11441_10802col_11441_11294col_11441_10896
Parallel Image Processing Using a Pure Topological Framework
Universidad de Sevilla. Departamento de Arquitectura y Tecnología de Computadores
Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
Universidad de Sevilla. TEP108: Robótica y Tecnología de Computadores
Universidad de Sevilla. TIC245: Topological Pattern Analysis and Recognition
Topology
Component-Labeling
Adjacency Tree
Image Processing
Parallelism
Image processing is a fundamental operation
in many real time applications, where lots of parallelism
can be extracted. Segmenting the image into different
connected components is the most known operations, but
there are many others like extracting the region adjacency
graph (RAG) of these regions, or searching for features
points, being invariant to rotations, scales, brilliant
changes, etc. Most of these algorithms part from the basis
of Tracing-type approaches or scan/raster methods. This
fact necessarily implies a data dependence between the
processing of one pixel and the previous one, which
prevents using a pure parallel approach. In terms of time
complexity, this means that linear order O(N) (N being the
number of pixels) cannot be cut down. In this paper, we
describe a novel approach based on the building of a pure
Topological framework, which allows to implement fully
parallel algorithms. Concerning topological analysis, a first
stage is computed in parallel for every pixel, thus
conveying the local neighboring conditions. Then, they are
extended in a second parallel stage to the necessary global
relations (e.g. to join all the pixels of a connected
component). This combinatorial optimization process can
be seen as the compression of the whole image to just one
pixel. Using this final representation, every region can be
related with the rest, which yields to pure topological
construction of other image operations. Besides, complex
data structures can be avoided: all the processing can be
done using matrixes (with the same indexation as the
original image) and element-wise operations. The time
complexity order of our topological approach for a m×n
pixel image is near O(log(m+n)), under the assumption that
a processing element exists for each pixel. Results for a
multicore processor show very good scalability until the
memory bandwidth bottleneck is reached, both for bigger
images and for much optimized implementations. The
inherent parallelism of our approach points to the
direction that even better results will be obtained in other
less classical computing architectures.1
2020-04-25
2020-04-25
2016
info:eu-repo/semantics/conferenceObject
Díaz del Río, F., Molina Abril, H., Real Jurado, P., Sánchez-Cuevas, P. y Ríos Navarro, J.A. (2016). Parallel Image Processing Using a Pure Topological Framework. En Avances en Arquitectura y Tecnología de Computadores. Jornadas SARTECO (344-350), Cáceres (España): Universidad de Extremadura.
9788409121274
https://hdl.handle.net/11441/95731
eng
Avances en Arquitectura y Tecnología de Computadores. Jornadas SARTECO (2016), p 344-350
TEC2012-37868-C04-02
MTM2016-81030-P
http://dehesa.unex.es/handle/10662/9626
9788409121274
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Universidad de Extremadura
oai:idus.us.es:11441/693462018-01-23T10:37:37Zcom_11441_10893com_11441_10802com_11441_10690col_11441_10896
Partial latin squares with no non-trivial autotopisms and six autoparatopisms
Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
2018-01-23
2018-01-23
2016
info:eu-repo/semantics/conferenceObject
Stones, R.J. y Falcón Ganfornina, R.M. (2016). Partial latin squares with no non-trivial autotopisms and six autoparatopisms. En 3rd Istanbul Design Theory, Graph Theory and Combinatorics Workshop, Estambul (Turquía).
https://hdl.handle.net/11441/69346
eng
3rd Istanbul Design Theory, Graph Theory and Combinatorics Workshop (2016),
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
oai:idus.us.es:11441/692292024-02-17T17:42:06Zcom_11441_10893com_11441_10802com_11441_10690col_11441_10896
Clasificación de cuadros latinos parciales de orden menor o igual a 4
Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
Lema de Burnside
Bases de Gröbner
Grupos de autoparatopismos
Grupo de autotopismos
El número de cuadrados latinos parciales relacionados con un autotopismo dado es conocido para orden menor o igual a 4. En el presente artículo se hace uso del lema de Burnside para determinar el número de clases de isotopismos e isomorfismos de dichos cuadrados. Posteriormente se identifica el grupo de autotopismos entre dos cuadrados latinos parciales con el conjunto de ceros de un ideal cero-dimensional, lo que permite utilizar bases de Gröbner para obtener de forma explícita tanto las clases isotópicas como las principales. Finalmente se obtiene la distribución de dichas clases atendiendo respectivamente al número de elementos de sus grupos de autoparatopismos y autotopismos.
2018-01-19
2018-01-19
2011-11
info:eu-repo/semantics/conferenceObject
Falcón Ganfornina, R.M. (2011). Clasificación de cuadros latinos parciales de orden menor o igual a 4. En VII Encuentro Andaluz de Matemática Discreta, Sevilla, Andalucía.
https://hdl.handle.net/11441/69229
20000440
spa
VII Encuentro Andaluz de Matemática Discreta (2011), p 5-12
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
oai:idus.us.es:11441/873982019-06-13T07:51:53Zcom_11441_10893com_11441_10802com_11441_10690col_11441_10896
Computing “Small” 1–Homological Models for Commutative Differential Graded Algebras
Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
We use homological perturbation machinery specific for the algebra category
[13] to give an algorithm for computing the differential structure of a small 1–
homological model for commutative differential graded algebras (briefly, CDGAs).
The complexity of the procedure is studied and a computer package in Mathematica
is described for determining such models.
2019-06-13
2019-06-13
2000
info:eu-repo/semantics/conferenceObject
Álvarez Solano, V., Armario Sampalo, J.A., Frau García, M.D., González Díaz, R., Jiménez Rodríguez, M.J., Real Jurado, P. y Silva Gallardo, B. (2000). Computing “Small” 1–Homological Models for Commutative Differential Graded Algebras. En CASC 2000 : Third Workshop on Computer Algebra in Scientific Computing (87-100), Samarkand, Uzbekistan: Springer.
978-3-540-41040-9
https://hdl.handle.net/11441/87398
10.1007/978-3-642-57201-2_9
eng
CASC 2000 : Third Workshop on Computer Algebra in Scientific Computing (2000), p 87-100
PB98–1621–C02–02
FQM–0143
https://link.springer.com/chapter/10.1007/978-3-642-57201-2_9
Berlin
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Springer
oai:idus.us.es:11441/692872024-02-13T08:47:47Zcom_11441_10893com_11441_10802com_11441_10690com_11441_11401com_11441_11290col_11441_10896col_11441_11404
Analyzing constraints influence in the design of rotating crew schedules
Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
Universidad de Sevilla. Departamento de Organización Industrial y Gestión de Empresas I
2018-01-22
2018-01-22
2016
info:eu-repo/semantics/conferenceObject
Falcón Ganfornina, R.M., Barrena Algara, E., Canca Ortiz, D. y Laporte, G. (2016). Analyzing constraints influence in the design of rotating crew schedules. En 5th European Seminar on Computing, Pilsen (República Checa).
https://hdl.handle.net/11441/69287
eng
5th European Seminar on Computing (2016),
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
oai:idus.us.es:11441/691712024-02-13T19:58:11Zcom_11441_10893com_11441_10802com_11441_10690com_11441_10898col_11441_10896col_11441_10901
Aplicaciones de GeoGebra al Análisis
Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
Universidad de Sevilla. Departamento de Matemática Aplicada II (ETSI)
En el presente trabajo se elaboran actividades con GeoGebra para utilizarlas en el aula de Matemáticas en el Bloque de Funciones y Gráficas de la ESO y en el bloque de Análisis en Bachillerato. Para ello se hace uso de las diferentes zonas de la ventana de trabajo del programa explorando, entre otras cosas, las posibilidades de la hoja de cálculo para crear una base de datos de funciones, estudiar su composición o crear una tabla de valores de las mismas, así como para resolver problemas de optimización.
2018-01-18
2018-01-18
2011-04
info:eu-repo/semantics/conferenceObject
Falcón Ganfornina, R.M., Ríos Collantes de Terán, R., Barrena Algara, E. y Ramírez Campos, R. (2011). Aplicaciones de GeoGebra al Análisis. En II Jornadas de GeoGebra de Andalucía, Huelva.
978-84-937577-7-9
https://hdl.handle.net/11441/69171
spa
II Jornadas de GeoGebra de Andalucía (2011)
http://thales.cica.es/sites/thales.cica.es.geogebra/files/II_Jornadas_GeoGebra/material/talleres/analisis/Analisis.pdf
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
oai:idus.us.es:11441/964022024-02-17T16:54:38Zcom_11441_10893com_11441_10802com_11441_10690col_11441_10896
The p-approximation property in Banach spaces
Departamento de Matemática Aplicada I
Banach spaces
p-approximation property
2020-05-11
2020-05-11
2009
info:eu-repo/semantics/conferenceObject
Juan Manuel Delgado Sánchez, (2009). The p-approximation property in Banach spaces. En V Encuentro de Análisis Funcional y sus Aplicaciones (1-80), Salobreña (Granada): Universidad de Granada. Departamento de Matemática Aplicada.
https://hdl.handle.net/11441/96402
7511405
eng
https://www.uv.es/functanalys/encuentros/2009/2009/Delgado.pdf
Granada
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Universidad de Granada. Departamento de Matemática Aplicada
oai:idus.us.es:11441/1118842024-02-17T16:21:12Zcom_11441_10893com_11441_10802com_11441_10690col_11441_10896
Open Issues and Chances for Topological Pyramids
Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
Austrian Science Found
Junta de Andalucía
High resolution image data require a huge
amount of computational resources. Image pyramids
have shown high performance and flexibility to reduce
the amount of data while preserving the most relevant
pieces of information, and still allowing fast access to
those data that have been considered less important before.
They are able to preserve an existing topological structure
(Euler number, homology generators) when the spatial
partitioning of the data is known at the time of construction.
In order to focus on the topological aspects let us call this
class of pyramids “topological pyramids”. We consider
here four open problems, under the topological pyramids
context: The minimality problem of volumes representation,
the “contact”-relation representation, the orientation of
gravity and time dimensions and the integration of different
modalities as different topologies.
2021-06-18
2021-06-18
2009
info:eu-repo/semantics/conferenceObject
Kropatsch, W.G. y Molina Abril, H. (2009). Open Issues and Chances for Topological Pyramids. En CVWW 2009: 14th Computer Vision Winter Workshop (121-125), Eibiswald, Austria: PRIP, Vienna University of Technology.
https://hdl.handle.net/11441/111884
eng
CVWW 2009: 14th Computer Vision Winter Workshop (2009), pp. 121-125.
P20134-N13
FQM–296
PO6-TIC-02268
https://www.prip.tuwien.ac.at/legacy/oldwww.prip.tuwien.ac.at/events/conferences/cvww09/index/index.html
Vienna, Austria
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
PRIP, Vienna University of Technology
oai:idus.us.es:11441/684692024-02-12T22:14:22Zcom_11441_11301com_11441_11290com_11441_10690com_11441_10893com_11441_10802col_11441_11304col_11441_10896
Descriptional Complexity of Tissue-Like P Systems with Cell Division
Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial
Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
Universidad de Sevilla. TIC193: Computación Natural
Universidad de Sevilla. FQM296: Topología Computacional y Matemática Aplicada
Ministerio de Educación y Ciencia (MEC). España
Junta de Andalucía
In this paper we address the problem of describing the complexity
of the evolution of a tissue-like P system with cell division. In
the computations of such systems the number of (parallel) steps is not
sufficient to evaluate the complexity. Following this consideration, Sevilla
Carpets were introduced as a tool to describe the space-time complexity
of P systems.
Sevilla Carpets have already been used to compare two different solutions
of the Subset Sum problem (both designed in the framework of
P systems with active membranes) running on the same instance. In
this paper we extend the comparison to the framework of tissue-like P
systems with cell division.
2018-01-09
2018-01-09
2009
info:eu-repo/semantics/conferenceObject
Díaz Pernil, D., Gallego Ortiz, P., Gutiérrez Naranjo, M.Á., Pérez Jiménez, M.d.J. y Riscos Núñez, A. (2009). Descriptional Complexity of Tissue-Like P Systems with Cell Division. En UC 2009: 8th International Conference on Unconventional Computation (168-178), Ponta Delgada, Portugal: Springer.
978-3-642-03744-3
0302-9743
http://hdl.handle.net/11441/68469
10.1007/978-3-642-03745-0_21
6518045
eng
UC 2009: 8th International Conference on Unconventional Computation (2009), p 168-178
TIN2006-13425
P08–TIC-04200
https://link.springer.com/chapter/10.1007/978-3-642-03745-0_21
Berlin
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Springer
oai:idus.us.es:11441/1263812024-02-14T20:20:48Zcom_11441_10893com_11441_10802com_11441_10690col_11441_10896
On the computability of the p-local homology of twisted cartesian products of Eilenberg-Mac Lane spaces
Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
Working in the framework of the Simplicial Topology, a method for calculating
the p-local homology of a twisted cartesian product X( , m, , 0, n) =
K( ,m)× K( 0, n) of Eilenberg-Mac Lane spaces is given. The chief technique
is the construction of an explicit homotopy equivalence between the normalized
chain complex of X and a free DGA-module of finite type M, via homological
perturbation. If X is a commutative simplicial group (being its inner product
the natural one of the cartesian product of K( ,m) and K( 0, n)), then M is a
DGA-algebra. Finally, in the special case K( , 1) ,! X
p!
K( 0, n), we prove
that M can be a small twisted tensor product.
2021-09-30
2021-09-30
1997
info:eu-repo/semantics/conferenceObject
Álvarez Solano, V., Armario Sampalo, J.A. y Real Jurado, P. (1997). On the computability of the p-local homology of twisted cartesian products of Eilenberg-Mac Lane spaces. En 1st International Meeting on Geometry and Topology Braga, Portugal: Universidade do Minho.
https://hdl.handle.net/11441/126381
eng
1st International Meeting on Geometry and Topology (1997).
https://www.emis.de/proceedings/Braga97/5.html
Braga, Portugal
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Universidade do Minho
oai:idus.us.es:11441/1099602024-02-17T16:36:47Zcom_11441_10893com_11441_10802com_11441_10690col_11441_10896
Least-perimeter partitions of the disk
Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
Ministerio de Ciencia Y Tecnología (MCYT). España
Isoperimetric partition
Stability
In this work we study the isoperimetric problem of partitioning a planar disk into
n regions of prescribed areas using the least-possible perimeter. We obtain the
regularity conditions that must be satisfied by the solutions, and solve completely
the problem in the cases of two and three regions.
2021-05-26
2021-05-26
2004
info:eu-repo/semantics/conferenceObject
Cañete Martín, A.J. (2004). Least-perimeter partitions of the disk. En XIII Fall Workshop on Geometry and Physics (141-148), Murcia, España: Real Sociedad Matemática Española.
84-933610-6-2
https://hdl.handle.net/11441/109960
eng
XIII Fall Workshop on Geometry and Physics (2004), pp. 141-148.
MTM2004-01387
https://www.um.es/wgp2004/
Madrid, España
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Real Sociedad Matemática Española
oai:idus.us.es:11441/340032016-11-29T12:33:18Zcom_11441_33181com_11441_30105com_11441_11301com_11441_11290com_11441_10690com_11441_10893com_11441_10802col_11441_33341col_11441_11304col_11441_10896
Skeletonizing Images by Using Spiking Neural P Systems
Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial
Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
Universidad de Sevilla. TIC193: Computación Natural
Universidad de Sevilla. FQM296: Topología Computacional y Matemática Aplicada
Skeletonizing an image is representing a shape with a small amount of information
by converting the initial image into a more compact representation and keeping
the meaning features. In this paper we use spiking neural P systems to solve this problem.
Based on such devices, a parallel software has been implemented on the GPU architecture.
Some real-world applications and open lines for future research are also presented.
2016-02-04
2016-02-04
2012
info:eu-repo/semantics/conferenceObject
978-84-940056-5-7
http://hdl.handle.net/11441/34003
https://idus.us.es/xmlui/handle/11441/34003
eng
Proceedings of the Tenth Brainstorming Week on Membrane Computing, 91-110. Sevilla, E.T.S. de Ingeniería Informática, 30 de Enero-3 de Febrero, 2012,
TIN2008-04487-E
TIN-2009-13192
P08-TIC-04200
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Fénix Editora
oai:idus.us.es:11441/877022020-04-02T11:54:45Zcom_11441_10893com_11441_10802com_11441_10690col_11441_10896oai:idus.us.es:11441/1118072024-02-14T08:43:21Zcom_11441_10893com_11441_10802com_11441_10690col_11441_10896
Multiple Objective TSP based on ACO
Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
In this paper we present an Ant Colony Optimisation based algorithm
to determine the Pareto set for the Multiple Objective Travelling
Salesman Problem. Our results are then compared with the ones obtained
with a genetic algorithm.
2021-06-15
2021-06-15
2003
info:eu-repo/semantics/conferenceObject
Cardoso, P., Jesus, M. y Márquez Pérez, A. (2003). Multiple Objective TSP based on ACO. En EAMD 2003: III Encuentro Andaluz de Matemáticas Discretas San José, Almería: Universidad de Almería.
https://hdl.handle.net/11441/111807
eng
EAMD 2003: III Encuentro Andaluz de Matemáticas Discretas (2003).
https://w3.ual.es/Congresos/3EAMD/
Almería, España
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Universidad de Almería
oai:idus.us.es:11441/692522024-02-14T20:23:51Zcom_11441_10883com_11441_10802com_11441_10690com_11441_10893col_11441_10886col_11441_10896
Some advances in the research on Lie algebras
Universidad de Sevilla. Departamento de Geometría y Topología
Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
The main goal of this poster, which is written in the form of a survey and tries to show some aspects of the research of authors on Lie algebras, is to pay homage to the memory of Pilar Pisón Casares, who was firstly teacher of some of them and later colleague of all of them during different stages of her stay as a member of the Departamento de Algebra, Computación, Geometría y Topología de la Universidad de Sevilla.
2018-01-19
2018-01-19
2008
info:eu-repo/semantics/conferenceObject
Benjumea Acevedo, J.C., Falcón Ganfornina, R.M., Fernández Ternero, D., Márquez García, M.d.C. y Núñez Valdés, J. (2008). Some advances in the research on Lie algebras. En Conferencia Internacional sobre Álgebra Conmutativa, Combinatoria y Computacional, Sevilla.
https://hdl.handle.net/11441/69252
eng
Conferencia Internacional sobre Álgebra Conmutativa, Combinatoria y Computacional (2008),
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
oai:idus.us.es:11441/691462024-02-17T16:43:12Zcom_11441_10893com_11441_10802com_11441_10690col_11441_10896
Aventura matemática: Búsqueda del tesoro en Isla Mágica
Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
Durante la fase regional de la XXII Olimpiada Matemática Thales, se realizaron tres pruebas por equipos, aparte de la tradicional prueba individual. De todas ellas, la que generó más expectativas entre los 42 chicos y chicas participantes y la que finalmente más gustó entre ellos fue la búsqueda del tesoro que se realizó en Isla Mágica, que tuvo incluso repercusión mediática. Por todo ello y con vistas a aportar una actividad matemática en una posible visita junto al alumnado a dicho parque temático, presentamos a continuación la dinámica de la citada actividad junto con el conjunto de pruebas matemáticas que la configuraron.
2018-01-18
2018-01-18
2007-11
info:eu-repo/semantics/conferenceObject
Falcón Ganfornina, R.M. (2007). Aventura matemática: Búsqueda del tesoro en Isla Mágica. En III Encuentro Provincial del Profesorado de Matemáticas, Sevilla.
978-84-933040-9-6
https://hdl.handle.net/11441/69146
spa
III Encuentro Provincial del Profesorado de Matemáticas (2007), p 195-202
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
oai:idus.us.es:11441/1118482024-02-14T19:33:12Zcom_11441_10893com_11441_10802com_11441_10690col_11441_10896
Witness-Bar Visibility Graphs
Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
Ministerio de Economía y Competitividad (MINECO). España
Generalitat de Catalunya
Ministerio de Ciencia, Innovación y Universidades (MICINN). España
Bar visibility graphs were introduced in the seventies as a model for some VLSI layout problems.
They have been also studied since then by the graph drawing community, and recently several
generalizations and restricted versions have been proposed.
We introduce a generalization, witness-bar visibility graphs, and we prove that this class encom-
passes all the bar-visibility variations considered so far. In addition, we show that many classes of
graphs are contained in this family, including in particular all planar graphs, interval graphs, circular
arc graphs and permutation graphs.
2021-06-16
2021-06-16
2013
info:eu-repo/semantics/conferenceObject
Cortés Parejo, M.d.C., Hurtado, F., Márquez Pérez, A. y Valenzuela Muñoz, J. (2013). Witness-Bar Visibility Graphs. En The Mexican Conference on Discrete Mathematics and Computational Geometry Oaxaca de Juárez, México: Instituto de Matemáticas de la UNAM.
https://hdl.handle.net/11441/111848
eng
The Mexican Conference on Discrete Mathematics and Computational Geometry (2013).
MTM2012{30951
DGR 2009SGR1040
EUI- EURC-2011-4306
https://www.matem.unam.mx/actividades/congresos/2013/the-mexican-conference-on-discrete-mathematics-and-computational-geometry
México
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Instituto de Matemáticas de la UNAM
oai:idus.us.es:11441/691772024-02-17T17:43:13Zcom_11441_10893com_11441_10802com_11441_10690col_11441_10896
Isotopismos de álgebras de Lie filiformes sobre cuerpos finitos
Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
Universidad de Sevilla. Departamento de Geometría y Topología
Isotopismo
Álgebra de Lie filiforme
Teoría de grafos
El presente trabajo trata la distribución del conjunto $\mathcal{F}_n^p$ de álgebras de Lie filiformes de dimensión $n$ sobre $\mathbb{Z}/p\mathbb{Z}$ en clases isomórficas e isotópicas. Se estudian para ello distintas propiedades que deben verificar las aplicaciones lineales correspondientes, al mismo tiempo que se identifica dicho conjunto con la variedad afín asociada a un determinado ideal de polinomios booleanos. Finalmente, para $p=2$, se muestra cómo identificar cada álgebra de $\mathcal{F}_n^2$ con un par de grafos, cuyas clases de isomorfismo pueden identificarse con las clases isomórficas e isotópicas de las correspondientes álgebras.
2018-01-18
2018-01-18
2013-10
info:eu-repo/semantics/conferenceObject
Falcón Ganfornina, R.M., Falcón Ganfornina, Ó.J. y Núñez Valdés, J. (2013). Isotopismos de álgebras de Lie filiformes sobre cuerpos finitos. En VIII Encuentro Andaluz de Matemática Discreta, Sevilla, Andalucía.
https://hdl.handle.net/11441/69177
spa
VIII Encuentro Andaluz de Matemática Discreta (2013), p 147-156
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
oai:idus.us.es:11441/1112842024-02-14T13:33:44Zcom_11441_10893com_11441_10802com_11441_10690col_11441_10896
Some Geophysical Applications with Finite Volume Solvers of Two-Layer and Two-Phase Systems
Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
Ministerio de Ciencia, Innovación y Universidades (MICINN). España
Agence Nationale de la Recherche (ANR). France
European Research Council (ERC)
Saint-Venant model
Two-layer
Two-phase
Finite volume
Well-balanced
There exists in the literature a huge range of geophysical applications that
have been modeled trough two-layer or two-phase models. In this work first some
averaged two-layer and two-phase models are presented. We focus on applications to
submarine avalanches, debris flows and sediment transport in rivers. Secondly, their
numerical approximation by a finite volume method is discussed and a numerical
test is presented.
2021-06-02
2021-06-02
2017
info:eu-repo/semantics/conferenceObject
Fernández Nieto, E.D. (2017). Some Geophysical Applications with Finite Volume Solvers of Two-Layer and Two-Phase Systems. En FVCA 2017: 8th International Conference on Finite Volumes for Complex Applications (15-27), Lille, France: Springer.
978-3-319-57396-0
https://hdl.handle.net/11441/111284
10.1007/978-3-319-57397-7_2
eng
FVCA 2017: 8th International Conference on Finite Volumes for Complex Applications (2017), pp. 15-27.
MTM2015-70490-C2-1-R
MTM2015-70490-C2-2-R
ANR-11-BS01-0016 LANDQUAKES
ERC-CG-2013-PE10-617472 SLIDEQUAKES
https://link.springer.com/chapter/10.1007/978-3-319-57397-7_2
Cham, Switzerland
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Springer
oai:idus.us.es:11441/1091682024-02-14T08:59:09Zcom_11441_10893com_11441_10802com_11441_10690col_11441_10896
Técnicas cuánticas para la evolución de grafos aleatorios
Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
Grafo aleatorio
Hamiltoniano
Operadores de creación y destrucción
Erdös-Rényi
Con la idea de modelar el comportamiento de diversas redes sociales a lo largo del tiempo,
mostramos algunos resultados preliminares sobre evolución de grafos aleatorias empleando técnicas
inspiradas en la mecánica cuántica. Presentaremos el formalismo y veremos como podemos pasar de
una descripción microscópica a una descripción macroscópica. Por último, compararemos nuestro
modelo con los bien conocidos grafos de Erdös-Rényi.
2021-05-21
2021-05-21
2015
info:eu-repo/semantics/conferenceObject
Fernández Borja, E., Grima Ruiz, C.I., Márquez Pérez, A. y Zambrano, R. (2015). Técnicas cuánticas para la evolución de grafos aleatorios. En XXX Coloquio Víctor Neumann-Lara de Teoría de las Gráficas, Combinatoria y sus Aplicaciones (7-10), Oaxaca, México: Instituto de Matemáticas de la UNAM.
https://hdl.handle.net/11441/109168
spa
XXX Coloquio Víctor Neumann-Lara de Teoría de las Gráficas, Combinatoria y sus Aplicaciones (2015), pp. 7-10.
http://xamanek.izt.uam.mx/coloquio/2015/
México
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Instituto de Matemáticas de la UNAM
oai:idus.us.es:11441/874032024-02-15T07:41:41Zcom_11441_10893com_11441_10802com_11441_10690col_11441_10896
Error correcting codes from quasi-Hadamard matrices
Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
Error correcting code
Hadamard matrix
Hadamard code
Levenshtein described in [5] a method for constructing error
correcting codes which meet the Plotkin bounds, provided suitable Ha-
damard matrices exist. Uncertainty about the existence of Hadamard
matrices on all orders multiple of 4 is a source of difficulties for the prac-
tical application of this method. Here we extend the method to the case
of quasi-Hadamard matrices. Since efficient algorithms for constructing
quasi-Hadamard matrices are potentially available from the literature
(e.g. [7]), good error correcting codes may be constructed in practise.
We illustrate the method with some examples.
2019-06-13
2019-06-13
2007
info:eu-repo/semantics/conferenceObject
Álvarez Solano, V., Armario Sampalo, J.A., Frau García, M.D., Martín García, E. y Osuna Lucena, A. (2007). Error correcting codes from quasi-Hadamard matrices. En WAIFI 2007 : First International Workshop on the Arithmetic of Finite Fields (294-302), Madrid, España: Springer.
978-3-540-73073-6
0302-9743
https://hdl.handle.net/11441/87403
10.1007/978-3-540-73074-3_23
6525884
eng
WAIFI 2007 : First International Workshop on the Arithmetic of Finite Fields (2007), p 294-302
FQM-296
https://link.springer.com/chapter/10.1007/978-3-540-73074-3_23
Berlin
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Springer
oai:idus.us.es:11441/344462024-02-15T07:27:07Zcom_11441_33995com_11441_30105com_11441_10893com_11441_10802com_11441_10690col_11441_33996col_11441_10896
Formulación de tipo Petrov-Galerkin de algunos métodos distributivos: Aplicación a las ecuaciones de Navier-Stokes
Universidad de Sevilla. Departamento de Ecuaciones Diferenciales y Análisis Numérico
Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
Ministerio de Educación y Ciencia
Métodos distributivos
Petrov-Galerkin
Navier-Stokes
En este trabajo estudiamos la resolución de las Ecuaciones de Navier-Stokes estacionarias mediante métodos distributivos no lineales. Formulamos estos métodos como métodos de tipo Petrov-Galerkin, en un contexto de discretización por el método de los elementos finitos. Utilizamos funciones tests descentradas “corriente arriba”para el tratamiento del término de convección.
Esta formulación nos permite realizar el análisis de los métodos distributivos que consideramos como una extensión del análisis estándar. Presentamos resultados de existencia de solución del problema discreto, convergencia y estimaciones de error. Por último, presentamos algunos test numéricos resueltos mediante un esquema de tipo distributivo no lineal, el PSI. Estos tests muestran un comportamiento resistente a la generación de oscilaciones parásitas, y una mayor exactitud que un método de las características de primer orden.
2016-02-10
2016-02-10
2007-09
info:eu-repo/semantics/conferenceObject
Chacón Rebollo, T., Gómez Mármol, M.M. y Narbona Reina, G. (2007). Formulación de tipo Petrov-Galerkin de algunos métodos distributivos: Aplicación a las ecuaciones de Navier-Stokes.
http://hdl.handle.net/11441/34446
https://idus.us.es/xmlui/handle/11441/34446
spa
.
MEC MTM2006-01275
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
oai:idus.us.es:11441/1264062024-02-15T07:56:18Zcom_11441_10893com_11441_10802com_11441_10690col_11441_10896
Space-Variant Gabor Decomposition for Filtering 3D Medical Images
Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
Austrian Science Found
This is an experimental paper in which we introduce the possibility to analyze and to synthesize 3D medical images by using multivariate Gabor frames with Gaussian windows. Our purpose is to apply a space-variant filter-like operation in the space-frequency domain to correct medical images corrupted by different types of acquisitions errors. The Gabor frames are constructed with Gaussian windows sampled on non-separable lattices for a better packing of the space-frequency plane. An implementable solution for 3D-Gabor frames with non-separable lattice is given and numerical tests on simulated data are presented.
2021-10-01
2021-10-01
2017
info:eu-repo/semantics/conferenceObject
Onchis, D.M., Istin, C. y Real Jurado, P. (2017). Space-Variant Gabor Decomposition for Filtering 3D Medical Images. En CAIP 2017: 17th International Conference on Computer Analysis of Images and Patterns (455-461), Ystad, Sweden: Springer.
978-3-319-64697-8
0302-9743
https://hdl.handle.net/11441/126406
10.1007/978-3-319-64698-5_38
21357798
eng
CAIP 2017: 17th International Conference on Computer Analysis of Images and Patterns (2017), pp. 455-461.
P27516
https://link.springer.com/chapter/10.1007%2F978-3-319-64698-5_38
Cham, Switzerland
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Springer
oai:idus.us.es:11441/1263732024-02-14T13:28:35Zcom_11441_10893com_11441_10802com_11441_10690col_11441_10896
Obtaining Homology Groups in Binary 2D Images Using P Systems
Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
Junta de Andalucía
Ministerio de Educación y Ciencia (MEC). España
Membrane Computing is a new paradigms inspired
from cellular communication. We use in this paper the computational
devices called P systems to calculate in a general maximally
parallel manner the homology groups of binary 2D images. So,
the computational time to calculate this homology information
only depends on the thickness of them.
2021-09-30
2021-09-30
2009
info:eu-repo/semantics/conferenceObject
Christinal, H.A., Díaz Pernil, D. y Real Jurado, P. (2009). Obtaining Homology Groups in Binary 2D Images Using P Systems. En BICTA 2009: 4th International Conference on Bio-Inspired Computing, Theories and Applications Beijing, China: IEEE Computer Society.
978-1-4244-3866-2
https://hdl.handle.net/11441/126373
10.1109/BICTA.2009.5338099
eng
BICTA 2009: 4th International Conference on Bio-Inspired Computing, Theories and Applications (2009).
FQM-296
TIN2006-13425
P08-TIC-04200
MTM2006-03722
PO6-TIC-02268
https://ieeexplore.ieee.org/document/5338099
New York, USA
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
IEEE Computer Society
oai:idus.us.es:11441/936482024-02-17T17:20:48Zcom_11441_11291com_11441_11290com_11441_10690com_11441_11331com_11441_10893com_11441_10802col_11441_11294col_11441_11334col_11441_10896
Enhanced Parallel Generation of Tree Structures for the Recognition of 3D Images
Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
Universidad de Sevilla. Departamento de Arquitectura y Tecnología de Computadores
Universidad de Sevilla. Departamento de Ingeniería Aeroespacial y Mecánica de Fluidos
3D digital images
Parallel computing
Abstract cell complex
Homological Spanning Forest
Crack transport
Segmentations of a digital object based on a connectivity
criterion at n-xel or sub-n-xel level are useful tools in image topological
analysis and recognition. Working with cell complex analogous of digital
objects, an example of this kind of segmentation is that obtained from
the combinatorial representation so called Homological Spanning Forest
(HSF, for short) which, informally, classifies the cells of the complex as
belonging to regions containing the maximal number of cells sharing the
same homological (algebraic homology with coefficient in a field) information.
We design here a parallel method for computing a HSF (using
homology with coefficients in Z/2Z) of a 3D digital object. If this object
is included in a 3D image of m1 × m2 × m3 voxels, its theoretical time
complexity order is near O(log(m1 + m2 + m3)), under the assumption
that a processing element is available for each voxel. A prototype implementation
validating our results has been written and several synthetic,
random and medical tridimensional images have been used for testing.
The experiments allow us to assert that the number of iterations in which
the homological information is found varies only to a small extent from
the theoretical computational time.
2020-02-26
2020-02-26
2019
info:eu-repo/semantics/conferenceObject
Real Jurado, P., Molina Abril, H., Díaz del Río, F., Blanco Trejo, S. y Onchis, D. (2019). Enhanced Parallel Generation of Tree Structures for the Recognition of 3D Images. En MCPR 2019: 11th Mexican Conference on Pattern Recognition (292-301), Querétaro, Mexico: Springer.
978-3-030-21076-2
0302-9743
https://hdl.handle.net/11441/93648
10.1007/978-3-030-21077-9_27
eng
MCPR 2019: 11th Mexican Conference on Pattern Recognition (2019), p 292-301
MTM2016-81030-P
https://link.springer.com/chapter/10.1007/978-3-030-21077-9_27
Cham, Switzerland
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Springer
oai:idus.us.es:11441/1263072024-02-14T13:35:45Zcom_11441_10893com_11441_10802com_11441_10690col_11441_10896
Imágenes digitales y complejos simploidales
Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
Junta de Andalucía
Ministerio de Educación y Ciencia (MEC). España
2021-09-29
2021-09-29
2007
info:eu-repo/semantics/conferenceObject
González Díaz, R., Jiménez Rodríguez, M.J., Real Jurado, P. y Ruiz Cárdenas, Y. (2007). Imágenes digitales y complejos simploidales. En EAMD 2007: V Encuentro Andaluz de Matemática Discreta (145-152), La Línea de la Concepción (Cádiz): Universidad de Cádiz, Servicio de Publicaciones.
978-84-9828-133-0
https://hdl.handle.net/11441/126307
eng
EAMD 2007: V Encuentro Andaluz de Matemática Discreta (2007), pp. 145-152.
FQM-296
TIC-02268
MTM2006-03722
https://produccioncientifica.uca.es/documentos/5febd93d5ef7446310f95560
Cádiz, España
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Universidad de Cádiz, Servicio de Publicaciones
oai:idus.us.es:11441/336872024-02-17T17:42:11Zcom_11441_33181com_11441_30105com_11441_11301com_11441_11290com_11441_10690com_11441_10893com_11441_10802col_11441_33342col_11441_11304col_11441_10896
Studying the Chlorophyll Fluorescence in Cyanobacteria with Membrane Computing Techniques
Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial
Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
Universidad de Sevilla. TIC193: Computación Natural
Universidad de Sevilla. FQM296: Topología Computacional y Matemática Aplicada
Junta de Andalucía
Ministerio de Economía y Competitividad (MINECO). España
In this paper, we report a pioneer study of the decrease in chlorophyll
uorescence
produced by the reduction of MTT (a dimethyl thiazolyl diphenyl tetrazolium
salt) monitored using an epi
uorescence microscope coupled to automate image analysis
in the framework of P systems. Such analysis has been performed by a family of tissue
P systems working on the images as data inpu
2016-02-01
2016-02-01
2013
info:eu-repo/semantics/conferenceObject
978-84-940691-9-2
http://hdl.handle.net/11441/33687
https://idus.us.es/xmlui/handle/11441/33687
eng
Proceedings of the Eleventh Brainstorming Week on Membrane Computing, 9-24. Sevilla, E.T.S. de Ingeniería Informática, 4-8 de Febrero, 2013,
P08-TIC-04200
info:eu-repo/grantAgreement/MINECO/TIN2012-37434
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Fénix Editora
oai:idus.us.es:11441/602772024-02-13T19:58:16Zcom_11441_33995com_11441_30105com_11441_10893com_11441_10802com_11441_10690col_11441_59964col_11441_10896
Witness bar visibility
Díaz Báñez, José Miguel
Garijo Royo, Delia
Márquez Pérez, Alberto
Urrutia Galicia, Jorge
Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
Universidad de Sevilla. FQM164: Matemática Discreta: Teoría de Grafos y Geometría Computacional
Bar visibility graphs were introduced in the seventies as a model for some VLSI layout problems. They have been also studied since then by the graph drawing community, and recently several generalizations and restricted versions have been proposed. We introduce a generalization, witness-bar visibility graphs, and we prove that this class encompasses all the bar-visibility variations considered so far. In addition, we show that many classes of graphs are contained in this family, including in particular all planar graphs, interval graphs, circular arc graphs and permutation graphs.
2017-05-23
2017-05-23
2013
info:eu-repo/semantics/conferenceObject
Cortés Parejo, M.d.C., Hurtado Díaz, F., Márquez Pérez, A. y Valenzuela Muñoz, J. (2013). Witness bar visibility. En XV Spanish Meeting on Computational Geometry, Sevilla.
http://hdl.handle.net/11441/60277
eng
XV Spanish Meeting on Computational Geometry (2013), pp. 119-122.
MTM2012-30951
DGR 2009SGR1040
CRP ComPoSe
EUI-EURC-2011-4306
http://congreso.us.es/ecgeometry/proceedingsECG2013.pdf
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
oai:idus.us.es:11441/1264732024-02-15T07:38:00Zcom_11441_10893com_11441_10802com_11441_10690col_11441_10896
One More Step Towards Well-Composedness of Cell Complexes over nD Pictures
Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
Ministerio de Economía y Competitividad (MINECO). España
An nD pure regular cell complex K is weakly well-composed
(wWC) if, for each vertex v of K, the set of n-cells incident to v is
face-connected. In previous work we proved that if an nD picture I is
digitally well composed (DWC) then the cubical complex Q(I) associated
to I is wWC. If I is not DWC, we proposed a combinatorial algorithm
to “locally repair” Q(I) obtaining an nD pure simplicial complex PS(I)
homotopy equivalent to Q(I) which is always wWC. In this paper we give
a combinatorial procedure to compute a simplicial complex PS(¯I) which
decomposes the complement space of |PS(I)| and prove that PS(¯I) is also
wWC. This paper means one more step on the way to our ultimate goal:
to prove that the nD repaired complex is continuously well-composed
(CWC), that is, the boundary of its continuous analog is an (n − 1)-
manifold.
2021-10-06
2021-10-06
2019
info:eu-repo/semantics/conferenceObject
Boutry, N., González Díaz, R. y Jiménez Rodríguez, M.J. (2019). One More Step Towards Well-Composedness of Cell Complexes over nD Pictures. En DGCI 2019: 21st IAPR International Conference on Discrete Geometry for Computer Imagery (101-114), Marne-la-Vallée, France: Springer.
978-3-030-14084-7
0302-9743
https://hdl.handle.net/11441/126473
10.1007/978-3-030-14085-4_9
eng
DGCI 2019: 21st IAPR International Conference on Discrete Geometry for Computer Imagery (2019), pp. 101-114.
MTM2015-67072-P
https://link.springer.com/chapter/10.1007/978-3-030-14085-4_9
Cham, Switzerland
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Springer
oai:idus.us.es:11441/615612024-02-14T11:30:09Zcom_11441_33181com_11441_30105com_11441_11291com_11441_11290com_11441_10690com_11441_11391com_11441_10893com_11441_10802col_11441_57572col_11441_11294col_11441_11394col_11441_10896
OPERA: una herramienta de soporte para el aprendizaje basado en proyectos
Corchuelo Gil, Rafael
Jiménez Rodríguez, María José
Romero Ternero, María del Carmen
Universidad de Sevilla. Departamento de Lenguajes y Sistemas Informáticos
Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
Universidad de Sevilla. Departamento de Arquitectura y Tecnología de Computadores
Universidad de Sevilla. Departamento de Tecnología Electrónica
Aprendizaje Basado en Proyectos (ABP)
Gestión de proyectos
Redes sociales
En los últimos años el Aprendizaje Basado en
Proyectos (ABP) ha ganado popularidad en la
docencia de la Ingeniería Informática por su
especial adaptación a los objetivos marcados por
el EEES. Sin embargo, la puesta en marcha de
ABP en asignaturas suele acarrear un
sobreesfuerzo derivado de la falta de adaptación
específica a esta metodología en las herramientas
actuales de soporte al aprendizaje.
En este trabajo presentamos la herramienta
OPERA que se centra en disminuir el esfuerzo de
la aplicación de ABP por parte del profesorado a
través de un soporte específico para la creación de
grupos y temáticas y la evaluación que se plantea
habitualmente al aplicar esta metodología. En
segundo lugar, la herramienta OPERA está
orientada a potenciar la visibilidad de los trabajos
más allá de la asignatura, mediante la creación
automatizada de microportales de proyectos que
se integran mediante el paradigma de “Red
Social” donde los alumnos pueden interactuar
entre ellos. Por último, el acercamiento mediante
OPERA en la asignatura abre la posibilidad de
relacionar trabajos de distinto curso académico
para que el alumno, antes de iniciar su proyecto,
tenga una base de conocimiento de trabajos con
una temática similar al suyo y se potencie el
desarrollo de un catálogo de buenas prácticas a lo
largo de distintos cursos.
2017-06-28
2017-06-28
2011
info:eu-repo/semantics/conferenceObject
Fernández Montes, P., Jiménez Rodríguez, M.J. y García Robles, R. (2011). OPERA: una herramienta de soporte para el aprendizaje basado en proyectos. En XVII Jornadas de Enseñanza Universitaria de la Informática: JENUI 2011 : Actas : Sevilla, 5 al 8 de julio de 2011 (267-274), Sevilla. Escuela Técnica Superior de Ingeniería Informática (Universidad de Sevilla): AENUI: Asociación de Enseñantes Universitarios de Informática.
http://hdl.handle.net/11441/61561
spa
XVII Jornadas de Enseñanza Universitaria de la Informática: JENUI 2011 : Actas : Sevilla, 5 al 8 de julio de 2011 (2011), pp. 267-274.
http://upcommons.upc.edu/handle/2099/11990
Barcelona
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
AENUI: Asociación de Enseñantes Universitarios de Informática
oai:idus.us.es:11441/1091772024-02-14T11:18:02Zcom_11441_10893com_11441_10802com_11441_10690col_11441_10896
Diameter of a set on the cylinder
Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
2021-05-21
2021-05-21
1997
info:eu-repo/semantics/conferenceObject
Cobos, F.J., Dana Jiménez, J.C., Grima Ruiz, C.I. y Márquez Pérez, A. (1997). Diameter of a set on the cylinder. En CCCG 1997: 9th Canadian Conference on Computational Geometry Kingston, Ontario, Canada: Queen's University.
https://hdl.handle.net/11441/109177
eng
CCCG 1997: 9th Canadian Conference on Computational Geometry (1997).
https://www.cccg.ca/proceedings/1997/
Kingston, Ontario, Canada
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Queen's University
oai:idus.us.es:11441/693682024-02-13T09:15:58Zcom_11441_10883com_11441_10802com_11441_10690com_11441_10893col_11441_10886col_11441_10896
El papel de las webquest en las NTIC
Universidad de Sevilla. Departamento de Geometría y Topología
Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
La ponencia que aquí se presenta persigue un triple objetivo. Por una parte,
mostrarle al lector en general, y al profesorado de Secundaria y Bachillerato en particular, el concepto de WebQuest (WQ) y sus principales aplicaciones a la enseñanza como herramienta sencilla y cómoda de utilizar por el alumnado de estos niveles en el estudio de cualquier disciplina de su currículo (nuestra formación nos ha hecho optar por la materia Matemáticas). Como se verá en la ponencia, por WQ se entiende cualquier actividad de investigación en la que se usa la información disponible en Internet y que está estructurada y guiada para evitar los obstáculos que conlleva toda búsqueda en la red de información contrastada, de tal modo
que se les proporciona al alumnado una tarea bien definida, así como los recursos y las consignas que les permitan realizarlas. En este sentido, las WQ constituyen una estrategia didáctica en la que el alumnado construye su propio conocimiento. En segundo lugar, se hará un estudio crítico de gran parte de las aún no muy numerosas WQ en castellano sobre el bloque de Estadística en los niveles anteriormente citados, comentando
Congreso Internacional de Educación CIVE 2008 aquellos aspectos que nos parecen positivos aunque también reflejando los menos favorables, sugiriendo posibles soluciones de mejora. La elección del bloque de Estadística se debe a sus aplicaciones prácticas en la vida real y con el fin de no dispersar la temática de la ponencia. Finalmente, también se animará al profesorado a utilizar esta herramienta, primero valiéndose de WQ ya hechas y, después, elaborando las suyas propias con el contenido que estimen oportuno. No es difícil crear nuestra propia WQ, pues no necesita conocimientos específicos de informática o de programación en general. Solo tecleando las palabras “crear una WQ” en un buscador obtendremos varias direcciones que muestran cómo crear una de forma muy sencilla
y directa. Basta con seguir indicaciones como “escriba aquí el título”, “escriba aquí la tarea”…
2018-01-23
2018-01-23
2008-07
info:eu-repo/semantics/conferenceObject
Falcón Ganfornina, Ó.J., Falcón Ganfornina, R.M., Núñez Valdés, J. y Tenorio, Á.F. (2008). El papel de las webquest en las NTIC. En Congreso internacional virtual de educación CIVE.
https://hdl.handle.net/11441/69368
spa
Congreso internacional virtual de educación CIVE (2008),
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
oai:idus.us.es:11441/936622024-02-17T16:18:41Zcom_11441_11291com_11441_11290com_11441_10690com_11441_10893com_11441_10802col_11441_11294col_11441_10896
Topological Homogeneity for Electron Microscopy Images
Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
Universidad de Sevilla. Departamento de Arquitectura y Tecnología de Computadores
Topology
Homogeneity
Electron microscopy
Images
In this paper, the concept of homogeneity is defined, from a
topological perspective, in order to analyze how uniform is the material
composition in 2D electron microscopy images. Topological multiresolution
parameters are taken into account to obtain better results than
classical techniques.
2020-02-26
2020-02-26
2019
info:eu-repo/semantics/conferenceObject
Molina Abril, H., Díaz del Río, F., Guerrero Lebrero, M.P., Real Jurado, P., Barcena, G., Braza, V.,...,Galindo Riaño, P.L. (2019). Topological Homogeneity for Electron Microscopy Images. En CTIC 2019 : 7th International Workshop on Computational Topology in Image Contex (166-178), Málaga, España: Springer.
978-3-030-10827-4
0302-9743
https://hdl.handle.net/11441/93662
10.1007/978-3-030-10828-1_13
eng
CTIC 2019 : 7th International Workshop on Computational Topology in Image Contex (2019), p 166-178
MTM2016-81030-P
TEC2012-37868-C04-02
https://link.springer.com/chapter/10.1007/978-3-030-10828-1_13
Cham, Switzerland
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Springer
oai:idus.us.es:11441/869302024-02-13T20:10:09Zcom_11441_10893com_11441_10802com_11441_10690col_11441_10896
Un modelo 1D NPZ de acoplamiento entre la hidrodinámica y los flujos biogeoquímicos en estrechos bicapa. Aplicación a la dinámica mareal en el Estrecho de Gibraltar.
Universidad de Sevilla. Departamento de Matemática Aplicada I
Universidad de Sevilla. FQM120: Modelado Matemático y Simulación de Sistemas Medioambientales
Modelo NPZ
Shallow water bicapa
Flujos biogeoquímicos
Estrecho de Gibraltar
Los modelos NPZ (siglas para Nutrientes-Fitoplancton-Zooplancton en inglés) son comúnmente utilizados en estudios de biología marina. Este tipo de modelos utiliza un conjunto de ecuaciones diferenciales muy sencillo para medir la dinámica del plancton marino. Las variables de estado de las cuales se modeliza su evolución son los nutrientes, el toplancton y el zooplankton, esto se hace en términos de su contenido de nitrógeno, ya que este compuesto el que normalmente limita la producción primaria en el océano. En este trabajo se implementa el acoplado de un modelo NPZ para el modelado de los flujos biogeoquímicos con un modelo de aguas poco profundas bicapa para la hidrodinámica. El objetivo es aplicar este modelo a la simulación de flujos biogeoquímicos en el Estrecho de Gibraltar con imposición de la dinámica mareal.
2019-05-29
2019-05-29
2013-09
info:eu-repo/semantics/conferenceObject
Fernández Nieto, E.D., Castro Díaz, M.J. y Macias Sanchez, J. (2013). Un modelo 1D NPZ de acoplamiento entre la hidrodinámica y los flujos biogeoquímicos en estrechos bicapa. Aplicación a la dinámica mareal en el Estrecho de Gibraltar.. En XXIII Congreso de Ecuaciones Diferenciales y Aplicaciones / XIII Congreso de Matemática Aplicada, Castellón.
https://hdl.handle.net/11441/86930
spa
XXIII Congreso de Ecuaciones Diferenciales y Aplicaciones / XIII Congreso de Matemática Aplicada (2013), pp. 1-8.
M2012-38383-C02-02
P11-RNM7069
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
oai:idus.us.es:11441/1099722024-02-13T21:57:16Zcom_11441_10893com_11441_10802com_11441_10690col_11441_10896
Regiones estables e isoperimétricas en variedades con densidad
Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
2021-05-26
2021-05-26
2013
info:eu-repo/semantics/conferenceObject
Cañete Martín, A.J. (2013). Regiones estables e isoperimétricas en variedades con densidad. En 2º Congreso de Jóvenes Investigadores de la RSME Sevilla, España: Real Sociedad Matemática Española.
https://hdl.handle.net/11441/109972
spa
2º Congreso de Jóvenes Investigadores de la RSME (2013).
https://www.rsme.es/2013/09/libro-de-abstracts-del-2o-congreso-de-jovenes-investigadores-de-la-rsme-ed-rsme-2013/
Madrid, España
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Real Sociedad Matemática Española
oai:idus.us.es:11441/1496702024-02-13T22:11:58Zcom_11441_10893com_11441_10802com_11441_10690col_11441_10896
Algorithm for planning faster routes in urban networks with time-dependant arcs and the possibility of introducing waiting periods at nodes
Passerini, Giorgio
Ricci, Stefano
Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
Universidad de Sevilla. Departamento de Matemática Aplicada II (ETSI)
Universidad de Sevilla. FQM241: Grupo de Investigación en Localización
Ministerio de Ciencia e Innovación (MICIN). España
European Commission (EC). Fondo Europeo de Desarrollo Regional (FEDER)
Route planning
Guided transport systems
Mobility
Transport networks
Dijkstra’s algorithm
Navigation systems implemented in mobile devices allow users to search for the shortest routes between pairs of points. Many of the existing commercial products assume in a simplified way that the travel time to cross each arc of a road network is fixed, once a starting time has been established. However, the real travel time along a road section within cities depends on many factors that are related to traffic
congestion, weather conditions, possible incidents, etc., and consequently, it depends on the time. As can easily be shown, determining the shortest itineraries in a network whose arcs are time-dependent can result in a diversity of optimal routes for a same origin–destination pair based on different departure times. Assuming the availability of the estimated data of the time required to travel along each section
of the street network, once the departure time has been previously set, we propose in this work an efficient algorithm for obtaining faster routes on time-dependent arcs, in such a way that the sum of driving times is minimized, which in parallel allows improving fuel consumption and reducing associated polluting emissions. The possibility of introducing waiting periods in the nodes to optimize the total time spent on the trip has also been considered in the design of the proposed procedure. An experimental evaluation is carried out to show the effectiveness of the provided algorithm.
2023-10-13
2023-10-13
2022
info:eu-repo/semantics/conferenceObject
Ortega Riejos, F.A., Marseglia, G., Mesa López-Colmenar, J.A. y Piedra de la Cuadra, R. (2022). Algorithm for planning faster routes in urban networks with time-dependant arcs and the possibility of introducing waiting periods at nodes. En 28th International Conference on Urban and Maritime Transport and the Environment, UMT 2022 (25-36), WIT Press.
1746-4498
1743-3509
https://hdl.handle.net/11441/149670
10.2495/UMT220031
eng
28th International Conference on Urban and Maritime Transport and the Environment, UMT 2022 (2022), pp. 25-36.
PID2019-106205GB-I00
https://www.witpress.com/elibrary/wit-transactions-on-the-built-environment/212/38407
Ashurst (United Kingdom)
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
WIT Press
oai:idus.us.es:11441/344402024-02-13T09:37:40Zcom_11441_33995com_11441_30105com_11441_10893com_11441_10802com_11441_10690col_11441_33996col_11441_10896
Tratamiento asintótico de las condiciones de contorno para problemas de convección dominante
Universidad de Sevilla. Departamento de Ecuaciones Diferenciales y Análisis Numérico
Ministerio de Educación y Ciencia
Convección dominante
convección-difusión
perturbaciones singulares
En este trabajo realizamos un an alisis de paso al l mite singular en una ecuaci ón evolutiva de convecci ón-difusióon, imponiendo el flujo total normal en la frontera de entrada de flujo y una condici on de tipo Newmann en el resto de la frontera. Probamos que la soluci ón de este problema converge en L2 (Q) a la de la ecuaci ón de convecci ón pura con una condicióon de contorno de tipo Dirichlet en la frontera de entrada de flujo.
Adem ás convergen las derivadas convectivas en L2 (Q) y las trazas convectivas en las fronteras de entrada y salida de flujo en espacios de tipo L2. Este estudio permite justi car la forma en la que ciertos m étodos numéricos de resolucióon de modelos de convecci ón-difusi ón imponen las condiciones de contorno.
2016-02-10
2016-02-10
2007-09
info:eu-repo/semantics/conferenceObject
Chacón Rebollo, T., Gómez Mármol, M.M. y Sánchez Muñoz, I.M. (2007). Tratamiento asintótico de las condiciones de contorno para problemas de convección dominante.
http://hdl.handle.net/11441/34440
https://idus.us.es/xmlui/handle/11441/34440
spa
.
MTM2006-01275
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
oai:idus.us.es:11441/1118022024-02-14T20:18:49Zcom_11441_10893com_11441_10802com_11441_10690col_11441_10896
MONACO - Multi-Objective Network Optimisation Based on an ACO
Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
The Ant Colony Optimisation Algorithm (ACO) supports the development
of a system for a multi-objective network optimisation
problem. The ACO system bases itself on an agent’s population and,
in this case, uses a multi-level pheromone trail associated to a cost
vector, which will be optimised.
2021-06-15
2021-06-15
2003
info:eu-repo/semantics/conferenceObject
Cardoso, P., Jesus, M. y Márquez Pérez, A. (2003). MONACO - Multi-Objective Network Optimisation Based on an ACO. En EGC 2003: X Encuentros de Geometría Computacional Sevilla, España: Universidad de Sevilla.
https://hdl.handle.net/11441/111802
eng
EGC 2003: X Encuentros de Geometría Computacional (2003).
https://congreso.us.es/egc03/inicio.htm
Sevilla, España
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Universidad de Sevilla
oai:idus.us.es:11441/692462024-02-17T17:42:21Zcom_11441_10893com_11441_10802com_11441_10690col_11441_10896
Elaboración de una presentación interactiva de diapositivas con GeoGebra
Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
Si bien GeoGebra es un software de Geometría Dinámica que dispone de herramientas como la “Barra de navegación por pasos” y posibilita la animación de ciertos elementos en las construcciones geométricas realizadas, no parece que pueda plantearse a priori como un programa diseñado para elaborar presentaciones secuenciales, con comentarios en cada paso que puedan guiar al alumnado en la resolución del problema en cuestión. En el presente taller se comprobará experimentalmente que todas estas dificultades pueden solventarse gracias a la posibilidad de usar deslizadores, casillas de control y operadores booleanos, unido a unas básicas nociones de programación en Java.
2018-01-19
2018-01-19
2010-09
info:eu-repo/semantics/conferenceObject
Falcón Ganfornina, R.M., Barrena Algara, E., Ramírez Campos, R. y Ríos Collantes de Terán, R. (2010). Elaboración de una presentación interactiva de diapositivas con GeoGebra. En XIII Congreso de Enseñanza y Aprendizaje de las Matemáticas, Córdoba, Andalucía.
https://hdl.handle.net/11441/69246
spa
XIII Congreso de Enseñanza y Aprendizaje de las Matemáticas (2010), p 55-59
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
oai:idus.us.es:11441/1091102024-02-14T19:07:29Zcom_11441_10893com_11441_10802com_11441_10690col_11441_10896
Cuentos y cuentas para despertar la curiosidad
Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
Pese a la revolución científica y tecnológica de finales de siglo XX y comienzos del
XXI, la enseñanza de las matemáticas a todos los niveles pero, especialmente, en
educación primaria y secundaria, sigue, en la mayoría de los casos, anclada en los
métodos y contenidos tradicionales. No se aprovechan, como se podría, los nuevos
recursos tecnológicos (que nos dejarían más tiempo para más contenidos), pero
sobre todo, se siguen presentando, muchas veces, sin contexto. En esta conferencia
presentamos un proyecto, “Mati y sus mateaventuras”, que pretende dar algunas
ideas sobre cómo y qué se puede cambiar en la enseñanza de las matemáticas para
hacerlas más atractivas y más acordes con nuestros tiempos.
2021-05-20
2021-05-20
2014
info:eu-repo/semantics/conferenceObject
Grima Ruiz, C.I. (2014). Cuentos y cuentas para despertar la curiosidad. En CEAM THALES 2014 : XV Congreso de enseñanza y aprendizaje de las matemáticas: el sentido de las matemáticas. Matemáticas con sentido (59-64), Baeza, Jaén: THALES: Sociedad Andaluza de Educación Matemática.
978-84-15641-08-7
https://hdl.handle.net/11441/109110
spa
CEAM THALES 2014 : XV Congreso de enseñanza y aprendizaje de las matemáticas: el sentido de las matemáticas. Matemáticas con sentido (2014), pp. 59-64.
https://thales.cica.es/xvceam/actas/h/conferencias.html
Sevilla, España
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
THALES: Sociedad Andaluza de Educación Matemática
oai:idus.us.es:11441/693332024-02-13T22:01:58Zcom_11441_10893com_11441_10802com_11441_10690col_11441_10896
Determinants of latin squares of a given pattern
Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
Cycle structures of autotopisms of Latin squares determine all possible patterns of this kind of design. Moreover, given any isotopism, the number of Latin squares containing it in their autotopism group only depends on the cycle structure of this isotopism. This number has been studied in for Latin squares of order up to 7, by following the classification given in. Specifically, regarding each symbol of a Latin square as a variable, any Latin square can be seen as the vector space associated with the solution of an algebraic system of polynomial equations, which can be solved using Gröbner bases, by following the ideas implemented by Bayer to solve the problem of n-colouring a graph. However, computations for orders higher than 7 have been shown to be very difficult without using some other combinatorial tools. In this sense, we will see in this paper the possibility of studying the determinants of those Latin squares related to a given cycle structure. Specifically, since the determinant of a Latin square can be seen as a polynomial of degree n in n variables, it will determine a new polynomial equation that can be included into the previous system. Moreover, since determinants of Latin squares of order up to 7 determine their isotopic classes, we will study the set of isotopic classes of Latin squares of these orders related to each cycle structure.
2018-01-23
2018-01-23
2008-07
info:eu-repo/semantics/conferenceObject
Falcón Ganfornina, R.M. (2008). Determinants of latin squares of a given pattern. En Fifth european congress of Mathematics, Amsterdam (Holanda).
https://hdl.handle.net/11441/69333
eng
Fifth european congress of Mathematics (2008),
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
oai:idus.us.es:11441/1258852024-02-17T17:14:33Zcom_11441_10893com_11441_10802com_11441_10690col_11441_10896
An algorithm for computing the first homology groups of CDGAs with linear differential
Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
Junta de Andalucía
Ministerio de Educación y Ciencia (MEC). España
We design here a primary platform for computing the basic homological information of Commutative Differential Graded Algebras (brie
y, CDGAs), endowed
with linear differential. All the algorithms have been implemented in the frame-
work settled by Mathematica, so that we can take advantage of the use of symbolic
computation and many other powerful tools this system provides.
2021-09-16
2021-09-16
1999
info:eu-repo/semantics/conferenceObject
Álvarez Solano, V., Armario Sampalo, J.A., Frau García, M.D., Real Jurado, P. y Silva Gallardo, B. (1999). An algorithm for computing the first homology groups of CDGAs with linear differential. En IMS 1999: Third International Mathematica Symposium Hagenberg, Austria: Research Institute for Symbolic Computation.
https://hdl.handle.net/11441/125885
eng
IMS 1999: Third International Mathematica Symposium (1999).
FQM-0143
PB97-1025-C02-02
https://www3.risc.jku.at/conferences/summer99/ims99/
Hagenberg, Austria
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Research Institute for Symbolic Computation
oai:idus.us.es:11441/350252024-02-13T19:59:26Zcom_11441_33995com_11441_30105com_11441_10893com_11441_10802com_11441_10690col_11441_33996col_11441_10896
Deducción y simulación numérica de un nuevo modelo de avalanchas submarinas
Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
Ministerio de Educación y Ciencia
Avalanchas submarinas
Savage-Hutter
Volúmenes Finitos
En este trabajo se estudia un nuevo modelo de tipo Savage-Hutter para avalanchas submarinas. El modelo obtenido es de tipo aguas someras bicapa en el que la capa superior representa al fluido y la capa inferior representa a un estrato de material granular. En la deducción del modelo se han tenido en cuenta diferentes leyes constitutivas en los tensores de esfuerzos, la porosidad del estrato de sedimento o roca y un término de fricción de tipo Coulomb. El modelo obtenido puede aplicarse en el estudio
de problemas de avalanchas submarinas y algunos tipos de tsunamis. Finalmente se presentan la discretización del modelo obtenido mediante técnicas de vol´umenes finitos bien equilibrados y un ensayo numérico donde se modela una avalancha submarina.
2016-02-17
2016-02-17
2007-09
info:eu-repo/semantics/conferenceObject
Fernández Nieto, E.D., Bouchut, F., Bresch, D., Castro Díaz, M.J. y Mangeney, A. (2007). Deducción y simulación numérica de un nuevo modelo de avalanchas submarinas.
http://hdl.handle.net/11441/35025
https://idus.us.es/xmlui/handle/11441/35025
spa
.
MTM2007-08075
MTM2006-01275
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
oai:idus.us.es:11441/876962024-02-15T07:53:00Zcom_11441_10893com_11441_10802com_11441_10690col_11441_10896
Characterising epithelial tissues using persistent entropy
Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
In this paper, we apply persistent entropy, a novel topological statis-
tic, for characterization of images of epithelial tissues. We have found
out that persistent entropy is able to summarize topological and geomet-
ric information encoded by -complexes and persistent homology. After
using some statistical tests, we can guarantee the existence of signi cant
di erences in the studied tissues.
2019-07-01
2019-07-01
2019
info:eu-repo/semantics/conferenceObject
Atienza Martínez, M.N., Escudero Cuadrado, L.M., Jiménez Rodríguez, M.J. y Soriano Trigueros, M. (2019). Characterising epithelial tissues using persistent entropy. En CTIC 2019 : 7th International Workshop on Computational Topology in Image Contex (179-190), Málaga, España: Springer.
978-3-030-10827-4
0302-9743
https://hdl.handle.net/11441/87696
10.1007/978-3-030-10828-1_14
eng
CTIC 2019 : 7th International Workshop on Computational Topology in Image Contex (2019), p 179-190
MTM2015-67072-P
https://link.springer.com/chapter/10.1007/978-3-030-10828-1_14
Berlin
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Springer
oai:idus.us.es:11441/679002024-02-17T17:00:52Zcom_11441_33181com_11441_30105com_11441_10893com_11441_10802com_11441_10690col_11441_67540col_11441_10896
Transforming 3D cartesian into geodetic coordinates
Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
Transformationbetweengeodeticcoordinates(φ,λ,h)(geodeticlattitudeφ,geodeticlongitudeλandellipsoidal/geodeticheight h) and cartesian coordinates has been studied over the years, being a subject of interest in many fields as Geodesy, Aerospace Engineering, Building Engineering, Architecture etc. Most recent works related to this topic present iterative methods for the transformation on a biaxial or triaxial ellipsoid. Our ongoing approach consists in developping a method which directly perform the transformation from 3D cartesian coordinates into geodetic coordinates by using Computer Algebra techniques (mainly Gröbner bases). The celestial bodies considered in our numerical tests are Moon, Io, Europa, Mimas and Enceladus. The method we are developping is going to be implemented in the Computer Algebra System Maple, together with the iterative methods above mentioned, in order to adequately compare their efficiency.
2017-12-21
2017-12-21
2017
info:eu-repo/semantics/conferenceObject
Díaz-Toca, G. y Necula, I. (2017). Transforming 3D cartesian into geodetic coordinates.
http://hdl.handle.net/11441/67900
eng
Congreso Español de Informática Gráfica (27º.2017. Sevilla) (2017)
file:///C:/Users/user/Desktop/CEIG_2017_posteres-4-4.pdf
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
oai:idus.us.es:11441/330322024-02-14T13:35:58Zcom_11441_33181com_11441_30105com_11441_11301com_11441_11290com_11441_10690com_11441_10893com_11441_10802col_11441_33343col_11441_11304col_11441_10896
Solving SAT with Antimatter in Membrane Computing
Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial
Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
Universidad de Sevilla. TIC193: Computación Natural
Universidad de Sevilla. FQM296: Topología Computacional y Matemática Aplicada
Ministerio de Economía y Competitividad (MINECO). España
The set of NP-complete problems is split into weakly and strongly NP-
complete ones. The di erence consists in the in
uence of the encoding scheme of the
input. In the case of weakly NP-complete problems, the intractability depends on the
encoding scheme, whereas in the case of strongly NP-complete problems the problem
is intractable even if all data are encoded in a unary way. The reference for strongly
NP-complete problems is the Satis ability Problem (the SAT problem). In this paper,
we provide a uniform family of P systems with active membranes which solves SAT {
without polarizations, without dissolution, with division for elementary membranes and
with matter/antimatter annihilation. To the best of our knowledge, it is the rst solution
to a strongly NP-complete problem in this P system model.
2016-01-21
2016-01-21
2015
info:eu-repo/semantics/conferenceObject
978-84-944366-2-8
http://hdl.handle.net/11441/33032
https://idus.us.es/xmlui/handle/11441/33032
eng
Proceedings of the Thirteenth Brainstorming Week on Membrane Computing, 121-130. Sevilla, E.T.S. de Ingeniería Informática, 2-6 de Febrero, 2015,
info:eu-repo/grantAgreement/MINECO/TIN2012-37434
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Fénix Editora
oai:idus.us.es:11441/1118422024-02-14T11:24:20Zcom_11441_10893com_11441_10802com_11441_10690col_11441_10896
Separación y clasificación de puntos rojos y azules
Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
Ministerio de Educación y Ciencia (MEC). España
Junta de Andalucía
Agència de Gestió d'Ajuts Universitaris i de Recerca (Agaur)
En este trabajo estudiamos el problema de determinar si dos conjuntos disjuntos de n puntos
en el plano son separables mediante una estructura de 2-level tree, compuesta por una recta y dos
semirrectas, y diseñamos algoritmos óptimos de tiempo £(n log n) para resolver este problema.
2021-06-16
2021-06-16
2007
info:eu-repo/semantics/conferenceObject
Garijo Royo, D., Márquez Pérez, A., Mitchell, J.S.B. y Seara, C. (2007). Separación y clasificación de puntos rojos y azules. En EGC 2007: XII Encuentros de Geometría Computacional Valladolid, España: Universidad de Valladolid.
https://hdl.handle.net/11441/111842
spa
EGC 2007: XII Encuentros de Geometría Computacional (2007).
MTM2005-08441-C02-01
FQM-0164
MTM2006-01267
DURSI 2005SGR00692.
https://www.infor.uva.es/egc07/programa.html
Valladolid, España
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Universidad de Valladolid
oai:idus.us.es:11441/754222024-02-13T22:04:21Zcom_11441_33995com_11441_30105com_11441_10893com_11441_10802com_11441_10690col_11441_75277col_11441_10896
El problema de Turán sobre grafos bipartitos completos
Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
Universidad de Sevilla. FQM240: Invariantes en Teoría de Grafos y Optimización
2018-05-30
2018-05-30
2002
info:eu-repo/semantics/conferenceObject
Cera López, M., Diánez Martínez, A.R.,...,Valenzuela Tripodoro, J.C. (2002). El problema de Turán sobre grafos bipartitos completos. (pp. 246-247). Santander: Alberto Márquez
8460752704
https://hdl.handle.net/11441/75422
spa
Santander
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Atribución-NoComercial-SinDerivadas 3.0 Estados Unidos de América
Alberto Márquez
oai:idus.us.es:11441/692242024-02-17T16:33:49Zcom_11441_10893com_11441_10802com_11441_10690col_11441_10896
GeoGebra, un primer paso para diseñar la Arquitectura Dinámica del siglo XXI
Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
2018-01-19
2018-01-19
2017-04-22
info:eu-repo/semantics/conferenceObject
Falcón Ganfornina, R.M. (2017). GeoGebra, un primer paso para diseñar la Arquitectura Dinámica del siglo XXI. En V Encuentro en Andalucía GeoGebra en el aula, Málaga, Andalucía.
https://hdl.handle.net/11441/69224
spa
V Encuentro en Andalucía GeoGebra en el aula (2017),
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
oai:idus.us.es:11441/935932024-02-13T08:52:57Zcom_11441_11291com_11441_11290com_11441_10690com_11441_10893com_11441_10802col_11441_11294col_11441_10896
Computing the Component-Labeling and the Adjacency Tree of a Binary Digital Image in Near Logarithmic-Time
Universidad de Sevilla. Departamento de Arquitectura y Tecnología de Computadores
Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
Component-Labeling
Adjacency tree
Digital image
Parallelism
Connected component labeling (CCL) of binary images is
one of the fundamental operations in real time applications. The adjacency
tree (AdjT) of the connected components offers a region-based
representation where each node represents a region which is surrounded
by another region of the opposite color. In this paper, a fully parallel
algorithm for computing the CCL and AdjT of a binary digital image
is described and implemented, without the need of using any geometric
information. The time complexity order for an image of m × n pixels
under the assumption that a processing element exists for each pixel is
near O(log(m+ n)). Results for a multicore processor show a very good
scalability until the so-called memory bandwidth bottleneck is reached.
The inherent parallelism of our approach points to the direction that
even better results will be obtained in other less classical computing
architectures.
2020-02-25
2020-02-25
2019
info:eu-repo/semantics/conferenceObject
Díaz del Río, F., Molina Abril, H. y Real Jurado, P. (2019). Computing the Component-Labeling and the Adjacency Tree of a Binary Digital Image in Near Logarithmic-Time. En CTIC 2019 : 7th International Workshop on Computational Topology in Image Contex (82-95), Málaga, España: Springer.
978-3-030-10827-4
0302-9743
https://hdl.handle.net/11441/93593
10.1007/978-3-030-10828-1_7
eng
CTIC 2019 : 7th International Workshop on Computational Topology in Image Contex (2019), p 82-95
MTM2016-81030-P
TEC2012-37868-C04-02
https://link.springer.com/chapter/10.1007/978-3-030-10828-1_7
Cham, Switzerland
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Springer
oai:idus.us.es:11441/1264722024-02-14T19:34:16Zcom_11441_10893com_11441_10802com_11441_10690col_11441_10896
On the Space Between Critical Points
Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
The vertices of the neighborhood graph of a digital picture P can be interpolated to form a 2-manifold M with critical points (maxima, minima, saddles), slopes and plateaus being the ones recognized by local binary patterns (LBPs). Neighborhood graph produces a cell decomposition of M: each 0-cell is a vertex in the neighborhood graph, each 1-cell is an edge in the neighborhood graph and, if P is well-composed, each 2-cell is a slope region in M in the sense that every pair of s in the region can be connected by a monotonically increasing or decreasing path. In our previous research, we produced superpixel hierarchies (combinatorial graph pyramids) that are multiresolution segmentations of the given picture. Critical points of P are preserved along the pyramid. Each level of the pyramid produces a slope complex which is a cell decomposition of M preserving critical points of P and such that each 2-cell is a slope region. Slope complexes in different levels of the pyramid are always homeomorphic. Our aim in this research is to explore the configuration at the top level of the pyramid which consists of a slope complex with vertices being only the critical points of P. We also study the number of slope regions on the top.
2021-10-06
2021-10-06
2019
info:eu-repo/semantics/conferenceObject
Kropatsch, W.G., Moreno Casablanca, R., Batavia, D. y González Díaz, R. (2019). On the Space Between Critical Points. En DGCI 2019: 21st IAPR International Conference on Discrete Geometry for Computer Imagery (115-126), Marne-la-Vallée, France: Springer.
978-3-030-14084-7
0302-9743
https://hdl.handle.net/11441/126472
10.1007/978-3-030-14085-4_10
eng
DGCI 2019: 21st IAPR International Conference on Discrete Geometry for Computer Imagery (2019), pp. 115-126.
https://link.springer.com/chapter/10.1007/978-3-030-14085-4_10
Cham, Switzerland
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Springer
oai:idus.us.es:11441/754532024-02-13T08:58:49Zcom_11441_33995com_11441_30105com_11441_10893com_11441_10802com_11441_10690col_11441_75277col_11441_10896
Conexiones ortogonales con vértices prefijados
Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
Universidad de Sevilla. FQM164: Matemática Discreta: Teoría de Grafos y Geometría Computacional
2018-05-30
2018-05-30
2002
info:eu-repo/semantics/conferenceObject
Garrido Vizuete, M.d.l.A., Márquez Pérez, A.,...,Reyes Colume, P. (2002). Conexiones ortogonales con vértices prefijados. (pp. 102-109). Santander: Alberto Márquez
8460752704
https://hdl.handle.net/11441/75453
spa
Santander
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Atribución-NoComercial-SinDerivadas 3.0 Estados Unidos de América
Alberto Márquez
oai:idus.us.es:11441/389892024-02-13T19:57:44Zcom_11441_33181com_11441_30105com_11441_11301com_11441_11290com_11441_10690com_11441_10893com_11441_10802col_11441_34360col_11441_11304col_11441_10896
Tissue-like P Systems Without Environment
Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial
Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
Universidad de Sevilla. TIC193: Computación Natural
Universidad de Sevilla. FQM296: Topología Computacional y Matemática Aplicada
In this paper we present a tissue-like P systems model with cell division
the environment has been replaced by an extra cell. In such model, we present a uniform family of recognizer P systems which solves the Subset Sum problem. This solution
establishes a new frontier for the tractability of computationally hard problems in Membrane Computing, since it proves that NP-complete problems can be solved without an
arbitrarily large amount of objects in the environment.
2016-03-28
2016-03-28
2010
info:eu-repo/semantics/conferenceObject
9788461423576
http://hdl.handle.net/11441/38989
https://idus.us.es/xmlui/handle/11441/38989
eng
Proceedings of the Eighth Brainstorming Week on Membrane Computing, 53-64. Sevilla, E.T.S. de Ingeniería Informática, 1-5 de Febrero, 2010
TIN2008-04487-E
TIN-2009-13192
P08-TIC-04200
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Fénix Editora
oai:idus.us.es:11441/1264132024-02-12T21:36:29Zcom_11441_10893com_11441_10802com_11441_10690col_11441_10896
Topological Comparisons of Fluvial Reservoir Rock Volumes Using Betti Numbers: Application to CO2 Storage Uncertainty Analysis
Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
To prevent the release of large quantities of CO2 into the
atmosphere, carbon capture and storage (CCS) represents a potential
means of mitigating the contribution of fossil fuel emissions to global
warming and ocean acidification. Fluvial saline aquifers are favourite
targeted reservoirs for CO2 storage. These reservoirs are very heterogeneous
but their heterogeneities were rarely integrated into CO2 reservoir
models. Moreover, contrary to petroleum reservoirs, the available
dataset is very limited and not supposed to be enriched. This leads to
wide uncertainties on reservoir characteristics required for CSS management
(injection location, CO2 plume migration, etc.). Stochastic simulations
are classical strategies in such under-constrained context. They aim
at generating a wide number of models that all fit the available dataset.
The generated models serve as support for computing the required reservoir
characteristics and their uncertainties. A challenge is to optimize
the uncertainty computations by selecting stochastic models that should
have a priori very different flow behaviours. Fluid flows depend on the
connectivity of reservoir rocks (channel deposits). In this paper, it is
proposed to study the variability of the Betti numbers in function of different
fluvial architectures. The aim is to quantify the impact of fluvial
heterogeneities and their spatial distribution on reservoir rock topology
and then on CO2 storage capacities. Representative models of different
scenarios of channel stacking and their internal heterogeneities are generated
using geostatistical simulation approaches. The Betti numbers are
computed on each generated models and statistically analysed to exhibit
if fluvial architecture controls reservoir topology.
2021-10-01
2021-10-01
2016
info:eu-repo/semantics/conferenceObject
Dahrabou, A., Viseur, S., González Lorenzo, A., Rohmer, J., Bac, A., Real Jurado, P.,...,Audigane, P. (2016). Topological Comparisons of Fluvial Reservoir Rock Volumes Using Betti Numbers: Application to CO2 Storage Uncertainty Analysis. En CTIC 2016: 6th International Workshop on Computational Topology in Image Context (101-112), Marseille, France: Springer.
978-3-319-39440-4
0302-9743
https://hdl.handle.net/11441/126413
10.1007/978-3-319-39441-1_10
21021332
eng
CTIC 2016: 6th International Workshop on Computational Topology in Image Context (2016), pp. 101-112.
https://link.springer.com/chapter/10.1007/978-3-319-39441-1_10
Cham, Switzerland
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Springer
oai:idus.us.es:11441/236052024-02-13T09:38:56Zcom_11441_10803com_11441_10802com_11441_10690com_11441_10893col_11441_10804col_11441_10896
Sudokus and Gröbner Bases: not only a Divertimento
Universidad de Sevilla. Departamento de Álgebra
Gröbner bases
system of polynomial equations
Sudoku is a logic-based placement puzzle. We recall how to
translate this puzzle into a 9-colouring problem which is
equivalent to a (big) algebraic system of polynomial equations. We
study how far Gröbner bases techniques can be used to treat
these systems produced by Sudokus. This general purpose tool can
not be considered as a good solver, but we show that it can be
useful to provide information on systems that are ---in spite of
their origin--- hard to solve.
2015-03-27
2015-03-27
2006
info:eu-repo/semantics/bookPart
978-3-540-45182-2
http://hdl.handle.net/11441/23605
https://idus.us.es/xmlui/handle/11441/23605
eng
Gago-Vargas, J., Hartillo, I., Martín-Morales, J., Ucha, J.M., (2006), Sudokus and Gröbner Bases: Not Only a Divertimento. Computer algebra in scientific computing (CASC 2006), Lecture Notes in Computer Science. Vol. 4194. p. 155-165.
10.1007/11870814_13
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
oai:idus.us.es:11441/1261242024-02-14T08:58:02Zcom_11441_10893com_11441_10802com_11441_10690col_11441_10896
Double Hough Transform for Estimating the Position of the Mandibular Canal in Dental Radiographs
Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
In this work, a multiple generalised anisotropic Hough transform (AGHT)
is used to detect the mandibular canal in dental panoramic radiographs.
The proposed method relies on a sequential application of the Hough transform that
we call double Hough transform. The recognition of the mandibular canal is based
on a double template matching compared with the clinical detection using the fact
that the shape of the mandibular canal is usually the same and it is situated inside
the mandibular bone.
The experiments performed on real orthopantomographic images shown that the risk
of false detection is significantly decreased, while the recognition is not affected by
occlusion and by the presence of additional structures e.g. teeth, projection errors.
2021-09-23
2021-09-23
2015
info:eu-repo/semantics/conferenceObject
Onchis Moaca, D., Zappalá, S., Gotia, S.L. y Real Jurado, P. (2015). Double Hough Transform for Estimating the Position of the Mandibular Canal in Dental Radiographs. En ACA 2015: Special Sessions in Applications of Computer Algebra (317-327), Kalamata, Greece: Springer.
978-3-319-56930-7
https://hdl.handle.net/11441/126124
10.1007/978-3-319-56932-1_22
21359155
eng
ACA 2015: Special Sessions in Applications of Computer Algebra (2015), pp. 317-327.
https://link.springer.com/chapter/10.1007%2F978-3-319-56932-1_22
Cham, Switzerland
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Springer
oai:idus.us.es:11441/933762020-02-19T08:46:40Zcom_11441_10893com_11441_10802com_11441_10690col_11441_10896
Finding Multiple Solutions in Nonlinear Integer Programming with Algebraic Test-Sets
Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
We explain how to compute all the solutions of a nonlinear
integer problem using the algebraic test-sets associated to a suitable
linear subproblem. These test-sets are obtained using Gröbner bases. The
main advantage of this method, compared to other available alternatives,
is its exactness within a quite good efficiency.
2020-02-19
2020-02-19
2018
info:eu-repo/semantics/conferenceObject
Hartillo Hermoso, I., Jiménez Cobano, J.M. y Ucha Enríquez, J.M. (2018). Finding Multiple Solutions in Nonlinear Integer Programming with Algebraic Test-Sets. En CASC 2018 : 20th International Workshop on Computer Algebra in Scientific Computing (230-237), Lille, France: Springer.
978-3-319-99638-7
0302-9743
https://hdl.handle.net/11441/93376
10.1007/978-3-319-99639-4_16
eng
CASC 2018 : 20th International Workshop on Computer Algebra in Scientific Computing (2018), p 230-237
MTM2016-75024-P
MTM2016-74983-C2- 1-R
P12-FQM-2696
https://link.springer.com/chapter/10.1007/978-3-319-99639-4_16
Berlin
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Springer
oai:idus.us.es:11441/936602024-02-12T21:45:04Zcom_11441_10893com_11441_10802com_11441_10690col_11441_10896
Topo-Geometric Filtration Scheme for Geometric Active Contours and Level Sets: Application to Cerebrovascular Segmentation
Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
One of the main problems of the existing methods for the
segmentation of cerebral vasculature is the appearance in the segmentation
result of wrong topological artefacts such as the kissing vessels.
In this paper, a new approach for the detection and correction of such
errors is presented. The proposed technique combines robust topological
information given by Persistent Homology with complementary geometrical
information of the vascular tree. The method was evaluated on 20
images depicting cerebral arteries. Detection and correction success rates
were 81.80% and 68.77%, respectively.
2020-02-26
2020-02-26
2014
info:eu-repo/semantics/conferenceObject
Molina Abril, H. y Frangi, A.F. (2014). Topo-Geometric Filtration Scheme for Geometric Active Contours and Level Sets: Application to Cerebrovascular Segmentation. En MICCAI 2014: 17th International Conference on Medical Image Computing and Computer-Assisted Intervention (755-762), Boston, MA, USA: Springer.
978-3-319-10403-4
0302-9743
https://hdl.handle.net/11441/93660
10.1007/978-3-319-10404-1_94
20791008
eng
MICCAI 2014: 17th International Conference on Medical Image Computing and Computer-Assisted Intervention (2014), p 755-762
https://link.springer.com/chapter/10.1007/978-3-319-10404-1_94
Cham, Switzerland
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Springer
oai:idus.us.es:11441/1118062024-02-13T09:01:04Zcom_11441_10893com_11441_10802com_11441_10690col_11441_10896
Multiple criteria minimum spanning trees
Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
The NP multiple criteria minimum spanning tree as several applications into the network
design problems. In this paper, we rst introduce some properties than can help to characterize
the problem, as well as to produce heuristics to solve it in a more e cient way. In the second
part, we propose an application of the Multiple Objective Network optimization based on the
Ant Colony Optimization (MONACO) algorithm to nd out an approximation to the set of the non-
dominated solutions of the problem. The MONACO algorithm uses as many pheromone trails as the
number of criteria and some local operators to increase the speed of the process and the quality
of the results.
2021-06-15
2021-06-15
2005
info:eu-repo/semantics/conferenceObject
Cardoso, P., Jesus, M. y Márquez Pérez, A. (2005). Multiple criteria minimum spanning trees. En EGC 2005: XI Encuentros de Geometría Computacional (103-110), Santander, España: Universidad de Cantabria.
84-8102-963-7
https://hdl.handle.net/11441/111806
eng
EGC 2005: XI Encuentros de Geometría Computacional (2005), pp. 103-110.
https://personales.unican.es/santosf/egc05/
Santander, España
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Universidad de Cantabria
oai:idus.us.es:11441/1391712024-02-15T07:38:15Zcom_11441_11291com_11441_11290com_11441_10690com_11441_10893com_11441_10802col_11441_11294col_11441_10896
On the Topological Disparity Characterization of Square-Pixel Binary Image Data by a Labeled Bipartite Graph
Universidad de Sevilla. Departamento de Arquitectura y Tecnología de Computadores
Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
Universidad de Sevilla. TEP108 : Robotica y Tecnología de Computadores
Universidad de Sevilla. TIC245: Topological Pattern Analysis, Recognition and Learning
Ministerio de Economia, Industria y Competitividad (MINECO). España
Junta de Andalucía
Hierarchical representation
Digital image
Topological dissimilarity
Parallelism
(4 · 8)-adjacency tree
{4,8}-adjacency forest
Given an nD digital image I based on cubical n-xel, to fully
characterize the degree of internal topological dissimilarity existing in I
when using different adjacency relations (mainly, comparing 2n or 2n −1
adjacency relations) is a relevant issue in current problems of digital
image processing relative to shape detection or identification. In this
paper, we design and implement a new self-dual representation for a
binary 2D image I, called {4, 8}-region adjacency forest of I ({4, 8}-RAF,
for short), that allows a thorough analysis of the differences between the
topology of the 4-regions and that of the 8-regions of I. This model can
be straightforwardly obtained from the classical region adjacency tree
of I and its binary complement image Ic, by a suitable region label
identification. With these two labeled rooted trees, it is possible: (a) to
compute Euler number of the set of foreground (resp. background) pixels
with regard to 4-adjacency or 8-adjacency; (b) to identify new local and
global measures and descriptors of topological dissimilarity not only for
one image but also between two or more images. The parallelization of
the algorithms to extract and manipulate these structures is complete,
thus producing efficient and unsophisticated codes with a theoretical
computing time near the logarithm of the width plus the height of an
image. Some toy examples serve to explain the representation and some
experiments with gray real images shows the influence of the topological
dissimilarity when detecting feature regions, like those returned by the
MSER (maximally stable extremal regions) method.
2022-11-09
2022-11-09
2022
info:eu-repo/semantics/conferenceObject
Sánchez Cuevas, P., Real Jurado, P., Díaz del Río, F., Molina Abril, H. y Morón Fernández, M.J. (2022). On the Topological Disparity Characterization of Square-Pixel Binary Image Data by a Labeled Bipartite Graph. En IbPRIA 2022: 10th Iberian Conference on Pattern Recognition and Image Analysis (515-527), Aveiro, Portugal: Springer.
978-3-031-04880-7
0302-9743
https://hdl.handle.net/11441/139171
10.1007/978-3-031-04881-4_41
eng
IbPRIA 2022: 10th Iberian Conference on Pattern Recognition and Image Analysis (2022), pp. 515-527.
PID2019-110455GB-I00 (Par-HoT)
US-1381077
https://link.springer.com/chapter/10.1007/978-3-031-04881-4_41
Cham, Switzerland
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Springer
oai:idus.us.es:11441/753062024-02-13T20:00:19Zcom_11441_33995com_11441_30105com_11441_10893com_11441_10802com_11441_10690col_11441_75277col_11441_10896
Optimization system in networks using ACO
Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
Universidad de Sevilla. FQM164: Matemática Discreta: Teoría de Grafos y Geometría Computacional
2018-05-29
2018-05-29
2002
info:eu-repo/semantics/conferenceObject
Sequeira Cardoso, P.J., Machado Jesús, M.C., y Márquez Pérez, A. (2002). Optimization system in networks using ACO. (pp. 89-94). Santander: Alberto Márquez
8460752704
https://hdl.handle.net/11441/75306
eng
Santander
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Atribución-NoComercial-SinDerivadas 3.0 Estados Unidos de América
Alberto Márquez
oai:idus.us.es:11441/1118942021-06-18T11:41:21Zcom_11441_10893com_11441_10802com_11441_10690col_11441_10896
Representing the Surface of Objects by Combinatorial Pyramids
Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
Austrian Science Found
Junta de Andalucía
Ministerio de Ciencia e Innovación (MICIN). España
This paper introduces a new method to rep-
resent the surface of objects using two dimensional com-
binatorial maps. The classical de nition of two dimen-
sional combinatorial maps is extended here by adding
a \back face" that corresponds to the non{visible part
of the object. As a rst step, every object in the scene
is extracted in one image pyramid, where levels are re-
lated by means of coordinates. Finally, an algorithm
to complete the description of the surface is presented.
Such representation is translation, rotation and scale
invariant. It will allow to update information about
movements and parts of the object that become visible,
reducing the complexity and the computational time.
2021-06-18
2021-06-18
2010
info:eu-repo/semantics/conferenceObject
Antúnez, E., Molina Abril, H. y Kropatsch, W.G. (2010). Representing the Surface of Objects by Combinatorial Pyramids. En CVWW 2010: 15th Computer Vision Winter Workshop Nové Hrady, Czech Republic: Czech Pattern Recognition Society.
https://hdl.handle.net/11441/111894
eng
CVWW 2010: 15th Computer Vision Winter Workshop (2010).
P20134-N13
P18716-N13
FQM-296
PO6-TIC-02268
P07-TIC-03106
MTM2009-12716
http://cmp.felk.cvut.cz/cvww2010/
Prague, Czech Republic
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Czech Pattern Recognition Society
oai:idus.us.es:11441/692402024-02-17T17:45:46Zcom_11441_10893com_11441_10802com_11441_10690col_11441_10896
Counting partial Latin rectangles
Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
2018-01-19
2018-01-19
2015-07
info:eu-repo/semantics/conferenceObject
Stones, R.J. y Falcón Ganfornina, R.M. (2015). Counting partial Latin rectangles. En 25th British Combinatorial Conference, Warwick (Reino Unido).
https://hdl.handle.net/11441/69240
eng
25th British Combinatorial Conference (2015),
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
oai:idus.us.es:11441/348902016-11-30T07:43:45Zcom_11441_33995com_11441_30105com_11441_10893com_11441_10802com_11441_10690col_11441_33996col_11441_10896
Un esquema de cuarto orden con casi-óptimo gasto computacional para ecuaciones no lineales
Ministerio de Educación y Ciencia
Fondo Nacional de Desarrollo Científico y Tecnológico (Fondecyt) (Chile)
Métodos iterativos
sistemas de ecuaciones no lineales
orden de convergencia
En este trabajo, presentamos un método de tres pasos y de cuarto orden que tiene un coste computacional muy aceptable. Esto es debido a que no necesita segundas derivadas y que la matriz de los sistemas lineales asociados es la misma en los tres pasos de cada iteración. Se estudiará su convergencia e implementación.
2016-02-16
2016-02-16
2007-09
info:eu-repo/semantics/conferenceObject
Amat Plata, S., Bermúdez Edo, M.C., Busquier Sáez, S., Manzano García, F. y Plaza Salinas, S. (2007). Un esquema de cuarto orden con casi-óptimo gasto computacional para ecuaciones no lineales.
http://hdl.handle.net/11441/34890
https://idus.us.es/xmlui/handle/11441/34890
spa
.
MTM2004-07114
00675/PI/04
#1020711
#0433
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
oai:idus.us.es:11441/754122024-02-17T17:25:38Zcom_11441_33995com_11441_30105com_11441_10893com_11441_10802com_11441_10690col_11441_75277col_11441_10896
Inmersiones celulares no caracterizables por menores
Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
Universidad de Sevilla. FQM240: Invariantes en Teoría de Grafos y Optimización
2018-05-30
2018-05-30
2002
info:eu-repo/semantics/conferenceObject
Boza Prieto. Luis, , Dávila de Tena, M.T., y Moyano Franco, R. (2002). Inmersiones celulares no caracterizables por menores. (pp. 226-231). Santander: Alberto Márquez
8460752704
https://hdl.handle.net/11441/75412
spa
Santander
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Atribución-NoComercial-SinDerivadas 3.0 Estados Unidos de América
Alberto Márquez
oai:idus.us.es:11441/344332024-02-13T21:57:49Zcom_11441_33995com_11441_30105com_11441_10893com_11441_10802com_11441_10690col_11441_33996col_11441_10896
Algunos elementos para la construcción de un Método de Multiescala Variacional “a posteriori”
Universidad de Sevilla. Departamento de Ecuaciones Diferenciales y Análisis Numérico
Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
Métodos Multiescala
SUPG
convección dominante
estabilización
El presente trabajo está dedicado a la resolución de problemas de la Mecánica de Fluidos incompresibles en régimen de convección dominante. Nuestro propósito es presentar una técnica de post-proceso de una solución Galerkin con E.F. P1 inicial oscilante, que permite recuperar a partir de la misma, otra solución no oscilatoria, y que además es una aproximación de segundo orden de la solución continua. Presentamos también, una extensión de esta técnica al caso no lineal, proporcionando un método eficaz para la resolución de choques. Como extensión del Método Multiescala Variacional debido a Hughes, estamos introduciendo un Método Multiescala Variacional “a posteriori”
2016-02-10
2016-02-10
2007-09
info:eu-repo/semantics/conferenceObject
Chacón Rebollo, T. y Domínguez Delgado, A. (2007). Algunos elementos para la construcción de un Método de Multiescala Variacional “a posteriori”.
http://hdl.handle.net/11441/34433
https://idus.us.es/xmlui/handle/11441/34433
spa
.
MTM2006-1750
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
oai:idus.us.es:11441/692702018-01-22T10:36:37Zcom_11441_10893com_11441_10802com_11441_10690col_11441_10896
(Pseudo)-cocyclic (structured) Hadamard matrices over (quasi)groups
Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
Universidad de Sevilla. Departamento de álgebra
Matrices de Hadamard
Progressing on a survey of the state of the art of cocyclic constructions for Hadamard matrices, we will prove that the family of Goethals-Seidel Hadamard matrices is (pseudo)-cocyclic over a certain family of quasigroups. Therefore, what we call (pseudo)-cocyclic (structured) Hadamard matrices over (quasi)groups, precisely those matrices satisfying some kind of cocycle Hadamard test known so far, include most of the well-known and prolific constructions of Hadamard matrices. We will discuss also different approaches in order to look for large matrices of this type.
2018-01-22
2018-01-22
2017
info:eu-repo/semantics/conferenceObject
https://hdl.handle.net/11441/69270
eng
https://www.renyi.hu//conferences/hadamard2017/Slides/Alvarez.pdf
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
oai:idus.us.es:11441/1149262024-02-13T08:53:21Zcom_11441_10893com_11441_10802com_11441_10690col_11441_10895col_11441_10896
On (−1, 1)-Matrices of Skew Type with the Maximal Determinant and Tournaments
Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
Junta de Andalucía
Tournaments
Maximal determinants
Skew (−1, 1)-matrices
Skew Hadamard matrices of order n give the solution to the question of finding the largest possible n by n determinant with entries ± 1 of skew type when n≡0(mod4) . Characterizations of skew Hadamard matrices in terms of tournaments are well-known. For n≡2(mod4) , we give a characterization of (−1, 1)-matrices of skew type of order n where their determinants reach Ehlich–Wojtas’ bound in terms of tournaments.
2021-06-29
2021-06-29
2014
info:eu-repo/semantics/conferenceObject
Armario Sampalo, J.A. (2014). On (−1, 1)-Matrices of Skew Type with the Maximal Determinant and Tournaments. En ADTHM 2014: Workshop on Algebraic Design Theory and Hadamard Matrices (1-11), Lethbridge, Alberta, Canada: Springer.
978-3-319-17728-1
2194-1009
https://hdl.handle.net/11441/114926
10.1007/978-3-319-17729-8_1
eng
ADTHM 2014: Workshop on Algebraic Design Theory and Hadamard Matrices (2014), pp. 1-11.
FQM-016
https://link.springer.com/chapter/10.1007/978-3-319-17729-8_1
Cham, Switzerland
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Springer
oai:idus.us.es:11441/692322024-02-14T19:39:53Zcom_11441_10893com_11441_10802com_11441_10690col_11441_10896
GeoGebra y la diversidad en el aula de Matemáticas
Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
En el presente taller se elaboran actividades basadas en las nuevas herramientas de GeoGebra 4 para trabajar la diversidad en el aula de Matemáticas. En concreto, se desarrollan evaluaciones iniciales para determinar el nivel de partida del alumnado y ejercicios de profundización autocorregibles que se adaptan de forma automática al nivel de los estudiantes. Se muestra en particular cómo abordar los distintos contenidos matemáticos que se tratan en Educación Primaria y Secundaria, al igual que ciertos aspectos que pueden ser de utilidad en enseñanza universitaria. Las actividades a desarrollar permiten al mismo tiempo profundizar en el manejo de GeoGebra de cada uno de los asistentes al taller, desde los que no conocen dicho programa, hasta los que tienen un nivel más avanzado.
2018-01-19
2018-01-19
2012-07
info:eu-repo/semantics/conferenceObject
Falcón Ganfornina, R.M. y Ríos Collantes de Terán, R. (2012). GeoGebra y la diversidad en el aula de Matemáticas. En XIV Congreso de Enseñanza y Aprendizaje de las Matemáticas: Diversidad y Matemáticas, Málaga, Andalucía.
https://hdl.handle.net/11441/69232
spa
XIV Congreso de Enseñanza y Aprendizaje de las Matemáticas: Diversidad y Matemáticas (2012),
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
oai:idus.us.es:11441/1258952024-02-13T08:52:02Zcom_11441_10893com_11441_10802com_11441_10690col_11441_10896
analyzing the transference of the coalgebra structure on the homology CDGAs
Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
2021-09-16
2021-09-16
1999
info:eu-repo/semantics/conferenceObject
Jiménez Rodríguez, M.J., Real Jurado, P. y Silva Gallardo, B. (1999). analyzing the transference of the coalgebra structure on the homology CDGAs. En IMACS'99: 1999 IMACS Conference on Applications of Computer Algebra El Escorial, Madrid: International Association for Mathematics and Computers in Simulation.
https://hdl.handle.net/11441/125895
eng
IMACS'99: 1999 IMACS Conference on Applications of Computer Algebra (1999).
https://math.unm.edu/~aca/ACA/1999.html
Madrid, España
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
International Association for Mathematics and Computers in Simulation
oai:idus.us.es:11441/1266842021-10-19T10:00:31Zcom_11441_10893com_11441_10802com_11441_10690col_11441_10896
Image = Structure + Few Colors
Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
Topology plays an important role in computer vision by capturing
the structure of the objects. Nevertheless, its potential applications
have not been sufficiently developed yet. In this paper, we combine the
topological properties of an image with hierarchical approaches to build a
topology preserving irregular image pyramid (TIIP). The TIIP algorithm
uses combinatorial maps as data structure which implicitly capture the
structure of the image in terms of the critical points. Thus, we can achieve
a compact representation of an image, preserving the structure and topology
of its critical points (maxima, the minima and the saddles). The parallel
algorithmic complexity of building the pyramid is O(log d) where d is
the diameter of the largest object.We achieve promising results for image
reconstruction using only a few color values and the structure of the image,
although preserving fine details including the texture of the image.
2021-10-19
2021-10-19
2021
info:eu-repo/semantics/conferenceObject
Batavia, D., González Díaz, R. y Kropatsch, W.G. (2021). Image = Structure + Few Colors. En S+SSPR 2021: Joint IAPR International Workshops on Statistical Techniques in Pattern Recognition (SPR) and Structural and Syntactic Pattern Recognition (SSPR) (365-375), Padua, Italy: Springer.
978-3-030-73972-0
0302-9743
https://hdl.handle.net/11441/126684
10.1007/978-3-030-73973-7_35
eng
S+SSPR 2021: Joint IAPR International Workshops on Statistical Techniques in Pattern Recognition (SPR) and Structural and Syntactic Pattern Recognition (SSPR) (2021), pp. 365-375.
https://link.springer.com/chapter/10.1007/978-3-030-73973-7_35
Cham, Switzerland
http://creativecommons.org/licenses/by-nc-nd/4.0/
info:eu-repo/semantics/openAccess
Attribution-NonCommercial-NoDerivatives 4.0 Internacional
Springer
etdms///col_11441_10896/100