An all-substrings common subsequence algorithm

Given two strings A and B of lengths n(a) and n(b), n(a) <= n(b), respectively, the all-substrings longest common subsequence (ALCS) problem obtains, for every substring B` of B, the length of the longest string that is a subsequence of both A and B. The ALCS problem has many applications, such as finding approximate tandem repeats in strings, solving the circular alignment of two strings and finding the alignment of one string with several others that have a common substring. We present an algorithm to prepare the basic data structure for ALCS queries that takes O(n(a)n(b)) time and O(n(a) + n(b)) space. After this preparation, it is possible to build that allows any LCS length to be retrieved in constant time. Some trade-offs between the space required and a matrix of size O(n(b)(2)) the querying time are discussed. To our knowledge, this is the first algorithm in the literature for the ALCS problem. (C) 2007 Elsevier B.V. All rights reserved.

A new approach to organomanganese compounds: the tellurium/manganese exchange reaction

Diorganomanganese compounds react with aryl, vinyl, and alkynyl tellurides in a tellurium/manganese exchange reaction. The new mixed organomanganese reagents react selectively with electrophiles. (C) 2010 Published by Elsevier Ltd.

Solvatochromism in Binary Mixtures: First Report on a Solvation Free Energy Relationship between Solvent Exchange Equilibrium Constants and the Properties of the Medium

We have employed UV-vis spectroscopy in order to investigate details of the solvation of six solvatochromic indicators, hereafter designated as ""probes"", namely, 2,6-diphenyl-4-(2,4,6-triphenylpyridinium-1-yl) phenolate (RB); 4-[(E)-2-(1-methylpyridinium-4-yl)ethenyl] phenolate, MePM; 1-methylquinolinium-8-olate, QB; 2-bromo-4-[(E)-2-(1-methylpyridinium-4-yl)ethenyl] phenolate, MePMBr, 2,6-dichloro-4-(2,4,6-triphenylpyridinium-1-yl) phenolate (WB); and 2,6-dibromo-4-[(E)-2-(1-methylpyridinium-4-yl)ethenyl] phenolate, MePMBr,, respectively. These can be divided into three pairs, each includes two probes of similar pK(a) in water and different lipophilicity. Solvation has been studied in binary mixtures, BMs, of water, W, with 12 protic organic solvents, S, including mono- and bifunctional alcohols (2-alkoxyethanoles, unsaturated and chlorinated alcohols). Each medium was treated as a mixture of S, W, and a complex solvent, S-W, formed by hydrogen bonding. Values of lambda(max) (of the probe intramolecular charge transfer) were converted into empirical polarity scales, E(T)(probe) in kcal/mol, whose values were correlated with the effective mole fraction of water in the medium, chi w(effective). This correlation furnished three equilibrium constants for the exchange of solvents in the probe solvation shell; phi(W/S) (W substitutes S): phi(S-W/W) (S-W substitutes W), and phi(S-W/S) (S-W substitutes S), respectively. The values of these constants depend on the physicochemical properties of the probe and the medium. We tested, for the first time, the applicability of a new solvation free energy relationship: phi = constant + a alpha(BM) + b beta(BM) + s(pi*(BM) + d delta) + p log P(BM), where a, b, s, and p are regression coefficients alpha(BM), beta(BM), and pi*(BM) are solvatochromic parameters of the BM, delta is a correction term for pi*, and log P is an empirical scale of lipophilicity. Correlations were carried out with two-, three-, and four-medium descriptors. In all cases, three descriptors gave satisfactory correlations; use of four parameters gave only a marginal increase of the goodness of fit. For phi(W/S), the most important descriptor was found to be the lipophilicity of the medium; for phi(S-W/W) and phi(S-W/S), solvent basicity is either statistically relevant or is the most important descriptor. These responses are different from those of E(T)(probe) of many solvatochromic indicators in pure solvents, where the importance of solvent basicity is usually marginal, and can be neglected.

Functional Expression of Chemoreceptors with the Help of a Guanine Nucleotide Exchange Factor

Odorant receptors and other chemoreceptors are usually poorly expressed in the plasma membrane of heterologous cells. A key point of regulation in G protein-mediated signaling is the interconversion between the active GTP-bound and inactive GDP-bound states of the G alpha subunit, which regulatory proteins, such as guanine nucleotide exchange factors (GEFs), can control. GEFs stimulate formation of the GTP-bound state of G alpha and therefore are considered to work as positive regulators of G protein-coupled receptor signaling. Ric-8B, a GEF that is specifically expressed in olfactory sensory neurons, promotes functional expression of odorant receptors in HEK293T cells because it amplifies the initially low receptor signaling through G alpha olf. This same strategy could be used to functionally express other types of chemoreceptors.

Pharmacogenetics of Warfarin: Development of a Dosing Algorithm for Brazilian Patients

A dosing algorithm including genetic (VKORC1 and CYP2C9 genotypes) and nongenetic factors (age, weight, therapeutic indication, and cotreatment with amiodarone or simvastatin) explained 51% of the variance in stable weekly warfarin doses in 390 patients attending an anticoagulant clinic in a Brazilian public hospital. The VKORC1 3673G>A genotype was the most important predictor of warfarin dose, with a partial R(2) value of 23.9%. Replacing the VKORC1 3673G>A genotype with VKORC1 diplotype did not increase the algorithm`s predictive power. We suggest that three other single-nucleotide polymorphisms (SNPs) (5808T>G, 6853G>C, and 9041G>A) that are in strong linkage disequilibrium (LD) with 3673G>A would be equally good predictors of the warfarin dose requirement. The algorithm`s predictive power was similar across the self-identified ""race/color"" subsets. ""Race/color"" was not associated with stable warfarin dose in the multiple regression model, although the required warfarin dose was significantly lower (P = 0.006) in white (29 +/- 13 mg/week, n = 196) than in black patients (35 +/- 15 mg/week, n = 76).

Rapid and direct determination of glyphosate and aminomethylphosphonic acid in water using anion-exchange chromatography with coulometric detection

A simple, rapid, and low-cost coulometric method for direct detection of glyphosate and aminomethylphosphonic acid (AMPA) in water samples using anion-exchange chromatography and coulometric detection with copper electrode is presented. Under optimized conditions, the limits of detection (LODs) (S/N = 3) were 0.038 mu g ml(-1) for glyphosate and 0.24 mu g ml(-1) for AMPA, without any preconcentration method. The calibration curves were linear and presented an excellent correlation coefficient. The method was successfully applied to the determination of glyphosate and AMPA in water samples without any kind of extraction, clean-up, or preconcentration step. No interferent was found in the water, like this, the recovery was, practically, 100%. (c) 2008 Elsevier B.V. All rights reserved.

Potential oscillations in a proton exchange membrane fuel cell with a Pd-Pt/C anode

We report in this paper the occurrence of potential oscillations in a proton exchange membrane fuel cell (PEMFC) with a Pd-Pt/C anode, fed with H(2)/100 ppm CO, and operated at 30 degrees C. We demonstrate that the use of Pd-Pt/C anode enables the emergence of dynamic instabilities in a PEMFC. Oscillations are characterized by the presence of very high oscillation amplitude, ca. 0.8 V. which is almost twice that observed in a PEMFC with a Pt-Ru/C anode under similar conditions. The effects of the H(2)/CO flow rate and cell current density on the oscillatory dynamics were investigated and the mechanism rationalized in terms of the CO oxidation and adsorption processes. We also discuss the fundamental aspects concerning the operation of a PEMFC under oscillatory regime in terms of the benefit resulting from the higher average power output. (c) 2010 Elsevier B.V. All rights reserved.

Signal Processing and patternrecognition algorithm for monitoringParkinson’s disease.

This masters thesis describes the development of signal processing and patternrecognition in monitoring Parkison’s disease. It involves the development of a signalprocess algorithm and passing it into a pattern recogniton algorithm also. Thesealgorithms are used to determine , predict and make a conclusion on the study ofparkison’s disease. We get to understand the nature of how the parkinson’s disease isin humans.

Trade effects of exchange rate fluctuations: Evidence from Sweden

An overview of the theoretical literature for the last two decades suggests that there is no clear-cut relationship one can pin down between exchange rate volatility and trade flows. Analytical results are based on specific assumptions and only hold in certain cases. Especially, the impact of exchange rate volatility on export and import activity investigated separately leads also to dissimilar conclusions among countries studied. The general presumption is that an increase in exchange rate volatility will have an adverse effect on trade flows and consequently, the overall heath of the world economy. However, neither theoretical models nor empirical studies provide us with a definitive answer, leaving obtained results highly ambiguous and inconsistent (Baum and Caglayan, 2006). We purposed to empirically investigate trade effects of exchange rate fluctuations in Sweden from the perspective of export and import in this research. The data comprises period from January 1993 to December 2006, where export and import volumes are considered from the point of their determinants, including exchange rate volatility, which has been measured through EGARCH model. The results for the case of Sweden show that short run dynamics of volatility negatively associated with both export and import, whereas considered from the case of previous period volatility it exhibits positive relationship. These results are consistent with the most findings of prior studies, where the relationship remained ambiguous.

Solving the Vehicle Routing Problem with Genetic ALgorithm and Simulated Annealing

This Thesis Work will concentrate on a very interesting problem, the Vehicle Routing Problem (VRP). In this problem, customers or cities have to be visited and packages have to be transported to each of them, starting from a basis point on the map. The goal is to solve the transportation problem, to be able to deliver the packages-on time for the customers,-enough package for each Customer,-using the available resources- and – of course - to be so effective as it is possible.Although this problem seems to be very easy to solve with a small number of cities or customers, it is not. In this problem the algorithm have to face with several constraints, for example opening hours, package delivery times, truck capacities, etc. This makes this problem a so called Multi Constraint Optimization Problem (MCOP). What’s more, this problem is intractable with current amount of computational power which is available for most of us. As the number of customers grow, the calculations to be done grows exponential fast, because all constraints have to be solved for each customers and it should not be forgotten that the goal is to find a solution, what is best enough, before the time for the calculation is up. This problem is introduced in the first chapter: form its basics, the Traveling Salesman Problem, using some theoretical and mathematical background it is shown, why is it so hard to optimize this problem, and although it is so hard, and there is no best algorithm known for huge number of customers, why is it a worth to deal with it. Just think about a huge transportation company with ten thousands of trucks, millions of customers: how much money could be saved if we would know the optimal path for all our packages.Although there is no best algorithm is known for this kind of optimization problems, we are trying to give an acceptable solution for it in the second and third chapter, where two algorithms are described: the Genetic Algorithm and the Simulated Annealing. Both of them are based on obtaining the processes of nature and material science. These algorithms will hardly ever be able to find the best solution for the problem, but they are able to give a very good solution in special cases within acceptable calculation time.In these chapters (2nd and 3rd) the Genetic Algorithm and Simulated Annealing is described in details, from their basis in the “real world” through their terminology and finally the basic implementation of them. The work will put a stress on the limits of these algorithms, their advantages and disadvantages, and also the comparison of them to each other.Finally, after all of these theories are shown, a simulation will be executed on an artificial environment of the VRP, with both Simulated Annealing and Genetic Algorithm. They will both solve the same problem in the same environment and are going to be compared to each other. The environment and the implementation are also described here, so as the test results obtained.Finally the possible improvements of these algorithms are discussed, and the work will try to answer the “big” question, “Which algorithm is better?”, if this question even exists.

A Genetic Algorithm for Solar Boat

Genetic algorithm has been widely used in different areas of optimization problems. Ithas been combined with renewable energy domain, photovoltaic system, in this thesis.To participate and win the solar boat race, a control program is needed and C++ hasbeen chosen for programming. To implement the program, the mathematic model hasbeen built. Besides, the approaches to calculate the boundaries related to conditionhave been explained. Afterward, the processing of the prediction and real time controlfunction are offered. The program has been simulated and the results proved thatgenetic algorithm is helpful to get the good results but it does not improve the resultstoo much since the particularity of the solar driven boat project such as the limitationof energy production

Branch and Bound Algorithm for Multiprocessor Scheduling

The multiprocessor task graph scheduling problem has been extensively studied asacademic optimization problem which occurs in optimizing the execution time of parallelalgorithm with parallel computer. The problem is already being known as one of the NPhardproblems. There are many good approaches made with many optimizing algorithmto find out the optimum solution for this problem with less computational time. One ofthem is branch and bound algorithm.In this paper, we propose a branch and bound algorithm for the multiprocessor schedulingproblem. We investigate the algorithm by comparing two different lower bounds withtheir computational costs and the size of the pruned tree.Several experiments are made with small set of problems and results are compared indifferent sections.