On-Line Coupling of Separation Techniques to NMR

The hyphenation of chromatographic separation techniques with NMR spectroscopy is one of the most powerful and time-saving methods for the separation and structural elucidation of unknown compounds and molecular compositions of mixtures. Most of the routinely used NMR flow-cells have detection volumes between 40–180 μL for conventional separations with analytical columns, and the newest designs employ detection volumes in the order of 200 nL for capillary separations. The low flow rates used in capillary chromatography permit the use of deuterated solvents. Unequivocal structural assignment of unknown chromatographic peaks is possible by two-dimensional stopped-flow capillary HPLC-NMR experiments.     

Efficient acid catalytic synthesis of pyrazolopyrimidines from 1H-pyrazol-5-yl-N,N-dimethylformamidines with cyanamide

The efficient acid catalytic synthesis of pyrazolo [3,4-d]pyrimidine was developed by treating 1H-pyrazol-5-yl-N,N-dimethylformamidine with various aminating agents including N,O-bis(trimethylsilyl)hydroxylamine (NHSiMe₃(OSiMe₃)), cyanamide (NH₂CN), hydroxylamine (NH₂OH), methoxyamine (NH₂OMe), hydrazine (NH₂NH₂), and urea (NH₂C(O)NH₂) in acidic solution at reflux. Based on the experimental result, cyanamide (NH₂CN) and methanesulfonic acid were indicated the best aminating agent and acid mediated solvent. On the other hands, the reactivity tendency was involved the activity of original leaving species grafting on the aminating agents, such as –OH, –OMe, –OSiMe₃, –NH₂, –OSiMe₃, –C(O)NH₂, and –CN, in acid catalytic heterocyclic reaction.     

Role of Microporosity of Activated Carbons on Their Adsorption Abilities for Phenols and Dyes

The amounts of adsorption of two commercial dyes, phenol, and 4-chlorophenol from water on activated carbons were measured at 30°C. The carbons were prepared from cane (bagasse) piths and were activated by steam. The activation temperature and time were in the ranges of 750–840°C and 2 h, respectively. It was shown that the isotherm data of all four solutes could be well fitted by the Langmuir equation under the conditions studied. The adsorption capacities of the solutes were correlated with the microporosity properties of the activated carbons including micropore volume and external surface area. Finally, the adsorption characteristics of the present carbons was compared with those prepared from various agricultural wastes.     

Electrical interaction between two cylinders with an ion-penetrable charged membrane in an oil/water interface

The electrical interaction between two long, parallel cylinders each is covered by an ion-penetrable charged membrane immersed in an oil/water interface is investigated. The effects of contact angle, radius of cylinder, and membrane thickness on the electrical interaction force are examined. The results of numerical simulation reveal that the following conditions lead to a greater electrical interaction force: (i) a larger contact angle, i.e. a larger fraction of a cylinder in the oil phase; (ii) a larger cylinder radius; and (iii) a thinner membrane. For a fixed ionic strength, the electrical interaction force is insensible to the type of electrolytes in the water phase, in general. However, if two cylinders are close enough, then the higher the valence of counterions the greater the electrical interaction force.     

Electrophoretic mobility of a particle covered with an ion-penetrable membrane

The electrophoretic behavior of a planar particle covered by an ion-penetrable membrane, which simulates a biological entity, is investigated. We show that, in general, a point charge model will overestimate the electrophoretic mobility of a particle and the deviation increases with the increase in the concentration of fixed charge and with the decrease in the thickness of membrane layer. As in the case of a point charge model, the present model also predicts a local maximum in the absolute mobility as the thickness of membrane layer varies. If the sizes of counterions of various valences are the same, then the lower the valence of counterions, the larger the mobility, and the larger the counterions, the greater the mobility. The latter is consistent with the experimental observations in the literature. For the level of the concentration of fixed charge examined, the effect of coions on the mobility is negligible.     

Regulation of electroosmotic flow and electrophoretic mobility of proteins for concentration without desalting

Proteins were concentrated and separated in 0.6% poly(ethylene oxide) (PEO) solution using a capillary filled with Tris-borate (TB) buffer prior to analysis and detected by laser-induced native fluorescence using a pulsed Nd:YAG laser. During the concentration and separation, PEO solution entered the capillary by electroosmotic flow. When proteins dissolved in high salts (phosphate-buffered saline) were separated using 0.6% PEO solution prepared in 200 mM TB buffer, pH 9.0, the limits of detection (LODs) at signal-to noise ratios=3 for carbonic anhydrase (CA) and alpha-lactalbumin (alpha-lac) were on the levels of sub microM and microM, respectively. The LOD values compared to those obtained in 38 mM TB buffer were relatively high, which is likely due to salt quenching, Joule heating and poor stacking. To improve sensitivity for analysis of proteins in high-conductivity media, two on-line concentration approaches without desalting were developed. When using a capillary filled with 1.5 M TB buffer, pH 10.0, and PEO solution prepared in 800 mM TB buffer, pH 9.0, the LOD values for CA and alpha-lac were 13.8 nM and 126.0 nM, respectively, which were about 4.7 and 11.2-fold sensitivity enhancements compared to those obtained by a conventional hydrodynamic injection (30 cm height for 10 s), respectively. The sensitivity was further improved by injecting a short plug of low pH buffer after protein injection using a capillary filled with 1.5 M TB buffer, pH 10.0, and PEO solution prepared in 400 mM TB buffer, pH 9.0. A linear relationship between the peak height and the injection volume up to 0.81 microl was obtained and the LOD values for CA and alpha-lac were down to 4.7 and 37.8 nM.     

The average performance of a parallel stable marriage algorithm

In this paper, Tseng and Lee's parallel algorithm to solve the stable marriage prolem is analyzed. It is shown that the average number of parallel proposals of the algorithm is of ordern by usingn processors on a CREW PRAM, where each parallel proposal requiresO(loglog(n) time on CREW PRAM by applying the parallel selection algorithms of Valiant or Shiloach and Vishkin. Therefore, our parallel algorithm requiresO(nloglog(n)) time. The speed-up achieved is log(n)/loglog(n) since the average number of proposals required by applying McVitie and Wilson's algorithm to solve the stable marriage problem isO(nlog(n)).     

A Simple Approach for Multi‐fidelity Experimentation Applied to Financial Engineering

In practical applications, information about the accuracy or ‘fidelity’ of alternative surrogate systems may be ambiguous and difficult to determine. To address this problem, we propose to treat surrogate system fidelity level as a categorical factor in optimal response surface design. To design the associated experiments, we apply the Expected Integrated Mean Squared Error optimal design criterion, which takes into account both variance and bias errors. The performance of the proposed design was compared using three test cases to four types of alternatives using the Empirical Integrated Squared Error. Because of its ability to foster relatively accurate predictions, the proposed design is recommended in fidelity experimental design, particularly when the experimenters lack sufficient information about the fidelity levels of surrogate systems. The method was applied to the case of intraday trading optimization in which data were collected from the Taiwan Futures Exchange. We also calculated the implied volatility from the Merton's Jump‐diffusion model via the fast Fourier transform algorithm with three different models of varying fidelity levels. Copyright © 2014 John Wiley & Sons, Ltd.     

Rough set theory: a novel approach for extraction of robust decision rules based on incremental attributes

Rough set theory is a new data mining approach to manage vagueness. It is capable to discover important facts hidden in the data. Literature indicate the current rough set based approaches can’t guarantee that classification of a decision table is credible and it is not able to generate robust decision rules when new attributes are incrementally added in. In this study, an incremental attribute oriented rule-extraction algorithm is proposed to solve this deficiency commonly observed in the literature related to decision rule induction. The proposed approach considers incremental attributes based on the alternative rule extraction algorithm (AREA), which was presented for discovering preference-based rules according to the reducts with the maximum of strength index (SI), specifically the case that the desired reducts are not necessarily unique since several reducts could include the same value of SI. Using the AREA, an alternative rule can be defined as the rule which holds identical preference to the original decision rule and may be more attractive to a decision-maker than the original one. Through implementing the proposed approach, it can be effectively operating with new attributes to be added in the database/information systems. It is not required to re-compute the updated data set similar to the first step at the initial stage. The proposed algorithm also excludes these repetitive rules during the solution search stage since most of the rule induction approaches generate the repetitive rules. The proposed approach is capable to efficiently and effectively generate the complete, robust and non-repetitive decision rules. The rules derived from the data set provide an indication of how to effectively study this problem in further investigations.     

On the convergence of the exponential multiplier method for convex programming

In this paper, we analyze the exponential method of multipliers for convex constrained minimization problems, which operates like the usual Augmented Lagrangian method, except that it uses an exponential penalty function in place of the usual quadratic. We also analyze a dual counterpart, the entropy minimization algorithm, which operates like the proximal minimization algorithm, except that it uses a logarithmic/entropy proximal term in place of a quadratic. We strengthen substantially the available convergence results for these methods, and we derive the convergence rate of these methods when applied to linear programs.Research supported by the National Science Foundation under Grant DDM-8903385, and the Army Research Office under Grant DAAL03-86-K-0171.