Oxorhenium Complexes Bearing the Water-Soluble Tris(pyrazol-1-yl)methanesulfonate, 1,3,5-Triaza-7-phosphaadamantane, or Related Ligands, as Catalysts for Baeyer-Villiger Oxidation of Ketones

New rhenium(VII or III) complexes [ReO3(PTA)(2)][ReO4] (1) (PTA = 1,3,5-triaza-7-phosphaadamantane), [ReO3(mPTA)][ReO4] (2) (mPTA = N-methyl-1,3,5-triaza-7-phosphaadamantane cation), [ReO3(HMT)(2)] [ReO4] (3) (HMT = hexamethylenetetramine), [ReO3(eta(2)-Tpm)(PTA)][ReO4] (4) [Tpm = hydrotris(pyrazol-1-yl)methane, HC(pz)(3), pz = pyrazolyl), [ReO3(Hpz)(HMT)][ReO4] (5) (Hpz = pyrazole), [ReO(Tpms)(HMT)] (6) [Tpms = tris(pyrazol-1-yl)methanesulfonate, O3SC(pz)(3)(-)] and [ReCl2{N2C(O)Ph} (PTA)(3)] (7) have been prepared from the Re(VII) oxide Re2O2 (1-6) or, in the case of 7, by ligand exchange from the benzoyldiazenido complex [ReCl2(N2C-(O)Ph}(Hpz)(PPh3)(2)], and characterized by IR and NMR spectroscopies, elemental analysis and electrochemical properties. Theoretical calculations at the density functional theory (DFT) level of theory indicated that the coordination of PTA to both Re(III) and Re(VII) centers by the P atom is preferable compared to the coordination by the N atom. This is interpreted in terms of the Re-PTA bond energy and hard-soft acid-base theory. The oxo-rhenium complexes 1-6 act as selective catalysts for the Baeyer-Villiger oxidation of cyclic and linear ketones (e.g., 2-methylcyclohexanone, 2-methylcyclopentanone, cyclohexanone, cyclopentanone, cyclobutanone, and 3,3-dimethyl-2-butanone or pinacolone) to the corresponding lactones or esters, in the presence of aqueous H2O2. The effects of a variety of factors are studied toward the optimization of the process.

Homogeneous and heterogenised new gold C-scorpionate complexes as catalysts for cyclohexane oxidation

Gold(III) complexes of type [AuCl2{eta(2)-RC(R'pz)(3)}]Cl [R = R' = H (1), R = CH2OH, R' = H (2) and R = H, R' = 3,5-Me-2(3), pz = pyrazol-1-yl] were supported on carbon materials (activated carbon, carbon xerogel and carbon nanotubes) and used for the oxidation of cyclohexane to cyclohexanol and cyclohexanone, with aqueous H2O2, under mild conditions.

A model for heterogeneous networks management and Performance evaluation

In general, modern networks are analysed by taking several Key Performance Indicators (KPIs) into account, their proper balance being required in order to guarantee a desired Quality of Service (QoS), particularly, cellular wireless heterogeneous networks. A model to integrate a set of KPIs into a single one is presented, by using a Cost Function that includes these KPIs, providing for each network node a single evaluation parameter as output, and reflecting network conditions and common radio resource management strategies performance. The proposed model enables the implementation of different network management policies, by manipulating KPIs according to users' or operators' perspectives, allowing for a better QoS. Results show that different policies can in fact be established, with a different impact on the network, e.g., with median values ranging by a factor higher than two.

Produção de biodiesel por catálise heterogénea

Mestrado em Engenharia Química. Ramo optimização energética na indústria química.

Produção de biodiesel via catálise heterogénea básica

Mestrado em Engenharia Química. Ramo Tecnologias de Protecção Ambiental.

On cluster analysis of complex and heterogeneous data

3rd SMTDA Conference Proceedings, 11-14 June 2014, Lisbon Portugal.

Heterogeneous kinetics of the reduction of chromium (VI) by elemental iron

Zero valent iron (ZVI) has been extensively used as a reactive medium for the reduction of Cr(VI) to Cr(III) in reactive permeable barriers. The kinetic rate depends strongly on the superficial oxidation of the iron particles used and the preliminary washing of ZVI increases the rate. The reaction has been primarily modelled using a pseudo-first-order kinetics which is inappropriate for a heterogeneous reaction. We assumed a shrinking particle type model where the kinetic rate is proportional to the available iron surface area, to the initial volume of solution and to the chromium concentration raised to a power ˛ which is the order of the chemical reaction occurring at surface. We assumed α= 2/3 based on the likeness to the shrinking particle models with spherical symmetry. Kinetics studies were performed in order to evaluate the suitability of this approach. The influence of the following parameters was experimentally studied: initial available surface area, chromium concentration, temperature and pH. The assumed order for the reaction was confirmed. In addition, the rate constant was calculated from data obtained in different operating conditions. Digital pictures of iron balls were periodically taken and the image treatment allowed for establishing the time evolution of their size distribution.

On the adaptation of broadcast transactions in token-passing fieldbus networks with heterogeneous transmission media

Broadcast networks that are characterised by having different physical layers (PhL) demand some kind of traffic adaptation between segments, in order to avoid traffic congestion in linking devices. In many LANs, this problem is solved by the actual linking devices, which use some kind of flow control mechanism that either tell transmitting stations to pause (the transmission) or just discard frames. In this paper, we address the case of token-passing fieldbus networks operating in a broadcast fashion and involving message transactions over heterogeneous (wired or wireless) physical layers. For the addressed case, real-time and reliability requirements demand a different solution to the traffic adaptation problem. Our approach relies on the insertion of an appropriate idle time before a station issuing a request frame. In this way, we guarantee that the linking devices’ queues do not increase in a way that the timeliness properties of the overall system turn out to be unsuitable for the targeted applications.

Assigning real-time tasks on heterogeneous multiprocessors with two unrelated types of processors

A preliminary version of this paper appeared in Proceedings of the 31st IEEE Real-Time Systems Symposium, 2010, pp. 239–248.

A PTAS for assigning sporadic tasks on two-type heterogeneous multiprocessors

Consider the problem of determining a task-toprocessor assignment for a given collection of implicit-deadline sporadic tasks upon a multiprocessor platform in which there are two distinct kinds of processors. We propose a polynomialtime approximation scheme (PTAS) for this problem. It offers the following guarantee: for a given task set and a given platform, if there exists a feasible task-to-processor assignment, then given an input parameter, ϵ, our PTAS succeeds, in polynomial time, in finding such a feasible task-to-processor assignment on a platform in which each processor is 1+3ϵ times faster. In the simulations, our PTAS outperforms the state-of-the-art PTAS [1] and also for the vast majority of task sets, it requires significantly smaller processor speedup than (its upper bound of) 1+3ϵ for successfully determining a feasible task-to-processor assignment.

Energy-conscious tasks partitioning onto a heterogeneous multi-core platform

Modern multicore processors for the embedded market are often heterogeneous in nature. One feature often available are multiple sleep states with varying transition cost for entering and leaving said sleep states. This research effort explores the energy efficient task-mapping on such a heterogeneous multicore platform to reduce overall energy consumption of the system. This is performed in the context of a partitioned scheduling approach and a very realistic power model, which improves over some of the simplifying assumptions often made in the state-of-the-art. The developed heuristic consists of two phases, in the first phase, tasks are allocated to minimise their active energy consumption, while the second phase trades off a higher active energy consumption for an increased ability to exploit savings through more efficient sleep states. Extensive simulations demonstrate the effectiveness of the approach.

Task assignment algorithms for two-type heterogeneous multiprocessors

Consider the problem of assigning real-time tasks on a heterogeneous multiprocessor platform comprising two different types of processors — such a platform is referred to as two-type platform. We present two linearithmic timecomplexity algorithms, SA and SA-P, each providing the follow- ing guarantee. For a given two-type platform and a given task set, if there exists a feasible task-to-processor-type assignment such that tasks can be scheduled to meet deadlines by allowing them to migrate only between processors of the same type, then (i) using SA, it is guaranteed to find such a feasible task-to- processor-type assignment where the same restriction on task migration applies but given a platform in which processors are 1+α/2 times faster and (ii) SA-P succeeds in finding 2 a feasible task-to-processor assignment where tasks are not allowed to migrate between processors but given a platform in which processors are 1+α/times faster, where 0<α≤1. The parameter α is a property of the task set — it is the maximum utilization of any task which is less than or equal to 1.

Provably good scheduling of sporadic tasks with resource sharing on a two-type heterogeneous multiprocessor platform

Consider the problem of scheduling a set of implicit-deadline sporadic tasks to meet all deadlines on a two-type heterogeneous multiprocessor platform where a task may request at most one of |R| shared resources. There are m1 processors of type-1 and m2 processors of type-2. Tasks may migrate only when requesting or releasing resources. We present a new algorithm, FF-3C-vpr, which offers a guarantee that if a task set is schedulable to meet deadlines by an optimal task assignment scheme that only allows tasks to migrate when requesting or releasing a resource, then FF-3Cvpr also meets deadlines if given processors 4+6*ceil(|R|/min(m1,m2)) times as fast. As far as we know, it is the first result for resource sharing on heterogeneous platforms with provable performance.

A conjecture about provably good task assignment on heterogeneous multiprocessor platforms but with a stronger adversary

Consider the problem of scheduling a set of implicit-deadline sporadic tasks to meet all deadlines on a heterogeneous multiprocessor platform. We use an algorithm proposed in [1] (we refer to it as LP-EE) from state-of-the-art for assigning tasks to heterogeneous multiprocessor platform and (re-)prove its performance guarantee but for a stronger adversary.We conjecture that if a task set can be scheduled to meet deadlines on a heterogeneous multiprocessor platform by an optimal task assignment scheme that allows task migrations then LP-EE meets deadlines as well with no migrations if given processors twice as fast. We illustrate this with an example.

Two-type heterogeneous multiprocessor scheduling: Is there a phase transition? (Extended Abstract)

Consider the problem of non-migratively scheduling a set of implicit-deadline sporadic tasks to meet all deadlines on a two-type heterogeneous multiprocessor platform. We ask the following question: Does there exist a phase transition behavior for the two-type heterogeneous multiprocessor scheduling problem? We also provide some initial observations via simulations performed on randomly generated task sets.