Ultrasound-assisted synthesis of functionalized 1,3-enynes by palladium-catalyzed cross-coupling reaction of alpha-styrylbutyltelluride with alkynyltrifluoroborate salts

An ultrasound-assisted synthesis of functionalized 1,3-enyne scaffolds is described and illustrated by palladium-catalyzed cross-coupling of potassium alkynyltrifluoroborate salts and alpha-styrylbutyltellurides. This procedure offers easy access to 1,3-enyne architecture that contains aliphatic and aromatic groups in good to excellent yields.

Mercury speciation in seafood samples by LC-ICP-MS with a rapid ultrasound-assisted extraction procedure: Application to the determination of mercury in Brazilian seafood samples

This paper describes a simple method for mercury speciation in seafood samples by LC-ICP-MS with a fast sample preparation procedure. Prior to analysis, mercury species were extracted from food samples with a solution containing mercaptoethanol, L-cysteine and HCl and sonication for 15 min. Separation of mercury species was accomplished in less than 5 min on a C8 reverse phase column with a mobile phase containing 0.05%-v/v mercaptoethanol, 0.4% m/v L-cysteine and 0.06 mol L(-1) ammonium acetate. The method detection limits were found to be 0.25, 0.20 and 0.1 ng g(-1) for inorganic mercury, ethylmercury and methylmercury, respectively. Method accuracy is traceable to Certified Reference Materials (DOLT-3 and DORM-3) from the National Research Council Canada (NRCC). With the proposed method there is a considerable reduction of the time of sample preparation. Finally, the method was applied for the speciation of mercury in seafood samples purchased from the Brazilian market. (C) 2010 Elsevier Ltd. All rights reserved.

Mercury speciation in whole blood by gas chromatography coupled to ICP-MS with a fast microwave-assisted sample preparation procedure

A simple and fast method is described for simultaneous determination of methylmercury (MeHg), ethylmercury (Et-Hg) and inorganic mercury (Ino-Hg) in blood samples by using capillary gas chromatography-inductively coupled plasma mass spectrometry (GC-ICP-MS) after derivatization and alkaline digestion. Closed-vessel microwave assisted digestion conditions with tetramethylammonium hydroxide (TMAH) have been optimized. Derivatization by using ethylation and propylation procedures have also been evaluated and compared. The absolute detection limits (using a 1 mu L injection) obtained by GC-ICP-MS with ethylation were 40 fg for MeHg and Ino-Hg, respectively, and with propylation were 50, 20 and 50 fg for MeHg, Et-Hg and Ino-Hg, respectively. Method accuracy is traceable to Standard Reference Material (SRM) 966 Toxic Metals in Bovine Blood from the National Institute of Standards and Technology (NIST). Additional validation is provided based on the comparison of results obtained for mercury speciation in blood samples with the proposed procedure and with a previously reported LC-ICP-MS method. With the new proposed procedure no tedious clean-up steps are required and a considerable improvement of the time of analysis was achieved compared to other methods using GC separation.

An improved seeded region growing algorithm

Recently Adams and Bischof (1994) proposed a novel region growing algorithm for segmenting intensity images. The inputs to the algorithm are the intensity image and a set of seeds - individual points or connected components - that identify the individual regions to be segmented. The algorithm grows these seed regions until all of the image pixels have been assimilated. Unfortunately the algorithm is inherently dependent on the order of pixel processing. This means, for example, that raster order processing and anti-raster order processing do not, in general, lead to the same tessellation. In this paper we propose an improved seeded region growing algorithm that retains the advantages of the Adams and Bischof algorithm fast execution, robust segmentation, and no tuning parameters - but is pixel order independent. (C) 1997 Elsevier Science B.V.

Prediction of MHC class II-binding peptides using an evolutionary algorithm and artificial neural network

Motivation: Prediction methods for identifying binding peptides could minimize the number of peptides required to be synthesized and assayed, and thereby facilitate the identification of potential T-cell epitopes. We developed a bioinformatic method for the prediction of peptide binding to MHC class II molecules. Results: Experimental binding data and expert knowledge of anchor positions and binding motifs were combined with an evolutionary algorithm (EA) and an artificial neural network (ANN): binding data extraction --> peptide alignment --> ANN training and classification. This method, termed PERUN, was implemented for the prediction of peptides that bind to HLA-DR4(B1*0401). The respective positive predictive values of PERUN predictions of high-, moderate-, low- and zero-affinity binder-a were assessed as 0.8, 0.7, 0.5 and 0.8 by cross-validation, and 1.0, 0.8, 0.3 and 0.7 by experimental binding. This illustrates the synergy between experimentation and computer modeling, and its application to the identification of potential immunotheraaeutic peptides.

A consistent point-searching algorithm for solution interpolation in unstructured meshes consisting of 4-node bilinear quadrilateral elements

To translate and transfer solution data between two totally different meshes (i.e. mesh 1 and mesh 2), a consistent point-searching algorithm for solution interpolation in unstructured meshes consisting of 4-node bilinear quadrilateral elements is presented in this paper. The proposed algorithm has the following significant advantages: (1) The use of a point-searching strategy allows a point in one mesh to be accurately related to an element (containing this point) in another mesh. Thus, to translate/transfer the solution of any particular point from mesh 2 td mesh 1, only one element in mesh 2 needs to be inversely mapped. This certainly minimizes the number of elements, to which the inverse mapping is applied. In this regard, the present algorithm is very effective and efficient. (2) Analytical solutions to the local co ordinates of any point in a four-node quadrilateral element, which are derived in a rigorous mathematical manner in the context of this paper, make it possible to carry out an inverse mapping process very effectively and efficiently. (3) The use of consistent interpolation enables the interpolated solution to be compatible with an original solution and, therefore guarantees the interpolated solution of extremely high accuracy. After the mathematical formulations of the algorithm are presented, the algorithm is tested and validated through a challenging problem. The related results from the test problem have demonstrated the generality, accuracy, effectiveness, efficiency and robustness of the proposed consistent point-searching algorithm. Copyright (C) 1999 John Wiley & Sons, Ltd.

Trial-of-antibiotic algorithm for the diagnosis of tuberculosis in a district hospital in a developing country with high HIV prevalence

OBJECTIVE: To evaluate a diagnostic algorithm for pulmonary tuberculosis based on smear microscopy and objective response to trial of antibiotics. SETTING: Adult medical wards, Hlabisa Hospital, South Africa, 1996-1997. METHODS: Adults with chronic chest symptoms and abnormal chest X-ray had sputum examined for Ziehl-Neelsen stained acid-fast bacilli by light microscopy. Those with negative smears were treated with amoxycillin for 5 days and assessed. Those who had not improved were treated with erythromycin for 5 days and reassessed. Response was compared with mycobacterial culture. RESULTS: Of 280 suspects who completed the diagnostic pathway, 160 (57%) had a positive smear, 46 (17%) responded to amoxycillin, 34 (12%) responded to erythromycin and 40 (14%) were treated as smear-negative tuberculosis. The sensitivity (89%) and specificity (84%) of the full algorithm for culture-positive tuberculosis were high. However, 11 patients (positive predictive value [PPV] 95%) were incorrectly diagnosed with tuberculosis, and 24 cases of tuberculosis (negative predictive value [NPV] 70%) were not identified. NPV improved to 75% when anaemia was included as a predictor. Algorithm performance was independent of human immunodeficiency virus status. CONCLUSION: Sputum smear microscopy plus trial of antibiotic algorithm among a selected group of tuberculosis suspects may increase diagnostic accuracy in district hospitals in developing countries.

Minimum-order stable recursive filter design via the genetic algorithm approach

In this paper, the minimum-order stable recursive filter design problem is proposed and investigated. This problem is playing an important role in pipeline implementation sin signal processing. Here, the existence of a high-order stable recursive filter is proved theoretically, in which the upper bound for the highest order of stable filters is given. Then the minimum-order stable linear predictor is obtained via solving an optimization problem. In this paper, the popular genetic algorithm approach is adopted since it is a heuristic probabilistic optimization technique and has been widely used in engineering designs. Finally, an illustrative example is sued to show the effectiveness of the proposed algorithm.

Heroin-assisted treatment as a response to the public health problem of opiate dependence

Injection drug use (involving the injection of illicit opiates) poses serious public health problems in many countries. Research has indicated that injection drug users are at higher risk for morbidity in the form of HIV/AIDS and Hepatitis B and C, and drug-related mortality, as well as increased criminal activity. Methadone maintenance treatment is the most prominent form of pharmacotherapy treatment for illicit opiate dependence in several countries, and its application varies internationally with respect to treatment regulations and delivery modes. In order to effectively treat those patients who have previously been resistant to methadone maintenance treatment, several countries have been studying and/or considering heroin-assisted treatment as a complementary form of opiate pharmacotherapy treatment. This paper provides an overview of the prevalence of injection drug use and the opiate dependence problem internationally, the current opiate dependence treatment landscape in several countries, and the status of ongoing or planned heroin-assisted treatment trials in Australia, Canada and certain European countries.

An equivalent algorithm for simulating thermal effects of magma intrusion problems in porous rocks

An equivalent algorithm is proposed to simulate thermal effects of the magma intrusion in geological systems, which are composed of porous rocks. Based on the physical and mathematical equivalence, the original magma solidification problem with a moving boundary between the rock and intruded magma is transformed into a new problem without the moving boundary but with a physically equivalent heat source. From the analysis of an ideal solidification model, the physically equivalent heat source has been determined in this paper. The major advantage in using the proposed equivalent algorithm is that the fixed finite element mesh with a variable integration time step can be employed to simulate the thermal effect of the intruded magma solidification using the conventional finite element method. The related numerical results have demonstrated the correctness and usefulness of the proposed equivalent algorithm for simulating the thermal effect of the intruded magma solidification in geological systems. (C) 2003 Elsevier B.V. All rights reserved.

A spectral clustering algorithm for manufacturing cell formation

A graph clustering algorithm constructs groups of closely related parts and machines separately. After they are matched for the least intercell moves, a refining process runs on the initial cell formation to decrease the number of intercell moves. A simple modification of this main approach can deal with some practical constraints, such as the popular constraint of bounding the maximum number of machines in a cell. Our approach makes a big improvement in the computational time. More importantly, improvement is seen in the number of intercell moves when the computational results were compared with best known solutions from the literature. (C) 2009 Elsevier Ltd. All rights reserved.

Facultative autogamy in Cyrtopodium polyphyllum (Orchidaceae) through a rain-assisted pollination mechanism

Cyrtopodium includes similar to 42 species, among which is Cyrtopodium polyphyllum (Vell.) Pabst ex F. Barros that occurs in a rainforest in south-eastern Brazil. Its non-rewarding flowers, which attract Centridini bees by deceit, are rain-assisted self-pollinated, a phenomenon rarely found in orchids and other plant families. In addition, self-pollination has never been reported in Cyrtopodiinae and data on the pollination of South American orchids are scarce. Flowers were observed at different times of the day, on both sunny and rainy days, to record floral morphology, visitors and the effects of rainfall on flowers. On rainy days, water accumulates on the stigma and dissolves the adhesive substance of the stigmatic surface. A viscous drop thus forms, which contacts the pollinarium. When evaporation makes the viscous drop shrink, the drop moves the pollinarium with the anther onto the stigmatic surface and promotes self-pollination. Fruit set in natural habitat was low, with 2.4% at one study site, where a similar value (2.2%) was recorded in flowers self-pollinated by rain. In C. polyphyllum, facultative self-pollination assisted by rain is thus an important strategy that guarantees fruit set when pollinator`s visits are scarce, which is common in species pollinated by deceit.

Self-assembled naphthalenediimide derivative films for light-assisted electrochemical reduction of oxygen

This naphthalene diimide derivative, DC18, forms highly conjugated semiconducting stacked assemblies over electrodes after electrochemical conditioning. These molecular materials are very efficient towards electrochemical photoreduction of oxygen under visible light.

A new algorithm and refined bounds for extended gcd computation

Extended gcd computation is interesting itself. It also plays a fundamental role in other calculations. We present a new algorithm for solving the extended gcd problem. This algorithm has a particularly simple description and is practical. It also provides refined bounds on the size of the multipliers obtained.

The Qu-Prolog unification algorithm: Formalisation and correctness

Qu-Prolog is an extension of Prolog which performs meta-level computations over object languages, such as predicate calculi and lambda-calculi, which have object-level variables, and quantifier or binding symbols creating local scopes for those variables. As in Prolog, the instantiable (meta-level) variables of Qu-Prolog range over object-level terms, and in addition other Qu-Prolog syntax denotes the various components of the object-level syntax, including object-level variables. Further, the meta-level operation of substitution into object-level terms is directly represented by appropriate Qu-Prolog syntax. Again as in Prolog, the driving mechanism in Qu-Prolog computation is a form of unification, but this is substantially more complex than for Prolog because of Qu-Prolog's greater generality, and especially because substitution operations are evaluated during unification. In this paper, the Qu-Prolog unification algorithm is specified, formalised and proved correct. Further, the analysis of the algorithm is carried out in a frame-work which straightforwardly allows the 'completeness' of the algorithm to be proved: though fully explicit answers to unification problems are not always provided, no information is lost in the unification process.