977 resultados para Interactive communication
Resumo:
Behavioral Parent Training (BPT) is a well-established therapy that reduces child externalized behaviors and parent stress. Although BPT was originally developed for parents of children with defiant behaviors, the program’s key concepts are relevant to parenting all children. Since parents might not fully utilize BPT due to cost and program location, we created an online game as a low-cost, easily accessible alternative or complement to BPT. We tested the game with nineteen undergraduate students at the University of Maryland. The experimental group completed pretest survey on core BPT knowledge, played the game, and completed a BPT posttest, while the control group completed a pretest and posttest survey over a three week period. Participants in the experimental group also completed a survey to indicate their satisfaction with the overall program. The experimental group demonstrated significantly higher levels of BPT knowledge than the control group and high levels of satisfaction. This suggests that an interactive, online BPT platform is an engaging and accessible way for parents to learn key concepts.
Resumo:
info:eu-repo/semantics/published
Resumo:
Many Gram-negative bacteria use the chaperone-usher pathway to express adhesive surface structures, such as fimbriae, in order to mediate attachment to host cells. Periplasmic chaperones are required to shuttle fimbrial subunits or pilins through the periplasmic space in an assembly-competent form. The chaperones cap the hydrophobic surface of the pilins through a donor-strand complementation mechanism. FaeE is the periplasmic chaperone required for the assembly of the F4 fimbriae of enterotoxigenic Escherichia coli. The FaeE crystal structure shows a dimer formed by interaction between the pilin-binding interfaces of the two monomers. Dimerization and tetramerization have been observed previously in crystal structures of fimbrial chaperones and have been suggested to serve as a self-capping mechanism that protects the pilin-interactive surfaces in solution in the absence of the pilins. However, thermodynamic and biochemical data show that FaeE occurs as a stable monomer in solution. Other lines of evidence indicate that self-capping of the pilin-interactive interfaces is not a mechanism that is conservedly applied by all periplasmic chaperones, but is rather a case-specific solution to cap aggregation-prone surfaces.
Resumo:
Symmetrical Freedom Quilts may be considered as links between mathematics, history, ethnomathematics, and the art of quilting. A quilt theme is a pedagogical way to integrate mathematics, art, and history in an interdisciplinary approach. This article combines an ethnomathematical-historical perspective by elaborating a history project related to the Underground Railroad. This work will allow teachers to develop classroom projects that help students to better understand geometry, especially concepts of symmetry and transformations. One of the objectives of this project is to stimulate student’s creativity and interest, because quilts may be considered as cultural and mathematical expressions of student’s daily life.
Resumo:
The Computer Aided Parallelisation Tools (CAPTools) [Ierotheou, C, Johnson SP, Cross M, Leggett PF, Computer aided parallelisation tools (CAPTools)-conceptual overview and performance on the parallelisation of structured mesh codes, Parallel Computing, 1996;22:163±195] is a set of interactive tools aimed to provide automatic parallelisation of serial FORTRAN Computational Mechanics (CM) programs. CAPTools analyses the user's serial code and then through stages of array partitioning, mask and communication calculation, generates parallel SPMD (Single Program Multiple Data) messages passing FORTRAN. The parallel code generated by CAPTools contains calls to a collection of routines that form the CAPTools communications Library (CAPLib). The library provides a portable layer and user friendly abstraction over the underlying parallel environment. CAPLib contains optimised message passing routines for data exchange between parallel processes and other utility routines for parallel execution control, initialisation and debugging. By compiling and linking with different implementations of the library, the user is able to run on many different parallel environments. Even with today's parallel systems the concept of a single version of a parallel application code is more of an aspiration than a reality. However for CM codes the data partitioning SPMD paradigm requires a relatively small set of message-passing communication calls. This set can be implemented as an intermediate `thin layer' library of message-passing calls that enables the parallel code (especially that generated automatically by a parallelisation tool such as CAPTools) to be as generic as possible. CAPLib is just such a `thin layer' message passing library that supports parallel CM codes, by mapping generic calls onto machine specific libraries (such as CRAY SHMEM) and portable general purpose libraries (such as PVM an MPI). This paper describe CAPLib together with its three perceived advantages over other routes: - as a high level abstraction, it is both easy to understand (especially when generated automatically by tools) and to implement by hand, for the CM community (who are not generally parallel computing specialists); - the one parallel version of the application code is truly generic and portable; - the parallel application can readily utilise whatever message passing libraries on a given machine yield optimum performance.
Resumo:
Multilevel algorithms are a successful class of optimisation techniques which address the mesh partitioning problem for distributing unstructured meshes onto parallel computers. They usually combine a graph contraction algorithm together with a local optimisation method which refines the partition at each graph level. To date these algorithms have been used almost exclusively to minimise the cut edge weight in the graph with the aim of minimising the parallel communication overhead, but recently there has been a perceived need to take into account the communications network of the parallel machine. For example the increasing use of SMP clusters (systems of multiprocessor compute nodes with very fast intra-node communications but relatively slow inter-node networks) suggest the use of hierarchical network models. Indeed this requirement is exacerbated in the early experiments with meta-computers (multiple supercomputers combined together, in extreme cases over inter-continental networks). In this paper therefore, we modify a multilevel algorithm in order to minimise a cost function based on a model of the communications network. Several network models and variants of the algorithm are tested and we establish that it is possible to successfully guide the optimisation to reflect the chosen architecture.
Resumo:
The original concept was to create a 'simulation' which would provide trainee teachers, specializing in Information and Communications Technology (ICT) with the opportunity to explore a primary school environment. Within the simulation, factors affecting the development and implementation of ICT would be modelled so that trainees would be able to develop the skills, knowledge and understanding necessary to identify appropriate strategies to overcome the limitations. To this end, we have developed Allsorts Primary - the prototype of a simulated interactive environment, representing a typical primary school
Resumo:
This paper briefly describes an interactive parallelisation toolkit that can be used to generate parallel code suitable for either a distributed memory system (using message passing) or a shared memory system (using OpenMP). This study focuses on how the toolkit is used to parallelise a complex heterogeneous ocean modelling code within a few hours for use on a shared memory parallel system. The generated parallel code is essentially the serial code with OpenMP directives added to express the parallelism. The results show that substantial gains in performance can be achieved over the single thread version with very little effort.
Resumo:
This paper describes an interactive parallelisation toolkit that can be used to generate parallel code suitable for either a distributed memory system (using message passing) or a shared memory system (using OpenMP). This study focuses on how the toolkit is used to parallelise a complex heterogeneous ocean modelling code within a few hours for use on a shared memory parallel system. The generated parallel code is essentially the serial code with OpenMP directives added to express the parallelism. The results show that substantial gains in performance can be achieved over the single thread version with very little effort.
Resumo:
Virtual learning environments (VLEs) are often perceived by education establishments as an opportunity to widen access without traditional overheads. An integral part of most VLEs is asynchronous computer conferencing and on-line moderators must help students migrate quickly to the new virtual environment to minimize learning disruption. This paper focuses on 21 new on-line moderators and reports their changing perceptions re their role and concerns, from their first appointment through to the end of the delivery of their first on-line course. The findings suggest that it is only after socialization occurs that information can be exchanged and lead to knowledge construction. These are supported by, and extend, prior research by Z Berge, R Mason, M Paulsen and G Salmon and are reinforced by empirical work with a further 19 new on-line moderators.
Resumo:
The needs for various forms of information systems relating to the European environment and ecosystem are reviewed, and limitations indicated. Existing information systems are reviewed and compared in terms of aims and functionalities. We consider TWO technical challenges involved in attempting to develop an IEEICS. First, there is the challenge of developing an Internet-based communication system which allows fluent access to information stored in a range of distributed databases. Some of the currently available solutions are considered, i.e. Web service federations. The second main challenge arises from the fact that there is general intra-national heterogeneity in the definitions adopted, and the measurement systems used throughout the nations of Europe. Integrated strategies are needed.
Resumo:
Code parallelization using OpenMP for shared memory systems is relatively easier than using message passing for distributed memory systems. Despite this, it is still a challenge to use OpenMP to parallelize application codes in a way that yields effective scalable performance when executed on a shared memory parallel system. We describe an environment that will assist the programmer in the various tasks of code parallelization and this is achieved in a greatly reduced time frame and level of skill required. The parallelization environment includes a number of tools that address the main tasks of parallelism detection, OpenMP source code generation, debugging and optimization. These tools include a high quality, fully interprocedural dependence analysis with user interaction capabilities to facilitate the generation of efficient parallel code, an automatic relative debugging tool to identify erroneous user decisions in that interaction and also performance profiling to identify bottlenecks. Finally, experiences of parallelizing some NASA application codes are presented to illustrate some of the benefits of using the evolving environment.
Resumo:
The parallelization of real-world compute intensive Fortran application codes is generally not a trivial task. If the time to complete the parallelization is to be significantly reduced then an environment is needed that will assist the programmer in the various tasks of code parallelization. In this paper the authors present a code parallelization environment where a number of tools that address the main tasks such as code parallelization, debugging and optimization are available. The ParaWise and CAPO parallelization tools are discussed which enable the near automatic parallelization of real-world scientific application codes for shared and distributed memory-based parallel systems. As user involvement in the parallelization process can introduce errors, a relative debugging tool (P2d2) is also available and can be used to perform nearly automatic relative debugging of a program that has been parallelized using the tools. A high quality interprocedural dependence analysis as well as user-tool interaction are also highlighted and are vital to the generation of efficient parallel code and in the optimization of the backtracking and speculation process used in relative debugging. Results of benchmark and real-world application codes parallelized are presented and show the benefits of using the environment