Practical software improve design and performance of a randomly packed air stripping column for removing volatile organic compounds from water

STRIPPING is a software application developed for the automatic design of a randomly packing column where the transfer of volatile organic compounds (VOCs) from water to air can be performed and to simulate it’s behaviour in a steady-state. This software completely purges any need of experimental work for the selection of diameter of the column, and allows a choice, a priori, of the most convenient hydraulic regime for this type of operation. It also allows the operator to choose the model used for the calculation of some parameters, namely between the Eckert/Robbins model and the Billet model for estimating the pressure drop of the gaseous phase, and between the Billet and Onda/Djebbar’s models for the mass transfer. Illustrations of the graphical interface offered are presented.

Feedback regarding students initial pharmaceutical internship from the University of Medicine and Pharmacy, Cluj-Napoca

Introduction/Aims: The purpose of the study is to evaluate the perception of the organization, the development and the evaluation of the initial stage in the internship of students, in order to improve these activities and to establish the adequate objectives in accordance with the changes concerning the concept of modern pharmacy. Materials and methods: An online survey was made using Google Docs ® -Create Form extension. All results were accumulated and computed using Microsoft Excel ®. The questionnaire consisted of 11 questions, structured on several levels: the objectives and how they can be achieved, internship organization, the internship training (effective participation in specific activities and integration in the pharmaceutical activity), the assessment, the profile of tutor / pharmacy. The questionnaire was completed by students from the Faculty of Pharmacy, University of Medicine and Pharmacy "Iuliu Haţieganu" Cluj Napoca, Romania. Results and discussions. The study was conducted on 308 students (60% of all students from the study years II-IV. 90% of the respondents had actually participated in the internship, whilst 10% only formally participated in this activity. The main responsibilities of the students were: storage and reception of pharmaceutical products (94%, respectively 79%) and working with the receipts (57%). Most of the students appreciate that they were integrated into the work in the pharmacy, this being due largely pharmacist tutor, who expressed interest and ability in mentoring activities. They appreciated that the role of tutor requires 3-5 years of professional experience. In terms of the internship objectives, these should aim at applying the knowledge gained until the graduation year, but also familiarization with activities which might turn into applications for the coming years. 43% of students believe that only 25% of the theoretical knowledge was useful during the internship. 90 % of the total questioned considered useful to develop a practice guideline adapted to the year of study. Conclusions. The professional training of the future pharmacist’s students depends largely on experience gained by students during the internship activity. Feed-back from the students’ shows that they are aware of the usefulness of the internship, but believe the objectives must be updated and a better correlation between work in pharmacy and theoretical knowledge has to be made. A first step is to develop a practical guide adapted to each year of study. The involvement of the tutor pharmacist is also essential to the success of this activity

Practical aspects of slot-based task- splitting dispatching in its schedulability analysis

Consider the problem of scheduling a set of sporadic tasks on a multiprocessor system to meet deadlines using a tasksplitting scheduling algorithm. Task-splitting (also called semipartitioning) scheduling algorithms assign most tasks to just one processor but a few tasks are assigned to two or more processors, and they are dispatched in a way that ensures that a task never executes on two or more processors simultaneously. A certain type of task-splitting algorithms, called slot-based task-splitting, is of particular interest because of its ability to schedule tasks at high processor utilizations. We present a new schedulability analysis for slot-based task-splitting scheduling algorithms that takes the overhead into account and also a new task assignment algorithm.