Lectures and other types of teaching

A questionnaire on lectures was completed by 351 students (84% response) and 35 staff (76% response) from all five years of the veterinary course at the University of Queensland. Staff and students in all five years offered limited support for a reduction in the number of lectures in the course and the majority supported a reduction in the number of lectures in the clinical years. Students in the clinical years only and appropriate staff agreed that the number of lectures in fifth year should be reduced but were divided as to whether lectures in fifth year should be abolished. There was limited support for replacement of some lectures by computer assisted learning (CAL) programs, but strong support for replacement of some lectures by subject-based problem based learning (PBL) and strong support for more self-directed learning by students. Staff and students strongly supported the inclusion of more clinical problem solving in lectures in the clinical years and wanted these lectures to be more interactive. There was little support for lectures in the clinical years to be of the same type as in the preclinical years.

An approach to verifying and debugging simulation models governed by ordinary differential equations: Part 1. Methodology for residual generation

For dynamic simulations to be credible, verification of the computer code must be an integral part of the modelling process. This two-part paper describes a novel approach to verification through program testing and debugging. In Part 1, a methodology is presented for detecting and isolating coding errors using back-to-back testing. Residuals are generated by comparing the output of two independent implementations, in response to identical inputs. The key feature of the methodology is that a specially modified observer is created using one of the implementations, so as to impose an error-dependent structure on these residuals. Each error can be associated with a fixed and known subspace, permitting errors to be isolated to specific equations in the code. It is shown that the geometric properties extend to multiple errors in either one of the two implementations. Copyright (C) 2003 John Wiley Sons, Ltd.

The effectiveness of personalized smoking cessation strategies for callers to a Quitline service

Aim To assess the effectiveness of a program of computer-generated tailored advice for callers to a telephone helpline, and to assess whether it enhanced a series of callback telephone counselling sessions in aiding smoking cessation. Design Randomized controlled trial comparing: (1) untailored self-help materials; (2) computer-generated tailored advice only, and (3) computer-generated tailored advice plus callback telephone counselling. Assessment surveys were conducted at baseline, 3, 6 and 12 months. Setting Victoria, Australia. Participants A total of 1578 smokers who called the Quitline service and agreed to participate. Measurements Smoking status at follow-up; duration of cessation, if quit; use of nicotine replacement therapy; and extent of participation in the callback service. Findings At the 3-month follow-up, significantly more (chi(2)(2) = 16.9; P < 0.001) participants in the computer-generated tailored advice plus telephone counselling condition were not smoking (21%) than in either the computer-generated advice only (12%) or the control condition (12%). Proportions reporting not smoking at the 12-month follow-up were 26%, 23% and 22%, respectively (NS) for point prevalence, and for 9 months sustained abstinence; 8.2, 6.0, and 5.0 (NS). In the telephone counselling group, those receiving callbacks were more likely than those who did not to have sustained abstinence at 12 months (10.2 compared with 4.0, P < 0.05). Logistic regression on 3-month data showed significant independent effects on cessation of telephone counselling and use of NRT, but not of computer-generated tailored advice. Conclusion Computer-generated tailored advice did not enhance telephone counselling, nor have any independent effect on cessation. This may be due to poor timing of the computer-generated tailored advice and poor integration of the two modes of advice.

Desempenho acadêmico e sistema de cotas : um estudo sobre o rendimento dos alunos cotistas e não cotistas da Universidade Federal do Espirito Santo

A adoção da ação afirmativa denominada cotas nas universidades federais - reserva de vagas para estudantes que tenham cursado integralmente o ensino médio em escolas públicas - continua sendo polêmica, mesmo após a sanção da Lei nº.12.711 de 2012, o que torna oportuna a contribuição aos estudos a respeito da utilização desse sistema nas universidades públicas brasileiras. Este trabalho teve por objetivo estudar o desempenho acadêmico de alunos cotistas do Centro de Ciências Jurídicas e Econômicas e do Centro Tecnológico da Universidade Federal do Espírito Santo – UFES, no período de 2008 a 2013, considerando as duas entradas anuais nos referidos cursos. O presente estudo analisou o aproveitamento acadêmico dos alunos de 15 cursos de graduação ofertados pelos Centros nominados buscando saber em quais cursos e disciplinas existem diferenças significativas de desempenho, a partir do coeficiente de rendimento acadêmico (CRA) e da média final das disciplinas cursadas por alunos cotistas e não cotistas, visando a propor ações institucionais para a redução dessas diferenças. Na pesquisa, de caráter quantitativo, utilizou-se o método estatístico de análise de variância ANOVA. A partir das análises realizadas foi possível inferir a existência de diferenças de rendimento nos cursos de engenharia,principalmente em disciplinas de cálculo e álgebra. O curso de Direito, por sua vez, apresentou diferença significativa de desempenho, não obstante as médias não estarem abaixo do índice necessário para a aprovação. Quando a comparação é feita considerando o sexo, verificou-se no curso de Ciências Econômicas e Ciências da Computação uma disparidade significativa de rendimento em favor dos alunos do sexo feminino cotistas em detrimento dos não cotistas do mesmo sexo.

Molecular dynamics computer simulation of scratch resistance testing of polymers: visualization

Experimental scratch resistance testing provides two numbers: the penetration depth Rp and the healing depth Rh. In molecular dynamics computer simulations, we create a material consisting of N statistical chain segments by polymerization; a reinforcing phase can be included. Then we simulate the movement of an indenter and response of the segments during X time steps. Each segment at each time step has three Cartesian coordinates of position and three of momentum. We describe methods of visualization of results based on a record of 6NX coordinates. We obtain a continuous dependence on time t of positions of each of the segments on the path of the indenter. Scratch resistance at a given location can be connected to spatial structures of individual polymeric chains.

Towards the design of efficient nonbeacon-enabled ZigBee networks

This paper presents experimental results of the communication performance evaluation of a prototype ZigBee-based patient monitoring system commissioned in an in-patient floor of a Portuguese hospital (HPG – Hospital Privado de Guimar~aes). Besides, it revisits relevant problems that affect the performance of nonbeacon-enabled ZigBee networks. Initially, the presence of hidden-nodes and the impact of sensor node mobility are discussed. It was observed, for instance, that the message delivery ratio in a star network consisting of six wireless electrocardiogram sensor devices may decrease from 100% when no hidden-nodes are present to 83.96% when half of the sensor devices are unable to detect the transmissions made by the other half. An additional aspect which affects the communication reliability is a deadlock condition that can occur if routers are unable to process incoming packets during the backoff part of the CSMA-CA mechanism. A simple approach to increase the message delivery ratio in this case is proposed and its effectiveness is verified. The discussion and results presented in this paper aim to contribute to the design of efficient networks,and are valid to other scenarios and environments rather than hospitals.

Mechanical Behavior of the Lamellar Structure in Semi-Crystalline Polymers

We have employed molecular dynamics simulations to study the behavior of virtual polymeric materials under an applied uniaxial tensile load. Through computer simulations, one can obtain experimentally inaccessible information about phenomena taking place at the molecular and microscopic levels. Not only can the global material response be monitored and characterized along time, but the response of macromolecular chains can be followed independently if desired. The computer-generated materials were created by emulating the step-wise polymerization, resulting in self-avoiding chains in 3D with controlled degree of orientation along a certain axis. These materials represent a simplified model of the lamellar structure of semi-crystalline polymers,being comprised of an amorphous region surrounded by two crystalline lamellar regions. For the simulations, a series of materials were created, varying i) the lamella thickness, ii) the amorphous region thickness, iii) the preferential chain orientation, and iv) the degree of packing of the amorphous region. Simulation results indicate that the lamella thickness has the strongest influence on the mechanical properties of the lamella-amorphous structure, which is in agreement with experimental data. The other morphological parameters also affect the mechanical response, but to a smaller degree. This research follows previous simulation work on the crack formation and propagation phenomena, deformation mechanisms at the nanoscale, and the influence of the loading conditions on the material response. Computer simulations can improve the fundamental understanding about the phenomena responsible for the behavior of polymeric materials, and will eventually lead to the design of knowledge-based materials with improved properties.

Bone mineral density of rat femurs after hindlimb unloading and different physical rehabilitation programs

Bone weakening can occur due to the absence of load on the skeleton or even short periods of decreased physical activity. Therefore, musculoskeletal diseases that involve temporary immobilization by casts, inactivity or tension increases the risk of fractures. Physical activity is the most studied procedure both to prevent damage and to restore bone structure. The present study aimed at evaluating, by bone densitometry on rat femurs, the influence of hindlimb unloading and later running activity on treadmill or free movement. Sixty-four Wistar rats were used, aged 65 days with a mean corporal mass of 316.11g, randomly divided into eight experimental groups: group 1, the suspended control with seven animals under hindlimb unloading regimen for 28 days, then euthanized; groups 2 and 3, the trained suspended comprising of 7 and five animals, respectively, subjected to hindlimb unloading for 28 days, followed by treadmill exercise for 28 days (group 2) or 56 days (group 3), then euthanized; groups 4 and 5, designated free suspended, comprised of 7 animals each under hindlimb unloading regimen for 28 days followed by free activity in cages for 28 days (group 4) or 56 days (group 5), then euthanized; groups 6, 7 and 8, negative controls, each with 8 animals allowed to free activity in cages and euthanized at the ages of 93, 121 and 149 days, respectively. Bone mineral density (BMD) of the left femur was analyzed by bone densitometry. Unloading by tail-suspension decreased BMD while treadmill training and free activity in cages promoted its recovery in a similar way and over time.

Estimating Local Part Thickness in Midplane Meshes for Finite Element Analysis

Within the development of motor vehicles, crash safety (e.g. occupant protection, pedestrian protection, low speed damageability), is one of the most important attributes. In order to be able to fulfill the increased requirements in the framework of shorter cycle times and rising pressure to reduce costs, car manufacturers keep intensifying the use of virtual development tools such as those in the domain of Computer Aided Engineering (CAE). For crash simulations, the explicit finite element method (FEM) is applied. The accuracy of the simulation process is highly dependent on the accuracy of the simulation model, including the midplane mesh. One of the roughest approximations typically made is the actual part thickness which, in reality, can vary locally. However, almost always a constant thickness value is defined throughout the entire part due to complexity reasons. On the other hand, for precise fracture analysis within FEM, the correct thickness consideration is one key enabler. Thus, availability of per element thickness information, which does not exist explicitly in the FEM model, can significantly contribute to an improved crash simulation quality, especially regarding fracture prediction. Even though the thickness is not explicitly available from the FEM model, it can be inferred from the original CAD geometric model through geometric calculations. This paper proposes and compares two thickness estimation algorithms based on ray tracing and nearest neighbour 3D range searches. A systematic quantitative analysis of the accuracy of both algorithms is presented, as well as a thorough identification of particular geometric arrangements under which their accuracy can be compared. These results enable the identification of each technique’s weaknesses and hint towards a new, integrated, approach to the problem that linearly combines the estimates produced by each algorithm.

Program slicing by calculation

Program slicing is a well known family of techniques used to identify code fragments which depend on or are depended upon specific program entities. They are particularly useful in the areas of reverse engineering, program understanding, testing and software maintenance. Most slicing methods, usually oriented towards the imperative or object paradigms, are based on some sort of graph structure representing program dependencies. Slicing techniques amount, therefore, to (sophisticated) graph transversal algorithms. This paper proposes a completely different approach to the slicing problem for functional programs. Instead of extracting program information to build an underlying dependencies’ structure, we resort to standard program calculation strategies, based on the so-called Bird-Meertens formalism. The slicing criterion is specified either as a projection or a hiding function which, once composed with the original program, leads to the identification of the intended slice. Going through a number of examples, the paper suggests this approach may be an interesting, even if not completely general, alternative to slicing functional programs

Component identification through program slicing

This paper reports on the development of specific slicing techniques for functional programs and their use for the identification of possible coherent components from monolithic code. An associated tool is also introduced. This piece of research is part of a broader project on program understanding and re-engineering of legacy code supported by formal methods

Higher-order lazy functional slicing

Program slicing is a well known family of techniques intended to identify and isolate code fragments which depend on, or are depended upon, specific program entities. This is particularly useful in the areas of reverse engineering, program understanding, testing and software maintenance. Most slicing methods, and corresponding tools, target either the imperative or the object oriented paradigms, where program slices are computed with respect to a variable or a program statement. Taking a complementary point of view, this paper focuses on the slicing of higher-order functional programs under a lazy evaluation strategy. A prototype of a Haskell slicer, built as proof-of-concept for these ideas, is also introduced

Identifying clones in functional programs for refactoring

Clone detection is well established for imperative programs. It works mostly on the statement level and therefore is ill-suited for func- tional programs, whose main constituents are expressions and types. In this paper we introduce clone detection for functional programs using a new intermediate program representation, dubbed Functional Control Tree. We extend clone detection to the identi cation of non-trivial func- tional program clones based on the recursion patterns from the so-called Bird-Meertens formalism