Improved formic acid oxidation using electrodeposited Pd–Cd electrocatalysts in sulfuric acid solution

In the present research, nanostructured Pd–Cd alloy electrocatalysts with different compositions were produced using the electrodeposition process. The morphology of the samples was studied by scanning electron microscopy analysis. Also, the elemental composition of the samples was determined by energy-dispersive X-ray spectroscopy and elemental mapping tests. Tafel polarization and electrochemical impedance spectroscopy methods were employed to determine the electrochemical corrosion properties of the synthesized samples in a solution containing 0.5 M sulfuric acid and 0.1 M formic acid. The linear sweep voltammetry, cyclic voltammetry, and chronoamperometry techniques were also employed to evaluate the electrocatalytic activity of prepared samples toward the oxidation of formic acid. In this respect, the influence of some factors such as formic acid and sulfuric acid concentrations and also potential scan rate was investigated. Compared to the pure Pd sample, the Pd–Cd samples were more reactive for the oxidation of formic acid. Besides, the sample with a lower amount of Pd (Pd_1·3Cd) demonstrated much higher electrocatalytic activity than the Pd_7·1Cd and Pd_2·1Cd samples. The observed high mass activity of 15.06 A mg^?1_Pd for the Pd_1·3Cd sample which is 21.1 times higher than Pd/C is an interesting result of this study.     

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.     

Performance analysis of support vector machines classifiers in breast cancer mammography recognition

Support vector machine (SVM) is a supervised machine learning approach that was recognized as a statistical learning apotheosis for the small-sample database. SVM has shown its excellent learning and generalization ability and has been extensively employed in many areas. This paper presents a performance analysis of six types of SVMs for the diagnosis of the classical Wisconsin breast cancer problem from a statistical point of view. The classification performance of standard SVM (St-SVM) is analyzed and compared with those of the other modified classifiers such as proximal support vector machine (PSVM) classifiers, Lagrangian support vector machines (LSVM), finite Newton method for Lagrangian support vector machine (NSVM), Linear programming support vector machines (LPSVM), and smooth support vector machine (SSVM). The experimental results reveal that these SVM classifiers achieve very fast, simple, and efficient breast cancer diagnosis. The training results indicated that LSVM has the lowest accuracy of 95.6107 %, while St-SVM performed better than other methods for all performance indices (accuracy = 97.71 %) and is closely followed by LPSVM (accuracy = 97.3282). However, in the validation phase, the overall accuracies of LPSVM achieved 97.1429 %, which was superior to LSVM (95.4286 %), SSVM (96.5714 %), PSVM (96 %), NSVM (96.5714 %), and St-SVM (94.86 %). Value of ROC and MCC for LPSVM achieved 0.9938 and 0.9369, respectively, which outperformed other classifiers. The results strongly suggest that LPSVM can aid in the diagnosis of breast cancer.     

Characterization of minocycline loaded chitosan/polyethylene glycol/glycerol blend films as antibacterial wound dressings

Wound care has been a challenging subject for medical teams and researchers. Bacterial infections are one of the most serious complications in injured skins that often affect healing process. Antibacterial wound dressings can be used to facilitate wound healing process. The purpose of this study is to fabricate chitosan (Chito)/polyethylene glycol (PEG) antibacterial wound dressing doped with minocycline, and to evaluate the influence of composition ratio on the blending properties of the films. To improve the mechanical properties of these films, we examined various amounts of glycerol as a plasticizer. Moreover, we investigated morphological and mechanical aspects, water uptake, degradation, water vapor transmission and wettability properties of the films prepared with various ratios of Chito/PEG/Gly. Assessment of mechanical properties revealed that film containing 80:20 ratio Chito/PEG with 40 PHR Gly content exhibits the highest ultimate tensile strength and elongation at break (9.74 MPa and 45.73% respectively). Furthermore, results demonstrated that upon increasing PEG and Gly contents, degradability and hydrophilicity of the films increased whereas water uptake decreased. Water vapor transmission rate of the films was close to the range of 530–1200 g/m²d, indicating that the as formed films are possible candidates for dressing low exudate wounds or burns. Minocycline loaded films exhibited a biphasic drug release profile and it was more effective on gram-positive bacteria than on gram-negative bacteria. The polymeric film with the highest amount of loaded drug (2%) exhibited insignificant cytotoxicity (88%) against normal fibroblast cell line.     

A Sliding Mode Controller Based on Robust Model Reference Adaptive Proportional-integral Control for Stand-alone Three-phase Inverter

This paper proposes a sliding mode controller based on robust model reference adaptive proportional-integral (RMRA-PI) control for a stand-alone voltage source inverter (SA-VSI). The proposed controller has two control loops where the coefficients of PI controller are regulated by the adaptive sliding law. This method is used to regulate the output voltage of the inverter under different load conditions and uncertainty, and adapts the output to the reference model to reduce the total harmonic distortion (THD). In this paper, the stability of the proposed controller is proven by using Lyapunov’s theory and Barbalet’s lemma. The proposed controller performs well in voltage regulation such as low THD under sudden load change and uncertainty. Also, the results of the proposed controller are compared with PI controller to show the effectiveness of the presented control system.     

Discrete modeling of sand–tire mixture considering grain-scale deformability

Mixing sand or soil with small pieces of tire is common practice in civil engineering applications. Although the properties of the soil are changed, it is environmentally friendly and sometimes economical. Nevertheless, the mechanical behavior of such mixtures is still not fully understood and more numerical investigations are required. This paper presents a novel approach for the modeling of sand–tire mixtures based on the discrete element method. The sand grains are represented by rigid agglomerates whereas the tire grains are represented by deformable agglomerates. The approach considers both grain shape and deformability. The micromechanical parameters of the contact law are calibrated based on experimental results from the literature. The effects of tire content and confining pressure on the stress–strain response are investigated in detail by performing numerical triaxial compression tests. The main results indicate that both strength and stiffness of the samples decrease with increasing tire content. A tire contact of 40% is identified as the boundary between rubber-like and sand-like behavior.     

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.