Pair Programming
Mostrando 1-12 de 14 artigos, teses e dissertações.
-
1. Método trifásico de ensino-aprendizagem baseado na taxionomia de objetivos educacionais de Bloom: uma aplicação no ensino de programação de computadores
O ensino-aprendizagem de programação de computadores tem sido alvo de investigações cientificas desde os primórdios da computação. Embora diversas estratégias foram e ainda têm sido experimentadas, sua aplicação em cursos de computação e afins se mostra difícil, uma vez que exige algum empenho de educadores em buscá-las, estudá-las e avaliá-
Publicado em: 2010
-
2. inexact graph correspondence / Correspondência inexata entre grafos.
Let GI = (VI ,AI) and GM = (VM,AM) be two simple graphs. A mapping from GI to GM is an association set, such that each vertex in VI is associated to a vertex in VM, and each edge in AI is associated to a pair of vertices of VM. A cost is defined to each possible association. The inexact graph correspondence problem (IGCP) consists in finding a mapping from G
Publicado em: 2008
-
3. AST Um modelo para automaÃÃo de horÃrios escolares
The work here presented is about a model for automation of school timetable. It is tailored to deal with most of the restrictions found in the Brazilian schools. It also studies the relation between the constraints of the problem and its theoretical complexity. The school timetable problem is NP-complete even in the simplest cases, where the constraints are
Publicado em: 2008
-
4. Simulation software development for multibody systems / Desenvolvimento de uma ferramenta computacional para simulação de sistemas mecânicos multicorpos
The mathematical simulation is a very important tool to reduce production costs in new projects of agricultural machines. This work consists of a simulation software development for multibody systems (MBS), called FSSM (tool for simulation of mechanical systems), with appropriate functionalities for manufacturers of agricultural machines, using the AutoCAD g
Publicado em: 2008
-
5. Projeto cooperativo no Ambiente Cave baseado em espaço compartilhado de objetos
Este trabalho apresenta o módulo Collaborative Service, uma extensão do ambiente Cave, desenvolvido para suportar conceitos de trabalho cooperativo no projeto de circuitos integrados. Esta extensão por sua vez, é baseada na metodologia Pair- Programming e nas tecnologias Jini e Javaspaces. O módulo Collaborative Service foi desenvolvido para auxiliar a
Publicado em: 2007
-
6. Sistema especialista de apoio à elaboração de arranjo físico para sistema intensivo de produção de leite em confinamento tipo baias livres / Expert system to the elaboration of physical facilities for intensive milk production system in free stall type confinement
The search for technological alternatives that could optimize the productive processes, increase the quality, make flexible and reduce the production costs of the milk has promoted the directing of the agricultural researches toward the computer science field, which is another way to generating efficient scientific answers therefore partly reducing the subje
Publicado em: 2006
-
7. Predição do desempenho de programas paralelos por simulação do grafo de execução
The process of writing a new code for a parallel programming environment demands from its designer a lot of attention on the performance achieved by the pair program-machine. The high processing costs justify the efforts to reduce processing time and costs, which leads to the problem of defining performance metrics and approaches to measure the system perfor
Publicado em: 1997
-
8. Subsistemas opticos para comunicação solitonica
This work invesligates oplical subsystems that can be used in solitonic communications. Several numerical simulations are presented, using the Mathemalica® programming language. Inilially, the non-linear oplical pulse propagalion is analyzed, using thefinite difference lime domain (FDTD) method. A pair of non-linear Schrõdinger equalions is solved simultan
Publicado em: 1996
-
9. Simulation of Cyclic Dynein-Driven Sliding, Splitting, and Reassociation in an Outer Doublet Pair
A regular cycle of dynein-driven sliding, doublet separation, doublet reassociation, and resumption of sliding was previously observed by Aoyama and Kamiya in outer doublet pairs obtained after partial dissociation of Chlamydomonas flagella. In the work presented here, computer programming based on previous simulations of oscillatory bending of microtubules
The Biophysical Society.
-
10. An algorithm for progressive multiple alignment of sequences with insertions
Dynamic programming algorithms guarantee to find the optimal alignment between two sequences. For more than a few sequences, exact algorithms become computationally impractical, and progressive algorithms iterating pairwise alignments are widely used. These heuristic methods have a serious drawback because pairwise algorithms do not differentiate insertions
National Academy of Sciences.
-
11. Automatic generation of primary sequence patterns from sets of related protein sequences.
We have developed a computer algorithm that can extract the pattern of conserved primary sequence elements common to all members of a homologous protein family. The method involves clustering the pairwise similarity scores among a set of related sequences to generate a binary dendrogram (tree). The tree is then reduced in a stepwise manner by progressively r
-
12. Inter- and intraspecies identification of Bartonella (Rochalimaea) species.
Species of the genus Rochalimaea, recently renamed Bartonella, are of a growing medical interest. Bartonella quintana was reported as the cause of trench fever, endocarditis, and bacillary angiomatosis. B. henselae has been implicated in symptoms and infections of human immunodeficiency virus-infected patients, such as fever, endocarditis, and bacillary angi