Static and hydrodynamic monitoring of citalopram based on its electro-oxidation behavior at a glassy-carbon surface

The electrooxidative behavior of citalopram (CTL) in aqueous media was studied by cyclic voltammetry (CV) and square-wave voltammetry (SWV) at a glassy-carbon electrode. The electrochemical behaviour of CTL involves two electrons and two protons in the irreversible and diffusion controlled oxidation of the tertiary amine group. The maximum analytical signal was obtained in a phosphate buffer (pH ¼ 8.2). For analytical purposes, an SWV method and a flow-injection analysis (FIA) system with amperometric detection were developed. The optimised SWV method showed a linear range between 1.10 10 5–1.20 10 4 molL 1, with a limit of detection (LOD) of 9.5 10 6 molL 1. Using the FIA method, a linear range between 2.00 10 6–9.00 10 5 molL 1 and an LODof 1.9 10 6 molL 1 were obtained. The validation of both methods revealed good performance characteristics confirming applicability for the quantification of CTL in several pharmaceutical products.

Static-priority scheduling of sporadic messages on a wireless channel

Consider the problem of scheduling sporadic messages with deadlines on a wireless channel. We propose a collision-free medium access control (MAC) protocol which implements static-priority scheduling and present a schedulability analysis technique for the protocol. The MAC protocol allows multiple masters and is fully distributed; it is an adaptation to a wireless channel of the dominance protocol used in the CAN bus. But unlike that protocol, our protocol does not require a node having the ability to receive an incoming bit from the channel while transmitting to the channel.

Static-priority scheduling over wireless networks with multiple broadcast domains

We propose a wireless medium access control (MAC) protocol that provides static-priority scheduling of messages in a guaranteed collision-free manner. Our protocol supports multiple broadcast domains, resolves the wireless hidden terminal problem and allows for parallel transmissions across a mesh network. Arbitration of messages is achieved without the notion of a master coordinating node, global clock synchronization or out-of-band signaling. The protocol relies on bit-dominance similar to what is used in the CAN bus except that in order to operate on a wireless physical layer, nodes are not required to receive incoming bits while transmitting. The use of bit-dominance efficiently allows for a much larger number of priorities than would be possible using existing wireless solutions. A MAC protocol with these properties enables schedulability analysis of sporadic message streams in wireless multihop networks.

Competitive analysis of static-priority partitioned scheduling on uniform multiprocessors

Consider the problem of scheduling a set of sporadically arriving tasks on a uniform multiprocessor with the goal of meeting deadlines. A processor p has the speed Sp. Tasks can be preempted but they cannot migrate between processors. On each processor, tasks are scheduled according to rate-monotonic. We propose an algorithm that can schedule all task sets that any other possible algorithm can schedule assuming that our algorithm is given processors that are √2 / √2−1 ≈ 3.41 times faster. No such guarantees are previously known for partitioned static-priority scheduling on uniform multiprocessors.

Global static-priority preemptive multiprocessor scheduling with utilization bound 38%

Consider the problem of scheduling real-time tasks on a multiprocessor with the goal of meeting deadlines. Tasks arrive sporadically and have implicit deadlines, that is, the deadline of a task is equal to its minimum inter-arrival time. Consider this problem to be solved with global static-priority scheduling. We present a priority-assignment scheme with the property that if at most 38% of the processing capacity is requested then all deadlines are met.

The utilization bound of static-priority preemptive partitioned multiprocessor scheduling is 50%

This paper studies static-priority preemptive scheduling on a multiprocessor using partitioned scheduling. We propose a new scheduling algorithm and prove that if the proposed algorithm is used and if less than 50% of the capacity is requested then all deadlines are met. It is known that for every static-priority multiprocessor scheduling algorithm, there is a task set that misses a deadline although the requested capacity is arbitrary close to 50%.

Determinação do teor de compostos aromáticos policíclicos de óleos minerais isolantes para transformadores

Mestrado em Engenharia Química - Ramo Optimização Energética na Indústria Química

A physical packing sequence algorithm for the container loading problem with static mechanical equilibrium conditions

The container loading problem (CLP) is a combinatorial optimization problem for the spatial arrangement of cargo inside containers so as to maximize the usage of space. The algorithms for this problem are of limited practical applicability if real-world constraints are not considered, one of the most important of which is deemed to be stability. This paper addresses static stability, as opposed to dynamic stability, looking at the stability of the cargo during container loading. This paper proposes two algorithms. The first is a static stability algorithm based on static mechanical equilibrium conditions that can be used as a stability evaluation function embedded in CLP algorithms (e.g. constructive heuristics, metaheuristics). The second proposed algorithm is a physical packing sequence algorithm that, given a container loading arrangement, generates the actual sequence by which each box is placed inside the container, considering static stability and loading operation efficiency constraints.

Use of a fluorescence-based approach to assess short-term responses of the alga Pseudokirchneriella subcapitata to metal stress

This work explores the use of fluorescent probes to evaluate the responses of the green alga Pseudokirchneriella subcapitata to the action of three nominal concentrations of Cd(II), Cr(VI), Cu(II) and Zn(II) for a short time (6 h). The toxic effect of the metals on algal cells was monitored using the fluorochromes SYTOX Green (SG, membrane integrity), fluorescein diacetate (FDA, esterase activity) and rhodamine 123 (Rh123, mitochondrial membrane potential). The impact of metals on chlorophyll a (Chl a) autofluorescence was also evaluated. Esterase activity was the most sensitive parameter. At the concentrations studied, all metals induced the loss of esterase activity. SG could be used to effectively detect the loss of membrane integrity in algal cells exposed to 0.32 or 1.3 μmol L−1 Cu(II). Rh123 revealed a decrease in the mitochondrial membrane potential of algal cells exposed to 0.32 and 1.3 μmol L−1 Cu(II), indicating that mitochondrial activity was compromised. Chl a autofluorescence was also affected by the presence of Cr(VI) and Cu(II), suggesting perturbation of photosynthesis. In conclusion, the fluorescence-based approach was useful for detecting the disturbance of specific cellular characteristics. Fluorescent probes are a useful diagnostic tool for the assessment of the impact of toxicants on specific targets of P. subcapitata algal cells.

Quality-of-service aware routing for static and mobile IPv6-based low-power and lossy sensor networks using RPL

The Internet of Things (IoT) has emerged as a paradigm over the last few years as a result of the tight integration of the computing and the physical world. The requirement of remote sensing makes low-power wireless sensor networks one of the key enabling technologies of IoT. These networks encompass several challenges, especially in communication and networking, due to their inherent constraints of low-power features, deployment in harsh and lossy environments, and limited computing and storage resources. The IPv6 Routing Protocol for Low Power and Lossy Networks (RPL) [1] was proposed by the IETF ROLL (Routing Over Low-power Lossy links) working group and is currently adopted as an IETF standard in the RFC 6550 since March 2012. Although RPL greatly satisfied the requirements of low-power and lossy sensor networks, several issues remain open for improvement and specification, in particular with respect to Quality of Service (QoS) guarantees and support for mobility. In this paper, we focus mainly on the RPL routing protocol. We propose some enhancements to the standard specification in order to provide QoS guarantees for static as well as mobile LLNs. For this purpose, we propose OF-FL (Objective Function based on Fuzzy Logic), a new objective function that overcomes the limitations of the standardized objective functions that were designed for RPL by considering important link and node metrics, namely end-to-end delay, number of hops, ETX (Expected transmission count) and LQL (Link Quality Level). In addition, we present the design of Co-RPL, an extension to RPL based on the corona mechanism that supports mobility in order to overcome the problem of slow reactivity to frequent topology changes and thus providing a better quality of service mainly in dynamic networks application. Performance evaluation results show that both OF-FL and Co-RPL allow a great improvement when compared to the standard specification, mainly in terms of packet loss ratio and average network latency. 2015 Elsevier B.V. Al