Study on the growth promoting capacity of calf and fetal bovine serum for animal cells "in vitro" II: electrophoretic study and survey on the antiproteolytic activity of pools of calf and fetal bovine serum

Calf serum and fetal bovine serum present great variability as to its growth promoting efficiency (GPE). As supplement of culture media to cultivate cells of animal origin they stimulate the "in vitro" multiplication and maintain cell viability. When fourteen lots of calf sera of variable GPE had the total protein contents as well as the percentages of serum fractions determined, no significant differences that could possibly explain the variability of the GPE were observed. Evaluation of the antiproteolytic activity of nineteen lots of calf serum and eighteen serum lots of younger calves showed that the former exhibited lower antiproteolytic titers (1:40 to 1:80) than the latter (1:80 to 1:160). Twelve lots of fetal bovine serum studied in parallel, showed the highest concentration of antiproteolytic factors, with titers equal to 1:320. Sera of bovine origin, but not fetal sera, are usually heat-inactivated, what was demonstrated to be responsible for the decrease of the antiproteolytic activity of 75% of the lots tested. This could explain the inability of certain heat-inactivated sera in promoting multiplication of some cells "in vitro", as verified with primary monkey kidney cells. The results obtained in this study indicated the convenience of submiting each lot of serum to be introduced in cell culture to previous determination of its characteristics, such as growth promoting efficiency, antiproteolytic activity and also toxicity, absence of extraneous agents, etc., in order to minimize the possibility of using serum lots of questionable quality, thus preventing not only the loss of cell lines, but also undesirable and sometimes expensive delays.

Modified particle swarm optimization for day-ahead distributed energy resources scheduling including vehicle-to-grid

Mestrado em Engenharia Electrotécnica – Sistemas Eléctricos de Energia

Derivation methods for hybrid knowledge bases with rules and ontologies

Trabalho apresentado no âmbito do Mestrado em Engenharia Informática, como requisito parcial para obtenção do grau de Mestre em Engenharia Informática

A random key based genetic algorithm for the resource constrained project scheduling problem

This paper presents a genetic algorithm for the Resource Constrained Project Scheduling Problem (RCPSP). The chromosome representation of the problem is based on random keys. The schedule is constructed using a heuristic priority rule in which the priorities of the activities are defined by the genetic algorithm. The heuristic generates parameterized active schedules. The approach was tested on a set of standard problems taken from the literature and compared with other approaches. The computational results validate the effectiveness of the proposed algorithm.

An optimization approach for the job shop scheduling problem

This paper presents an optimization approach for the job shop scheduling problem (JSSP). The JSSP is a difficult problem in combinatorial optimization for which extensive investigation has been devoted to the development of efficient algorithms. The proposed approach is based on a genetic algorithm technique. The scheduling rules such as SPT and MWKR are integrated into the process of genetic evolution. The chromosome representation of the problem is based on random keys. The schedules are constructed using a priority rule in which the priorities and delay times of the operations are defined by the genetic algorithm. Schedules are constructed using a procedure that generates parameterized active schedules. After a schedule is obtained a local search heuristic is applied to improve the solution. The approach is tested on a set of standard instances taken from the literature and compared with other approaches. The computation results validate the effectiveness of the proposed approach.

Predictive value of serologic tests in the diagnosis and follow-up of patients with paracoccidioidomycosis

A serologic study was undertaken in a group of 43 patients with active paracoccidioidomycosis who were treated in the same form (ketoconazole), for identical periods of time (6 months), and folio wed-up for various periods posttherapy. The tests employed were agar gel immunodiffusion (AGID) and complement fixation (FC). Also studied were 50 sera from patients with proven histoplasmosis and pulmonary aspergilloma, 30 patients with culturaly proven tuberculosis as well as 92 specimens from healthy individuals, residents in the endemic area for paracoccidioidomycosis. A single lot of yeast filtrate antigen was used throughout the study. The value of each test was measured according to GALEN and GAMBINO6. Both tests were highly sensitive, 89 and 93% respectively. Regarding their specificity, the AGID was totally specific while the CF exhibited 96.6% and 97% specificity in front of tuberculosis patients and healthy individuals respectively and 82% in comparison with patients with other mycoses. The concept of predictive value, that is, the certainty one has in accepting a positive test as diagnostic of paracoccidioidomycosis, favored the AGID procedure (100%) over the CF test. The latter could sort out with 93% certainty a patient with paracoccidioidomycosis among a group of healthy individuals and with 97.5% in the case of TB patients; when the group in question was composed by individuals with other deep mycoses, such certainty was lower (81%). The above results indicate that both the AGID and the CF tests furnish results of high confidence; one should not relay, however, in the CF alone as a means to establish the specific diagnosis of paracoccidioidomycosis.

Towards high-available and energy-efficient virtual computing environments in the cloud

Empowered by virtualisation technology, cloud infrastructures enable the construction of flexi- ble and elastic computing environments, providing an opportunity for energy and resource cost optimisation while enhancing system availability and achieving high performance. A crucial re- quirement for effective consolidation is the ability to efficiently utilise system resources for high- availability computing and energy-efficiency optimisation to reduce operational costs and carbon footprints in the environment. Additionally, failures in highly networked computing systems can negatively impact system performance substantially, prohibiting the system from achieving its initial objectives. In this paper, we propose algorithms to dynamically construct and readjust vir- tual clusters to enable the execution of users’ jobs. Allied with an energy optimising mechanism to detect and mitigate energy inefficiencies, our decision-making algorithms leverage virtuali- sation tools to provide proactive fault-tolerance and energy-efficiency to virtual clusters. We conducted simulations by injecting random synthetic jobs and jobs using the latest version of the Google cloud tracelogs. The results indicate that our strategy improves the work per Joule ratio by approximately 12.9% and the working efficiency by almost 15.9% compared with other state-of-the-art algorithms.

Evaluating the quality and the success of online courses

Measuring the quality of a b-learning environment is critical to determine the success of a b-learning course. There are a lot of materials related to the quality process, namely different approaches and perspectives but none of them is specific of the product of a b-learning context. In this paper we identify the indicators that should be analyzed in order to determine the quality of a b-learning course, since its success reflect not only the student’s perception, but also what should be taken into account. B-Learning environments are relatively new and combine educational characteristics with technological elements that support the learning process and the training delivery. Our main objective is to know what a high quality b-learning environment is in students’’ perception and what are the main quality dimensions of these courses, in the perspective of the products and services offered. After a literature review concerning the quality process and in particular the b-learning quality field, a structure that provides the main elements that should be evaluated by students when we are measuring the quality and the success of b-learning product/services was created. The structure obtained was applied to a case study of the Polytechnic Institute of Oporto. Results presented will help institutions to deliver services with more quality and improve their long-term competitiveness.

Day-ahead Resource Scheduling Including Demand Response for Electric Vehicles

The energy resource scheduling is becoming increasingly important, as the use of distributed resources is intensified and massive gridable vehicle (V2G) use is envisaged. This paper presents a methodology for day-ahead energy resource scheduling for smart grids considering the intensive use of distributed generation and V2G. The main focus is the comparison of different EV management approaches in the day-ahead energy resources management, namely uncontrolled charging, smart charging, V2G and Demand Response (DR) programs i n the V2G approach. Three different DR programs are designed and tested (trip reduce, shifting reduce and reduce+shifting). Othe r important contribution of the paper is the comparison between deterministic and computational intelligence techniques to reduce the execution time. The proposed scheduling is solved with a modified particle swarm optimization. Mixed integer non-linear programming is also used for comparison purposes. Full ac power flow calculation is included to allow taking into account the network constraints. A case study with a 33-bus distribution network and 2000 V2G resources is used to illustrate the performance of the proposed method.

Negotiation mechanism for self-organized scheduling system with collective intelligence

Current Manufacturing Systems challenges due to international economic crisis, market globalization and e-business trends, incites the development of intelligent systems to support decision making, which allows managers to concentrate on high-level tasks management while improving decision response and effectiveness towards manufacturing agility. This paper presents a novel negotiation mechanism for dynamic scheduling based on social and collective intelligence. Under the proposed negotiation mechanism, agents must interact and collaborate in order to improve the global schedule. Swarm Intelligence (SI) is considered a general aggregation term for several computational techniques, which use ideas and inspiration from the social behaviors of insects and other biological systems. This work is primarily concerned with negotiation, where multiple self-interested agents can reach agreement over the exchange of operations on competitive resources. Experimental analysis was performed in order to validate the influence of negotiation mechanism in the system performance and the SI technique. Empirical results and statistical evidence illustrate that the negotiation mechanism influence significantly the overall system performance and the effectiveness of Artificial Bee Colony for makespan minimization and on the machine occupation maximization.

An optimal boundary fair scheduling

Nowadays, many real-time operating systems discretize the time relying on a system time unit. To take this behavior into account, real-time scheduling algorithms must adopt a discrete-time model in which both timing requirements of tasks and their time allocations have to be integer multiples of the system time unit. That is, tasks cannot be executed for less than one time unit, which implies that they always have to achieve a minimum amount of work before they can be preempted. Assuming such a discrete-time model, the authors of Zhu et al. (Proceedings of the 24th IEEE international real-time systems symposium (RTSS 2003), 2003, J Parallel Distrib Comput 71(10):1411–1425, 2011) proposed an efficient “boundary fair” algorithm (named BF) and proved its optimality for the scheduling of periodic tasks while achieving full system utilization. However, BF cannot handle sporadic tasks due to their inherent irregular and unpredictable job release patterns. In this paper, we propose an optimal boundary-fair scheduling algorithm for sporadic tasks (named BF TeX ), which follows the same principle as BF by making scheduling decisions only at the job arrival times and (expected) task deadlines. This new algorithm was implemented in Linux and we show through experiments conducted upon a multicore machine that BF TeX outperforms the state-of-the-art discrete-time optimal scheduler (PD TeX ), benefiting from much less scheduling overheads. Furthermore, it appears from these experimental results that BF TeX is barely dependent on the length of the system time unit while PD TeX —the only other existing solution for the scheduling of sporadic tasks in discrete-time systems—sees its number of preemptions, migrations and the time spent to take scheduling decisions increasing linearly when improving the time resolution of the system.

Compositional multiprocessor scheduling: the GMPR interface

Composition is a practice of key importance in software engineering. When real-time applications are composed, it is necessary that their timing properties (such as meeting the deadlines) are guaranteed. The composition is performed by establishing an interface between the application and the physical platform. Such an interface typically contains information about the amount of computing capacity needed by the application. For multiprocessor platforms, the interface should also present information about the degree of parallelism. Several interface proposals have recently been put forward in various research works. However, those interfaces are either too complex to be handled or too pessimistic. In this paper we propose the generalized multiprocessor periodic resource model (GMPR) that is strictly superior to the MPR model without requiring a too detailed description. We then derive a method to compute the interface from the application specification. This method has been implemented in Matlab routines that are publicly available.

Real-time scheduling with resource sharing on heterogeneous multiprocessors

Consider the problem of scheduling a task set τ of implicit-deadline sporadic tasks to meet all deadlines on a t-type heterogeneous multiprocessor platform where tasks may access multiple shared resources. The multiprocessor platform has m k processors of type-k, where k∈{1,2,…,t}. The execution time of a task depends on the type of processor on which it executes. The set of shared resources is denoted by R. For each task τ i , there is a resource set R i ⊆R such that for each job of τ i , during one phase of its execution, the job requests to hold the resource set R i exclusively with the interpretation that (i) the job makes a single request to hold all the resources in the resource set R i and (ii) at all times, when a job of τ i holds R i , no other job holds any resource in R i . Each job of task τ i may request the resource set R i at most once during its execution. A job is allowed to migrate when it requests a resource set and when it releases the resource set but a job is not allowed to migrate at other times. Our goal is to design a scheduling algorithm for this problem and prove its performance. We propose an algorithm, LP-EE-vpr, which offers the guarantee that if an implicit-deadline sporadic task set is schedulable on a t-type heterogeneous multiprocessor platform by an optimal scheduling algorithm that allows a job to migrate only when it requests or releases a resource set, then our algorithm also meets the deadlines with the same restriction on job migration, if given processors 4×(1+MAXP×⌈|P|×MAXPmin{m1,m2,…,mt}⌉) times as fast. (Here MAXP and |P| are computed based on the resource sets that tasks request.) For the special case that each task requests at most one resource, the bound of LP-EE-vpr collapses to 4×(1+⌈|R|min{m1,m2,…,mt}⌉). To the best of our knowledge, LP-EE-vpr is the first algorithm with proven performance guarantee for real-time scheduling of sporadic tasks with resource sharing on t-type heterogeneous multiprocessors.

Optimal generation scheduling of wind-CSP systems in day-ahead electricity markets

This paper presents a coordination approach to maximize the total profit of wind power systems coordinated with concentrated solar power systems, having molten-salt thermal energy storage. Both systems are effectively handled by mixed-integer linear programming in the approach, allowing enhancement on the operational during non-insolation periods. Transmission grid constraints and technical operating constraints on both systems are modeled to enable a true management support for the integration of renewable energy sources in day-ahead electricity markets. A representative case study based on real systems is considered to demonstrate the effectiveness of the proposed approach. © IFIP International Federation for Information Processing 2015.

Optimal scheduling of aircrafts’ engines repair process

We address a real world scheduling problem concerning the repair process of aircrafts’ engines by TAP - Maintenance & Engineering (TAP-ME). TAP-ME is the maintenance, repair and overhaul organization of TAP Portugal, Portugal’s leading airline, which employs about 4000 persons to provide maintenance and engineering services in aircraft, engines and components. TAP-ME is aiming to optimize its maintenance services, focusing on the reduction of the engines repair turnaround time.