Nouveau manuel complet du ferblantier et du lampiste, ou L'art de confectionner en fer-blanc tous les ustensiles possibles... (Nouvelle édition) / par MM. Lebrun et F. Malepeyre

Collection : Manuels Roret

The art and learning patterns of knowing in nursing

Objective To identify the perception of the students about the use of art as a pedagogical strategy in learning the patterns of knowing in nursing; to identify the dimensions of each pattern valued in the analysis of pieces of art. Method Descriptive mixed study. Data collection used a questionnaire applied to 31 nursing students. Results In the analysis of the students’ discourse, it was explicit that empirical knowledge includes scientific knowledge, tradition and nature of care. The aesthetic knowledge implies expressiveness, subjectivity and sensitivity. Self-knowledge, experience, reflective attitude and relationships with others are the subcategories of personal knowledge and the moral and ethics support ethical knowledge. Conclusion It is possible to learn patterns of knowledge through art, especially the aesthetic, ethical and personal. It is necessary to investigate further pedagogical strategies that contribute to the learning patterns of nursing knowledge.

Art i part :la figura del/la professional de l'educació social en processos de desenvolupament cultural comunitari

Anàlisi de la figura de l'educador/a social en processos de desenvolupament comunitari a partir d'experiències diverses a Catalunya

L'art du menuisier-carrossier ; 1re section de la 3e partie de l'Art du menuisier, par M. Roubo le fils,...

Collection : Descriptions des arts et métiers faites ou approuvées par... l'Académie royale des sciences

A polynomial algorithm for special case of the one-machine scheduling problem with time-lags

The standard one-machine scheduling problem consists in schedulinga set of jobs in one machine which can handle only one job at atime, minimizing the maximum lateness. Each job is available forprocessing at its release date, requires a known processing timeand after finishing the processing, it is delivery after a certaintime. There also can exists precedence constraints between pairsof jobs, requiring that the first jobs must be completed beforethe second job can start. An extension of this problem consistsin assigning a time interval between the processing of the jobsassociated with the precedence constrains, known by finish-starttime-lags. In presence of this constraints, the problem is NP-hardeven if preemption is allowed. In this work, we consider a specialcase of the one-machine preemption scheduling problem with time-lags, where the time-lags have a chain form, and propose apolynomial algorithm to solve it. The algorithm consist in apolynomial number of calls of the preemption version of the LongestTail Heuristic. One of the applicability of the method is to obtainlower bounds for NP-hard one-machine and job-shop schedulingproblems. We present some computational results of thisapplication, followed by some conclusions.

L'art du relieur doreur de livres / , par M. Dudin

Collection : Description des arts et métiers