Miracle-dz/UniFAR-FTUs huggingface dataset:
Correspondencia entre la formación académica del estomatólogo relacionado con pacientes especiales y la práctica estomatológica integral

Se realiza una actualizacion bibliografica sobre la atencion a pacientes especiales (aquel que presenta signos y sintomas que lo alejan de la normalidad, sea de orden mental o sensorial, asi como de comportamiento). Se observo que en Espana y otros paises de Europa las instituciones academicas poseen programas de estudios universitarios de pre y posgrado, donde se adquieren conocimientos y habilidades para la atencion de pacientes especiales. Se clasifican los pacientes en 4 grupos, segun las afecciones que presentan: grupo I, pacientes con enfermedades cronicas degenerativas, como diabeticos, cardiopatas, nefropatas, discrasias sanguineas, epilepticos y otros; grupo II, pacientes con enfermedades que provocan deficit motor, donde se incluyen pacientes paraplejicos, cuadriplejicos, hemiplejicos y otros; grupo III, pacientes con enfermedades que provocan deficit sensorial como ciegos, sordos, sordomudos y otros; grupo IV, pacientes con retraso mental segun clasificacion de fronterizos, ligeros, moderados, severos y profundos. Se describen las caracteristicas de las enfermedades bucales en pacientes especiales. Se concluye que en el futuro, para realizar tratamientos bucales en este tipo de pacientes, se requerira de personal especializado y con medios adecuados. Habra que capacitar y formar a los profesionales de la estomatologia para poder responder a esta demanda y se deben realizar estudios epidemiologicos con enfoque de riesgos y atencion clinica con enfoque de familia, de tal forma que se involucre, se comprometa y se responsabilice con la atencion a este tipo de persona, para los que resulta fundamental el apoyo de la familia.
Automated Metamodel Instance GenerationSatisfying Quantitative Constraints

Metamodels are the core of the metamodeling approach and widely used in model driven architecture. The high abstraction level provided by metamodels makes the metamodeling approach popular among software modelers and language designers. However, the metamodeling approach has one big drawback: it does not support instance generation. Instances are particularly important for software modelers and language designers to test or verify their metamodels. Unfortunately, automatically generating metamodel instances is a very challenging task. Furthermore, the generated instances should ideally cover a more generic or specific feature of a metamodel as required by modelers for different purposes. This thesis presents a solution that combines both graph representation and Satisfiability Modulo Theories (SMT) to the problem of metamodel instance generation. The solution consists of two approaches, the first approach presents a new foundation for generating metamodel instances by translating a metamodel to an SMT problem via a bounded graph representation. The second approach investigates generating meaningful metamodel instances by using two new techniques. The first technique generates instances that meet partition-based coverage criteria by using criteria formulas to further constrain the entire generation process. The second technique generates instances that satisfy graph-property based criteria by introducing different scenarios. These two approaches have been prototyped into a new tool, named ASMIG, to demonstrate the feasibility of automatic metamodel instance generation.
Operating Interaction and Teleprogramming for Subsea Manipulation

The teleprogramming paradigm has been proposed as a means to efficiently perform teleoperation in the subsea environment via an acoustical link. In such a system the effects of both limited bandwidth channels and delayed communications are overcome by transmitting not Cartesian or joint level information but rather symbolic, error-tolerant, program instructions to the remote site. The operator interacts with a virtual reality of the remote site which provides immediate visual and kinesthetic feedback. The uncertainty in this model can be reduced based on information received from the slave manipulator's tactile contact with the environment. It is suggested that the current state of the model be made available to the operator via a graphical display which shows not only the position of objects at the remote site but also, through the use of color clues, the uncertainty associated with those positions. The provision of uncertainty information is important since it allows the operator to compromise between speed and accuracy. An additional operator aid, which we term synthetic fixturing, is proposed. Synthetic fixtures provide the operator of the teleprogramming system with the teleoperation equivalent of the "snap" commands common in computer aided design programs. By guiding the position and/or orientation of the master manipulator toward specific points, lines or planes the system is able to increase both the speed and precision with which the operator can control the slave arm without requiring sophisticated hardware. Comments University of Pennsylvania Department of Computer Science Technical Report No. 93-15. This technical report is available at ScholarlyCommons: http://repository.upenn. edu/cis_reports/449 Operating Interact ion and Teleprogramming for Subsea Manipulation MS-CIS-93-15 GRASP LAB 344 Craig Sayers Richard Paul Max Mintz University of Pennsylvania School of Engineering and Applied Science Computer and Information Science Department Philadelphia, PA 19104-6389
Crash Data Analysis and Engineering Solutions for Local Agencies

This report introduces the development process of an Internet-based, GIS-compatible software tool for Illinois local road crash analysis. This state-of-the-art tool is capable of performing crash information query, trend analysis, statistical analysis, color-coded mapping, and other safety information display within the web-based GIS compatible environment. The Internet-accessible user interface allows users to inquire about detailed information on vehicle crashes associated with road segments and intersections for any geographical regions or jurisdictions in the state of Illinois via query forms or zoom-enabled interactive maps. In addition, users can specify a data aggregation type, time range, and information type to display crash information in formats of tables, charts, or maps. This system helps the state and local transportation agencies in Illinois to screen dangerous highway segments, diagnose safety performance of the selected roads, and identify the most cost-effective countermeasures for safety improvements. This report addresses three major technical issues of the system design: (1) system architecture design and software development technologies, (2) supportive databases and data structure, and (3) user interfaces and system functionality. The report introduces system architecture and background components with used technologies for the full-scale implementation. In addition, descriptions on required datasets, their structures, and data-related issues are presented to explain the characteristics of databases. The system functionality section introduces functional definitions and explains the development purposes of all modules in the system. The report also explains how to utilize each module and provide required inputs for online crash data query and the decision support process based on web-based GIS applications.
The End of Theory? Does the Data Deluge Make the Scientific Method Obsolete?

Close Quit 1. Why Do We Need Theory? • One of the purposes of science is to predict. • Example: predict how a complex material (or a chemical substance) behaves in different situations. • Available information: a lot of records describing how different materials behave in different situations. • In the past, it was not possible to find a similar record and simply recall what happened then. • The only possibility was: – to extract, from the data, a simple dependence, and then – use this dependence for predictions.
MODELAMIENTO DINMICO Y ESTTICO DEL PROCESO DE COREOGRAFA DE SERVICIOS WEB

La coreografia de servicios web se encarga de la definicion de la vista global de un proceso de composicion de servicios; en esta definicion se identifica los componentes y sus distintas interacciones. La coreografia puede ser definida teniendo en cuenta sus aspectos estaticos y dinamicos. La vista estatica esta definida por el orden funcional requerido por el servicio compuesto. La vista dinamica se enfoca en las interacciones entre los servicios, ya que a traves de estas se intercambia informacion. En este articulo se presenta un modelamiento a la coreografia de servicios web, con el fin de ser solucionada por medio de definicion de restricciones.
An Algorithm for Synthesis of Aperiodic Optical Orthogonal Codes

Communication and computer systems have formed a common space where the quantity and quality of offered services are growing very fast at present. This situation leads to necessity of extreme optimal using of the connecting channels. A promising approach to the solution to this hard technical problem is applying of optic fibre systems with Code Division Multiple Access. The employing a special class of codes, named Optical Orthogonal Codes, enables to simplify greatly the complexity of the optic fibre system, to implement it with available technology, and to achieve potentially higher transmission efficiency. Unfortunately some important problems in the design of these signals are still open. Due to this reason our paper aims to suggest a computational algorithm for synthesis of Aperiodic Optical Orthogonal Codes.
Using PDA to Enhance Social Science Learning with Inquiry-based Strategies

This study presents a mobile exploration activity that guides elementary students to learn in social science activity with digital supports from mobile devices and wireless communications. The students are situated in both the real world and the virtual world to extend their learning experiences. The learning activities between the field and the digital system not only demonstrate the practices of mobile learning which emphasizes learning to happen close to real life but also provide learning content to facilitate students’ field studies. Moreover, a comprehensive evaluation method has been used to analyze the learning effectiveness. Based on inquiry-based learning principles, students use the handheld device, PDA, to do the investigations. By constructing their own knowledge, students’ learning performances are hoped to be enhanced. This research took Peace Temple in Tainan as an example and invited 33 fifth graders to participate. Through preand post-class questionnaires as well as observations and focus group interviews, descriptive quantitative and qualitative data were collected and analyzed. The results show significant positive results to students’ learning.
PLP - A Packet Loss Prevention Technique for Partitioned MANETs using Location-Based Multicast (LBM) Algorithms

Geocasting using Global Position System (GPS) in Mobile Ad hoc Network (MANET) has made location based services feasible. Location dependent services are mostly intended for a group of nodes in a geocasting region. Location based Multicast (LBM) Algorithms have presented multicasting techniques based on a forwarding zone. In this paper, a packet loss prevention technique is presented for partitioned networks between the source node and geocast region (although there exists a path between source and the multicast region); an issue not addressed by LBM Algorithms. It is proved through simulations that this scheme ensures high success rate with minimum possible flooding.
Faults Detection And Level Control In Coupled Tanks

Abstract This paper presents a mechanism for the detection and localization of faults in a plant, which is equipped with two coupled tanks, using residual methods. The water circuit consists of the upper and lower tanks connected through a system of pipes and valves. The controlled variable is the level in the upper tank. The level control system and the faults detection structure were developed under Matlab Simulink. The faults detection structure allows us to detect two faults that can occur in the plant, separately. The proposed method was theoretically developed and experimentally verified on the plant model.
Multilingual Use of Twitter: Language Choice and Language Bridges in a Social Network

Title of dissertation: MULTILINGUAL USE OF TWITTER: LANGUAGE CHOICE AND LANGUAGE BRIDGES IN A SOCIAL NETWORK Irene Eleta, Doctor of Philosophy, 2014 Dissertation directed by: Professor Jennifer Golbeck College of Information Studies Social media is international: users from different cultures and language backgrounds are generating and sharing content. But language barriers emerge in the communication landscape online. In the quest for language diversity and universal access, the vision of a cosmopolitan Internet has stumbled over the language frontier. Expatriates, minorities, diasporic communities, and language learners play an important role in forming transnational networks, creating social ties across borders. Many users of social media are multicultural and multilingual; they are mediating between language communities. In the microblogging site Twitter, information spreads across languages and countries. How are multilingual users of Twitter connecting language groups? What are the factors influencing their language choices? This research advances a step towards understanding the network structures and communication strategies that enable intercultural dialog, cross-language sharing of information, and awareness of global problems. This dissertation research aims at: (1) exploring the ways in which multilingual users of Twitter are connecting different language groups in their social network; (2) modeling how the network influences their language choices; (3) and exploring what the textual features of their posts can elicit about language choices and mediation between groups. This dissertation goes beyond survey information about multilingualism and provides a deeper understanding about the structural relations between language communities in Twitter. This research work is one of the few that apply social network analysis to the study of sociolinguistic questions on the Internet. Focusing on the social networks of multilingual users, this dissertation contributes an original classification of network types based on the patterns of connections between language groups. Also, it applies the novel idea of modeling the influence of network factors in the language choices of the user. Finally, this dissertation tests the hypothesis that the type of exchange influences language choice, and explores with a theme analysis how other textual features might elicit cross-cultural awareness. These results can inform the design of social media platforms. MULTILINGUAL USE OF TWITTER: LANGUAGE CHOICE AND LANGUAGE BRIDGES IN A SOCIAL NETWORK
Hacia una semiótica de la memoria

Este texto revisa teoricamente las aportaciones de la semiotica de la cultura para la comprension de la memoria como un proceso semiotico-discursivo. Retoma los modelos propuestos para el analisis de la cultura como un sistema complejo, dinamico y heterogeneo en el que la memoria juega un papel constitutivo. Define la memoria como el fundamento material simbolico que posibilita los procesos de transformacion e intercambio cultural por su capacidad de conservar y crear nuevos textos culturales. A partir de una articulacion interdisciplinaria plante la comprension de la memoria como una practica social y, como tal, factible de ser analizada a traves de las herramientas metodologicas que ofrecen la semiotica y el analisis del discurso. La memoria debe ser comprendida en una triple dimension: cognitiva como semiosis , como praxis social y como el producto de ese proceso.
Self-organizing semantic maps as graphical interfaces for information retrieval

This dissertation investigates the potential of using semantic map displays as browsing aids for information retrieval. A map display is proposed as a graphical representation of a document space. A neural network's self-organizing learning algorithm, Kohonen's feature map, is used to construct the map display. The map displays generated by the algorithm are found to show reasonable pictures of the underlying data: their major concepts, their semantic relationships, and their clusters, groups, and distributions. Such map displays can be used as a graphical interface for a retrieval system, in which users can pose broad queries and then browse for relevant documents in the high recall/low precision results. As an evaluation of the proposed map display, an experiment was conducted to examine how human subjects generate map displays. Eight subjects, each spending two hours, generated eight different map displays by placing 133 document titles on a large two-dimensional grid. The subjects were found to generate two types of maps: category-based maps and association-based maps. The category-based maps tend to be arranged in columns where categories are represented by more or less distinct groups. The association-based maps tend to maintain clear associations among clusters and groups, but boundaries for the clusters and groups are not clear. Comparing the map displays generated by the algorithm and by the human subjects, similarities are found in the semantic structures of the map displays, the processes of generating the displays, and the functionalities of the displays. When 68 subjects conducted some pseudo-retrieval tasks on the map displays, no significant difference is found between their performance on the human-generated map displays and on the machine-generated map displays, but a significant difference is found between their performance on these map displays and on a random display. These results suggest that the map displays can provide quick access to documents by virtue of their graphical representation. Results of this dissertation strongly imply that information can be and should be made visible to people who search for it.
Résolution d'équations sur les mots : étude et implémentation Lisp de l'algorithme de Makanin

Introduction de certaines notions et quelques ameliorations et simplifications de l'algorithme de Makanin. L'objectif est de donner une nouvelle version poursuivant l'etude de cet algorithme et de realiser une implementation permettant de traiter des equations non triviales. Proposition d'un systeme interactif ecrit en Lisp fonctionnant sur VAX 780 sous UNIX et sur machine Lisp. Ce systeme permet de visualiser les equations en position de l'arborescence, calculer une solution de l'equation a resoudre et fournit un outil permettant de comprendre, experimenter et etudier cet algorithme
Adaptability and the usefulness of hints

In this paper we study the problem of designing algorithms in situations where there is some information concerning the typical conditions that are encountered when the respective problem is solved. The basic goal is to assure efficient performance in the typical case, while satisfying the correctness requirements in every case. We introduce adaptability, a new measure for the quality of an algorithm, which generalizes competitive analysis and related frameworks. This new notion applies to sequential, parallel and distributed algorithms alike. In a nutshell, a hint function conveys certain information about the environment in which the algorithm operates. Adaptability compares the performance of the algorithm against the specialist-an algorithm specifically tuned to the particular hint value. From this perspective, finding that no single algorithm can adapt to all possible hint values is not necessarily a negative result, provided that a family of specialists can be constructed. Our case studies provide examples of both kinds. We first consider the ancient problem of on-line scheduling of jobs in m identical processors, and show that no algorithm can fully adapt to the natural hint of largest job size. In particular, for the cases m = 2, 3, we present specialists that beat the general lower bound for on-line makespan. In the domain of distributed computing, we analyze the Distributed Consensus problem under several hint functions. To fulfill the requirements of one of the cases we consider, we present the first consensus algorithm that is simultaneously optimal in number of processors, early-stopping property (that is, it runs in time proportional to the actual number of faults), and total number of communicated bits. In our new parlance, the algorithm adapts to the number of faults hint with both running time and communication.
The Pathetic Fallacy of RDF

The most popular visualization of RDF - the underlying language to represent the Semantic Web – is a Great Big Graph (GBG) or Big Fat Graph (BFG) if one prefers. By graph, we mean representations with nodes and edges to model the relationships within the space represented. Why are they the default representation? The answer that is usually proferred is that the Semantic Web is a Graph, ipso facto we use graphs to represent it. This notion that data should be presented to the user as it is represented in the computer is what we propose as the pathetic fallacy of RDF. In the following discussion, we consider examples of the pathetic fallacy in terms of the interaction challenge of * what knowledge these graphs communicate, * what tasks they support, and * whether these are the optimal paradigms for these representations/tasks. From this context, we investigate the question, are graphs the main default representation for the Semantic Web and if not, how might we think about formalized representations for the Semantic Web in order to make accessible the promised benefits of the Semantic Web for knowledge building.
Assessment of learning in complex domains

There is no tool directly measuring how the process of learning at complex domains however this research study proposes that the use of concept mapping and casual influence diagram methods have impacts in assessment of learning in complex domains. Subjects in this study use a web-based casual influence diagram and concept mapping tool to explain what they understand from a problem scenario and how they solve the problem. Even though the cognitive scientists propose that internal conceptual systems are not easily observable, the assessment tools of the study can help to interpret individuals’ communications and representations of own knowledge about their internal conceptual systems.
Processing Queries based on Hierarchical Web Summarization

In this investigation we discuss a novel method of query processing based on Web pages summarization while traditional query systems give part of the page contents. Clearly it is hard to grasp what the pages are going to say. In this work we show how useful hierarchical summarizations are to grasp the answers quickly as well as how to evaluate the answers. We show some experimental results using NTCIR Web documents.
Serpent: A Proposal for the Advanced Encryption Standard

We propose a new block cipher as a candidate for the Advanced Encryption Standard. Its design is highly conservative, yet still allows a very efficient implementation. It uses S-boxes similar to those of DES in a new structure that simultaneously allows a more rapid avalanche, a more efficient bitslice implementation, and an easy analysis that enables us to demonstrate its security against all known types of attack. With a 128-bit block size and a 256-bit key, it is as fast as DES on the market leading Intel Pentium/MMX platforms (and at least as fast on many others); yet we believe it to be more secure than three-key triple-DES.