Revistas académicas de la Universidad Católica del Norte
Not a member yet
1687 research outputs found
Sort by
Los procesos de enseñanza – aprendizaje en el contexto de pandemia:: reconfiguración de la relación docente – estudiante en la educación superior
La pandemia provocada por el COVID – 19 ha conllevado una transformación radical y reactiva de los lazos sociales, reconfigurando vínculos y procesos. Las Instituciones de Educación Superior no han estado exentas a aquello. El presente ensayo tiene como propósito reflexionar respecto al impacto de la pandemia en la reinvención de los procesos de enseñanza – aprendizaje; el rol de los estudiantes y docentes en la enseñanza on line y el fortalecimiento del capital humano en dicha materia, para responder adecuadamente a las necesidades del entorno
On graded primary-like submodules of graded modules over graded commutative rings
Let G be a group with identity e. Let R be a G-graded commutative ring andM a graded R-module. In this paper, we introduce the concept of graded primary-like submodules as a new generalization of graded primary ideals and give some basic results about graded primary-like submodules of graded modules. Special attention has been paid, when graded submodules satisfies the gr-primeful property, to and extra properties of these graded submodules
Minimal and maximal solutions to first-order differential equations with piecewise constant generalized delay
In this paper we employ the method of maximal and minimal solutions coupled with comparison principles and the monotone iterative technique to obtain results of existence and approximation of solutions for differential equations with piecewise constant delay of generalized type (DEPCAG).In this paper we employ the method of maximal and minimal solutions coupled with comparison principles and the monotone iterative technique to obtain results of existence and approximation of solutions for differential equations with piecewise constant delay of generalized type (DEPCAG)
Infinitely many solutions for anisotropic elliptic equations with variable exponent
In this article, we study the existence and multiplicity of solutions for a class of anisotropic elliptic equations
First we establisch that anisotropic space is separable and by using the Fountain theorem, and dual Fountain theorem we prove, under suitable conditions, that the problem (P) admits two sequences of weak solutions
On the total irregularity strength of convex polytope graphs
A vertex (edge) irregular total k-labeling ? of a graph G is a labeling of the vertices and edges of G with labels from the set {1,2,...,k} in such a way that any two different vertices (edges) have distinct weights. Here, the weight of a vertex x in G is the sum of the label of x and the labels of all edges incident with the vertex x, whereas the weight of an edge is the sum of label of the edge and the vertices incident to that edge. The minimum k for which the graph G has a vertex (edge) irregular total k-labeling is called the total vertex (edge) irregularity strength of G. In this paper, we are dealing with infinite classes of convex polytopes generated by prism graph and antiprism graph. We have determined the exact value of their total vertex irregularity strength and total edge irregularity strength
Some integral inequalities for approximately h-convex functions and their applications
In this paper, by applying the new and improved form of Hölder’s integral inequality called Hölder—Íşcan integral inequality three inequalities of Hermite—Hadamard and Hadamard integral type for (h, d)—convex functions have been established. Various special cases including classes for instance, h—convex, s—convex function of Breckner and Godunova—Levin—Dragomir and strong versions of the aforementioned types of convex functions have been identified. Some applications to error estimations of presented results have been analyzed. At the end, a briefly conclusion is given
Instantaneous sentinel for the identification of the pollution term in Navier-Stokes system
The aim of this paper is about presenting some results of the Sentinel Theory in Connection with Control Theory of Distributed Systems. There is of course a large variety of models where the results to follow could be applied. What we have particularly in mind is the classical set of Navier-Stokes equations. We shall denote here by the velocity field and the pressure, which is a quite unusual notation in the "Turbulence" circle. The reason is simply that in all what is following that we think of as the state of our system, this state depends on control functions, these control functions are being either "artificial" or "natural". Also in this work we are(trying) working to get instantaneous information at fixed instant "T" on pollution term in Navier-Stokes system in which the initial condition is incomplete. The best method which can solve this problem is the sentinel one; it allows the estimation of the pollution term at which we look for information independently of the missing term that we do not want to identify. So, we prove the existence of such instantaneous sentinel by solving a problem of controllability with a constraint on the control
Fractal mathematical over extended finite fields Fp[x]/(f(x))
In this paper, we have defined an algorithm for the construction of iterative operations, based on dimensional projections and correspondence between the properties of extended fields, with respect to modular reduction. For a field with product operations R(x) ⊗ D(x), over finite fields, GF[(pm)n−k]. With Gp[x]/(g(f(x)), whence the coefficient of the g(x) is replaced after a modular reduction operation, with characteristic p.
Thus, the reduced coefficients of the generating polynomial of contain embedded the modular reduction and thus simplify operations that contain basic finite fields. The algorithm describes the process of construction of the GF multiplier, it can start at any stage of LFSR; it is shift the sequence of operation, from this point on, thanks to the concurrent adaptation, to optimize the energy consumption of the GF iterative multiplier circuit, we can claim that this method is more efficient. From this, it was realized the mathematical formalization of the characteristics of the iterative operations on the extended finite fields has been developed, we are applying a algorithm several times over the coefficients in the smaller field and then in the extended field, concurrent form
A new generalized refinements of Young’s inequality
In this paper, we show a new generalized refinement of Young's inequality. As applications we give some new generalized refinements of Young type inequalities for the traces, determinants, and norms of positive definite matrices.
On the domination polynomial of a digraph: a generation function approach
Let be a directed graph on vertices. The domination polynomial of is the polynomial , where is the number of dominating sets of with vertices. In this paper, we prove that the domination polynomial of can be obtained by using an ordinary generating function, which can be extended to undirected graphs. Besides, we show that our method is useful to obtain the minimum-weighted dominating set of a graph