Revistas académicas de la Universidad Católica del Norte
Not a member yet
1687 research outputs found
Sort by
Uma aproximação da experiência de viver junto a uma criança com Transtorno do Espectro Autista a partir da narrativa familiar de adultos significativos
Purpose: The purpose of this research was to describe the experience of significant adults of a family that lives with a member diagnosed with a developmental disorder, part of the Autism Spectrum Disorder (ASD), from the narrative of the other members. Method: As data recollection technique, a focal group interview was implemented to the family group which are the study sample, under a unique case design. The results were obtained through thematic analysis, using three main codes: knowledge and information, affectivity, and relationship dynamics. Results: As relevant findings of the research we can point out that changes produced in the family group by the diagnosis, were not consequent with the theory, as knowledge the diagnosis does not lead to a crisis, but it rather produced relief linked to the possibility of understanding the reality. Likewise, the family recognizes as relevant the professional support and information that experts could provide. Conclusion: it is positive for the family with a member with ASD to maintain permanent advice with a specialized team, avoiding isolation and strengthening the capacity to receive, understand and develop support resources.Objetivo: El propósito de esta investigación fue describir la experiencia de los adultos significativos de un grupo familiar que conviven con un miembro diagnosticado con una alteración del desarrollo que forma parte del Trastorno del Espectro Autista (TEA). Método: Como técnica de recolección de datos utilizamos la entrevista grupal focalizada a la familia que compone la muestra, bajo un diseño de caso único. Obtuvimos los resultados a través de un análisis temático, utilizando tres códigos principales: conocimiento e información, afectividad, y dinámicas relacionales. Resultados: Como hallazgos relevantes identificamos que los cambios producidos por el diagnóstico en el grupo familiar no se condicen con la teoría, dado que no se produjo una crisis al enterarse de dicho diagnóstico, sino más bien un alivio ligado a la posibilidad de comprender la realidad. Asimismo, la familia reconoce como relevante el apoyo profesional y la información entregada por los especialistas. Conclusión: es recomendable para la familia con un miembro con TEA mantener una asesoría permanente con un equipo especializado, evitando el aislamiento y fortaleciendo la capacidad de acogida, comprensión y desarrollo de recursos de apoyo.Objetivo: O propósito desta pesquisa foi descrever a experiência de adultos significativos de um grupo familiar que convivem com um membro diagnosticado com uma alteração do desenvolvimento que faz parte do Transtorno do Espectro Autista (TEA). Método: Como técnica de coleta de dados foi utilizada a entrevista grupal focalizada na família que compõe a amostra, sob um design de caso exclusive. Os resultados foram obtidos por meio da análise temática, nos eixos de Conhecimento e Informação, Afetividade e Dinâmicas Relacionais. Resultados: Entre as descobertas relevantes está o fato de que as mudanças produzidas pelo diagnóstico no grupo familiar não condizem com a teoria, uma vez que não se produziu uma crise ao receber o diagnóstico, mas um alívio relacionado a possibilidade de compreender a realidade. De todo modo, a família reconhece como relevante o apoio profissional e a informação oferecida pelos especialistas. Conclusão: é aconselhável que a família com um membro com TEA mantenha aconselhamento permanente com uma equipe especializada, evitando o isolamento e fortalecendo a capacidade de receber, entender e desenvolver recursos de apoio
Analysis of boundary value problem with multi-point conditions involving Caputo-Hadamard fractional derivative
We study the boundary value problems (BVPs) of the Caputo-Hadamard type fractional differential equations (FDEs) supplemented by multi-point conditions. Many new results of existence and uniqueness are obtained with the use of fixed point theorems for single-valued maps. With the help of examples, the results are well illustrated
Multi-item multi-objective fixed charged solid transportation problem with type-2 fuzzy variables
A multi-item multi-objective fixed charged solid transportation problema with guidelines e.g. unit transportation penalty, amounts, requirements, and conveyances as type-2 triangular fuzzy variables with conditions on few items and conveyances is formulated here. A chance constrained programming model applying generalized credibility measure for the objective function as well as the constraints is formed with the critical value based reductions of corresponding type-2 fuzzy guidelines for this particular problem. The model is then converted into the equivalent crisp deterministic form. The optimal compromise solutions are obtained by fuzzy programming technique. An example is contributed to highlight the model and is then solved by applying Generalized Reduced Gradient (GRG) technique (applying LINGO 16). The sensitivity analysis of the model is also given to illustrate the model
Fixed points and diametral sets for sequentially bounded mappings in orbital ultrametric spaces
In this paper, the T -orbital ultrametric spaces are introduced and a fixed point theorem for sequentially bounded mappings is given. Our main result extends some known theorems for nonexpansive mappings. Examples are given to support our work
The P-Hausdorff, P-regular and P-normal ideal spaces
We introduce and study new extensions of some separation axioms to ideal topological spaces, which we have called P-Hausdorff, P-regular and P-normal. These extensions are quite natural and represent a good improvement with respect to other extensions that have recently occurred, in which a level of separation that can be considered acceptable is not perceived.
Rainbow and strong rainbow connection number for some families of graphs
Let G be a nontrivial connected graph. Then G is called a rainbow connected graph if there exists a coloring c : E(G) → {1, 2, ..., k}, k ∈ N, of the edges of G, such that there is a u − v rainbow path between every two vertices of G, where a path P in G is a rainbow path if no two edges of P are colored the same. The minimum k for which there exists such a k-edge coloring is the rainbow connection number rc(G) of G. If for every pair u, v of distinct vertices, G contains a rainbow u − v geodesic, then G is called strong rainbow connected. The minimum k for which G is strong rainbow-connected is called the strong rainbow connection number src(G) of G.
The exact rc and src of the rotationally symmetric graphs are determined
Some results on (a,d)-distance antimagic labeling
Let G = (V,E) be a graph of order N and f : V → {1, 2,...,N} be a bijection. For every vertex v of graph G, we define its weight w(v) as the sum ∑u∈N(v) f(u), where N(v) denotes the open neighborhood of v. If the set of all vertex weights forms an arithmetic progression {a, a + d, a + 2d, . . . , a + (N − 1)d}, then f is called an (a, d)-distance antimagic labeling and the graph G is called (a, d)-distance antimagic graph. In this paper we prove the existence or non-existence of (a, d)- distance antimagic labeling of some well-known graphs
On a new difference sequence space
In the present note, we define a new difference sequence Dx =(Dx)n with the help of difference operator D as
Also, we discuss some interesting properties of the proposed difference operator D
Other forms of continuity modulo an ideal
The topic analized in this paper is the continuity modulo an ideal. We use the open-I sets to introduce new forms of weak continuity. Some basic properties of C-continuous and D-continuous functions will be investigated, as well as some applications related to compactness and separability. All the results obtained in this work constitute generalizations of well-known results of the general topology. We prove that these new concepts are independent of other forms of weak continuity, modulo an ideal, introduced by Abd El-Monsef, Özkurt, Çobankaya and Kaniewski
The lower bound and exact value of the information rate of some developed graph access structures
Various studies have focused on secret sharing schemes and in all of them, each shareholder is interested in a shorter share. The information rate of a secret sharing scheme shows the ratio between the size of the secret to the maximum number of shares given to each shareholder. In this regard, the researchers investigated the optimal information rate of the graph access structure. This paper aims to discover the exact values for the optimal information rates of the two graph access structures, which remained as open problems in Van Dijk’s paper. Furthermore, we introduced the developed multipartite graph and the developed cycle graph and calculated the exact value of their optimal information rate. Moreover, we presented a lower bound on the information rate for other developed graph access structures