In Brazil, the National Curricular Guidelines (DCN) have
determined that the medical professsional must act in the primary and secondary
levels of attention and solve the prevalent
health issues with quality. UNIPLAC’s medical course was created in 2004,
enrolling 40 students per year, with an innovative methodological proposal of
active teaching: the Problem-Based Learning (ABP). Furthermore, UNIPLAC’s
medical course offers support scenarios of extreme importance to the
students, such as Laboratory of Professional Practice (LPP) and
Morphofunctional Laboratory (LMF). LPP promotes the learning of semiology
skills, medical procedures, clinical laboratory and communication. The
objective is to identify the student’s attendance in LMF. A quantitative and
descriptive research was conducted through reading the LMF’s logbook between
January 2004 and December 2012. The focus of the research was tutors and
teachers who were in the coordination of the medical course. LMF is a privileged space for the development of the
pedagogical approach based on problematization and integration of a several learning areas.

Abstract:
ageing is associated to a progressive decline in muscle mass - a phenomenon known as sarcopenia - which directly affects muscle architecture and force production capacity. the purpose of this study was to review current literature on the effects of aging on muscle architecture, as well as review evidences on the effects of resistance training programs onto morphological properties of skeletal muscles, also discussing clinical implications of functional adaptation among the elderly. forty-two articles, published between 1993 and 2008, were selected from pubmed, science direct and scopus databases, by using the key words aging, older adults, elderly, muscle architecture, strength training, and resistance training. the reviewed studies support the idea that there are differences in the architecture of elderly affected by sarcopenia when compared to healthy young adults. evidences seem to be unanimous as to reduction in skeletal muscle volume, physiological cross sectional area and pennation angle due to aging. aging also leads to a reduction in fascicular length and muscle width, which determines a reduction in anatomical cross-sectional area. strength training programs have been used as a therapeutic technique in order to postpone or even revert aging effects on elderly skeletal muscle.

Abstract:
some consumers can own a particular vehicle while preferring another type of vehicle. this might be due to differences in attributes between vehicle types, as well as to differences between socio-demographic or motivational human values associated with the use of this product. the identification of what are the predictors of preference and ownership can shed light on what are the most appropriate variables to be used in the strategy of automotive market segmentation. the purpose of this empirical research study was to compare the influence of human values, the attributes of the car and socio-demographic variables on preference and ownership by car type. the sample consisted of 209 car users, reflecting a 0.87 power in this study. data were collected using the survey method and logistic regressions for each type of car were conducted. the results showed that there are different motivations that predict preference for type of car ownership and that vehicle attributes are stronger predictors than the motivations or socio-demographic variables, regarding both car preference and ownership.

Abstract:
Let X* be a subset of an affine space A^s, over a finite field K, which is parameterized by the edges of a clutter. Let X and Y be the images of X* under the maps x --> [x] and x --> [(x,1)] respectively, where [x] and [(x,1)] are points in the projective spaces P^{s-1} and P^s respectively. For certain clutters and for connected graphs, we were able to relate the algebraic invariants and properties of the vanishing ideals I(X) and I(Y). In a number of interesting cases, we compute its degree and regularity. For Hamiltonian bipartite graphs, we show the Eisenbud-Goto regularity conjecture. We give optimal bounds for the regularity when the graph is bipartite. It is shown that X* is an affine torus if and only if I(Y) is a complete intersection. We present some applications to coding theory and show some bounds for the minimum distance of parameterized linear codes for connected bipartite graphs.

Abstract:
A I Mostra de Paleodiversidade ocorreu dodia 16 ao dia 20 de outubro de 2006 durante umimportante evento da Universidade Federal de Juizde Fora, a XXIX edi o da Semana da Biologia.Esse evento mobiliza toda a comunidade discente dacidade de Juiz de Fora e de cidades próximas comoS o Jo o Del Rei (MG), Rio de Janeiro (RJ) e outras,assim como professores e funcionários do campus.A I Mostra de Paleobiodiversidade foi organizadacom o apoio de estagiários e exposta ao público nasdependências do Laboratório de Invertebrados doInstituto de Ciências Biológicas da UFJF. A Mostracontou com aproximadamente 300 exemplaresde fósseis, sendo a maioria deles paleoartrópodospertencentes à cole o da Sociedade Brasileira dePaleoartropodologia (SBPr). A mostra foi visitadapor mais de 200 pessoas, atraindo a curiosidade n osó dos estudantes, mas também de crian as, jovens eadultos da comunidade. A Mostra tem como intuitorealizar apresenta es itinerantes levando umpouco do conhecimento dos registros do passadoa todos os interessados.

Abstract:
Let X be a subset of a projective space, over a finite field K, which is parameterized by the monomials arising from the edges of a clutter. Let I(X) be the vanishing ideal of X. It is shown that I(X) is a complete intersection if and only if X is a projective torus. In this case we determine the minimum distance of any parameterized linear code arising from X.

Abstract:
Let K be a finite field and let X be a subset of a projective space, over the field K, which is parameterized by monomials arising from the edges of a clutter. We show some estimates for the degree-complexity, with respect to the revlex order, of the vanishing ideal I(X) of X. If the clutter is uniform, we classify the complete intersection property of I(X) using linear algebra. We show an upper bound for the minimum distance of certain parameterized linear codes along with certain estimates for the algebraic invariants of I(X).

Abstract:
We study the regularity and the algebraic properties of certain lattice ideals. We establish a map I --> I\~ between the family of graded lattice ideals in an N-graded polynomial ring over a field K and the family of graded lattice ideals in a polynomial ring with the standard grading. This map is shown to preserve the complete intersection property and the regularity of I but not the degree. We relate the Hilbert series and the generators of I and I\~. If dim(I)=1, we relate the degrees of I and I\~. It is shown that the regularity of certain lattice ideals is additive in a certain sense. Then, we give some applications. For finite fields, we give a formula for the regularity of the vanishing ideal of a degenerate torus in terms of the Frobenius number of a semigroup. We construct vanishing ideals, over finite fields, with prescribed regularity and degree of a certain type. Let X be a subset of a projective space over a field K. It is shown that the vanishing ideal of X is a lattice ideal of dimension 1 if and only if X is a finite subgroup of a projective torus. For finite fields, it is shown that X is a subgroup of a projective torus if and only if X is parameterized by monomials. We express the regularity of the vanishing ideal over a bipartie graph in terms of the regularities of the vanishing ideals of the blocks of the graph.

Abstract:
Let X be an algebraic toric set in a projective space over a finite field. We study the vanishing ideal, I(X), of X and show some useful degree bounds for a minimal set of generators of I(X). We give an explicit description of a set of generators of I(X), when X is the algebraic toric set associated to an even cycle or to a connected bipartite graph with pairwise disjoint even cycles. In this case, a fomula for the regularity of I(X) is given. We show an upper bound for this invariant, when X is associated to a (not necessarily connected) bipartite graph. The upper bound is sharp if the graph is connected. We are able to show a formula for the length of the parameterized linear code associated with any graph, in terms of the number of bipartite and non-bipartite components.