Advanced Search
Now showing items 1-10 of 5106
La Universidad Católica y su relación con la clase alta chilena. Desarrollo histórico del club y su hinchada
(2019-06)
En el presente texto se realizará un recorrido histórico del club de fútbol Universidad Católica en sus más de ochenta años de existencia. Su formación como una rama deportivo dependiente de la misma casa de estudios, su llegada al profesionalismo...
"Implementación unidad de Control de Gestión GRD convenio FONASA GES N° 2” : Cardiopatías congénitas operables en menores de 15 años, Red de Salud UC Christus".
(Universidad de Chile, 2023)
La Red Salud UC CHRISTUS es una de las tres entidades y referente nacional de salud
que atiende cardiopatías congénitas operables a través del sistema de Garantía Explícitas
de Salud (GES), entregando con ello una valiosa contribución al sistema...
New complexity bounds for evaluation and containment of graph query languages
(Universidad de Chile, 2016)
de las RPQs con inversos (2RPQs), que adicionalmente permiten navegar arcos en la dirección reversa; la clase de las uniones de conjunciones de 2RPQs (UC2RPQs), que resulta de cerrar las 2RPQs bajo las operaciones de join, projección y unión; y la...
Graph databases have gained renewed interest in recent years, due to their application in areas such as social networks and the Semantic Web. We study graph query languages that provide the fundamental navigational features needed in di erent graph database applications. This includes the class of regular path queries (or RPQs for short), which check whether two nodes are connected by a path whose label satis es a regular expression; the class of two-way RPQs (2RPQs), which additionally enables backward navigation of edges; the class of unions of conjunctive 2RPQs (UC2RPQs), which results from closing 2RPQs under the operations of join, projection, and union; and the class of regular queries (RQs), which additionally closes UC2RPQs under transitive closure. In this thesis, we provide new complexity results for UC2RPQs and RQs. In the rst part, we study query evaluation for UC2RPQs. This problem is known to be computationally hard: NP-complete in combined complexity and W[1]-complete in parameterized complexity. This has motivated the search for restrictions that lead to ( xed-parameter) tractable evaluation. The most prominent restrictions are the classes of UC2RPQs of bounded treewidth, which can be evaluated in polynomial time, but no other tractable or xed-parameter tractable restrictions are known to date. Our main result in this part is that evaluation for UC2RPQs of bounded treewidth modulo equivalence is xed-parameter tractable. More precisely, we show that, for each xed k 1, there is a xed-parameter tractable algorithm that evaluates UC2RPQs that are equivalent to some UC2RPQ of treewidth at most k. We also study the case when the bound k equals 1, that is, the class of semantically acyclic UC2RPQs, and provide further results. In particular, we show that checking whether a UC2RPQ is semantically acyclic is decidable and Expspace-complete. In the second part, we study query containment for RQs. The class of RQs has emerged only recently as a natural graph query language. RQs have natural closure properties, unlike UC2RPQs that are not closed under transitive closure. Moreover, RQs are not harder to evaluate than UC2RPQs (NP-complete). Nevertheless, the containment problem for RQs has been open so far. This problem is decidable, but only nonelementary complexity upper bounds are known. In contrast, query containment for UC2RPQs is known to be elementary, speci cally, Expspace-complete. Our main result in this part is that containment of RQs is 2Expspace-complete, and therefore, it has elementary complexity just like UC2RPQs. We also study restrictions of RQs that help to alleviate the complexity of evaluation or containment, and also some extensions. In particular, we show that containment of a natural generalization of RQs for relational databases is still 2Expspace-complete....
Graph databases have gained renewed interest in recent years, due to their application in areas such as social networks and the Semantic Web. We study graph query languages that provide the fundamental navigational features needed in di erent graph database applications. This includes the class of regular path queries (or RPQs for short), which check whether two nodes are connected by a path whose label satis es a regular expression; the class of two-way RPQs (2RPQs), which additionally enables backward navigation of edges; the class of unions of conjunctive 2RPQs (UC2RPQs), which results from closing 2RPQs under the operations of join, projection, and union; and the class of regular queries (RQs), which additionally closes UC2RPQs under transitive closure. In this thesis, we provide new complexity results for UC2RPQs and RQs. In the rst part, we study query evaluation for UC2RPQs. This problem is known to be computationally hard: NP-complete in combined complexity and W[1]-complete in parameterized complexity. This has motivated the search for restrictions that lead to ( xed-parameter) tractable evaluation. The most prominent restrictions are the classes of UC2RPQs of bounded treewidth, which can be evaluated in polynomial time, but no other tractable or xed-parameter tractable restrictions are known to date. Our main result in this part is that evaluation for UC2RPQs of bounded treewidth modulo equivalence is xed-parameter tractable. More precisely, we show that, for each xed k 1, there is a xed-parameter tractable algorithm that evaluates UC2RPQs that are equivalent to some UC2RPQ of treewidth at most k. We also study the case when the bound k equals 1, that is, the class of semantically acyclic UC2RPQs, and provide further results. In particular, we show that checking whether a UC2RPQ is semantically acyclic is decidable and Expspace-complete. In the second part, we study query containment for RQs. The class of RQs has emerged only recently as a natural graph query language. RQs have natural closure properties, unlike UC2RPQs that are not closed under transitive closure. Moreover, RQs are not harder to evaluate than UC2RPQs (NP-complete). Nevertheless, the containment problem for RQs has been open so far. This problem is decidable, but only nonelementary complexity upper bounds are known. In contrast, query containment for UC2RPQs is known to be elementary, speci cally, Expspace-complete. Our main result in this part is that containment of RQs is 2Expspace-complete, and therefore, it has elementary complexity just like UC2RPQs. We also study restrictions of RQs that help to alleviate the complexity of evaluation or containment, and also some extensions. In particular, we show that containment of a natural generalization of RQs for relational databases is still 2Expspace-complete....
“Implementación de un plan de mejora de la eficiencia del Intermedio Médico en el Hospital Clínico UC-Christus”
(Universidad de Chile, 2023)
como
objetivo principal mejorar la eficiencia de las camas en la UTI del Hospital UC-Christus. Este
enfoque busca reducir el tiempo de estadía de los pacientes que se hospitalizan desde la
urgencia y mejorar la disponibilidad oportuna de camas de UTI...
Propuesta de rediseño del proceso logístico de medicamentos al interior del Hospital Clínico UC
(Universidad de Chile, 2020)
El objetivo general de este trabajo es proponer un rediseño en el proceso logístico de medicamentos desde la farmacia interna del Hospital Clínico UC, para mejorar la trazabilidad del proceso actual, minimizar las diferencias entre las cantidades...
Aplicación de las normas de defensa de la competencia a los organismos de la administración del estado
(Thomson Reuters ; Centro de Libre Competencia UC, 2011)
Análisis de factibilidad técnico, económica y estratégica, para ampliar cobertura de enseñanza media Técnico Profesional, en Fundación Duoc UC
(Universidad de Chile, 2020)
. Desde el año 1990, Duoc UC administra el Liceo Politécnico Andes, un liceo técnico profesional gratuito, de excelencia académica, que en la actualidad cuenta con más de 1.300 estudiantes. Año a año las familias prefieren este Liceo para sus hijos. Cada...
Características que influyen en la empleabilidad de los egresados de la carrera Técnico Superior en Laboratorio Clínico y Banco de Sangre de Duoc UC en el año 2018
(Universidad de Chile, 2019)
disminución de la cifra de empleabilidad de la carrera Técnico Superior en Laboratorio Clínico y Banco de Sangre (TSLB) de DUOC UC y para aportar con oportunidades de mejora que apoyen una de las 4 dimensiones de la misión institucional que es; mantener el...
Employability is a factor considered for the development of the educational plan in educational institutions. Therefore, it is important to study the range of aspects involved in this area and relate them to the employability of each career, according to the local reality, furthermore, it is significant to know the labor market context deeply and the abilities that the graduates should manage to complement this market efficiently. This, mainly, to respond to the decrease in the employability figure of the Higher Technical career in the Clinical Laboratory and the Blood Bank (TCLB) of DUOC UC and to contribute with the opportunities to improve the support to the 4 dimensions of the mission institutional that is; Keep the focus on employability. This is a qualitative nature study; its purpose is to explore the perceptions of the employers of the TSLB graduates, according to the abilities or characteristics that each graduate must possess and how they respond to the needs of the labor market. Besides, as the data collection instrument the semi-structured interview was used, this interview was applied to all the employers related to the technical direction of the laboratories, to the selection of technical laboratory staff and to the blood bank. Experts validated the instrument. The HyperRESEARCH computer software supports the analysis of the qualitative data. In terms of results, it is described that the needs of the labor market are increasing in the private area. With respect to the public area, contracts, salary improvements and training in IT tools are highly required. Regarding to the most important characteristics of the TSLB DUOC UC, stand out the knowledge of the preanalytical stage of the laboratory and the proactivity. Finally, in this way updated, pertinent and relevant information is gathered that is included in the career-training plan, collaborating with strategies to increase employability....
Employability is a factor considered for the development of the educational plan in educational institutions. Therefore, it is important to study the range of aspects involved in this area and relate them to the employability of each career, according to the local reality, furthermore, it is significant to know the labor market context deeply and the abilities that the graduates should manage to complement this market efficiently. This, mainly, to respond to the decrease in the employability figure of the Higher Technical career in the Clinical Laboratory and the Blood Bank (TCLB) of DUOC UC and to contribute with the opportunities to improve the support to the 4 dimensions of the mission institutional that is; Keep the focus on employability. This is a qualitative nature study; its purpose is to explore the perceptions of the employers of the TSLB graduates, according to the abilities or characteristics that each graduate must possess and how they respond to the needs of the labor market. Besides, as the data collection instrument the semi-structured interview was used, this interview was applied to all the employers related to the technical direction of the laboratories, to the selection of technical laboratory staff and to the blood bank. Experts validated the instrument. The HyperRESEARCH computer software supports the analysis of the qualitative data. In terms of results, it is described that the needs of the labor market are increasing in the private area. With respect to the public area, contracts, salary improvements and training in IT tools are highly required. Regarding to the most important characteristics of the TSLB DUOC UC, stand out the knowledge of the preanalytical stage of the laboratory and the proactivity. Finally, in this way updated, pertinent and relevant information is gathered that is included in the career-training plan, collaborating with strategies to increase employability....
La Contraloría General de la República y el desvanecimiento de los limites del ámbito sujeto a su control
(Ediciones Derecho UC, 2009)