To see the other types of publications on this topic, follow the link: Sqh.
Dissertations / Theses on the topic 'Sqh'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Sqh.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
1
Tsoumpekos, Georgios. "big bang, a novel regulator of tissue growth in Drosophila melanogaster." Doctoral thesis, Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2016. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-201276.
Full textAbstract:
Multicellular organisms need to control their size throughout development and adult life in the face of challenges such as rapid growth. Unraveling the mechanisms that regulate tissue growth in epithelial tissues, in order to generate organs of correct size and proportion, remains a crucial goal of developmental biology. A suitable epithelial tissue for studying tissue growth in Drosophila, is the proliferative monolayer epithelial sheet of imaginal wing discs, which gives rise to the adult wing. The Hippo signaling pathway regulates tissue growth in wing development. There are several observations that link tissue growth/Hippo signaling with cell polarity and the actin cytoskeletal organization.
The aim of this thesis was the study of the interplay between cell polarity, cytoskeletal organization and tissue growth. To gain further insight into how apical polarity proteins regulate tissue growth, an enhancer/suppressor screen that was previously conducted in our lab by Linda Nemetschke, was used. The screen was based on the modification of a dominant smaller wing phenotype induced upon overexpression of CrbextraTM-GFP. One of the enhancers identified in this screen is a gene called big bang (bbg). The absence of bbg results in smaller wings with a slower cell cycle and increased apoptosis in wing discs. bbg encodes a protein expressed in the apical cortex in wing disc cells and is required for the proper localization of apical proteins, like Crb, in wing disc epithelia. Bbg is also in the same complex with Spaghetti Squash (Sqh) in the apical cortex of the wing disc epithelia. sqh encodes an actin-binding protein that has actin cross-linking and contractile properties. Bbg stabilizes Sqh in the apical compartment of the cell. It is reported that both Crb and Sqh regulate tissue growth through the Hippo signaling pathway. In conclusion, Bbg regulates wing tissue growth, acting as a scaffolding molecule, through the proper localization of apical components of the cells like Crb and the cytoskeletal component Sqh.
2
Rani, Venkata. "Translating Temporal SQL to Nested SQL." DigitalCommons@USU, 2016. https://digitalcommons.usu.edu/etd/4966.
Full textAbstract:
Sequenced and nonsequenced semantics are the two previously researched semantics for the evaluation of an operation in a temporal database such as a query or data modification. Sequenced semantics evaluates an operation in each time instant using only the data alive at that time. Nonsequenced semantics, in contrast, means that an operation explicitly references and manipulates the timestamps in the data.
In this thesis we propose a new framework that shows both semantics are variants of a general temporal semantics. We present the general semantics and show how additional semantics, such as preceding semantics can be realized. The semantics are specified using annotations.
The primary contribution of this theses is the translation from temporal SQL to nested SQL. We focus on SQL's SELECT statement, which is used to query data. Temporal SQL is SQL annotated with temporal semantics. Nested SQL is SQL for non-1NF data, with additional operations, such as COGROUP and FLATTEN to create and un-nest, respectively, bags of tuples (non-1NF data). This thesis develops a denotational semantics for translating from temporal to nested SQL. We implemented the denotational semantics for an SQLite ANTLR grammar, and the thesis also reports on the implementation.
4
Čebanauskas, Saulius. "SQL mokymosi sistema." Master's thesis, Lithuanian Academic Libraries Network (LABT), 2010. http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2010~D_20100826_112703-93241.
Full textAbstract:
Šiais laikais, kai praktiškai visų sričių „popieriniai“ duomenys jau baigia išnykti, didelę dalį IT visuomenėje sudaro vienokio ar kitokio tipo duomenų bazės. Paprastam vartotojui, kuris naudojasi tik vartojamojo tipo programomis, SQL užklausų mokėjimas nėra reikalingas, tačiau bet kuris programuotojas, kuris dirba su duomenimis, savo darbo ko gero nebeįsivaizduoja be duomenų bazių ir SQL užklausų.
SQL užklausa (SQL Query) – tai užklausa, atliekama SQL kalbos komandų pagalba. SQL (Structured Query Language) kalba – struktūrizuota užklausų kalba, skirta duomenų, esančių duomenų bazėje apdorojimui. SQL kalba dirba tik su reliacinėmis DB. Vartotojas SQL pagalba kreipiasi į DBVS, kuri apdoroja užklausą, randa reikalingus duomenis ir pateikia juos vartotojui. SQL nėra nei DBVS, nei atskiras programinis produktas, tai yra neatsiejama DBVS dalis, instrumentas, kurio pagalba realizuojamas vartotojo ryšys su DBVS. SQL kalbos lankstumas ir nepriklausomumas nuo kompiuterinių technologijų specifikos, o taip pat jos palaikymas pagrindiniais lyderiais reliacinių duomenų bazių technologijų srityje padarė SQL kalbą pagrindine standartine duomenų bazių programavimo kalba [1].
SQL užklausos yra naudojamos visose dabartinėse duomenų bazėse, tokiose kaip MsSQL, MySQL, Firebird ir kitose. SQL sakiniai gali būti įterpiami į programas, sudaromas bazine programavimo kalba.
Taigi SQL užklausos yra naudojamos visur, kur yra naudojamos ir duomenų bazės. Tą pačią SQL užklausą... [toliau žr. visą tekstą]Nowadays, when “paper” data practically from all the scopes is on the edge of extinction, big part of IT society is made of one or another type of databases. SQL queries are used to work with database information. SQL (Structured Query Language) is designed for database information processing. For fast systems, related with databases operation, it is necessary to correctly write and optimize SQL queries. To learn write SQL queries correctly and optimize them, only the theoretical knowledge is not enough, it is necessary to do a lot of practical tasks. When learning to write SQL queries, basic problem is poor choice of practical tasks, and non-existence of good testing system, which allows writing SQL queries easily. On the job the existent SQL learning systems and learning materials analysis were performed, all found systems has its own problems, full freedom to write SQL queries for user is not granted. During designing, methods allowing for learner easily write various types of queries, view executed queries results and get the result if a written query is correct, were designed. Designed methods were used in remote SQL queries learning system design and implementation. Aim: The algorithms which are developed and implemented allows to test sql queries based on simple syntax and allows to execute queries of the different types. The object of research: Execution of various SQL queries.
5
Collett, Torstein Calvin. "Simple SSH Management." BYU ScholarsArchive, 2021. https://scholarsarchive.byu.edu/etd/9130.
Full textAbstract:
SSH certificates are used by administrators so connections to the server can be verified. This ensures that only authorized administrators can access the server and that the server being accessed is the intended machine. Current solutions for managing SSH certificates are focused on commercial use, which makes them cumbersome for small groups and individuals to use. These solutions require running multiple services that companies already use but add significant overhead for smaller groups. We developed a new standalone system that makes it easy to manage SSH certificates for small amounts of servers and users, without requiring additional servers to be deployed. We evaluated our system with a user study to demonstrate its ease of use. We hope that this implementation can help guide future research toward a more simplified certificate authentication system for SSH.
6
Buso, Fabio. "SQL on Hops." Thesis, KTH, Skolan för informations- och kommunikationsteknik (ICT), 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-215692.
Full textAbstract:
In today’s world data is extremely valuable. Companies and researchers store every sort of data, from users activities to medical records. However, data is useless if one cannot extract meaning and insight from it. In 2004 Dean and Ghemawat introduced the MapReduce framework. This sparked the development of open source frameworks for big data storage (HDFS) and processing (Hadoop). Hops and Apache Hive build on top of this heritage. The former proposes a new distributed file system which achieves higher scalability and throughput by storing metadata in a database called MySQL-Cluster. The latter is an open source data warehousing solution built on top of the Hadoop ecosystems, which allows users to query big data stored on HDFS using a SQL-like query language.Apache Hive is a widely used and mature project, however it lacks of consistency between the data stored on the file system and the metadata describing it, stored on a relational database. This means that if users delete Hive’s data from the file system, Hive does not delete the related metadata. This causes two issues: (1) users do not get an error if the data is missing from the filesystem (2) if users forget to delete the metadata, it will become orphaned in the database. In this thesis we exploit the fact that both HopsFS’ metadata and Hive’s metadata is stored in a relational database, to provide a mechanisms to automatically delete Hive’s metadata if the data is delete from the file system.The second objective of this thesis is to integrate Apache Hive into the Hops ecosystem and in particular in the HopsWorks platform. HopsWorks is a multitenant, UI based service which allows users to store and process big data projects. In this thesis we develop a custom authenticator for Hive to allow HopsWorks users to authenticate with Hive and to integrate with its security model.
7
Akinci, Gizem [Verfasser], and Matthias [Akademischer Betreuer] Teschner. "Efficient surface reconstruction for SPH fluids = Effiziente Oberflächenrekonstruktion für SPH Flüssigkeiten." Freiburg : Universität, 2014. http://d-nb.info/1114829315/34.
Full text
8
Šmalec, Ondřej. "Aplikace pro monitorování sítí." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2019. http://www.nusl.cz/ntk/nusl-400875.
Full textAbstract:
Diplomová práce popisuje vytvoření aplikace pro monitorování síťových zařízení. Výsledky jsou zobrazené jako grafické uživatelské rozhraní společně s vykreslenou topologií. Aplikace je z velké části napsána v jazyce Python. Pro získávání informací z topologie jsou využity protokoly SNMP a SSH. Hlavní cíl je vytvořit aplikaci, která monitoruje síťová zařízení a vykresluje tuhle topologii do grafického uživatelského rozhraní. Tato aplikace reaguje dynamicky na změny v monitorovací topologii.
9
JESUS, E. M. "Operadores SPH sobre variedades." Universidade Federal do Espírito Santo, 2017. http://repositorio.ufes.br/handle/10/7408.
Full textAbstract:
Made available in DSpace on 2018-08-01T22:00:13Z (GMT). No. of bitstreams: 1
tese_10699_dissertacao.pdf: 17285608 bytes, checksum: 0575dea8caa70653dee0fde52d83496d (MD5)
Previous issue date: 2017-02-20Este projeto propõe uma extensão do método SPH (Smoothed Particle Hydrodynamics) [1] para variedade diferenciáveis. Inicialmente desenvolvido no Rn, o método SPH baseia-se no conceito de representação integral que não é estendido de forma natural para variedade. No entanto, este conceito pode ser aplicado ao espaço tangente da variedade. Sendo assim, impondo algumas condições a variedade, o método SPH poderá ser aplicado à pontos projetados no espaço tangente de cada partícula [2]. Esta abordagem resulta numa boa aproximação para os operadores diferenciais sobre a variedade, sendo assim considerada uma generalização consistente do método. Estes operadores generalizados serão utilizados na Decomposição de Helmhotz-Hodge e análise de campos vetoriais [3], simulação de fluidos incompressíveis, resolução de equações clássicas como a equação da onda, equação do calor, dentre outras, sobre variedades. Bibliografia: 1) Liu, Gui-Rong e Liu, M.B. "Smoothed Particle Hydrodynamics: A Meshfree Particle Method". World Scientific, 2003 2) Petronetto, Fabiano, et al. "Mesh-Free Discrete Laplace-Beltrami Operator". Computer Graphics Forum, 2013. 3) Petronetto, Fabiano, et al. "Meshless helmholtz-hodge decomposition". IEEE transactions on visualization and computer graphics, 2010. 4) Mercier, Olivier, et. al. "Surface turbulence for particle-based liquid simulations". ACM Transactions on Graphics (TOG), 2015.
10
Laibaças, Hugo Alexandre Lopes. "Laboratório online de SQL." Master's thesis, Universidade de Évora, 2013. http://hdl.handle.net/10174/16391.
Full textAbstract:
As bases de dados consubstanciam umas das áreas do saber no domínio da informática, designadamente,
as bases de dados relacionais, que se apresentam como as mais populares e
difundidas. Neste contexto, surge o SQL, uma linguagem de programação desenhada para permitir
fazer a gestão dos dados em SGBD relacionais. Não tendo sido identificada na Internet, a
existência de qualquer ferramenta que incorpore o conceito de laboratório online de SQL, decidiuse
criar uma ferramenta ampla e que auxilie na aprendizagem desta linguagem e seus conceitos,
proporcionando um ambiente agregador de vários vetores essenciais para uma aprendizagem
consistente.
A componente teórica será muito privilegiada. No entanto, é a componente prática que desempenhará
o papel principal, revestindo-se de um ambiente de ensaio onde cada membro poderá
explorar o SQL e aprimorar as suas habilidades na utilização desta linguagem, através das experiências
que poderá fazer com as bases de dados colocadas ao seu dispor; ABSTRACT: The databases embody one of the areas of knowledge in the field of computer science, namely,
the relational databases, which are considered the most popular and widespread. In this context
there is SQL, a programming language designed to allow data management in Relational Database
Management Systems (RDBMS). Not having been identified on the Internet, the existence
of any tool that incorporates the concept of online laboratory of SQL, it was decided to create a
such a tool, to assist in learning this language and its concepts, providing a multi-vector aggregator
platform, essential for consistent learning.
The theoretical component will be very privileged. However, it is the practical component that
plays the main role, by taking up a test environment where each member can explore SQL and
improve their skills, through the experiences that can be done by using the databases placed at
their disposal.
11
Horák, Jan. "SQL backend pro Subversion." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2010. http://www.nusl.cz/ntk/nusl-237115.
Full textAbstract:
The thesis analyzes version control system Subversion and its available backends for storing data in a repository. It compares these backends and describes basic features of a new SQL database backend. Design and implementation of the new backend, based on MySQL database, is described and the new backend is then compared with existing backends BDB and FSFS.
12
(UPC), Universidad Peruana de Ciencias Aplicadas. "SQL Server - SI92 201801." Universidad Peruana de Ciencias Aplicadas (UPC), 2018. http://hdl.handle.net/10757/623250.
Full textAbstract:
Curso electivo para las carreras de Ingeniería de Software (ISW), Ingeniería de Sistemas de Información (ISI) y
Ciencias de la Computación (CC), de carácter teórico-práctico, dirigido a los estudiantes de séptimo nivel para
(CC), noveno nivel para (ISI) y decimo nivel para (ISW), que busca desarrollar la competencia DISEÑA
SISTEMAS, COMPONENTES O PROCESOS PARA ENCONTRAR SOLUCIONES EN LA ATENCIÓN DE
NECESIDADES TENIENDO EN CUENTA RESTRICCIONES ECONÓMICAS, SOCIALES, POLÍTICAS,
ÉTICAS, DE SALUD Y SEGURIDAD Y OTRAS PROPIAS DEL ENTORNO EMPRESARIAL. Acorde al
ABET Student Outcome (C) para (ISW).
En este curso el estudiante podrá diseñar, implementar y administrar soluciones de bases de datos orientadas a
empresas, utilizando como motor el Microsoft SQL Server 2012. En la actualidad la mayoría de proyectos
informáticos necesita de un sólido conocimiento de base de datos.
13
Waß, Christopher. "Demotisch, hieratisch und SQL." Universitätsbibliothek Leipzig, 2016. http://nbn-resolving.de/urn:nbn:de:bsz:15-qucosa-201797.
Full textAbstract:
Im Fokus des vorgestellten Projektes steht die Untersuchung der Verwendung von zwei ägyptischen Kursivschriften in einem homogenen Textkorpus. Hierbei handelt es sich zum einen um Hieratisch, einer Kursivschrift, die etwa zeitgleich mit den Hieroglyphen im 3. Jtd. v. Chr. entstand und für Texte auf Papyrus verwendet wurde. Mit beiden Schriftarten wurde in der Regel dieselbe Phase der ägyptischen Sprache geschrieben. Zum anderen um Demotisch, einer um 650 v. Chr. entwickelten Kursivschrift, die ebenfalls für Texte auf Papyrus verwendet wurde, und eine historisch jüngere Sprachstufe beschreibt. Beide Schriftsysteme erscheinen nebeneinander in den vier magischen Papyri der sog. „Theban Magical Library“ aus dem 3. Jhd. n. Chr., die sich heute in London, Leiden und Paris befinden. Das zu untersuchende Textkorpus umfasst etwa 157 Einzeltexte, die sich auf mehr als 1700 Zeilen Text verteilen. Ein Großteil der Texte ist in demotischer Schrift und Grammatik geschrieben. Daneben finden sich einige Passagen in hieratischer, griechischer und in einer Zauberschrift. Auch sprachliche sind die Texte keineswegs homogen. Kürzere Passagen weisen häufig eine ältere Sprachstufe als das Demotische auf. Auch die Schriftart kann innerhalb eines Satzes, in einigen Fällen sogar innerhalb eines Wortes, wechseln. Die Gründe für die Verwendung von demotischer und hieratischer Schrift sind bisher nicht untersucht worden. Da die einzelnen Sprüche auf unterschiedliche Vorlagen aus verschiedenen Kulturkreisen zurückgehen, liegt der Schwerpunkt des Vorhabens auf der Untersuchung der Beziehung von Schriftart, Sprache oder Sprachstufe und Inhalt. Bisher wird in der Forschung davon ausgegangen, dass hieratische Schrift zur Schreibung von Götterbezeichnungen oder bestimmter Termini, bevorzugt also bei Passagen mit religiösem Inhalt Verwendung fand. Jüngere Überlegungen konnten jedoch zeigen, dass hieratische Schrift in einigen Fällen mit sprachlich altertümlichen Merkmalen einhergeht, wobei es sich wohl um die Reste eines Vorläufers handelt, der nicht vollständig in demotische Schrift und Sprache übertragenen wurde.
Um das Quellenmaterial adäquat zu untersuchen, ist eine genaue Analyse von Schrift, Sprache und Inhalt der Einzeltexte nötig. In einem ersten Schritt wird jeder Papyrus unabhängig von den anderen untersucht. Hierfür wird der Text in eine Excel-Tabelle aufgenommen. Jeder Eintrag wird mit verschiedenen Merkmalen versehen, die für die spätere Auswertung von Bedeutung sind. Die Texte werden in Hinblick auf die verwendete Schriftart, Sprachstufe, der zeitlichen Bezeugung eines Wortes oder grammatikalischen Konstruktion, Wortart, Herkunft (ägyptisch, griechisch, jüdisch etc.), Kontext (Vorkommen in Titeln, direkter Rede u. ä.) und, falls vorhanden, Anmerkungen des Schreibers analysiert. In einem ersten Schritt werden die Texte in ägyptologischer Umschrift in eine Exceltabelle eingetragen. Hierbei erhält jedes Wort einen Eintrag und wird mit den für die Analyse benötigten Merkmale versehen. Im Anschluss wird die Tabelle in eine mySQL Datenbank eingelesen. Diese wurde in Zusammenarbeit mit Dr. C. Riepl von der IT-Group Geisteswissenschaften der LMU München erstellt. Anhand dieser Datenbank erfolgt die Analyse der Texte.
14
Espensen, George Max. "Towards the total synthesis of anthraquinone antifungal agents Sch 47554 and Sch 47555." Thesis, Imperial College London, 2011. http://hdl.handle.net/10044/1/9197.
Full textAbstract:
The total synthesis of Sch 47554 (1) is the focus of this project, with the intention of using two aryne-furan cycloaddition reactions to efficiently build the anthraquinone core of the molecule. The first is intermolecular with furan, which is then elaborated with a C-aryl glycosidation reaction. The second is intramolecular between 5 and 6 where the two fragments are linked by a disposable tether connected through the oxygen functionalities, as demonstrated in 2. This ensures the correct angularly-fused regiochemistry of the aryne-furan cycloaddition. [Molecular structure diagrams appear here. To view, please open pdf attachment]. To this end suitable precursors have been examined. After several unsuccessful attempts at making various suitably-functionalised precursors, double aryne precursor 8 was synthesised and converted into naphthol 10. This was successfully glycosylated, but this substrate is less flexible later in the synthesis than another substrate developed, 9. This was converted into naphthol 10 and the glycosidation is currently being optimised. Elsewhere in the group furan 6 has been synthesised. These systems are appropriate for completing the synthesis of 1. [Molecular structure diagrams appear here. To view, please open pdf attachment].
15
Manzi, Eric R. "SQL-ACT : content-based and history-aware input prediction for non-trivial SQL queries." Thesis, Massachusetts Institute of Technology, 2017. http://hdl.handle.net/1721.1/119534.
Full textAbstract:
Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2017.This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Cataloged from student-submitted PDF version of thesis.
Includes bibliographical references (pages 79-81).
This thesis presents SqlAct, a SQL auto-completion system that uses content-based and history-aware input prediction to assist in the process of composing non-trivial queries. By offering the most relevant suggestions to complete the partially typed query first at the word-level and then at the statement-level, SqlAct hopes to help both novice and expert SQL developers to increase their productivity. Two approaches are explored: word-level suggestions are optimized based on the database's schema and content statistics, and statement-level suggestions that rely on Long Short-term Memory (LSTM) Recurrent Neural Networks language models trained on historical queries. The word-level model is integrated in a responsive command-line interface database client which is evaluated quantitatively and qualitatively. Results shows SqlAct provides a highly-responsive interface that makes high quality suggestions to complete the currently typed query. Possible directions for integration with the word-level model in the command-line tool are explored as well as the planned evaluation techniques.
by Eric R. Manzi.
M. Eng.
16
Shang, Xuequn. "SQL based frequent pattern mining." [S.l. : s.n.], 2005. http://deposit.ddb.de/cgi-bin/dokserv?idn=975449176.
Full text
17
Huang, Hu, and 黃鵠. "Multicarrier DS/SFH-CDMA systems." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2000. http://hub.hku.hk/bib/B31222705.
Full text
18
Grammel, Daniel. "Heterogenität humaner SHH-assoziierter Medulloblastome." Diss., Ludwig-Maximilians-Universität München, 2014. http://nbn-resolving.de/urn:nbn:de:bvb:19-169530.
Full text
19
Huang, Hu. "Multicarrier DS/SFH-CDMA systems /." Hong Kong : University of Hong Kong, 2000. http://sunzi.lib.hku.hk/hkuto/record.jsp?B22053839.
Full text
20
Briody, Brendan. "An XQuery to SQL compiler." [S.l. : s.n.], 2005. http://www.bsz-bw.de/cgi-bin/xvms.cgi?SWB11759115.
Full text
21
Oliveira, Ricardo Cezar Nery. "S-SQL : uma interface semantica." [s.n.], 1992. http://repositorio.unicamp.br/jspui/handle/REPOSIP/276198.
Full textAbstract:
Orientador: Geovane Cayres MagalhãesDissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Mate matica, Estatistica e Ciencia da Computação
Made available in DSpace on 2018-07-16T01:56:40Z (GMT). No. of bitstreams: 1 Oliveira_RicardoCezarNery_M.pdf: 2760296 bytes, checksum: a2dca23df40bf725466b0ef411c63e2a (MD5) Previous issue date: 1992
Resumo: Apesar de serem reconhecidas, as críticas aos modelos de dados clássicos, em especial ao modelo relacional, não motivaram a indústria a investir no desenvolvimento dos modelos semânticos. Os usuários, dentro deste contexto, encontram-se desamparados à espera de um sistema de gerenciamento de banco de dados (SGBD) que ofereça as diversas facilidades que, embora fartamente discutidas, ainda não se encontram comercialmente disponíveis. A dissertação que se segue propõe uma interface semântica para SGDBs relacionais que têm como base a linguagem SQL. SQL é uma linguagem de banco de dados bastante difundida, podendo ser considerada um padrão da indústria. A interface S-SQL é composta de um modelo que oferece os mecanismos de classificação, agregação, generalização, herança múltipla, classes derivadas com base em predicados e atributos, atributos multivalorados, bem como, uma linguagem de consulta associada, sintaticamente derivada da linguagem SQL.
Abstract: Despite the acknowledgement of the critics to the record-oriented models, specially to the relational model, the industry was not motivated to invest on the development of the semantic models. ln that context, users are hopelessly waiting for a DBMS that can provide the several facilities that, in spite of being largely discussed, are not commercially available yet. This dissertation presents a proposition of a semantic interface for SQL relational DBMSs. SQL is a widely spread database language that can be considered an industry standard. The S-SQL interface comprises a model that provide the mechanisms of classification, aggregation, generalization, multiple inheritance, derived class based on predicates and attributes, multivalued attributes, as well as a query language syntactically derived from SQL.
Mestrado
Mestre em Ciência da Computação
22
Anderson, Eve. "Mapping the Shh regulatory landscape." Thesis, University of Edinburgh, 2015. http://hdl.handle.net/1842/21035.
Full textAbstract:
Sonic hedgehog (Shh) is an important signalling protein expressed extensively in development, throughout tissues of the central nervous system, gut and the posterior of the limb bud. The complicated expression pattern of Shh is regulated by a series of long-range enhancers located flanking and dispersed throughout a 1 Mb genomic desert. Disruption of SHH as a result of mutations within the gene or its enhancers has been implicated in two developmental conditions. These are Holoproencephaly (HPE3) a common developmental defect of the forebrain and frequently the mid-face in humans, and preaxial polydactyly (PPD), a congenital limb abnormality encompassing a varied phenotype affecting the digits on the anterior side of the hands and feet that has been attributed to misexpression of Shh. In order to investigate the Shh regulatory landscape and survey regulatory activity, a transposon-based chromosomal engineering strategy known as the local hopping enhancer detection (LHED) system was employed. Using this method a targeting vector containing a LacZ reporter gene as well as LoxP sites was inserted within the Shh region. The ‘hopping’ nature of the transposable element was then exploited to scatter it throughout the region. Tetraploid complementation embryos derived entirely from ES cells were generated and examined in order to gain an insight into enhancer activity. The region was found to be in an open conformation over its length and is generally susceptible to all Shh enhancers. Genes within the regulatory domain, such as the widely expressed Rnf32 gene, were found to resist Shh enhancer activities by a process of regulatory evasion by the promoter, a mechanism that may be common in large regulatory domains. Finally, at the boundaries of the region Shh activity was found to be lost incrementally at a number of genomic positions. Mouse lines were also generated to look at both enhancer activity and loss of function effects and three deletions of increasing size were generated between Shh and the furthest enhancer, the Zrs. These in turn, delete firstly a gut and pharyngeal epithelial enhancer, secondly the gut, pharyngeal enhancers as well an oral epithelial enhancer and finally all three epithelial enhancers as well as three forebrain enhancers. Reporter gene expression was found to be lost incrementally from those enhancers deleted without disrupting the rest of the region. Previously unidentified notochord enhancer(s) were found to lie within the region 100-530 kb upstream of Shh. Examination of the resultant phenotypes showed that gut and craniofacial defects were found to occur as a result of the loss of enhancers which drive expression within these tissues. Variable phenotypes were found to occur potentially as a result of temporal changes to Shh expression or as a result of threshold levels of HH being required for normal development. Other enhancers within the Shh region and outwith the deletions were not found to be disrupted by these modifications suggesting the enhancers within the region act independently of each other. The largest deletion resulted in bringing the Zrs (which drives Shh limb expression) within 170 kb of the gene, however limb development; was not, found to be affected suggesting distance is not required for Zrs function. Overall, the LHED transposon system has been utilised in order to examine the Shh region in more detail, allowing mapping of enhancer function by reporter gene expression and examination of phenotypes generated by deletion of enhancers.
23
SILVA, César Leonardo Barbosa da. "Condições de contorno em SPH." Universidade Federal de Pernambuco, 2017. https://repositorio.ufpe.br/handle/123456789/23924.
Full textAbstract:
Submitted by Rafael Santana (rafael.silvasantana@ufpe.br) on 2018-03-12T18:36:01Z
No. of bitstreams: 2
license_rdf: 811 bytes, checksum: e39d27027a6cc9cb039ad269a5db8e34 (MD5)
Condições de Contorno em SPH.pdf: 3948796 bytes, checksum: 56af592704db440fbf4865e764d28120 (MD5)Made available in DSpace on 2018-03-12T18:36:01Z (GMT). No. of bitstreams: 2 license_rdf: 811 bytes, checksum: e39d27027a6cc9cb039ad269a5db8e34 (MD5) Condições de Contorno em SPH.pdf: 3948796 bytes, checksum: 56af592704db440fbf4865e764d28120 (MD5) Previous issue date: 2017-03-02
CAPES
Nesta dissertação será apresentado o método SPH - Smoothed Particle Hydrodynamics, - em português, Hidrodinâmica da Partícula Suavizada, um método sem malhas baseado em distribuições de partículas. O método foi inicialmente desenvolvido, em 1988, para simulações de sistemas astronômicos, onde as grandezas envolvidas sofrem variações bruscas e e grandes. Seus criadores desejavam um método que fosse fácil de se trabalhar e que, em contrapartida, fornecesse uma precisão coerente. O SPH é muito utilizado em aplicações em sistemas fluidos ou granulares, mas nada impede, e muito tem sido feito, de se aplicar a sistemas sólidos e de alta viscosidade. O SPH, em comparação com, por exemplo, Método do Elemento Finito, apresenta a grande vantagem de não sofrer com as grandes deformaç oes, em virtude de sua natureza particular. Neste trabalho estabeleceremos os fundamentos matemáticos que são a essência método. Serão exibidas algumas de suas aplicações e discutidas as principais condições de contorno utilizadas pelos pesquisadores da área, bem como proposta uma condição funcional que será simulada. Por fim, os resultados serão comparados com alguns outros trabalhos desenvolvidos por outros pesquisadores na área.
The SPH- Smoothed Particle Hydrodynamics-, in portuguese, Hidrodinâmica da Partícula Suavizada, will be presented. It is a meshless method based on particles distributions. The method was initially developed in 1988 for simulations of astronomical systems, where the quantities involved suffer abrupt and large variations. Its creators wanted a method that was easy to work with and, on the counterpart, would give a coherent precision. The SPH is mainly applied to fluid or granular systems but can be applied to solid or high viscous systems. The SPH method in comparison, for example, to Finite Element Method, shows a great advantage once do not have the problem when treating large deformations, in virtue of his particular nature. In this dissertation will be presented the mathematical foundations that are the essence of the method. It will be exhibited some of their applications and some of the major boundary conditions used by the researchers in the subject. It will be also proposed a functional condition to be simulated. Finely, the results will be compared to some other simulations developed by researchers in this area.
24
Calvet, Jean-Thierry. "Synchronisation des réseaux optiques SDH." Paris 6, 2003. http://www.theses.fr/2003PA066039.
Full text
25
Sunye, Marcos. "Cerqle : un SQL objet-relation." Dijon, 1993. http://www.theses.fr/1993DIJOS008.
Full textAbstract:
Cette thèse présente le langage CERQLE (complex entity relationship query language) une extension du langage SQL (structured query language) au modèle ERC+ (entite relation complexe). Avec une syntaxe la plus proche possible du SQL standard CERQLE assure la gestion des trois propriétés caractéristiques du modèle entité-relation classique (type d'entité, type de relation et attribut) ainsi que les propriétés caractéristiques du modèle ERC+ comme les objets complexes ou les liens de conjonction. Le traitement des concepts issus des modèles orienté-objets et présents dans le modèle ERC+, comme le concept de généralisation et identité d'objet sont aussi présents dans ce langage
26
Široký, Jiří. "Řízení projektů kompetenčního centra SQA." Master's thesis, Vysoká škola ekonomická v Praze, 2015. http://www.nusl.cz/ntk/nusl-203869.
Full textAbstract:
This thesis describes the design and application of the methodology for project management of the Software Quality Assurance Competence Centre. In short theoretical introduction the thesis mentions the basic concepts associated with project management, including several examples of methodologies for project management. Then the thesis introduces the concept of Competence Centers at the University of Economics, Prague and identifies the specifics of the SQA Competence Centre's projects, or the specifics of managing these projects. Theses specific serve as a basis for design of the methodology for project management of the SQA Competence Centre, which consists of seven dimensions that cover various areas of project management. A crucial part of this methodology can be considered a project lifecycle model and process model of project management of the SQA Competence Centre. The methodology is then applied to the project management of the Integrated Testing Tools. Application of the designed methodology made this project and its management more transparent and efficient. This usage of the methodology also highlighted the importance of project manager's ability to motivate project team members. The main outcome of the thesis is designed and proven methodology for project management of the SQA Competence Centre with possible application in projects other Competence Centers operating at universities.
27
Tengqvist, Edvard. "Automatiserad nätadministration med bash." Thesis, Mittuniversitetet, Institutionen för informationssystem och –teknologi, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:miun:diva-39386.
Full textAbstract:
Managing large quantities of aging nodes can be as burdensome and daunting task to an administrator. This is the reality for operation administrators and technicians working with Telias older xDSL network where linecards in nodes behaves irreguarly after a long uptime, resulting in faulty connections for the customers. One of the tasks is simply to restart these linecards when a customer or a technician files a complaint if the uptime of the linecard is an issue. This project aims to solve this issue by using scripting to take inventory of the linecards in the nodes and the corresponding uptime for these linecards. By storing this information in a database one can then query the database about wich linecards that are in need of a restart, before the customer experiences any trouble. By automating some of these manual management tasks with scripting, one can free up more time for personnel to handle other duties, as well as saving resources and cost for maintenance.Att administrera stora mängder utav åldrande noder kan vara en betungande och skrämmande uppgift. Detta är verkligheten för driftpersonalen och teknikerna som arbetar med Telias äldre xDSL-nätverk där linjekort i noder beter sig oregelbundet efter en lång upptid, något som resulterar i bristfälliga anslutningar för kunderna. En av uppgifterna är helt enkelt att starta om dessa linjekort när en kund eller tekniker lämnar in klagomål om upptiden för linjekortet är ett problem. Detta projekt har som mål att lösa denna problematik genom användandet av scripting för att inventera linjekorten och dess motsvarande upptid. Genom att lagra denna information i en databas kan en sedan fråga databasen angående vilka linjekort som är i behov av omstart, innan kunder upplever problem. Genom att automatisera vissa av dessa manuella administrativa sysslor genom script kan en frigöra tid för personalen att utföra andra sysslor samt att spara in resurser och kostnader för underhåll.
28
[記載なし]. "第5章 SSH通信 SSH通信 (第8号 9.30.2008)(Ⅷ. 資料)." 名古屋大学教育学部附属中学校 : 名古屋大学教育学部附属高等学校, 2010. http://hdl.handle.net/2237/12997.
Full text
29
Armonas, Andrius. "Konceptualiųjų apribojimų transformacija į SQL kodą." Master's thesis, Lithuanian Academic Libraries Network (LABT), 2005. http://vddb.library.lt/obj/LT-eLABa-0001:E.02~2005~D_20050524_190132-41686.
Full textAbstract:
In this paper, the method is proposed for transforming UML class diagrams with OCL constraints to relational database schemas, having advantages over “UML Profile for Databases” models. The proposed method consists of two phases supplementing each other: metamodel based transformations and pattern-based transformations. All transformations are based on OMG official standards or RFPs (Request for Proposals) and are prepared for use in MDA (Model Driven Architecture) context. This means, that resulting models, created using the described method, are long-lasting, independent from platform and abstract enough to be independent from technology.
This work covers analysis of the field of object – relational transformations, analysis of support of OCL in currently used UML tools, transformation rule sets of metamodel transformations and pattern-based transformations, a lot of examples illustrating every transformation. Metamodel transformations are designed to transform object models written in UML language to corresponding relational models: types, classes, attributes, association classes, associations to tables, columns, foreign keys and other concepts. Pattern-based transformations are designed for generating static relational concepts such as check constraints, views, stored procedures and triggers. Using the two described transformation types and the whole method described, one can generate full-fledged relational database schemas, have precise UML models and keep much more... [to full text]
30
Leščiauskas, Vytautas. "SDH tinklo resursų įvertinimas ir optimizavimas." Master's thesis, Lithuanian Academic Libraries Network (LABT), 2004. http://vddb.library.lt/obj/LT-eLABa-0001:E.02~2004~D_20040531_205209-50945.
Full textAbstract:
The software currently used by SDH net operators does not guarantee the automatic generation of routes between the selected nodes. This is the reason why the operators spend a lot of time on designing the nets manually. Despite all the time spent on designing, errors are still made which are the causes of net overload and connection disorders.
It is necessary to convert the measuring units of SDH resources from a tree type structure to real numbers, because the structure of the analyzed object’s resource units is hierarchical. After evaluation of these units the solution of this problem can be found in theory of graphs.
It is natural that given these data structures a special method is needed which would allow determining these structures and finding specific weight unit of edges of the graphs with which the problem is solved. The complexity of graph route composition algorithms is not satisfactory because the scope of real systems will be big enough. The amount of net nodes can exceed 500 and the amount of lines connecting them can be more than 5000.
It is not very difficult to implement the automatic generation of routes in principle. The knowledge of graph theory can be used to do that. But in solving real problems with the best known methods of graph theory the time of solution is not acceptable because of the big scope of the problem. It is possible to reduce the time of solution by increasing the efficiency of the system that solves the problem. The need for more... [to full text]
31
Linkevičius, Edvardas. "SDH telekomunikacijų tinklo resursų skaičiavimo sistema." Master's thesis, Lithuanian Academic Libraries Network (LABT), 2007. http://vddb.library.lt/obj/LT-eLABa-0001:E.02~2007~D_20070116_234500-14286.
Full textAbstract:
The Project “Resources evaluation system of SDH telecommunication network” is used for investigation of the efficiency of utilization of the existing TEO LT, AB SDH Trunk Network resources.
The essential problem is the lack of precise information on the free and used resources of the Network, their distribution and usage in the optimum and efficient manner. It was rather hard to establish the free and used SDH network resources and evaluate the efficiency of the Network. This brings essential influence and difficulties into the planning of network and investments since it is rather hard to take the economically viable decisions regarding the usage of the existing resources.
The SDH network resources evaluation system can be used for planning of trunk network resources and quick creation of flows’ transmission routes in a very efficient manner. The System gives the possibility to verify the new routes creation possibilities from any point of the network and execute the customers’ orders in a quick manner.
The System is developed as software with a direct interface with the TEO LT Network Information System SQL Base, and is going to use the data, stored in the SQL Base.
The Content of this project consists from:
• Analytical part of investigation
• Specification of requirements for designed system
• Common system requirements
• Data structure
• Network Resources Information Module
• Testing and User Guide
According content above the System “Resources evaluation system of SDH... [to full text]
32
Kasiulevičius, Darius. "xBase komandų pakeitimo SQL užklausomis tyrimas." Master's thesis, Lithuanian Academic Libraries Network (LABT), 2009. http://vddb.library.lt/obj/LT-eLABa-0001:E.02~2009~D_20090824_151518-39587.
Full textAbstract:
Darbe analizuojama xBase komandų transformavimo į SQL užklausas problema. Pateikiamas konceptualus transformavimo problemos sprendimas, kurį sudaro dvi dalys: transformavimo algoritmas ir transformavimo taisyklių saugykla. Pagal pasiūlytą modelį sukurta programinė įranga, kuri leidžia atlikti xBase komandų transformavimą į SQL užklausas. Taip pat sukurtoje programinėje įrangoje įdiegtas ir papildomas funkcionalumas: duomenų bazės lentelių duomenų peržiūra, koregavimas, duomenų perkėlimas iš senų *.dbf lentelių į serverinės duomenų bazės lenteles. Sukurtas sprendimas palengvina sistemos perkėlimą iš navigacinės duomenų bazių sistemos į šiuolaikines kliento serverio architektūros sistemas veikiančias serverinių dbvs pagrindu.The conversion problem of xBase commands into SQL queries is analysed in this work. Solution to conversion problem was proposed. It consists of two parts: conversion algorithm and conversion rules storage. A software for conversion of xBase commands into SQL queries was developed using the proposed model. Additional functionality was implemented in the software: viewer and editor of database tables, loader of *.dbf tables into servers database tables. A solution to facilitate migration from ISAM database to modern client-server DBMS systems was developed.
33
Escartín, Vigo José Antonio. "ISFAA : Implicit SPH for astrophysical apllications." Doctoral thesis, Universitat Politècnica de Catalunya, 2016. http://hdl.handle.net/10803/384002.
Full textAbstract:
Computational simulation is one of the basic techniques of modern Astrophysics. The long-term time astrophysical processes cannot be treated with explicit approaches because that they are limited, in their maximum time step, by the restriction known as Courant-Friedrichs-Lewy Condition.
In order to use implicit approaches a system of coupled algebraic equations needs to be solved. It is composed by all the equations of each one of the discrete points of the model and the usual solution comes through a Newton-Raphson scheme. The computational cost substantially increases with the number of unknowns of the model. In implicit schemes the properties of the current time step depends on the values of the unknown variables at that time step, so everything has to be calculated simultaneously. The consequence is that all equations should be jointly solved inverting of a huge sparse matrix (it is a squared n*v matrix, being n the number of particles and v the number of independent variables of the system). Due to this restriction, historically the implicit hydrodynamics had been only applied to one-dimensional systems.
It would be very interesting to build an Implicit hydrocode taking advantage of the so called Smoothed Particle Hydrodynamics or SPH. This technique has been being applied successfully in astrophysics and cosmology and fluid physics. SPH integrates the dynamic fluid equations in each point of the Lagragian formalism (named particles because they have an associated mass) calculating speed, position, density and pressure as interpolations from neighbour particles. Unlike Eulerian methods the Lagragian approach does not need from a rectangular grid covering the integration domain. Therefore storage and computing time is not wasted in void regions. Fluids are decomposed in a set of particles where the numerical treatment of the three-dimensional movement derived from pressure and auto-gravity is easier.
The goal of this thesis is to describe the main features and the implementation of a new SPH code which uses implicit approach, called ISFAA (Implicit SPH for Astrophysical Applications). This code enlarges the previous work from "An Implicit Smooth Particle hydrodynamic Code", Knapp C. (2000) and recent developments of the SPH scheme (based on the variation principle), artificial viscosity, gravity and thermal conductivity.
Because of the huge effort which has to be invested to build and validate the new SPH code, it is pretended that in the future its use can be extended to a large number of scenarios. With this end a modular design has been implemented that allows to separate the code general treatment, the particular implementation of the basic evolutionary equations and the physical properties (equation of state, artificial viscosity, etc.). Furthermore, to find the solution of the equations' system, the library of parallel algorithms PARDISO, embodied in the library Intel MKL, has been used. Future improvements in these libraries will have a positive impact on the new code.
To validate the code and check each one of the physical ingredients, a set of basic tests (point-like explosion, The wall heating shock, Rayleigh-Taylor instabilities, Free-Fall collapse, etc) were run and analyzed as well as several tests incorporating gravity (Toy Star, stability of a solar mass star and a White Dwarf).
And finally, we show the evolution of a single quasi-static system. To handle with these scenarios we have built a slightly different implicit scheme, were velocities are not explicitly included in the equations of movement. The main aim of this tests is to demonstrate that an implicit quasi-hydrostatic scheme is able to work with time-steps many orders of magnitude large (10^4) than the characteristic current Courant time.La simulación mediante ordenador es una de las herramientas básicas de la Astrofísica moderna. Los procesos de gran escala temporal son imposibles de tratar con enfoques explícitos ya que estos se encuentran limitados, en su paso de tiempo máximo, por la restricción conocida como condición de Courant-Friedrichs-Lewy. Para utilizar los enfoques implícitos se genera un sistema de ecuaciones algebraicas acopladas, habitualmente resuelto con un esquema de Newton-Raphson y compuesto por todas las ecuaciones de cada uno de los puntos de resolución del modelo. El coste computacional de resolución aumenta sustancialmente con el número de incógnitas que han de determinarse a cada paso de tiempo. Las propiedades del siguiente paso de tiempo dependen de los valores de las variables desconocidas en dicho paso de tiempo y por tanto todas han de ser calculadas simultáneamente. La consecuencia es que todo el sistema de ecuaciones se ha de resolver conjuntamente realizando la inversión de una matriz dispersa enorme (la matriz es cuadrada y tiene un tamaño de n*v, siendo n el numero de partículas y v el número de variables independientes del sistema). Debido a esta restricción, la hidrodinámica implícita históricamente ha sido aplicada a sistemas en una sola dimensión. Para su implementación multidimensional sería interesante utilizar un enfoque lagrangiano como el suavizado de partículas hidrodinámicas denominado "Smooth Particle Hydrodynamics" ó SPH. La técnica se viene aplicando con éxito al campo de la astrofísica, la cosmología y diferentes problemas de la física de fluidos. El SPH integra las ecuaciones de la dinámica de fluidos en cada punto del formalismo lagrangiano (denominado partícula por tener una masa asociada) calculando velocidad, posición, densidad y presión como una interpolación de los valores de las partículas vecinas. Los métodos lagrangianos, a diferencia de los eulerianos, no necesitan de una malla regular que cubra la totalidad del espacio de integración, por tanto, la memoria y el tiempo de cálculo no se desperdician en la resolución de espacios vacíos. Los fluidos se descomponen en un conjunto de partículas donde podemos tratar numéricamente de forma más sencilla el movimiento en tres dimensiones derivado de las fuerzas de presión y auto-gravedad. El objetivo de esta tesis es detallar las principales características y la implementación de un nuevo código SPH, con un enfoque implícito, al que hemos denominado ISFAA (Implicit SPH for Astrophysical Applications). Este código amplia el trabajo previo de Knapp. C., 2000 e incluye el esquema físico más actual del SPH (basado en el principio variacional), viscosidad artificial, gravedad y conductividad térmica. Dado el enorme esfuerzo que supone construir y validar un nuevo código SPH, se pretende que en el futuro su utilidad se extienda al mayor número posible de escenarios. Con este fin se ha optado por un diseño modular que separe el tratamiento general del código de la implementación concreta de ecuaciones evolutivas básicas y de las propiedades del material (ecuación de estado, viscosidad artificial, etc.). Además, para la resolución del sistema de ecuaciones se utiliza la biblioteca de algoritmos paralelos PARDISO, que incorpora la librería Intel MKL y que en el futuro tendrá mejoras que impactarán positivamente en el código. Para comprobar la corrección del código y probar cada uno de los ingredientes físicos, se especifican una serie de test básicos (Explosión puntual, The wall heating shock, inestabilidades de Rayleigh-Taylor, caída libre, etc.) y una serie de test con gravedad (Toy Star, estabilización de una estrella de masa solar y una enana blanca). Por último se muestra la evolución de un sistema cuasiestático, en el que las velocidades no se encuentran explícitamente en el modelo. Este test está orientado a demostrar que el código implícito podría aplicarse con éxito en estas situaciones, consiguiendo simular el sistema en largos intervalos temporales.
34
Schindler, Benjamin. "Visualization of vortices in SPH data." Zurich : ETH, Eidgenössische Technische Hochschule Zürich, Department of Computer Science, Computer Graphics Laboratory, 2009. http://e-collection.ethbib.ethz.ch/show?type=dipl&nr=460.
Full text
35
Поляков, С. А. "Композиційна семантика ядра SQL-подібних мов." Diss. of Candidate of Physical and Mathematical Sciences, КНУТШ, 2011.
Find full text
36
Bilgin, Ahmet Soydan. "Deriving Efficient SQL Sequences Via Prefetching." NCSU, 2008. http://www.lib.ncsu.edu/theses/available/etd-01032008-141946/.
Full textAbstract:
Modern information architectures place business logic in an application server and persistent objects in a relational DBMS. To effectively realize such architectures, we must surmount the problem of effectively fetching objects from DBMS to the application server. Object access patterns are not random; they are driven by applications and user behaviors. Naive implementations retrieve objects from the DBMS as such objects are requested by the application, costing a DBMS roundtrip for each query. This fact, coupled with the growing performance bottleneck of computer storage systems, has resulted in a significant amount of research improving object access behavior through predicting future access objects because throughput will continue to improve but latency will not. Latency will be an ever-increasing component of object access cost. In turn, object access cost is usually the bottleneck for modern high performance systems. This yields unacceptably poor performance when application server submit sequence of relational queries to DBMSs. A reasonable approach would be to generate prefetch queries that retrieve objects that would later be requested by the application. However, whereas some prefetch queries would be beneficial, some would not. Distinguishing between them is nontrivial in practice, because commercial DBMSs do not expose efficient query response-time estimators. First, there is no standardized interface for an application server to force the database system to calculate the costs (e.g., response time) for a given query. Second, we still have the entire roundtrip costs between application servers and the DBMSs to estimate the total cost of query evaluation. Consequently, in current practice, programmers spend enormous amounts of time tuning the queries by which objects are retrieved by an application. This dissertation develops an application-independent approach for generating prefetch queries that can be implemented in conventional middleware systems. The main contribution of this dissertation is a set of application-independent guidelines for selecting, based on application's access patterns and additional parameters, efficient ways of merging the application's data requests into prefetch queries. Our guidelines take the current configuration such as local or wide area networks into account, allowing it to select strategies that give good performance in a wider range of configurations. The ensuing performance gains are evaluated via realistic settings based on a retail database inspired by the SPECJ performance test suite.
37
Ruzgys, Mindaugas. "SQL užklausų rašymo gebėjimų vertinimo sistema." Bachelor's thesis, Lithuanian Academic Libraries Network (LABT), 2014. http://vddb.library.lt/obj/LT-eLABa-0001:E.02~2014~D_20140716_111653-31782.
Full textAbstract:
Faktiškai kiekviena šiuolaikinė IS naudoja duomenų bazes, kad saugoti informaciją. Šiuo metu populiariausios reliacinės duomenų bazių valdymo sistemos, kur užklausos rašomos SQL kalba. Todėl kiekvienas programuotojas privalo gebėti rašyti SQL užklausas Rinkoje labai mažai sistemų, skirtų MySQL žinių testavimui, kurios atitinka visus keliamus reikalavimus ir yra nemokamos.Most of bigger web solutions use databases for data storage.This is why all programmers must be familiar with SQL and its usage in relational databases. However the evaluation of SQL knowledge can be difficult in study process as the same result can be achieved by writing different SQL queries. This is why the evaluation of students’ answers can be time consuming in non automated systems and incorrect in match finding automated systems. This prototype was validated by using it in Database study course and compared with more traditional ways to evaluate students’ MySQL knowledge.
38
Barclay, Alexander. "SQP methods for large-scale optimization /." Diss., Connect to a 24 p. preview or request complete full text in PDF format. Access restricted to UC campuses, 1999. http://wwwlib.umi.com/cr/ucsd/fullcit?p9936873.
Full text
39
Chow, Alex. "Incompressible SPH (ISPH) on the GPU." Thesis, University of Manchester, 2018. https://www.research.manchester.ac.uk/portal/en/theses/incompressible-sph-isph-on-the-gpu(b569f890-78f1-42c2-b9d4-7082b45f45c8).html.
Full textAbstract:
Incompressible free-surface flows involving highly complex and violent phenomena are of great importance to the engineering industry. Applications such as breaking-wave impacts, fluid-structure interaction, and sloshing tanks demand an accurate and noise-free pressure field, and require large-scale simulations involving millions of computation points. This thesis addresses the need with the novel use of a graphics processing unit (GPU) to accelerate the incompressible smoothed particle hydrodynamics (ISPH) method for highly non-linear and violent free-surface flows using millions of particles in three dimensions. Compared to other simulation techniques, ISPH is robust in predicting a highly accurate pressure field, through the solution of a pressure Poisson equation (PPE), whilst capturing the complex behaviour of violent free-surface flows. However, for large-scale engineering applications the solution of extremely large PPE matrix systems on a GPU presents multiple challenges: constructing a PPE matrix every time step on the GPU for moving particles, overcoming the GPU memory limitations, establishing a robust and accurate ISPH solid boundary condition suitable for parallel processing on the GPU, and exploiting fast linear algebra GPU libraries. A new GPU-accelerated ISPH algorithm is presented by converting the highly optimised weakly-compressible SPH (WCSPH) code DualSPHysics and combining it with the open-source ViennaCL linear algebra library for fast solutions of the ISPH PPE. The challenges are addressed with new methodologies: a parallel GPU algorithm for population of the PPE matrix, mixed precision storage and computation, and extension of an existing WCSPH boundary treatment for ISPH. Taking advantage of a GPU-based algebraic multigrid preconditioner for solving the PPE matrix required modification for ISPH's Lagrangian particle system. The new GPU-accelerated ISPH solver, Incompressible-DualSPHysics, is validated through a variety of demanding test cases and shown to achieve speed ups of up to 25.3 times and 8.1 times compared to single and 16-threaded CPU computations respectively. The influence of free-surface fragmentation on the PPE matrix solution time with different preconditioners is also investigated. A profiling study shows the new code to concentrate the GPU's processing power on solving the PPE. Finally, a real-engineering 3-D application of breaking focused-wave impacting a surface-piercing cylindrical column is simulated with ISPH for the first time. Extensions to the numerical model are presented to enhance the accuracy of simulating wave-structure impact. Simulations involving over 5 million particles show agreement with experimental data. The runtimes are similar to volume-of-fluid and particle-in-cell solvers running on 8 and 80 processors respectively. The 3-D model enables post-processing analysis of the wave mechanics around the cylinder. This study provides a substantial step for ISPH. Incompressible-DualSPHysics achieves resolutions previously too impractical for a single device allowing for the simulation of many industrial free-surface hydrodynamic applications.
40
LINO, Adriano Del Pino. "LABSQL: laboratório de ensino de SQL." Universidade Federal do Pará, 2007. http://www.repositorio.ufpa.br:8080/jspui/handle/2011/1744.
Full textAbstract:
Made available in DSpace on 2011-03-23T21:19:22Z (GMT). No. of bitstreams: 0Item created via OAI harvest from source: http://www.bdtd.ufpa.br/tde_oai/oai2.php on 2011-03-23T21:19:22Z (GMT). Item's OAI Record identifier: oai:bdtd.ufpa.br:152
This work presents a new approach for automatic evaluation of SQL queries. This approach proposes a solution for a challenge to stimulate the student to improve his/her solution: searching, besides an answer that returns a correct result, a query with a complexity next to the optimum solution. This proposal can be used in e-learning environments or in presential education in laboratory activities, including the evaluations. The proposed solution has as advantages: (1) the student receives an instantaneous feedback during a practice programming activity, which allows the student to refactorize his/her solution in direction to a optimum solution; (2) complete integration between the programming concepts teaching with examples of fragments of on-line executable programs; (3) monitoring of students activities (how many examples were executed; in each exercise how many execution attempts were done, etc). This work is the first pass in direction to the construction of an environment, totally attended (for example with automatic evaluation) for teaching of SQL programming language, where the instructor is free of the hard work to correct SQL commands, being able to do more relevant pedagogic tasks. The method, based on statistics and Software Engineering metrics, can be adapted for other languages, such as Java and Pascal. In addition, the LabSQL serves as a laboratory for experimentation of two news techniques, one of evaluation and other of accompaniments that are being searched in several works at the same time: (a) automatic evaluation of discursive conceptual questions, besides to allow the traditional objective questions, (b) method of accompaniment through a montage of evaluation rubrics.
Este trabalho apresenta uma nova abordagem para avaliação automática de consultas SQL. Essa abordagem propõe uma solução para o desafio de estimular o aprendiz a aperfeiçoar a sua solução: buscando, além de uma resposta que retorna o resultado correto, uma consulta com complexidade próxima da solução ótima. Essa proposta pode ser utilizada em ambientes de educação a distancia ou na educação presencial em atividades de laboratório, incluindo as avaliações. A solução proposta tem como vantagens: (1) o aprendiz recebe um feedback instantâneo durante a atividade prática de programação, o qual permite ao aprendiz refatorar a sua solução em direção a uma solução ótima; (2) completa integração entre o ensino de conceitos de programação com exemplo de fragmentos de programas executáveis on-line; (3) monitoramento das atividades do aprendiz (quantos exemplos foram executados; em cada exercício quantas tentativas de execução foram feitas, etc). Este trabalho é um primeiro passo na direção de construção de um ambiente totalmente assistido (por exemplo com avaliação automática) para ensino da linguagem de programação SQL, onde o professor é liberado do árduo trabalho de correção de comandos SQL podendo realizar tarefas pedagógicas mais relevantes. O método, fundamentado em estatística e métricas da Engenharia de Software, pode ser adaptado para outras linguagens tais como Java e Pascal. Além disso, o LabSQL serve com um laboratório para experimentação de duas novas técnicas, uma de avaliação e outra de acompanhamento, que estão sendo pesquisadas em trabalhos em paralelos: (a) avaliação automática de questões conceituais discursivas, além de permitir as tradicionais perguntas objetivas, (b) método de acompanhamento através de montagem de uma rubrica de avaliação.
41
Venkatamuniyappa, Vijay Kumar. "Towards automatic grading of SQL queries." Kansas State University, 2018. http://hdl.handle.net/2097/38819.
Full textAbstract:
Master of ScienceDepartment of Computer Science
Doina Caragea
An Introduction to Databases course involves learning the concepts of data storage, manipulation, and retrieval. Relational databases provide an ideal learning path for understanding database concepts. The Structured Query Language (SQL) is a standard language for interacting with relational database. Each database vendor implements a variation of the SQL standard. Furthermore, a particular question that asks for some data can be written in many ways, using somewhat similar or structurally different SQL queries. Evaluation of SQL queries for correctness involves the verification of the SQL syntax and semantics, as well as verification of the output of queries and the usage of correct clauses. An evaluation tool should be independent of the specific database queried, and of the nature of the queries, and should allow multiple ways of providing input and retrieving the output. In this report, we have developed an evaluation tool for SQL queries, which checks for correctness of MySQL and PostgreSQL queries with the help of a parser that can identify SQL clauses. The tool developed will act as a portal for students to test and improve their queries, and finally to submit the queries for grading. The tool minimizes the manual effort required while grading, by taking advantage of the SQL parser to check queries for correctness, provide feedback, and allow submission.
42
Yáñez, Sáez Osvaldo Alfonso. "Gestión de Conocimiento en SQM Salar." Tesis, Universidad de Chile, 2006. http://repositorio.uchile.cl/handle/2250/102834.
Full textAbstract:
Magíster en Gestión y Dirección de EmpresasEl objetivo principal de este estudio es presentar un caso práctico de aplicación de gestión del conocimiento en los procesos productivos de SQM Salar. Con esto se pretende potenciar las debilidades más importantes identificadas y que se mencionan a continuación: procesos no optimizados, existencia de un área débil de investigación en apoyo al mejoramiento continuo, imposibilidad de benchmark y base de datos de difícil acceso y no validada. Entendiendo que el conocimiento es el único activo que se incrementa con su uso, obtener un modelo en base a la gestión de este activo, es de vital importancia, mientras se traduzca en uno o combinación de los siguientes puntos: aumento de productividad, aumento de calidad y disminución de costos. En una primera etapa se procede a realizar una descripción de la compañía, en donde se identifican los productos, principales competidores, estructura de propiedad, procesos, etc. Luego se define la problemática en cuestión y la definición del área de investigación aplicada responsable de la generación y recopilación del conocimiento, esto involucra la redacción de misión, visión y objetivos estratégicos. En tercer término se presenta una revisión detallada de todos los conceptos involucrados en la gestión del conocimiento. Finalmente se describe las fases de implementación de esta nueva área, junto con el ordenamiento de información, se define planes de cómo recopilar la información para finalizar en su consolidación a conocimiento y se presentan indicadores de desempeño del área de investigación. Los resultados más importantes, obtenidos a la fecha, son la obtención de dividendos por más de 7 millones de dólares con un presupuesto de 0,66 millones de dólares. La apuesta futura del área esta orientada a la optimización de las etapas unitarias molienda, clasificación y flotación, en la planta de cloruro de potasio en las cuales se espera un aumento de rendimiento de 3 % de potasio y que significaría un aumento de producción de esta planta en alrededor de 15.000 Ton/año lo que en ingresos por venta significaría 2,85 millones de dólares (precio considerado 190 US$ Ton). Después de ver estos resultados constatamos la importancia y la potencialidad que tiene el fortalecimiento de iniciativas de este tipo, que a lo menos hace auspicioso el futuro de el Área de Investigación Aplicada.
43
Pinto, Mauro Teixeira. "O SFH e o equilíbrio contratual." reponame:Repositório Institucional do FGV, 1996. http://hdl.handle.net/10438/5436.
Full textAbstract:
Made available in DSpace on 2010-04-20T20:18:32Z (GMT). No. of bitstreams: 0
Previous issue date: 1996-03-22T00:00:00ZNo presente trabalho iremos nos preocupar com as circunstâncias sob as quais os parâmetros de eficiência não predominaram no modelo habitacional do país durante o período em que este conviveu com um sistema habitacional formalmente estruturado, que se inicia em 1964 e permanece até o presente momento, dedicando especial atenção aos parâmetros de funcionamento atuais. Buscaremos analisar formalmente as causas das distorções, suas consequências em termos qualitativos e quantitativos e eventuais propostas de superação das dificuldades.
44
Marouki, Fadi. "AUTOMATED SQL QUERY GENERATION - RDBMS Testing." Thesis, Umeå universitet, Institutionen för datavetenskap, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-163180.
Full textAbstract:
Manually writing SQL queries for Relational Database Management Systems (RDBMS) testing can be very tedious depending on the database complexity. The focus of this thesis is to develop three approaches to automatically generate SQL queries based on a given database instance. These queries can then be used to evaluate the configuration of a RDBMS. The generated queries are only partial components in RDBMS testing. However, they do reduce the amount of work required to perform such configuration assessment. The three presented approaches generate well-formed and semantically meaningful queries (i.e. queries with no logical contradictions). The first approach only consists of a context-free grammar (CFG). The second uses a CFG with an exclusion list. The third uses a CFG with a binary classification machine learning model. The results show that the binary classification algorithm approach outperforms the other two in terms of generating a higher proportion of semantically meaningful queries.
45
Pyszko, Pavel. "Technologie vysoké dostupnosti MS SQL Serveru." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2015. http://www.nusl.cz/ntk/nusl-220540.
Full textAbstract:
The thesis contains a complete theoretical overview of high availability technologies in Microsoft SQL Server. For each technology, guidance is provided for the deployment of technologies. Technologies are analyzed from a security perspective, they are determined advantages and disadvantages of using technology in practice and is determined the optimal variant of use of the technology. High availability technology are compared with each other and is given the availability of individual technologies in versions of MS SQL Server. The thesis contains three scenarios with practical examples of using technology for high availability in practice. It provides an analysis of high-availability features in Oracle and are subsequently compared high availability features in Oracle environments with high availability technology in MS SQL Server.
46
Penzhorn, Karl. "Consistency and convergence of SPH approximations." Master's thesis, University of Cape Town, 2009. http://hdl.handle.net/11427/12365.
Full textAbstract:
Includes bibliographical references (leaves 58-59).Includes abstract.
This thesis is about a new approach to SPH. Instead of using a single kernel or shape function for approximation of a function and its derivatives, individual shape functions are used for each derivative. The investigation is carried out in one space dimension. After producing the conditions for consistency and convergence for the zeroth, first and second derivatives, a new set of linear or piecewise-linear shape functions which meet the minimum of these requirements are presented for each.
47
Hendrich, Michal. "Řízení projektů v kompetenčním centru SQA." Master's thesis, Vysoká škola ekonomická v Praze, 2013. http://www.nusl.cz/ntk/nusl-192562.
Full textAbstract:
This thesis deals with project management competence center in Software Quality Assurance, which operates the University of Economics in Prague. The first part of this thesis is focused on basic terminology management projects and projects aimed at testing. The second part focuses on project management competence center in Software Quality Assurance, which describes a modified project life cycle according to the PMBOK and project life cycle testing. All phases of the lifecycle contain sub-activities and the person responsible for the activity. The last part of this thesis is focused on management competency center Software Quality Assurance tool available for cooperation IBM Connections, which is available for students and staff of the University of Economics in Prague. The thesis is a complex material intended primarily for manager competency center, its teams and includes guides on how to manage the very center and its projects.
48
Vogel, Harald. "Enhetstestning inom PL/SQL - en fallstudie." Thesis, Linköpings universitet, Programvara och system, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-138553.
Full textAbstract:
Att ha ett väl fungerande automatiskt testsystem är allt viktigare inom mjukvaruutveckling. Tyvärr är det fortfarande vanligt med företag som framförallt förlitar sig på manuell testning i olika former vilket för med sig en rad problem. Extra svårt blir det för de ovanligare programmeringsspråken, som inte har samma historia av automatisk testning som andra språk. Genom att implementera enhetstestning på liten skala på ett riktigt system i PL/SQL och mäta resultaten, kan flera slutsatser dras om enhetstestnings duglighet. Enhetstestning tar betydligt kortare tid att exekvera än motsvarande tester manuellt och kan lätt återupprepas. De kan även testa kombinationer som är omöjliga eller mycket svåra att utföra manuellt, och de minskar tiden det tar att rätta buggar. Att skriva enhetstester tar initialt mycket tid och kräver en viss kunskap. Det kan även dröja innan enhetstester börjar ge resultat och de behöver underhållas allt eftersom att koden ändras.
49
Badiozamany, Sobhan. "Microsoft SQL Server OLAP Solution - A Survey." Thesis, Uppsala University, Department of Information Technology, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-130636.
Full textAbstract:
Microsoft SQL Server 2008 offers technologies for performing On-Line Analytical Processing (OLAP), directly on data stored in data warehouses, instead of moving the data into some offline OLAP tool. This brings certain benefits, such as elimination of data copying and better integration with the DBMS compared with off-line OLAP tools. This report reviews SQL Server support for OLAP, solution architectures, tools and components involved. Standard storage options are discussed but the focus of this report is relational storage of OLAP data. Scalability test is conducted to measure performance of Relational OLAP (ROLAP) storage option. The scalability test shows that when ROLAP storage mode is used, query response time grows linearly with dataset size. A tutorial is appended to demonstrate how to perform OLAP tasks using SQL Server in practice.
50
Veøy, Kristian. "Introducing SimiLite : Enabling Similarity Retrieval in SQL." Thesis, Norges teknisk-naturvitenskapelige universitet, Institutt for datateknikk og informasjonsvitenskap, 2011. http://urn.kb.se/resolve?urn=urn:nbn:no:ntnu:diva-14470.
Full textAbstract:
This project has implemented SimiLite, a plug-in to SQLite which en-ables the usage of metric indices in SQL tables. SimiLite can easily beextended with different indices, and the indices LAESA and SSSTreehas been implemented and verified.This project has also implemented a framework for easy comparisonof the indices within SimiLite.It was found that while SimiLite causes a slow-down of about 5-10compared to the reference solution for a light metric, this will balanceout quickly once the cost of the metric increases.