Solvent-free microwave-assisted peroxidative oxidation of alcohols catalyzed by Iron(III)-TEMPO catalytic systems

The iron(III) complexes [H(EtOH)][FeCl2(L)(2)] (1), [H(2)bipy](1/2)[FeCl2(L)(2)].DMF (2) and [FeCl2(L)(2,2'-bipy)] (3) (L = 3-amino-2-pyrazinecarboxylate; H(2)bipy = doubly protonated 4,4'-bipyridine; 2,2'-bipy = 2,2'-bipyridine, DMF = dimethylformamide) have been synthesized and fully characterized by IR, elemental and single-crystal X-ray diffraction analyses, as well as by electrochemical methods. Complexes 1 and 2 have similar mononuclear structures containing different guest molecules (protonated ethanol for 1 and doubly protonated 4,4'-bipyridine for 2) in their lattices, whereas the complex 3 has one 3-amino-2-pyrazinecarboxylate and a 2,2'-bipyridine ligand. They show a high catalytic activity for the low power (10 W) solvent-free microwave assisted peroxidative oxidation of 1-phenylethanol, leading, in the presence of TEMPO, to quantitative yields of acetophenone [TOFs up to 8.1 x 10(3) h(-1), (3)] after 1 h. Moreover, the catalysts are of easy recovery and reused, at least for four consecutive cycles, maintaining 83 % of the initial activity and concomitant rather high selectivity. 3-Amino-2-pyrazinecarboxylic acid is used to synthesize three new iron(III) complexes which act as heterogeneous catalysts for the solvent-free microwave-assisted peroxidative oxidation of 1-phenylethanol.

TV Recommendation and Personalization Systems: Integrating Broadcast and Video On-demand Services

he expansion of Digital Television and the convergence between conventional broadcasting and television over IP contributed to the gradual increase of the number of available channels and on demand video content. Moreover, the dissemination of the use of mobile devices like laptops, smartphones and tablets on everyday activities resulted in a shift of the traditional television viewing paradigm from the couch to everywhere, anytime from any device. Although this new scenario enables a great improvement in viewing experiences, it also brings new challenges given the overload of information that the viewer faces. Recommendation systems stand out as a possible solution to help a watcher on the selection of the content that best fits his/her preferences. This paper describes a web based system that helps the user navigating on broadcasted and online television content by implementing recommendations based on collaborative and content based filtering. The algorithms developed estimate the similarity between items and users and predict the rating that a user would assign to a particular item (television program, movie, etc.). To enable interoperability between different systems, programs characteristics (title, genre, actors, etc.) are stored according to the TV-Anytime standard. The set of recommendations produced are presented through a Web Application that allows the user to interact with the system based on the obtained recommendations.

Six sigma methodologies: implementation and impacts on Portuguese small and medium companies (SMES)

Artigo elaborador no âmbito dos trabalhos decorrentes à dissertação de Mestrado do Aluno David Leite, no Mestrado em Gestão Integrada Qualidade, Ambiente e Segurança, ESTGF-IPP, Oreintados pelos Professores Luís Fonseca (ISEP-IPP) e Vanda Lima (ESTGF-IPP).

Petri nets based components within globally asynchronous locally synchronous systems

Dissertação apresentada na Faculdade de Ciências e Tecnologias da Universidade Nova de Lisboa para a obtenção do grau de Mestre em Engenharia Electrotécnica e Computadores

Multiple Roots of Systems of Equations by Repulsion Merit Functions

In this paper we address the problem of computing multiple roots of a system of nonlinear equations through the global optimization of an appropriate merit function. The search procedure for a global minimizer of the merit function is carried out by a metaheuristic, known as harmony search, which does not require any derivative information. The multiple roots of the system are sequentially determined along several iterations of a single run, where the merit function is accordingly modified by penalty terms that aim to create repulsion areas around previously computed minimizers. A repulsion algorithm based on a multiplicative kind penalty function is proposed. Preliminary numerical experiments with a benchmark set of problems show the effectiveness of the proposed method.

Efficient schedulability tests for real-time embedded systems with urgent routines

Task scheduling is one of the key mechanisms to ensure timeliness in embedded real-time systems. Such systems have often the need to execute not only application tasks but also some urgent routines (e.g. error-detection actions, consistency checkers, interrupt handlers) with minimum latency. Although fixed-priority schedulers such as Rate-Monotonic (RM) are in line with this need, they usually make a low processor utilization available to the system. Moreover, this availability usually decreases with the number of considered tasks. If dynamic-priority schedulers such as Earliest Deadline First (EDF) are applied instead, high system utilization can be guaranteed but the minimum latency for executing urgent routines may not be ensured. In this paper we describe a scheduling model according to which urgent routines are executed at the highest priority level and all other system tasks are scheduled by EDF. We show that the guaranteed processor utilization for the assumed scheduling model is at least as high as the one provided by RM for two tasks, namely 2(2√−1). Seven polynomial time tests for checking the system timeliness are derived and proved correct. The proposed tests are compared against each other and to an exact but exponential running time test.