Miracle-dz/UniFAR-FTUs huggingface dataset:
Exploration of NoSQL technologies for managing hotel reservations

During this project NoSQL technologies for Hotel IT have been evaluated. It has been determined that among NoSQL technologies, document database fits the best this use-case.Couchbase and MongoDB, the two main documents stores have been evaluated, their similarities and differences have been highlighted. This reveals that document-oriented features were more developed in MongoDB than Couchbase, this has a direct impact on search of reservations functionality. However Couchbase offers a better way to replicate data across two remote data centers. As one of the goals was to provide a powerful search functionality, it has been decided to use MongoDB as a database for this project.A proof of concept has been developed, it enables to search reservations by property code, guest name, check-in date and check-out date using a REST/JSON interface and confirms that MongoDB could work for storing hotel reservations in terms of functionality.Then different experiments have been conducted on this system such as throughput and response time using specific hotel reservation search query and data set. The results we got reached our targets. We also performed a scalability test, using MongoDB sharding functionalities to distribute data across several machines (shards) using different strategies (shard keys) so as to provide configuration recommendations. Our main finding was that it was not necessary to always distribute the database. Then if "sharding" is needed, distributing the data according to the property code will make the database go faster, because queries will be sent directly to the good machine(s) in the cluster and thus avoid "scatter-gather" query.Finally some search optimizations have been proposed, and in particular how an advanced search by names could be implemented with MongoDB.
The use of Haiku poetry in psycho-oncology

Aims: Our study aims to describe the discourse effects of specific and structured protocol focused on several Haiku poems about one man, who have experienced cancer. Procedure: the protocol consists of 4 steps; a preliminary exploratory interview, fifteen Haiku proposed without a part of poem (a creative writing, filled in by the patient), a free form haiku composed by the patient and finally a final interview. Clinical Case: One man, Mr D aged 25, He had tumor. Results: Using this protocol, we showed discourse variations on the illness before and after the experience of poetry writing, by Tropes V8.4 software. Conclusion: Haiku poetry can be a useful tool in the context of supportive interventions or as preparatory work for engagement in psychotherapeutic intervention. We believe that the formal structure of haikus can create conditions for a specific poetic work composed of: poetic evocation, synthesis and mapping of the most intimate experiences in oncology environment.
UML 2 pour les bases de données : Modélisation, normalisation, génération, SQL, outils - Avec 30 exercices corrigés Ed. 2

Concevoir une base de donnees grâce a UML 2 S'adressant aux architectes logiciels, chefs de projet, analystes, developpeurs, responsables methode et etudiants en informatique, cet ouvrage explique comment utiliser a bon escient le diagramme de classes UML pour concevoir une base de donnees, puis comment traduire correctement ce diagramme en langage SQL. Sa demarche est independante de tout editeur de logiciel et aisement transposable, quel que soit l'outil de conception choisi. Le livre decrit d'abord la construction d'un diagramme de classes UML a l'aide de regles de validation et de normalisation. Tous les mecanismes de derivation d'un modele conceptuel dans un schema relationnel sont clairement commentes a l'aide d'exemples concrets. Le modele logique est ensuite optimise avant l'ecriture des scripts SQL. La derniere etape consiste a implementer les regles metier en programmant des contraintes, declencheurs ou transactions SQL. Le livre se clot par une etude comparative des principaux outils de modelisation sur le marche. Entierement reecrite, cette deuxieme edition est commentee par Frederic Brouard, expert SQL Server et auteur de nombreux ouvrages et articles sur le langage SQL. Emaillee d'une centaine de schemas et d'illustrations, elle est completee par 30 exercices inspires de cas reels. A qui s'adresse cet ouvrage ? Aux etudiants en IUT, IUP, Deug et ecoles d'ingenieur, ainsi qu'a leurs professeurs Aux professionnels souhaitant s'initier a la modelisation de bases de donnees avec UML A tous les concepteurs de bases de donnees desirant migrer de Merise a UML
Graph Structured Data Security using Trusted Third Party Query Process in Cloud Computing

Cloud computing enables the users to outsource and access data economically from the distributed cloud server. Once the data leaves from data owner premises, there is no privacy guarantee from the untrusted parties in cloud storage system. Providing data privacy for the outsourced sensitive data is a challenging task in cloud computing. In this paper we have proposed a Trusted Third party Query Process(TTQP) method to provide data privacy for graph structured outsourced data. This method utilize the encrypted graph frequent features search index list to search the matched query graph features in graph data base. The proposed system has analyzed in terms of different size of data graphs, index storage, query feature size and query execution time. The performance analysis of our proposed system shows, this method is more secure than the existing privacy preserving encrypted Query Graph (PPQG). Index Terms—Security, Graph structured data, Feature, Trapdoor
Die Signaltransduktion der Fusionstyrosinkinase ITK-SYK im Rahmen der Lymphomentstehung

Unspezifizierte periphere T-Zell-Lymphome (uPTZL) weisen eine schlechte Prognose auf. Ihre molekulare Pathogenese ist kaum verstanden. In der vorliegenden Arbeit wurde diese anhand der in uPTZL rekurrenten Fusionstyrosinkinase ITK-SYK beleuchtet. Auserdem wurde in transgenen Mausmodellen das transformierende Potential von ITK-SYK untersucht. Die Ergebnisse zeigen, dass die Expression von ITK-SYK in den Mausmodellen zu einer klonalen Lymphoproliferation fuhrt, die den humanen uPTZL ahnelt. ITK-SYK kann hierbei eine Stimulation des T-Zell-Rezeptors sowie des CD28-Korezeptors imitieren. Es konnten so potentielle Strukturen fur zielgerichtete Therapien identifiziert werden.
Construire facilement des plans de résolution IV à partir des tables de Taguchi

L'utilisation des plans d'experiences est aujourd'hui largement developpee dans le milieu industriel. Parmi les plans utilises, figurent en bonne place ceux etablis a partir des tables et graphes lineaires de Taguchi. Par la simplicite de l'approche, cette methode a convaincu de nombreux industriels. Pourtant, la plupart des plans crees par cette methode sont des plans de resolutions III comportant de nombreux risques. Nous proposons dans cet article une methode tres simple, de construction de plans de resolution IV a partir de graphes de Taguchi modifies a la portee de tous les techniciens. Ces nouveaux graphes sont fondes sur des proprietes specifiques des colonnes impaires de ces tables. Nous developpons egalement une extension de cette methode pour construire des plans gigognes simples.
Projet et intégration d'un système de transfert inductif pour les applications automobiles

La transmission inductive de puissance (IPT) pour les vehicules electriques est une technologie emergente prometteuse qui semble capable d'ameliorer l'acceptation de la mobilite electrique. Au cours des deux dernieres decennies, de nombreux chercheurs ont demontre la faisabilite et la possibilite de l'utiliser pour remplacer les systemes conducteurs classiques pour la charge de la batterie a bord du vehicule. Actuellement de nombreux efforts visent a etendre la technologie IPT vers son utilisation pour la charge pendant le mouvement du vehicule. Cette application, generalement appelee IPT dynamique, vise a surmonter la limite representee par les arrets prolonges necessaires pour la recharge introduisant egalement la possibilite de reduction de la capacite de la batterie installee a bord du vehicule. Un systeme IPT est essentiellement base sur la resonance de deux inducteurs magnetiquement couples, l'emetteur, place sur ou sous le sol, et le recepteur, place sous le plancher du vehicule. La gamme de frequence de fonctionnement typique pour les applications automobiles va de 20 kHz a environ 100 kHz. Le couplage entre les deux inductances s'effectue a travers un entrefer important, generalement d'environ 10-30 cm. Cette these presente les resultats des activites de recherche visant a la creation d'un prototype pour l'IPT dynamique oriente vers le transport prive. A partir d'une analyse de l'etat de l'art et des projets de recherche en cours dans ce domaine, ce travail presente le developpement d'un modele de circuit capable de decrire les phenomenes electromagnetiques a la base du transfert de puissance et l'interface avec l'electronique de puissance. Les analyses effectuees a travers le modele developpe fournissent la base pour la conception et la mise en œuvre d'un convertisseur dedie a faible cout et efficacite elevee pour l'alimentation du cote transmetteur. Une architecture generale de l'electronique de puissance qui gere le cote recepteur est proposee avec les circuits de protection supplementaires. Une methodologie pour la conception integree de la structure magnetique est illustree. Cette methodologie couvre les aspects de l'interface avec l'electronique de puissance, l'integration sur un vehicule existant et l'installation sur l'infrastructure routiere. Une serie d'activites visant a la realisation d'un site d'essai dedie sont presentees et discutees. En particulier, les activites liees a la creation de l'infrastructure electrique ainsi que les questions et les methodes d'implantation des emetteurs dans le revetement routier sont presentees. L'objectif final est la creation d'une ligne de recharge IPT dediee de 100 metres de long. Enfin, une methodologie d'evaluation de l'exposition humaine est presentee et appliquee a la solution developpee.
Choosing where to go : mobile robot exploration

For a mobile robot to engage in exploration of a-priori unknown environments it must be able to identify locations which will yield new information when visited. This thesis presents two novel algorithms which attempt to answer the question of choosing where a robot should go next in a partially explored workspace. To begin we describe the process of acquiring highly accurate dense 3D data from a stereo camera. This approach combines techniques from a number of existing implementations and is demonstrated to be more accurate than a range of commercial o↵erings. Combined with state of the art visual odometry based pose estimation we can use these point clouds to drive exploration. The first exploration algorithm we present is an attempt to represent the three dimensional world as a continuous two dimensional surface. The surface is maintained as a planar graph structure in which vertices correspond to points in space as seen by the stereo camera. Edges connect vertices which have been seen as adjacent pixels in a stereo image pair, and have a weight equal to the Euclidean distance between the end points. Discontinuities in the input stereo data manifest as areas of the graph with high average edge weight, and by moving the camera to view such areas and merging the new scan with the existing graph, we push back the boundary of the explored workspace. Motivated by scaling and precision problems with the graph-based method, we present a second exploration algorithm based on continuum methods. We show that by solving Laplace’s equation over the freespace of the partially explored environment, we can guide exploration by following streamlines in the resulting vector field. Choosing appropriate boundary conditions ensures that these streamlines run parallel to obstacles and are guaranteed to lead to a frontier – a boundary between explored and unexplored space. Results are shown which demonstrate this method fully exploring three dimensional environments and outperforming oft-used information gain based approaches. We show how analysis of the potential field solution can be used to identify volumes of the workspace which have been fully explored, thus reducing future computation. ii Statement of Authorship This thesis is submitted to the Department of Engineering Science, University of Oxford, in fulfilment of the requirements for the degree of Doctor of Philosophy. This thesis is entirely my own work, and except where otherwise stated, describes my own research. Robbie Shade, New College Funding The work described in this thesis was funded partly by OC Robotics, and partly by the Engineering and Physical Sciences Research Council (EPSRC).
An application to create problem-specific document object models for XML

XML is widely used. How to parse XML documents and manipulate XML data are very important tasks and popular topics in the software industry. There are several ways of handling XML data today. One of them is to turn an XML document into a tree structure of data. The most popular API of this model is W3C DOM (Document Object Model) [2]. But what DOM provides is a generic data model rather than a problem-specific model, which makes it complicated and inefficient. And in many cases, programmers don’t use the generic data model. More often, they need an object model that is specific to a particular problem. This is where this project comes in. The purpose of this project is to develop an application that turns XML sources of a particular schema into a Problem-Specific Document Object Model (PSDOM). Compare to the W3C DOM, this model is lightweight. It parses XML documents more efficiently. And this model makes it easier to create applications processing XML data. Compare to the Sun’s JAXB, this model gives users more flexibility in controlling of the mapping. The model is clearer and more understandable by separating the code of parsing XML documents from the code of building user applications. This application contains an XML styled, userfriendly Class Definition Language. It contains a CDF compiler that compiles Class Definition Files (CDF) into observers and element classes. It also has a binding framework that uses the “observer” idea from Dr. Schreiner’s “oops” framework [4] to marshal and un-marshal between XML documents and problem-specific object trees.
Differential-Algebraic Systems: Analytical Aspects and Circuit Applications

Differential-algebraic equations (DAEs) provide an essential tool for system modeling and analysis within different fields of applied sciences and engineering. This book addresses modeling issues and analytical properties of DAEs, together with some applications in electrical circuit theory. Beginning with elementary aspects, the author succeeds in providing a self-contained and comprehensive presentation of several advanced topics in DAE theory, such as the full characterization of linear time-varying equations via projector methods or the geometric reduction of nonlinear systems.Recent results on singularities are extensively discussed. The book also addresses in detail differential-algebraic models of electrical and electronic circuits, including index characterizations and qualitative aspects of circuit dynamics. In particular, the reader will find a thorough discussion of the state/semistate dichotomy in circuit modeling. The state formulation problem, which has attracted much attention in the engineering literature, is cleverly tackled here as a reduction problem on semistate models.
A Load-Based Approach to Forming a Connected Dominating Set for an Ad Hoc Network

Efficient routing in mobile ad hoc networks (MANETs) is highly desired and connected dominating sets (CDS) have been gaining significant popularity in this regard. The CDS based approach reduces the search for a minimum cost path between a pair of source and destination terminals to the set of terminals forming the backbone network. Researchers over the years have developed numerous distributed and localized algorithms for constructing CDSs which minimize the number of terminals forming the backbone or which provide multiple node-disjoint paths between each pair of terminals. However none of this research focuses on minimizing the load at the bottleneck terminal of the backbone network constructed by the CDS algorithms. A terminal becomes a bottleneck if the offered traffic load is greater than its effective transmission rate. In this thesis we analyze the load-based performance of a popular CDS algorithm which has been employed in MANET routing and a k-connected k-dominating set (k-CDS) algorithm and compare it with our new centralized algorithm which has been designed to minimize the load at the bottleneck terminal of the backbone network. We verify the effectiveness of our algorithm by simulating over a large number of random test networks.
Affordable techniques for dependable microprocessor design

As high computing power is available at an affordable cost, we rely on microprocessor-based systems for much greater variety of applications. This dependence indicates that a processor failure could have more diverse impacts on our daily lives. Therefore, dependability is becoming an increasingly important quality measure of microprocessors. Temporary hardware malfunctions caused by unstable environmental conditions can lead the processor to an incorrect state. This is referred to as a transient error or soft error. Studies have shown that soft errors are the major source of system failures. This dissertation characterizes the soft error behavior on microprocessors and presents new microarchitectural approaches that can realize high dependability with low overhead. Our fault injection studies using RISC processors have demonstrated that different functional blocks of the processor have distinct susceptibilities to soft errors. The error susceptibility information must be reflected in devising fault tolerance schemes for cost-sensitive applications. Considering the common use of on-chip caches in modern processors, we investigated area-efficient protection schemes for memory arrays. The idea of caching redundant information was exploited to optimize resource utilization for increased dependability. We also developed a mechanism to verify the integrity of data transfer from lower level memories to the primary caches. The results of this study show that by exploiting bus idle cycles and the information redundancy, an almost complete check for the initial memory data transfer is possible without incurring a performance penalty. For protecting the processor's control logic, which usually remains unprotected, we propose a low-cost reliability enhancement strategy. We classified control logic signals into static and dynamic control depending on their changeability, and applied various techniques including commit-time checking, signature caching, component-level duplication, and control flow monitoring. Our schemes can achieve more than 99% coverage with a very small hardware addition. Finally, a virtual duplex architecture for superscalar processors is presented. In this system-level approach, the processor pipeline is backed up by a partially replicated pipeline. The replication-based checker minimizes the design and verification overheads. For a large-scale superscalar processor, the proposed architecture can bring 61.4% reduction in die area while sustaining the maximum performance.
Scanning Tunneling Microscopy and Its Application

This work touches on the principles of STM and other related techniques and their practical applications. It presents detailed STM instrumentation and the applications in metal and semiconductor surfaces, surface adsorbates and nano-fabrication. Besides a large amount of useful figures, the book uses simple language to discuss problems in depth in order to enable readers to understand and master basic conceptions of the subject. Designed as an ABC book for beginners, it provides enough information for professionals for an integrated understanding of STM and other related techniques.
Sharing Learners' Behavior to Enhance a Metacognition-oriented Intelligent Tutoring System

Literature shows that Intelligent Tutoring Systems (ITS) are growing in acceptance and popularity because they increase performances of students, leverage cognitive development, but also significantly reduce time to acquire knowledge and competencies. Moreover, monitoring metacognitive skills enables learners to assess performance and select appropriate fix-up: individuals unable to ensure self-monitoring cannot detect errors and as a consequence, they process information less efficiently than skilled monitors. Thus, we present an ITS offering the opportunity of evaluating various metacognitive indicators and able to share this information with others learning tools. Our online tutor is based on an existing ITS authoring tool that we extended to support metacognition and share learners’ profiles and activities into a standardized, distributed and open tracking repository. This framework, validated by an experimentation, thus helps to correlate metadata experiences with real performance
Performance Assurance for IT Systems

INDIVIDUAL AREAS OF INTEREST Preparing for the Challenge Abstract Introduction In the Beginning The Need to Address New Applications Definition of Performance The Required Skills Performance Assurance Within a Project Lifecycle Summary Caveat Emptor (Let the Buyer Beware) Abstract Software Product Lifecycle Hardware Product Lifecycle Marketing Technical Reviews of Products Lies, Damned Lies and Benchmarks Abstract Introduction Industry Benchmarks Vendor Benchmarks Independent Benchmarking In-House Benchmarking "Tricks of the Trade" Using Benchmarks Non-Functional Requirements and Solutions Abstract Introduction The Problems Sizing Information Performance Requirements Hardware Sizing Hardware Deployment and Scalability Availability The Need for Business Continuity Summary Hardware Sizing: The Crystal Ball Gazing Act Abstract The Challenge Summary of Hardware Sizing Approaches High Level Sizing Method Batch Processing Considerations Sizing Software Products Sizing Reviews Deliverables Hardware Sizing Revisited Change Summary Bid Logistics Abstract The Challenge Bid Qualification The Political Dimension Teaming Dealing with Hardware and Software Vendors Iterative Sizing Bid Reviews Prototypes BAFO Documentation Summary Designing for Performance, Scalability, and Resilience Abstract Initial Observations Basic Design Principles General Thoughts and Guidelines Coding and Testing Summary Awareness of Queues Abstract Queues Locks Tackling Delays Analytic and Simulation Modeling Tools Alternative Approaches Summary Non-Functional Acceptance Abstract The Issues Stress Testing Soak Testing Operational-Readiness Testing Summary Post-Production Abstract Introduction Classic Capacity Management A Minimalist Approach to Capacity Management Softer Issues Abstract Introduction Devil's Advocate and Seductive Technology Communication Awareness of Cost Awareness of Time Over-Engineering Smoke-Filled Rooms Team Balance Multi-Tasking Client Responsibilities Technical Postmortem All-Rounders So What? "My Way" Informed Approach TECHNOLOGY FOUNDATION Introduction to Technology Tasters Operating Systems CPU Basics Memory Hard Disk Basics Server Infrastructure Multiprocessors (Shared Memory) Hard Disk: Fibre Channel, SAN and NAS File Access Basics Relational Database Basics Back-End Server Clusters Network Basics Firewalls Server Load Balancing Web Server and Cache Server LDAP Server Modern Server-Side Development Technologies