Study of the effect of BDMA catalyst in the epoxy novolac curing process by isothermal DSC

Epoxy novolac/anhydride cure kinetics has been studied by differential scanning calorimetry under isothermal conditions. The system used in this study was an epoxy novolac resin (DEN431), with nadic methyl anhydride as hardener and benzyldimethylamine as accelerator. Kinetic parameters including the reaction order, activation energy and kinetic rate constants, were investigated. The cure reaction was described with the catalyst concentration, and a normalized kinetic model developed for it. It is shown that the cure reaction is dependent on the cure temperature and catalyst concentration, and that it proceeds through an autocatalytic kinetic mechanism. The curing kinetic constants and the cure activation energies were obtained using the Arrhenius kinetic model. A suggested kinetic model with a diffusion term was successfully used to describe and predict the cure kinetics of epoxy novolac resin compositions as a function of the catalyst content and temperature. Copyright © 2003 Society of Chemical Industry     

Truthful Approximation Mechanisms for Scheduling Selfish Related Machines

We consider the problem of scheduling jobs on related machines owned by selfish agents. We provide a 5-approximation deterministic truthful mechanism, the first deterministic truthful result for the problem. Previously, Archer and Tardos showed a 2-approximation randomized mechanism which is truthful in expectation only (a weaker notion of truthfulness). In case the number of machines is constant, we provide a deterministic Fully Polynomial-Time Approximation Scheme (FPTAS) and a suitable payment scheme that yields a truthful mechanism for the problem. This result, which is based on converting FPTAS to monotone FPTAS, improves a previous result of Auletta et al., who showed a (4 + ε)-approximation truthful mechanism.     

The marginal cost of CO2 emissions

Haraden's model for estimating the economic cost of global warming is analysed. We change his method of discounting and some of his input parameters in a manner consistent with physical and economic theory as well as empirical data. We then find much higher costs than Haraden found. These costs are compared to the cost of reducing CO₂ emissions and we find that deep cuts of the emissions of CO₂ are preferable. A check of the sensitivity of our results with respect to some crucial parameter values does not alter that conclusion.     

Hormonal changes during a 20-week confinement

BACKGROUND: When the European Space Agency planned the EUROMIR'95 long-duration flight with a European astronaut on board the Russian orbital MIR station, it organized simultaneously a ground simulation, called the Human Behaviour Study, of this manned space mission. The ground simulation was a confinement experiment, and this paper describes the changes in volume-regulating hormones that occurred during and after 20 weeks of confinement. METHODS: In a normobaric diving chamber, 3 subjects were confined for 135 d. Arterial pressure, plasma concentrations of blood volume-regulating hormones (active renin and arginine-vasopressin), and urinary variables (aldosterone, arginine-vasopressin, and metabolites of catecholamines) were measured before, during, and after confinement. RESULTS: Arterial pressure was increased from week 1 until week 15 of confinement, while heart rate was elevated from week 6 until the end of the simulation. Plasma active renin was elevated throughout the confinement (after week 6). Urine volume increased transitively on the first 2 d of confinement. CONCLUSIONS: The results obtained during this long-term confinement experiment have major importance regarding concerns about spaceflight and bed rest data, because we observed hormonal changes during the experiment that normally are assigned to the fluid shift that occurs in weightlessness or in the head-down tilt position (i.e., an increase of renin, an increase of urinary volume during the first two days, and a decreased urinary cyclic guanosine monophosphate.     

Buffer Management for Colored Packets with Deadlines

We consider buffer management of unit packets with deadlines for a multi-port device with reconfiguration overhead. The goal is to maximize the throughput of the device, i.e., the number of packets delivered by their deadline. For a single port or with free reconfiguration, the problem reduces to the well-known packets scheduling problem, where the celebrated earliest-deadline-first (EDF) strategy is optimal 1-competitive. However, EDF is not 1-competitive when there is a reconfiguration overhead. We design an online algorithm that achieves a competitive ratio of 1−o(1) when the ratio between the minimum laxity of the packets and the number of ports tends to infinity. This is one of the rare cases where one can design an almost 1-competitive algorithm. One ingredient of our analysis, which may be interesting on its own right, is a perturbation theorem on EDF for the classical packets scheduling problem. Specifically, we show that a small perturbation in the release and deadline times cannot significantly degrade the optimal throughput. This implies that EDF is robust in the sense that its throughput is close to the optimum even when the deadlines are not precisely known.     

A Preemptive Algorithm for Maximizing Disjoint Paths on Trees

We consider the on-line version of the maximum vertex disjoint path problem when the underlying network is a tree. In this problem, a sequence of requests arrives in an on-line fashion, where every request is a path in the tree. The on-line algorithm may accept a request only if it does not share a vertex with a previously accepted request. The goal is to maximize the number of accepted requests. It is known that no on-line algorithm can have a competitive ratio better than Ω(log n) for this problem, even if the algorithm is randomized and the tree is simply a line. Obviously, it is desirable to beat the logarithmic lower bound. Adler and Azar (Proc. of the 10th ACM-SIAM Symposium on Discrete Algorithm, pp. 1–10, 1999) showed that if preemption is allowed (namely, previously accepted requests may be discarded, but once a request is discarded it can no longer be accepted), then there is a randomized on-line algorithm that achieves constant competitive ratio on the line. In the current work we present a randomized on-line algorithm with preemption that has constant competitive ratio on any tree. Our results carry over to the related problem of maximizing the number of accepted paths subject to a capacity constraint on vertices (in the disjoint path problem this capacity is 1). Moreover, if the available capacity is at least 4, randomization is not needed and our on-line algorithm becomes deterministic.     

Control of Variation by Reward Probability.

Two bar-press experiments with rats tested the rule that reducing expectation of reward increases the variation from which reward selects. Experiment 1 used a discrete-trial random-interval schedule, with trials signaled by light or sound. One signal always ended with reward; the other signal ended with reward less often. The 2 signals were randomly mixed. Bar-press duration (how long the bar was held down) varied more during the signal with the lower probability of reward. Experiment 2 closely resembled Experiment 1 but used a random-ratio schedule rather than a random-interval schedule. Again, bar-press duration varied more during the signal with the lower probability of reward. The results support the rule--the first well-controlled comparisons to do so. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Temporary Tasks Assignment Resolved

Among all basic on-line load balancing problems, the only unresolved problem was load balancing of temporary tasks on unrelated machines. This open problem existed for almost a decade, see [12]. We resolve this problem by providing an inapproximability result. In addition, a newer open question is to identify the dependency of the competitive ratio on the durations of jobs in the case where durations are known. We resolve this problem by characterizing this dependency. Finally, we provide a PTAS for the off-line problem with a fixed number of machines and show a 2 -inapproximability result for the general case.     

From trips to telcos — next generation service portals

A number of multi-billion dollar businesses (for example Dell, Amazon, Expedia and Google) have been built on top of Web portals that provide customers with a differentiating experience. How do these portals achieve this, and what lessons can BT learn? In this paper we describe technology that supports the development of portals which extend and improve the customer’s experience of interacting with a company by breaking away from the direct manipulation metaphor. We illustrate the approach with a case study and describe the results of the work we have done in terms of the limitations and capabilities of the approach developed.     

Linear model-based estimation of blood pressure and cardiac output for Normal and Paranoid cases

Provisioning a generic simple linear mathematical model for Paranoid and Healthy cases leading to auxiliary investigation of the neuroleptic drugs effect imposed on cardiac output (CO) and blood pressure (BP). Multi-input single output system identification in consistency with the Z-Transform is considered an essential role in the exploration of linear discrete system identification. Twenty Paranoid and 20 Healthy peer cases have been chosen to lie under study. The generated CO model forming two poles and two zeros produced a root–mean-squared error (RMSE) of 0.109 and an average RMSE of 1.39 due to Paranoid cases. On the other hand, Healthy cases obtained model held three poles and two zeros with RMSE equal to 0.17 and an average of 0.63. The BP model with four poles and two zeros showed a 2.15 and 21.69 for RMSE and an average RMSE, respectively, for Paranoid cases, whereas seven poles and two zeros provided an RMSE of 5.7 and an average RMSE of 17.19 for Healthy cases. The obtained results were provided a generic models of CO with promising outcomes for Paranoid and Healthy cases. Moreover, the BP model has less and yet acceptable results in both Paranoid and Healthy cases.