• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 1079
  • 501
  • 14
  • 3
  • 2
  • 2
  • Tagged with
  • 1601
  • 799
  • 691
  • 494
  • 413
  • 343
  • 276
  • 210
  • 192
  • 179
  • 149
  • 138
  • 121
  • 111
  • 109
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

A informatica no ensino superior: o caso da Universidade Federal de Santa Catarina /

Schenini, Elisabeth January 1991 (has links)
Dissertação (mestrado) Universidade Federal de Santa Catarina, Centro Socio-Economico. / Made available in DSpace on 2012-10-16T04:00:55Z (GMT). No. of bitstreams: 0Bitstream added on 2016-01-08T17:20:50Z : No. of bitstreams: 1 82251.pdf: 7190209 bytes, checksum: 6ac59e07d49f90aad69b69db3a0776c4 (MD5) / A pesquisa analisou os recursos de informática disponíveis na UFSC e suas demanda para o desenvolvimento de atividades-fim e meio. Tratou-se de um estudo de caso de natureza descritiva e exploratória, não experimental, cujos dados foram coletados através de questionários e entrevistas, no período 1988-89. A análise dos dados foi feita através da utilização de técnicas de estatística descritiva e exploratória. Constatou-se que a implantação da informática na UFSC foi fortemente impulsionada pelo Programa Nova Universidade e seu desenvolvimento deveu-se, principalmente, a projetos de pesquisa e convênios, cujos recursos permitiram a aquisição de expressiva parcela dos equipamentos disponíveis. O percentual de usuários técnico-administrativos foi de 13,2% e o de usuários capacitados 69,7%. Verificou-se uma demanda predominantemente para fins acadêmicos, tanto em se tratando dos recursos do Núcleo de Processamento de Dados (91,2%), como dos microcomputadores disponíveis (93,2%). A pesquisa evidenciou que 67,5% dos micros tiveram ocupação superior a 6 horas/dia embora a demanda na maioria dos departamentos fosse igual ou inferior a 6 horas/dia. Dos 46 departamentos analisados 6 possuíam 69,9% do total de equipamentos. A análise de regressão mostrou que apenas as variáveis "nº de equipamentos" e "área do conhecimento" apresentaram evidência de associação com o nº de horas de utilização por micro.
2

Elaboração de uma técnica de verificação de usabilidade para sites de comércio eletrônico

Andres, Daniele Pinto January 2001 (has links)
Dissertação (mestrado) - Universidade Federal de Santa Catarina, Centro Tecnológico / Made available in DSpace on 2012-10-19T13:25:20Z (GMT). No. of bitstreams: 0Bitstream added on 2014-09-25T23:21:22Z : No. of bitstreams: 1 178174.pdf: 2677694 bytes, checksum: ddb87b3d0d8d862e9c1244691266f41b (MD5) / Este trabalho aborda o desenvolvimento de uma técnica de avaliação baseada em conhecimentos ergonômicos explícitos e na participação de usuários e projetistas em atividades de inspeção avaliativas rápidas e baratas, de modo a identificar os problemas ergonômicos mais flagrantes em sites/web para comércio eletrônico. São descritas as atividades envolvidas para a concepção da técnica, que é apresentada com detalhes sobre sua natureza, seus processos e os documentos que a implementam. A técnica representa um instrumento para identificar rapidamente, com a ajuda de usuários e projetistas, os erros ergonômicos geralmente encontrados e repetitivos, presentes nas principais tarefas dos usuários. Essa técnica pode ser vista igualmente como instrumento para tornar a preocupação ergonômica algo habitual entre os projetistas. Além disso, foi projetado um estudo piloto a fim de verificar os resultados obtidos e confrontar com as metas estabelecidas no início do estudo
3

On quantum computation theory

Dam, Willem Klaas van. January 1900 (has links)
Proefschrift Universiteit van Amsterdam. / Auteursnaam op omslag: Wim van Dam. Met lit. opg. - Met samenvatting in het Nederlands.
4

Le système SIGMA logement : une contribution à la conception architecturale assistée par ordinateur /

Zanelli, Frédéric. Huber, Jean-Werner. January 1979 (has links)
Th. Sc. techn. Lausanne EPFL, 1979.
5

Desenvolvendo workflow com agentes móveis

Ferrari, Marcelo José January 2001 (has links)
Dissertação (mestrado) - Universidade Federal de Santa Catarina, Centro Tecnológico.Programa de Pós-Graduação em Ciência da Computação / Made available in DSpace on 2012-10-18T10:06:02Z (GMT). No. of bitstreams: 0Bitstream added on 2014-09-25T22:04:48Z : No. of bitstreams: 1 181345.pdf: 2681776 bytes, checksum: f44f8babe2c2d25797b812d5882aed9a (MD5) / Workflow tem como um dos principais objetivos, minimizar o problema da coordenação do trabalho nos processos de negócios. O principal problema das atividades baseadas em processos é que não se tem controle total das atividades que devem ser executadas. Além disso, não se têm uma visão de quais informações estão sendo manipuladas por essas atividades em um dado instante e nem que as manipula. As técnicas de modelagem de Workflow devem ter como objetivo básico minimizar estes problemas. O objetivo básico deste trabalho consiste no desenvolvimento de um protótipo de um Workflow, utilizando agentes móveis para validar o modelo que será proposto construindo um protótipo de um Workflow que valide na prática os conceitos de agentes móveis e Workflow.
6

Qualidade de serviço em redes IP com DiffServ

Melo, Edison Tadeu Lopes January 2001 (has links)
Dissertação (mestrado) - Universidade Federal de Santa Catarina, Centro Tecnológico. Programa de Pós -Graduação em Computação. / Made available in DSpace on 2012-10-18T12:14:03Z (GMT). No. of bitstreams: 0Bitstream added on 2014-09-25T20:45:14Z : No. of bitstreams: 1 181885.pdf: 4358125 bytes, checksum: 334f18a7e45a5a71bb7369373b860ea5 (MD5) / Esse trabalho apresenta uma avaliação sobre a implementação de Qualidade de Serviço (QoS) em redes IP através de medições. Foram testados os padrões DiffServ em diferentes plataformas. A avaliação constituiu-se de duas fases: Na primeira fase, realizou-se uma análise global sobre o ambiente DiffServ e verificou-se a capacidade de isolamento de tráfego e garantia de largura de banda por classe de serviços. Ainda nessa etapa realizou-se monitoração nos nós DiffServ para verificar o comportamento dos mecanismos de classificação e descarte de pacotes. Na segunda fase, a medição de QoS foi empregada para estudar o impacto do tráfego melhor esforço, TCP e UDP, com diferentes tamanhos de pacotes, sobre o desempenho da classe de serviços de tráfego expresso (EF).
7

Many-core Algorithms for Combinatorial Optimization

Strappaveccia, Francesco <1982> 04 June 2015 (has links)
Combinatorial Optimization is becoming ever more crucial, in these days. From natural sciences to economics, passing through urban centers administration and personnel management, methodologies and algorithms with a strong theoretical background and a consolidated real-word effectiveness is more and more requested, in order to find, quickly, good solutions to complex strategical problems. Resource optimization is, nowadays, a fundamental ground for building the basements of successful projects. From the theoretical point of view, Combinatorial Optimization rests on stable and strong foundations, that allow researchers to face ever more challenging problems. However, from the application point of view, it seems that the rate of theoretical developments cannot cope with that enjoyed by modern hardware technologies, especially with reference to the one of processors industry. In this work we propose new parallel algorithms, designed for exploiting the new parallel architectures available on the market. We found that, exposing the inherent parallelism of some resolution techniques (like Dynamic Programming), the computational benefits are remarkable, lowering the execution times by more than an order of magnitude, and allowing to address instances with dimensions not possible before. We approached four Combinatorial Optimization’s notable problems: Packing Problem, Vehicle Routing Problem, Single Source Shortest Path Problem and a Network Design problem. For each of these problems we propose a collection of effective parallel solution algorithms, either for solving the full problem (Guillotine Cuts and SSSPP) or for enhancing a fundamental part of the solution method (VRP and ND). We endorse our claim by presenting computational results for all problems, either on standard benchmarks from the literature or, when possible, on data from real-world applications, where speed-ups of one order of magnitude are usually attained, not uncommonly scaling up to 40 X factors.
8

CAD Aspects on Isogeometric Analysis and Hybrid Domains

Martini, Giulia <1987> 13 May 2016 (has links)
This thesis is the result of a Ph.D. program in Alto Apprendistato carried out at the Dipartimento di Informatica - Scienza e Ingegneria (DISI) of the University of Bologna and at the company devDept Software. With regard to the professional side of my Individual Training Project, I developed technical and scientific skills in 3D geometry of curves and surfaces, CAD, and Finite Element Analysis (FEA). Regarding the academic side, I investigated CAD aspects in the field of Isogeometric Analysis (IGA) on both single and hybrid multipatch physical domains. Simulations are performed in classical FEA systems, which require the conversion of designs, made by CAD systems, into finite element meshes. IGA is a new approach that aims to unify the worlds of CAD and FEA by using the same geometry for analysis as what is used for modeling. That is, the same set of basis functions are adopted both to describe the computational geometry in the CAD tool, and to span the solution space for FEA. The traditional FEA pipeline works on meshes and the most advanced IGA systems work on NURBS or T-spline geometries. Hybrid geometric models (i.e., models in which mesh and NURBS entities coexist), are an emergent way to represent a solid object, but in most CAD systems mesh and NURBS geometries cannot interact with each other, and conversions to a common representation are often needed. In this thesis, we investigate how IGA can be applied on 2D and 3D hybrid models made by both mesh and NURBS entities without requiring laborious and time consuming conversion processes.
9

Model-Based Heuristics for Combinatorial Optimization

Rocchi, Elena <1986> 13 May 2016 (has links)
Many problems arising in several and different areas of human knowledge share the characteristic of being intractable in real cases. The relevance of the solution of these problems, linked to their domain of action, has given birth to many frameworks of algorithms for solving them. Traditional solution paradigms are represented by exact and heuristic algorithms. In order to overcome limitations of both approaches and obtain better performances, tailored combinations of exact and heuristic methods have been studied, giving birth to a new paradigm for solving hard combinatorial optimization problems, constituted by model-based metaheuristics. In the present thesis, we deepen the issue of model-based metaheuristics, and present some methods, belonging to this class, applied to the solution of combinatorial optimization problems.
10

Coinductive Techniques on a Linear Quantum λ-Calculus

Rioli, Alessandro <1967> 13 May 2016 (has links)
In this thesis, it is examined the issue of equivalence between linear terms in higher order languages, that is, in languages which allow to use functions as variables, and where variables which appear in the terms must be used exactly once. The work is developed focusing on the bisimulation method, with the purpose to compare this technique with that which has become the standard for the comparison between the terms of a language, i.e. the context equivalence. The thesis is divided into three parts: in the first one, the introduction of the bisimulation and context equivalence techniques takes place within a deterministic linear and typed language. In the second part, the same techniques are reformulated for a language that, while preserving the linearity, loses the deterministic connotation, allowing the terms to evaluate to a set of values each one having a certain probability to appear in the end of calculation. In the last part, a quantum language is examined, discussing the advantages of quantum computation, which allows to speed-up many of the algorithms of computation. Here one gives the concept of quantum program, which is inextricably linked to the (quantum) register where the qubits used in the computation are stored, entailing a more complex notion of equivalence between terms. The techniques to demonstrate that bisimulation is a congruence are not standard and have been used for the first time by Howe for untyped languages: within the thesis, one shows that bisimulation is a congruence in all considered languages but it coincides with the context equivalence relation only for the deterministic one. Indeed, extending the techniques already used by Howe to the probabilistic and quantum environment, it is shown, as non trivial result, that in probabilistic and quantum linear languages the bisimulation is contained in context equivalence relation.

Page generated in 0.3763 seconds