Search results for "Matematica"
showing 10 items of 1637 documents
Prioritization of maintenance actions in water distribution systems
2017
[EN] Industrial water distribution systems are paramount in many manufacturing systems to optimise the related industrial plant availability and consequently the level of production. They also play an important part in keeping right standards of hygiene of workplaces and machines. A strategic action of planning and implementing of suitable maintenance activities is necessary to assure the standards previously described. The present contribution proposes the prioritization of maintenance actions for industrial water distribution systems through a multi-criteria decision making approach, since some of the elements integrated in maintenance-related aspects are not easily quantifiable and, on t…
Toward a formalization of a two traders market with information exchange
2014
This paper shows that Hamiltonians and operators can also be put to good use even in contexts which are not purely physics based. Consider the world of finance. The work presented here {models a two traders system with information exchange with the help of four fundamental operators: cash and share operators; a portfolio operator and an operator reflecting the loss of information. An information Hamiltonian is considered and an additional Hamiltonian is presented which reflects the dynamics of selling/buying shares between traders. An important result of the paper is that when the information Hamiltonian is zero, portfolio operators commute with the Hamiltonian and this suggests that the dy…
Survival analysis of author keywords: An application to the library and information sciences area
2020
[EN] Our purpose is to adapt a statistical method for the analysis of discrete numerical series to the keywords appearing in scientific articles of a given area. As an example, we apply our methodological approach to the study of the keywords in the Library and Information Sciences (LIS) area. Our objective is to detect the new author keywords that appear in a fixed knowledge area in the period of 1 year in order to quantify the probabilities of survival for 10 years as a function of the impact of the journals where they appeared. Many of the new keywords appearing in the LIS field are ephemeral. Actually, more than half are never used again. In general, the terms most commonly used in the …
The Hierarchical Mixed Rural Postman Problem: Polyhedral analysis and a branch-and-cut algorithm
2017
[EN] The Hierarchical Mixed Rural Postman Problem is defined on a mixed graph where arcs and edges that require a service are divided into clusters' that have to be serviced in a hierarchical order. The problem generalizes the Mixed Rural Postman Problem and thus is NP-hard. In this paper, we provide a polyhedral analysis of the problem and propose a branch-and-cut algorithm for its solution based on the introduced classes of valid inequalities. Extensive computational experiments are reported on benchmark instances. The exact approach allows to find the optimal solutions in less than 1 hour for instances with up to 999 vertices, 2678 links, and five clusters.
Group Extensions and Graphs
2016
A classical result of Gaschütz affirms that given a finite A-generated group G and a prime p, there exists a group G# and an epimorphism phi: G# ---> G whose kernel is an elementary abelian p-group which is universal among all groups satisfying this property. This Gaschütz universal extension has also been described in the mathematical literature with the help of the Cayley graph. We give an elementary and self-contained proof of the fact that this description corresponds to the Gaschütz universal extension. Our proof depends on another elementary proof of the Nielsen-Schreier theorem, which states that a subgroup of a free group is free.
Matematica ... a Distanza. Convinzioni, atteggiamenti e pau- re degli insegnanti di scuola Primaria: esiti di un’indagine statistica
2021
Il paper mette a fuoco gli esiti dell’indagine statistica rivolta agli insegnanti di Ma- tematica di scuola Primaria del contesto italiano, circa l’adozione della Didattica a Distanza (DaD), impiegata durante il periodo di emergenza sanitaria da Covid-19. In una prima parte si inquadra la DaD generale da un punto di vista storico e teorico-pratico e, dopo, il focus diviene l’insegnamento e l’apprendimento della Matematica, attraverso l’e-learning. In una seconda parte viene presentata la ricerca e i risultati ad essa correlati. L’indagine statistica, messa in atto attraverso un questionario, qui interamente riportato, ha avuto l’obiettivo di esaminare le rela- zioni intercorrenti tra moltep…
Mapping properties of weakly singular periodic volume potentials in Roumieu classes
2020
The analysis of the dependence of integral operators on perturbations plays an important role in the study of inverse problems and of perturbed boundary value problems. In this paper, we focus on the mapping properties of the volume potentials with weakly singular periodic kernels. Our main result is to prove that the map which takes a density function and a periodic kernel to a (suitable restriction of the) volume potential is bilinear and continuous with values in a Roumieu class of analytic functions. This result extends to the periodic case of some previous results obtained by the authors for nonperiodic potentials, and it is motivated by the study of perturbation problems for the solut…
Updating the OSPF routing protocol for communication networks by optimal decision-making over the k-shortest path algorithm
2019
Internet routing protocols such as Routing Information Protocol (RIP) pre-compute all the shortest paths by Dijkstra's algorithm (shortest path first, SPF) based on the number of hops between one node and another. Every time any communication is intended, RIP looks-up for the optimal choice in a routing table. This is a high speed method in the decision-making process but not necessary fast for data traffic as it does not take into account any real-time measure of route congestion. Open Shortest Path First (OSPF) presents a dynamic version of this problem by computing the shortest paths taking into account network features such as bandwidth, delay and load. OSPF thereby maintains link-state…
The inverse eigenvalue problem for a Hermitian reflexive matrix and the optimization problem
2016
The inverse eigenvalue problem and the associated optimal approximation problem for Hermitian reflexive matrices with respect to a normal {k+1}-potent matrix are considered. First, we study the existence of the solutions of the associated inverse eigenvalue problem and present an explicit form for them. Then, when such a solution exists, an expression for the solution to the corresponding optimal approximation problem is obtained.
Characterizations of {K,s+1}-Potent Matrices and Applications
2012
Recently, situations where a matrix coincides with some of its powers have been studied. This kind of matrices is related to the generalized inverse matrices. On the other hand, it is possible to introduce another class of matrices that involve an involutory matrix, generalizing the well-known idempotent matrix, widely useful in many applications. In this paper, we introduce a new kind of matrices called {K,s+1}-potent, as an extension of the aforementioned ones. First, different properties of {K,s+1}-potent matrices have been developed. Later, the main result developed in this paper is the characterization of this kind of matrices from a spectral point of view, in terms of powers of the ma…