WorldWideScience

Sample records for rapid binding approximation

  1. Quasielastic electron-deuteron scattering in the weak binding approximation

    Energy Technology Data Exchange (ETDEWEB)

    Ethier, Jacob J. [William and Mary College, JLAB; Doshi, Nidhi P. [Carnegie Mellon University; Malace, Simona P. [JLAB; Melnitchouk, Wally [JLAB

    2014-06-01

    We perform a global analysis of all available electron-deuteron quasielastic scattering data using Q^2-dependent smearing functions that describe inclusive inelastic e-d scattering within the weak binding approximation. We study the dependence of the cross sections on the deuteron wave function and the off-shell extrapolation of the elastic electron-nucleon cross section, which show particular sensitivity at x >> 1. The excellent overall agreement with data over a large range of Q^2 and x suggest a limited need for effects beyond the impulse approximation, with the exception of the very high-x or very low-Q^2 regions, where short-distance effects in the deuteron become more relevant.

  2. Rapid identification of DNA-binding proteins by mass spectrometry

    DEFF Research Database (Denmark)

    Nordhoff, E; Krogsdam, A M; Jorgensen, H F

    1999-01-01

    We report a protocol for the rapid identification of DNA-binding proteins. Immobilized DNA probes harboring a specific sequence motif are incubated with cell or nuclear extract. Proteins are analyzed directly off the solid support by matrix-assisted laser desorption/ionization time-of-flight mass...... was validated by the identification of known prokaryotic and eukaryotic DNA-binding proteins, and its use provided evidence that poly(ADP-ribose) polymerase exhibits DNA sequence-specific binding to DNA....

  3. Rapid Prototyping of Field Programmable Gate Array-Based Discrete Cosine Transform Approximations

    Directory of Open Access Journals (Sweden)

    Trevor W. Fox

    2003-05-01

    Full Text Available A method for the rapid design of field programmable gate array (FPGA-based discrete cosine transform (DCT approximations is presented that can be used to control the coding gain, mean square error (MSE, quantization noise, hardware cost, and power consumption by optimizing the coefficient values and datapath wordlengths. Previous DCT design methods can only control the quality of the DCT approximation and estimates of the hardware cost by optimizing the coefficient values. It is shown that it is possible to rapidly prototype FPGA-based DCT approximations with near optimal coding gains that satisfy the MSE, hardware cost, quantization noise, and power consumption specifications.

  4. Analysis of fast boundary-integral approximations for modeling electrostatic contributions of molecular binding

    Science.gov (United States)

    Kreienkamp, Amelia B.; Liu, Lucy Y.; Minkara, Mona S.; Knepley, Matthew G.; Bardhan, Jaydeep P.; Radhakrishnan, Mala L.

    2013-01-01

    We analyze and suggest improvements to a recently developed approximate continuum-electrostatic model for proteins. The model, called BIBEE/I (boundary-integral based electrostatics estimation with interpolation), was able to estimate electrostatic solvation free energies to within a mean unsigned error of 4% on a test set of more than 600 proteins—a significant improvement over previous BIBEE models. In this work, we tested the BIBEE/I model for its capability to predict residue-by-residue interactions in protein–protein binding, using the widely studied model system of trypsin and bovine pancreatic trypsin inhibitor (BPTI). Finding that the BIBEE/I model performs surprisingly less well in this task than simpler BIBEE models, we seek to explain this behavior in terms of the models’ differing spectral approximations of the exact boundary-integral operator. Calculations of analytically solvable systems (spheres and tri-axial ellipsoids) suggest two possibilities for improvement. The first is a modified BIBEE/I approach that captures the asymptotic eigenvalue limit correctly, and the second involves the dipole and quadrupole modes for ellipsoidal approximations of protein geometries. Our analysis suggests that fast, rigorous approximate models derived from reduced-basis approximation of boundary-integral equations might reach unprecedented accuracy, if the dipole and quadrupole modes can be captured quickly for general shapes. PMID:24466561

  5. Modeling of half-Heusler compound NiMnSb within tight-binding approximation

    Science.gov (United States)

    Sugiyanto, Majidi, M. A.; Nanto, D.

    2017-07-01

    Heusler compounds are families of magnetic materials with general stoichiometry of either X2YZ (full-Heusler compound) or XYZ (half-Heusler compound), with X and Y being transition metal elements, and Z a main-group element. Their various potentials for technology development make them be still relevant as a subject of both experimental and theoretical studies. Half-Heusler compounds are generally crystallized in the C1b-type structure. The magnetic moments of such materials may be predicted using Slater-Pauling rule, giving m = (Nvalence electrons - 18)µB per formula unit. However, this simple counting rule does not always work for all compounds in this group. This motivates us to perform a theoretical study to investigate the mechanism of magnetic moment formation microscopically. As a case study, we focus on NiMnSb, a particular half-Heusler compound, for which comparison between existing experimental results and theoretical predictions of its magnetic moment has not yet been quite convincing. We model the system by constructing a tight-binding-based Hamiltonian, incorporating Hubbard repulsive as well as spin-spin interactions for the electrons occupying the d-orbitals. We solve the model using Green's function approach, and treat the interaction terms within the mean-field approximation. At this stage, we aim to formulate the computational algorithm for the overall calculation process. Our final goal is to compute the total magnetic moment per unit cell of this system and compare it with available experimental data.

  6. Regional Economic Accounting (REAcct). A software tool for rapidly approximating economic impacts

    Energy Technology Data Exchange (ETDEWEB)

    Ehlen, Mark Andrew; Vargas, Vanessa N.; Loose, Verne William; Starks, Shirley J.; Ellebracht, Lory A.

    2011-07-01

    This paper describes the Regional Economic Accounting (REAcct) analysis tool that has been in use for the last 5 years to rapidly estimate approximate economic impacts for disruptions due to natural or manmade events. It is based on and derived from the well-known and extensively documented input-output modeling technique initially presented by Leontief and more recently further developed by numerous contributors. REAcct provides county-level economic impact estimates in terms of gross domestic product (GDP) and employment for any area in the United States. The process for using REAcct incorporates geospatial computational tools and site-specific economic data, permitting the identification of geographic impact zones that allow differential magnitude and duration estimates to be specified for regions affected by a simulated or actual event. Using these data as input to REAcct, the number of employees for 39 directly affected economic sectors (including 37 industry production sectors and 2 government sectors) are calculated and aggregated to provide direct impact estimates. Indirect estimates are then calculated using Regional Input-Output Modeling System (RIMS II) multipliers. The interdependent relationships between critical infrastructures, industries, and markets are captured by the relationships embedded in the inputoutput modeling structure.

  7. Methods of solving rapid binding target-mediated drug disposition model for two drugs competing for the same receptor.

    Science.gov (United States)

    Yan, Xiaoyu; Chen, Yang; Krzyzanski, Wojciech

    2012-10-01

    The target-mediated drug disposition (TMDD) model has been adopted to describe pharmacokinetics for two drugs competing for the same receptor. A rapid binding assumption introduces total receptor and total drug concentrations while free drug concentrations C (A) and C (B) are calculated from the equilibrium (Gaddum) equations. The Gaddum equations are polynomials in C (A) and C (B) of second degree that have explicit solutions involving complex numbers. The aim of this study was to develop numerical methods to solve the rapid binding TMDD model for two drugs competing for the same receptor that can be implemented in pharmacokinetic software. Algebra, calculus, and computer simulations were used to develop algorithms and investigate properties of solutions to the TMDD model with two drugs competitively binding to the same receptor. A general rapid binding approximation of the TMDD model for two drugs competing for the same receptor has been proposed. The explicit solutions to the equilibrium equations employ complex numbers, which cannot be easily solved by pharmacokinetic software. Numerical bisection algorithm and differential representation were developed to solve the system instead of obtaining an explicit solution. The numerical solutions were validated by MATLAB 7.2 solver for polynomial roots. The applicability of these algorithms was demonstrated by simulating concentration-time profiles resulting from exogenous and endogenous IgG competing for the neonatal Fc receptor (FcRn), and darbepoetin competing with endogenous erythropoietin for the erythropoietin receptor. These models were implemented in ADAPT 5 and Phoenix WinNonlin 6.0, respectively.

  8. Rapid approximate determination of nonlinear solutions - Application to aerodynamic flows and design/optimization problems

    Science.gov (United States)

    Stahara, S. S.

    1982-01-01

    Stahara et al. (1978) have considered the use of an approximation technique which employs two or more nonlinear base solutions determined by the full computational method to predict entire families of related nonlinear solutions. The present investigation provides results for several applications of that method which demonstrate both its accuracy and its utility for engineering applications. Attention is given to the perturbation concept and methods, aspects of coordinate straining, aspects of analytical formulation, and an application to surface properties. In a discussion of the results, single and multiple parameter perturbations are considered along with a combination of the approximation method with optimization procedures. The results show that it is possible to combine in certain cases large savings in computational cost with improved optimization.

  9. Rapid perfusion quantification using Welch-Satterthwaite approximation and analytical spectral filtering

    Science.gov (United States)

    Krishnan, Karthik; Reddy, Kasireddy V.; Ajani, Bhavya; Yalavarthy, Phaneendra K.

    2017-02-01

    CT and MR perfusion weighted imaging (PWI) enable quantification of perfusion parameters in stroke studies. These parameters are calculated from the residual impulse response function (IRF) based on a physiological model for tissue perfusion. The standard approach for estimating the IRF is deconvolution using oscillatory-limited singular value decomposition (oSVD) or Frequency Domain Deconvolution (FDD). FDD is widely recognized as the fastest approach currently available for deconvolution of CT Perfusion/MR PWI. In this work, three faster methods are proposed. The first is a direct (model based) crude approximation to the final perfusion quantities (Blood flow, Blood volume, Mean Transit Time and Delay) using the Welch-Satterthwaite approximation for gamma fitted concentration time curves (CTC). The second method is a fast accurate deconvolution method, we call Analytical Fourier Filtering (AFF). The third is another fast accurate deconvolution technique using Showalter's method, we call Analytical Showalter's Spectral Filtering (ASSF). Through systematic evaluation on phantom and clinical data, the proposed methods are shown to be computationally more than twice as fast as FDD. The two deconvolution based methods, AFF and ASSF, are also shown to be quantitatively accurate compared to FDD and oSVD.

  10. Rapidly convergent algorithms for 3-D tandem and stellarator equilibria in the paraxial approximation

    Energy Technology Data Exchange (ETDEWEB)

    McNamara, B.

    1984-04-01

    Tandem and stellarator equilibria at high ..beta.. have proved hard to compute and the relaxation methods of Bauer et al., Chodura and Schluter, Hirshman, Strauss, and Pearlstein et al. have been slow to converge. This paper reports an extension of the low-..beta.. analytic method of Pearlstein, Kaiser, and Newcomb to arbitrary ..beta.. for tandem mirrors which converges in 10 to 20 iterations. Extensions of the method to stellarator equilibria are proposed and are very close to the analytic method of Johnson and Greene - the stellarator expansion. Most of the results of all these calculations can be adequately described by low-..beta.. approximations since the MHD stability limits occur at low ..beta... The tandem mirror, having weak curvature and a long central cell, allows finite Larmor radius effects to eliminate most ballooning modes and offers the possibility of really high average ..beta... This is the interest in developing such three-dimensional numerical algorithms.

  11. Melanin binding study of clinical drugs with cassette dosing and rapid equilibrium dialysis inserts.

    Science.gov (United States)

    Pelkonen, Laura; Tengvall-Unadike, Unni; Ruponen, Marika; Kidron, Heidi; Del Amo, Eva M; Reinisalo, Mika; Urtti, Arto

    2017-11-15

    Melanin pigment is a negatively charged polymer found in pigmented human tissues. In the eye, iris, ciliary body, choroid and retinal pigment epithelium (RPE) are heavily pigmented. Several drug molecules are known to bind to melanin, but larger sets of drugs have not been compared often in similar test conditions. In this study, we introduce a powerful tool for screening of melanin binding. The binding of a set of 34 compounds to isolated porcine RPE melanin was determined by cassette (n-in-one) dosing in rapid equilibrium dialysis inserts and the binding was quantitated with LC-MS/MS analytics. The compounds represented large variety in melanin binding (from 8.6%, ganciclovir) to over 95% bound (ampicillin and ciprofloxacin). The data provides information on melanin binding of small molecular weight compounds that are used for ocular (e.g. brinzolamide, ganciclovir) and systemic (e.g. tizanidine, indomethacin) therapy. Interestingly, competition among compounds was seen for melanin binding and the binding did not show any correlation with plasma protein binding. These results increase the understanding of melanin binding of ocular drugs and can be further exploited to predict pharmacokinetics in the eye. Pigment binding provides an interesting option for improved drug distribution to retina and choroid that are difficult target tissues in drug delivery. Copyright © 2017 Elsevier B.V. All rights reserved.

  12. Codeine-binding RNA aptamers and rapid determination of their binding constants using a direct coupling surface plasmon resonance assay

    Science.gov (United States)

    Win, Maung Nyan; Klein, Joshua S.; Smolke, Christina D.

    2006-01-01

    RNA aptamers that bind the opium alkaloid codeine were generated using an iterative in vitro selection process. The binding properties of these aptamers, including equilibrium and kinetic rate constants, were determined through a rapid, high-throughput approach using surface plasmon resonance (SPR) analysis to measure real-time binding. The approach involves direct coupling of the target small molecule onto a sensor chip without utilization of a carrier protein. Two highest binding aptamer sequences, FC5 and FC45 with Kd values of 2.50 and 4.00 μM, respectively, were extensively studied. Corresponding mini-aptamers for FC5 and FC45 were subsequently identified through the described direct coupling Biacore assays. These assays were also employed to confirm the proposed secondary structures of the mini-aptamers. Both aptamers exhibit high specificity to codeine over morphine, which differs from codeine by a methyl group. Finally, the direct coupling method was demonstrated to eliminate potential non-specific interactions that may be associated with indirect coupling methods in which protein linkers are commonly employed. Therefore, in addition to presenting the first RNA aptamers to a subclass of benzylisoquinoline alkaloid molecules, this work highlights a method for characterizing small molecule aptamers that is more robust, precise, rapid and high-throughput than other commonly employed techniques. PMID:17038331

  13. Automation of plasma protein binding assay using rapid equilibrium dialysis device and Tecan workstation.

    Science.gov (United States)

    Ye, Zhengqi; Zetterberg, Craig; Gao, Hong

    2017-06-05

    Binding of drug molecules to plasma proteins is an important parameter in assessing drug ADME properties. Plasma protein binding (PPB) assays are routinely performed during drug discovery and development. A fully automated PPB assay was developed using rapid equilibrium dialysis (RED) device and Tecan workstation coupled to an automated incubator. The PPB assay was carried out in unsealed RED plates which allowed the assay to be fully automated. The plasma pH was maintained at 7.4 during the 6-h dialysis under 2% CO2 condition. The samples were extracted with acetonitrile and analyzed by liquid chromatography tandem mass spectrometry. The percent bound results of 10 commercial drugs in plasma protein binding were very similar between the automated and manual assays, and were comparable to literature values. The automated assay increases laboratory productivity and is applicable to high-throughput screening of drug protein binding in drug discovery. Copyright © 2017 Elsevier B.V. All rights reserved.

  14. The influence of drug distribution and drug-target binding on target occupancy : The rate-limiting step approximation

    NARCIS (Netherlands)

    Witte, de W.E.A.; Vauquelin, G.; Graaf, van der P.H.; Lange, de E.C.M.

    2017-01-01

    The influence of drug-target binding kinetics on target occupancy can be influenced by drug distribution and diffusion around the target, often referred to as "rebinding" or "diffusion-limited binding". This gives rise to a decreased decline of the drug-target complex concentration as a result of a

  15. Use of bacteriophage cell wall-binding proteins for rapid diagnostics of Listeria.

    Science.gov (United States)

    Schmelcher, Mathias; Loessner, Martin J

    2014-01-01

    Diagnostic protocols for food-borne bacterial pathogens such as Listeria need to be sensitive, specific, rapid, and inexpensive. Conventional culture methods are hampered by lengthy enrichment and incubation steps. Bacteriophage-derived high-affinity binding molecules (cell wall-binding domains, CBDs) specific for Listeria cells have recently been introduced as tools for detection and differentiation of this pathogen in foods. When coupled with magnetic separation, these proteins offer advantages in sensitivity and speed compared to the standard diagnostic methods. Furthermore, fusion of CBDs to differently colored fluorescent reporter proteins enables differentiation of Listeria strains in mixed cultures. This chapter provides protocols for detection of Listeria in food by CBD-based magnetic separation and subsequent multiplexed identification of strains of different serotypes with reporter-CBD fusion proteins.

  16. Labelling of pneumococcal penicillin-binding proteins with (/sup 3/H)propionyl-ampicillin. A rapid method for monitoring penicillin-binding activity

    Energy Technology Data Exchange (ETDEWEB)

    Hakenbeck, R. (Max-Planck-Institut fuer Molekulare Genetik, Berlin (Germany, F.R.)); Kohiyama, M. (Paris-7 Univ., 75 (France). Inst. de Biologie Moleculaire)

    1982-08-01

    Penicillin-binding proteins (PBPs) are membrane components ubiquitous to all bacteria examined so far. Some of them are present in only a few copies per cell. The conventional method of visualizing these proteins consists in binding of radioactive penicillin to the fractions containing PBPs followed by SDS-PAGE and finally fluorography. Although this procedure is laborious, it is necessary for the determination of the identity as well as for the quantification of each PBP. On the other hand, when penicillin-binding conditions are to be examined or binding activity has to be followed through fractionation and purification of PBPs, no fast monitoring device for these proteins has been available. The authors developed a rapid and easy assay for penicillin-binding activity with a filter-binding technique using (/sup 3/H)propionyl ampicillin (/sup 3/H-PA) of high specific activity. As little 2..mu..g of crude membranes obtained from the highly penicillin-sensitive, ..beta..-lactamase-negative organism Streptococcus pneumoniae, are sufficient to detect binding activity. In this paper they describe optimum conditions for the assay of PBPs and show that this binding activity correlates with the presence of native penicillin-binding proteins.

  17. Methodology for benzodiazepine receptor binding assays at physiological temperature. Rapid change in equilibrium with falling temperature

    Energy Technology Data Exchange (ETDEWEB)

    Dawson, R.M.

    1986-12-01

    Benzodiazepine receptors of rat cerebellum were assayed with (/sup 3/H)-labeled flunitrazepam at 37/sup 0/C, and assays were terminated by filtration in a cold room according to one of three protocols: keeping each sample at 37 degrees C until ready for filtration, taking the batch of samples (30) into the cold room and filtering sequentially in the order 1-30, and taking the batch of 30 samples into the cold room and filtering sequentially in the order 30-1. the results for each protocol were substantially different from each other, indicating that rapid disruption of equilibrium occurred as the samples cooled in the cold room while waiting to be filtered. Positive or negative cooperativity of binding was apparent, and misleading effects of gamma-aminobutyric acid on the affinity of diazepam were observed, unless each sample was kept at 37/sup 0/C until just prior to filtration.

  18. Rapid adhesion of nerve cells to muscle fibers from adult rats is mediated by a sialic acid-binding receptor

    OpenAIRE

    1986-01-01

    Single viable muscle fibers isolated from adult rats by collagenase digestion rapidly bind dissociated spinal neurons or PC-12 cells but not a variety of other cells tested. The adhesion process is calcium- independent, temperature-sensitive, and is not blocked by pretreating cells with inhibitors of energy metabolism or actin polymerization. Adhesion is mediated by a carbohydrate-binding protein and can be inhibited by N-acetylneuraminic acid or mucin, a glycoprotein with high sialic acids c...

  19. Valproate protein binding following rapid intravenous administration of high doses of valproic acid in patients with epilepsy.

    Science.gov (United States)

    Dutta, S; Faught, E; Limdi, N A

    2007-08-01

    To characterize protein binding in patients with epilepsy who achieve transient high (>150 mg/L) total plasma concentrations following rapid valproate infusion at very high doses. Patients with epilepsy (n = 40) were administered 20 or 30 mg/kg loading doses (6 or 10 mg/kg/min) of undiluted valproate sodium injection. Total and unbound valproic acid (VPA) concentrations were used to assess VPA binding to plasma albumin. One- and two-binding site models were explored in a nonlinear mixed effects population analysis framework. The relative importance of weight, age, sex, race and enzyme-inducing comedications on the binding site association constant (K) was examined using the likelihood ratio test. Intersubject and intrasubject variabilities were characterized using exponential or proportional error models. Optimal characterization of the data was achieved using the one-binding site model. Population binding parameter estimates (standard error) for number of binding sites (N) and K were 1.98 (0.0865) and 15.5 [2.28 (1/mM)], respectively. No significant covariates were identified for VPA protein binding. The intersubject and intrasubject coefficients of variation were 32% and 14%, respectively. A one-binding site model without any significant covariates for binding constants optimally described VPA protein binding. As the estimated dissociation constant (1/K, 64.5 microm or 9.3 mg/L) was within the therapeutic range (5-15 mg/L) for unbound VPA concentrations, protein binding was nonlinear. Although the range of unbound fraction and VPA concentrations were much higher than previous studies, the dissociation constant was consistent with historical data in normal healthy adults and epilepsy patients receiving lower doses.

  20. Simplified immunoassay for rapid Dengue serotype diagnosis, revealing insensitivity to non-specific binding interference

    Directory of Open Access Journals (Sweden)

    Fernanda C.C.L. Loureiro

    2017-04-01

    Full Text Available Proof of concept of an immunoassay, which is easy to implement, for rapid Dengue virus (DENV serotype diagnosis, in the early infection stage, is reported. The four-layer assay is immobilized onto a thin gold film and relies on a low cost, disposable polymer biochip for optical surface plasmon resonance sensing and detection. The protocol comprises Neutravidin-Biotin mediated monoclonal antibody (MAB attachment as the functionalized sensing element. Formation of the MAB-DENV complex results in a pronounced thickness change that is optically recorded in real time, employing a microfluidic set-up. Virus presence is confirmed by atomic force microscopy from the same sample. Serum samples were collected from a patient in acute febrile state. Simultaneous serological analysis by means of the reverse transcription polymerase chain reaction, independently, confirmed presence of DENV2 and DENV3. The protocol proved applicable in presence of strong non-specific binding interference that originates from, and is caused by, various blood, serum and other body fluid constituents. False positive indications for both, negative serum and blood control samples were not observed. The achievable limit of detection was estimated to be 2×104 particles/ml. Eventually, the method can be modified towards detection of other viruses by using the same protocol.

  1. Rapid determination of the binding affinity and specificity of the mushroom Polyporus squamosus lectin using frontal affinity chromatography coupled to electrospray mass spectrometry.

    Science.gov (United States)

    Zhang, B; Palcic, M M; Mo, H; Goldstein, I J; Hindsgaul, O

    2001-02-01

    The binding affinity and specificity of the mushroom Polyporus squamosus lectin has been determined by the recently developed method of frontal affinity chromatography coupled to electrospray mass spectrometry (FAC/MS). A micro-scale affinity column was prepared by immobilizing the lectin ( approximately 25 microg) onto porous glass beads in a tubing column (9.8 microl column volume). The column was then used to screen several oligosaccharide mixtures. The dissociation constants of 22 sialylated or sulfated oligosaccharides were evaluated against the immobilized lectin. The lectin was found to be highly specific for Neu5Acalpha2-6Galbeta1-4Glc/GlcNAc containing oligosaccharides with K(d) values near 10 microM. The FAC/MS assay permits the rapid determination of the dissociation constants of ligands as well as a higher throughput screening of compound mixtures, making it a valuable tool for affinity studies, especially for testing large numbers of compounds.

  2. Radioiododestannylation. Convenient synthesis of a stable penicillin derivative for rapid penicillin binding protein (PBP) assay

    Energy Technology Data Exchange (ETDEWEB)

    Blaszczak, L.C.; Halligan, N.G. (Lilly (Eli) and Co., Indianapolis, IN (USA). Lilly Research Labs.); Seitz, D.E. (Indiana Univ.-Purdue Univ., Indianapolis, IN (USA). School of Medicine)

    1989-04-01

    Radioiodination of p-(trimethylstannyl)penicillin V with ({sup 125}I)Na using a modification of the chloramine-T method is simple, high yielding, and site-specific. The structure and penicillin binding protein (PBP) affinity of p-({sup 125}I)-penicillin V (IPV) are similar to penicillin G and the product can be used directly without purification in the PBP assay. Because of the high degree of stability toward autoradiolysis and equivalent PBP binding affinity, IPV can be used in place of ({sup 3}H)-penicillin G or ({sup 14}C)-penicillin G for these experiments. (author).

  3. Multithermal titration calorimetry: a rapid method to determine binding heat capacities.

    Science.gov (United States)

    Chavelas, Eneas A; Zubillaga, Rafael A; Pulido, Nancy O; García-Hernández, Enrique

    2006-03-01

    Herein a new method that allows binding DeltaCp to be determined with a single experiment is presented. Multithermal titration calorimetry (MTC) is a simple extension of isothermal titration calorimetry (ITC) that explicitly takes into account the thermal dependences of DeltaH and the binding constant. Experimentally, this is accomplished by performing a single stepwise titration with ITC equipment, allowing temperature re-adjustments of the system at intermediate states of the titration process. Thus, from the resulting multitherm, DeltaCp can also be determined. The experimental feasibility of MTC was tested by using the well-characterized lysozyme-chitotriose complex as a model system.

  4. HYPOTHESIS: PARALOG FORMATION FROM PROGENITOR PROTEINS AND PARALOG MUTAGENESIS SPUR THE RAPID EVOLUTION OF TELOMERE BINDING PROTEINS

    Directory of Open Access Journals (Sweden)

    Arthur J Lustig

    2016-02-01

    Full Text Available Through elegant studies in fungal cells and complex organisms, we propose a unifying paradigm for the rapid evolution of telomere binding proteins (TBPs that associate with either (or both telomeric DNA and telomeric proteins. TBPs protect and regulate telomere structure and function. Four critical factors are involved. First, TBPs that commonly bind to telomeric DNA include the c-Myb binding proteins, OB-fold single-stranded binding proteins, and G-G base paired Hoogsteen structure (G4 binding proteins. Each contributes independently or, in some cases, cooperatively, to provide a minimum level of telomere function. As a result of these minimal requirements and the great abundance of homologs of these motifs in the proteome, DNA telomere-binding activity may be generated more easily than expected. Second, telomere dysfunction gives rise to genome instability, through the elevation of recombination rates, genome ploidy, and the frequency of gene mutations. The formation of paralogs that diverge from their progenitor proteins ultimately can form a high frequency of altered TBPs with altered functions. Third, TBPs that assemble into complexes (e.g. mammalian shelterin derive benefits from the novel emergent functions. Fourth, a limiting factor in the evolution of TBP complexes is the formation of mutually compatible interaction surfaces amongst the TBPs. These factors may have different degrees of importance in the evolution of different phyla, illustrated by the apparently simpler telomeres in complex plants. Selective pressures that can utilize the mechanisms of paralog formation and mutagenesis to drive TBP evolution along routes dependent on the requisite physiologic changes.

  5. Rapid bead-based immunoassay for measurement of mannose-binding lectin

    DEFF Research Database (Denmark)

    Bay, J T; Garred, P

    2009-01-01

    Mannose-binding lectin (MBL) is a serum protein, which functions as an opsonin and initiator of the lectin pathway of complement. The serum concentration of MBL shows great interindividual variation because of common polymorphisms in the MBL2 gene. Although several quantitative MBL immunoassays...

  6. Paced Reading in Semantic Dementia: Word Knowledge Contributes to Phoneme Binding in Rapid Speech Production

    Science.gov (United States)

    Jefferies, Elizabeth; Grogan, John; Mapelli, Cristina; Isella, Valeria

    2012-01-01

    Patients with semantic dementia (SD) show deficits in phoneme binding in immediate serial recall: when attempting to reproduce a sequence of words that they no longer fully understand, they show frequent migrations of phonemes between items (e.g., cap, frog recalled as "frap, cog"). This suggests that verbal short-term memory emerges directly from…

  7. Rapid and systemic accumulation of chloroplast mRNA-binding protein transcripts after flame stimulus in tomato

    Science.gov (United States)

    Vian, A.; Henry-Vian, C.; Davies, E.

    1999-01-01

    It has been shown that tomato (Lycopersicon esculentum) plants respond to flame wounding and electrical stimulation by a rapid (15 min) and systemic up-regulation of proteinase inhibitor (pin) genes. To find other genes having a similar expression pattern, we used subtractive cDNA screening between flamed and control plants to select clones up-regulated by flame wounding. We report the characterization of one of them, a chloroplast mRNA-binding protein encoded by a single gene and expressed preferentially in the leaves. Systemic gene expression in response to flaming in the youngest terminal leaf exhibited three distinct phases: a rapid and transient increase (5-15 min) in transcript accumulation, a decline to basal levels (15-45 min), and then a second, more prolonged increase (60-90 min). In contrast, after a mechanical wound the rapid, transient increase (5 min) was followed by a rapid decline to basal levels but no later, prolonged accumulation. In the petiole, the initial flame-wound-evoked transient increase (15 min) was followed by a continuous decline for 3 h. The nature of the wound signal(s) causing such rapid changes in transcript abundance is discussed in relation to electrical signaling, which has recently been implicated in plant responses to wounding.

  8. A Rapid Method to Characterize Mouse IgG Antibodies and Isolate Native Antigen Binding IgG B Cell Hybridomas.

    Directory of Open Access Journals (Sweden)

    Haolin Liu

    Full Text Available B cell hybridomas are an important source of monoclonal antibodies. In this paper, we developed a high-throughput method to characterize mouse IgG antibodies using surface plasmon resonance technology. This assay rapidly determines their sub-isotypes, whether they bind native antigen and their approximate affinities for the antigen using only 50 μl of hybridoma cell culture supernatant. Moreover, we found that mouse hybridomas secreting IgG antibodies also have membrane form IgG expression without Igα. Based on this surface IgG, we used flow cytometry to isolate rare γ2a isotype switched variants from a γ2b antibody secreting hybridoma cell line. Also, we used fluorescent antigen to single cell sort antigen binding hybridoma cells from bulk mixture of fused hybridoma cells instead of the traditional multi-microwell plate screening and limiting dilution sub-cloning thus saving time and labor. The IgG monoclonal antibodies specific for the native antigen identified with these methods are suitable for in vivo therapeutic uses, but also for sandwich ELISA assays, histology, flow cytometry, immune precipitation and x-ray crystallography.

  9. Rapid and accurate prediction and scoring of water molecules in protein binding sites.

    Directory of Open Access Journals (Sweden)

    Gregory A Ross

    Full Text Available Water plays a critical role in ligand-protein interactions. However, it is still challenging to predict accurately not only where water molecules prefer to bind, but also which of those water molecules might be displaceable. The latter is often seen as a route to optimizing affinity of potential drug candidates. Using a protocol we call WaterDock, we show that the freely available AutoDock Vina tool can be used to predict accurately the binding sites of water molecules. WaterDock was validated using data from X-ray crystallography, neutron diffraction and molecular dynamics simulations and correctly predicted 97% of the water molecules in the test set. In addition, we combined data-mining, heuristic and machine learning techniques to develop probabilistic water molecule classifiers. When applied to WaterDock predictions in the Astex Diverse Set of protein ligand complexes, we could identify whether a water molecule was conserved or displaced to an accuracy of 75%. A second model predicted whether water molecules were displaced by polar groups or by non-polar groups to an accuracy of 80%. These results should prove useful for anyone wishing to undertake rational design of new compounds where the displacement of water molecules is being considered as a route to improved affinity.

  10. Approximation Clustering

    Indian Academy of Sciences (India)

    First page Back Continue Last page Overview Graphics. Approximation Clustering. Clustering within (1+ ε) of the optimum cost. ε is user defined tolerance. For metric spaces even approximating is. hard (below, say 30%). Euclidean k-median in fixed dimension can. be approximated in polynomial time.

  11. Triggering HIV polyprotein processing by light using rapid photodegradation of a tight-binding protease inhibitor.

    Science.gov (United States)

    Schimer, Jiří; Pávová, Marcela; Anders, Maria; Pachl, Petr; Šácha, Pavel; Cígler, Petr; Weber, Jan; Majer, Pavel; Řezáčová, Pavlína; Kräusslich, Hans-Georg; Müller, Barbara; Konvalinka, Jan

    2015-03-09

    HIV protease (PR) is required for proteolytic maturation in the late phase of HIV replication and represents a prime therapeutic target. The regulation and kinetics of viral polyprotein processing and maturation are currently not understood in detail. Here we design, synthesize, validate and apply a potent, photodegradable HIV PR inhibitor to achieve synchronized induction of proteolysis. The compound exhibits subnanomolar inhibition in vitro. Its photolabile moiety is released on light irradiation, reducing the inhibitory potential by 4 orders of magnitude. We determine the structure of the PR-inhibitor complex, analyze its photolytic products, and show that the enzymatic activity of inhibited PR can be fully restored on inhibitor photolysis. We also demonstrate that proteolysis of immature HIV particles produced in the presence of the inhibitor can be rapidly triggered by light enabling thus to analyze the timing, regulation and spatial requirements of viral processing in real time.

  12. A cleavable silica-binding affinity tag for rapid and inexpensive protein purification.

    Science.gov (United States)

    Coyle, Brandon L; Baneyx, François

    2014-10-01

    We describe a new affinity purification tag called Car9 that confers proteins to which it is fused micromolar affinity for unmodified silica. When appended to the C-terminus of GFPmut2 through a flexible linker, Car9 promotes efficient adsorption to silica gel and the fusion protein can be released from the particles by incubation with L-lysine. Using a silica gel column and the lysine elution approach in fast protein liquid chromatography (FPLC) mode, Car9-tagged versions of GFPmut2, mCherry and maltose binding protein (MBP) can be recovered from clarified lysates with a purity of 80-90%. Capitalizing on silica's ability to handle large pressure drops, we further show that it is possible to go from cell lysates to purified protein in less than 15 min using a fully disposable device. Finally, we demonstrate that the linker-Car9 region is susceptible to proteolysis by E. coli OmpT and take advantage of this observation to excise the C-terminal extension of GFPmut2-Car9 by incubating purified fusion protein with cells that overproduce the outer membrane protease OmpT. The set of strategies described herein, should reduce the cost of affinity purification by at least 10-fold, cut down purification times to minutes, and allow for the production of proteins with native (or nearly native) termini from their C-terminally-tagged versions. © 2014 Wiley Periodicals, Inc.

  13. Rapid bursts of androgen-binding protein (Abp) gene duplication occurred independently in diverse mammals.

    Science.gov (United States)

    Laukaitis, Christina M; Heger, Andreas; Blakley, Tyler D; Munclinger, Pavel; Ponting, Chris P; Karn, Robert C

    2008-02-12

    The draft mouse (Mus musculus) genome sequence revealed an unexpected proliferation of gene duplicates encoding a family of secretoglobin proteins including the androgen-binding protein (ABP) alpha, beta and gamma subunits. Further investigation of 14 alpha-like (Abpa) and 13 beta- or gamma-like (Abpbg) undisrupted gene sequences revealed a rich diversity of developmental stage-, sex- and tissue-specific expression. Despite these studies, our understanding of the evolution of this gene family remains incomplete. Questions arise from imperfections in the initial mouse genome assembly and a dearth of information about the gene family structure in other rodents and mammals. Here, we interrogate the latest 'finished' mouse (Mus musculus) genome sequence assembly to show that the Abp gene repertoire is, in fact, twice as large as reported previously, with 30 Abpa and 34 Abpbg genes and pseudogenes. All of these have arisen since the last common ancestor with rat (Rattus norvegicus). We then demonstrate, by sequencing homologs from species within the Mus genus, that this burst of gene duplication occurred very recently, within the past seven million years. Finally, we survey Abp orthologs in genomes from across the mammalian clade and show that bursts of Abp gene duplications are not specific to the murid rodents; they also occurred recently in the lagomorph (rabbit, Oryctolagus cuniculus) and ruminant (cattle, Bos taurus) lineages, although not in other mammalian taxa. We conclude that Abp genes have undergone repeated bursts of gene duplication and adaptive sequence diversification driven by these genes' participation in chemosensation and/or sexual identification.

  14. Engineering and rapid selection of a low-affinity glucose/galactose-binding protein for a glucose biosensor.

    Science.gov (United States)

    Amiss, Terry J; Sherman, Douglas B; Nycz, Colleen M; Andaluz, Sandra A; Pitner, J Bruce

    2007-11-01

    Periplasmic expression screening is a selection technique used to enrich high-affinity proteins in Escherichia coli. We report using this screening method to rapidly select a mutated D-glucose/D-galactose-binding protein (GGBP) having low affinity to glucose. Wild-type GGBP has an equilibrium dissociation constant of 0.2 microM and mediates the transport of glucose within the periplasm of E. coli. The protein undergoes a large conformational change on binding glucose and, when labeled with an environmentally sensitive fluorophore, GGBP can relay glucose concentrations, making it of potential interest as a biosensor for diabetics. This use necessitates altering the glucose affinity of GGBP, bringing it into the physiologically relevant range for monitoring glucose in humans (1.7-33 mM). To accomplish this a focused library was constructed using structure-based site-saturation mutagenesis to randomize amino acids in the binding pocket of GGBP at or near direct H-bonding sites and screening the library within the bacterial periplasm. After selection, equilibrium dissociation constants were confirmed by glucose titration and fluorescence monitoring of purified mutants labeled site-specifically at E149C with the fluorophore IANBD (N,N'-dimethyl-N-(iodoacetyl)-N'-(7-nitrobenz-2-oxa-1,3-diazol-4-yl)ethylene-diamine). The screening identified a single mutation A213R that lowers GGBP glucose affinity 5000-fold to 1 mM. Computational modeling suggested the large decrease in affinity was accomplished by the arginine side chain perturbing H-bonding and increasing the entropic barrier to the closed conformation. Overall, these experiments demonstrate the ability of structure-based site-saturation mutagenesis and periplasmic expression screening to discover low-affinity GGBP mutants having potential utility for measuring glucose in humans.

  15. Approximate equations of state for a finite lattice system with two-, three-, and four-body potentials: Models for the binding of oxygen to hemoglobin

    Science.gov (United States)

    Bond, Jeffrey P.

    1992-06-01

    Biochemical binding systems present many-body problems, even after integrating over solvent and polymer configurational degrees of freedom, because biological molecules are dense in cellular compartments. Furthermore, the resulting effective potentials are likely to include substantial n-body contributions with n>2. The binding of oxygen to hemoglobin is studied as a prototype problem of this kind. (i) The Hill coefficient (simply related to the change in the fractional binding with a change in the ligand chemical potential) has proven to be a useful, model-independent descriptor of ligand binding behavior. An obvious generalization of this approach is given and the resulting coefficients are shown to describe stably the binding of oxygen to hemoglobin over a broad range of free-ligand concentrations. (ii) An expansion of the standard Helmholtz free energy in the local binding density is used to find the excess standard Helmholtz free energy for saturation of hemoglobin with oxygen. This requires equations to change from local potential field variables to density variables that are equivalent to the two-, three-, and four-point Ornstein-Zernike equations. The method permits exact inclusion of two-, three-, and four-body potentials in the limit of weak interaction potentials, but is very poor for strong interactions. (iii) An expansion of the two-body direct correlation function with r≠0 and the core condition are used in the compressibility equation to find the excess pressure as a function of the fractional saturation, and thus also to find the standard free-energy change upon saturating the protein with ligand. At first order, this procedure provides a model for the binding of oxygen to hemoglobin that does not require the assumption of pair decomposability of the interaction potentials or explicit calculation of a partition function, and yet is competitive with models that require both. The model is accurate for a wide range of interaction potentials. The

  16. Simple and rapid quantification of serotonin transporter binding using [11C]DASB bolus plus constant infusion.

    Science.gov (United States)

    Gryglewski, G; Rischka, L; Philippe, C; Hahn, A; James, G M; Klebermass, E; Hienert, M; Silberbauer, L; Vanicek, T; Kautzky, A; Berroterán-Infante, N; Nics, L; Traub-Weidinger, T; Mitterhauser, M; Wadsak, W; Hacker, M; Kasper, S; Lanzenberger, R

    2017-04-01

    In-vivo quantification of serotonin transporters (SERT) in human brain has been a mainstay of molecular imaging in the field of neuropsychiatric disorders and helped to explore the underpinnings of several medical conditions, therapeutic and environmental influences. The emergence of PET/MR hybrid systems and the heterogeneity of SERT binding call for the development of efficient methods making the investigation of larger or vulnerable populations with limited scanner time and simultaneous changes in molecular and functional measures possible. We propose [11C]DASB bolus plus constant infusion for these applications and validate it against standard analyses of dynamic PET data. [11C]DASB bolus/infusion optimization was performed on data acquired after [11C]DASB bolus in 8 healthy subjects. Subsequently, 16 subjects underwent one scan using [11C]DASB bolus plus constant infusion with Kbol 160-179min and one scan after [11C]DASB bolus for inter-method reliability analysis. Arterial blood sampling and metabolite analysis were performed for all scans. Distribution volumes (VT) were obtained using Logan plots for bolus scans and ratios between tissue and plasma parent activity for bolus plus infusion scans for different time spans of the scan (VT-70 for 60-70min after start of tracer infusion, VT-90 for 75-90min, VT-120 for 100-120min) in 9 subjects. Omitting blood data, binding potentials (BPND) obtained using multilinear reference tissue modeling (MRTM2) and cerebellar gray matter as reference region were compared in 11 subjects. A Kbol of 160min was observed to be optimal for rapid equilibration in thalamus and striatum. VT-70 showed good intraclass correlation coefficients (ICCs) of 0.61-0.70 for thalamus, striatal regions and olfactory cortex with bias ≤5.1% compared to bolus scans. ICCs increased to 0.72-0.78 for VT-90 and 0.77-0.93 for VT-120 in these regions. BPND-90 had negligible bias ≤2.5%, low variability ≤7.9% and ICCs of 0.74-0.87; BPND-120 had ICCs

  17. Rapid Non-Enzymatic Glycation of the Insulin Receptor under Hyperglycemic Conditions Inhibits Insulin Binding In Vitro: Implications for Insulin Resistance

    Directory of Open Access Journals (Sweden)

    Tyler Rhinesmith

    2017-12-01

    Full Text Available The causes of insulin resistance are not well-understood in either type 1 or type 2 diabetes. Insulin (INS is known to undergo rapid non-enzymatic covalent conjugation to glucose or other sugars (glycation. Because the insulin receptor (IR has INS-like regions associated with both glucose and INS binding, we hypothesize that hyperglycemic conditions may rapidly glycate the IR, chronically interfering with INS binding. IR peptides were synthesized spanning IR- associated INS-binding regions. Glycation rates of peptides under hyperglycemic conditions were followed over six days using matrix assisted laser desorption/ionization-time of flight (MALDI-TOF mass spectrometry. INS conjugated to horse-radish peroxidase was used to determine INS binding to IR peptides in glycated and non-glycated forms. Several IR peptides were glycated up to 14% within days of exposure to 20–60 mM glucose. Rates of IR-peptide glycation were comparable to those of insulin. Glycation of four IR peptides significantly inhibits INS binding to them. Glycation of intact IR also decreases INS binding by about a third, although it was not possible to confirm the glycation sites on the intact IR. Glycation of the IR may therefore provide a mechanism by which INS resistance develops in diabetes. Demonstration of glycation of intact IR in vivo is needed.

  18. Approximate Likelihood

    CERN Multimedia

    CERN. Geneva

    2015-01-01

    Most physics results at the LHC end in a likelihood ratio test. This includes discovery and exclusion for searches as well as mass, cross-section, and coupling measurements. The use of Machine Learning (multivariate) algorithms in HEP is mainly restricted to searches, which can be reduced to classification between two fixed distributions: signal vs. background. I will show how we can extend the use of ML classifiers to distributions parameterized by physical quantities like masses and couplings as well as nuisance parameters associated to systematic uncertainties. This allows for one to approximate the likelihood ratio while still using a high dimensional feature vector for the data. Both the MEM and ABC approaches mentioned above aim to provide inference on model parameters (like cross-sections, masses, couplings, etc.). ABC is fundamentally tied Bayesian inference and focuses on the “likelihood free” setting where only a simulator is available and one cannot directly compute the likelihood for the dat...

  19. Rapid Changes of mRNA-binding Protein Levels following Glucose and 3-Isobutyl-1-methylxanthine Stimulation of Insulinoma INS-1 Cells *S⃞

    Science.gov (United States)

    Süss, Christin; Czupalla, Cornelia; Winter, Christof; Pursche, Theresia; Knoch, Klaus-Peter; Schroeder, Michael; Hoflack, Bernard; Solimena, Michele

    2009-01-01

    Glucose and cAMP-inducing agents such as 3-isobutyl-1-methylxanthine (IBMX) rapidly change the expression profile of insulin-producing pancreatic β-cells mostly through post-transcriptional mechanisms. A thorough analysis of these changes, however, has not yet been performed. By combining two-dimensional differential gel electrophoresis and mass spectrometry, we identified 165 spots, corresponding to 78 proteins, whose levels significantly change after stimulation of the β-cell model INS-1 cells with 25 mm glucose + 1 mm IBMX for 2 h. Changes in the expression of selected proteins were verified by one- and two-dimensional immunoblotting. Most of the identified proteins are novel targets of rapid regulation in β-cells. The transcription inhibitor actinomycin D failed to block changes in two-thirds of the spots, supporting their post-transcriptional regulation. More spots changed in response to IBMX than to glucose alone conceivably because of phosphorylation. Fourteen mRNA- binding proteins responded to stimulation, thus representing the most prominent class of rapidly regulated proteins. Bioinformatics analysis indicated that the mRNA 5′- and 3′-untranslated regions of 22 regulated proteins contain potential binding sites for polypyrimidine tract-binding protein 1, which promotes mRNA stability and translation in stimulated β-cells. Overall our findings support the idea that mRNA-binding proteins play a major role in rapid adaptive changes in insulin-producing cells following their stimulation with glucose and cAMP-elevating agents. PMID:18854578

  20. WRNIP1 accumulates at laser light irradiated sites rapidly via its ubiquitin-binding zinc finger domain and independently from its ATPase domain

    Energy Technology Data Exchange (ETDEWEB)

    Nomura, Hironoshin [Molecular Cell Biology Laboratory, Graduate School of Pharmaceutical Sciences, Tohoku University, Aramaki Aoba 6-3, Aobaku, Sendai 980-8578 (Japan); Yoshimura, Akari, E-mail: akari_yo@musashino-u.ac.jp [Research Institute of Pharmaceutical Sciences, Faculty of Pharmacy, Musashino University, 1-1-20 Shinmachi, Nishitokyo-shi, Tokyo 202-8585 (Japan); Edo, Takato [Molecular Cell Biology Laboratory, Graduate School of Pharmaceutical Sciences, Tohoku University, Aramaki Aoba 6-3, Aobaku, Sendai 980-8578 (Japan); Kanno, Shin-ichiro [Division of Dynamic Proteome, Institute of Development, Aging and Cancer, Tohoku University, Seiryomachi 4-1, Aobaku, Sendai 980-8575 (Japan); Tada, Syusuke [Faculty of Pharmaceutical Sciences, Teikyo Heisei University, Ichihara, Chiba 290-0193 (Japan); Seki, Masayuki [Molecular Cell Biology Laboratory, Graduate School of Pharmaceutical Sciences, Tohoku University, Aramaki Aoba 6-3, Aobaku, Sendai 980-8578 (Japan); Yasui, Akira [Division of Dynamic Proteome, Institute of Development, Aging and Cancer, Tohoku University, Seiryomachi 4-1, Aobaku, Sendai 980-8575 (Japan); Enomoto, Takemi [Research Institute of Pharmaceutical Sciences, Faculty of Pharmacy, Musashino University, 1-1-20 Shinmachi, Nishitokyo-shi, Tokyo 202-8585 (Japan)

    2012-01-27

    Highlights: Black-Right-Pointing-Pointer WRNIP1 accumulates in laser light irradiated sites very rapidly via UBZ domain. Black-Right-Pointing-Pointer The ATPase domain of WRNIP1 is dispensable for its accumulation. Black-Right-Pointing-Pointer The accumulation of WRNIP1 seems not to be dependent on the interaction with WRN. -- Abstract: WRNIP1 (Werner helicase-interacting protein 1) was originally identified as a protein that interacts with the Werner syndrome responsible gene product. WRNIP1 contains a ubiquitin-binding zinc-finger (UBZ) domain in the N-terminal region and two leucine zipper motifs in the C-terminal region. In addition, it possesses an ATPase domain in the middle of the molecule and the lysine residues serving as ubiquitin acceptors in the entire of the molecule. Here, we report that WRNIP1 accumulates in laser light irradiated sites very rapidly via its ubiquitin-binding zinc finger domain, which is known to bind polyubiquitin and to be involved in ubiquitination of WRNIP1 itself. The accumulation of WRNIP1 in laser light irradiated sites also required the C-terminal region containing two leucine zippers, which is reportedly involved in the oligomerization of WRNIP1. Mutated WRNIP1 with a deleted ATPase domain or with mutations in lysine residues, which serve as ubiquitin acceptors, accumulated in laser light irradiated sites, suggesting that the ATPase domain of WRNIP1 and ubiquitination of WRNIP1 are dispensable for the accumulation.

  1. Persistent Graves' hyperthyroidism despite rapid negative conversion of thyroid-stimulating hormone-binding inhibitory immunoglobulin assay results: a case report.

    Science.gov (United States)

    Ohara, Nobumasa; Kaneko, Masanori; Kitazawa, Masaru; Uemura, Yasuyuki; Minagawa, Shinichi; Miyakoshi, Masashi; Kaneko, Kenzo; Kamoi, Kyuzi

    2017-02-06

    Graves' disease is an autoimmune thyroid disorder characterized by hyperthyroidism, and patients exhibit thyroid-stimulating hormone receptor antibody. The major methods of measuring circulating thyroid-stimulating hormone receptor antibody include the thyroid-stimulating hormone-binding inhibitory immunoglobulin assays. Although the diagnostic accuracy of these assays has been improved, a minority of patients with Graves' disease test negative even on second-generation and third-generation thyroid-stimulating hormone-binding inhibitory immunoglobulins. We report a rare case of a thyroid-stimulating hormone-binding inhibitory immunoglobulin-positive patient with Graves' disease who showed rapid lowering of thyroid-stimulating hormone-binding inhibitory immunoglobulin levels following administration of the anti-thyroid drug thiamazole, but still experienced Graves' hyperthyroidism. A 45-year-old Japanese man presented with severe hyperthyroidism (serum free triiodothyronine >25.0 pg/mL; reference range 1.7 to 3.7 pg/mL) and tested weakly positive for thyroid-stimulating hormone-binding inhibitory immunoglobulins on second-generation tests (2.1 IU/L; reference range Graves' hyperthyroidism. The possible explanations for serial changes in the thyroid-stimulating hormone-binding inhibitory immunoglobulin results in our patient include the presence of thyroid-stimulating hormone receptor antibody, which is bioactive but less reactive on thyroid-stimulating hormone-binding inhibitory immunoglobulin assays, or the effect of reduced levels of circulating thyroid-stimulating hormone receptor antibody upon improvement of thyroid autoimmunity with thiamazole treatment. Physicians should keep in mind that patients with Graves' disease may show thyroid-stimulating hormone-binding inhibitory immunoglobulin assay results that do not reflect the severity of Graves' disease or indicate the outcome of the disease, and that active Graves' disease may persist even after negative

  2. Soluble Aβ oligomers are rapidly sequestered from brain ISF in vivo and bind GM1 ganglioside on cellular membranes

    National Research Council Canada - National Science Library

    Hong, Soyon; Ostaszewski, Beth L; Yang, Ting; O'Malley, Tiernan T; Jin, Ming; Yanagisawa, Katsuhiko; Li, Shaomin; Bartels, Tim; Selkoe, Dennis J

    2014-01-01

    .... Here, we found that soluble Aβ oligomers were sequestered from brain interstitial fluid onto brain membranes much more rapidly than nontoxic monomers and were recovered in part as bound to GM1 ganglioside on membranes. Aβ...

  3. Development and validation of a rapid LC-ESI-MS/MS method for quantification of fluoxetine and its application to MS binding assays.

    Science.gov (United States)

    Hess, Marielle; Höfner, Georg; Wanner, Klaus Theodor

    2011-07-01

    In the present study, a rapid and sensitive LC-ESI-MS/MS method for quantification of (S)-fluoxetine as a native marker in mass spectrometry (MS) binding assays addressing the human serotonin transporter (hSERT) was developed and validated. The concept of MS binding assays based on mass spectrometric quantification of a nonlabeled marker recently introduced by us represents a promising alternative to conventional radioligand binding without the drawbacks inherently connected with radioisotope labeling. For high-performance liquid chromatography (HPLC), a 20 × 2-mm RP-18 column with a mobile phase composed of acetonitrile and ammonium bicarbonate buffer (5 mmol L(-1), pH 9.5) at a ratio of 80:20 (v/v) and a flow rate of 800 μL min(-1) in an isocratic mode were used, resulting in a chromatographic cycle time of 60 s. Employing [(2)H(5)]fluoxetine as internal standard enabled ESI-MS/MS quantification of (S)-fluoxetine between 3 nmol L(-1) and 50 pmol L(-1) (LLOQ) in matrix obtained from binding experiments without the need of any sample preparation. Validation of the method showed that linearity, intra-, and inter-batch accuracy as well as precision meet the requirements of the FDA guidance for bioanalytical method validation. Considering sensitivity and speed, the established method is clearly superior to those published for biological matrices so far. Furthermore, the method was transferred to other RP-18 columns of different lengths and respective validation experiments demonstrated its versatility and chromatographic robustness. Finally, the newly developed method was successfully applied to MS binding assays for hSERT. The affinity determined for (S)-fluoxetine in saturation experiments was in good agreement with literature data obtained in respective radioligand binding assays.

  4. A coiled coil trigger site is essential for rapid binding of synaptobrevin to the SNARE acceptor complex

    DEFF Research Database (Denmark)

    Wiederhold, Katrin; Kloepper, Tobias H; Walter, Alexander M

    2010-01-01

    Exocytosis from synaptic vesicles is driven by stepwise formation of a tight alpha-helical complex between the fusing membranes. The complex is composed of the three SNAREs: synaptobrevin 2, SNAP-25, and syntaxin 1a. An important step in complex formation is fast binding of vesicular synaptobrevin...

  5. Ultrafast Approximation for Phylogenetic Bootstrap

    NARCIS (Netherlands)

    Bui Quang Minh, [No Value; Nguyen, Thi; von Haeseler, Arndt

    Nonparametric bootstrap has been a widely used tool in phylogenetic analysis to assess the clade support of phylogenetic trees. However, with the rapidly growing amount of data, this task remains a computational bottleneck. Recently, approximation methods such as the RAxML rapid bootstrap (RBS) and

  6. Improved sample preparation and rapid UHPLC analysis of SO2 binding carbonyls in wine by derivatisation to 2,4-dinitrophenylhydrazine.

    Science.gov (United States)

    Jackowetz, J N; Mira de Orduña, R

    2013-08-15

    Sulphur dioxide (SO2) is essential for the preservation of wines. The presence of SO2 binding compounds in musts and wines may limit sulphite efficacy leading to higher total SO2 additions, which may exceed SO2 limits permitted by law and pose health risks for sensitive individuals. An improved method for the quantification of significant wine SO2 binding compounds is presented that applies a novel sample treatment approach and rapid UHPLC separation. Glucose, galacturonic acid, alpha-ketoglutarate, pyruvate, acetoin and acetaldehyde were derivatised with 2,4-dinitrophenylhydrazine and separated using a solid core C18 phase by ultra high performance liquid chromatography. Addition of EDTA to samples prevented de novo acetaldehyde formation from ethanol oxidation. Optimised derivatisation duration enhanced reproducibility and allowed for glucose and galacturonic acid quantification. High glucose residues were found to interfere with the recovery of other SO2 binders, but practical SO2 concentrations and red wine pigments did not affect derivatisation efficiency. The calibration range, method accuracy, precision and limits of detection were found to be satisfactory for routine analysis of SO2 binders in wines. The current method represents a significant improvement in the comprehensive analysis of SO2 binding wine carbonyls. It allows for the quantification of major SO2 binders at practical analyte concentrations, and uses a simple sample treatment method that prevents treatment artifacts. Equipment utilisation could be reduced by rapid LC separation while maintaining analytical performance parameters. The improved method will be a valuable addition for the analysis of total SO2 binder pools in oenological samples. Published by Elsevier Ltd.

  7. Cyanoacrylate adhesive technique in wound edge approximation.

    Science.gov (United States)

    Prahlow, J A; Lantz, P E

    1993-11-01

    Cyanoacrylate, the adhesive component of many commercially available strong-binding glues, has been used by the medical profession for various purposes, including tissue adhesion and repair, embolization, sclerotherapy, and hemostasis. Mortuary science professionals rely on cyanoacrylate's adhesive property to aid in body restoration techniques following embalming. Forensic applications include the use of cyanoacrylate fumes for latent fingerprint detection. An additional application for this sticky chemical is currently unrecognized by many within the forensic community. Specifically, cyanoacrylate's adhesive property makes possible the relatively simple, efficient, and rapid approximation of disrupted skin and tissue when warranted during a forensic autopsy. The final result is aesthetically pleasing and lends itself to subsequent photographic documentation especially when patterned injuries are encountered. We discuss the technique, benefits, and limitations of the cyanoacrylate adhesive method in this setting and present several cases wherein the technique has produced satisfying results.

  8. Approximate Bayesian Computation

    Science.gov (United States)

    Sunnåker, Mikael; Corander, Jukka; Foll, Matthieu; Dessimoz, Christophe

    2013-01-01

    Approximate Bayesian computation (ABC) constitutes a class of computational methods rooted in Bayesian statistics. In all model-based statistical inference, the likelihood function is of central importance, since it expresses the probability of the observed data under a particular statistical model, and thus quantifies the support data lend to particular values of parameters and to choices among different models. For simple models, an analytical formula for the likelihood function can typically be derived. However, for more complex models, an analytical formula might be elusive or the likelihood function might be computationally very costly to evaluate. ABC methods bypass the evaluation of the likelihood function. In this way, ABC methods widen the realm of models for which statistical inference can be considered. ABC methods are mathematically well-founded, but they inevitably make assumptions and approximations whose impact needs to be carefully assessed. Furthermore, the wider application domain of ABC exacerbates the challenges of parameter estimation and model selection. ABC has rapidly gained popularity over the last years and in particular for the analysis of complex problems arising in biological sciences (e.g., in population genetics, ecology, epidemiology, and systems biology). PMID:23341757

  9. Rapid QM/MM approach for biomolecular systems under periodic boundary conditions: Combination of the density-functional tight-binding theory and particle mesh Ewald method.

    Science.gov (United States)

    Nishizawa, Hiroaki; Okumura, Hisashi

    2016-12-05

    A quantum mechanical/molecular mechanical (QM/MM) approach based on the density-functional tight-binding (DFTB) theory is a useful tool for analyzing chemical reaction systems in detail. In this study, an efficient QM/MM method is developed by the combination of the DFTB/MM and particle mesh Ewald (PME) methods. Because the Fock matrix, which is required in the DFTB calculation, is analytically obtained by the PME method, the Coulomb energy is accurately and rapidly computed. For assessing the performance of this method, DFTB/MM calculations and molecular dynamics simulation are conducted for a system consisting of two amyloid-β(1-16) peptides and a zinc ion in explicit water under periodic boundary conditions. As compared with that of the conventional Ewald summation method, the computational cost of the Coulomb energy by utilizing the present approach is drastically reduced, i.e., 166.5 times faster. Furthermore, the deviation of the electronic energy is less than 10-6 Eh. © 2016 Wiley Periodicals, Inc. © 2016 Wiley Periodicals, Inc.

  10. Rapid and accurate assessment of GPCR-ligand interactions Using the fragment molecular orbital-based density-functional tight-binding method.

    Science.gov (United States)

    Morao, Inaki; Fedorov, Dmitri G; Robinson, Roger; Southey, Michelle; Townsend-Nicholson, Andrea; Bodkin, Mike J; Heifetz, Alexander

    2017-09-05

    The reliable and precise evaluation of receptor-ligand interactions and pair-interaction energy is an essential element of rational drug design. While quantum mechanical (QM) methods have been a promising means by which to achieve this, traditional QM is not applicable for large biological systems due to its high computational cost. Here, the fragment molecular orbital (FMO) method has been used to accelerate QM calculations, and by combining FMO with the density-functional tight-binding (DFTB) method we are able to decrease computational cost 1000 times, achieving results in seconds, instead of hours. We have applied FMO-DFTB to three different GPCR-ligand systems. Our results correlate well with site directed mutagenesis data and findings presented in the published literature, demonstrating that FMO-DFTB is a rapid and accurate means of GPCR-ligand interactions. © 2017 Authors. Journal of Computational Chemistry Published by Wiley Periodicals, Inc. © 2017 Authors. Journal of Computational Chemistry Published by Wiley Periodicals, Inc.

  11. Easy and Rapid Binding Assay for Functional Analysis of Disulfide-Containing Peptides by a Pull-Down Method Using a Puromycin-Linker and a Cell-Free Translation System

    Directory of Open Access Journals (Sweden)

    Yutaro Tanemura

    2015-03-01

    Full Text Available Constrained peptides are an attractive class as affinity reagents or drug leads owing to their excellent binding properties. Many kinds of these peptides, such as cyclic peptides containing disulfide bridges, are found in nature or designed artificially by directed evolution. However, confirming the binding properties of the disulfide-rich peptides can be generally difficult, because of oxidative folding problems in the preparation steps. Therefore, a method for evaluating the binding properties of such peptides rapidly and easily is required. Here, we report an easy and rapid method for preparing biotin-attached peptides containing disulfide bridges or a chemical cross-linker using a cell-free translation system and a puromycin-linker, which is applicable to pull-down assays for protein (or peptide molecular interaction analysis.

  12. Study of bacteriophage T4-encoded Dam DNA (adenine-N6)-methyltransferase binding with substrates by rapid laser UV cross-linking.

    Science.gov (United States)

    Evdokimov, Alexey A; Sclavi, Bianca; Zinoviev, Victor V; Malygin, Ernst G; Hattman, Stanley; Buckle, Malcolm

    2007-09-07

    DNA methyltransferases of the Dam family (including bacteriophage T4-encoded Dam DNA (adenine-N(6))-methyltransferase (T4Dam)) catalyze methyl group transfer from S-adenosyl-L-methionine (AdoMet), producing S-adenosyl-L-homocysteine (AdoHcy) and methylated adenine residues in palindromic GATC sequences. In this study, we describe the application of direct (i.e. no exogenous cross-linking reagents) laser UV cross-linking as a universal non-perturbing approach for studying the characteristics of T4Dam binding with substrates in the equilibrium and transient modes of interaction. UV irradiation of the enzyme.substrate complexes using an Nd(3+):yttrium aluminum garnet laser at 266 nm resulted in up to 3 and >15% yields of direct T4Dam cross-linking to DNA and AdoMet, respectively. Consequently, we were able to measure equilibrium constants and dissociation rates for enzyme.substrate complexes. In particular, we demonstrate that both reaction substrates, specific DNA and AdoMet (or product AdoHcy), stabilized the ternary complex. The improved substrate affinity for the enzyme in the ternary complex significantly reduced dissociation rates (up to 2 orders of magnitude). Several of the parameters obtained (such as dissociation rate constants for the binary T4Dam.AdoMet complex and for enzyme complexes with a nonfluorescent hemimethylated DNA duplex) were previously inaccessible by other means. However, where possible, the results of laser UV cross-linking were compared with those of fluorescence analysis. Our study suggests that rapid laser UV cross-linking efficiently complements standard DNA methyltransferase-related tools and is a method of choice to probe enzyme-substrate interactions in cases in which data cannot be acquired by other means.

  13. A FABP-ulous 'rule out' strategy? Heart fatty acid binding protein and troponin for rapid exclusion of acute myocardial infarction.

    Science.gov (United States)

    Body, Richard; McDowell, Garry; Carley, Simon; Wibberley, Christopher; Ferguson, Jamie; Mackway-Jones, Kevin

    2011-08-01

    Many Emergency Departments (EDs) utilise 'triple marker' testing with CK-MB, myoglobin and troponin I (cTnI) to exclude acute myocardial infarction (AMI) within hours of presentation. We evaluated the ability of 8 biomarkers to rapidly exclude AMI at the point of presentation and investigated whether 'triple marker' testing represents the optimal multimarker strategy. We recruited patients who presented to the ED with suspected cardiac chest pain occurring within 24 h. Blood was drawn at the time of presentation. Diagnostic value was assessed by calculating the area under the ROC curve (AUC) and a multivariate model was constructed by logistic regression. The primary outcome was a diagnosis of AMI, established by ≥12-h troponin testing in all patients. 705 included patients underwent venepuncture a median of 3.5 h after symptom onset. Heart fatty acid binding protein (H-FABP) had an AUC of 0.86 (95% CI 0.82-0.90), which was significantly higher than any other biomarker including cTnI. While no single biomarker could enable exclusion of AMI, multivariate analysis identified cTnI and H-FABP as the optimal biomarker combination. Combined with clinical risk stratification, this strategy had a sensitivity of 96.9%, specificity of 54.7%, PPV 32.4% and NPV 98.8%. We have derived an algorithm that would enable AMI to be immediately excluded in 315 (44.7%) patients at the cost of missing 6 AMIs per 1000 patients treated. While the risk is likely to be unacceptable for clinical implementation, we have highlighted an area for future development using serial testing and increasingly sensitive assays. Copyright © 2011 Elsevier Ireland Ltd. All rights reserved.

  14. Computing approximate diagnoses by using approximate entailment

    NARCIS (Netherlands)

    Teije, A. ten; Harmelen, van F.A.H.

    1996-01-01

    The most widely accepted models of diagnostic reasoning are all phrased in terms of the logical consequence relations. In work in recent years, Schaerf and Cadoli have proposed efficient approximations of the classical consequence relation. The central idea of this paper is to parameterise the

  15. Value Function Approximation or Stopping Time Approximation

    DEFF Research Database (Denmark)

    Stentoft, Lars

    2014-01-01

    In their 2001 paper, Longstaff and Schwartz suggested a method for American option pricing using simulation and regression, and since then this method has rapidly gained importance. However, the idea of using regression and simulation for American option pricing was used at least as early as 1996...

  16. Approximation of Laws

    Science.gov (United States)

    Niiniluoto, Ilkka

    2014-03-01

    Approximation of laws is an important theme in the philosophy of science. If we can make sense of the idea that two scientific laws are "close" to each other, then we can also analyze such methodological notions as approximate explanation of laws, approximate reduction of theories, approximate empirical success of theories, and approximate truth of laws. Proposals for measuring the distance between quantitative scientific laws were given in Niiniluoto (1982, 1987). In this paper, these definitions are reconsidered as a response to the interesting critical remarks by Liu (1999).

  17. Sparse approximation with bases

    CERN Document Server

    2015-01-01

    This book systematically presents recent fundamental results on greedy approximation with respect to bases. Motivated by numerous applications, the last decade has seen great successes in studying nonlinear sparse approximation. Recent findings have established that greedy-type algorithms are suitable methods of nonlinear approximation in both sparse approximation with respect to bases and sparse approximation with respect to redundant systems. These insights, combined with some previous fundamental results, form the basis for constructing the theory of greedy approximation. Taking into account the theoretical and practical demand for this kind of theory, the book systematically elaborates a theoretical framework for greedy approximation and its applications.  The book addresses the needs of researchers working in numerical mathematics, harmonic analysis, and functional analysis. It quickly takes the reader from classical results to the latest frontier, but is written at the level of a graduate course and do...

  18. Value Function Approximation or Stopping Time Approximation

    DEFF Research Database (Denmark)

    Stentoft, Lars

    2014-01-01

    In their 2001 paper, Longstaff and Schwartz suggested a method for American option pricing using simulation and regression, and since then this method has rapidly gained importance. However, the idea of using regression and simulation for American option pricing was used at least as early as 1996......, due to this difference, it is possible to provide arguments favoring the method of Longstaff and Schwartz. Finally, we compare the methods in a realistic numerical setting and show that practitioners would do well to choose the method of Longstaff and Schwartz instead of the methods of Carriere...

  19. Approximate Loop Unrolling

    OpenAIRE

    Rodriguez-Cancio, Marcelino; Combemale, Benoit; Baudry, Benoit

    2016-01-01

    We introduce Approximate Unrolling, a loop optimization that reduces execution time and energy consumption, exploiting the existence of code regions that can endure some degree of approximation while still producing acceptable results. This work focuses on a specific kind of forgiving region: counted loops that map a given functions over the elements of an array. Approximate Unrolling transforms loops in a similar way Loop Unrolling does. However, unlike its exact counterpart, our optimizatio...

  20. Expectation Consistent Approximate Inference

    DEFF Research Database (Denmark)

    Opper, Manfred; Winther, Ole

    2005-01-01

    We propose a novel framework for approximations to intractable probabilistic models which is based on a free energy formulation. The approximation can be understood from replacing an average over the original intractable distribution with a tractable one. It requires two tractable probability dis...

  1. Mathematics of Approximation

    CERN Document Server

    de Villiers, Johan

    2012-01-01

    The approximation of a continuous function by either an algebraic polynomial, a trigonometric polynomial, or a spline, is an important issue in application areas like computer-aided geometric design and signal analysis. This book is an introduction to the mathematical analysis of such approximation, and, with the prerequisites of only calculus and linear algebra, the material is targeted at senior undergraduate level, with a treatment that is both rigorous and self-contained. The topics include polynomial interpolation; Bernstein polynomials and the Weierstrass theorem; best approximations in

  2. Approximate calculation of integrals

    CERN Document Server

    Krylov, V I

    2006-01-01

    A systematic introduction to the principal ideas and results of the contemporary theory of approximate integration, this volume approaches its subject from the viewpoint of functional analysis. In addition, it offers a useful reference for practical computations. Its primary focus lies in the problem of approximate integration of functions of a single variable, rather than the more difficult problem of approximate integration of functions of more than one variable.The three-part treatment begins with concepts and theorems encountered in the theory of quadrature. The second part is devoted to t

  3. Algorithmes hiérarchiques rapides pour l’approximation de rang faible des matrices, applications à la physique des matériaux, la géostatistique et l’analyse de données

    OpenAIRE

    BLANCHARD, Pierre

    2017-01-01

    Advanced techniques for the low-rank approximation of matrices are crucial dimension reduction tools in many domains of modern scientific computing. Hierarchical approaches like H2-matrices, in particular the Fast Multipole Method (FMM), benefit from the block low-rank structure of certain matrices to reduce the cost of computing n-body problems to O(n) operations instead of O(n2). In order to better deal with kernels of various kinds, kernel independent FMM formulations have recently arisen ...

  4. Approximation Behooves Calibration

    DEFF Research Database (Denmark)

    da Silva Ribeiro, André Manuel; Poulsen, Rolf

    2013-01-01

    Calibration based on an expansion approximation for option prices in the Heston stochastic volatility model gives stable, accurate, and fast results for S&P500-index option data over the period 2005–2009....

  5. Approximation by mediants

    Science.gov (United States)

    Bosma, Wieb

    1990-01-01

    The distribution is determined of some sequences that measure how well a number is approximated by its mediants (or intermediate continued fraction convergents). The connection with a theorem of Fatou, as well as a new proof of this, is given.

  6. Approximation and Computation

    CERN Document Server

    Gautschi, Walter; Rassias, Themistocles M

    2011-01-01

    Approximation theory and numerical analysis are central to the creation of accurate computer simulations and mathematical models. Research in these areas can influence the computational techniques used in a variety of mathematical and computational sciences. This collection of contributed chapters, dedicated to renowned mathematician Gradimir V. Milovanovia, represent the recent work of experts in the fields of approximation theory and numerical analysis. These invited contributions describe new trends in these important areas of research including theoretic developments, new computational alg

  7. Covariant approximation averaging

    CERN Document Server

    Shintani, Eigo; Blum, Thomas; Izubuchi, Taku; Jung, Chulwoo; Lehner, Christoph

    2014-01-01

    We present a new class of statistical error reduction techniques for Monte-Carlo simulations. Using covariant symmetries, we show that correlation functions can be constructed from inexpensive approximations without introducing any systematic bias in the final result. We introduce a new class of covariant approximation averaging techniques, known as all-mode averaging (AMA), in which the approximation takes account of contributions of all eigenmodes through the inverse of the Dirac operator computed from the conjugate gradient method with a relaxed stopping condition. In this paper we compare the performance and computational cost of our new method with traditional methods using correlation functions and masses of the pion, nucleon, and vector meson in $N_f=2+1$ lattice QCD using domain-wall fermions. This comparison indicates that AMA significantly reduces statistical errors in Monte-Carlo calculations over conventional methods for the same cost.

  8. Dynamical Cluster Approximation

    Science.gov (United States)

    Fotso, H.; Yang, S.; Chen, K.; Pathak, S.; Moreno, J.; Jarrell, M.; Mikelsons, K.; Khatami, E.; Galanakis, D.

    The dynamical cluster approximation (DCA) is a method which systematically incorporates nonlocal corrections to the dynamical mean-field approximation. Here we present a pedagogical discussion of the DCA by describing it as a Φ-derivable coarse-graining approximation in k-space, which maps an infinite lattice problem onto a periodic finite-sized cluster embedded in a self-consistently determined effective medium. We demonstrate the method by applying it to the two-dimensional Hubbard model. From this application, we show evidences of the presence of a quantum critical point (QCP) at a finite doping underneath the superconducting dome. The QCP is associated with the second-order terminus of a line of first order phase separation transitions. This critical point is driven to zero temperature by varying the band parameters, generating the QCP. The effect of the proximity of the QCP to the superconducting dome is also discussed.

  9. Covariant approximation averaging

    Science.gov (United States)

    Shintani, Eigo; Arthur, Rudy; Blum, Thomas; Izubuchi, Taku; Jung, Chulwoo; Lehner, Christoph

    2015-06-01

    We present a new class of statistical error reduction techniques for Monte Carlo simulations. Using covariant symmetries, we show that correlation functions can be constructed from inexpensive approximations without introducing any systematic bias in the final result. We introduce a new class of covariant approximation averaging techniques, known as all-mode averaging (AMA), in which the approximation takes account of contributions of all eigenmodes through the inverse of the Dirac operator computed from the conjugate gradient method with a relaxed stopping condition. In this paper we compare the performance and computational cost of our new method with traditional methods using correlation functions and masses of the pion, nucleon, and vector meson in Nf=2 +1 lattice QCD using domain-wall fermions. This comparison indicates that AMA significantly reduces statistical errors in Monte Carlo calculations over conventional methods for the same cost.

  10. Introduction to Diophantine Approximation

    Directory of Open Access Journals (Sweden)

    Watase Yasushige

    2015-06-01

    Full Text Available In this article we formalize some results of Diophantine approximation, i.e. the approximation of an irrational number by rationals. A typical example is finding an integer solution (x, y of the inequality |xθ − y| ≤ 1/x, where 0 is a real number. First, we formalize some lemmas about continued fractions. Then we prove that the inequality has infinitely many solutions by continued fractions. Finally, we formalize Dirichlet’s proof (1842 of existence of the solution [12], [1].

  11. Rapid MALDI-TOF-MS analysis in the study of interaction between whole bacterial cells and human target molecules: binding of Bifidobacterium to human plasminogen.

    Science.gov (United States)

    Candela, Marco; Fiori, Jessica; Dipalo, Samuele; Naldi, Marina; Gotti, Roberto; Brigidi, Patrizia

    2008-06-01

    MALDI-TOF (Matrix Assisted Laser Desorption Ionization-Time of Flight)-mass spectrometry has been applied, for the first time, in the investigation of whole Bifidobacterium cells-host target proteins interaction. In particular, by means of this technique, a dose dependent human plasminogen-binding activity has been shown for Bifidobacterium. The involvement of lysine binding sites on the bacterial cell surface has been proved. The obtained result was found to be consistent with that from well-established standard methodologies, thus the proposed MALDI-TOF approach has the potential to enter as a fast alternative method in the field of biorecognition studies involving in bacterial cells and proteins of human origin.

  12. Prestack wavefield approximations

    KAUST Repository

    Alkhalifah, Tariq

    2013-09-01

    The double-square-root (DSR) relation offers a platform to perform prestack imaging using an extended single wavefield that honors the geometrical configuration between sources, receivers, and the image point, or in other words, prestack wavefields. Extrapolating such wavefields, nevertheless, suffers from limitations. Chief among them is the singularity associated with horizontally propagating waves. I have devised highly accurate approximations free of such singularities which are highly accurate. Specifically, I use Padé expansions with denominators given by a power series that is an order lower than that of the numerator, and thus, introduce a free variable to balance the series order and normalize the singularity. For the higher-order Padé approximation, the errors are negligible. Additional simplifications, like recasting the DSR formula as a function of scattering angle, allow for a singularity free form that is useful for constant-angle-gather imaging. A dynamic form of this DSR formula can be supported by kinematic evaluations of the scattering angle to provide efficient prestack wavefield construction. Applying a similar approximation to the dip angle yields an efficient 1D wave equation with the scattering and dip angles extracted from, for example, DSR ray tracing. Application to the complex Marmousi data set demonstrates that these approximations, although they may provide less than optimal results, allow for efficient and flexible implementations. © 2013 Society of Exploration Geophysicists.

  13. Approximate and Incomplete Factorizations

    NARCIS (Netherlands)

    Chan, T.F.; Vorst, H.A. van der

    1997-01-01

    In this chapter, we give a brief overview of a particular class of preconditioners known as incomplete factorizations. They can be thought of as approximating the exact LU factorization of a given matrix A (e.g. computed via Gaussian elimination) by disallowing certain ll-ins. As opposed to other

  14. Prestack traveltime approximations

    KAUST Repository

    Alkhalifah, Tariq Ali

    2011-01-01

    Most prestack traveltime relations we tend work with are based on homogeneous (or semi-homogenous, possibly effective) media approximations. This includes the multi-focusing or double square-root (DSR) and the common reflection stack (CRS) equations. Using the DSR equation, I analyze the associated eikonal form in the general source-receiver domain. Like its wave-equation counterpart, it suffers from a critical singularity for horizontally traveling waves. As a result, I derive expansion based solutions of this eikonal based on polynomial expansions in terms of the reflection and dip angles in a generally inhomogenous background medium. These approximate solutions are free of singularities and can be used to estimate travetimes for small to moderate offsets (or reflection angles) in a generally inhomogeneous medium. A Marmousi example demonstrates the usefulness of the approach. © 2011 Society of Exploration Geophysicists.

  15. Topology, calculus and approximation

    CERN Document Server

    Komornik, Vilmos

    2017-01-01

    Presenting basic results of topology, calculus of several variables, and approximation theory which are rarely treated in a single volume, this textbook includes several beautiful, but almost forgotten, classical theorems of Descartes, Erdős, Fejér, Stieltjes, and Turán. The exposition style of Topology, Calculus and Approximation follows the Hungarian mathematical tradition of Paul Erdős and others. In the first part, the classical results of Alexandroff, Cantor, Hausdorff, Helly, Peano, Radon, Tietze and Urysohn illustrate the theories of metric, topological and normed spaces. Following this, the general framework of normed spaces and Carathéodory's definition of the derivative are shown to simplify the statement and proof of various theorems in calculus and ordinary differential equations. The third and final part is devoted to interpolation, orthogonal polynomials, numerical integration, asymptotic expansions and the numerical solution of algebraic and differential equations. Students of both pure an...

  16. Pumping approximately integrable systems

    Science.gov (United States)

    Lange, Florian; Lenarčič, Zala; Rosch, Achim

    2017-06-01

    Weak perturbations can drive an interacting many-particle system far from its initial equilibrium state if one is able to pump into degrees of freedom approximately protected by conservation laws. This concept has for example been used to realize Bose-Einstein condensates of photons, magnons and excitons. Integrable quantum systems, like the one-dimensional Heisenberg model, are characterized by an infinite set of conservation laws. Here, we develop a theory of weakly driven integrable systems and show that pumping can induce large spin or heat currents even in the presence of integrability breaking perturbations, since it activates local and quasi-local approximate conserved quantities. The resulting steady state is qualitatively captured by a truncated generalized Gibbs ensemble with Lagrange parameters that depend on the structure but not on the overall amplitude of perturbations nor the initial state. We suggest to use spin-chain materials driven by terahertz radiation to realize integrability-based spin and heat pumps.

  17. Optimization and approximation

    CERN Document Server

    Pedregal, Pablo

    2017-01-01

    This book provides a basic, initial resource, introducing science and engineering students to the field of optimization. It covers three main areas: mathematical programming, calculus of variations and optimal control, highlighting the ideas and concepts and offering insights into the importance of optimality conditions in each area. It also systematically presents affordable approximation methods. Exercises at various levels have been included to support the learning process.

  18. Variable primary coordination environments of Cd(ɪɪ) binding to three helix bundles provide a pathway for rapid metal exchange

    DEFF Research Database (Denmark)

    Tebo, Alison G.; Hemmingsen, Lars Bo Stegeager; Pecoraro, Vincent L.

    2015-01-01

    exchange between CdS3O and CdS4 coordination spheres. Correlation of (111m)Cd PAC spectroscopy and (113)Cd NMR spectroscopy suggests that Cd(ii) coordinated to CadC is in fast exchange between CdS3O and CdS4 forms, which may provide a mechanism for rapid sensing of heavy metal contaminants...

  19. A selective and label-free strategy for rapid screening of telomere-binding Ligands via fluorescence regulation of DNA/silver nanocluster

    Science.gov (United States)

    Cheng, Rui; Xu, Jing; Zhang, Xiafei; Shi, Zhilu; Zhang, Qi; Jin, Yan

    2017-03-01

    Herein, the conformational switch of G-rich oligonucleotide (GDNA) demonstrated the obvious functional switch of GDNA which was found to significantly affect the fluorescence of the in-situ synthesized DNA/silver nanocluster (DNA-AgNC) in homogeneous solution. We envisioned that the allosteric interaction between GDNA and DNA-AgNC would be possible to be used for screening telomere-binding ligands. A unimolecular probe (12C5TG) is ingeniously designed consisting of three contiguous DNA elements: G-rich telomeric DNA (GDNA) as molecular recognition sequence, T-rich DNA as linker and C-rich DNA as template of DNA-AgNC. The quantum yield and stability of 12C5TG-AgNC is greatly improved because the nearby deoxyguanosines tended to protect DNA/AgNC against oxidation. However, in the presence of ligands, the formation of G-quadruplex obviously quenched the fluorescence of DNA-AgNC. By taking full advantage of intramolecular allosteric effect, telomere-binding ligands were selectively and label-free screened by using deoxyguanines and G-quadruplex as natural fluorescence enhancer and quencher of DNA-AgNC respectively. Therefore, the functional switching of G-rich structure offers a cost-effective, facile and reliable way to screen drugs, which holds a great potential in bioanalysis as well.

  20. Finite elements and approximation

    CERN Document Server

    Zienkiewicz, O C

    2006-01-01

    A powerful tool for the approximate solution of differential equations, the finite element is extensively used in industry and research. This book offers students of engineering and physics a comprehensive view of the principles involved, with numerous illustrative examples and exercises.Starting with continuum boundary value problems and the need for numerical discretization, the text examines finite difference methods, weighted residual methods in the context of continuous trial functions, and piecewise defined trial functions and the finite element method. Additional topics include higher o

  1. Approximation and perturbation methods

    CERN Document Server

    Iyer, B R

    1993-01-01

    Few problems in nature are amenable to an exact solution and hence when one proceeds from elegant problems of theory to messy complicated problems of practice one is forced to recourse to methods of approximation and perturbation. The development of such techniques has been natural in attempts to extract physically verifiable consequences from either exact solutions of general relativity or from specific astrophysical systems for which an exact solution is impossible to find. However, this should not be taken to imply giving up of mathematical rigour and an appeal to only physical intuition.

  2. Validation of a rapid enzyme immunoassay for the quantitation of retinol-binding protein to assess vitamin A status within populations.

    Science.gov (United States)

    Hix, J; Rasca, P; Morgan, J; Denna, S; Panagides, D; Tam, M; Shankar, A H

    2006-11-01

    To compare the prevalence of vitamin A deficiency (VAD) among Cambodian preschool children as determined by the retinol-binding protein-enzyme immunoassay (RBP-EIA) and direct measurement of serum retinol by high-performance liquid chromatography (HPLC). Sera from 359 children were randomly selected from archived specimens collected in a national VAD prevalence survey in Cambodia. Sera were first analyzed for retinol content by HPLC and then subjected to analysis using RBP-EIA to determine serum RBP concentrations. National Institute of Standards and Technology and control sera were used to ensure quality and accuracy for each set of analyses. To classify VAD, the same cutoff point of programs in resource-poor settings.

  3. Approximation by Cylinder Surfaces

    DEFF Research Database (Denmark)

    Randrup, Thomas

    1997-01-01

    We present a new method for approximation of a given surface by a cylinder surface. It is a constructive geometric method, leading to a monorail representation of the cylinder surface. By use of a weighted Gaussian image of the given surface, we determine a projection plane. In the orthogonal...... projection of the surface onto this plane, a reference curve is determined by use of methods for thinning of binary images. Finally, the cylinder surface is constructed as follows: the directrix of the cylinder surface is determined by a least squares method minimizing the distance to the points...... in the projection within a tolerance given by the reference curve, and the rulings are lines perpendicular to the projection plane. Application of the method in ship design is given....

  4. Approximate gauge symemtry of composite vector bosons

    Energy Technology Data Exchange (ETDEWEB)

    Suzuki, Mahiko

    2010-06-01

    It can be shown in a solvable field theory model that the couplings of the composite vector mesons made of a fermion pair approach the gauge couplings in the limit of strong binding. Although this phenomenon may appear accidental and special to the vector bosons made of a fermion pair, we extend it to the case of bosons being constituents and find that the same phenomenon occurs in more an intriguing way. The functional formalism not only facilitates computation but also provides us with a better insight into the generating mechanism of approximate gauge symmetry, in particular, how the strong binding and global current conservation conspire to generate such an approximate symmetry. Remarks are made on its possible relevance or irrelevance to electroweak and higher symmetries.

  5. Leveraging Gaussian process approximations for rapid image overlay production

    CSIR Research Space (South Africa)

    Burke, Michael

    2017-10-01

    Full Text Available ]. These visualisation tools can often be used to generate model-speciic saliency maps. For example, sensitivity analysis visualisation strategies have been proposed for classiication models [3]. These approaches at- tempt to determine howmuch a pixel needs to be changed... tomodify a predicted classiication label. An alternative visualisation strategy relies on layer-wise relevance propagation [2]. Here, a relevance score is assigned to each layer of a machine learning model and these relevance scores are propagated through...

  6. Prestack traveltime approximations

    KAUST Repository

    Alkhalifah, Tariq Ali

    2012-05-01

    Many of the explicit prestack traveltime relations used in practice are based on homogeneous (or semi-homogenous, possibly effective) media approximations. This includes the multifocusing, based on the double square-root (DSR) equation, and the common reflection stack (CRS) approaches. Using the DSR equation, I constructed the associated eikonal form in the general source-receiver domain. Like its wave-equation counterpart, it suffers from a critical singularity for horizontally traveling waves. As a result, I recasted the eikonal in terms of the reflection angle, and thus, derived expansion based solutions of this eikonal in terms of the difference between the source and receiver velocities in a generally inhomogenous background medium. The zero-order term solution, corresponding to ignoring the lateral velocity variation in estimating the prestack part, is free of singularities and can be used to estimate traveltimes for small to moderate offsets (or reflection angles) in a generally inhomogeneous medium. The higher-order terms include limitations for horizontally traveling waves, however, we can readily enforce stability constraints to avoid such singularities. In fact, another expansion over reflection angle can help us avoid these singularities by requiring the source and receiver velocities to be different. On the other hand, expansions in terms of reflection angles result in singularity free equations. For a homogenous background medium, as a test, the solutions are reasonably accurate to large reflection and dip angles. A Marmousi example demonstrated the usefulness and versatility of the formulation. © 2012 Society of Exploration Geophysicists.

  7. Rapid changes in phospho-MAP/tau epitopes during neuronal stress: cofilin-actin rods primarily recruit microtubule binding domain epitopes.

    Directory of Open Access Journals (Sweden)

    Ineka T Whiteman

    Full Text Available Abnormal mitochondrial function is a widely reported contributor to neurodegenerative disease including Alzheimer's disease (AD, however, a mechanistic link between mitochondrial dysfunction and the initiation of neuropathology remains elusive. In AD, one of the earliest hallmark pathologies is neuropil threads comprising accumulated hyperphosphorylated microtubule-associated protein (MAP tau in neurites. Rod-like aggregates of actin and its associated protein cofilin (AC rods also occur in AD. Using a series of antibodies--AT270, AT8, AT100, S214, AT180, 12E8, S396, S404 and S422--raised against different phosphoepitopes on tau, we characterize the pattern of expression and re-distribution in neurites of these phosphoepitope labels during mitochondrial inhibition. Employing chick primary neuron cultures, we demonstrate that epitopes recognized by the monoclonal antibody 12E8, are the only species rapidly recruited into AC rods. These results were recapitulated with the actin depolymerizing drug Latrunculin B, which induces AC rods and a concomitant increase in the 12E8 signal measured on Western blot. This suggests that AC rods may be one way in which MAP redistribution and phosphorylation is influenced in neurons during mitochondrial stress and potentially in the early pathogenesis of AD.

  8. International Conference Approximation Theory XV

    CERN Document Server

    Schumaker, Larry

    2017-01-01

    These proceedings are based on papers presented at the international conference Approximation Theory XV, which was held May 22–25, 2016 in San Antonio, Texas. The conference was the fifteenth in a series of meetings in Approximation Theory held at various locations in the United States, and was attended by 146 participants. The book contains longer survey papers by some of the invited speakers covering topics such as compressive sensing, isogeometric analysis, and scaling limits of polynomials and entire functions of exponential type. The book also includes papers on a variety of current topics in Approximation Theory drawn from areas such as advances in kernel approximation with applications, approximation theory and algebraic geometry, multivariate splines for applications, practical function approximation, approximation of PDEs, wavelets and framelets with applications, approximation theory in signal processing, compressive sensing, rational interpolation, spline approximation in isogeometric analysis, a...

  9. Hierarchical low-rank approximation for high dimensional approximation

    KAUST Repository

    Nouy, Anthony

    2016-01-07

    Tensor methods are among the most prominent tools for the numerical solution of high-dimensional problems where functions of multiple variables have to be approximated. Such high-dimensional approximation problems naturally arise in stochastic analysis and uncertainty quantification. In many practical situations, the approximation of high-dimensional functions is made computationally tractable by using rank-structured approximations. In this talk, we present algorithms for the approximation in hierarchical tensor format using statistical methods. Sparse representations in a given tensor format are obtained with adaptive or convex relaxation methods, with a selection of parameters using crossvalidation methods.

  10. INHOMOGENEOUS DIOPHANTINE APPROXIMATION WITH PRIME ...

    Indian Academy of Sciences (India)

    50

    INHOMOGENEOUS DIOPHANTINE APPROXIMATION WITH PRIME. CONSTRAINTS. STEPHAN BAIER AND ANISH GHOSH. Abstract. We study the problem of ... this area under primality constraints. Indeed, the ...... [7] A. Ghosh, Diophantine approximation on subspaces of Rn and dynamics on homogeneous spaces, to.

  11. Diophantine approximation in prescribed degree

    OpenAIRE

    Schleischitz, Johannes

    2017-01-01

    We investigate approximation to a given real number by algebraic numbers and algebraic integers of prescribed degree. We deal with both best and uniform approximation, and highlight the similarities and differences compared with the intensely studied problem of approximation by algebraic numbers (and integers) of bounded degree. We establish the answer to a question of Bugeaud concerning approximation to transcendental real numbers by quadratic irrational numbers, and thereby we refine a resu...

  12. Exact constants in approximation theory

    CERN Document Server

    Korneichuk, N

    1991-01-01

    This book is intended as a self-contained introduction for non-specialists, or as a reference work for experts, to the particular area of approximation theory that is concerned with exact constants. The results apply mainly to extremal problems in approximation theory, which in turn are closely related to numerical analysis and optimization. The book encompasses a wide range of questions and problems: best approximation by polynomials and splines; linear approximation methods, such as spline-approximation; optimal reconstruction of functions and linear functionals. Many of the results are base

  13. International Conference Approximation Theory XIV

    CERN Document Server

    Schumaker, Larry

    2014-01-01

    This volume developed from papers presented at the international conference Approximation Theory XIV,  held April 7–10, 2013 in San Antonio, Texas. The proceedings contains surveys by invited speakers, covering topics such as splines on non-tensor-product meshes, Wachspress and mean value coordinates, curvelets and shearlets, barycentric interpolation, and polynomial approximation on spheres and balls. Other contributed papers address a variety of current topics in approximation theory, including eigenvalue sequences of positive integral operators, image registration, and support vector machines. This book will be of interest to mathematicians, engineers, and computer scientists working in approximation theory, computer-aided geometric design, numerical analysis, and related approximation areas.

  14. Scaled hydrogenic approximation wavefunctions. [Hartree-Fock approximation

    Energy Technology Data Exchange (ETDEWEB)

    Shore, B.W.

    1979-09-01

    Although widespread use of computer codes for the solution of Schrodinger equations makes available numerical Hartree-Fock model radial wave functions, there remains persistant interest in simple analytic expressions for atomic wave functions. One such frequency favored approach employs hydrogenic functions, suitably scaled, as approximate wave functions. The following note displays typical inaccuracies to be expected from such approximations. 13 references.

  15. Truthful approximations to range voting

    DEFF Research Database (Denmark)

    Filos-Ratsika, Aris; Miltersen, Peter Bro

    We consider the fundamental mechanism design problem of approximate social welfare maximization under general cardinal preferences on a finite number of alternatives and without money. The well-known range voting scheme can be thought of as a non-truthful mechanism for exact social welfare......-unilateral has an approximation ratio between 0.610 and 0.611, the best ordinal mechanism has an approximation ratio between 0.616 and 0.641, while the best mixed-unilateral mechanism has an approximation ratio bigger than 0.660. In particular, the best mixed-unilateral non-ordinal (i.e., cardinal) mechanism...

  16. Performance approximation of pick-to-belt orderpicking systems

    NARCIS (Netherlands)

    M.B.M. de Koster (René)

    1994-01-01

    textabstractIn this paper, an approximation method is discussed for the analysis of pick-to-belt orderpicking systems. The aim of the approximation method is to provide an instrument for obtaining rapid insight in the performance of designs of pick-to-belt orderpicking systems. It can be used to

  17. Approximate circuits for increased reliability

    Science.gov (United States)

    Hamlet, Jason R.; Mayo, Jackson R.

    2015-08-18

    Embodiments of the invention describe a Boolean circuit having a voter circuit and a plurality of approximate circuits each based, at least in part, on a reference circuit. The approximate circuits are each to generate one or more output signals based on values of received input signals. The voter circuit is to receive the one or more output signals generated by each of the approximate circuits, and is to output one or more signals corresponding to a majority value of the received signals. At least some of the approximate circuits are to generate an output value different than the reference circuit for one or more input signal values; however, for each possible input signal value, the majority values of the one or more output signals generated by the approximate circuits and received by the voter circuit correspond to output signal result values of the reference circuit.

  18. Approximate circuits for increased reliability

    Energy Technology Data Exchange (ETDEWEB)

    Hamlet, Jason R.; Mayo, Jackson R.

    2015-12-22

    Embodiments of the invention describe a Boolean circuit having a voter circuit and a plurality of approximate circuits each based, at least in part, on a reference circuit. The approximate circuits are each to generate one or more output signals based on values of received input signals. The voter circuit is to receive the one or more output signals generated by each of the approximate circuits, and is to output one or more signals corresponding to a majority value of the received signals. At least some of the approximate circuits are to generate an output value different than the reference circuit for one or more input signal values; however, for each possible input signal value, the majority values of the one or more output signals generated by the approximate circuits and received by the voter circuit correspond to output signal result values of the reference circuit.

  19. The oral apparatus of Tetrahymena pyriformis, strain WH-6. III. The binding of 3H-cytochalasin B by the isolated oral apparatus.

    Science.gov (United States)

    Gavin, R H

    1976-07-01

    The binding of tritium-labelled cytochalasin B by the isolated oral apparatus of Tetrahymena pyriformis, strain WH-6, syngen 1, was investigated. Equilibrium binding studies revealed approximately 1.4 x 10(5) cytochalasin B binding sites per oral apparatus. A Scatchard plot indicates a single class of binding affinities with an association constant of 10(5) liters/mole. Rapid release of oral apparatus-bound cytochalasin B occurred when oral apparatuses were washed and resuspended in 1 mM TRIS without cytochalasin B. Because cytochalasin B binding to oral apparatus microtubular protein was not detected, microtubules are probably not the cytochalasin B binding site. The probable nature of the cytochalasin B binding site within the oral apparatus is discussed.

  20. Approximate Implicitization Using Linear Algebra

    Directory of Open Access Journals (Sweden)

    Oliver J. D. Barrowclough

    2012-01-01

    Full Text Available We consider a family of algorithms for approximate implicitization of rational parametric curves and surfaces. The main approximation tool in all of the approaches is the singular value decomposition, and they are therefore well suited to floating-point implementation in computer-aided geometric design (CAGD systems. We unify the approaches under the names of commonly known polynomial basis functions and consider various theoretical and practical aspects of the algorithms. We offer new methods for a least squares approach to approximate implicitization using orthogonal polynomials, which tend to be faster and more numerically stable than some existing algorithms. We propose several simple propositions relating the properties of the polynomial bases to their implicit approximation properties.

  1. Rollout sampling approximate policy iteration

    NARCIS (Netherlands)

    Dimitrakakis, C.; Lagoudakis, M.G.

    2008-01-01

    Several researchers have recently investigated the connection between reinforcement learning and classification. We are motivated by proposals of approximate policy iteration schemes without value functions, which focus on policy representation using classifiers and address policy learning as a

  2. -commuting maps and invariant approximations

    Directory of Open Access Journals (Sweden)

    Rhoades BE

    2006-01-01

    Full Text Available We obtain common fixed point results for generalized -nonexpansive -commuting maps. As applications, various best approximation results for this class of maps are derived in the setup of certain metrizable topological vector spaces.

  3. Some results in Diophantine approximation

    DEFF Research Database (Denmark)

    Pedersen, Steffen Højris

    This thesis consists of three papers in Diophantine approximation, a subbranch of number theory. Preceding these papers is an introduction to various aspects of Diophantine approximation and formal Laurent series over Fq and a summary of each of the three papers. The introduction introduces...... the basic concepts on which the papers build. Among other it introduces metric Diophantine approximation, Mahler’s approach on algebraic approximation, the Hausdorff measure, and properties of the formal Laurent series over Fq. The introduction ends with a discussion on Mahler’s problem when considered....... The first part is about a failed attempt of applying dynamical methods to obtain results and is not part of the paper. It explains the ideas of how the real case works and what goes wrong in the case of the formal Laurent series. The second part contains the results of the paper and sketches of the proofs....

  4. Weighted approximation with varying weight

    CERN Document Server

    Totik, Vilmos

    1994-01-01

    A new construction is given for approximating a logarithmic potential by a discrete one. This yields a new approach to approximation with weighted polynomials of the form w"n"(" "= uppercase)P"n"(" "= uppercase). The new technique settles several open problems, and it leads to a simple proof for the strong asymptotics on some L p(uppercase) extremal problems on the real line with exponential weights, which, for the case p=2, are equivalent to power- type asymptotics for the leading coefficients of the corresponding orthogonal polynomials. The method is also modified toyield (in a sense) uniformly good approximation on the whole support. This allows one to deduce strong asymptotics in some L p(uppercase) extremal problems with varying weights. Applications are given, relating to fast decreasing polynomials, asymptotic behavior of orthogonal polynomials and multipoint Pade approximation. The approach is potential-theoretic, but the text is self-contained.

  5. Shearlets and Optimally Sparse Approximations

    DEFF Research Database (Denmark)

    Kutyniok, Gitta; Lemvig, Jakob; Lim, Wang-Q

    2012-01-01

    Multivariate functions are typically governed by anisotropic features such as edges in images or shock fronts in solutions of transport-dominated equations. One major goal both for the purpose of compression as well as for an efficient analysis is the provision of optimally sparse approximations...... of such functions. Recently, cartoon-like images were introduced in 2D and 3D as a suitable model class, and approximation properties were measured by considering the decay rate of the $L^2$ error of the best $N$-term approximation. Shearlet systems are to date the only representation system, which provide...... optimally sparse approximations of this model class in 2D as well as 3D. Even more, in contrast to all other directional representation systems, a theory for compactly supported shearlet frames was derived which moreover also satisfy this optimality benchmark. This chapter shall serve as an introduction...

  6. Approximate number sense theory or approximate theory of magnitude?

    Science.gov (United States)

    Content, Alain; Velde, Michael Vande; Adriano, Andrea

    2017-01-01

    Leibovich et al. argue that the evidence in favor of a perceptual mechanism devoted to the extraction of numerosity from visual collections is unsatisfactory and propose to replace it with an unspecific mechanism capturing approximate magnitudes from continuous dimensions. We argue that their representation of the evidence is incomplete and that their theoretical proposal is too vague to be useful.

  7. Approximate entropy of network parameters

    Science.gov (United States)

    West, James; Lacasa, Lucas; Severini, Simone; Teschendorff, Andrew

    2012-04-01

    We study the notion of approximate entropy within the framework of network theory. Approximate entropy is an uncertainty measure originally proposed in the context of dynamical systems and time series. We first define a purely structural entropy obtained by computing the approximate entropy of the so-called slide sequence. This is a surrogate of the degree sequence and it is suggested by the frequency partition of a graph. We examine this quantity for standard scale-free and Erdös-Rényi networks. By using classical results of Pincus, we show that our entropy measure often converges with network size to a certain binary Shannon entropy. As a second step, with specific attention to networks generated by dynamical processes, we investigate approximate entropy of horizontal visibility graphs. Visibility graphs allow us to naturally associate with a network the notion of temporal correlations, therefore providing the measure a dynamical garment. We show that approximate entropy distinguishes visibility graphs generated by processes with different complexity. The result probes to a greater extent these networks for the study of dynamical systems. Applications to certain biological data arising in cancer genomics are finally considered in the light of both approaches.

  8. Approximation methods in probability theory

    CERN Document Server

    Čekanavičius, Vydas

    2016-01-01

    This book presents a wide range of well-known and less common methods used for estimating the accuracy of probabilistic approximations, including the Esseen type inversion formulas, the Stein method as well as the methods of convolutions and triangle function. Emphasising the correct usage of the methods presented, each step required for the proofs is examined in detail. As a result, this textbook provides valuable tools for proving approximation theorems. While Approximation Methods in Probability Theory will appeal to everyone interested in limit theorems of probability theory, the book is particularly aimed at graduate students who have completed a standard intermediate course in probability theory. Furthermore, experienced researchers wanting to enlarge their toolkit will also find this book useful.

  9. Diophantine approximation and Dirichlet series

    CERN Document Server

    Queffélec, Hervé

    2013-01-01

    This self-contained book will benefit beginners as well as researchers. It is devoted to Diophantine approximation, the analytic theory of Dirichlet series, and some connections between these two domains, which often occur through the Kronecker approximation theorem. Accordingly, the book is divided into seven chapters, the first three of which present tools from commutative harmonic analysis, including a sharp form of the uncertainty principle, ergodic theory and Diophantine approximation to be used in the sequel. A presentation of continued fraction expansions, including the mixing property of the Gauss map, is given. Chapters four and five present the general theory of Dirichlet series, with classes of examples connected to continued fractions, the famous Bohr point of view, and then the use of random Dirichlet series to produce non-trivial extremal examples, including sharp forms of the Bohnenblust-Hille theorem. Chapter six deals with Hardy-Dirichlet spaces, which are new and useful Banach spaces of anal...

  10. Best Approximation in Numerical Radius

    OpenAIRE

    Aksoy, Asuman Guven; Lewicki, Grzegorz

    2010-01-01

    Let $X$ be a reflexive Banach space. In this paper we give a necessary and sufficient condition for an operator $T\\in \\mathcal{K}(X)$ to have the best approximation in numerical radius from the convex subset $\\mathcal{U} \\subset \\mathcal{K}(X),$ where $\\mathcal{K}(X)$ denotes the set of all linear, compact operators from $X$ into $X.$ We will also present an application to minimal extensions with respect to the numerical radius. In particular some results on best approximation in norm will be...

  11. Face Recognition using Approximate Arithmetic

    DEFF Research Database (Denmark)

    Marso, Karol

    Face recognition is image processing technique which aims to identify human faces and found its use in various different fields for example in security. Throughout the years this field evolved and there are many approaches and many different algorithms which aim to make the face recognition as effective...... processing applications the results do not need to be completely precise and use of the approximate arithmetic can lead to reduction in terms of delay, space and power consumption. In this paper we examine possible use of approximate arithmetic in face recognition using Eigenfaces algorithm....

  12. Involvement of 1,25D{sub 3}-MARRS (membrane associated, rapid response steroid-binding), a novel vitamin D receptor, in growth inhibition of breast cancer cells

    Energy Technology Data Exchange (ETDEWEB)

    Richard, Cynthia L. [Department of Human Health and Nutritional Sciences, University of Guelph, Guelph, Ontario, Canada N1G2W1 (Canada); Farach-Carson, Mary C.; Rohe, Ben [Department of Biological Sciences, University of Delaware, Newark, DE 19716 (United States); Nemere, Ilka [Department of Nutrition and Food Sciences, Center for Integrated BioSystems, Utah State University, Logan, UT 84322 8700 (United States); Meckling, Kelly A., E-mail: kmecklin@uoguelph.ca [Department of Human Health and Nutritional Sciences, University of Guelph, Guelph, Ontario, Canada N1G2W1 (Canada)

    2010-03-10

    In addition to classical roles in calcium homeostasis and bone development, 1,25 dihydroxyvitamin D{sub 3} [1,25(OH){sub 2}D{sub 3}] inhibits the growth of several cancer types, including breast cancer. Although cellular effects of 1,25(OH){sub 2}D{sub 3} traditionally have been attributed to activation of a nuclear vitamin D receptor (VDR), a novel receptor for 1,25(OH){sub 2}D{sub 3} called 1,25D{sub 3}-MARRS (membrane-associated, rapid response steroid-binding) protein was identified recently. The purpose of this study was to determine if the level of 1,25D{sub 3}-MARRS expression modulates 1,25(OH){sub 2}D{sub 3} activity in breast cancer cells. Relative levels of 1,25D{sub 3}-MARRS protein in MCF-7, MDA MB 231, and MCF-10A cells were estimated by real-time RT-PCR and Western blotting. To determine if 1,25D{sub 3}-MARRS receptor was involved in the growth inhibitory effects of 1,25(OH){sub 2}D{sub 3} in MCF-7 cells, a ribozyme construct designed to knock down 1,25D{sub 3}-MARRS mRNA was stably transfected into MCF-7 cells. MCF-7 clones in which 1,25D{sub 3}-MARRS receptor expression was reduced showed increased sensitivity to 1,25(OH){sub 2}D{sub 3} ( IC{sub 50} 56 {+-} 24 nM) compared to controls (319 {+-} 181 nM; P < 0.05). Reduction in 1,25D{sub 3}-MARRS receptor lengthened the doubling time in transfectants treated with 1,25(OH){sub 2}D{sub 3}. Knockdown of 1,25D{sub 3}-MARRS receptor also increased the sensitivity of MCF-7 cells to the vitamin D analogs KH1060 and MC903, but not to unrelated agents (all-trans retinoic acid, paclitaxel, serum/glucose starvation, or the isoflavone, pomiferin). These results suggest that 1,25D{sub 3}-MARRS receptor expression interferes with the growth inhibitory activity of 1,25(OH){sub 2}D{sub 3} in breast cancer cells, possibly through the nuclear VDR. Further research should examine the potential for pharmacological or natural agents that modify 1,25D{sub 3}-MARRS expression or activity as anticancer agents.

  13. Approximate Reanalysis in Topology Optimization

    DEFF Research Database (Denmark)

    Amir, Oded; Bendsøe, Martin P.; Sigmund, Ole

    2009-01-01

    In the nested approach to structural optimization, most of the computational effort is invested in the solution of the finite element analysis equations. In this study, the integration of an approximate reanalysis procedure into the framework of topology optimization of continuum structures...

  14. Approximation by Penultimate Stable Laws

    NARCIS (Netherlands)

    L.F.M. de Haan (Laurens); L. Peng (Liang); H. Iglesias Pereira

    1997-01-01

    textabstractIn certain cases partial sums of i.i.d. random variables with finite variance are better approximated by a sequence of stable distributions with indices \\\\alpha_n \\\\to 2 than by a normal distribution. We discuss when this happens and how much the convergence rate can be improved by using

  15. Approximation properties of haplotype tagging

    Directory of Open Access Journals (Sweden)

    Dreiseitl Stephan

    2006-01-01

    Full Text Available Abstract Background Single nucleotide polymorphisms (SNPs are locations at which the genomic sequences of population members differ. Since these differences are known to follow patterns, disease association studies are facilitated by identifying SNPs that allow the unique identification of such patterns. This process, known as haplotype tagging, is formulated as a combinatorial optimization problem and analyzed in terms of complexity and approximation properties. Results It is shown that the tagging problem is NP-hard but approximable within 1 + ln((n2 - n/2 for n haplotypes but not approximable within (1 - ε ln(n/2 for any ε > 0 unless NP ⊂ DTIME(nlog log n. A simple, very easily implementable algorithm that exhibits the above upper bound on solution quality is presented. This algorithm has running time O((2m - p + 1 ≤ O(m(n2 - n/2 where p ≤ min(n, m for n haplotypes of size m. As we show that the approximation bound is asymptotically tight, the algorithm presented is optimal with respect to this asymptotic bound. Conclusion The haplotype tagging problem is hard, but approachable with a fast, practical, and surprisingly simple algorithm that cannot be significantly improved upon on a single processor machine. Hence, significant improvement in computatational efforts expended can only be expected if the computational effort is distributed and done in parallel.

  16. APPROXIMATE MODELS FOR FLOOD ROUTING

    African Journals Online (AJOL)

    kinematic model and a nonlinear convection-diffusion model are extracted from a normalized form of the St. Venant equations, and applied to ... normal flow condition is moderate. Keywords: approximate models, nonlinear kinematic ... The concern here is with the movement of an abnormal amount of water along a river or ...

  17. Approximation for Bayesian Ability Estimation.

    Science.gov (United States)

    1987-02-18

    two-way contingency tables. Journal of Educational Statistics, 11, 33-56. Lindley, D.V. (1980). Approximate Bayesian methods. Trabajos Estadistica , 31...Sloan-Kettering Cancer Center 1275 York Avenue New York, NY 10021 Dr. Wallace Wulfeck, 11 Navy Personnel R&D Center San Diego, CA 92152-6800 Dr. Wendy

  18. APPROXIMATE MODELS FOR FLOOD ROUTING

    African Journals Online (AJOL)

    ABSTRACT. For rapid calculation of the downstream effects» of the propagation of floods due to the collapse of a dam or intense rainfall, two appmximateflood routing models are presented in this paper. A nonlinear technique for. flood routing is developed that respects the physics of floods in waterways. The models are ...

  19. Hydrogen Beyond the Classic Approximation

    CERN Document Server

    Scivetti, I

    2003-01-01

    The classical nucleus approximation is the most frequently used approach for the resolution of problems in condensed matter physics.However, there are systems in nature where it is necessary to introduce the nuclear degrees of freedom to obtain a correct description of the properties.Examples of this, are the systems with containing hydrogen.In this work, we have studied the resolution of the quantum nuclear problem for the particular case of the water molecule.The Hartree approximation has been used, i.e. we have considered that the nuclei are distinguishable particles.In addition, we have proposed a model to solve the tunneling process, which involves the resolution of the nuclear problem for configurations of the system away from its equilibrium position

  20. Good points for diophantine approximation

    Indian Academy of Sciences (India)

    Given a sequence ( x n ) n = 1 ∞ of real numbers in the interval [0,1) and a sequence ( n ) n = 1 ∞ of positive numbers tending to zero, we consider the size of the set of numbers in [0,1] which can be `well approximated' by terms of the first sequence, namely, those y ∈ [ 0 , 1 ] for which the inequality | y − x n | < n holds ...

  1. Computer Experiments for Function Approximations

    Energy Technology Data Exchange (ETDEWEB)

    Chang, A; Izmailov, I; Rizzo, S; Wynter, S; Alexandrov, O; Tong, C

    2007-10-15

    This research project falls in the domain of response surface methodology, which seeks cost-effective ways to accurately fit an approximate function to experimental data. Modeling and computer simulation are essential tools in modern science and engineering. A computer simulation can be viewed as a function that receives input from a given parameter space and produces an output. Running the simulation repeatedly amounts to an equivalent number of function evaluations, and for complex models, such function evaluations can be very time-consuming. It is then of paramount importance to intelligently choose a relatively small set of sample points in the parameter space at which to evaluate the given function, and then use this information to construct a surrogate function that is close to the original function and takes little time to evaluate. This study was divided into two parts. The first part consisted of comparing four sampling methods and two function approximation methods in terms of efficiency and accuracy for simple test functions. The sampling methods used were Monte Carlo, Quasi-Random LP{sub {tau}}, Maximin Latin Hypercubes, and Orthogonal-Array-Based Latin Hypercubes. The function approximation methods utilized were Multivariate Adaptive Regression Splines (MARS) and Support Vector Machines (SVM). The second part of the study concerned adaptive sampling methods with a focus on creating useful sets of sample points specifically for monotonic functions, functions with a single minimum and functions with a bounded first derivative.

  2. Many Faces of Boussinesq Approximations

    CERN Document Server

    Vladimirov, Vladimir A

    2016-01-01

    The \\emph{equations of Boussinesq approximation} (EBA) for an incompressible and inhomogeneous in density fluid are analyzed from a viewpoint of the asymptotic theory. A systematic scaling shows that there is an infinite number of related asymptotic models. We have divided them into three classes: `poor', `reasonable' and `good' Boussinesq approximations. Each model can be characterized by two parameters $q$ and $k$, where $q =1, 2, 3, \\dots$ and $k=0, \\pm 1, \\pm 2,\\dots$. Parameter $q$ is related to the `quality' of approximation, while $k$ gives us an infinite set of possible scales of velocity, time, viscosity, \\emph{etc.} Increasing $q$ improves the quality of a model, but narrows the limits of its applicability. Parameter $k$ allows us to vary the scales of time, velocity and viscosity and gives us the possibility to consider any initial and boundary conditions. In general, we discover and classify a rich variety of possibilities and restrictions, which are hidden behind the routine use of the Boussinesq...

  3. Efficient approximation of random fields for numerical applications

    KAUST Repository

    Harbrecht, Helmut

    2015-01-07

    We consider the rapid computation of separable expansions for the approximation of random fields. We compare approaches based on techniques from the approximation of non-local operators on the one hand and based on the pivoted Cholesky decomposition on the other hand. We provide an a-posteriori error estimate for the pivoted Cholesky decomposition in terms of the trace. Numerical examples validate and quantify the considered methods.

  4. Approximate Sensory Data Collection: A Survey.

    Science.gov (United States)

    Cheng, Siyao; Cai, Zhipeng; Li, Jianzhong

    2017-03-10

    With the rapid development of the Internet of Things (IoTs), wireless sensor networks (WSNs) and related techniques, the amount of sensory data manifests an explosive growth. In some applications of IoTs and WSNs, the size of sensory data has already exceeded several petabytes annually, which brings too many troubles and challenges for the data collection, which is a primary operation in IoTs and WSNs. Since the exact data collection is not affordable for many WSN and IoT systems due to the limitations on bandwidth and energy, many approximate data collection algorithms have been proposed in the last decade. This survey reviews the state of the art of approximatedatacollectionalgorithms. Weclassifythemintothreecategories: themodel-basedones, the compressive sensing based ones, and the query-driven ones. For each category of algorithms, the advantages and disadvantages are elaborated, some challenges and unsolved problems are pointed out, and the research prospects are forecasted.

  5. Approximate treatment of the continuum

    Energy Technology Data Exchange (ETDEWEB)

    Vertse, T. (Institute of Nuclear Research of the Hungarian Academy of Sciences, H-4001 Debrecen (Hungary)); Curutchet, P.; Liotta, R.J. (Research Institute of Physics, S-10405 Stockholm (Sweden))

    1990-12-01

    Pole expansions of the Green function (Berggren and Mittag-Leffler) are used to calculate single-particle and particle-hole response functions for a square well plus Coulomb potential and the results are compared with the corresponding exact ones. The approximate and exact response functions agree well with each other in the resonant energy region. The Mittag-Leffler expansion is shown to be valid even for the long-range Coulomb potential. The computation time needed for the calculation of the particle-hole response function can be reduced considerably by using the pole expansions.

  6. Convex approximations of quantum channels

    Science.gov (United States)

    Sacchi, Massimiliano F.; Sacchi, Tito

    2017-09-01

    We address the problem of optimally approximating the action of a desired and unavailable quantum channel Φ having at our disposal a single use of a given set of other channels {Ψi} . The problem is recast to look for the least distinguishable channel from Φ among the convex set ∑ipiΨi , and the corresponding optimal weights {pi} provide the optimal convex mixing of the available channels {Ψi} . For single-qubit channels we study specifically cases where the available convex set corresponds to covariant channels or to Pauli channels, and the desired target map is an arbitrary unitary transformation or a generalized damping channel.

  7. Approximating distributions in stochastic learning.

    Science.gov (United States)

    Leen, Todd K; Friel, Robert; Nielsen, David

    2012-08-01

    On-line machine learning algorithms, many biological spike-timing-dependent plasticity (STDP) learning rules, and stochastic neural dynamics evolve by Markov processes. A complete description of such systems gives the probability densities for the variables. The evolution and equilibrium state of these densities are given by a Chapman-Kolmogorov equation in discrete time, or a master equation in continuous time. These formulations are analytically intractable for most cases of interest, and to make progress a nonlinear Fokker-Planck equation (FPE) is often used in their place. The FPE is limited, and some argue that its application to describe jump processes (such as in these problems) is fundamentally flawed. We develop a well-grounded perturbation expansion that provides approximations for both the density and its moments. The approach is based on the system size expansion in statistical physics (which does not give approximations for the density), but our simple development makes the methods accessible and invites application to diverse problems. We apply the method to calculate the equilibrium distributions for two biologically-observed STDP learning rules and for a simple nonlinear machine-learning problem. In all three examples, we show that our perturbation series provides good agreement with Monte-Carlo simulations in regimes where the FPE breaks down. Copyright © 2012 Elsevier Ltd. All rights reserved.

  8. Binding, internalization, and degradation of atrial natriuretic peptide in cultured vascular smooth muscle cells of rat

    Energy Technology Data Exchange (ETDEWEB)

    Hirata, Y.; Takata, S.; Tomita, M.; Takaichi, S.

    1985-11-15

    Binding, internalization, and degradation of /sup 125/I-labeled-rat atrial natriuretic peptide (rANP) were studied in cultured rat aortic vascular smooth muscle cells (VSMC). At 37 degrees C, /sup 125/I-labeled-rANP rapidly bound to VSMCs, but the cell-bound radioactivity rapidly decreased upon subsequent incubation, while the binding was slow at 4 degrees C, reaching to an apparent equilibrium after 6 hrs. The cell-bound /sup 125/I-labeled-rANP at 37 degrees C is rapidly dissociated from VSMC (t 1/2: approximately 40 min) with the appearance of degradaded product(s) of radioligand in the medium, whereas the degradation was minimal at 4 degrees C. This degradative process was blocked by inhibitors of metabolic energy production (azide, dinitrophenol), inhibitors of lysosomal cathepsins (leupeptin, pepstatin), and lysosomotropic agents (NH/sub 4/Cl, chloroquine, lidocaine, methylamine, dansylcadaverine), but not by inhibitors of serine or thiol proteases. /sup 125/I-labeled-rANP initially bound to the cell-surface was rapidly internalized, and delivered to lysosomal structures, which was confirmed by autoradiographic studies. These data indicate that rANP, after binding to the cell-surface receptors, is rapidly internalized into the cells through receptor-mediated endocytosis, and subsequently degradaded by lysosomal hydrolases.

  9. Approximation of Surfaces by Cylinders

    DEFF Research Database (Denmark)

    Randrup, Thomas

    1998-01-01

    We present a new method for approximation of a given surface by a cylinder surface. It is a constructive geometric method, leading to a monorail representation of the cylinder surface. By use of a weighted Gaussian image of the given surface, we determine a projection plane. In the orthogonal...... projection of the surface onto this plane, a reference curve is determined by use of methods for thinning of binary images. Finally, the cylinder surface is constructed as follows: the directrix of the cylinder surface is determined by a least squares method minimizing the distance to the points...... in the projection within a tolerance given by the reference curve, and the rulings are lines perpendicular to the projection plane. Application of the method in ship design is given....

  10. Approximate cohomology in Banach algebras | Pourabbas ...

    African Journals Online (AJOL)

    We introduce the notions of approximate cohomology and approximate homotopy in Banach algebras and we study the relation between them. We show that the approximate homotopically equivalent cochain complexes give the same approximate cohomologies. As a special case, approximate Hochschild cohomology is ...

  11. Binding stability of peptides on major histocompatibility complex class I proteins: role of entropy and dynamics

    Science.gov (United States)

    Gul, Ahmet; Erman, Burak

    2018-03-01

    Prediction of peptide binding on specific human leukocyte antigens (HLA) has long been studied with successful results. We herein describe the effects of entropy and dynamics by investigating the binding stabilities of 10 nanopeptides on various HLA Class I alleles using a theoretical model based on molecular dynamics simulations. The fluctuational entropies of the peptides are estimated over a temperature range of 310–460 K. The estimated entropies correlate well with experimental binding affinities of the peptides: peptides that have higher binding affinities have lower entropies compared to non-binders, which have significantly larger entropies. The computation of the entropies is based on a simple model that requires short molecular dynamics trajectories and allows for approximate but rapid determination. The paper draws attention to the long neglected dynamic aspects of peptide binding, and provides a fast computation scheme that allows for rapid scanning of large numbers of peptides on selected HLA antigens, which may be useful in defining the right peptides for personal immunotherapy.

  12. Evaluation of the In Vivo and Ex Vivo Binding of Novel BC1 Cannabinoid Receptor Radiotracers

    Energy Technology Data Exchange (ETDEWEB)

    Miller, A.; Gatley, J.; Gifford, A.

    2002-01-01

    The primary active ingredient of marijuana, 9-tetrahydrocannabinol, exerts its psychoactive effects by binding to cannabinoid CB1 receptors. These receptors are found throughout the brain with high concentrations in the hippocampus and cerebellum. The current study was conducted to evaluate the binding of a newly developed putative cannabinoid antagonist, AM630, and a classical cannabinoid 8-tetrahydrocannabinol as potential PET and/or SPECT imaging agents for brain CB1 receptors. For both of these ligands in vivo and ex vivo studies in mice were conducted. AM630 showed good overall brain uptake (as measure by %IA/g) and a moderately rapid clearance from the brain with a half-clearance time of approximately 30 minutes. However, AM630 did not show selective binding to CB1 cannabinoid receptors. Ex vivo autoradiography supported the lack of selective binding seen in the in vivo study. Similar to AM630, 8-tetrahydrocanibol also failed to show selective binding to CB1 receptor rich brain areas. The 8-tetrahydrocanibol showed moderate overall brain uptake and relatively slow brain clearance as compared to AM630. Further studies were done with AM2233, a cannabinoid ligand with a similar structure as AM630. These studies were done to develop an ex vivo binding assay to quantify the displacement of [131I]AM2233 binding by other ligands in Swiss-Webster and CB1 receptor knockout mice. By developing this assay we hoped to determine the identity of an unknown binding site for AM2233 present in the hippocampus of CB1 knockout mice. Using an approach based on incubation of brain slices prepared from mice given intravenous [131I]AM2233 in either the presence or absence of AM2233 (unlabelled) it was possible to demonstrate a significant AM2233-displacable binding in the Swiss-Webster mice. Future studies will determine if this assay is appropriate for identifying the unknown binding site for AM2233 in the CB1 knockout mice.

  13. Improved approximation of spatial light distribution.

    Directory of Open Access Journals (Sweden)

    David Kaljun

    Full Text Available The rapid worldwide evolution of LEDs as light sources has brought new challenges, which means that new methods are needed and new algorithms have to be developed. Since the majority of LED luminaries are of the multi-source type, established methods for the design of light engines cannot be used in the design of LED light engines. This is because in the latter case what is involved is not just the design of a good reflector or projector lens, but the design of several lenses which have to work together in order to achieve satisfactory results. Since lenses can also be bought off the shelf from several manufacturers, it should be possible to combine together different off the shelf lenses in order to design a good light engine. However, with so many different lenses to choose from, it is almost impossible to find an optimal combination by hand, which means that some optimization algorithms need to be applied. In order for them to work properly, it is first necessary to describe the input data (i.e. spatial light distribution in a functional form using as few as possible parameters. In this paper the focus is on the approximation of the input data, and the implementation of the well-known mathematical procedure for the separation of linear and nonlinear parameters, which can provide a substantial increase in performance.

  14. Rainbows: Mie computations and the Airy approximation.

    Science.gov (United States)

    Wang, R T; van de Hulst, H C

    1991-01-01

    Efficient and accurate computation of the scattered intensity pattern by the Mie formulas is now feasible for size parameters up to x = 50,000 at least, which in visual light means spherical drops with diameters up to 6 mm. We present a method for evaluating the Mie coefficients from the ratios between Riccati-Bessel and Neumann functions of successive order. We probe the applicability of the Airy approximation, which we generalize to rainbows of arbitrary p (number of internal reflections = p - 1), by comparing the Mie and Airy intensity patterns. Millimeter size water drops show a match in all details, including the position and intensity of the supernumerary maxima and the polarization. A fairly good match is still seen for drops of 0.1 mm. A small spread in sizes helps to smooth out irrelevant detail. The dark band between the rainbows is used to test more subtle features. We conclude that this band contains not only externally reflected light (p = 0) but also a sizable contribution f rom the p = 6 and p = 7 rainbows, which shift rapidly with wavelength. The higher the refractive index, the closer both theories agree on the first primary rainbow (p = 2) peak for drop diameters as small as 0.02 mm. This may be useful in supporting experimental work.

  15. Sequence analysis of cytoplasmic mRNA-binding proteins of Xenopus oocytes identifies a family of RNA-binding proteins.

    Science.gov (United States)

    Murray, M T; Schiller, D L; Franke, W W

    1992-01-01

    Storage of maternal mRNAs as nontranslated ribonucleoprotein (RNP) complexes is an adaptive strategy in various vertebrate and invertebrate oocytes, for rapid translational recruitment during embryonic development. Previously, we showed that Xenopus laevis oocytes have a soluble cytoplasmic pool of mRNA-binding proteins and particles competent for messenger RNP assembly in vitro. Here we report the isolation of cDNAs for the most abundant messenger RNPs, the 54- and 56-kDa polypeptide (p54/p56) components of the approximately 6S mRNA-binding particle, from an ovarian expression library. The nucleotide sequence of p56 cDNA is almost identical to that recently reported for the putative Xenopus transcription factor FRG Y2. p54 and p56 are highly homologous and are smaller than expected by SDS/PAGE (36 kDa and 37 kDa) due to anomalous electrophoretic mobility. They lack the "RNP consensus motif" but contain four arginine-rich "basic/aromatic islands" that are similar to the RNA-binding domain of bacteriophage mRNA antiterminator proteins and of tat protein of human immunodeficiency virus. The basic/aromatic regions and a second conspicuous 100-amino acid "domain C" of p54 and p56 are conserved in the following DNA-binding proteins: human proteins dpbA, dpbB, and YB-1, rat protein EFIA, and Xenopus protein FRG Y1, all reported to bind to DNA; domain C is homologous to the major Escherichia coli cold-stress-response protein reportedly involved in translational control. Antibodies raised against a peptide of domain C have identified similar proteins in Xenopus somatic cells and in some mammalian cells and tissues. We conclude that p54 and p56 define a family of RNA-binding proteins, at least some of which may be involved in translational regulation.

  16. Rapid mineralocorticoid receptor trafficking.

    Science.gov (United States)

    Gekle, M; Bretschneider, M; Meinel, S; Ruhs, S; Grossmann, C

    2014-03-01

    The mineralocorticoid receptor (MR) is a ligand-dependent transcription factor that physiologically regulates water-electrolyte homeostasis and controls blood pressure. The MR can also elicit inflammatory and remodeling processes in the cardiovascular system and the kidneys, which require the presence of additional pathological factors like for example nitrosative stress. However, the underlying molecular mechanism(s) for pathophysiological MR effects remain(s) elusive. The inactive MR is located in the cytosol associated with chaperone molecules including HSP90. After ligand binding, the MR monomer rapidly translocates into the nucleus while still being associated to HSP90 and after dissociation from HSP90 binds to hormone-response-elements called glucocorticoid response elements (GREs) as a dimer. There are indications that rapid MR trafficking is modulated in the presence of high salt, oxidative or nitrosative stress, hypothetically by induction or posttranslational modifications. Additionally, glucocorticoids and the enzyme 11beta hydroxysteroid dehydrogenase may also influence MR activation. Because MR trafficking and its modulation by micro-milieu factors influence MR cellular localization, it is not only relevant for genomic but also for nongenomic MR effects. Copyright © 2013 Elsevier Inc. All rights reserved.

  17. SIMS: a hybrid method for rapid conformational analysis.

    Directory of Open Access Journals (Sweden)

    Bryant Gipson

    Full Text Available Proteins are at the root of many biological functions, often performing complex tasks as the result of large changes in their structure. Describing the exact details of these conformational changes, however, remains a central challenge for computational biology due the enormous computational requirements of the problem. This has engendered the development of a rich variety of useful methods designed to answer specific questions at different levels of spatial, temporal, and energetic resolution. These methods fall largely into two classes: physically accurate, but computationally demanding methods and fast, approximate methods. We introduce here a new hybrid modeling tool, the Structured Intuitive Move Selector (sims, designed to bridge the divide between these two classes, while allowing the benefits of both to be seamlessly integrated into a single framework. This is achieved by applying a modern motion planning algorithm, borrowed from the field of robotics, in tandem with a well-established protein modeling library. sims can combine precise energy calculations with approximate or specialized conformational sampling routines to produce rapid, yet accurate, analysis of the large-scale conformational variability of protein systems. Several key advancements are shown, including the abstract use of generically defined moves (conformational sampling methods and an expansive probabilistic conformational exploration. We present three example problems that sims is applied to and demonstrate a rapid solution for each. These include the automatic determination of "active" residues for the hinge-based system Cyanovirin-N, exploring conformational changes involving long-range coordinated motion between non-sequential residues in Ribose-Binding Protein, and the rapid discovery of a transient conformational state of Maltose-Binding Protein, previously only determined by Molecular Dynamics. For all cases we provide energetic validations using well

  18. CAP binding proteins associated with the nucleus.

    Science.gov (United States)

    Patzelt, E; Blaas, D; Kuechler, E

    1983-01-01

    Cap binding proteins of HeLa cells were identified by photo-affinity labelling using the cap analogue gamma-[32P]-[4-(benzoyl-phenyl)methylamido]-7-methylguanosine-5'- triphosphate. Photoreaction with whole cell homogenates resulted in specific labelling of five major polypeptides. The small molecular weight polypeptide appeared to be identical to the 24 000 to 26 000 dalton cap binding protein previously identified in initiation factors. A cap binding protein of 37 000 dalton was found in initiation factors as well as in preparations of crude nuclei. It was released from nuclei by washing with buffer of moderate salt concentration. Three high molecular weight cap binding proteins (approximately 120 000, approximately 89 000, approximately 80 000 dalton) were found in the nuclear fraction and were only partly released upon nuclease digestion and high salt extraction. Images PMID:6889136

  19. Rapid Prototyping

    Science.gov (United States)

    1999-01-01

    Javelin, a Lone Peak Engineering Inc. Company has introduced the SteamRoller(TM) System as a commercial product. The system was designed by Javelin during a Phase II NASA funded small commercial product. The purpose of the invention was to allow automated-feed of flexible ceramic tapes to the Laminated Object Manufacturing rapid prototyping equipment. The ceramic material that Javelin was working with during the Phase II project is silicon nitride. This engineered ceramic material is of interest for space-based component.

  20. Effect of sabcomeline on muscarinic and dopamine receptor binding in intact mouse brain

    Energy Technology Data Exchange (ETDEWEB)

    Hosoi, Rie; Kobayashi, Kaoru; Inoue, Osamu [Osaka Univ., Suita (Japan). Medical School; Ishida, Junichi; Yamaguchi, Masatoshi [Fukuoka Univ. (Japan). Faculty of Pharmaceutical Sciences

    2003-04-01

    Sabcomeline [(R-(Z)-(+)-{alpha}-(methoxyiamino)- 1-azabicyclo[2.2.2]octane-3-acetonitrile)] is a potent and functionally selective muscarinic M{sub 1} receptor partial agonist. However, little is known of the binding properties of sabcomeline under in vivo conditions. In this study, muscarinic receptor occupancy by sabcomeline in mouse brain regions and heart was estimated using [{sup 3}H]quinuclidinyl benzilate (QNB) and [{sup 3}H]N-methylpiperidyl benzilate (NMPB) as radioligands. In the cerebral cortex, hippocampus, and striatum, the estimated IC{sub 50} value of sabcomeline for [{sup 3}H]NMPB binding was almost 0.2 mg/kg. Sabcomeline was not a selective ligand to M{sub 1} receptors as compared with biperiden in vivo. In the cerebral cortex, maximum receptor occupancy was observed about 1 hr after intravenous injection of sabcomeline (0.3 mg/kg), and the binding availability of mACh receptors had almost returned to the control level by 3-4 hr. These findings indicated that the binding kinetics of sabcomeline is rather rapid in mouse brain. Examination of dopamine D{sub 2} receptor binding revealed that sabcomeline affected the kinetics of both [{sup 3}H]raclopride and [{sup 3}H]N-methylspiperone (NMSP) binding in the striatum. It significantly decreased the k{sub 3} and k{sub 4} of [{sup 3}H]raclopride binding resulting in an increase in binding potential (BP=k{sub 3}/k{sub 4}=B{sub max}/K{sub d}) in sabcomeline-treated mice, and an approximately 15% decrease in k{sub 3} of [{sup 3}H]NMSP binding was also observed. Although the mechanism is still unclear, sabcomeline altered dopamine D{sub 2} receptor affinity or availability by modulations via neural networks. (author)

  1. On martingale approximation of adapted processes

    OpenAIRE

    Queffélec, Hervé; Volný, Dalibor

    2011-01-01

    We show that the existence of a martingale approximation of a stationary process depends on the choice of the filtration. There exists a stationary linear process which has a martingale approximation with respect to the natural filtration, but no approximation with respect to a larger filtration with respect to wich it is adapted and regular. There exists a stationary process adapted, regular, and having a martingale approximation with respect to a given filtration but not (regular and having...

  2. Bond selective chemistry beyond the adiabatic approximation

    Energy Technology Data Exchange (ETDEWEB)

    Butler, L.J. [Univ. of Chicago, IL (United States)

    1993-12-01

    One of the most important challenges in chemistry is to develop predictive ability for the branching between energetically allowed chemical reaction pathways. Such predictive capability, coupled with a fundamental understanding of the important molecular interactions, is essential to the development and utilization of new fuels and the design of efficient combustion processes. Existing transition state and exact quantum theories successfully predict the branching between available product channels for systems in which each reaction coordinate can be adequately described by different paths along a single adiabatic potential energy surface. In particular, unimolecular dissociation following thermal, infrared multiphoton, or overtone excitation in the ground state yields a branching between energetically allowed product channels which can be successfully predicted by the application of statistical theories, i.e. the weakest bond breaks. (The predictions are particularly good for competing reactions in which when there is no saddle point along the reaction coordinates, as in simple bond fission reactions.) The predicted lack of bond selectivity results from the assumption of rapid internal vibrational energy redistribution and the implicit use of a single adiabatic Born-Oppenheimer potential energy surface for the reaction. However, the adiabatic approximation is not valid for the reaction of a wide variety of energetic materials and organic fuels; coupling between the electronic states of the reacting species play a a key role in determining the selectivity of the chemical reactions induced. The work described below investigated the central role played by coupling between electronic states in polyatomic molecules in determining the selective branching between energetically allowed fragmentation pathways in two key systems.

  3. Regression with Sparse Approximations of Data

    DEFF Research Database (Denmark)

    Noorzad, Pardis; Sturm, Bob L.

    2012-01-01

    We propose sparse approximation weighted regression (SPARROW), a method for local estimation of the regression function that uses sparse approximation with a dictionary of measurements. SPARROW estimates the regression function at a point with a linear combination of a few regressands selected by...... on the sparse approximation process. Our experimental results show the locally constant form of SPARROW performs competitively....

  4. Approximation properties of fine hyperbolic graphs

    Indian Academy of Sciences (India)

    Abstract. In this paper, we propose a definition of approximation property which is called the metric invariant translation approximation property for a countable dis- crete metric space. Moreover, we use the techniques of Ozawa's to prove that a fine hyperbolic graph has the metric invariant translation approximation property.

  5. Approximate Nearest Neighbor Queries among Parallel Segments

    DEFF Research Database (Denmark)

    Emiris, Ioannis Z.; Malamatos, Theocharis; Tsigaridas, Elias

    2010-01-01

    We develop a data structure for answering efficiently approximate nearest neighbor queries over a set of parallel segments in three dimensions. We connect this problem to approximate nearest neighbor searching under weight constraints and approximate nearest neighbor searching on historical data...

  6. Exploiting domain knowledge for approximate diagnosis

    NARCIS (Netherlands)

    Teije, A. ten; Harmelen, van F.A.H.

    1997-01-01

    The AI literature contains many definitions of diagnostic reasoning most of which are defined in terms of the logical entailment relation. We use existing work on approximate entailment to define notions of approximation in diagnosis. We show how such a notion of approximate diagnosis can be

  7. Truth Approximation, Social Epistemology, and Opinion Dynamics

    NARCIS (Netherlands)

    Douven, Igor; Kelp, Christoph

    This paper highlights some connections between work on truth approximation and work in social epistemology, in particular work on peer disagreement. In some of the literature on truth approximation, questions have been addressed concerning the efficiency of research strategies for approximating the

  8. Axiomatic Characterizations of IVF Rough Approximation Operators

    OpenAIRE

    Yu, Guangji

    2014-01-01

    This paper is devoted to the study of axiomatic characterizations of IVF rough approximation operators. IVF approximation spaces are investigated. The fact that different IVF operators satisfy some axioms to guarantee the existence of different types of IVF relations which produce the same operators is proved and then IVF rough approximation operators are characterized by axioms.

  9. Axiomatic Characterizations of IVF Rough Approximation Operators

    Directory of Open Access Journals (Sweden)

    Guangji Yu

    2014-01-01

    Full Text Available This paper is devoted to the study of axiomatic characterizations of IVF rough approximation operators. IVF approximation spaces are investigated. The fact that different IVF operators satisfy some axioms to guarantee the existence of different types of IVF relations which produce the same operators is proved and then IVF rough approximation operators are characterized by axioms.

  10. Operator approximant problems arising from quantum theory

    CERN Document Server

    Maher, Philip J

    2017-01-01

    This book offers an account of a number of aspects of operator theory, mainly developed since the 1980s, whose problems have their roots in quantum theory. The research presented is in non-commutative operator approximation theory or, to use Halmos' terminology, in operator approximants. Focusing on the concept of approximants, this self-contained book is suitable for graduate courses.

  11. Approximation properties of fine hyperbolic graphs

    Indian Academy of Sciences (India)

    In this paper, we propose a definition of approximation property which is called the metric invariant translation approximation property for a countable discrete metric space. Moreover, we use the techniques of Ozawa's to prove that a fine hyperbolic graph has the metric invariant translation approximation property.

  12. Nonlinear approximation with dictionaries, I: Direct estimates

    DEFF Research Database (Denmark)

    Gribonval, Rémi; Nielsen, Morten

    $-term approximation with algorithmic constraints: thresholding and Chebychev approximation classes are studied respectively. We consider embeddings of the Jackson type (direct estimates) of sparsity spaces into the mentioned approximation classes. General direct estimates are based on the geometry of the Banach space...

  13. Resolving the fast kinetics of cooperative binding: Ca2+ buffering by calretinin.

    Directory of Open Access Journals (Sweden)

    Guido C Faas

    2007-11-01

    + using a fast fluorescent Ca2+ indicator following rapid (<50-mus rise time Ca2+ concentration jumps induced by uncaging Ca2+ from DM-nitrophen. To unravel the kinetics of cooperative binding, we devised several approaches based on known cooperative binding models, resulting in a novel and relatively simple model. This model revealed unexpected and highly specific nonlinear properties of cellular Ca2+ regulation by calretinin. The association rate of Ca2+ with calretinin speeds up as the free Ca2+ concentration increases from cytoplasmic resting conditions ( approximately 100 nM to approximately 1 muM. As a consequence, the Ca2+ buffering speed of calretinin highly depends on the prevailing Ca2+ concentration prior to a perturbation. In addition to providing a novel mode of action of cellular Ca2+ buffering, our model extends the analysis of cooperativity beyond the static steady-state condition, providing a powerful tool for the investigation of the dynamics and functional significance of cooperative binding in general.

  14. Mapping moveout approximations in TI media

    KAUST Repository

    Stovas, Alexey

    2013-11-21

    Moveout approximations play a very important role in seismic modeling, inversion, and scanning for parameters in complex media. We developed a scheme to map one-way moveout approximations for transversely isotropic media with a vertical axis of symmetry (VTI), which is widely available, to the tilted case (TTI) by introducing the effective tilt angle. As a result, we obtained highly accurate TTI moveout equations analogous with their VTI counterparts. Our analysis showed that the most accurate approximation is obtained from the mapping of generalized approximation. The new moveout approximations allow for, as the examples demonstrate, accurate description of moveout in the TTI case even for vertical heterogeneity. The proposed moveout approximations can be easily used for inversion in a layered TTI medium because the parameters of these approximations explicitly depend on corresponding effective parameters in a layered VTI medium.

  15. Quasi-planar elemental clusters in pair interactions approximation

    Directory of Open Access Journals (Sweden)

    Chkhartishvili Levan

    2016-01-01

    Full Text Available The pair-interactions approximation, when applied to describe elemental clusters, only takes into account bonding between neighboring atoms. According to this approach, isomers of wrapped forms of 2D clusters – nanotubular and fullerene-like structures – and truly 3D clusters, are generally expected to be more stable than their quasi-planar counterparts. This is because quasi-planar clusters contain more peripheral atoms with dangling bonds and, correspondingly, fewer atoms with saturated bonds. However, the differences in coordination numbers between central and peripheral atoms lead to the polarization of bonds. The related corrections to the molar binding energy can make small, quasi-planar clusters more stable than their 2D wrapped allotropes and 3D isomers. The present work provides a general theoretical frame for studying the relative stability of small elemental clusters within the pair interactions approximation.

  16. Multilevel Monte Carlo in Approximate Bayesian Computation

    KAUST Repository

    Jasra, Ajay

    2017-02-13

    In the following article we consider approximate Bayesian computation (ABC) inference. We introduce a method for numerically approximating ABC posteriors using the multilevel Monte Carlo (MLMC). A sequential Monte Carlo version of the approach is developed and it is shown under some assumptions that for a given level of mean square error, this method for ABC has a lower cost than i.i.d. sampling from the most accurate ABC approximation. Several numerical examples are given.

  17. Approximate Furthest Neighbor in High Dimensions

    DEFF Research Database (Denmark)

    Pagh, Rasmus; Silvestri, Francesco; Sivertsen, Johan von Tangen

    2015-01-01

    Much recent work has been devoted to approximate nearest neighbor queries. Motivated by applications in recommender systems, we consider approximate furthest neighbor (AFN) queries. We present a simple, fast, and highly practical data structure for answering AFN queries in high-dimensional Euclid......Much recent work has been devoted to approximate nearest neighbor queries. Motivated by applications in recommender systems, we consider approximate furthest neighbor (AFN) queries. We present a simple, fast, and highly practical data structure for answering AFN queries in high...

  18. Discovering approximate-associated sequence patterns for protein-DNA interactions

    KAUST Repository

    Chan, Tak Ming

    2010-12-30

    Motivation: The bindings between transcription factors (TFs) and transcription factor binding sites (TFBSs) are fundamental protein-DNA interactions in transcriptional regulation. Extensive efforts have been made to better understand the protein-DNA interactions. Recent mining on exact TF-TFBS-associated sequence patterns (rules) has shown great potentials and achieved very promising results. However, exact rules cannot handle variations in real data, resulting in limited informative rules. In this article, we generalize the exact rules to approximate ones for both TFs and TFBSs, which are essential for biological variations. Results: A progressive approach is proposed to address the approximation to alleviate the computational requirements. Firstly, similar TFBSs are grouped from the available TF-TFBS data (TRANSFAC database). Secondly, approximate and highly conserved binding cores are discovered from TF sequences corresponding to each TFBS group. A customized algorithm is developed for the specific objective. We discover the approximate TF-TFBS rules by associating the grouped TFBS consensuses and TF cores. The rules discovered are evaluated by matching (verifying with) the actual protein-DNA binding pairs from Protein Data Bank (PDB) 3D structures. The approximate results exhibit many more verified rules and up to 300% better verification ratios than the exact ones. The customized algorithm achieves over 73% better verification ratios than traditional methods. Approximate rules (64-79%) are shown statistically significant. Detailed variation analysis and conservation verification on NCBI records demonstrate that the approximate rules reveal both the flexible and specific protein-DNA interactions accurately. The approximate TF-TFBS rules discovered show great generalized capability of exploring more informative binding rules. © The Author 2010. Published by Oxford University Press. All rights reserved.

  19. Cobalamin and its binding protein in rat milk

    DEFF Research Database (Denmark)

    Raaberg, Lasse; Nexø, Ebba; Poulsen, Steen Seier

    1989-01-01

    Cobalamin and its binding protein, haptocorrin, are present in rat milk throughout the lactation period. The concentration of cobalamin is approximately 0.3-times the concentration of the unsaturated binding protein. The concentration of the unsaturated cobalamin-binding protein varies between 18...... nmol l-1 and 16 nmol l-1. The binding protein has a Stokes radius of 2.49 nm when saturated with cobalamin and 2.61 nm when unsaturated. It binds cobalamin over a broad range of pH and is able to bind cobinamide also. With immunohistochemistry, we find haptocorrin immunoreactivity in the mammary glands...

  20. Extension of the weak-line approximation and application to correlated-k methods

    Energy Technology Data Exchange (ETDEWEB)

    Conley, A.J.; Collins, W.D.

    2011-03-15

    Global climate models require accurate and rapid computation of the radiative transfer through the atmosphere. Correlated-k methods are often used. One of the approximations used in correlated-k models is the weakline approximation. We introduce an approximation T/sub g/ which reduces to the weak-line limit when optical depths are small, and captures the deviation from the weak-line limit as the extinction deviates from the weak-line limit. This approximation is constructed to match the first two moments of the gamma distribution to the k-distribution of the transmission. We compare the errors of the weak-line approximation with T/sub g/ in the context of a water vapor spectrum. The extension T/sub g/ is more accurate and converges more rapidly than the weak-line approximation.

  1. Performance Approximation and Design of Pick-and-Pass Order Picking Systems

    NARCIS (Netherlands)

    M. Yu (Mengfei); M.B.M. de Koster (René)

    2007-01-01

    textabstractIn this paper, we discuss an approximation method based on G/G/m queuing network modeling using Whitt’s (1983) queuing network analyzer to analyze pick-and-pass order picking systems. The objective of this approximation method is to provide an instrument for obtaining rapid performance

  2. Lifetime of the Nonlinear Geometric Optics Approximation

    DEFF Research Database (Denmark)

    Binzer, Knud Andreas

    The subject of the thesis is to study acertain approximation method for highly oscillatory solutions to nonlinear partial differential equations.......The subject of the thesis is to study acertain approximation method for highly oscillatory solutions to nonlinear partial differential equations....

  3. Hardness of approximation for Knapsack problems

    NARCIS (Netherlands)

    Buhrman, H.; Loff, B.; Torenvliet, L.

    2015-01-01

    We show various hardness results for knapsack and related problems; in particular we will show that unless the Exponential-Time Hypothesis is false, subset-sum cannot be approximated any better than with an FPTAS. We also provide new unconditional lower bounds for approximating knapsack in Ketan

  4. Non-Linear Approximation of Bayesian Update

    KAUST Repository

    Litvinenko, Alexander

    2016-06-23

    We develop a non-linear approximation of expensive Bayesian formula. This non-linear approximation is applied directly to Polynomial Chaos Coefficients. In this way, we avoid Monte Carlo sampling and sampling error. We can show that the famous Kalman Update formula is a particular case of this update.

  5. Approximate Solution of Rod Heating Problem

    Directory of Open Access Journals (Sweden)

    P. Lasy

    2013-01-01

    Full Text Available Contains exact and approximate analytic representations pertaining to the solution of a homogeneous mixed problem for a non-homogeneous one-dimensional equation of heat conduction using a special psi-function. The order of an approximate formula accuracy is given in the paper.

  6. Inversion and approximation of Laplace transforms

    Science.gov (United States)

    Lear, W. M.

    1980-01-01

    A method of inverting Laplace transforms by using a set of orthonormal functions is reported. As a byproduct of the inversion, approximation of complicated Laplace transforms by a transform with a series of simple poles along the left half plane real axis is shown. The inversion and approximation process is simple enough to be put on a programmable hand calculator.

  7. Polynomial approximation approach to transient heat conduction ...

    African Journals Online (AJOL)

    This work reports polynomial approximation approach to transient heat conduction in a long slab, long cylinder and sphere with linear internal heat generation. It has been shown that the polynomial approximation method is able to calculate average temperature as a function of time for higher value of Biot numbers.

  8. Nonlinear approximation with dictionaries I. Direct estimates

    DEFF Research Database (Denmark)

    Gribonval, Rémi; Nielsen, Morten

    2004-01-01

    with algorithmic constraints: thresholding and Chebychev approximation classes are studied, respectively. We consider embeddings of the Jackson type (direct estimates) of sparsity spaces into the mentioned approximation classes. General direct estimates are based on the geometry of the Banach space, and we prove...

  9. On approximating multi-criteria TSP

    NARCIS (Netherlands)

    Manthey, Bodo; Albers, S.; Marion, J.-Y.

    2009-01-01

    We present approximation algorithms for almost all variants of the multi-criteria traveling salesman problem (TSP), whose performances are independent of the number $k$ of criteria and come close to the approximation ratios obtained for TSP with a single objective function. We present randomized

  10. On approximating multi-criteria TSP

    NARCIS (Netherlands)

    Manthey, Bodo

    We present approximation algorithms for almost all variants of the multicriteria traveling salesman problem (TSP). First, we devise randomized approximation algorithms for multicriteria maximum traveling salesman problems (Max-TSP). For multicriteria Max-STSP where the edge weights have to be

  11. Boundary Value Problems and Approximate Solutions ...

    African Journals Online (AJOL)

    In this paper, we discuss about some basic things of boundary value problems. Secondly, we study boundary conditions involving derivatives and obtain finite difference approximations of partial derivatives of boundary value problems. The last section is devoted to determine an approximate solution for boundary value ...

  12. Approximate error conjugation gradient minimization methods

    Science.gov (United States)

    Kallman, Jeffrey S

    2013-05-21

    In one embodiment, a method includes selecting a subset of rays from a set of all rays to use in an error calculation for a constrained conjugate gradient minimization problem, calculating an approximate error using the subset of rays, and calculating a minimum in a conjugate gradient direction based on the approximate error. In another embodiment, a system includes a processor for executing logic, logic for selecting a subset of rays from a set of all rays to use in an error calculation for a constrained conjugate gradient minimization problem, logic for calculating an approximate error using the subset of rays, and logic for calculating a minimum in a conjugate gradient direction based on the approximate error. In other embodiments, computer program products, methods, and systems are described capable of using approximate error in constrained conjugate gradient minimization problems.

  13. The tendon approximator device in traumatic injuries.

    Science.gov (United States)

    Forootan, Kamal S; Karimi, Hamid; Forootan, Nazilla-Sadat S

    2015-01-01

    Precise and tension-free approximation of two tendon endings is the key predictor of outcomes following tendon lacerations and repairs. We evaluate the efficacy of a new tendon approximator device in tendon laceration repairs. In a comparative study, we used our new tendon approximator device in 99 consecutive patients with laceration of 266 tendons who attend a university hospital and evaluated the operative time to repair the tendons, surgeons' satisfaction as well as patient's outcomes in a long-term follow-up. Data were compared with the data of control patients undergoing tendon repair by conventional method. Totally 266 tendons were repaired by approximator device and 199 tendons by conventional technique. 78.7% of patients in first group were male and 21.2% were female. In approximator group 38% of patients had secondary repair of cut tendons and 62% had primary repair. Patients were followed for a mean period of 3years (14-60 months). Time required for repair of each tendon was significantly reduced with the approximator device (2 min vs. 5.5 min, ptendon repair were identical in the two groups and were not significantly different. 1% of tendons in group A and 1.2% in group B had rupture that was not significantly different. The new nerve approximator device is cheap, feasible to use and reduces the time of tendon repair with sustained outcomes comparable to the conventional methods.

  14. Approximation of the semi-infinite interval

    Directory of Open Access Journals (Sweden)

    A. McD. Mercer

    1980-01-01

    Full Text Available The approximation of a function f∈C[a,b] by Bernstein polynomials is well-known. It is based on the binomial distribution. O. Szasz has shown that there are analogous approximations on the interval [0,∞ based on the Poisson distribution. Recently R. Mohapatra has generalized Szasz' result to the case in which the approximating function is αe−ux∑k=N∞(uxkα+β−1Γ(kα+βf(kαuThe present note shows that these results are special cases of a Tauberian theorem for certain infinite series having positive coefficients.

  15. Mathematical analysis, approximation theory and their applications

    CERN Document Server

    Gupta, Vijay

    2016-01-01

    Designed for graduate students, researchers, and engineers in mathematics, optimization, and economics, this self-contained volume presents theory, methods, and applications in mathematical analysis and approximation theory. Specific topics include: approximation of functions by linear positive operators with applications to computer aided geometric design, numerical analysis, optimization theory, and solutions of differential equations. Recent and significant developments in approximation theory, special functions and q-calculus along with their applications to mathematics, engineering, and social sciences are discussed and analyzed. Each chapter enriches the understanding of current research problems and theories in pure and applied research.

  16. Conditional Density Approximations with Mixtures of Polynomials

    DEFF Research Database (Denmark)

    Varando, Gherardo; López-Cruz, Pedro L.; Nielsen, Thomas Dyhre

    2015-01-01

    Mixtures of polynomials (MoPs) are a non-parametric density estimation technique especially designed for hybrid Bayesian networks with continuous and discrete variables. Algorithms to learn one- and multi-dimensional (marginal) MoPs from data have recently been proposed. In this paper we introduce...... two methods for learning MoP approximations of conditional densities from data. Both approaches are based on learning MoP approximations of the joint density and the marginal density of the conditioning variables, but they differ as to how the MoP approximation of the quotient of the two densities...

  17. Fractional Mathematical Operators and Their Computational Approximation

    Directory of Open Access Journals (Sweden)

    José Crespo

    2016-01-01

    Full Text Available Usual applied mathematics employs three fundamental arithmetical operators: addition, multiplication, and exponentiation. However, for example, transcendental numbers are said not to be attainable via algebraic combination with these fundamental operators. At the same time, simulation and modelling frequently have to rely on expensive numerical approximations of the exact solution. The main purpose of this article is to analyze new fractional arithmetical operators, explore some of their properties, and devise ways of computing them. These new operators may bring new possibilities, for example, in approximation theory and in obtaining closed forms of those approximations and solutions. We show some simple demonstrative examples.

  18. Computational Prediction of RNA-Binding Proteins and Binding Sites

    Directory of Open Access Journals (Sweden)

    Jingna Si

    2015-11-01

    Full Text Available Proteins and RNA interaction have vital roles in many cellular processes such as protein synthesis, sequence encoding, RNA transfer, and gene regulation at the transcriptional and post-transcriptional levels. Approximately 6%–8% of all proteins are RNA-binding proteins (RBPs. Distinguishing these RBPs or their binding residues is a major aim of structural biology. Previously, a number of experimental methods were developed for the determination of protein–RNA interactions. However, these experimental methods are expensive, time-consuming, and labor-intensive. Alternatively, researchers have developed many computational approaches to predict RBPs and protein–RNA binding sites, by combining various machine learning methods and abundant sequence and/or structural features. There are three kinds of computational approaches, which are prediction from protein sequence, prediction from protein structure, and protein-RNA docking. In this paper, we review all existing studies of predictions of RNA-binding sites and RBPs and complexes, including data sets used in different approaches, sequence and structural features used in several predictors, prediction method classifications, performance comparisons, evaluation methods, and future directions.

  19. Analytical Ballistic Trajectories with Approximately Linear Drag

    National Research Council Canada - National Science Library

    Giliam J. P. de Carpentier

    2014-01-01

      This paper introduces a practical analytical approximation of projectile trajectories in 2D and 3D roughly based on a linear drag model and explores a variety of different planning algorithms for these trajectories...

  20. Broadband Approximations for Doubly Curved Reflector Antenna

    Directory of Open Access Journals (Sweden)

    V. Schejbal

    2010-12-01

    Full Text Available The broadband approximations for shaped-beam doubly curved reflector antennas with primary feed (rectangular horn producing uniform amplitude and phase aperture distribution are derived and analyzed. They are very valuable for electromagnetic compatibility analyses both from electromagnetic interference and susceptibility point of view, because specialized more accurate methods such as physical optics are only used by antenna designers. To allow quick EMC analyses, typical values, beamwidth changes, sidelobe levels and aperture efficiencies are given for frequency changes approximately up to four times operating frequency. A comparison of approximated and measured patterns of doubly curved reflector antennas shows that the given approximation could be reliably used for analyses of pattern changes due to very broad frequency changes.

  1. Saddlepoint approximation methods in financial engineering

    CERN Document Server

    Kwok, Yue Kuen

    2018-01-01

    This book summarizes recent advances in applying saddlepoint approximation methods to financial engineering. It addresses pricing exotic financial derivatives and calculating risk contributions to Value-at-Risk and Expected Shortfall in credit portfolios under various default correlation models. These standard problems involve the computation of tail probabilities and tail expectations of the corresponding underlying state variables.  The text offers in a single source most of the saddlepoint approximation results in financial engineering, with different sets of ready-to-use approximation formulas. Much of this material may otherwise only be found in original research publications. The exposition and style are made rigorous by providing formal proofs of most of the results. Starting with a presentation of the derivation of a variety of saddlepoint approximation formulas in different contexts, this book will help new researchers to learn the fine technicalities of the topic. It will also be valuable to quanti...

  2. Low Rank Approximation Algorithms, Implementation, Applications

    CERN Document Server

    Markovsky, Ivan

    2012-01-01

    Matrix low-rank approximation is intimately related to data modelling; a problem that arises frequently in many different fields. Low Rank Approximation: Algorithms, Implementation, Applications is a comprehensive exposition of the theory, algorithms, and applications of structured low-rank approximation. Local optimization methods and effective suboptimal convex relaxations for Toeplitz, Hankel, and Sylvester structured problems are presented. A major part of the text is devoted to application of the theory. Applications described include: system and control theory: approximate realization, model reduction, output error, and errors-in-variables identification; signal processing: harmonic retrieval, sum-of-damped exponentials, finite impulse response modeling, and array processing; machine learning: multidimensional scaling and recommender system; computer vision: algebraic curve fitting and fundamental matrix estimation; bioinformatics for microarray data analysis; chemometrics for multivariate calibration; ...

  3. Degree of Approximation and Green Potential

    Directory of Open Access Journals (Sweden)

    M. Simkani

    2009-03-01

    Full Text Available We will relate the degree of rational approximation of a meromorphic function f to the minimum value, on the natural boundary of f, of Green potential of the weak∗ limit of the normalized pole-counting measures

  4. Cq-commuting maps and invariant approximations

    Directory of Open Access Journals (Sweden)

    B. E. Rhoades

    2006-06-01

    Full Text Available We obtain common fixed point results for generalized I-nonexpansive Cq-commuting maps. As applications, various best approximation results for this class of maps are derived in the setup of certain metrizable topological vector spaces.

  5. An approximation of solutions of variational inequalities

    Directory of Open Access Journals (Sweden)

    B. E. Rhoades

    2005-10-01

    Full Text Available We use a Mann-type iteration scheme and the metric projection operator (the nearest-point projection operator to approximate the solutions of variational inequalities in uniformly convex and uniformly smooth Banach spaces.

  6. Approximate substitutions and the normal ordering problem

    Energy Technology Data Exchange (ETDEWEB)

    Cheballah, H; Duchamp, G H E [Universite Paris 13 Laboratoire d' Informatique Paris Nord, CNRS UMR 7030 99 Av. J-B. Clement, F 93430 Villetaneuse (France); Penson, K A [Laboratoire de Physique Theorique de la Matiere Condensee Universite Pierre et Marie Curie, CNRS UMR 7600 Tour 24 - 2e et., 4 pl. Jussieu, F 75252 Paris Cedex 05 (France)], E-mail: hayat.cheballah@lipn-univ.paris13.fr, E-mail: ghed@lipn-univ.paris13.fr, E-mail: penson@lptl.jussieu.fr

    2008-03-01

    In this paper, we show that the infinite generalised Stirling matrices associated with boson strings with one annihilation operator are projective limits of approximate substitutions, the latter being characterised by a finite set of algebraic equations.

  7. Methods of Fourier analysis and approximation theory

    CERN Document Server

    Tikhonov, Sergey

    2016-01-01

    Different facets of interplay between harmonic analysis and approximation theory are covered in this volume. The topics included are Fourier analysis, function spaces, optimization theory, partial differential equations, and their links to modern developments in the approximation theory. The articles of this collection were originated from two events. The first event took place during the 9th ISAAC Congress in Krakow, Poland, 5th-9th August 2013, at the section “Approximation Theory and Fourier Analysis”. The second event was the conference on Fourier Analysis and Approximation Theory in the Centre de Recerca Matemàtica (CRM), Barcelona, during 4th-8th November 2013, organized by the editors of this volume. All articles selected to be part of this collection were carefully reviewed.

  8. APPROXIMATE DEVELOPMENTS FOR SURFACES OF REVOLUTION

    Directory of Open Access Journals (Sweden)

    Mădălina Roxana Buneci

    2016-12-01

    Full Text Available The purpose of this paper is provide a set of Maple procedures to construct approximate developments of a general surface of revolution generalizing the well-known gore method for sphere

  9. Seismic wave extrapolation using lowrank symbol approximation

    KAUST Repository

    Fomel, Sergey

    2012-04-30

    We consider the problem of constructing a wave extrapolation operator in a variable and possibly anisotropic medium. Our construction involves Fourier transforms in space combined with the help of a lowrank approximation of the space-wavenumber wave-propagator matrix. A lowrank approximation implies selecting a small set of representative spatial locations and a small set of representative wavenumbers. We present a mathematical derivation of this method, a description of the lowrank approximation algorithm and numerical examples that confirm the validity of the proposed approach. Wave extrapolation using lowrank approximation can be applied to seismic imaging by reverse-time migration in 3D heterogeneous isotropic or anisotropic media. © 2012 European Association of Geoscientists & Engineers.

  10. An overview on Approximate Bayesian computation*

    Directory of Open Access Journals (Sweden)

    Baragatti Meïli

    2014-01-01

    Full Text Available Approximate Bayesian computation techniques, also called likelihood-free methods, are one of the most satisfactory approach to intractable likelihood problems. This overview presents recent results since its introduction about ten years ago in population genetics.

  11. An approximation of solutions of variational inequalities

    Directory of Open Access Journals (Sweden)

    Rhoades BE

    2005-01-01

    Full Text Available We use a Mann-type iteration scheme and the metric projection operator (the nearest-point projection operator to approximate the solutions of variational inequalities in uniformly convex and uniformly smooth Banach spaces.

  12. An approximate analytical approach to resampling averages

    DEFF Research Database (Denmark)

    Malzahn, Dorthe; Opper, M.

    2004-01-01

    Using a novel reformulation, we develop a framework to compute approximate resampling data averages analytically. The method avoids multiple retraining of statistical models on the samples. Our approach uses a combination of the replica "trick" of statistical physics and the TAP approach...... for approximate Bayesian inference. We demonstrate our approach on regression with Gaussian processes. A comparison with averages obtained by Monte-Carlo sampling shows that our method achieves good accuracy....

  13. The closure approximation in the hierarchy equations.

    Science.gov (United States)

    Adomian, G.

    1971-01-01

    The expectation of the solution process in a stochastic operator equation can be obtained from averaged equations only under very special circumstances. Conditions for validity are given and the significance and validity of the approximation in widely used hierarchy methods and the ?self-consistent field' approximation in nonequilibrium statistical mechanics are clarified. The error at any level of the hierarchy can be given and can be avoided by the use of the iterative method.

  14. Adaptive and Approximate Orthogonal Range Counting

    DEFF Research Database (Denmark)

    Chan, Timothy M.; Wilkinson, Bryan Thomas

    2013-01-01

    ]. •We give an O(n loglog n)-space data structure for approximate 2-D orthogonal range counting that can compute a (1+δ)-factor approximation to the count in O(loglog n) time for any fixed constant δ>0. Again, our bounds match the state of the art for the 2-D orthogonal range emptiness problem. •Lastly...

  15. Seismic modeling using the frozen Gaussian approximation

    OpenAIRE

    Yang, Xu; Lu, Jianfeng; Fomel, Sergey

    2013-01-01

    We adopt the frozen Gaussian approximation (FGA) for modeling seismic waves. The method belongs to the category of ray-based beam methods. It decomposes seismic wavefield into a set of Gaussian functions and propagates these Gaussian functions along appropriate ray paths. As opposed to the classic Gaussian-beam method, FGA keeps the Gaussians frozen (at a fixed width) during the propagation process and adjusts their amplitudes to produce an accurate approximation after summation. We perform t...

  16. Lattice quantum chromodynamics with approximately chiral fermions

    Energy Technology Data Exchange (ETDEWEB)

    Hierl, Dieter

    2008-05-15

    In this work we present Lattice QCD results obtained by approximately chiral fermions. We use the CI fermions in the quenched approximation to investigate the excited baryon spectrum and to search for the {theta}{sup +} pentaquark on the lattice. Furthermore we developed an algorithm for dynamical simulations using the FP action. Using FP fermions we calculate some LECs of chiral perturbation theory applying the epsilon expansion. (orig.)

  17. On surface approximation using developable surfaces

    DEFF Research Database (Denmark)

    Chen, H. Y.; Lee, I. K.; Leopoldseder, S.

    1998-01-01

    We introduce a method for approximating a given surface by a developable surface. It will be either a G_1 surface consisting of pieces of cones or cylinders of revolution or a G_r NURBS developable surface. Our algorithm will also deal properly with the problems of reverse engineering and produce...... robust approximation of given scattered data. The presented technique can be applied in computer aided manufacturing, e.g. in shipbuilding....

  18. On surface approximation using developable surfaces

    DEFF Research Database (Denmark)

    Chen, H. Y.; Lee, I. K.; Leopoldseder, s.

    1999-01-01

    We introduce a method for approximating a given surface by a developable surface. It will be either a G(1) surface consisting of pieces of cones or cylinders of revolution or a G(r) NURBS developable surface. Our algorithm will also deal properly with the problems of reverse engineering and produce...... robust approximation of given scattered data. The presented technique can be applied in computer aided manufacturing, e.g. in shipbuilding. (C) 1999 Academic Press....

  19. Nonlinear approximation with nonstationary Gabor frames

    DEFF Research Database (Denmark)

    Ottosen, Emil Solsbæk; Nielsen, Morten

    2018-01-01

    We consider sparseness properties of adaptive time-frequency representations obtained using nonstationary Gabor frames (NSGFs). NSGFs generalize classical Gabor frames by allowing for adaptivity in either time or frequency. It is known that the concept of painless nonorthogonal expansions...... resolution. Based on this characterization we prove an upper bound on the approximation error occurring when thresholding the coefficients of the corresponding frame expansions. We complement the theoretical results with numerical experiments, estimating the rate of approximation obtained from thresholding...

  20. Approximating centrality in evolving graphs: toward sublinearity

    Science.gov (United States)

    Priest, Benjamin W.; Cybenko, George

    2017-05-01

    The identification of important nodes is a ubiquitous problem in the analysis of social networks. Centrality indices (such as degree centrality, closeness centrality, betweenness centrality, PageRank, and others) are used across many domains to accomplish this task. However, the computation of such indices is expensive on large graphs. Moreover, evolving graphs are becoming increasingly important in many applications. It is therefore desirable to develop on-line algorithms that can approximate centrality measures using memory sublinear in the size of the graph. We discuss the challenges facing the semi-streaming computation of many centrality indices. In particular, we apply recent advances in the streaming and sketching literature to provide a preliminary streaming approximation algorithm for degree centrality utilizing CountSketch and a multi-pass semi-streaming approximation algorithm for closeness centrality leveraging a spanner obtained through iteratively sketching the vertex-edge adjacency matrix. We also discuss possible ways forward for approximating betweenness centrality, as well as spectral measures of centrality. We provide a preliminary result using sketched low-rank approximations to approximate the output of the HITS algorithm.

  1. Memory-optimal neural network approximation

    Science.gov (United States)

    Bölcskei, Helmut; Grohs, Philipp; Kutyniok, Gitta; Petersen, Philipp

    2017-08-01

    We summarize the main results of a recent theory-developed by the authors-establishing fundamental lower bounds on the connectivity and memory requirements of deep neural networks as a function of the complexity of the function class to be approximated by the network. These bounds are shown to be achievable. Specifically, all function classes that are optimally approximated by a general class of representation systems-so-called affine systems-can be approximated by deep neural networks with minimal connectivity and memory requirements. Affine systems encompass a wealth of representation systems from applied harmonic analysis such as wavelets, shearlets, ridgelets, α-shearlets, and more generally α-molecules. This result elucidates a remarkable universality property of deep neural networks and shows that they achieve the optimum approximation properties of all affine systems combined. Finally, we present numerical experiments demonstrating that the standard stochastic gradient descent algorithm generates deep neural networks which provide close-to-optimal approximation rates at minimal connectivity. Moreover, stochastic gradient descent is found to actually learn approximations that are sparse in the representation system optimally sparsifying the function class the network is trained on.

  2. Rapid scenarios and observed intensities

    OpenAIRE

    Franco Pettenati; Livio Sirovich

    2012-01-01

    After a destructive earthquake, national Governments need to know the approximate amount of damage, the number of casualties, and the financial losses as soon as possible. Rapid scenarios are also used to inform the general public; see the widely used Shakemap package [Wald et al. 1999, 2006] of the US Geological Survey (USGS) and the one modified by the Istituto Nazionale di Geofisica e Vulcanologia (INGV; National Institute of Geophysics and Volcanology), which is reproduced for Figure 1. T...

  3. Accuracy of Nonlinear Approximations in Spheroidal Collapse --- Why are Zel'dovich-type approximations so good?

    Science.gov (United States)

    Matsubara, T.; Yoshisato, A.; Morikawa, M.

    We investigate the reason why Zel'dovich-type approximations work accurately beyond the linear regime from the following two points of view: (1) Dimensionality of the system and (2) the Lagrangian scheme on which the Zel'dovich approximation is grounded. We introduce a model with spheroidal mass distribution and the Padé approximation in Eulerian scheme. We clarify which of these aspects supports the accuracy of the Zel'dovich-type approximations.

  4. Pharmacokinetics, Tissue Distribution, Excretion and Plasma Protein Binding Studies of Wogonin in Rats

    Directory of Open Access Journals (Sweden)

    Amer Talbi

    2014-04-01

    Full Text Available Wogonin is a natural anticancer candidate. The purpose of this study was to explore the pharmacokinetic profiles, tissue distribution, excretion and plasma protein binding of wogonin in Sprague—Dawley rats. A rapid, sensitive, and specific LC-MS/MS method has been developed for the determination of wogonin in different rat biological samples. After i.v. dosing of wogonin at different levels (10, 20 and 40 mg/kg the elimination half-life was approximately 14 min, the AUC0-∞ increased in a dose disproportional manner from 112.13 mg/L·min for 10 mg/kg to 758.19 mg/L·min for 40 mg/kg, indicating a non linear pharmacokinetic profile. After i.g. dosing at 100 mg/kg, plasma levels of wogonin peaked at 28 min with a Cmax value of 300 ng/mL and a very low oral bioavailability (1.10%. Following i.v. single dose (20 mg/kg, wogonin was detected in all examined tissues (including testis with the highest levels in kidney and liver. Approximately 21% of the administered dose was excreted as unchanged drug (mainly via non-biliairy fecal route (16.33%. Equilibrium dialysis was used to evaluate plasma protein binding of wogonin at three concentrations (0.1, 0.5 and 2 µg/mL. Results indicated a very high protein binding degree (over 90%, reducing substantially the free fraction of the compound.

  5. The grammar of approximating number pairs.

    Science.gov (United States)

    Eriksson, Kimmo; Bailey, Drew H; Geary, David C

    2010-04-01

    In the present article, we studied approximating pairs of numbers (a, b) that were used to estimate quantity in a single phrase ("two, three years ago"). Pollmann and Jansen (1996) found that only a few of the many possible pairs are actually used, suggesting an interaction between the ways in which people estimate quantity and their use of quantitative phrases in colloquial speech. They proposed a set of rules that describe which approximating pairs are used in Dutch phrases. We revisited this issue in an analysis of Swedish and American language corpora and in a series of three experiments in which Swedish and American adults rated the acceptability of various approximating pairs and created approximating pairs of their own in response to various estimation tasks. We found evidence for Pollmann and Jansen's rules in both Swedish and English phrases, but we also identified additional rules and substantial individual and cross-language variation. We will discuss implications for the origin of this loose "grammar" of approximating pairs.

  6. Multilevel weighted least squares polynomial approximation

    KAUST Repository

    Haji-Ali, Abdul-Lateef

    2017-06-30

    Weighted least squares polynomial approximation uses random samples to determine projections of functions onto spaces of polynomials. It has been shown that, using an optimal distribution of sample locations, the number of samples required to achieve quasi-optimal approximation in a given polynomial subspace scales, up to a logarithmic factor, linearly in the dimension of this space. However, in many applications, the computation of samples includes a numerical discretization error. Thus, obtaining polynomial approximations with a single level method can become prohibitively expensive, as it requires a sufficiently large number of samples, each computed with a sufficiently small discretization error. As a solution to this problem, we propose a multilevel method that utilizes samples computed with different accuracies and is able to match the accuracy of single-level approximations with reduced computational cost. We derive complexity bounds under certain assumptions about polynomial approximability and sample work. Furthermore, we propose an adaptive algorithm for situations where such assumptions cannot be verified a priori. Finally, we provide an efficient algorithm for the sampling from optimal distributions and an analysis of computationally favorable alternative distributions. Numerical experiments underscore the practical applicability of our method.

  7. Semiclassical initial value approximation for Green's function.

    Science.gov (United States)

    Kay, Kenneth G

    2010-06-28

    A semiclassical initial value approximation is obtained for the energy-dependent Green's function. For a system with f degrees of freedom the Green's function expression has the form of a (2f-1)-dimensional integral over points on the energy surface and an integral over time along classical trajectories initiated from these points. This approximation is derived by requiring an integral ansatz for Green's function to reduce to Gutzwiller's semiclassical formula when the integrations are performed by the stationary phase method. A simpler approximation is also derived involving only an (f-1)-dimensional integral over momentum variables on a Poincare surface and an integral over time. The relationship between the present expressions and an earlier initial value approximation for energy eigenfunctions is explored. Numerical tests for two-dimensional systems indicate that good accuracy can be obtained from the initial value Green's function for calculations of autocorrelation spectra and time-independent wave functions. The relative advantages of initial value approximations for the energy-dependent Green's function and the time-dependent propagator are discussed.

  8. Trajectory averaging for stochastic approximation MCMC algorithms

    KAUST Repository

    Liang, Faming

    2010-10-01

    The subject of stochastic approximation was founded by Robbins and Monro [Ann. Math. Statist. 22 (1951) 400-407]. After five decades of continual development, it has developed into an important area in systems control and optimization, and it has also served as a prototype for the development of adaptive algorithms for on-line estimation and control of stochastic systems. Recently, it has been used in statistics with Markov chain Monte Carlo for solving maximum likelihood estimation problems and for general simulation and optimizations. In this paper, we first show that the trajectory averaging estimator is asymptotically efficient for the stochastic approximation MCMC (SAMCMC) algorithm under mild conditions, and then apply this result to the stochastic approximation Monte Carlo algorithm [Liang, Liu and Carroll J. Amer. Statist. Assoc. 102 (2007) 305-320]. The application of the trajectory averaging estimator to other stochastic approximationMCMC algorithms, for example, a stochastic approximation MLE algorithm for missing data problems, is also considered in the paper. © Institute of Mathematical Statistics, 2010.

  9. Tree-fold loop approximation of AMD

    Energy Technology Data Exchange (ETDEWEB)

    Ono, Akira [Tohoku Univ., Sendai (Japan). Faculty of Science

    1997-05-01

    AMD (antisymmetrized molecular dynamics) is a frame work for describing a wave function of nucleon multi-body system by Slater determinant of Gaussian wave flux, and a theory for integrally describing a wide range of nuclear reactions such as intermittent energy heavy ion reaction, nucleon incident reaction and so forth. The aim of this study is induction on approximation equation of expected value, {nu}, in correlation capable of calculation with time proportional A (exp 3) (or lower), and to make AMD applicable to the heavier system such as Au+Au. As it must be avoided to break characteristics of AMD, it needs not to be anxious only by approximating the {nu}-value. However, in order to give this approximation any meaning, error of this approximation will have to be sufficiently small in comparison with bond energy of atomic nucleus and smaller than 1 MeV/nucleon. As the absolute expected value in correlation may be larger than 50 MeV/nucleon, the approximation is required to have a high accuracy within 2 percent. (G.K.)

  10. Numerical approximation of partial differential equations

    CERN Document Server

    Bartels, Sören

    2016-01-01

    Finite element methods for approximating partial differential equations have reached a high degree of maturity, and are an indispensible tool in science and technology. This textbook aims at providing a thorough introduction to the construction, analysis, and implementation of finite element methods for model problems arising in continuum mechanics. The first part of the book discusses elementary properties of linear partial differential equations along with their basic numerical approximation, the functional-analytical framework for rigorously establishing existence of solutions, and the construction and analysis of basic finite element methods. The second part is devoted to the optimal adaptive approximation of singularities and the fast iterative solution of linear systems of equations arising from finite element discretizations. In the third part, the mathematical framework for analyzing and discretizing saddle-point problems is formulated, corresponding finte element methods are analyzed, and particular ...

  11. Fast wavelet based sparse approximate inverse preconditioner

    Energy Technology Data Exchange (ETDEWEB)

    Wan, W.L. [Univ. of California, Los Angeles, CA (United States)

    1996-12-31

    Incomplete LU factorization is a robust preconditioner for both general and PDE problems but unfortunately not easy to parallelize. Recent study of Huckle and Grote and Chow and Saad showed that sparse approximate inverse could be a potential alternative while readily parallelizable. However, for special class of matrix A that comes from elliptic PDE problems, their preconditioners are not optimal in the sense that independent of mesh size. A reason may be that no good sparse approximate inverse exists for the dense inverse matrix. Our observation is that for this kind of matrices, its inverse entries typically have piecewise smooth changes. We can take advantage of this fact and use wavelet compression techniques to construct a better sparse approximate inverse preconditioner. We shall show numerically that our approach is effective for this kind of matrices.

  12. Rapid NMR screening of RNA secondary structure and binding

    Energy Technology Data Exchange (ETDEWEB)

    Helmling, Christina; Keyhani, Sara; Sochor, Florian; Fürtig, Boris; Hengesbach, Martin; Schwalbe, Harald, E-mail: schwalbe@nmr.uni-frankfurt.de [Johann Wolfgang Goethe-Universität, Institut für Organische Chemie und Chemische Biologie, Center for Biomolecular Magnetic Resonance (BMRZ) (Germany)

    2015-09-15

    Determination of RNA secondary structures by NMR spectroscopy is a useful tool e.g. to elucidate RNA folding space or functional aspects of regulatory RNA elements. However, current approaches of RNA synthesis and preparation are usually time-consuming and do not provide analysis with single nucleotide precision when applied for a large number of different RNA sequences. Here, we significantly improve the yield and 3′ end homogeneity of RNA preparation by in vitro transcription. Further, by establishing a native purification procedure with increased throughput, we provide a shortcut to study several RNA constructs simultaneously. We show that this approach yields μmol quantities of RNA with purities comparable to PAGE purification, while avoiding denaturation of the RNA.

  13. Variational algorithms for approximate Bayesian inference

    Science.gov (United States)

    Beal, Matthew James

    The Bayesian framework for machine learning allows for the incorporation of prior knowledge in a coherent way, avoids overfitting problems, and provides a principled basis for selecting between alternative models. Unfortunately the computations required are usually intractable. This thesis presents a unified variational Bayesian (VB) framework which approximates these computations in models with latent variables using a lower bound on the marginal likelihood. Chapter 1 presents background material on Bayesian inference, graphical models, and propagation algorithms. Chapter 2 forms the theoretical core of the thesis, generalising the expectation- maximisation (EM) algorithm for learning maximum likelihood parameters to the VB EM algorithm which integrates over model parameters. The algorithm is then specialised to the large family of conjugate-exponential (CE) graphical models, and several theorems are presented to pave the road for automated VB derivation procedures in both directed and undirected graphs (Bayesian and Markov networks, respectively). Chapters 3--5 derive and apply the VB EM algorithm to three commonly-used and important models: mixtures of factor analysers, linear dynamical systems, and hidden Markov models. It is shown how model selection tasks such as determining the dimensionality, cardinality, or number of variables are possible using VB approximations. Also explored are methods for combining sampling procedures with variational approximations, to estimate the tightness of VB bounds and to obtain more effective sampling algorithms. Chapter 6 applies VB learning to a long-standing problem of scoring discrete-variable directed acyclic graphs, and compares the performance to annealed importance sampling amongst other methods. Throughout, the VB approximation is compared to other methods including sampling, Cheeseman-Stutz, and asymptotic approximations such as BIC. The thesis concludes with a discussion of evolving directions for model selection

  14. Exact and approximate calculation of giant resonances

    Energy Technology Data Exchange (ETDEWEB)

    Vertse, T. [Magyar Tudomanyos Akademia, Debrecen (Hungary). Atommag Kutato Intezete; Liotta, R.J. [Royal Inst. of Tech., Stockholm (Sweden); Maglione, E. [Padua Univ. (Italy). Ist. di Fisica

    1995-02-13

    Energies, sum rules and partial decay widths of giant resonances in {sup 208}Pb are calculated solving exactly the continuum RPA equations corresponding to a central Woods-Saxon potential. For comparison an approximate treatment of those quantities in terms of pole expansions of the Green function (Berggren and Mittag-Leffler) is also performed. It is found that the approximated results agree well with the exact ones. Comparison with experimental data is made and a search for physically meaningful resonances is carried out. ((orig.))

  15. Approximate Inference and Deep Generative Models

    CERN Multimedia

    CERN. Geneva

    2018-01-01

    Advances in deep generative models are at the forefront of deep learning research because of the promise they offer for allowing data-efficient learning, and for model-based reinforcement learning. In this talk I'll review a few standard methods for approximate inference and introduce modern approximations which allow for efficient large-scale training of a wide variety of generative models. Finally, I'll demonstrate several important application of these models to density estimation, missing data imputation, data compression and planning.

  16. Optimal convex approximations of quantum states

    Science.gov (United States)

    Sacchi, Massimiliano F.

    2017-10-01

    We consider the problem of optimally approximating an unavailable quantum state ρ by the convex mixing of states drawn from a set of available states {νi} . The problem is recast to look for the least distinguishable state from ρ among the convex set ∑ipiνi , and the corresponding optimal weights {pi} provide the optimal convex mixing. We present the complete solution for the optimal convex approximation of a qubit mixed state when the set of available states comprises the three bases of the Pauli matrices.

  17. Approximations in the PE-method

    DEFF Research Database (Denmark)

    Arranz, Marta Galindo

    1996-01-01

    Two differenct sources of errors may occur in the implementation of the PE methods; a phase error introduced in the approximation of a pseudo-differential operator and an amplitude error generated from the starting field. First, the inherent phase errors introduced in the solution are analyzed...... for a case where the normal mode solution to the wave equation is valid, when the sound is propagated in a downward refracting atmosphere. The angular limitations for the different parabolic approximations are deduced, and calculations showing shifts in the starter as the second source of error...

  18. Approximating hidden chaotic attractors via parameter switching

    Science.gov (United States)

    Danca, Marius-F.; Kuznetsov, Nikolay V.; Chen, Guanrong

    2018-01-01

    In this paper, the problem of approximating hidden chaotic attractors of a general class of nonlinear systems is investigated. The parameter switching (PS) algorithm is utilized, which switches the control parameter within a given set of values with the initial value problem numerically solved. The PS-generated attractor approximates the attractor obtained by averaging the control parameter with the switched values, which represents the hidden chaotic attractor. The hidden chaotic attractors of a generalized Lorenz system and the Rabinovich-Fabrikant system are simulated for illustration.

  19. An Approximate Bayesian Fundamental Frequency Estimator

    DEFF Research Database (Denmark)

    Nielsen, Jesper Kjær; Christensen, Mads Græsbøll; Jensen, Søren Holdt

    2012-01-01

    and the model order is based on a probability model which corresponds to a minimum of prior information. From this probability model, we give the exact posterior distributions on the fundamental frequency and the model order, and we also present analytical approximations of these distributions which lower......Joint fundamental frequency and model order estimation is an important problem in several applications such as speech and music processing. In this paper, we develop an approximate estimation algorithm of these quantities using Bayesian inference. The inference about the fundamental frequency...

  20. ANALYTIC APPROXIMATION OF CARBON CONDENSATION ISSUES IN TYPE II SUPERNOVAE

    Energy Technology Data Exchange (ETDEWEB)

    Clayton, Donald D., E-mail: claydonald@gmail.com [Department of Physics and Astronomy, Clemson University, Clemson, SC (United States)

    2013-01-01

    I present analytic approximations for some issues related to condensation of graphite, TiC, and silicon carbide in oxygen-rich cores of supernovae of Type II. Increased understanding, which mathematical analysis can support, renders researchers more receptive to condensation in O-rich supernova gases. Taking SN 1987A as typical, my first analysis shows why the abundance of CO molecules reaches an early maximum in which free carbon remains more abundant than CO. This analysis clarifies why O-rich gas cannot oxidize C if {sup 56}Co radioactivity is as strong as in SN 1987A. My next analysis shows that the CO abundance could be regarded as being in chemical equilibrium if the CO molecule is given an effective binding energy rather than its laboratory dissociation energy. The effective binding energy makes the thermal dissociation rate of CO equal to its radioactive dissociation rate. This preserves possible relevance for the concept of chemical equilibrium. My next analysis shows that the observed abundances of CO and SiO molecules in SN 1987A rule out frequent suggestions that equilibrium condensation of SUNOCONs has occurred following atomic mixing of the He-burning shell with more central zones in such a way as to reproduce roughly the observed spectrum of isotopes in SUNOCONs while preserving C/O > 1. He atoms admixed along with the excess carbon would destroy CO and SiO molecules, leaving their observed abundances unexplained. The final analysis argues that a chemical quasiequilibrium among grains (but not gas) may exist approximately during condensation, so that its computational use is partially justified as a guide to which mineral phases would be stable against reactions with gas. I illustrate this point with quasiequilibrium calculations by Ebel and Grossman that have shown that graphite is stable even when O/C >1 if prominent molecules are justifiably excluded from the calculation of chemical equilibrium.

  1. Conformational Changes in Small Ligands Upon Tetanus Toxin Binding

    National Research Council Canada - National Science Library

    Henderson, Terry J; Gitti, Rossitza K

    2008-01-01

    ... A upon binding to tetanus toxin. C13 T1 measurements suggested that to a first approximation, the conformational behavior of doxorubicin in solution appears to be a composite of a rigid aromatic ring system, ring librations...

  2. Metal binding stoichiometry and isotherm choice in biosorption

    Energy Technology Data Exchange (ETDEWEB)

    Schiewer, S.; Wong, M.H.

    1999-11-01

    Seaweeds that possess a high metal binding capacity may be used as biosorbents for the removal of toxic heavy metals from wastewater. The binding of Cu and Ni by three brown algae (Sargassum, Colpomenia, Petalonia) and one green alga (Ulva) was investigated at pH 4.0 and pH 3.0. The greater binding strength of Cu is reflected in a binding constant that is about 10 times as high as that of Ni. The extent of metal binding followed the order Petalonia {approximately} Sargassum > Colpomenia > Ulva. This was caused by a decreasing number of binding sites and by much lower metal binding constants for Ulva as compared to the brown algae. Three different stoichiometric assumptions are compared for describing the metal binding, which assume either that each metal ion M binds to one binding site B forming a BM complex or that a divalent metal ion M binds to two monovalent sites B forming BM{sub 0.5} or B{sub 2}M complexes, respectively. Stoichiometry plots are proposed as tools to discern the relevant binding stoichiometry. The pH effect in metal binding and the change in proton binding were well predicted for the B{sub 2}M or BM{sub 0.5} stoichiometries with the former being better for Cu and the latter preferable for Ni. Overall, the BM{sub 0.5} model is recommended because it avoids iterations.

  3. Formalizing Neurath's ship: Approximate algorithms for online causal learning.

    Science.gov (United States)

    Bramley, Neil R; Dayan, Peter; Griffiths, Thomas L; Lagnado, David A

    2017-04-01

    Higher-level cognition depends on the ability to learn models of the world. We can characterize this at the computational level as a structure-learning problem with the goal of best identifying the prevailing causal relationships among a set of relata. However, the computational cost of performing exact Bayesian inference over causal models grows rapidly as the number of relata increases. This implies that the cognitive processes underlying causal learning must be substantially approximate. A powerful class of approximations that focuses on the sequential absorption of successive inputs is captured by the Neurath's ship metaphor in philosophy of science, where theory change is cast as a stochastic and gradual process shaped as much by people's limited willingness to abandon their current theory when considering alternatives as by the ground truth they hope to approach. Inspired by this metaphor and by algorithms for approximating Bayesian inference in machine learning, we propose an algorithmic-level model of causal structure learning under which learners represent only a single global hypothesis that they update locally as they gather evidence. We propose a related scheme for understanding how, under these limitations, learners choose informative interventions that manipulate the causal system to help elucidate its workings. We find support for our approach in the analysis of 3 experiments. (PsycINFO Database Record (c) 2017 APA, all rights reserved).

  4. Total iron binding capacity

    Science.gov (United States)

    ... page: //medlineplus.gov/ency/article/003489.htm Total iron binding capacity To use the sharing features on this page, please enable JavaScript. Total iron binding capacity (TIBC) is a blood test to ...

  5. Approximate Networking for Universal Internet Access

    Directory of Open Access Journals (Sweden)

    Junaid Qadir

    2017-12-01

    Full Text Available Despite the best efforts of networking researchers and practitioners, an ideal Internet experience is inaccessible to an overwhelming majority of people the world over, mainly due to the lack of cost-efficient ways of provisioning high-performance, global Internet. In this paper, we argue that instead of an exclusive focus on a utopian goal of universally accessible “ideal networking” (in which we have a high throughput and quality of service as well as low latency and congestion, we should consider providing “approximate networking” through the adoption of context-appropriate trade-offs. In this regard, we propose to leverage the advances in the emerging trend of “approximate computing” that rely on relaxing the bounds of precise/exact computing to provide new opportunities for improving the area, power, and performance efficiency of systems by orders of magnitude by embracing output errors in resilient applications. Furthermore, we propose to extend the dimensions of approximate computing towards various knobs available at network layers. Approximate networking can be used to provision “Global Access to the Internet for All” (GAIA in a pragmatically tiered fashion, in which different users around the world are provided a different context-appropriate (but still contextually functional Internet experience.

  6. Approximate Symbolic Model Checking Using Overlapping Projections

    Science.gov (United States)

    1999-01-01

    Abstract Symbolic Model Checking extends the scope of verification algorithms that can be handled automatically, by using symbolic representations...many of today’s large designs because of the state explosion problem. Approximate symbolic model checking is an attempt to trade off accuracy with

  7. Static correlation beyond the random phase approximation

    DEFF Research Database (Denmark)

    Olsen, Thomas; Thygesen, Kristian Sommer

    2014-01-01

    We investigate various approximations to the correlation energy of a H2 molecule in the dissociation limit, where the ground state is poorly described by a single Slater determinant. The correlation energies are derived from the density response function and it is shown that response functions de...

  8. Markov operators, positive semigroups and approximation processes

    CERN Document Server

    Altomare, Francesco; Leonessa, Vita; Rasa, Ioan

    2015-01-01

    In recent years several investigations have been devoted to the study of large classes of (mainly degenerate) initial-boundary value evolution problems in connection with the possibility to obtain a constructive approximation of the associated positive C_0-semigroups. In this research monograph we present the main lines of a theory which finds its root in the above-mentioned research field.

  9. Nonlinear approximation with dictionaries,.. II: Inverse estimates

    DEFF Research Database (Denmark)

    Gribonval, Rémi; Nielsen, Morten

    In this paper we study inverse estimates of the Bernstein type for nonlinear approximation with structured redundant dictionaries in a Banach space. The main results are for separated decomposable dictionaries in Hilbert spaces, which generalize the notion of joint block-diagonal mutually...

  10. Approximate Equilibrium Problems and Fixed Points

    Directory of Open Access Journals (Sweden)

    H. Mazaheri

    2013-01-01

    Full Text Available We find a common element of the set of fixed points of a map and the set of solutions of an approximate equilibrium problem in a Hilbert space. Then, we show that one of the sequences weakly converges. Also we obtain some theorems about equilibrium problems and fixed points.

  11. Nonlinear approximation with dictionaries. II. Inverse Estimates

    DEFF Research Database (Denmark)

    Gribonval, Rémi; Nielsen, Morten

    2006-01-01

    In this paper, which is the sequel to [16], we study inverse estimates of the Bernstein type for nonlinear approximation with structured redundant dictionaries in a Banach space. The main results are for blockwise incoherent dictionaries in Hilbert spaces, which generalize the notion of joint block...

  12. On the Subspace Projected Approximate Matrix method

    NARCIS (Netherlands)

    Brandts, J.H.; Reis da Silva, R.

    2015-01-01

    We provide a comparative study of the Subspace Projected Approximate Matrix method, abbreviated SPAM, which is a fairly recent iterative method of computing a few eigenvalues of a Hermitian matrix A. It falls in the category of inner-outer iteration methods and aims to reduce the costs of

  13. Approximability of Minimum AND-Circuits

    NARCIS (Netherlands)

    Arpe, J.; Manthey, Bodo

    Given a set of monomials, the {\\sc Minimum AND-Circuit} problem asks for a circuit that computes these monomials using AND-gates of fan-in two and being of minimum size. We prove that the problem is not polynomial-time approximable within a factor of less than 1.0051 unless {\\sc P = NP}, even if the

  14. Uncertainty relations for approximation and estimation

    Energy Technology Data Exchange (ETDEWEB)

    Lee, Jaeha, E-mail: jlee@post.kek.jp [Department of Physics, University of Tokyo, 7-3-1 Hongo, Bunkyo-ku, Tokyo 113-0033 (Japan); Tsutsui, Izumi, E-mail: izumi.tsutsui@kek.jp [Department of Physics, University of Tokyo, 7-3-1 Hongo, Bunkyo-ku, Tokyo 113-0033 (Japan); Theory Center, Institute of Particle and Nuclear Studies, High Energy Accelerator Research Organization (KEK), 1-1 Oho, Tsukuba, Ibaraki 305-0801 (Japan)

    2016-05-27

    We present a versatile inequality of uncertainty relations which are useful when one approximates an observable and/or estimates a physical parameter based on the measurement of another observable. It is shown that the optimal choice for proxy functions used for the approximation is given by Aharonov's weak value, which also determines the classical Fisher information in parameter estimation, turning our inequality into the genuine Cramér–Rao inequality. Since the standard form of the uncertainty relation arises as a special case of our inequality, and since the parameter estimation is available as well, our inequality can treat both the position–momentum and the time–energy relations in one framework albeit handled differently. - Highlights: • Several inequalities interpreted as uncertainty relations for approximation/estimation are derived from a single ‘versatile inequality’. • The ‘versatile inequality’ sets a limit on the approximation of an observable and/or the estimation of a parameter by another observable. • The ‘versatile inequality’ turns into an elaboration of the Robertson–Kennard (Schrödinger) inequality and the Cramér–Rao inequality. • Both the position–momentum and the time–energy relation are treated in one framework. • In every case, Aharonov's weak value arises as a key geometrical ingredient, deciding the optimal choice for the proxy functions.

  15. Radiation forces in the discrete dipole approximation

    NARCIS (Netherlands)

    Hoekstra, A.G.; Frijlink, M.O.; Waters, L.B.F.M.; Sloot, P.M.A.

    2001-01-01

    The theory of the discrete-dipole approximation (DDA) for light scattering is extended to allow for the calculation of radiation forces on each dipole in the DDA model. Starting with the theory of Draine and Weingartner [Astrophys. J. 470, 551 (1996)] we derive an expression for the radiation force

  16. Hardness of approximation for strip packing

    DEFF Research Database (Denmark)

    Adamaszek, Anna Maria; Kociumaka, Tomasz; Pilipczuk, Marcin

    2017-01-01

    -dimensional knapsack. In this article, we answer this question in negative by proving that it is NP-hard to approximate strip packing within a factor better than 12/11, even when restricted to polynomially bounded input data. In particular, this shows that the strip packing problem admits no quasi-polynomial time...

  17. Error Minimization of Polynomial Approximation of Delta

    Indian Academy of Sciences (India)

    The difference between Universal time (UT) and Dynamical time (TD), known as Delta ( ) is tabulated for the first day of each year in the Astronomical Almanac. During the last four centuries it is found that there are large differences between its values for two consecutive years. Polynomial approximations have been ...

  18. On approximating the TSP with intersecting neighborhoods

    NARCIS (Netherlands)

    Elbassioni, Khaled; Fishkin, Aleksei V.; Sitters, René

    2006-01-01

    In the TSP with neighborhoods problem we are given a set of n regions (neighborhoods) in the plane, and seek to find a minimum length TSP tour that goes through all the regions. We give two approximation algorithms for the case when the regions are allowed to intersect: We give the first O(1)-factor

  19. Fostering Formal Commutativity Knowledge with Approximate Arithmetic.

    Directory of Open Access Journals (Sweden)

    Sonja Maria Hansen

    Full Text Available How can we enhance the understanding of abstract mathematical principles in elementary school? Different studies found out that nonsymbolic estimation could foster subsequent exact number processing and simple arithmetic. Taking the commutativity principle as a test case, we investigated if the approximate calculation of symbolic commutative quantities can also alter the access to procedural and conceptual knowledge of a more abstract arithmetic principle. Experiment 1 tested first graders who had not been instructed about commutativity in school yet. Approximate calculation with symbolic quantities positively influenced the use of commutativity-based shortcuts in formal arithmetic. We replicated this finding with older first graders (Experiment 2 and third graders (Experiment 3. Despite the positive effect of approximation on the spontaneous application of commutativity-based shortcuts in arithmetic problems, we found no comparable impact on the application of conceptual knowledge of the commutativity principle. Overall, our results show that the usage of a specific arithmetic principle can benefit from approximation. However, the findings also suggest that the correct use of certain procedures does not always imply conceptual understanding. Rather, the conceptual understanding of commutativity seems to lag behind procedural proficiency during elementary school.

  20. Approximating a nonlinear MTFDE from physiology

    Science.gov (United States)

    Teodoro, M. Filomena

    2016-12-01

    This paper describes a numerical scheme which approximates the solution of a nonlinear mixed type functional differential equation from nerve conduction theory. The solution of such equation is defined in all the entire real axis and tends to known values at ±∞. A numerical method extended from linear case is developed and applied to solve a nonlinear equation.

  1. Virial expansion coefficients in the harmonic approximation

    DEFF Research Database (Denmark)

    R. Armstrong, J.; Zinner, Nikolaj Thomas; V. Fedorov, D.

    2012-01-01

    The virial expansion method is applied within a harmonic approximation to an interacting N-body system of identical fermions. We compute the canonical partition functions for two and three particles to get the two lowest orders in the expansion. The energy spectrum is carefully interpolated...

  2. Boundary Value Problems and Approximate Solutions

    African Journals Online (AJOL)

    Tadesse

    2. METHODOLOGY. The finite difference method for the solution of a two point boundary value problem consists in replacing the derivatives present in the differential equation and the boundary conditions with the help of finite difference approximations and then solving the resulting linear system of equations by a standard ...

  3. Approximate Dynamic Programming by Practical Examples

    NARCIS (Netherlands)

    Mes, Martijn R.K.; Perez Rivera, Arturo Eduardo; Boucherie, Richard; van Dijk, Nico M.

    2017-01-01

    Computing the exact solution of an MDP model is generally difficult and possibly intractable for realistically sized problem instances. A powerful technique to solve the large scale discrete time multistage stochastic control processes is Approximate Dynamic Programming (ADP). Although ADP is used

  4. Approximability and Parameterized Complexity of Minmax Values

    DEFF Research Database (Denmark)

    Hansen, Kristoffer Arnsfelt; Hansen, Thomas Dueholm; Miltersen, Peter Bro

    2008-01-01

    We consider approximating the minmax value of a multi player game in strategic form. Tightening recent bounds by Borgs et al., we observe that approximating the value with a precision of ε log n digits (for any constant ε > 0) is NP-hard, where n is the size of the game. On the other hand......, approximating the value with a precision of c log log n digits (for any constant c ≥ 1) can be done in quasi-polynomial time. We consider the parameterized complexity of the problem, with the parameter being the number of pure strategies k of the player for which the minmax value is computed. We show...... that if there are three players, k = 2 and there are only two possible rational payoffs, the minmax value is a rational number and can be computed exactly in linear time. In the general case, we show that the value can be approximated wigh any polynomial number of digits of accuracy in time n^O(k) . On the other hand, we...

  5. Hierarchical matrix approximation of large covariance matrices

    KAUST Repository

    Litvinenko, Alexander

    2015-11-30

    We approximate large non-structured Matérn covariance matrices of size n×n in the H-matrix format with a log-linear computational cost and storage O(kn log n), where rank k ≪ n is a small integer. Applications are: spatial statistics, machine learning and image analysis, kriging and optimal design.

  6. TMB: Automatic differentiation and laplace approximation

    DEFF Research Database (Denmark)

    Kristensen, Kasper; Nielsen, Anders; Berg, Casper Willestofte

    2016-01-01

    computations. The user defines the joint likelihood for the data and the random effects as a C++ template function, while all the other operations are done in R; e.g., reading in the data. The package evaluates and maximizes the Laplace approximation of the marginal likelihood where the random effects...

  7. Approximation Algorithms for Model-Based Diagnosis

    NARCIS (Netherlands)

    Feldman, A.B.

    2010-01-01

    Model-based diagnosis is an area of abductive inference that uses a system model, together with observations about system behavior, to isolate sets of faulty components (diagnoses) that explain the observed behavior, according to some minimality criterion. This thesis presents greedy approximation

  8. Upper Bounds on Numerical Approximation Errors

    DEFF Research Database (Denmark)

    Raahauge, Peter

    2004-01-01

    This paper suggests a method for determining rigorous upper bounds on approximationerrors of numerical solutions to infinite horizon dynamic programming models.Bounds are provided for approximations of the value function and the policyfunction as well as the derivatives of the value function...

  9. Revisiting Twomey's approximation for peak supersaturation

    Directory of Open Access Journals (Sweden)

    B. J. Shipway

    2015-04-01

    Full Text Available Twomey's seminal 1959 paper provided lower and upper bound approximations to the estimation of peak supersaturation within an updraft and thus provides the first closed expression for the number of nucleated cloud droplets. The form of this approximation is simple, but provides a surprisingly good estimate and has subsequently been employed in more sophisticated treatments of nucleation parametrization. In the current paper, we revisit the lower bound approximation of Twomey and make a small adjustment that can be used to obtain a more accurate calculation of peak supersaturation under all potential aerosol loadings and thermodynamic conditions. In order to make full use of this improved approximation, the underlying integro-differential equation for supersaturation evolution and the condition for calculating peak supersaturation are examined. A simple rearrangement of the algebra allows for an expression to be written down that can then be solved with a single lookup table with only one independent variable for an underlying lognormal aerosol population. While multimodal aerosol with N different dispersion characteristics requires 2N+1 inputs to calculate the activation fraction, only N of these one-dimensional lookup tables are needed. No additional information is required in the lookup table to deal with additional chemical, physical or thermodynamic properties. The resulting implementation provides a relatively simple, yet computationally cheap, physically based parametrization of droplet nucleation for use in climate and Numerical Weather Prediction models.

  10. Approximate Model Checking of Stochastic COWS

    NARCIS (Netherlands)

    Quaglia, Paola; Schivo, Stefano

    2010-01-01

    Given the description of a model and a probabilistic formula, approximate model checking is a verification technique based on statistical reasoning that allows answering whether or not the model satisfies the formula. Only a subset of the properties that can be analyzed by exact model checking can

  11. Statistical model semiquantitatively approximates arabinoxylooligosaccharides' structural diversity

    DEFF Research Database (Denmark)

    Dotsenko, Gleb; Nielsen, Michael Krogsgaard; Lange, Lene

    2016-01-01

    (wheat flour arabinoxylan (arabinose/xylose, A/X = 0.47); grass arabinoxylan (A/X = 0.24); wheat straw arabinoxylan (A/X = 0.15); and hydrothermally pretreated wheat straw arabinoxylan (A/X = 0.05)), is semiquantitatively approximated using the proposed model. The suggested approach can be applied...

  12. Approximations and endomorphism algebras of modules

    CERN Document Server

    Göbel, Rüdiger

    2006-01-01

    This monograph provides a thorough treatment of module theory, a subfield of algebra. The authors develop an approximation theory as well as realization theorems and present some of its recent applications, notably to infinite-dimensional combinatorics and model theory. The book is devoted to graduate students interested in algebra as well as to experts in module theory.

  13. An approximate classical unimolecular reaction rate theory

    Science.gov (United States)

    Zhao, Meishan; Rice, Stuart A.

    1992-05-01

    We describe a classical theory of unimolecular reaction rate which is derived from the analysis of Davis and Gray by use of simplifying approximations. These approximations concern the calculation of the locations of, and the fluxes of phase points across, the bottlenecks to fragmentation and to intramolecular energy transfer. The bottleneck to fragment separation is represented as a vibration-rotation state dependent separatrix, which approximation is similar to but extends and improves the approximations for the separatrix introduced by Gray, Rice, and Davis and by Zhao and Rice. The novel feature in our analysis is the representation of the bottlenecks to intramolecular energy transfer as dividing surfaces in phase space; the locations of these dividing surfaces are determined by the same conditions as locate the remnants of robust tori with frequency ratios related to the golden mean (in a two degree of freedom system these are the cantori). The flux of phase points across each dividing surface is calculated with an analytic representation instead of a stroboscopic mapping. The rate of unimolecular reaction is identified with the net rate at which phase points escape from the region of quasiperiodic bounded motion to the region of free fragment motion by consecutively crossing the dividing surfaces for intramolecular energy exchange and the separatrix. This new theory generates predictions of the rates of predissociation of the van der Waals molecules HeI2, NeI2 and ArI2 which are in very good agreement with available experimental data.

  14. Padé approximations and diophantine geometry

    Science.gov (United States)

    Chudnovsky, D. V.; Chudnovsky, G. V.

    1985-01-01

    Using methods of Padé approximations we prove a converse to Eisenstein's theorem on the boundedness of denominators of coefficients in the expansion of an algebraic function, for classes of functions, parametrized by meromorphic functions. This result is applied to the Tate conjecture on the effective description of isogenies for elliptic curves. PMID:16593552

  15. Binding of Ca Ions by Paramecium caudatum

    Science.gov (United States)

    Naitoh, Yutaka; Yasumasu, Ikuo

    1967-01-01

    Binding of 45Ca by live Paramecium caudatum was determined under various external ionic conditions. It was found that calcium uptake was separable into at least two components, a rapid and a slow one. The rapid component was influenced by the presence of certain other ions in a manner which agrees with the law of mass action. It appears that an ion exchange system may be involved in a binding equilibrium established between Paramecium, Ca++, and certain other ions. K+, Rb+, and Ba++ in the equilibrium medium are among those ions which inhibit calcium uptake. It is proposed that liberation of Ca++ from binding sites on Paramecium by an exchange reaction with competing ions is the first step in the mechanism of ciliary reversal in the response to external application of these ions. PMID:6033587

  16. Approximate dynamic programming using fluid and diffusion approximations with applications to power management

    OpenAIRE

    Chen, Wei; Huang, Dayu; Kulkarni, Ankur A.; Unnikrishnan, Jayakrishnan; Zhu, Quanyan; Mehta, Prashant; Meyn, Sean; Wierman, Adam

    2013-01-01

    Neuro-dynamic programming is a class of powerful techniques for approximating the solution to dynamic programming equations. In their most computationally attractive formulations, these techniques provide the approximate solution only within a prescribed finite-dimensional function class. Thus, the question that always arises is how should the function class be chosen? The goal of this paper is to propose an approach using the solutions to associated fluid and diffusion approximations. In ord...

  17. Specific binding of neoglycoproteins to Toxoplasma gondii tachyzoites.

    Science.gov (United States)

    Robert, R; de la Jarrige, P L; Mahaza, C; Cottin, J; Marot-Leblond, A; Senet, J M

    1991-01-01

    Several studies have shown that protozoa bind to glycoproteins or neoglycoproteins. Here we report that Toxoplasma gondii binds strongly to bovine serum albumin-glucosamide. The binding was rapid, time dependent, partially reversible, saturable, and specific. Scatchard analysis showed about 40,000 molecules of bovine serum albumin-glucosamide per toxoplasma cell. The apparent dissociation constant was found to be 4.46 x 10(-8) M. Images PMID:1937826

  18. Nonlinear analysis approximation theory, optimization and applications

    CERN Document Server

    2014-01-01

    Many of our daily-life problems can be written in the form of an optimization problem. Therefore, solution methods are needed to solve such problems. Due to the complexity of the problems, it is not always easy to find the exact solution. However, approximate solutions can be found. The theory of the best approximation is applicable in a variety of problems arising in nonlinear functional analysis and optimization. This book highlights interesting aspects of nonlinear analysis and optimization together with many applications in the areas of physical and social sciences including engineering. It is immensely helpful for young graduates and researchers who are pursuing research in this field, as it provides abundant research resources for researchers and post-doctoral fellows. This will be a valuable addition to the library of anyone who works in the field of applied mathematics, economics and engineering.

  19. Traveltime approximations for inhomogeneous HTI media

    KAUST Repository

    Alkhalifah, Tariq Ali

    2011-01-01

    Traveltimes information is convenient for parameter estimation especially if the medium is described by an anisotropic set of parameters. This is especially true if we could relate traveltimes analytically to these medium parameters, which is generally hard to do in inhomogeneous media. As a result, I develop traveltimes approximations for horizontaly transversely isotropic (HTI) media as simplified and even linear functions of the anisotropic parameters. This is accomplished by perturbing the solution of the HTI eikonal equation with respect to η and the azimuthal symmetry direction (usually used to describe the fracture direction) from a generally inhomogeneous elliptically anisotropic background medium. The resulting approximations can provide accurate analytical description of the traveltime in a homogenous background compared to other published moveout equations out there. These equations will allow us to readily extend the inhomogenous background elliptical anisotropic model to an HTI with a variable, but smoothly varying, η and horizontal symmetry direction values. © 2011 Society of Exploration Geophysicists.

  20. Numerical and approximate solutions for plume rise

    Science.gov (United States)

    Krishnamurthy, Ramesh; Gordon Hall, J.

    Numerical and approximate analytical solutions are compared for turbulent plume rise in a crosswind. The numerical solutions were calculated using the plume rise model of Hoult, Fay and Forney (1969, J. Air Pollut. Control Ass.19, 585-590), over a wide range of pertinent parameters. Some wind shear and elevated inversion effects are included. The numerical solutions are seen to agree with the approximate solutions over a fairly wide range of the parameters. For the conditions considered in the study, wind shear effects are seen to be quite small. A limited study was made of the penetration of elevated inversions by plumes. The results indicate the adequacy of a simple criterion proposed by Briggs (1969, AEC Critical Review Series, USAEC Division of Technical Information extension, Oak Ridge, Tennesse).

  1. Approximate inverse preconditioners for general sparse matrices

    Energy Technology Data Exchange (ETDEWEB)

    Chow, E.; Saad, Y. [Univ. of Minnesota, Minneapolis, MN (United States)

    1994-12-31

    Preconditioned Krylov subspace methods are often very efficient in solving sparse linear matrices that arise from the discretization of elliptic partial differential equations. However, for general sparse indifinite matrices, the usual ILU preconditioners fail, often because of the fact that the resulting factors L and U give rise to unstable forward and backward sweeps. In such cases, alternative preconditioners based on approximate inverses may be attractive. We are currently developing a number of such preconditioners based on iterating on each column to get the approximate inverse. For this approach to be efficient, the iteration must be done in sparse mode, i.e., we must use sparse-matrix by sparse-vector type operatoins. We will discuss a few options and compare their performance on standard problems from the Harwell-Boeing collection.

  2. A Varifold Approach to Surface Approximation

    Science.gov (United States)

    Buet, Blanche; Leonardi, Gian Paolo; Masnou, Simon

    2017-11-01

    We show that the theory of varifolds can be suitably enriched to open the way to applications in the field of discrete and computational geometry. Using appropriate regularizations of the mass and of the first variation of a varifold we introduce the notion of approximate mean curvature and show various convergence results that hold, in particular, for sequences of discrete varifolds associated with point clouds or pixel/voxel-type discretizations of d-surfaces in the Euclidean n-space, without restrictions on dimension and codimension. The variational nature of the approach also allows us to consider surfaces with singularities, and in that case the approximate mean curvature is consistent with the generalized mean curvature of the limit surface. A series of numerical tests are provided in order to illustrate the effectiveness and generality of the method.

  3. Approximated solutions to Born-Infeld dynamics

    Energy Technology Data Exchange (ETDEWEB)

    Ferraro, Rafael [Instituto de Astronomía y Física del Espacio (IAFE, CONICET-UBA),Casilla de Correo 67, Sucursal 28, 1428 Buenos Aires (Argentina); Departamento de Física, Facultad de Ciencias Exactas y Naturales, Universidad de Buenos Aires,Ciudad Universitaria, Pabellón I, 1428 Buenos Aires (Argentina); Nigro, Mauro [Departamento de Física, Facultad de Ciencias Exactas y Naturales, Universidad de Buenos Aires,Ciudad Universitaria, Pabellón I, 1428 Buenos Aires (Argentina)

    2016-02-01

    The Born-Infeld equation in the plane is usefully captured in complex language. The general exact solution can be written as a combination of holomorphic and anti-holomorphic functions. However, this solution only expresses the potential in an implicit way. We rework the formulation to obtain the complex potential in an explicit way, by means of a perturbative procedure. We take care of the secular behavior common to this kind of approach, by resorting to a symmetry the equation has at the considered order of approximation. We apply the method to build approximated solutions to Born-Infeld electrodynamics. We solve for BI electromagnetic waves traveling in opposite directions. We study the propagation at interfaces, with the aim of searching for effects susceptible to experimental detection. In particular, we show that a reflected wave is produced when a wave is incident on a semi-space containing a magnetostatic field.

  4. The approximability of the String Barcoding problem

    Directory of Open Access Journals (Sweden)

    Rizzi Romeo

    2006-08-01

    Full Text Available Abstract The String Barcoding (SBC problem, introduced by Rash and Gusfield (RECOMB, 2002, consists in finding a minimum set of substrings that can be used to distinguish between all members of a set of given strings. In a computational biology context, the given strings represent a set of known viruses, while the substrings can be used as probes for an hybridization experiment via microarray. Eventually, one aims at the classification of new strings (unknown viruses through the result of the hybridization experiment. In this paper we show that SBC is as hard to approximate as Set Cover. Furthermore, we show that the constrained version of SBC (with probes of bounded length is also hard to approximate. These negative results are tight.

  5. Uniform semiclassical approximations for umbilic bifurcation catastrophes

    CERN Document Server

    Main, J

    1998-01-01

    Gutzwiller's trace formula for the semiclassical density of states diverges at the bifurcation points of periodic orbits and has to be replaced with uniform semiclassical approximations. We present a method to derive these expressions from the standard representations of the elementary catastrophes and to directly relate the uniform solutions to classical periodic orbit parameters. The method is simple even for ungeneric bifurcations with corank 2 such as the umbilic catastrophes. We demonstrate the technique on a hyperbolic umbilic in the diamagnetic Kepler problem.

  6. Best approximation to monomials on a cube

    Science.gov (United States)

    Yudin, V. A.

    2008-08-01

    The paper considers a multivariate analogue of the Chebyshev problem on the cube concerning the construction of polynomials of least deviation from zero. A classification of monomials possessing a unique polynomial of best approximation in the space of continuous functions on the unit cube in \\mathbb R^n is given. Precise solutions in some weighted spaces L_p are found.Bibliography: 11 titles.

  7. Hierarchical matrix approximation of large covariance matrices

    KAUST Repository

    Litvinenko, Alexander

    2015-01-05

    We approximate large non-structured covariance matrices in the H-matrix format with a log-linear computational cost and storage O(nlogn). We compute inverse, Cholesky decomposition and determinant in H-format. As an example we consider the class of Matern covariance functions, which are very popular in spatial statistics, geostatistics, machine learning and image analysis. Applications are: kriging and op- timal design.

  8. Hierarchical matrix approximation of large covariance matrices

    KAUST Repository

    Litvinenko, Alexander

    2015-01-07

    We approximate large non-structured covariance matrices in the H-matrix format with a log-linear computational cost and storage O(n log n). We compute inverse, Cholesky decomposition and determinant in H-format. As an example we consider the class of Matern covariance functions, which are very popular in spatial statistics, geostatistics, machine learning and image analysis. Applications are: kriging and optimal design

  9. Approximation methods for stochastic petri nets

    Science.gov (United States)

    Jungnitz, Hauke Joerg

    1992-01-01

    Stochastic Marked Graphs are a concurrent decision free formalism provided with a powerful synchronization mechanism generalizing conventional Fork Join Queueing Networks. In some particular cases the analysis of the throughput can be done analytically. Otherwise the analysis suffers from the classical state explosion problem. Embedded in the divide and conquer paradigm, approximation techniques are introduced for the analysis of stochastic marked graphs and Macroplace/Macrotransition-nets (MPMT-nets), a new subclass introduced herein. MPMT-nets are a subclass of Petri nets that allow limited choice, concurrency and sharing of resources. The modeling power of MPMT is much larger than that of marked graphs, e.g., MPMT-nets can model manufacturing flow lines with unreliable machines and dataflow graphs where choice and synchronization occur. The basic idea leads to the notion of a cut to split the original net system into two subnets. The cuts lead to two aggregated net systems where one of the subnets is reduced to a single transition. A further reduction leads to a basic skeleton. The generalization of the idea leads to multiple cuts, where single cuts can be applied recursively leading to a hierarchical decomposition. Based on the decomposition, a response time approximation technique for the performance analysis is introduced. Also, delay equivalence, which has previously been introduced in the context of marked graphs by Woodside et al., Marie's method and flow equivalent aggregation are applied to the aggregated net systems. The experimental results show that response time approximation converges quickly and shows reasonable accuracy in most cases. The convergence of Marie's method and flow equivalent aggregation are applied to the aggregated net systems. The experimental results show that response time approximation converges quickly and shows reasonable accuracy in most cases. The convergence of Marie's is slower, but the accuracy is generally better. Delay

  10. Approximation for limit cycles and their isochrons.

    Science.gov (United States)

    Demongeot, Jacques; Françoise, Jean-Pierre

    2006-12-01

    Local analysis of trajectories of dynamical systems near an attractive periodic orbit displays the notion of asymptotic phase and isochrons. These notions are quite useful in applications to biosciences. In this note, we give an expression for the first approximation of equations of isochrons in the setting of perturbations of polynomial Hamiltonian systems. This method can be generalized to perturbations of systems that have a polynomial integral factor (like the Lotka-Volterra equation).

  11. CHAMP: Changepoint Detection Using Approximate Model Parameters

    Science.gov (United States)

    2014-06-01

    CHAMP : Changepoint Detection Using Approximate Model Parameters Scott Niekum1,2 Sarah Osentoski3 Christopher G. Atkeson1 Andrew G. Barto2 Abstract We...introduce CHAMP , an algorithm for online Bayesian changepoint detection in settings where it is difficult or undesirable to integrate over the... CHAMP to another state-of-the-art online Bayesian changepoint detection method. 1 Introduction Many practical applications in statistics require

  12. Solving Math Problems Approximately: A Developmental Perspective.

    Directory of Open Access Journals (Sweden)

    Dana Ganor-Stern

    Full Text Available Although solving arithmetic problems approximately is an important skill in everyday life, little is known about the development of this skill. Past research has shown that when children are asked to solve multi-digit multiplication problems approximately, they provide estimates that are often very far from the exact answer. This is unfortunate as computation estimation is needed in many circumstances in daily life. The present study examined 4th graders, 6th graders and adults' ability to estimate the results of arithmetic problems relative to a reference number. A developmental pattern was observed in accuracy, speed and strategy use. With age there was a general increase in speed, and an increase in accuracy mainly for trials in which the reference number was close to the exact answer. The children tended to use the sense of magnitude strategy, which does not involve any calculation but relies mainly on an intuitive coarse sense of magnitude, while the adults used the approximated calculation strategy which involves rounding and multiplication procedures, and relies to a greater extent on calculation skills and working memory resources. Importantly, the children were less accurate than the adults, but were well above chance level. In all age groups performance was enhanced when the reference number was smaller (vs. larger than the exact answer and when it was far (vs. close from it, suggesting the involvement of an approximate number system. The results suggest the existence of an intuitive sense of magnitude for the results of arithmetic problems that might help children and even adults with difficulties in math. The present findings are discussed in the context of past research reporting poor estimation skills among children, and the conditions that might allow using children estimation skills in an effective manner.

  13. Fast approximate convex decomposition using relative concavity

    KAUST Repository

    Ghosh, Mukulika

    2013-02-01

    Approximate convex decomposition (ACD) is a technique that partitions an input object into approximately convex components. Decomposition into approximately convex pieces is both more efficient to compute than exact convex decomposition and can also generate a more manageable number of components. It can be used as a basis of divide-and-conquer algorithms for applications such as collision detection, skeleton extraction and mesh generation. In this paper, we propose a new method called Fast Approximate Convex Decomposition (FACD) that improves the quality of the decomposition and reduces the cost of computing it for both 2D and 3D models. In particular, we propose a new strategy for evaluating potential cuts that aims to reduce the relative concavity, rather than absolute concavity. As shown in our results, this leads to more natural and smaller decompositions that include components for small but important features such as toes or fingers while not decomposing larger components, such as the torso, that may have concavities due to surface texture. Second, instead of decomposing a component into two pieces at each step, as in the original ACD, we propose a new strategy that uses a dynamic programming approach to select a set of n c non-crossing (independent) cuts that can be simultaneously applied to decompose the component into n c+1 components. This reduces the depth of recursion and, together with a more efficient method for computing the concavity measure, leads to significant gains in efficiency. We provide comparative results for 2D and 3D models illustrating the improvements obtained by FACD over ACD and we compare with the segmentation methods in the Princeton Shape Benchmark by Chen et al. (2009) [31]. © 2012 Elsevier Ltd. All rights reserved.

  14. On approximation of functions by product operators

    Directory of Open Access Journals (Sweden)

    Hare Krishna Nigam

    2013-12-01

    Full Text Available In the present paper, two quite new reults on the degree of approximation of a function f belonging to the class Lip(α,r, 1≤ r <∞ and the weighted class W(Lr,ξ(t, 1≤ r <∞ by (C,2(E,1 product operators have been obtained. The results obtained in the present paper generalize various known results on single operators.

  15. Solving Math Problems Approximately: A Developmental Perspective

    Science.gov (United States)

    Ganor-Stern, Dana

    2016-01-01

    Although solving arithmetic problems approximately is an important skill in everyday life, little is known about the development of this skill. Past research has shown that when children are asked to solve multi-digit multiplication problems approximately, they provide estimates that are often very far from the exact answer. This is unfortunate as computation estimation is needed in many circumstances in daily life. The present study examined 4th graders, 6th graders and adults’ ability to estimate the results of arithmetic problems relative to a reference number. A developmental pattern was observed in accuracy, speed and strategy use. With age there was a general increase in speed, and an increase in accuracy mainly for trials in which the reference number was close to the exact answer. The children tended to use the sense of magnitude strategy, which does not involve any calculation but relies mainly on an intuitive coarse sense of magnitude, while the adults used the approximated calculation strategy which involves rounding and multiplication procedures, and relies to a greater extent on calculation skills and working memory resources. Importantly, the children were less accurate than the adults, but were well above chance level. In all age groups performance was enhanced when the reference number was smaller (vs. larger) than the exact answer and when it was far (vs. close) from it, suggesting the involvement of an approximate number system. The results suggest the existence of an intuitive sense of magnitude for the results of arithmetic problems that might help children and even adults with difficulties in math. The present findings are discussed in the context of past research reporting poor estimation skills among children, and the conditions that might allow using children estimation skills in an effective manner. PMID:27171224

  16. Mediaeval manuscript bindings

    Directory of Open Access Journals (Sweden)

    Jedert Vodopivec

    1999-01-01

    Full Text Available The present article represents an excerpt from the final chapters of the research study titled "The development of structures in mediaeval manuscript bindings - interdependence with conservatory methods". In it, aims, methods of work, archive and library materials used and directions for conservatory methods are presented. Besides, the research study includes also a historcial overview of book bindings, detailed analysis of separate structural elements in Slovenian mediaeval bindings, comprehensive presentation of separate structures, the techniques of binding and materials of the preserved mediaeval bindings in Slovenian public archives and libraries, terminological dictionary of specific professional terms related to binding as a segment of a book, and a catalogue of all analysed bindings, containing a survey of ajI detectable data, sketches,graphite prints and photographs.

  17. Conference on Abstract Spaces and Approximation

    CERN Document Server

    Szökefalvi-Nagy, B; Abstrakte Räume und Approximation; Abstract spaces and approximation

    1969-01-01

    The present conference took place at Oberwolfach, July 18-27, 1968, as a direct follow-up on a meeting on Approximation Theory [1] held there from August 4-10, 1963. The emphasis was on theoretical aspects of approximation, rather than the numerical side. Particular importance was placed on the related fields of functional analysis and operator theory. Thirty-nine papers were presented at the conference and one more was subsequently submitted in writing. All of these are included in these proceedings. In addition there is areport on new and unsolved problems based upon a special problem session and later communications from the partici­ pants. A special role is played by the survey papers also presented in full. They cover a broad range of topics, including invariant subspaces, scattering theory, Wiener-Hopf equations, interpolation theorems, contraction operators, approximation in Banach spaces, etc. The papers have been classified according to subject matter into five chapters, but it needs littl...

  18. Simultaneous perturbation stochastic approximation for tidal models

    KAUST Repository

    Altaf, M.U.

    2011-05-12

    The Dutch continental shelf model (DCSM) is a shallow sea model of entire continental shelf which is used operationally in the Netherlands to forecast the storm surges in the North Sea. The forecasts are necessary to support the decision of the timely closure of the moveable storm surge barriers to protect the land. In this study, an automated model calibration method, simultaneous perturbation stochastic approximation (SPSA) is implemented for tidal calibration of the DCSM. The method uses objective function evaluations to obtain the gradient approximations. The gradient approximation for the central difference method uses only two objective function evaluation independent of the number of parameters being optimized. The calibration parameter in this study is the model bathymetry. A number of calibration experiments is performed. The effectiveness of the algorithm is evaluated in terms of the accuracy of the final results as well as the computational costs required to produce these results. In doing so, comparison is made with a traditional steepest descent method and also with a newly developed proper orthogonal decompositionbased calibration method. The main findings are: (1) The SPSA method gives comparable results to steepest descent method with little computational cost. (2) The SPSA method with little computational cost can be used to estimate large number of parameters.

  19. An Origami Approximation to the Cosmic Web

    Science.gov (United States)

    Neyrinck, Mark C.

    2016-10-01

    The powerful Lagrangian view of structure formation was essentially introduced to cosmology by Zel'dovich. In the current cosmological paradigm, a dark-matter-sheet 3D manifold, inhabiting 6D position-velocity phase space, was flat (with vanishing velocity) at the big bang. Afterward, gravity stretched and bunched the sheet together in different places, forming a cosmic web when projected to the position coordinates. Here, I explain some properties of an origami approximation, in which the sheet does not stretch or contract (an assumption that is false in general), but is allowed to fold. Even without stretching, the sheet can form an idealized cosmic web, with convex polyhedral voids separated by straight walls and filaments, joined by convex polyhedral nodes. The nodes form in `polygonal' or `polyhedral' collapse, somewhat like spherical/ellipsoidal collapse, except incorporating simultaneous filament and wall formation. The origami approximation allows phase-space geometries of nodes, filaments, and walls to be more easily understood, and may aid in understanding spin correlations between nearby galaxies. This contribution explores kinematic origami-approximation models giving velocity fields for the first time.

  20. Ranking Support Vector Machine with Kernel Approximation.

    Science.gov (United States)

    Chen, Kai; Li, Rongchun; Dou, Yong; Liang, Zhengfa; Lv, Qi

    2017-01-01

    Learning to rank algorithm has become important in recent years due to its successful application in information retrieval, recommender system, and computational biology, and so forth. Ranking support vector machine (RankSVM) is one of the state-of-art ranking models and has been favorably used. Nonlinear RankSVM (RankSVM with nonlinear kernels) can give higher accuracy than linear RankSVM (RankSVM with a linear kernel) for complex nonlinear ranking problem. However, the learning methods for nonlinear RankSVM are still time-consuming because of the calculation of kernel matrix. In this paper, we propose a fast ranking algorithm based on kernel approximation to avoid computing the kernel matrix. We explore two types of kernel approximation methods, namely, the Nyström method and random Fourier features. Primal truncated Newton method is used to optimize the pairwise L2-loss (squared Hinge-loss) objective function of the ranking model after the nonlinear kernel approximation. Experimental results demonstrate that our proposed method gets a much faster training speed than kernel RankSVM and achieves comparable or better performance over state-of-the-art ranking algorithms.

  1. Fast algorithms for approximate circular string matching.

    Science.gov (United States)

    Barton, Carl; Iliopoulos, Costas S; Pissis, Solon P

    2014-03-22

    Circular string matching is a problem which naturally arises in many biological contexts. It consists in finding all occurrences of the rotations of a pattern of length m in a text of length n. There exist optimal average-case algorithms for exact circular string matching. Approximate circular string matching is a rather undeveloped area. In this article, we present a suboptimal average-case algorithm for exact circular string matching requiring time O(n). Based on our solution for the exact case, we present two fast average-case algorithms for approximate circular string matching with k-mismatches, under the Hamming distance model, requiring time O(n) for moderate values of k, that is k=O(m/logm). We show how the same results can be easily obtained under the edit distance model. The presented algorithms are also implemented as library functions. Experimental results demonstrate that the functions provided in this library accelerate the computations by more than three orders of magnitude compared to a naïve approach. We present two fast average-case algorithms for approximate circular string matching with k-mismatches; and show that they also perform very well in practice. The importance of our contribution is underlined by the fact that the provided functions may be seamlessly integrated into any biological pipeline. The source code of the library is freely available at http://www.inf.kcl.ac.uk/research/projects/asmf/.

  2. Hydrophobic binding properties of bovine gallbladder mucin.

    Science.gov (United States)

    Smith, B F; LaMont, J T

    1984-10-10

    Hydrophobic binding properties of purified bovine gallbladder mucin were studied by fluorescence spectroscopy using 1-anilino-8-naphthalene sulfonate (ANS) and N-phenyl-1-naphthylamine. The purified glycoprotein contained 75.5%, dry weight, as carbohydrate, 16.3% as protein, and 3.7% as sulfate; Mr = 2.2 X 10(6) was estimated by chromatography on Sephacryl S-500. Mucin contained a large number of low-affinity binding sites for these hydrophobic ligands. The dissociation constant, KD of mucin-ANS binding was 2.7 X 10(-5); each mucin molecule had approximately 42 binding sites for ANS. These binding sites were deduced to be on the unglycosylated portion of the protein core, as Pronase digestion completely eliminated binding. Reduction of mucin with 2-mercaptoethanol increased the fluorescence yield by formation of subunits with increased binding sites for the ligand. Increasing NaCl concentration (0.125 to 2.0 M) and decreasing pH (9 to 3) progressively increased fluorescence with the charged ligand ANS, suggesting that the binding site may have acidic groups which are shielded at high ionic strength or low pH. The fluorescent yield with N-phenyl-1-naphthylamine, an uncharged ligand, was an order of magnitude higher than with ANS. Bilirubin and bromosulfophthalein inhibited mucin-induced ANS fluorescence, but bile acids did not. Gallbladder mucin contains hydrophobic binding domains in the nonglycosylated peptide core that are involved in polymer formation and binding of biliary lipids and pigment.

  3. High-throughput binding analysis determines the binding specificity of ASF/SF2 on alternatively spliced human pre-mRNAs.

    Science.gov (United States)

    Chang, Brian; Levin, J; Thompson, William A; Fairbrother, William G

    2010-03-01

    High-throughput immunoprecipitation studies of transcription factors and splicing factors have revolutionized the fields of transcription and splicing. Recent location studies on Nova1/2 and Fox2 have identified a set of cellular targets of these splicing factors. One problem with identifying binding sites for splicing factors arises from the transient role of RNA in gene expression. The primary role of most splicing factors is to bind pre-mRNA co-transcriptionally and participate in the extremely rapid process of splice site selection and catalysis. Pre-mRNA is a labile species with a steady state level that is three orders of magnitude less abundant than mRNA. As many splicing factors also bind mRNA to some degree, these substrates tend to dominate the output of location studies. Here we present an in-vitro method for screening RNA protein interactions that circumvents these problems. We screen approximately 4000 alternatively spliced exons and the entire Hepatitis C genome for binding of ASF/SF2, the only splicing factor demonstrated to function as an oncogene. From the pre-mRNA sequences returned in this screen we discovered physiologically relevant ASF recognition element motifs. ASF binds two motifs: a C-rich and a purine rich motif. Comparisons with similar data derived from the hnRNP protein PTB reveals little overlap between strong PTB and ASF/SF2 sites. We illustrate how this method could be employed to screen disease alleles with the set of small molecules that have been shown to alter splicing in search for therapies for splicing diseases.

  4. Approximate number and approximate time discrimination each correlate with school math abilities in young children.

    Science.gov (United States)

    Odic, Darko; Lisboa, Juan Valle; Eisinger, Robert; Olivera, Magdalena Gonzalez; Maiche, Alejandro; Halberda, Justin

    2016-01-01

    What is the relationship between our intuitive sense of number (e.g., when estimating how many marbles are in a jar), and our intuitive sense of other quantities, including time (e.g., when estimating how long it has been since we last ate breakfast)? Recent work in cognitive, developmental, comparative psychology, and computational neuroscience has suggested that our representations of approximate number, time, and spatial extent are fundamentally linked and constitute a "generalized magnitude system". But, the shared behavioral and neural signatures between number, time, and space may alternatively be due to similar encoding and decision-making processes, rather than due to shared domain-general representations. In this study, we investigate the relationship between approximate number and time in a large sample of 6-8 year-old children in Uruguay by examining how individual differences in the precision of number and time estimation correlate with school mathematics performance. Over four testing days, each child completed an approximate number discrimination task, an approximate time discrimination task, a digit span task, and a large battery of symbolic math tests. We replicate previous reports showing that symbolic math abilities correlate with approximate number precision and extend those findings by showing that math abilities also correlate with approximate time precision. But, contrary to approximate number and time sharing common representations, we find that each of these dimensions uniquely correlates with formal math: approximate number correlates more strongly with formal math compared to time and continues to correlate with math even when precision in time and individual differences in working memory are controlled for. These results suggest that there are important differences in the mental representations of approximate number and approximate time and further clarify the relationship between quantity representations and mathematics. Copyright

  5. Photoelectron spectroscopy and the dipole approximation

    Energy Technology Data Exchange (ETDEWEB)

    Hemmers, O.; Hansen, D.L.; Wang, H. [Univ. of Nevada, Las Vegas, NV (United States)] [and others

    1997-04-01

    Photoelectron spectroscopy is a powerful technique because it directly probes, via the measurement of photoelectron kinetic energies, orbital and band structure in valence and core levels in a wide variety of samples. The technique becomes even more powerful when it is performed in an angle-resolved mode, where photoelectrons are distinguished not only by their kinetic energy, but by their direction of emission as well. Determining the probability of electron ejection as a function of angle probes the different quantum-mechanical channels available to a photoemission process, because it is sensitive to phase differences among the channels. As a result, angle-resolved photoemission has been used successfully for many years to provide stringent tests of the understanding of basic physical processes underlying gas-phase and solid-state interactions with radiation. One mainstay in the application of angle-resolved photoelectron spectroscopy is the well-known electric-dipole approximation for photon interactions. In this simplification, all higher-order terms, such as those due to electric-quadrupole and magnetic-dipole interactions, are neglected. As the photon energy increases, however, effects beyond the dipole approximation become important. To best determine the range of validity of the dipole approximation, photoemission measurements on a simple atomic system, neon, where extra-atomic effects cannot play a role, were performed at BL 8.0. The measurements show that deviations from {open_quotes}dipole{close_quotes} expectations in angle-resolved valence photoemission are observable for photon energies down to at least 0.25 keV, and are quite significant at energies around 1 keV. From these results, it is clear that non-dipole angular-distribution effects may need to be considered in any application of angle-resolved photoelectron spectroscopy that uses x-ray photons of energies as low as a few hundred eV.

  6. Spin-fluctuation theory beyond Gaussian approximation

    Energy Technology Data Exchange (ETDEWEB)

    Melnikov, N B [Moscow State University, 119992 Moscow (Russian Federation); Reser, B I; Grebennikov, V I, E-mail: melnikov@cs.msu.s, E-mail: reser@imp.uran.r, E-mail: greben@imp.uran.r [Institute of Metal Physics, Ural Branch of the Russian Academy of Sciences, 620041 Ekaterinburg (Russian Federation)

    2010-05-14

    A characteristic feature of the Gaussian approximation in the functional-integral approach to the spin-fluctuation theory is the jump phase transition to the paramagnetic state. We eliminate the jump and obtain a continuous second-order phase transition by taking into account high-order terms in the expansion of the free energy in powers of the fluctuating exchange field. The third-order term of the free energy renormalizes the mean field, and the fourth-order term, responsible for the interaction of the fluctuations, renormalizes the spin susceptibility. The extended theory is applied to the calculation of magnetic properties of Fe-Ni Invar.

  7. Turbo Equalization Using Partial Gaussian Approximation

    DEFF Research Database (Denmark)

    Zhang, Chuanzong; Wang, Zhongyong; Manchón, Carles Navarro

    2016-01-01

    This letter deals with turbo equalization for coded data transmission over intersymbol interference (ISI) channels. We propose a message-passing algorithm that uses the expectation propagation rule to convert messages passed from the demodulator and decoder to the equalizer and computes messages...... returned by the equalizer by using a partial Gaussian approximation (PGA). We exploit the specific structure of the ISI channel model to compute the latter messages from the beliefs obtained using a Kalman smoother/equalizer. Doing so leads to a significant complexity reduction compared to the initial PGA...

  8. Subset Selection by Local Convex Approximation

    DEFF Research Database (Denmark)

    Øjelund, Henrik; Sadegh, Payman; Madsen, Henrik

    1999-01-01

    least squares criterion. We propose an optimization technique for the posed probelm based on a modified version of the Newton-Raphson iterations, combined with a backward elimination type algorithm. THe Newton-Raphson modification concerns iterative approximations to the non-convex cost function......This paper concerns selection of the optimal subset of variables in a lenear regression setting. The posed problem is combinatiorial and the globally best subset can only be found in exponential time. We define a cost function for the subset selection problem by adding the penalty term to the usual...

  9. An Approximate Algorithm for Robust Adaptive Beamforming

    Science.gov (United States)

    Yoshida, Tomoaki; Iiguni, Youji

    2004-12-01

    This paper presents an adaptive weight computation algorithm for a robust array antenna based on the sample matrix inversion technique. The adaptive array minimizes the mean output power under the constraint that the mean square deviation between the desired and actual responses satisfies a certain magnitude bound. The Lagrange multiplier method is used to solve the constrained minimization problem. An efficient and accurate approximation is then used to derive the fast and recursive computation algorithm. Several simulation results are presented to support the effectiveness of the proposed adaptive computation algorithm.

  10. Approximate solution for Fokker-Planck equation

    Directory of Open Access Journals (Sweden)

    M.T. Araujo

    2015-12-01

    Full Text Available In this paper, an approximate solution to a specific class of the Fokker-Planck equation is proposed. The solution is based on the relationship between the Schrödinger type equation with a partially confining and symmetrical potential. To estimate the accuracy of the solution, a function error obtained from the original Fokker-Planck equation is suggested. Two examples, a truncated harmonic potential and non-harmonic polynomial, are analyzed using the proposed method. For the truncated harmonic potential, the system behavior as a function of temperature is also discussed.

  11. Decoupling with unitary approximate two-designs

    DEFF Research Database (Denmark)

    Szehr, Oleg; Dupont-Dupuis, Fréderic; Tomamichel, Marco

    2013-01-01

    to this question is provided by decoupling theorems, which have been developed recently in the area of quantum information theory. This paper builds on preceding work, which shows that decoupling is achieved if the evolution on A consists of a typical unitary, chosen with respect to the Haar measure, followed......-body interactions, which can be modeled as efficient circuits. Our decoupling result is independent of the dimension of the R system, which shows that approximate two-designs are appropriate for decoupling even if the dimension of this system is large....

  12. Topics in multivariate approximation and interpolation

    CERN Document Server

    Jetter, Kurt

    2005-01-01

    This book is a collection of eleven articles, written by leading experts and dealing with special topics in Multivariate Approximation and Interpolation. The material discussed here has far-reaching applications in many areas of Applied Mathematics, such as in Computer Aided Geometric Design, in Mathematical Modelling, in Signal and Image Processing and in Machine Learning, to mention a few. The book aims at giving a comprehensive information leading the reader from the fundamental notions and results of each field to the forefront of research. It is an ideal and up-to-date introduction for gr

  13. Approximate Circuits in Low-Power Image and Video Processing: The Approximate Median Filter

    Directory of Open Access Journals (Sweden)

    L. Sekanina

    2017-09-01

    Full Text Available Low power image and video processing circuits are crucial in many applications of computer vision. Traditional techniques used to reduce power consumption in these applications have recently been accompanied by circuit approximation methods which exploit the fact that these applications are highly error resilient and, hence, the quality of image processing can be traded for power consumption. On the basis of a literature survey, we identified the components whose implementations are the most frequently approximated and the methods used for obtaining these approximations. One of the components is the median image filter. We propose, evaluate and compare two approximation strategies based on Cartesian genetic programming applied to approximate various common implementations of the median filter. For filters developed using these approximation strategies, trade-offs between the quality of filtering and power consumption are investigated. Under conditions of our experiments we conclude that better trade-offs are achieved when the image filter is evolved from scratch rather than a conventional filter is approximated.

  14. Function approximation using adaptive and overlapping intervals

    Energy Technology Data Exchange (ETDEWEB)

    Patil, R.B.

    1995-05-01

    A problem common to many disciplines is to approximate a function given only the values of the function at various points in input variable space. A method is proposed for approximating a function of several to one variable. The model takes the form of weighted averaging of overlapping basis functions defined over intervals. The number of such basis functions and their parameters (widths and centers) are automatically determined using given training data and a learning algorithm. The proposed algorithm can be seen as placing a nonuniform multidimensional grid in the input domain with overlapping cells. The non-uniformity and overlap of the cells is achieved by a learning algorithm to optimize a given objective function. This approach is motivated by the fuzzy modeling approach and a learning algorithms used for clustering and classification in pattern recognition. The basics of why and how the approach works are given. Few examples of nonlinear regression and classification are modeled. The relationship between the proposed technique, radial basis neural networks, kernel regression, probabilistic neural networks, and fuzzy modeling is explained. Finally advantages and disadvantages are discussed.

  15. Nonlinear higher quasiparticle random phase approximation

    Science.gov (United States)

    Smetana, Adam; Šimkovic, Fedor; Štefánik, Dušan; Krivoruchenko, Mikhail

    2017-10-01

    We develop a new approach to describe nuclear states of multiphonon origin, motivated by the necessity for a more accurate description of matrix elements of neutrinoless double-beta decay. Our approach is an extension of the Quasiparticle Random Phase Approximation (QRPA), in which nonlinear phonon operators play an essential role. Before applying the nonlinear higher QRPA (nhQRPA) to realistic problems, we test its efficiency with exactly solvable models. The first considered model is equivalent to a harmonic oscillator. The nhQRPA solutions follow from the standard QRPA equation, but for nonlinear phonon operators defined for each individual excited state separately. The second exactly solvable model is the proton-neutron Lipkin model that describes successfully not only energy spectrum of nuclei, but also beta-decay transitions. Again, we reproduce exactly the numerical solutions in the nhQRPA framework. We show in particular that truncation of the nonlinear phonon operators leads to an approximation similar to the self-consistent second QRPA, given the phonon operators are defined with a constant term. The test results demonstrate that the proposed nhQRPA is a promising tool for a realistic calculation of energy spectra and nuclear transitions.

  16. Regularity and approximability of electronic wave functions

    CERN Document Server

    Yserentant, Harry

    2010-01-01

    The electronic Schrödinger equation describes the motion of N-electrons under Coulomb interaction forces in a field of clamped nuclei. The solutions of this equation, the electronic wave functions, depend on 3N variables, with three spatial dimensions for each electron. Approximating these solutions is thus inordinately challenging, and it is generally believed that a reduction to simplified models, such as those of the Hartree-Fock method or density functional theory, is the only tenable approach. This book seeks to show readers that this conventional wisdom need not be ironclad: the regularity of the solutions, which increases with the number of electrons, the decay behavior of their mixed derivatives, and the antisymmetry enforced by the Pauli principle contribute properties that allow these functions to be approximated with an order of complexity which comes arbitrarily close to that for a system of one or two electrons. The text is accessible to a mathematical audience at the beginning graduate level as...

  17. APPROXIMATING INNOVATION POTENTIAL WITH NEUROFUZZY ROBUST MODEL

    Directory of Open Access Journals (Sweden)

    Kasa, Richard

    2015-01-01

    Full Text Available In a remarkably short time, economic globalisation has changed the world’s economic order, bringing new challenges and opportunities to SMEs. These processes pushed the need to measure innovation capability, which has become a crucial issue for today’s economic and political decision makers. Companies cannot compete in this new environment unless they become more innovative and respond more effectively to consumers’ needs and preferences – as mentioned in the EU’s innovation strategy. Decision makers cannot make accurate and efficient decisions without knowing the capability for innovation of companies in a sector or a region. This need is forcing economists to develop an integrated, unified and complete method of measuring, approximating and even forecasting the innovation performance not only on a macro but also a micro level. In this recent article a critical analysis of the literature on innovation potential approximation and prediction is given, showing their weaknesses and a possible alternative that eliminates the limitations and disadvantages of classical measuring and predictive methods.

  18. Binding energies of hypernuclei and hypernuclear interactions

    Energy Technology Data Exchange (ETDEWEB)

    Bodmer, A.R. [Argonne National Lab., IL (United States)]|[Univ. of Illinois, Chicago, IL (United States). Dept. of Physics; Murali, S.; Usmani, Q.N. [Jamia Millia Islamia, New Delhi (India). Dept. of Physics

    1996-05-01

    In part 1 the effect of nuclear core dynamics on the binding energies of {Lambda} hypernuclei is discussed in the framework of variational correlated wave functions. In particular, the authors discuss a new rearrangement energy contribution and its effect on the core polarization. In part 2 they consider the interpretation of the {Lambda} single-particle energy in terms of basic {Lambda}-nuclear interactions using a local density approximation based on a Fermi hypernetted chain calculation of the A binding to nuclear matter. To account for the data strongly repulsive 3-body {Lambda}NN forces are required. Also in this framework they discuss core polarization for medium and heavier hypernuclei.

  19. Evolving nucleotide binding surfaces

    Science.gov (United States)

    Kieber-Emmons, T.; Rein, R.

    1981-01-01

    An analysis is presented of the stability and nature of binding of a nucleotide to several known dehydrogenases. The employed approach includes calculation of hydrophobic stabilization of the binding motif and its intermolecular interaction with the ligand. The evolutionary changes of the binding motif are studied by calculating the Euclidean deviation of the respective dehydrogenases. Attention is given to the possible structural elements involved in the origin of nucleotide recognition by non-coded primordial polypeptides.

  20. Acoustic approximations of elastic media with fast variations

    Science.gov (United States)

    Cance, P.; Capdeville, Y.

    2013-12-01

    Imaging the Earth using seismic waveforms is an intensive computational problem. Reducing numerical cost of the forward problem is therefore an important objective. At the exploration seismic imaging scale, a common practical method relies on using only P-waves information. In such case, an acoustic approximation of the elastic forward problem is often used, which reduces drastically the numerical cost, not only because the problem is smaller but mainly because the expense of correctly sampling slow S-waves is not present anymore. If this approximation is valid for slowly varying isotropic media, this is not the case in general. The present work focuses on acoustic approaches of heterogeneous elastic media with heterogeneity sizes much smaller than the propagating wavelength as well as acoustic anisotropy. A useful tool to study those rapidly varying heterogeneous media is the non periodic homogenization for waves (Capdeville et al. 2009;2010). This homogenization procedure has been adapted and applied to acoustic media. While upscaling the elastic wave equation induces elastic apparent anisotropy, we show that in the acoustic case, it is the density that becomes anisotropic. Unfortunately the induced anisotropy is not of the same nature between elastic cases and acoustic cases (in the acoustic case it proves to remain only an elliptic anisotropy) which prevent to use acoustic anisotropy to mimic elastic anisotropy. If building the acoustic media from the elastic one is obvious for slowly varying isotropic media, it is not the case anymore for rapidly varying media nor for anisotropic media. To check if these difficulties can be overcome and if at least P-waves first arrivals can be correctly reproduced we propose here two methods for building the acoustic media from the elastic one. We will refer to the first method as the 'physical method' as it tends to keep track of the physical parameters of the original medium, and to the second method as the 'mathematical

  1. When telegrapher's equation furnishes a better approximation to transport equation than the difussion approximation

    OpenAIRE

    Porrà i Rovira, Josep Maria; Masoliver, Jaume, 1951-; Weiss, George H. (George Herbert), 1930-

    1997-01-01

    It has been suggested that a solution to the transport equation which includes anisotropic scattering can be approximated by the solution to a telegrapher's equation [A.J. Ishimaru, Appl. Opt. 28, 2210 (1989)]. We show that in one dimension the telegrapher's equation furnishes an exact solution to the transport equation. In two dimensions, we show that, since the solution can become negative, the telegrapher's equation will not furnish a usable approximation. A comparison between simulated da...

  2. Approximating stochastic biochemical processes with Wasserstein pseudometrics.

    Science.gov (United States)

    Thorsley, D; Klavins, E

    2010-05-01

    Modelling stochastic processes inside the cell is difficult due to the size and complexity of the processes being investigated. As a result, new approaches are needed to address the problems of model reduction, parameter estimation, model comparison and model invalidation. Here, the authors propose addressing these problems by using Wasserstein pseudometrics to quantify the differences between processes. The method the authors propose is applicable to any bounded continuous-time stochastic process and pseudometrics between processes are defined only in terms of the available outputs. Algorithms for approximating Wasserstein pseudometrics are developed from experimental or simulation data and demonstrate how to optimise parameter values to minimise the pseudometrics. The approach is illustrated with studies of a stochastic toggle switch and of stochastic gene expression in E. coli.

  3. Polarized constituent quarks in NLO approximation

    Energy Technology Data Exchange (ETDEWEB)

    Khorramian, Ali N. [Physics Department, Semnan University, Semnan, Iran and Institute for Studies in Theoretical Physics and Mathematics , P.O.Box 19395-5531, Tehran (Iran, Islamic Republic of); Tehrani, S. Atashbar [Physics Department, Persian Gulf University, Boushehr, Iran and Institute for Studies in Theoretical Physics and Mathematics , P.O.Box 19395-5531, Tehran (Iran, Islamic Republic of); Mirjalili, A. [Physics Department, Persian Gulf University, Boushehr, Iran and Institute for Studies in Theoretical Physics and Mathematics , P.O.Box 19395-5531, Tehran (Iran, Islamic Republic of)

    2006-02-15

    The valon representation provides a basis between hadrons and quarks, in terms of which the bound-state and scattering properties of hadrons can be united and described. We studied polarized valon distributions which have an important role in describing the spin dependence of parton distribution in leading and next-to-leading order approximation. Convolution integral in frame work of valon model as a useful tool, was used in polarized case. To obtain polarized parton distributions in a proton we need to polarized valon distribution in a proton and polarized parton distributions inside the valon. We employed Bernstein polynomial averages to get unknown parameters of polarized valon distributions by fitting to available experimental data.

  4. Animal models and integrated nested Laplace approximations.

    Science.gov (United States)

    Holand, Anna Marie; Steinsland, Ingelin; Martino, Sara; Jensen, Henrik

    2013-08-07

    Animal models are generalized linear mixed models used in evolutionary biology and animal breeding to identify the genetic part of traits. Integrated Nested Laplace Approximation (INLA) is a methodology for making fast, nonsampling-based Bayesian inference for hierarchical Gaussian Markov models. In this article, we demonstrate that the INLA methodology can be used for many versions of Bayesian animal models. We analyze animal models for both synthetic case studies and house sparrow (Passer domesticus) population case studies with Gaussian, binomial, and Poisson likelihoods using INLA. Inference results are compared with results using Markov Chain Monte Carlo methods. For model choice we use difference in deviance information criteria (DIC). We suggest and show how to evaluate differences in DIC by comparing them with sampling results from simulation studies. We also introduce an R package, AnimalINLA, for easy and fast inference for Bayesian Animal models using INLA.

  5. Lagrangian Markovianized Field Approximation for turbulence

    CERN Document Server

    Bos, Wouter

    2013-01-01

    In a previous communication (W.J.T. Bos and J.-P. Bertoglio 2006, Phys. Fluids, 18, 031706), a self-consistent Markovian triadic closure was presented. The detailed derivation of this closure is given here, relating it to the Direct Interaction Approximation and Quasi-Normal types of closure. The time-scale needed to obtain a self-consistent closure for both the energy spectrum and the scalar variance spectrum is determined by evaluating the correlation between the velocity and an advected displacement vector-field. The relation between this latter correlation and the velocity-scalar correlation is stressed, suggesting a simplified model of the latter. The resulting closed equations are numerically integrated and results for the energy spectrum, scalar fluctuation spectrum and velocity-displacement correlation spectrum are presented for low, unity and high values of the Schmidt number.

  6. Approximate Bayesian computation with functional statistics.

    Science.gov (United States)

    Soubeyrand, Samuel; Carpentier, Florence; Guiton, François; Klein, Etienne K

    2013-03-26

    Functional statistics are commonly used to characterize spatial patterns in general and spatial genetic structures in population genetics in particular. Such functional statistics also enable the estimation of parameters of spatially explicit (and genetic) models. Recently, Approximate Bayesian Computation (ABC) has been proposed to estimate model parameters from functional statistics. However, applying ABC with functional statistics may be cumbersome because of the high dimension of the set of statistics and the dependences among them. To tackle this difficulty, we propose an ABC procedure which relies on an optimized weighted distance between observed and simulated functional statistics. We applied this procedure to a simple step model, a spatial point process characterized by its pair correlation function and a pollen dispersal model characterized by genetic differentiation as a function of distance. These applications showed how the optimized weighted distance improved estimation accuracy. In the discussion, we consider the application of the proposed ABC procedure to functional statistics characterizing non-spatial processes.

  7. Adaptive Control with Approximated Policy Search Approach

    Directory of Open Access Journals (Sweden)

    Agus Naba

    2010-05-01

    Full Text Available Most of existing adaptive control schemes are designed to minimize error between plant state and goal state despite the fact that executing actions that are predicted to result in smaller errors only can mislead to non-goal states. We develop an adaptive control scheme that involves manipulating a controller of a general type to improve its performance as measured by an evaluation function. The developed method is closely related to a theory of Reinforcement Learning (RL but imposes a practical assumption made for faster learning. We assume that a value function of RL can be approximated by a function of Euclidean distance from a goal state and an action executed at the state. And, we propose to use it for the gradient search as an evaluation function. Simulation results provided through application of the proposed scheme to a pole-balancing problem using a linear state feedback controller and fuzzy controller verify the scheme’s efficacy.

  8. Intelligent comparisons II inequalities and approximations

    CERN Document Server

    Anastassiou, George A

    2017-01-01

    This compact book focuses on self-adjoint operators’ well-known named inequalities and Korovkin approximation theory, both in a Hilbert space environment. It is the first book to study these aspects, and all chapters are self-contained and can be read independently. Further, each chapter includes an extensive list of references for further reading. The book’s results are expected to find applications in many areas of pure and applied mathematics. Given its concise format, it is especially suitable for use in related graduate classes and research projects. As such, the book offers a valuable resource for researchers and graduate students alike, as well as a key addition to all science and engineering libraries.

  9. Entropy Approximation in Lossy Source Coding Problem

    Directory of Open Access Journals (Sweden)

    Marek Śmieja

    2015-05-01

    Full Text Available In this paper, we investigate a lossy source coding problem, where an upper limit on the permitted distortion is defined for every dataset element. It can be seen as an alternative approach to rate distortion theory where a bound on the allowed average error is specified. In order to find the entropy, which gives a statistical length of source code compatible with a fixed distortion bound, a corresponding optimization problem has to be solved. First, we show how to simplify this general optimization by reducing the number of coding partitions, which are irrelevant for the entropy calculation. In our main result, we present a fast and feasible for implementation greedy algorithm, which allows one to approximate the entropy within an additive error term of log2 e. The proof is based on the minimum entropy set cover problem, for which a similar bound was obtained.

  10. Capacity Approximations for a Deterministic MIMO Channel

    Directory of Open Access Journals (Sweden)

    MOSKOWITZ, I. S.

    2011-08-01

    Full Text Available In this paper, we derive closed form approximations for the capacity of a point-to-point, deterministic Gaussian MIMO communication channel. We focus on the behavior of the inverse eigenvalues of the Gram matrix associated with the gain matrix of the MIMO channel, by considering small variance and large power assumptions. We revisit the concept of deterministic MIMO capacity by pointing out that, under transmitter power constraint, the optimal transmit covariance matrix is not necessarily diagonal. We discuss the water filling algorithm for obtaining the optimal eigenvalues of the transmitter covariance matrix, and the water fill level in conjunction with the Karush-Kuhn-Tucker optimality conditions. We revise the Telatar conjecture for the capacity of a non-ergodic channel. We also provide deterministic examples and numerical simulations of the capacity, which are discussed in terms of our mathematical framework.

  11. Approximate analytical modeling of leptospirosis infection

    Science.gov (United States)

    Ismail, Nur Atikah; Azmi, Amirah; Yusof, Fauzi Mohamed; Ismail, Ahmad Izani

    2017-11-01

    Leptospirosis is an infectious disease carried by rodents which can cause death in humans. The disease spreads directly through contact with feces, urine or through bites of infected rodents and indirectly via water contaminated with urine and droppings from them. Significant increase in the number of leptospirosis cases in Malaysia caused by the recent severe floods were recorded during heavy rainfall season. Therefore, to understand the dynamics of leptospirosis infection, a mathematical model based on fractional differential equations have been developed and analyzed. In this paper an approximate analytical method, the multi-step Laplace Adomian decomposition method, has been used to conduct numerical simulations so as to gain insight on the spread of leptospirosis infection.

  12. Topology Reduction for Approximate Symbolic Analysis

    Directory of Open Access Journals (Sweden)

    Z. Kolka

    2011-04-01

    Full Text Available The paper deals with a procedure for approximate symbolic analysis of linear circuits based on simplifying the circuit model. The procedure consists of two main steps. First, network elements whose influence on the circuit function is negligible are completely removed, i.e. their parameters are removed from the resulting symbolic formula. The second step consists in modifying the voltage and current graphs in order to decrease the number of common spanning trees. The influence of each modification of the circuit model is ranked numerically. A fast method based on the use of cofactors is presented. It allows evaluating all the prospective simplifications using at most two matrix inversions per one frequency point.

  13. PROX: Approximated Summarization of Data Provenance.

    Science.gov (United States)

    Ainy, Eleanor; Bourhis, Pierre; Davidson, Susan B; Deutch, Daniel; Milo, Tova

    2016-03-01

    Many modern applications involve collecting large amounts of data from multiple sources, and then aggregating and manipulating it in intricate ways. The complexity of such applications, combined with the size of the collected data, makes it difficult to understand the application logic and how information was derived. Data provenance has been proven helpful in this respect in different contexts; however, maintaining and presenting the full and exact provenance may be infeasible, due to its size and complex structure. For that reason, we introduce the notion of approximated summarized provenance, where we seek a compact representation of the provenance at the possible cost of information loss. Based on this notion, we have developed PROX, a system for the management, presentation and use of data provenance for complex applications. We propose to demonstrate PROX in the context of a movies rating crowd-sourcing system, letting participants view provenance summarization and use it to gain insights on the application and its underlying data.

  14. Approximation by max-product type operators

    CERN Document Server

    Bede, Barnabás; Gal, Sorin G

    2016-01-01

    This monograph presents a broad treatment of developments in an area of constructive approximation involving the so-called "max-product" type operators. The exposition highlights the max-product operators as those which allow one to obtain, in many cases, more valuable estimates than those obtained by classical approaches. The text considers a wide variety of operators which are studied for a number of interesting problems such as quantitative estimates, convergence, saturation results, localization, to name several. Additionally, the book discusses the perfect analogies between the probabilistic approaches of the classical Bernstein type operators and of the classical convolution operators (non-periodic and periodic cases), and the possibilistic approaches of the max-product variants of these operators. These approaches allow for two natural interpretations of the max-product Bernstein type operators and convolution type operators: firstly, as possibilistic expectations of some fuzzy variables, and secondly,...

  15. DNS BIND Server Configuration

    Directory of Open Access Journals (Sweden)

    Radu MARSANU

    2011-01-01

    Full Text Available After a brief presentation of the DNS and BIND standard for Unix platforms, the paper presents an application which has a principal objective, the configuring of the DNS BIND 9 server. The general objectives of the application are presented, follow by the description of the details of designing the program.

  16. Melanin-binding radiopharmaceuticals

    Energy Technology Data Exchange (ETDEWEB)

    Packer, S; Fairchild, R G; Watts, K P; Greenberg, D; Hannon, S J

    1980-01-01

    The scope of this paper is limited to an analysis of the factors that are important to the relationship of radiopharmaceuticals to melanin. While the authors do not attempt to deal with differences between melanin-binding vs. melanoma-binding, a notable variance is assumed. (PSB)

  17. Rapid response systems in The Netherlands

    NARCIS (Netherlands)

    Ludikhuize, Jeroen; Hamming, Annette; de Jonge, Evert; Fikkers, Bernard G.

    2011-01-01

    Sixty-three (approximately 80%) of the 81 hospitals that responded to a survey sent to all hospitals in The Netherlands with nonpediatric intensive care units had a rapid response system (RRS) in place or were in the final process of starting one. Among many other findings regarding RRS

  18. Explicit symplectic approximation of nonseparable Hamiltonians: algorithm and long time performance

    OpenAIRE

    Tao, Molei

    2016-01-01

    Explicit symplectic integrators have been important tools for accurate and efficient approximations of mechanical systems with separable Hamiltonians. For the first time, the article proposes for arbitrary Hamiltonians similar integrators, which are explicit, of any even order, symplectic in an extended phase space, and with pleasant long time properties. They are based on a mechanical restraint that binds two copies of phase space together. Using backward error analysis, KAM theory, and addi...

  19. Configuring Airspace Sectors with Approximate Dynamic Programming

    Science.gov (United States)

    Bloem, Michael; Gupta, Pramod

    2010-01-01

    In response to changing traffic and staffing conditions, supervisors dynamically configure airspace sectors by assigning them to control positions. A finite horizon airspace sector configuration problem models this supervisor decision. The problem is to select an airspace configuration at each time step while considering a workload cost, a reconfiguration cost, and a constraint on the number of control positions at each time step. Three algorithms for this problem are proposed and evaluated: a myopic heuristic, an exact dynamic programming algorithm, and a rollouts approximate dynamic programming algorithm. On problem instances from current operations with only dozens of possible configurations, an exact dynamic programming solution gives the optimal cost value. The rollouts algorithm achieves costs within 2% of optimal for these instances, on average. For larger problem instances that are representative of future operations and have thousands of possible configurations, excessive computation time prohibits the use of exact dynamic programming. On such problem instances, the rollouts algorithm reduces the cost achieved by the heuristic by more than 15% on average with an acceptable computation time.

  20. Planetary Ices and the Linear Mixing Approximation

    Science.gov (United States)

    Bethkenhagen, M.; Meyer, E. R.; Hamel, S.; Nettelmann, N.; French, M.; Scheibe, L.; Ticknor, C.; Collins, L. A.; Kress, J. D.; Fortney, J. J.; Redmer, R.

    2017-10-01

    The validity of the widely used linear mixing approximation (LMA) for the equations of state (EOSs) of planetary ices is investigated at pressure-temperature conditions typical for the interiors of Uranus and Neptune. The basis of this study is ab initio data ranging up to 1000 GPa and 20,000 K, calculated via density functional theory molecular dynamics simulations. In particular, we determine a new EOS for methane and EOS data for the 1:1 binary mixtures of methane, ammonia, and water, as well as their 2:1:4 ternary mixture. Additionally, the self-diffusion coefficients in the ternary mixture are calculated along three different Uranus interior profiles and compared to the values of the pure compounds. We find that deviations of the LMA from the results of the real mixture are generally small; for the thermal EOSs they amount to 4% or less. The diffusion coefficients in the mixture agree with those of the pure compounds within 20% or better. Finally, a new adiabatic model of Uranus with an inner layer of almost pure ices is developed. The model is consistent with the gravity field data and results in a rather cold interior ({T}{core}˜ 4000 K).

  1. Adaptive approximation of higher order posterior statistics

    KAUST Repository

    Lee, Wonjung

    2014-02-01

    Filtering is an approach for incorporating observed data into time-evolving systems. Instead of a family of Dirac delta masses that is widely used in Monte Carlo methods, we here use the Wiener chaos expansion for the parametrization of the conditioned probability distribution to solve the nonlinear filtering problem. The Wiener chaos expansion is not the best method for uncertainty propagation without observations. Nevertheless, the projection of the system variables in a fixed polynomial basis spanning the probability space might be a competitive representation in the presence of relatively frequent observations because the Wiener chaos approach not only leads to an accurate and efficient prediction for short time uncertainty quantification, but it also allows to apply several data assimilation methods that can be used to yield a better approximate filtering solution. The aim of the present paper is to investigate this hypothesis. We answer in the affirmative for the (stochastic) Lorenz-63 system based on numerical simulations in which the uncertainty quantification method and the data assimilation method are adaptively selected by whether the dynamics is driven by Brownian motion and the near-Gaussianity of the measure to be updated, respectively. © 2013 Elsevier Inc.

  2. Multilayer Perceptrons to Approximate Quaternion Valued Functions.

    Science.gov (United States)

    Xibilia, M G.; Muscato, G; Fortuna, L; Arena, P

    1997-03-01

    In this paper a new type of multilayer feedforward neural network is introduced. Such a structure, called hypercomplex multilayer perceptron (HMLP), is developed in quaternion algebra and allows quaternionic input and output signals to be dealt with, requiring a lower number of neurons than the real MLP, thus providing a reduced computational complexity. The structure introduced represents a generalization of the multilayer perceptron in the complex space (CMLP) reported in the literature. The fundamental result reported in the paper is a new density theorem which makes HMLPs universal interpolators of quaternion valued continuous functions. Moreover the proof of the density theorem can be restricted in order to formulate a density theorem in the complex space. Due to the identity between the quaternion and the four-dimensional real space, such a structure is also useful to approximate multidimensional real valued functions with a lower number of real parameters, decreasing the probability of being trapped in local minima during the learning phase. A numerical example is also reported in order to show the efficiency of the proposed structure. Copyright 1997 Elsevier Science Ltd. All Rights Reserved.

  3. Network histograms and universality of blockmodel approximation.

    Science.gov (United States)

    Olhede, Sofia C; Wolfe, Patrick J

    2014-10-14

    In this paper we introduce the network histogram, a statistical summary of network interactions to be used as a tool for exploratory data analysis. A network histogram is obtained by fitting a stochastic blockmodel to a single observation of a network dataset. Blocks of edges play the role of histogram bins and community sizes that of histogram bandwidths or bin sizes. Just as standard histograms allow for varying bandwidths, different blockmodel estimates can all be considered valid representations of an underlying probability model, subject to bandwidth constraints. Here we provide methods for automatic bandwidth selection, by which the network histogram approximates the generating mechanism that gives rise to exchangeable random graphs. This makes the blockmodel a universal network representation for unlabeled graphs. With this insight, we discuss the interpretation of network communities in light of the fact that many different community assignments can all give an equally valid representation of such a network. To demonstrate the fidelity-versus-interpretability tradeoff inherent in considering different numbers and sizes of communities, we analyze two publicly available networks--political weblogs and student friendships--and discuss how to interpret the network histogram when additional information related to node and edge labeling is present.

  4. Improved Discrete Approximation of Laplacian of Gaussian

    Science.gov (United States)

    Shuler, Robert L., Jr.

    2004-01-01

    An improved method of computing a discrete approximation of the Laplacian of a Gaussian convolution of an image has been devised. The primary advantage of the method is that without substantially degrading the accuracy of the end result, it reduces the amount of information that must be processed and thus reduces the amount of circuitry needed to perform the Laplacian-of- Gaussian (LOG) operation. Some background information is necessary to place the method in context. The method is intended for application to the LOG part of a process of real-time digital filtering of digitized video data that represent brightnesses in pixels in a square array. The particular filtering process of interest is one that converts pixel brightnesses to binary form, thereby reducing the amount of information that must be performed in subsequent correlation processing (e.g., correlations between images in a stereoscopic pair for determining distances or correlations between successive frames of the same image for detecting motions). The Laplacian is often included in the filtering process because it emphasizes edges and textures, while the Gaussian is often included because it smooths out noise that might not be consistent between left and right images or between successive frames of the same image.

  5. Semiclassical approximations based on complex trajectories.

    Science.gov (United States)

    Ribeiro, A D; de Aguiar, M A M; Baranger, M

    2004-06-01

    The semiclassical limit of the coherent state propagator involves complex classical trajectories of the Hamiltonian H(u,v) = satisfying u(0) = z' and v(T) = z"*. In this work we study mostly the case z' = z". The propagator is then the return probability amplitude of a wave packet. We show that a plot of the exact return probability brings out the quantal images of the classical periodic orbits. Then we compare the exact return probability with its semiclassical approximation for a soft chaotic system with two degrees of freedom. We find two situations where classical trajectories satisfying the correct boundary conditions must be excluded from the semiclassical formula. The first occurs when the contribution of the trajectory to the propagator becomes exponentially large as Planck's over 2 pi goes to zero. The second occurs when the contributing trajectories undergo bifurcations. Close to the bifurcation the semiclassical formula diverges. More interestingly, in the example studied, after the bifurcation, where more than one trajectory satisfying the boundary conditions exist, only one of them in fact contributes to the semiclassical formula, a phenomenon closely related to Stokes lines. When the contributions of these trajectories are filtered out, the semiclassical results show excellent agreement with the exact calculations.

  6. Approximate Model for Turbulent Stagnation Point Flow.

    Energy Technology Data Exchange (ETDEWEB)

    Dechant, Lawrence [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)

    2016-01-01

    Here we derive an approximate turbulent self-similar model for a class of favorable pressure gradient wedge-like flows, focusing on the stagnation point limit. While the self-similar model provides a useful gross flow field estimate this approach must be combined with a near wall model is to determine skin friction and by Reynolds analogy the heat transfer coefficient. The combined approach is developed in detail for the stagnation point flow problem where turbulent skin friction and Nusselt number results are obtained. Comparison to the classical Van Driest (1958) result suggests overall reasonable agreement. Though the model is only valid near the stagnation region of cylinders and spheres it nonetheless provides a reasonable model for overall cylinder and sphere heat transfer. The enhancement effect of free stream turbulence upon the laminar flow is used to derive a similar expression which is valid for turbulent flow. Examination of free stream enhanced laminar flow suggests that the rather than enhancement of a laminar flow behavior free stream disturbance results in early transition to turbulent stagnation point behavior. Excellent agreement is shown between enhanced laminar flow and turbulent flow behavior for high levels, e.g. 5% of free stream turbulence. Finally the blunt body turbulent stagnation results are shown to provide realistic heat transfer results for turbulent jet impingement problems.

  7. LANGUAGE CHANGES, APPROXIMATIVE VARIETIES AND TRANSLATION

    Directory of Open Access Journals (Sweden)

    Sabine Gorovitz

    2016-12-01

    Full Text Available From the media and communicative demands in a globalized context comes the need of using loan words for interaction and entertainment purposes. Using approximative varieties makes the languages to diachronically undergo changes in their syntactic organization as well as in their lexicon and semantic value, especially by producing neologisms incorporated to the language. Thus, sociolinguistics aims to understand how languages change, through recurring and cyclic processes of mutual influence which may occur diachronically and synchronously according to the speakers’ production. Indeed, the several incidences caused by constant language contact provoke new linguistic creations, which disseminate according to the needs, sometimes substituting previous terminologies and expressions. They result in direct influence whose echo is observed in ulterior grammatical processes, which are deployments of the modifications introduced before. The speakers determine which changes will be consolidated and, over the generations, they treat neologisms as belonging to the language in a lexical expansion phenomenon. Therefore, we analyze their importance for the translation and how they are directly affected, by establishing connections among the sociolinguistic studies developed by Calvet (2002, Faraco (2004, Labov (2008 and Bortoni-Ricardo (2014 about the pidgins, the creole languages and the possible linguistic changes that may occur within a communicative context of two or more languages in contact, we will do an analysis of its importance in the communication range and about which way they are directly affected.

  8. Finding approximate gene clusters with Gecko 3

    Science.gov (United States)

    Winter, Sascha; Jahn, Katharina; Wehner, Stefanie; Kuchenbecker, Leon; Marz, Manja; Stoye, Jens; Böcker, Sebastian

    2016-01-01

    Gene-order-based comparison of multiple genomes provides signals for functional analysis of genes and the evolutionary process of genome organization. Gene clusters are regions of co-localized genes on genomes of different species. The rapid increase in sequenced genomes necessitates bioinformatics tools for finding gene clusters in hundreds of genomes. Existing tools are often restricted to few (in many cases, only two) genomes, and often make restrictive assumptions such as short perfect conservation, conserved gene order or monophyletic gene clusters. We present Gecko 3, an open-source software for finding gene clusters in hundreds of bacterial genomes, that comes with an easy-to-use graphical user interface. The underlying gene cluster model is intuitive, can cope with low degrees of conservation as well as misannotations and is complemented by a sound statistical evaluation. To evaluate the biological benefit of Gecko 3 and to exemplify our method, we search for gene clusters in a dataset of 678 bacterial genomes using Synechocystis sp. PCC 6803 as a reference. We confirm detected gene clusters reviewing the literature and comparing them to a database of operons; we detect two novel clusters, which were confirmed by publicly available experimental RNA-Seq data. The computational analysis is carried out on a laptop computer in <40 min. PMID:27679480

  9. AUXIN BINDING PROTEIN1: The Outsider

    Science.gov (United States)

    Sauer, Michael; Kleine-Vehn, Jürgen

    2011-01-01

    AUXIN BINDING PROTEIN1 (ABP1) is one of the first characterized proteins that bind auxin and has been implied as a receptor for a number of auxin responses. Early studies characterized its auxin binding properties and focused on rapid electrophysiological and cell expansion responses, while subsequent work indicated a role in cell cycle and cell division control. Very recently, ABP1 has been ascribed a role in modulating endocytic events at the plasma membrane and RHO OF PLANTS-mediated cytoskeletal rearrangements during asymmetric cell expansion. The exact molecular function of ABP1 is still unresolved, but its main activity apparently lies in influencing events at the plasma membrane. This review aims to connect the novel findings with the more classical literature on ABP1 and to point out the many open questions that still separate us from a comprehensive model of ABP1 action, almost 40 years after the first reports of its existence. PMID:21719690

  10. Finite lattice model for molecular aggregation equilibria. Boolean statistics, analytical approximations, and the macroscopic limit.

    Science.gov (United States)

    Rankin, Blake M; Ben-Amotz, Dor; Widom, B

    2015-09-14

    Molecular processes, ranging from hydrophobic aggregation and protein binding to mesoscopic self-assembly, are typically driven by a delicate balance of energetic and entropic non-covalent interactions. Here, we focus on a broad class of such processes in which multiple ligands bind to a central solute molecule as a result of solute-ligand (direct) and/or ligand-ligand (cooperative) interaction energies. Previously, we described a weighted random mixing (WRM) mean-field model for such processes and compared the resulting adsorption isotherms and aggregate size distributions with exact finite lattice (FL) predictions, for lattices with up to n = 20 binding sites. Here, we compare FL predictions obtained using both Bethe-Guggenheim (BG) and WRM approximations, and find that the latter two approximations are complementary, as they are each most accurate in different aggregation regimes. Moreover, we describe a computationally efficient method for exhaustively counting nearest neighbors in FL configurations, thus making it feasible to obtain FL predictions for systems with up n = 48 binding sites, whose properties approach the thermodynamic (infinite lattice) limit. We further illustrate the applicability of our results by comparing lattice model and molecular dynamics simulation predictions pertaining to the aggregation of methane around neopentane.

  11. Oxytocin binding sites in bovine mammary tissue

    Energy Technology Data Exchange (ETDEWEB)

    Zhao, Xin.

    1989-01-01

    Oxytocin binding sites were identified and characterized in bovine mammary tissue. ({sup 3}H)-oxytocin binding reached equilibrium by 50 min at 20{degree}C and by 8 hr at 4{degree}C. The half-time of displacement at 20{degree}C was approximately 1 hr. Thyrotropin releasing hormone, adrenocorticotropin, angiotensin I, angiotensin II, pentagastrin, bradykinin, xenopsin and L-valyl-histidyl-L-leucyl-L-threonyl-L-prolyl-L-valyl-L-glutamyl-L-lysine were not competitive. In the presence of 10 nM LiCl, addition of oxytocin to dispersed bovine mammary cells, in which phosphatidylinositol was pre-labelled, caused a time and dose-dependent increase in radioactive inositiol monophosphate incorporation. The possibility that there are distinct vasopressin receptors in bovine mammary tissue was investigated. ({sup 3}H)-vasopressin binding reached equilibrium by 40 min at 20{degree}. The half-time of displacement at 20{degree}C was approximately 1 hr. The ability of the peptides to inhibit ({sup 3}H)-vasopressin binding was: (Thr{sup 4},Gly{sup 7})-oxytocin > Arg{sup 8}-vasopressin > (lys{sup 8})-vasopressin > (Deamino{sup 1},D-arg{sup 8})-vasopressin > oxytocin > d (CH{sub 2}){sub 5}Tyr(Me)AVP.

  12. Consistent Yokoya-Chen Approximation to Beamstrahlung(LCC-0010)

    Energy Technology Data Exchange (ETDEWEB)

    Peskin, M

    2004-04-22

    I reconsider the Yokoya-Chen approximate evolution equation for beamstrahlung and modify it slightly to generate simple, consistent analytical approximations for the electron and photon energy spectra. I compare these approximations to previous ones, and to simulation data.I reconsider the Yokoya-Chen approximate evolution equation for beamstrahlung and modify it slightly to generate simple, consistent analytical approximations for the electron and photon energy spectra. I compare these approximations to previous ones, and to simulation data.

  13. Approximate String Matching with Compressed Indexes

    Directory of Open Access Journals (Sweden)

    Pedro Morales

    2009-09-01

    Full Text Available A compressed full-text self-index for a text T is a data structure requiring reduced space and able to search for patterns P in T. It can also reproduce any substring of T, thus actually replacing T. Despite the recent explosion of interest on compressed indexes, there has not been much progress on functionalities beyond the basic exact search. In this paper we focus on indexed approximate string matching (ASM, which is of great interest, say, in bioinformatics. We study ASM algorithms for Lempel-Ziv compressed indexes and for compressed suffix trees/arrays. Most compressed self-indexes belong to one of these classes. We start by adapting the classical method of partitioning into exact search to self-indexes, and optimize it over a representative of either class of self-index. Then, we show that a Lempel- Ziv index can be seen as an extension of the classical q-samples index. We give new insights on this type of index, which can be of independent interest, and then apply them to a Lempel- Ziv index. Finally, we improve hierarchical verification, a successful technique for sequential searching, so as to extend the matches of pattern pieces to the left or right. Most compressed suffix trees/arrays support the required bidirectionality, thus enabling the implementation of the improved technique. In turn, the improved verification largely reduces the accesses to the text, which are expensive in self-indexes. We show experimentally that our algorithms are competitive and provide useful space-time tradeoffs compared to classical indexes.

  14. Coronal Loops: Evolving Beyond the Isothermal Approximation

    Science.gov (United States)

    Schmelz, J. T.; Cirtain, J. W.; Allen, J. D.

    2002-05-01

    Are coronal loops isothermal? A controversy over this question has arisen recently because different investigators using different techniques have obtained very different answers. Analysis of SOHO-EIT and TRACE data using narrowband filter ratios to obtain temperature maps has produced several key publications that suggest that coronal loops may be isothermal. We have constructed a multi-thermal distribution for several pixels along a relatively isolated coronal loop on the southwest limb of the solar disk using spectral line data from SOHO-CDS taken on 1998 Apr 20. These distributions are clearly inconsistent with isothermal plasma along either the line of sight or the length of the loop, and suggested rather that the temperature increases from the footpoints to the loop top. We speculated originally that these differences could be attributed to pixel size -- CDS pixels are larger, and more `contaminating' material would be expected along the line of sight. To test this idea, we used CDS iron line ratios from our data set to mimic the isothermal results from the narrowband filter instruments. These ratios indicated that the temperature gradient along the loop was flat, despite the fact that a more complete analysis of the same data showed this result to be false! The CDS pixel size was not the cause of the discrepancy; rather, the problem lies with the isothermal approximation used in EIT and TRACE analysis. These results should serve as a strong warning to anyone using this simplistic method to obtain temperature. This warning is echoed on the EIT web page: ``Danger! Enter at your own risk!'' In other words, values for temperature may be found, but they may have nothing to do with physical reality. Solar physics research at the University of Memphis is supported by NASA grant NAG5-9783. This research was funded in part by the NASA/TRACE MODA grant for Montana State University.

  15. Successive approximations for charged particle motion

    Science.gov (United States)

    Hoffstaetter

    2000-04-01

    Single-particle dynamics in electron microscopes, ion or electron lithographic instruments, particle accelerators, and particle spectrographs is described by weakly nonlinear ordinary differential equations. Therefore, the linear part of the equation of motion is usually solved and the nonlinear effects are then found in successive order by iteration methods. When synchrotron radiation is not important, the equation can be derived from a Hamiltonian or a Lagrangian. The Hamiltonian nature can lead to simplified computations of particle transport through an optical device when a suitable computational method is used. H. Rose and his school have contributed to these techniques by developing and intensively using the eikonal method [1-3]. Many ingenious microscopic and lithographic devices were found by Rose and his group due to the simple structure of this method [4-6]. The particle optical eikonal method is either derived by propagating the electron wave or by the principle of Maupertuis for time-independent fields. Maybe because of the time-dependent fields which are often required, in the area of accelerator physics the eikonal method has never become popular, although Lagrange methods had been used sometimes already in early days [7]. In this area classical Hamilitonian dynamics is usually used to compute nonlinear particle motion. Here the author will therefore derive the eikonal method from a Hamiltonian quite familiar to the accelerator physics community and reformulate it in a simplifying way. With the event of high-energy polarized electron beams [8] and plans for high-energy proton beams [9], nonlinear effects in spin motion have become important in high-energy accelerators. The author introduces a successive approximation for the nonlinear effects in the coupled spin and orbit motion of charged particles which resembles some of the simplifications resulting from the eikonal method for the pure orbit motion.

  16. Dynamical cluster approximation plus semiclassical approximation study for a Mott insulator and d-wave pairing

    Science.gov (United States)

    Kim, SungKun; Lee, Hunpyo

    2017-06-01

    Via a dynamical cluster approximation with N c = 4 in combination with a semiclassical approximation (DCA+SCA), we study the doped two-dimensional Hubbard model. We obtain a plaquette antiferromagnetic (AF) Mott insulator, a plaquette AF ordered metal, a pseudogap (or d-wave superconductor) and a paramagnetic metal by tuning the doping concentration. These features are similar to the behaviors observed in copper-oxide superconductors and are in qualitative agreement with the results calculated by the cluster dynamical mean field theory with the continuous-time quantum Monte Carlo (CDMFT+CTQMC) approach. The results of our DCA+SCA differ from those of the CDMFT+CTQMC approach in that the d-wave superconducting order parameters are shown even in the high doped region, unlike the results of the CDMFT+CTQMC approach. We think that the strong plaquette AF orderings in the dynamical cluster approximation (DCA) with N c = 4 suppress superconducting states with increasing doping up to strongly doped region, because frozen dynamical fluctuations in a semiclassical approximation (SCA) approach are unable to destroy those orderings. Our calculation with short-range spatial fluctuations is initial research, because the SCA can manage long-range spatial fluctuations in feasible computational times beyond the CDMFT+CTQMC tool. We believe that our future DCA+SCA calculations should supply information on the fully momentum-resolved physical properties, which could be compared with the results measured by angle-resolved photoemission spectroscopy experiments.

  17. Rapid scenarios and observed intensities

    Directory of Open Access Journals (Sweden)

    Franco Pettenati

    2012-10-01

    Full Text Available After a destructive earthquake, national Governments need to know the approximate amount of damage, the number of casualties, and the financial losses as soon as possible. Rapid scenarios are also used to inform the general public; see the widely used Shakemap package [Wald et al. 1999, 2006] of the US Geological Survey (USGS and the one modified by the Istituto Nazionale di Geofisica e Vulcanologia (INGV; National Institute of Geophysics and Volcanology, which is reproduced for Figure 1. The general matter of the use of intensities in damage scenarios was discussed in a special session at the 2008 Annual Meeting of the Seismological Society of America (http://www.seismosoc.org/meetings/2008/specialsessions.html, and was also discussed in the NIS-1 session of the European Congress in Moscow, in August 2012 (http://www.esc2012-moscow.org/esc_thematicareas.html. The purposes of the present report are to: (i compare different types of intensities; (ii check two rapid scenarios of intensity; and (iii understand whether the KF formula [Sirovich 1996, Sirovich et al. 2009] can be used as a new 'attenuation' relationship to improve rapid scenarios. […

  18. Reliable, rapid and simple voltammetric detection of urea nitrate explosive.

    Science.gov (United States)

    Cagan, Avi; Lu, Donglai; Cizek, Karel; La Belle, Jeff; Wang, Joseph

    2008-05-01

    A highly selective and rapid electrochemical assay of the improvised explosive urea nitrate (UN) is reported. The method involves a short ( approximately 10 s) acid-catalyzed reaction of UN with 4-nitrotoluene (NT) followed by a rapid ( approximately 2 s) square-wave voltammetric (SWV) detection of the 2,4-dinitrotoluene (DNT) product. The new protocol offers great promise for a reliable field detection of UN, with significant advantages of speed, sensitivity, portability, simplicity, and cost.

  19. Continuous fluorescence anisotropy-based assay of BOCILLIN FL penicillin reaction with penicillin binding protein 3.

    Science.gov (United States)

    Shapiro, Adam B; Gu, Rong-Fang; Gao, Ning; Livchak, Stephania; Thresher, Jason

    2013-08-01

    We report a simple, rapid, and reproducible fluorescence anisotropy-based method for measuring rate constants for acylation and deacylation of soluble penicillin binding protein (PBP) constructs by compounds in microtiter plates by means of competition with time-dependent acylation by BOCILLIN FL. The method is demonstrated by measuring the acylation rate constants of the PBP3 periplasmic domains from Pseudomonas aeruginosa and Acinetobacter baumannii by BOCILLIN FL, aztreonam, meropenem, and ceftazidime. The new method requires very little protein and can be completed in approximately 1h per compound. A set of BOCILLIN FL acylation progress curves collected over a range of competitor concentrations is fit globally to a kinetic model by numerical integration. First-order deacylation rate constants could also be measured, as demonstrated with a catalytically impaired mutant OXA-10 β-lactamase. Copyright © 2013 Elsevier Inc. All rights reserved.

  20. SHBG (Sex Hormone Binding Globulin)

    Science.gov (United States)

    ... Links Patient Resources For Health Professionals Subscribe Search Sex Hormone Binding Globulin (SHBG) Send Us Your Feedback ... As Testosterone-estrogen Binding Globulin TeBG Formal Name Sex Hormone Binding Globulin This article was last reviewed ...

  1. Extended Thomas-Fermi approximation to the one-body density matrix

    Energy Technology Data Exchange (ETDEWEB)

    Soubbotin, V.B.; Vinas, X

    2000-02-28

    The one-body density matrix is derived within the Extended Thomas-Fermi approximation. This has been done starting from the Wigner-Kirkwood distribution function for a non-local single-particle potential. The links between this new approximation to the density matrix with former approaches available in the literature are widely discussed. The semiclassical counterpart of the Hartree-Fock energy at the Extended Thomas-Fermi level is also obtained in the case of a non-local one-body Hamiltonian. The semiclassical binding energies and root mean square radii are compared with those obtained using the Strutinsky averaged method. The full Hartree-Fock values are compared with those obtained using the Kohn-Sham scheme based on the different approximations to the density matrix considered in the text. Numerical applications are performed using the Gogny, Brink-Boeker and BDM3Y1{sup *} effective interactions.

  2. Rapid Prototyping Laboratory

    Data.gov (United States)

    Federal Laboratory Consortium — The ARDEC Rapid Prototyping (RP) Laboratory was established in December 1992 to provide low cost RP capabilities to the ARDEC engineering community. The Stratasys,...

  3. Approximal morphology as predictor of approximal caries in primary molar teeth

    DEFF Research Database (Denmark)

    Cortes, A; Martignon, S; Qvist, V

    2017-01-01

    OBJECTIVE: To evaluate the predictive power of the morphology of the distal surface on 1st and mesial surface on 2nd primary molar teeth on caries development in young children. SAMPLE AND METHODS: Out of 101 3-to 4-year-old children from an on-going study, 62 children, for whom parents' informed...... caries. CLINICAL RELEVANCE: The concave morphology of approximal surfaces can predict future caries lesions supporting specific home-care and in-office preventive strategies....

  4. Approximal morphology as predictor of approximal caries in primary molar teeth.

    Science.gov (United States)

    Cortes, A; Martignon, S; Qvist, V; Ekstrand, Kim Rud

    2018-03-01

    To evaluate the predictive power of the morphology of the distal surface on 1st and mesial surface on 2nd primary molar teeth on caries development in young children. Out of 101 3-to 4-year-old children from an on-going study, 62 children, for whom parents' informed consent was given, participated. Upper and lower molar teeth of one randomly selected side received a 2-day temporarily separation. Bitewing radiographs and silicone impressions of interproximal area (IPA) were obtained. One-year procedures were repeated in 52 children (84%). The morphology of the distal surfaces of the first molar teeth and the mesial surfaces on the second molar teeth (n=208) was scored from the occlusal aspect on images from the baseline resin models resulting in four IPA variants: concave-concave; concave-convex; convex-concave, and convex-convex. Approximal caries on the surface in question was radiographically assessed as absent/present. Of the 52 children examined at follow-up, 31 children (60%) had 1-4 concave surfaces. In total 53 (25%) of the 208 surfaces were concave. A total of 22 children (43%) had 1-4 approximal lesions adding up to 59 lesions. Multiple logistic regression analyses disclosed that gender, surface morphology on one of the approximal surfaces (focus-surface), and adjacent-surface morphology were significantly related to caries development (p values ≤ 0.03). The odds ratio for developing caries in the focus-surface/adjacent-surface in the four IPA variants were convex-convex, 1.0; convex-concave, 5.5 (CI 2.0-14.7); concave-convex, 12.9 (CI 4.1-40.3); and concave-concave, 15.7 (CI 5.1-48.3). Morphology of approximal surfaces in primary molar teeth, in particular both surfaces being concave, significantly influences the risk of developing caries. The concave morphology of approximal surfaces can predict future caries lesions supporting specific home-care and in-office preventive strategies.

  5. High-Affinity RGD-Knottin Peptide as a New Tool for Rapid Evaluation of the Binding Strength of Unlabeled RGD-Peptides to αvβ3, αvβ5, and α5β1 Integrin Receptors.

    Science.gov (United States)

    Bernhagen, Dominik; De Laporte, Laura; Timmerman, Peter

    2017-06-06

    We describe a highly sensitive competition ELISA to measure integrin-binding of RGD-peptides in high-throughput without using cells, ECM-proteins, or antibodies. The assay measures (nonlabeled) RGD-peptides' ability to inhibit binding of a biotinylated "knottin"-RGD peptide to surface-immobilized integrins and, thus, enables quantification of the binding strength of high-, medium-, and low-affinity RGD-binders. We introduced the biotinylated knottin-RGD peptide instead of biotinylated cyclo[RGDfK] (as reported by Piras et al.), as integrin-binding was much stronger and clearly detectable for all three integrins. In order to maximize sensitivity and cost-efficiency, we first optimized several parameters, such as integrin-immobilization levels, knottin-RGD concentration, buffer compositions, type of detection tag (biotin, His- or cMyc-tag), and spacer length. We thereby identified two key factors, that is, (i) the critical spacer length (longer than Gly) and (ii) the presence of Ca2+ and Mg2+ in all incubation and washing buffers. Binding of knottin-RGD peptide was strongest for αvβ3 but also detectable for both αvβ5 and α5β1, while binding of biotinylated cyclo[RGDfK] was very weak and only detectable for αvβ3. For assay validation, we finally determined IC50 values for three unlabeled peptides, that is: (i) linear GRGDS, (ii) cyclo[RGDfK], and (iii) the knottin-RGD itself for binding to three different integrin receptors (αvβ3, αvβ5, α5β1). Major benefits of the novel assay are (i) the extremely low consumption of integrin (50 ng/peptide), (ii) the fact that neither antibodies/ECM-proteins nor integrin-expressing cells are required for detection, and (iii) its suitability for high-throughput screening of (RGD-)peptide libraries.

  6. Saccharide binding by intelectins.

    Science.gov (United States)

    Sharma, Shailza; Ramya, T N C

    2017-11-04

    This communication probes ligand binding by human Intelectin-1 with several saccharides. Human Intelectin-1 was previously reported to bind to microbial glycans via ribofuranoside or galactofuranoside residues, whereas subsequently, a crystal structure of ligand bound hITLN1 indicated that hITLN1 does not bind to ribofuranoside but distinguishes between microbial and human glycans through a glycan motif - a terminal, acyclic 1,2-diol, which is present on galactofuranose and other microbial saccharides. Here, we demonstrate that besides glycerol and glycerol derivatives (which have an acyclic 1,2-diol), and 2-deoxy-d-galactose, d-ribose and 2-deoxy-d-ribose, which have been previously reported as human Intelectin-1 ligands, 2-C-hydroxymethyl-d-ribose, d-talose, d-idose, d-altrose and sorbitol also elute human Intelectin-1 from Sepharose CL-6B. Interestingly, Sepharose, 2-deoxy-d-galactose (in its pyranose form), 2-C-hydroxymethyl-d-ribose, d-ribose and 2-deoxy d-ribose lack a terminal, acyclic 1,2-diol. We discuss the implications of these observations and rationalize the discrepancies in the apparent affinity of saccharide ligands for hITLN1 with different assay formats. We also report the distinct saccharide binding profiles of the hITLN1 homologues, HaloITLN and XL35ITLN, and demonstrate that hITLN1 binding to a saccharide ligand may modulate binding to its protein ligand, lactoferrin and vice versa. Copyright © 2017 Elsevier B.V. All rights reserved.

  7. Inhibition of selectin binding

    Energy Technology Data Exchange (ETDEWEB)

    Nagy, Jon O. (Rodeo, CA); Spevak, Wayne R. (Albany, CA); Dasgupta, Falguni (New Delhi, IN); Bertozzi, Carolyn (Albany, CA)

    1999-10-05

    This invention provides a system for inhibiting the binding between two cells, one expressing P- or L-selectin on the surface and the other expressing the corresponding ligand. A covalently crosslinked lipid composition is prepared having saccharides and acidic group on separate lipids. The composition is then interposed between the cells so as to inhibit binding. Inhibition can be achieved at an effective oligosaccharide concentration as low as 10.sup.6 fold below that of the free saccharide. Since selectins are involved in recruiting cells to sites of injury, this system can be used to palliate certain inflammatory and immunological conditions.

  8. Stochastic approximation Monte Carlo importance sampling for approximating exact conditional probabilities

    KAUST Repository

    Cheon, Sooyoung

    2013-02-16

    Importance sampling and Markov chain Monte Carlo methods have been used in exact inference for contingency tables for a long time, however, their performances are not always very satisfactory. In this paper, we propose a stochastic approximation Monte Carlo importance sampling (SAMCIS) method for tackling this problem. SAMCIS is a combination of adaptive Markov chain Monte Carlo and importance sampling, which employs the stochastic approximation Monte Carlo algorithm (Liang et al., J. Am. Stat. Assoc., 102(477):305-320, 2007) to draw samples from an enlarged reference set with a known Markov basis. Compared to the existing importance sampling and Markov chain Monte Carlo methods, SAMCIS has a few advantages, such as fast convergence, ergodicity, and the ability to achieve a desired proportion of valid tables. The numerical results indicate that SAMCIS can outperform the existing importance sampling and Markov chain Monte Carlo methods: It can produce much more accurate estimates in much shorter CPU time than the existing methods, especially for the tables with high degrees of freedom. © 2013 Springer Science+Business Media New York.

  9. Restricted second random phase approximations and Tamm-Dancoff approximations for electronic excitation energy calculations

    Energy Technology Data Exchange (ETDEWEB)

    Peng, Degao; Yang, Yang; Zhang, Peng [Department of Chemistry, Duke University, Durham, North Carolina 27708 (United States); Yang, Weitao, E-mail: weitao.yang@duke.edu [Department of Chemistry and Department of Physics, Duke University, Durham, North Carolina 27708 (United States)

    2014-12-07

    In this article, we develop systematically second random phase approximations (RPA) and Tamm-Dancoff approximations (TDA) of particle-hole and particle-particle channels for calculating molecular excitation energies. The second particle-hole RPA/TDA can capture double excitations missed by the particle-hole RPA/TDA and time-dependent density-functional theory (TDDFT), while the second particle-particle RPA/TDA recovers non-highest-occupied-molecular-orbital excitations missed by the particle-particle RPA/TDA. With proper orbital restrictions, these restricted second RPAs and TDAs have a formal scaling of only O(N{sup 4}). The restricted versions of second RPAs and TDAs are tested with various small molecules to show some positive results. Data suggest that the restricted second particle-hole TDA (r2ph-TDA) has the best overall performance with a correlation coefficient similar to TDDFT, but with a larger negative bias. The negative bias of the r2ph-TDA may be induced by the unaccounted ground state correlation energy to be investigated further. Overall, the r2ph-TDA is recommended to study systems with both single and some low-lying double excitations with a moderate accuracy. Some expressions on excited state property evaluations, such as 〈S{sup ^2}〉 are also developed and tested.

  10. Restricted second random phase approximations and Tamm-Dancoff approximations for electronic excitation energy calculations

    Science.gov (United States)

    Peng, Degao; Yang, Yang; Zhang, Peng; Yang, Weitao

    2014-12-01

    In this article, we develop systematically second random phase approximations (RPA) and Tamm-Dancoff approximations (TDA) of particle-hole and particle-particle channels for calculating molecular excitation energies. The second particle-hole RPA/TDA can capture double excitations missed by the particle-hole RPA/TDA and time-dependent density-functional theory (TDDFT), while the second particle-particle RPA/TDA recovers non-highest-occupied-molecular-orbital excitations missed by the particle-particle RPA/TDA. With proper orbital restrictions, these restricted second RPAs and TDAs have a formal scaling of only O(N4). The restricted versions of second RPAs and TDAs are tested with various small molecules to show some positive results. Data suggest that the restricted second particle-hole TDA (r2ph-TDA) has the best overall performance with a correlation coefficient similar to TDDFT, but with a larger negative bias. The negative bias of the r2ph-TDA may be induced by the unaccounted ground state correlation energy to be investigated further. Overall, the r2ph-TDA is recommended to study systems with both single and some low-lying double excitations with a moderate accuracy. Some expressions on excited state property evaluations, such as < hat{S}2rangle are also developed and tested.

  11. Rapid Airplane Parametric Input Design (RAPID)

    Science.gov (United States)

    Smith, Robert E.

    1995-01-01

    RAPID is a methodology and software system to define a class of airplane configurations and directly evaluate surface grids, volume grids, and grid sensitivity on and about the configurations. A distinguishing characteristic which separates RAPID from other airplane surface modellers is that the output grids and grid sensitivity are directly applicable in CFD analysis. A small set of design parameters and grid control parameters govern the process which is incorporated into interactive software for 'real time' visual analysis and into batch software for the application of optimization technology. The computed surface grids and volume grids are suitable for a wide range of Computational Fluid Dynamics (CFD) simulation. The general airplane configuration has wing, fuselage, horizontal tail, and vertical tail components. The double-delta wing and tail components are manifested by solving a fourth order partial differential equation (PDE) subject to Dirichlet and Neumann boundary conditions. The design parameters are incorporated into the boundary conditions and therefore govern the shapes of the surfaces. The PDE solution yields a smooth transition between boundaries. Surface grids suitable for CFD calculation are created by establishing an H-type topology about the configuration and incorporating grid spacing functions in the PDE equation for the lifting components and the fuselage definition equations. User specified grid parameters govern the location and degree of grid concentration. A two-block volume grid about a configuration is calculated using the Control Point Form (CPF) technique. The interactive software, which runs on Silicon Graphics IRIS workstations, allows design parameters to be continuously varied and the resulting surface grid to be observed in real time. The batch software computes both the surface and volume grids and also computes the sensitivity of the output grid with respect to the input design parameters by applying the precompiler tool

  12. Asymptotic approximations for non-integer order derivatives of monomials

    Science.gov (United States)

    Aşiru, Muniru A.

    2015-02-01

    In this note, we develop new, simple and very accurate asymptotic approximations for non-integer order derivatives of monomial functions by using the more accurate asymptotic approximations for large factorials that have recently appeared in the literature.

  13. The strengths and weaknesses of L2 approximable regressors

    OpenAIRE

    Mynbaev, Kairat

    2001-01-01

    The most part of the paper is about modeling (or approximating) nonstochastic regressors. Examples of regressors which are (not) L2-approximable are given. Applications to central limit theory and OLS estimator asymptotics are provided.

  14. Approximate viability for nonlinear evolution inclusions with application to controllability

    Directory of Open Access Journals (Sweden)

    Omar Benniche

    2016-12-01

    Full Text Available We investigate approximate viability for a graph with respect to fully nonlinear quasi-autonomous evolution inclusions. As application, an approximate null controllability result is given.

  15. Carboplatin binding to histidine

    NARCIS (Netherlands)

    Tanley, Simon W M; Diederichs, Kay; Kroon - Batenburg, Louise|info:eu-repo/dai/nl/070944172; Levy, Colin; Schreurs, Antoine M M|info:eu-repo/dai/nl/304847453; Helliwell, John R.

    2014-01-01

    Carboplatin is a second-generation platinum anticancer agent used for the treatment of a variety of cancers. Previous X-ray crystallographic studies of carboplatin binding to histidine (in hen egg-white lysozyme; HEWL) showed the partial conversion of carboplatin to cisplatin owing to the high NaCl

  16. Sequential memory: Binding dynamics

    Science.gov (United States)

    Afraimovich, Valentin; Gong, Xue; Rabinovich, Mikhail

    2015-10-01

    Temporal order memories are critical for everyday animal and human functioning. Experiments and our own experience show that the binding or association of various features of an event together and the maintaining of multimodality events in sequential order are the key components of any sequential memories—episodic, semantic, working, etc. We study a robustness of binding sequential dynamics based on our previously introduced model in the form of generalized Lotka-Volterra equations. In the phase space of the model, there exists a multi-dimensional binding heteroclinic network consisting of saddle equilibrium points and heteroclinic trajectories joining them. We prove here the robustness of the binding sequential dynamics, i.e., the feasibility phenomenon for coupled heteroclinic networks: for each collection of successive heteroclinic trajectories inside the unified networks, there is an open set of initial points such that the trajectory going through each of them follows the prescribed collection staying in a small neighborhood of it. We show also that the symbolic complexity function of the system restricted to this neighborhood is a polynomial of degree L - 1, where L is the number of modalities.

  17. Binding and Bulgarian

    NARCIS (Netherlands)

    Schürcks-Grozeva, Lilia Lubomirova

    2003-01-01

    In haar proefschrift analyseert Lilia Schürcks de anaforische verschijnselen in de Bulgaarse taal. Het gaat dan om wederkerende aspecten, uitgedrukt bij woorden als ‘zich’ en ‘elkaar’. De situatie in het Bulgaars blijkt moeilijk in te passen in de klassieke Binding Theory van Noam Chomsky. Bron: RUG

  18. Pawlak algebra and approximate structure on fuzzy lattice.

    Science.gov (United States)

    Zhuang, Ying; Liu, Wenqi; Wu, Chin-Chia; Li, Jinhai

    2014-01-01

    The aim of this paper is to investigate the general approximation structure, weak approximation operators, and Pawlak algebra in the framework of fuzzy lattice, lattice topology, and auxiliary ordering. First, we prove that the weak approximation operator space forms a complete distributive lattice. Then we study the properties of transitive closure of approximation operators and apply them to rough set theory. We also investigate molecule Pawlak algebra and obtain some related properties.

  19. Electroencephalogram approximate entropy influenced by both age and sleep

    Directory of Open Access Journals (Sweden)

    Gerick M. H. Lee

    2013-12-01

    Full Text Available The use of information-based measures to assess changes in conscious state is an increasingly popular topic. Though recent results have seemed to justify the merits of such methods, little has been done to investigate the applicability of such measures to children. For our work, we used the approximate entropy (ApEn, a measure previously shown to correlate with changes in conscious state when applied to the electroencephalogram (EEG, and sought to confirm whether previously reported trends in adult ApEn values across wake and sleep were present in children. Besides validating the prior findings that ApEn decreases from wake to sleep (including wake, rapid eye movement [REM] sleep, and non-REM sleep in adults, we found that previously reported ApEn decreases across vigilance states in adults were also present in children (ApEn trends for both age groups: wake > REM sleep > non-REM sleep. When comparing ApEn values between age groups, adults had significantly larger ApEn values than children during wakefulness. After the application of an 8 Hz high-pass filter to the EEG signal, ApEn values were recalculated. The number of electrodes with significant vigilance state effects dropped from all 109 electrodes with the original 1 Hz filter to 1 electrode with the 8 Hz filter. The number of electrodes with significant age effects dropped from ten to four. Our results support the notion that ApEn can reliably distinguish between vigilance states, with low-frequency sleep-related oscillations implicated as the driver of changes between vigilance states. We suggest that the observed differences between adult and child ApEn values during wake may reflect differences in connectivity between age groups, a factor which may be important in the use of EEG to measure consciousness.

  20. Rapid shallow breathing

    Science.gov (United States)

    ... the smallest air passages of the lungs in children ( bronchiolitis ) Pneumonia or other lung infection Transient tachypnea of the newborn Anxiety and panic Other serious lung disease Home Care Rapid, shallow breathing should not be treated at home. It is ...

  1. Rapid Strep Test

    Science.gov (United States)

    ... worse than normal. Your first thoughts turn to strep throat. A rapid strep test in your doctor’s office ... your suspicions.Viruses cause most sore throats. However, strep throat is an infection caused by the Group A ...

  2. Approximate Noether gauge symmetries of the Bardeen model

    Energy Technology Data Exchange (ETDEWEB)

    Camci, U. [Akdeniz University, Department of Physics, Faculty of Science, Antalya (Turkey)

    2014-12-01

    We investigate the approximate Noether gauge symmetries of the geodesic Lagrangian for the Bardeen spacetime model. This is accommodated by a set of new approximate Noether gauge symmetry relations for the perturbed geodesic Lagrangian in the spacetime. A detailed analysis of the spacetime of the Bardeen model up to third-order approximate Noether gauge symmetries is presented. (orig.)

  3. Meta-Regression Approximations to Reduce Publication Selection Bias

    Science.gov (United States)

    Stanley, T. D.; Doucouliagos, Hristos

    2014-01-01

    Publication selection bias is a serious challenge to the integrity of all empirical sciences. We derive meta-regression approximations to reduce this bias. Our approach employs Taylor polynomial approximations to the conditional mean of a truncated distribution. A quadratic approximation without a linear term, precision-effect estimate with…

  4. On multiple-delay approximations of multiple-derivative controllers

    NARCIS (Netherlands)

    Wan, Yan; Roy, Sandip; Stoorvogel, Antonie Arij; Saberi, Ali

    We study approximation of multiple-derivative output feedback for linear time-invariant (LTI) plants using multiple-delay approximations. We obtain a condition on the plant and feedback that yields an equivalence between the closed-loop spectra for the approximate feedbacks and the desired

  5. New Approach to Fractal Approximation of Vector-Functions

    OpenAIRE

    Konstantin Igudesman; Marsel Davletbaev; Gleb Shabernev

    2014-01-01

    This paper introduces new approach to approximation of continuous vector-functions and vector sequences by fractal interpolation vector-functions which are multidimensional generalization of fractal interpolation functions. Best values of fractal interpolation vector-functions parameters are found. We give schemes of approximation of some sets of data and consider examples of approximation of smooth curves with different conditions.

  6. RAPID3? Aptly named!

    Science.gov (United States)

    Berthelot, J-M

    2014-01-01

    The RAPID3 score is the sum of three 0-10 patient self-report scores: pain, functional impairment on MDHAQ, and patient global estimate. It requires 5 seconds for scoring and can be used in all rheumatologic conditions, although it has mostly been used in rheumatoid arthritis where cutoffs for low disease activity (12/30) have been set. A RAPID3 score of ≤ 3/30 with 1 or 0 swollen joints (RAPID3 ≤ 3 + ≤ SJ1) provides remission criteria comparable to Boolean, SDAI, CDAI, and DAS28 remission criteria, in far less time than a formal joint count. RAPID3 performs as well as the DAS28 in separating active drugs from placebos in clinical trials. RAPID3 also predicts subsequent structural disease progression. RAPID3 can be determined at short intervals at home, allowing the determination of the area under the curve of disease activity between two visits and flare detection. However, RAPID3 should not be seen as a substitute for DAS28 and face to face visits in routine care. Monitoring patient status with only self-report information without a rheumatologist's advice (including joints and physical examination, and consideration of imaging and laboratory tests) may indeed be as undesirable for most patients than joint examination without a patient questionnaire. Conversely, combining the RAPID3 and the DAS28 may consist in faster or more sensitive confirmation that a medication is effective. Similarly, better enquiring of most important concerns of patients (pain, functional status and overall opinion on their disorder) should reinforces patients' confidence in their rheumatologist and treatments.

  7. A Perceptual-Like Population-Coding Mechanism of Approximate Numerical Averaging.

    Science.gov (United States)

    Brezis, Noam; Bronfman, Zohar Z; Usher, Marius

    2018-02-01

    Humans possess a remarkable ability to rapidly form coarse estimations of numerical averages. This ability is important for making decisions that are based on streams of numerical or value-based information, as well as for preference formation. Nonetheless, the mechanism underlying rapid approximate numerical averaging remains unknown, and several competing mechanism may account for it. Here, we tested the hypothesis that approximate numerical averaging relies on perceptual-like processes, instantiated by population coding. Participants were presented with rapid sequences of numerical values (four items per second) and were asked to convey the sequence average. We manipulated the sequences' length, variance, and mean magnitude and found that similar to perceptual averaging, the precision of the estimations improves with the length and deteriorates with (higher) variance or (higher) magnitude. To account for the results, we developed a biologically plausible population-coding model and showed that it is mathematically equivalent to a population vector. Using both quantitative and qualitative model comparison methods, we compared the population-coding model to several competing models, such as a step-by-step running average (based on leaky integration) and a midrange model. We found that the data support the population-coding model. We conclude that humans' ability to rapidly form estimations of numerical averages has many properties of the perceptual (intuitive) system rather than the arithmetic, linguistic-based (analytic) system and that population coding is likely to be its underlying mechanism.

  8. Competitive protein binding assay for piritrexim

    Energy Technology Data Exchange (ETDEWEB)

    Woolley, J.L. Jr.; Ringstad, J.L.; Sigel, C.W. (Wellcome Research Laboratories, Research Triangle Park, NC (USA))

    1989-09-01

    A competitive protein binding assay for piritrexim (PTX, 1) that makes use of a commercially available radioassay kit for methotrexate has been developed. After it is selectively extracted from plasma, PTX competes with ({sup 125}I)methotrexate for binding to dihydrofolate reductase isolated from Lactobacillus casei. Free drug is separated from bound drug by adsorption to dextran-coated charcoal. Piritrexim is measurable over a range of 0.01 to 10.0 micrograms/mL in plasma with a coefficient of variation less than 15%. The limit of sensitivity of the assay is approximately 2 ng/mL. An excellent correlation between this assay and a previously published HPLC method was found.

  9. Circular arc approximation by quartic H-Bézier curve

    Directory of Open Access Journals (Sweden)

    Maria Hussain

    2017-06-01

    Full Text Available The quartic H-Bézier curve is used for the approximation of circular arcs. It has five control points and one positive real free parameter. The four control points are carried out by G^1-approximation constraints and the remaining control point is dividing the line segment joining the second and fourth control points in the ratio 1:2. Optimized value of free parameter α is obtained by minimizing the maximum value of absolute radius error of the recommended approximation scheme. The developed approximation scheme is found considerably better than the existing approximation schemes for these computed values of control points and optimized value of the free parameter.

  10. Methods of Approximation Theory in Complex Analysis and Mathematical Physics

    CERN Document Server

    Saff, Edward

    1993-01-01

    The book incorporates research papers and surveys written by participants ofan International Scientific Programme on Approximation Theory jointly supervised by Institute for Constructive Mathematics of University of South Florida at Tampa, USA and the Euler International Mathematical Instituteat St. Petersburg, Russia. The aim of the Programme was to present new developments in Constructive Approximation Theory. The topics of the papers are: asymptotic behaviour of orthogonal polynomials, rational approximation of classical functions, quadrature formulas, theory of n-widths, nonlinear approximation in Hardy algebras,numerical results on best polynomial approximations, wavelet analysis. FROM THE CONTENTS: E.A. Rakhmanov: Strong asymptotics for orthogonal polynomials associated with exponential weights on R.- A.L. Levin, E.B. Saff: Exact Convergence Rates for Best Lp Rational Approximation to the Signum Function and for Optimal Quadrature in Hp.- H. Stahl: Uniform Rational Approximation of x .- M. Rahman, S.K. ...

  11. Biodiscovery of aluminum binding peptides

    Science.gov (United States)

    Adams, Bryn L.; Sarkes, Deborah A.; Finch, Amethist S.; Hurley, Margaret M.; Stratis-Cullum, Dimitra

    2013-05-01

    Cell surface peptide display systems are large and diverse libraries of peptides (7-15 amino acids) which are presented by a display scaffold hosted by a phage (virus), bacteria, or yeast cell. This allows the selfsustaining peptide libraries to be rapidly screened for high affinity binders to a given target of interest, and those binders quickly identified. Peptide display systems have traditionally been utilized in conjunction with organic-based targets, such as protein toxins or carbon nanotubes. However, this technology has been expanded for use with inorganic targets, such as metals, for biofabrication, hybrid material assembly and corrosion prevention. While most current peptide display systems employ viruses to host the display scaffold, we have recently shown that a bacterial host, Escherichia coli, displaying peptides in the ubiquitous, membrane protein scaffold eCPX can also provide specific peptide binders to an organic target. We have, for the first time, extended the use of this bacterial peptide display system for the biodiscovery of aluminum binding 15mer peptides. We will present the process of biopanning with macroscopic inorganic targets, binder enrichment, and binder isolation and discovery.

  12. Tritium NMR spectroscopy of ligand binding to maltose-binding protein

    Energy Technology Data Exchange (ETDEWEB)

    Gehring, K.; Williams, P.G.; Pelton, J.G.; Morimoto, H.; Wemmer, D.E. (Lawrence Berkeley Lab., CA (United States))

    1991-06-04

    Tritium-labeled {alpha}- and {beta}-maltodextrins have been used to study their complexes with maltose-binding protein (MBP), a 40-kDa bacterial protein. Five substrates, from maltose to maltohexaose, were labeled at their reducing ends and their binding studied. Tritium NMR specctroscopy of the labeled sugars showed large upfield chamical shift changes upon binding and strong anomeric specficity. At 10{degrees}C, MBP bound {alpha}-maltose with 2.7 {plus minus} 0.5-fold higher affinity than {beta}-maltose, and, for longer maltodextrins, the ratio of affinities was even larger. The maximum chemical shift change was 2.2 ppm, suggesting that the reducing end of bound {alpha}-maltodextrin makes close contact with an aromatic residue in the MBP-binding site. Experiments with maltotriose (and longer maltodextrins) also revealed the presence of two bound {beta}-maltotriose resonances in rapid exchange. The authors interpret these two resonances as arising from two distinct sugar-protein complexes. In one complex, the {beta}-maltodextrin is bound by its reducing end, and, in the other complex, the {beta}-maltodextrin is bound by the middle glucose residue(s). This interpretation also suggests how MBP is able to bind both linear and circular maltodextrins.

  13. Substrate Binding Induces Domain Movements in Orotidine 5'-Monophosphate Decarboxylase

    DEFF Research Database (Denmark)

    Harris, Pernille Hanne; Poulsen, Jens-Christian Navarro; Jensen, Kaj Frank

    2002-01-01

    ); here we present the 2.5 Å structure of the uncomplexed apo enzyme, determined from twinned crystals. A structural analysis and comparison of the two structures of the E. coli enzyme show that binding of the inhibitor is accompanied by significant domain movements of approximately 12° around a hinge...

  14. Semi-automated, occupationally safe immunofluorescence microtip sensor for rapid detection of Mycobacterium cells in sputum.

    Directory of Open Access Journals (Sweden)

    Shinnosuke Inoue

    Full Text Available An occupationally safe (biosafe sputum liquefaction protocol was developed for use with a semi-automated antibody-based microtip immunofluorescence sensor. The protocol effectively liquefied sputum and inactivated microorganisms including Mycobacterium tuberculosis, while preserving the antibody-binding activity of Mycobacterium cell surface antigens. Sputum was treated with a synergistic chemical-thermal protocol that included moderate concentrations of NaOH and detergent at 60°C for 5 to 10 min. Samples spiked with M. tuberculosis complex cells showed approximately 10(6-fold inactivation of the pathogen after treatment. Antibody binding was retained post-treatment, as determined by analysis with a microtip immunosensor. The sensor correctly distinguished between Mycobacterium species and other cell types naturally present in biosafe-treated sputum, with a detection limit of 100 CFU/mL for M. tuberculosis, in a 30-minute sample-to-result process. The microtip device was also semi-automated and shown to be compatible with low-cost, LED-powered fluorescence microscopy. The device and biosafe sputum liquefaction method opens the door to rapid detection of tuberculosis in settings with limited laboratory infrastructure.

  15. Analytical mass formula and nuclear surface properties in the ETF approximation. Part II: asymmetric nuclei

    Science.gov (United States)

    Aymard, François; Gulminelli, Francesca; Margueron, Jérôme

    2016-08-01

    We have recently addressed the problem of the determination of the nuclear surface energy for symmetric nuclei in the framework of the extended Thomas-Fermi (ETF) approximation using Skyrme functionals. We presently extend this formalism to the case of asymmetric nuclei and the question of the surface symmetry energy. We propose an approximate expression for the diffuseness and the surface energy. These quantities are analytically related to the parameters of the energy functional. In particular, the influence of the different equation of state parameters can be explicitly quantified. Detailed analyses of the different energy components (local/non-local, isoscalar/isovector, surface/curvature and higher order) are also performed. Our analytical solution of the ETF integral improves previous models and leads to a precision of better than 200 keV per nucleon in the determination of the nuclear binding energy for dripline nuclei.

  16. Characterization of [3H]flunitrazepam binding to melanin.

    Science.gov (United States)

    Testorf, M F; Kronstrand, R; Svensson, S P; Lundström, I; Ahlner, J

    2001-11-15

    In both clinical and forensic toxicology, the analysis of hair for drugs is an important tool to determine drug use in the past or to verify abstinence from illegal drugs during extended periods. Melanin is proposed as one of the factors that influences drug incorporation to hair and we have characterized the binding of the drug flunitrazepam to melanin in vitro. The drug was 3H labeled and melanin granules from cuttlefish, Sepia officinalis, were used according to the suggested standard for melanin studies. We observed a rapid Langmuir-like binding followed by a slower diffusion-limited binding that may be interpreted as an initial surface binding followed by deeper bulk binding. From three concentrations of melanin, with a 60-min incubation time, a mean saturation value of 180 +/- 20 pmol/mg was calculated. The binding of a group of benzodiazepines and tranquilizers was compared to the binding of [3H]flunitrazepam by means of displacement experiments. These drugs showed binding characteristics similar to [3H]flunitrazepam except phenobarbital, which had a lower affinity to melanin. The method presented in this study allowed measurements with low melanin and drug concentrations and it has the strength of directly measuring the amount of drug bound to melanin, in contrast to previous indirect methods. Copyright 2001 Academic Press.

  17. Hydrolysis at One of the Two Nucleotide-binding Sites Drives the Dissociation of ATP-binding Cassette Nucleotide-binding Domain Dimers*

    Science.gov (United States)

    Zoghbi, Maria E.; Altenberg, Guillermo A.

    2013-01-01

    The functional unit of ATP-binding cassette (ABC) transporters consists of two transmembrane domains and two nucleotide-binding domains (NBDs). ATP binding elicits association of the two NBDs, forming a dimer in a head-to-tail arrangement, with two nucleotides “sandwiched” at the dimer interface. Each of the two nucleotide-binding sites is formed by residues from the two NBDs. We recently found that the prototypical NBD MJ0796 from Methanocaldococcus jannaschii dimerizes in response to ATP binding and dissociates completely following ATP hydrolysis. However, it is still unknown whether dissociation of NBD dimers follows ATP hydrolysis at one or both nucleotide-binding sites. Here, we used luminescence resonance energy transfer to study heterodimers formed by one active (donor-labeled) and one catalytically defective (acceptor-labeled) NBD. Rapid mixing experiments in a stop-flow chamber showed that NBD heterodimers with one functional and one inactive site dissociated at a rate indistinguishable from that of dimers with two hydrolysis-competent sites. Comparison of the rates of NBD dimer dissociation and ATP hydrolysis indicated that dissociation followed hydrolysis of one ATP. We conclude that ATP hydrolysis at one nucleotide-binding site drives NBD dimer dissociation. PMID:24129575

  18. Binding Rather Than Metabolism May Explain the Interaction of Two Food-Grade Lactobacillus Strains with Zearalenone and Its Derivative ά-Zearalenol

    Science.gov (United States)

    El-Nezami, Hani; Polychronaki, Nektaria; Salminen, Seppo; Mykkänen, Hannu

    2002-01-01

    The interaction between two Fusarium mycotoxins, zearalenone (ZEN) and its derivative ¯α-zearalenol (¯α-ZOL), with two food-grade strains of Lactobacillus was investigated. The mycotoxins (2 μg ml−1) were incubated with either Lactobacillus rhamnosus strain GG or L. rhamnosus strain LC705. A considerable proportion (38 to 46%) of both toxins was recovered from the bacterial pellet, and no degradation products of ZEN and ¯α-ZOL were detected in the high-performance liquid chromatograms of the supernatant of the culturing media and the methanol extract of the pellet. Both heat-treated and acid-treated bacteria were capable of removing the toxins, indicating that binding, not metabolism, is the mechanism by which the toxins are removed from the media. Binding of ZEN or ¯α-ZOL by lyophilized L. rhamnosus GG and L. rhamnosus LC705 was a rapid reaction: approximately 55% of the toxins were bound instantly after mixing with the bacteria. Binding was dependent on the bacterial concentration, and coincubation of ZEN with ¯α-ZOL significantly affected the percentage of the toxin bound, indicating that these toxins may share the same binding site on the bacterial surface. These results can be exploited in developing a new approach for detoxification of mycotoxins from foods and feeds. PMID:12089040

  19. Recombinant synthesis, purification, and nucleotide binding characteristics of the first nucleotide binding domain of the cystic fibrosis gene product.

    Science.gov (United States)

    Hartman, J; Huang, Z; Rado, T A; Peng, S; Jilling, T; Muccio, D D; Sorscher, E J

    1992-04-05

    The majority of mutations which lead to clinical cystic fibrosis are located within the two predicted nucleotide binding domains of the cystic fibrosis gene product. We have used a prokaryotic expression system to synthesize and purify the first nucleotide binding domain (NBD-1, amino acids 426-588) with and without the most common mutation associated with the disease (the deletion of phenylalanine at position 508, delta F508). Both wild type and delta F508 NBD-1 bind ATP-agarose in a quantitatively comparable manner; this binding was inhibited by excess Na2ATP, trinitrophenol-ATP, or 8-azido-ATP. Irreversible NBD-1 labeling by an ATP analog was demonstrated using [32P]8-azido-ATP. This covalent labeling was inhibited by preincubation with Na2ATP, with half-maximal inhibition for Na2ATP occurring at approximately 5 mM for both the wild type and delta F508 nucleotide binding domain. These experiments are among the first to confirm the expectation that the cystic fibrosis transmembrane conductance regulator NBD-1 binds nucleotide. Since, under the conditions used in our study, NBD-1 without phenylalanine 508 displays very similar nucleotide binding characteristics to the wild type protein, our results support previous structural models which predict that the delta F508 mutation should not cause an alteration in ATP binding.

  20. Rapid small lot manufacturing

    Energy Technology Data Exchange (ETDEWEB)

    Harrigan, R.W.

    1998-05-09

    The direct connection of information, captured in forms such as CAD databases, to the factory floor is enabling a revolution in manufacturing. Rapid response to very dynamic market conditions is becoming the norm rather than the exception. In order to provide economical rapid fabrication of small numbers of variable products, one must design with manufacturing constraints in mind. In addition, flexible manufacturing systems must be programmed automatically to reduce the time for product change over in the factory and eliminate human errors. Sensor based machine control is needed to adapt idealized, model based machine programs to uncontrolled variables such as the condition of raw materials and fabrication tolerances.

  1. Coupled binding-bending-folding: The complex conformational dynamics of protein-DNA binding studied by atomistic molecular dynamics simulations.

    Science.gov (United States)

    van der Vaart, Arjan

    2015-05-01

    Protein-DNA binding often involves dramatic conformational changes such as protein folding and DNA bending. While thermodynamic aspects of this behavior are understood, and its biological function is often known, the mechanism by which the conformational changes occur is generally unclear. By providing detailed structural and energetic data, molecular dynamics simulations have been helpful in elucidating and rationalizing protein-DNA binding. This review will summarize recent atomistic molecular dynamics simulations of the conformational dynamics of DNA and protein-DNA binding. A brief overview of recent developments in DNA force fields is given as well. Simulations have been crucial in rationalizing the intrinsic flexibility of DNA, and have been instrumental in identifying the sequence of binding events, the triggers for the conformational motion, and the mechanism of binding for a number of important DNA-binding proteins. Molecular dynamics simulations are an important tool for understanding the complex binding behavior of DNA-binding proteins. With recent advances in force fields and rapid increases in simulation time scales, simulations will become even more important for future studies. This article is part of a Special Issue entitled Recent developments of molecular dynamics. Copyright © 2014. Published by Elsevier B.V.

  2. Evaluation of binding strength depending on the adhesive binding methods

    OpenAIRE

    Suzana Pasanec Preprotić; Ivan Budimir; Gorana Tomić

    2015-01-01

    A book with a personal value is worth remembering since it represents specific interests of an individual - author of the book. Therefore the original is the first issue of a book which is always bound manually. Due to cost-effectiveness, adhesive binding is most commonly used in author’s edition in paperback and hardback. Adhesive binding methods differ only if a paper leaf is a binding unit in adhesive binding form. The subject of the research is the quality of book block binding for two bi...

  3. Information-Theoretic Bounds and Approximations in Neural Population Coding.

    Science.gov (United States)

    Huang, Wentao; Zhang, Kechen

    2018-01-17

    While Shannon's mutual information has widespread applications in many disciplines, for practical applications it is often difficult to calculate its value accurately for high-dimensional variables because of the curse of dimensionality. This article focuses on effective approximation methods for evaluating mutual information in the context of neural population coding. For large but finite neural populations, we derive several information-theoretic asymptotic bounds and approximation formulas that remain valid in high-dimensional spaces. We prove that optimizing the population density distribution based on these approximation formulas is a convex optimization problem that allows efficient numerical solutions. Numerical simulation results confirmed that our asymptotic formulas were highly accurate for approximating mutual information for large neural populations. In special cases, the approximation formulas are exactly equal to the true mutual information. We also discuss techniques of variable transformation and dimensionality reduction to facilitate computation of the approximations.

  4. Approximate solutions for certain bidomain problems in electrocardiography

    Science.gov (United States)

    Johnston, Peter R.

    2008-10-01

    The simulation of problems in electrocardiography using the bidomain model for cardiac tissue often creates issues with satisfaction of the boundary conditions required to obtain a solution. Recent studies have proposed approximate methods for solving such problems by satisfying the boundary conditions only approximately. This paper presents an analysis of their approximations using a similar method, but one which ensures that the boundary conditions are satisfied during the whole solution process. Also considered are additional functional forms, used in the approximate solutions, which are more appropriate to specific boundary conditions. The analysis shows that the approximations introduced by Patel and Roth [Phys. Rev. E 72, 051931 (2005)] generally give accurate results. However, there are certain situations where functional forms based on the geometry of the problem under consideration can give improved approximations. It is also demonstrated that the recent methods are equivalent to different approaches to solving the same problems introduced 20years earlier.

  5. Binding of beta-VLDL to heparan sulfate proteoglycans requires lipoprotein lipase, whereas ApoE only modulates binding affinity.

    Science.gov (United States)

    de Beer, F; Hendriks, W L; van Vark, L C; Kamerling, S W; van Dijk, K W; Hofker, M H; Smelt, A H; Havekes, L M

    1999-03-01

    The binding of beta-VLDL to heparan sulfate proteoglycans (HSPG) has been reported to be stimulated by both apoE and lipoprotein lipase (LPL). In the present study we investigated the effect of the isoform and the amount of apoE per particle, as well as the role of LPL on the binding of beta-VLDL to HSPG. Therefore, we isolated beta-VLDL from transgenic mice, expressing either APOE*2(Arg158-->Cys) or APOE*3-Leiden (E2-VLDL and E3Leiden-VLDL, respectively), as well as from apoE-deficient mice containing no apoE at all (Enull-VLDL). In the absence of LPL, the binding affinity and maximal binding capacity of all beta-VLDL samples for HSPG-coated microtiter plates was very low. Addition of LPL to this cell-free system resulted in a 12- to 55-fold increase in the binding affinity and a 7- to 15-fold increase in the maximal binding capacity (Bmax). In the presence of LPL, the association constant (Ka) tended to increase in the order Enull-VLDLapproximately E2-VLDLbinding of beta-VLDL samples to J774 cells similar to that found for the binding to HSPG-LPL complexes. Our results indicate that both Ka and Bmax for binding of beta-VLDL to HSPG are increased more than 1 order of magnitude on addition of LPL. In addition, for the binding of beta-VLDL to HSPG-LPL complexes, the presence of apoE is not a prerequisite, but results in an increased binding affinity, depending on the apoE isoform used.

  6. Library Binding Manual. Revised Edition.

    Science.gov (United States)

    Lakhanpal, S. K.

    This procedural manual is designed to be used in bindery sections in public, university and special libraries. It briefly discusses these general matters: administrative control; selection of a binder; when and what to bind; conventional binding; routines; missing issues; schedule for shipments; temporary binding; rare books, maps and newspapers;…

  7. Rapid Cycling and Its Treatment

    Science.gov (United States)

    ... Announcements Public Service Announcements Partnering with DBSA Rapid Cycling and its Treatment What is bipolar disorder? Bipolar ... to Depression and Manic Depression . What is rapid cycling? Rapid cycling is defined as four or more ...

  8. Approximate Controllability of Abstract Discrete-Time Systems

    Directory of Open Access Journals (Sweden)

    Cuevas Claudio

    2010-01-01

    Full Text Available Approximate controllability for semilinear abstract discrete-time systems is considered. Specifically, we consider the semilinear discrete-time system , , where are bounded linear operators acting on a Hilbert space , are -valued bounded linear operators defined on a Hilbert space , and is a nonlinear function. Assuming appropriate conditions, we will show that the approximate controllability of the associated linear system implies the approximate controllability of the semilinear system.

  9. Upper bounds on minimum cardinality of exact and approximate reducts

    KAUST Repository

    Chikalov, Igor

    2010-01-01

    In the paper, we consider the notions of exact and approximate decision reducts for binary decision tables. We present upper bounds on minimum cardinality of exact and approximate reducts depending on the number of rows (objects) in the decision table. We show that the bound for exact reducts is unimprovable in the general case, and the bound for approximate reducts is almost unimprovable in the general case. © 2010 Springer-Verlag Berlin Heidelberg.

  10. Algebraic Approximation A Guide to Past and Current Solutions

    CERN Document Server

    Bustamante, Jorge

    2012-01-01

    This book contains an exposition of several results related with direct and converse theorems in the theory of approximation by algebraic polynomials in a finite interval. In addition, some facts concerning trigonometric approximation that are necessary for motivation and comparisons are included. The selection of papers that are referenced and discussed document some trends in polynomial approximation from the 1950s to the present day.

  11. Learning graphical model parameters with approximate marginal inference.

    Science.gov (United States)

    Domke, Justin

    2013-10-01

    Likelihood-based learning of graphical models faces challenges of computational complexity and robustness to model misspecification. This paper studies methods that fit parameters directly to maximize a measure of the accuracy of predicted marginals, taking into account both model and inference approximations at training time. Experiments on imaging problems suggest marginalization-based learning performs better than likelihood-based approximations on difficult problems where the model being fit is approximate in nature.

  12. Approximation for a large-angle simple pendulum period

    Energy Technology Data Exchange (ETDEWEB)

    Belendez, A; Rodes, J J; Belendez, T; Hernandez, A [Departamento de Fisica, IngenierIa de Sistemas y TeorIa de la Senal, Universidad de Alicante, Apartado 99, E-03080 Alicante (Spain)], E-mail: a.belendez@ua.es

    2009-03-15

    An approximation scheme to obtain the period for large amplitude oscillations of a simple pendulum is analysed and discussed. The analytical approximate formula for the period is the same as that suggested by Hite (2005 Phys. Teach. 43 290), but it is now obtained analytically by means of a term-by-term comparison of the power-series expansion for the approximate period with the corresponding series for the exact period. (letters and comments)

  13. Approximations of continuous Newton's method: An extension of Cayley's problem

    Directory of Open Access Journals (Sweden)

    Jon Jacobsen

    2007-02-01

    Full Text Available Continuous Newton's Method refers to a certain dynamical system whose associated flow generically tends to the roots of a given polynomial. An Euler approximation of this system, with step size $h=1$, yields the discrete Newton's method algorithm for finding roots. In this note we contrast Euler approximations with several different approximations of the continuous ODE system and, using computer experiments, consider their impact on the associated fractal basin boundaries of the roots.

  14. Plasmodium vivax Duffy binding protein peptides specifically bind to reticulocytes.

    Science.gov (United States)

    Ocampo, Marisol; Vera, Ricardo; Eduardo Rodriguez, Luis; Curtidor, Hernando; Urquiza, Mauricio; Suarez, Jorge; Garcia, Javier; Puentes, Alvaro; Lopez, Ramsés; Trujillo, Mary; Torres, Elizabeth; Patarroyo, Manuel Elkin

    2002-01-01

    Plasmodium vivax Duffy Binding Protein (Pv-DBP) is essential during merozoite invasion of reticulocytes. Reticulocyte binding region identification is important for understanding Pv-DBP reticulocyte recognition. Fifty 20 mer non-overlapping peptides, spanning Pv-DBP sequences, were tested in erythrocyte and reticulocyte binding assays. Ten HARBPs, mainly located in region II (Kd 50-130 nM), were High Activity Reticulocyte Binding Peptides (HARBPs); one bound to erythrocytes. Reticulocyte trypsin-, chymotrypsin- or neuraminidase- treatment affects HARBP binding differently, suggesting that these peptides have different reticulocyte-binding-sites. Some peptides bound to a Coomasie non-stainable 40 Kda band. Some HARBPs were able to block recombinant PvRII binding (Pv-DBP region II) to Duffy positive reticulocytes.

  15. Transthyretin-Binding Activity of Contaminants in Blood from Polar Bear (Ursus maritimus) Cubs

    NARCIS (Netherlands)

    Bytingsvik, J.; Simon, E.; Leonards, P.E.G.; Lamoree, M.H.; Lie, E.; Aars, J.; Derocher, A. E.; Wiig, O.; Jenssen, B.M.; Hamers, T.

    2013-01-01

    We determined the transthyretin (TTR)-binding activity of blood-accumulating contaminants in blood plasma samples of approximately 4-months-old polar bear (Ursus maritimus) cubs from Svalbard sampled in 1998 and 2008. The TTR-binding activity was measured as thyroxine (T4)-like equivalents (T4-EQ

  16. Perturbative corrections for approximate inference in gaussian latent variable models

    DEFF Research Database (Denmark)

    Opper, Manfred; Paquet, Ulrich; Winther, Ole

    2013-01-01

    orders, corrections of increasing polynomial complexity can be applied to the approximation. The second order provides a correction in quadratic time, which we apply to an array of Gaussian process and Ising models. The corrections generalize to arbitrarily complex approximating families, which we...... illustrate on tree-structured Ising model approximations. Furthermore, they provide a polynomial-time assessment of the approximation error. We also provide both theoretical and practical insights on the exactness of the EP solution. © 2013 Manfred Opper, Ulrich Paquet and Ole Winther....

  17. Dynamic obstacle avoidance using Bayesian Occupancy Filter and approximate inference

    National Research Council Canada - National Science Library

    Llamazares, Angel; Ivan, Vladimir; Molinos, Eduardo; Ocaña, Manuel; Vijayakumar, Sethu

    2013-01-01

    .... While several obstacle avoidance systems have been presented in the literature addressing safety and optimality of the robot motion separately, we have applied the approximate inference framework...

  18. Orthogonal polynomial approximation in higher dimensions: Applications in astrodynamics

    Science.gov (United States)

    Bani Younes, Ahmad Hani Abd Alqader

    We propose novel methods to utilize orthogonal polynomial approximation in higher dimension spaces, which enable us to modify classical differential equation solvers to perform high precision, long-term orbit propagation. These methods have immediate application to efficient propagation of catalogs of Resident Space Objects (RSOs) and improved accounting for the uncertainty in the ephemeris of these objects. More fundamentally, the methodology promises to be of broad utility in solving initial and two point boundary value problems from a wide class of mathematical representations of problems arising in engineering, optimal control, physical sciences and applied mathematics. We unify and extend classical results from function approximation theory and consider their utility in astrodynamics. Least square approximation, using the classical Chebyshev polynomials as basis functions, is reviewed for discrete samples of the to-be-approximated function. We extend the orthogonal approximation ideas to n-dimensions in a novel way, through the use of array algebra and Kronecker operations. Approximation of test functions illustrates the resulting algorithms and provides insight into the errors of approximation, as well as the associated errors arising when the approximations are differentiated or integrated. Two sets of applications are considered that are challenges in astrodynamics. The first application addresses local approximation of high degree and order geopotential models, replacing the global spherical harmonic series by a family of locally precise orthogonal polynomial approximations for efficient computation. A method is introduced which adapts the approximation degree radially, compatible with the truth that the highest degree approximations (to ensure maximum acceleration error < 10-9 ms-2, globally) are required near the Earths surface, whereas lower degree approximations are required as radius increases. We show that a four order of magnitude speedup is

  19. Approximation of quadrilaterals by rational quadrilaterals in the plane

    Indian Academy of Sciences (India)

    Keywords. Rational triangles and quadrilaterals; rational approximability of polygons; rational points on quartic curves; elliptic curves; torsion points; rational points on varieties and their density.

  20. New Approach to Fractal Approximation of Vector-Functions

    National Research Council Canada - National Science Library

    Igudesman, Konstantin; Davletbaev, Marsel; Shabernev, Gleb

    2015-01-01

      This paper introduces new approach to approximation of continuous vector-functions and vector sequences by fractal interpolation vector-functions which are multidimensional generalization of fractal...

  1. Rapid manufacturing for microfluidics

    CSIR Research Space (South Africa)

    Land, K

    2012-10-01

    Full Text Available . Microfluidics is at the forefront of developing solutions for drug discovery, diagnostics (from glucose tests to malaria and TB testing) and environmental diagnostics (E-coli monitoring of drinking water). In order to quickly implement new designs, a rapid...

  2. Rapid Prototyping in PVS

    Science.gov (United States)

    Munoz, Cesar A.; Butler, Ricky (Technical Monitor)

    2003-01-01

    PVSio is a conservative extension to the PVS prelude library that provides basic input/output capabilities to the PVS ground evaluator. It supports rapid prototyping in PVS by enhancing the specification language with built-in constructs for string manipulation, floating point arithmetic, and input/output operations.

  3. Rapid Prototyping Reconsidered

    Science.gov (United States)

    Desrosier, James

    2011-01-01

    Continuing educators need additional strategies for developing new programming that can both reduce the time to market and lower the cost of development. Rapid prototyping, a time-compression technique adapted from the high technology industry, represents one such strategy that merits renewed evaluation. Although in higher education rapid…

  4. Characterization of the carbohydrate binding specificity and kinetic parameters of lectins by using surface plasmon resonance

    NARCIS (Netherlands)

    Vliegenthart, J.F.G.; Haseley, S.R.; Talaga, P.; Kamerling, J.P.

    1999-01-01

    An accurate, rapid, and sensitive method for characterizing the carbohydrate binding properties of lectins using a BIAcore apparatus and the detection method of surface plasmon resonance is described. As a model study, the sialic acid binding lectins from Sambucus nigra and Maackia amurensis, which

  5. A rapid electrochemical biosensor based on an AC electrokinetics enhanced immuno-reaction.

    Science.gov (United States)

    Cheng, I-Fang; Yang, Hsiao-Lan; Chung, Cheng-Che; Chang, Hsien-Chang

    2013-08-21

    Fluorescent labelling and chromogenic reactions that are commonly used in conventional immunoassays typically utilize diffusion dominated transport of analytes, which is limited by slow reaction rates and long detection times. By integrating alternating current (AC) electrokinetics and electrochemical impedance spectroscopy (EIS), we construct an immunochip for rapid, sensitive, and label-free detection. AC electroosmosis (ACEO) and positive dielectrophoresis (DEP), induced by a biased AC electric field, can rapidly convect and trap the analyte onto an EIS working electrode within a few minutes. This allows the change of electron-transfer resistance (ΔRet) caused by the antibody-antigen (IgG-protein A) binding to be measured and quantified in real time. The measured impedance change achieves a plateau after electrokinetic concentration for only 90 s, and the detection limit is able to reach 200 pg ml⁻¹. Compared to the conventional incubation method, the electrokinetics-enhanced method is approximately 100 times faster in its reaction time, and the detection limit is reduced by 30 times. The ΔRet of the positive response is two orders of magnitude higher than the negative control, demonstrating excellent specificity for practical applications.

  6. Carboplatin binding to histidine

    Energy Technology Data Exchange (ETDEWEB)

    Tanley, Simon W. M. [University of Manchester, Brunswick Street, Manchester M13 9PL (United Kingdom); Diederichs, Kay [University of Konstanz, D-78457 Konstanz (Germany); Kroon-Batenburg, Loes M. J. [Utrecht University, Padualaan 8, 3584 CH Utrecht (Netherlands); Levy, Colin [University of Manchester, 131 Princess Street, Manchester M1 7DN (United Kingdom); Schreurs, Antoine M. M. [Utrecht University, Padualaan 8, 3584 CH Utrecht (Netherlands); Helliwell, John R., E-mail: john.helliwell@manchester.ac.uk [University of Manchester, Brunswick Street, Manchester M13 9PL (United Kingdom)

    2014-08-29

    An X-ray crystal structure showing the binding of purely carboplatin to histidine in a model protein has finally been obtained. This required extensive crystallization trials and various novel crystal structure analyses. Carboplatin is a second-generation platinum anticancer agent used for the treatment of a variety of cancers. Previous X-ray crystallographic studies of carboplatin binding to histidine (in hen egg-white lysozyme; HEWL) showed the partial conversion of carboplatin to cisplatin owing to the high NaCl concentration used in the crystallization conditions. HEWL co-crystallizations with carboplatin in NaBr conditions have now been carried out to confirm whether carboplatin converts to the bromine form and whether this takes place in a similar way to the partial conversion of carboplatin to cisplatin observed previously in NaCl conditions. Here, it is reported that a partial chemical transformation takes place but to a transplatin form. Thus, to attempt to resolve purely carboplatin binding at histidine, this study utilized co-crystallization of HEWL with carboplatin without NaCl to eliminate the partial chemical conversion of carboplatin. Tetragonal HEWL crystals co-crystallized with carboplatin were successfully obtained in four different conditions, each at a different pH value. The structural results obtained show carboplatin bound to either one or both of the N atoms of His15 of HEWL, and this particular variation was dependent on the concentration of anions in the crystallization mixture and the elapsed time, as well as the pH used. The structural details of the bound carboplatin molecule also differed between them. Overall, the most detailed crystal structure showed the majority of the carboplatin atoms bound to the platinum centre; however, the four-carbon ring structure of the cyclobutanedicarboxylate moiety (CBDC) remained elusive. The potential impact of the results for the administration of carboplatin as an anticancer agent are described.

  7. Binding site distribution of nuclear transport receptors and transport complexes in single nuclear pore complexes.

    Science.gov (United States)

    Kahms, Martin; Lehrich, Philipp; Hüve, Jana; Sanetra, Nils; Peters, Reiner

    2009-09-01

    Transport through the nuclear pore complex (NPC) involves a large channel and an abundance of binding sites for nuclear transport receptors (NTRs). However, the mechanistically important distribution of NTR-binding sites along the channel is vividly debated. In this study, we visualized binding site distributions directly by two complementary optical super-resolution methods, single-molecule microscopy and 4Pi microscopy. First, we analyzed the distribution of RanGDP because this important nuclear transport substrate has two types of binding sites at the NPC, direct and indirect, NTR-mediated sites. We found that the direct binding sites had a maximum at approximately -30 nm with regard to the NPC center, whereas the indirect transport-relevant binding sites peaked at approximately -10 nm. The 20 nm-shift could be only resolved by 4Pi microscopy because of a two to threefold improved localization precision as compared with single-molecule microscopy. Then we analyzed the distribution of the NTR Kapbeta1 and a Kapbeta1-based transport complex and found them to have also binding maxima at approximately -10 nm. These observations support transport models in which NTR binding sites are distributed all along the transport channel and argue against models in which the cytoplasmic entrance of the channel is surrounded by a large cloud of binding sites.

  8. Radiotracer binding to brain microsomes determined by thin-layer chromatography

    Energy Technology Data Exchange (ETDEWEB)

    Zamora, P.O.; Stratesteffan, M.; Guhlke, S.; Sass, K.S.; Cardillo, A.; Bender, H.; Biersack, H.J

    1996-01-01

    A thin-layer chromatography (TLC) assay was developed to monitor the interaction of radiotracers with brain microsomes. Murine brain microsomes were coated onto a zone of a TLC strip, the unreacted sites blocked with gelatin, and the radiotracers chromatographed over the microsomes. Radiotracers bound to the microsomes and were separated from the unreacted materials which migrated at or near the solvent front. Up to 80% of the applied radioactivity bound to the brain microsomes when using {sup 99m}Tc-(d,l) hexamethyl-propyleneamine oxime (HMPAO) and {sup 123}I-(S)-2-hydroxy-3-iodo-6-methoxy-N-[(1-ethyl-2-pyrrolidinyl)methyl]- benzamide ({sup 123}I-IBZM) as tracers. On the other hand, the presumptive negative control materials p-I-15-phenyl-pentadecanoic acid-{sup 123}I ({sup I}I-IPPA) and {sup 99m}Tc-mercapto-acetyl triglycine (MAG3) bound poorly (7% and 4%, respectively). {sup 99m}Tc-ethyl cysteinate dimer (ECD) interacted poorly (9.9%), a result thought to be consistent with its known inability to be metabolized by nonprimate brain tissue. Radiolabeled octreotide analogues (radiolabeled with {sup 111}In, I-131 or {sup 99m}Tc) also bound, and the binding could be reduced by excess unlabeled octreotide. Also, chemical modification by acylation of Lys{sup 5} in {sup 111}In-labeled octreotide led to decreased binding (approximately 70%) compared to the original radiotracer. Chromatography of the various radiotracers over TLC strips coated only with gelatin was used to monitor nonspecific binding and was low and frequently below 5%. This technique does not require wash steps or centrifugation, and assays are rapidly completed. The assay could be useful in monitoring the interaction of radiotracers with brain microsomes and in evaluating and developing new radiotracers.

  9. Two different proteins that compete for binding to thrombin have opposite kinetic and thermodynamic profiles.

    Science.gov (United States)

    Baerga-Ortiz, Abel; Bergqvist, Simon; Mandell, Jeffrey G; Komives, Elizabeth A

    2004-01-01

    Thrombin binds thrombomodulin (TM) at anion binding exosite 1, an allosteric site far from the thrombin active site. A monoclonal antibody (mAb) has been isolated that competes with TM for binding to thrombin. Complete binding kinetic and thermodynamic profiles for these two protein-protein interactions have been generated. Binding kinetics were measured by Biacore. Although both interactions have similar K(D)s, TM binding is rapid and reversible while binding of the mAb is slow and nearly irreversible. The enthalpic contribution to the DeltaG(bind) was measured by isothermal titration calorimetry and van't Hoff analysis. The contribution to the DeltaG(bind) from electrostatic steering was assessed from the dependence of the k(a) on ionic strength. Release of solvent H(2)O molecules from the interface was assessed by monitoring the decrease in amide solvent accessibility at the interface upon protein-protein binding. The mAb binding is enthalpy driven and has a slow k(d). TM binding appears to be entropy driven and has a fast k(a). The favorable entropy of the thrombin-TM interaction seems to be derived from electrostatic steering and a contribution from solvent release. The two interactions have remarkably different thermodynamic driving forces for competing reactions. The possibility that optimization of binding kinetics for a particular function may be reflected in different thermodynamic driving forces is discussed.

  10. Evaluation of binding strength depending on the adhesive binding methods

    Directory of Open Access Journals (Sweden)

    Suzana Pasanec Preprotić

    2015-05-01

    Full Text Available A book with a personal value is worth remembering since it represents specific interests of an individual - author of the book. Therefore the original is the first issue of a book which is always bound manually. Due to cost-effectiveness, adhesive binding is most commonly used in author’s edition in paperback and hardback. Adhesive binding methods differ only if a paper leaf is a binding unit in adhesive binding form. The subject of the research is the quality of book block binding for two binding methods with/without mull fabric. The assumption is that double-fan adhesive binding method shows an extraordinary binding quality as compared to the rough spine method. For the needs of this research book block parameters remained unaltered: paper type, size and book volume. The results related to strength were obtained by using an experimental method of tensile strength for individual paper leaves. The rating of book block quality was conducted in accordance with FOGRA Nr.71006 guidelines for page pull-test. Furthermore, strength results for both methods were compared in order to evaluate the importance of changing the quality of adhesive binding. Statistical method ANOVA analysis of variance and Fisher’s F-test were used to evaluate the quality of book block binding.

  11. Merging Belief Propagation and the Mean Field Approximation

    DEFF Research Database (Denmark)

    Riegler, Erwin; Kirkelund, Gunvor Elisabeth; Manchón, Carles Navarro

    2010-01-01

    We present a joint message passing approach that combines belief propagation and the mean field approximation. Our analysis is based on the region-based free energy approximation method proposed by Yedidia et al., which allows to use the same objective function (Kullback-Leibler divergence) as a ...

  12. Practical error analysis of the quasi-steady-state approximation ...

    African Journals Online (AJOL)

    The Quasi-Steady-State Approximation (QSSA) is a method of getting approximate solutions to differential equations, developed heuristically in biochemistry early this century. It can produce acceptable and important results even when formal analytic and numerical procedures fail. It has become associated with singular ...

  13. Efficient algorithms for approximate time separation of events

    Indian Academy of Sciences (India)

    Asynchronous systems; timing analysis and verification; approximate algorithms; convex approximation; time separation of events; bounded delay timing analysis. ... A complete asynchronous chip has been modelled and analysed using the proposed technique, revealing potential timing problems (already known to ...

  14. Efficient approximation of black-box functions and Pareto sets

    NARCIS (Netherlands)

    Rennen, G.

    2009-01-01

    In the case of time-consuming simulation models or other so-called black-box functions, we determine a metamodel which approximates the relation between the input- and output-variables of the simulation model. To solve multi-objective optimization problems, we approximate the Pareto set, i.e. the

  15. Finite approximate controllability for semilinear heat equations in noncylindrical domains

    Directory of Open Access Journals (Sweden)

    Menezes Silvano B. de

    2004-01-01

    Full Text Available We investigate finite approximate controllability for semilinear heat equation in noncylindrical domains. First we study the linearized problem and then by an application of the fixed point result of Leray-Schauder we obtain the finite approximate controllability for the semilinear state equation.

  16. Dynamic and approximate pattern matching in 2D

    DEFF Research Database (Denmark)

    Clifford, Raphaël; Fontaine, Allyx; Starikovskaya, Tatiana

    2016-01-01

    distance. - Extending this work to allow approximation, we give an efficient algorithm which returns a (1+ε) approximation of the Hamming distance at a given location in O(ε−2 log2 m log log n) time. Finally, we consider a different setting inspired by previous work on locality sensitive hashing (LSH...

  17. Approximation of functions of two variables by certain linear positive ...

    Indian Academy of Sciences (India)

    We introduce certain linear positive operators and study some approximation properties of these operators in the space of functions, continuous on a compact set, of two variables. We also find the order of this approximation by using modulus of continuity. Moreover we define an th order generalization of these operators ...

  18. A-Statistical extension of the Korovkin type approximation theorem

    Indian Academy of Sciences (India)

    type approximation theory is a well-established area of research, which deals with the problem of approximating a function f by means of a sequence {Lnf } of positive lin- ear operators. Statistical convergence, which was introduced nearly fifty years ago, has only recently become an area of active research. Especially it has ...

  19. Hermite-distributed approximating functional-based formulation of ...

    Indian Academy of Sciences (India)

    2016-07-29

    Jul 29, 2016 ... 34 Page 2 of 8. Pramana – J. Phys. (2016) 87: 34. 2. The method. We have employed Hermite-distributed approximating functionals (HDAF) to approximate the Hamiltonian in coordinate representation. The HDAF space discretiza- tion of the kinetic energy operator on a regular grid consists of. −. ¯h2. 2m.

  20. Space-efficient path-reporting approximate distance oracles

    DEFF Research Database (Denmark)

    Elkin, Michael; Neiman, Ofer; Wulff-Nilsen, Christian

    2016-01-01

    We consider approximate path-reporting distance oracles, distance labeling and labeled routing with extremely low space requirements, for general undirected graphs. For distance oracles, we show how to break the nlog⁡n space bound of Thorup and Zwick if approximate paths rather than distances need...

  1. Approximating Exponential and Logarithmic Functions Using Polynomial Interpolation

    Science.gov (United States)

    Gordon, Sheldon P.; Yang, Yajun

    2017-01-01

    This article takes a closer look at the problem of approximating the exponential and logarithmic functions using polynomials. Either as an alternative to or a precursor to Taylor polynomial approximations at the precalculus level, interpolating polynomials are considered. A measure of error is given and the behaviour of the error function is…

  2. Approximate first integrals of a chaotic Hamiltonian system | Unal ...

    African Journals Online (AJOL)

    Approximate first integrals (conserved quantities) of a Hamiltonian dynamical system with two-degrees of freedom which arises in the modeling of galaxy have been obtained based on the approximate Noether symmetries for the resonance ω1 = ω2. Furthermore, Kolmogorov-Arnold-Moser (KAM) curves have been ...

  3. Fifth International Conference on "Approximation and Optimization in the Caribbean"

    CERN Document Server

    Approximation, Optimization and Mathematical Economic

    2001-01-01

    The articles in this proceedings volume reflect the current trends in the theory of approximation, optimization and mathematical economics, and include numerous applications. The book will be of interest to researchers and graduate students involved in functional analysis, approximation theory, mathematical programming and optimization, game theory, mathematical finance and economics.

  4. Approximation of the inverse G-frame operator

    Indian Academy of Sciences (India)

    In this paper, we introduce the concept of (strong) projection method for -frames which works for all conditional -Riesz frames. We also derive a method for approximation of the inverse -frame operator which is efficient for all -frames. We show how the inverse of -frame operator can be approximated as close as we ...

  5. Approximations in fusion and breakup reactions induced by radioactive beams

    Energy Technology Data Exchange (ETDEWEB)

    Cardenas, W.H.Z.; Carlin Filho, N.; Hussein, M.S. [Sao Paulo Univ., SP (Brazil). Inst. de Fisica; Canto, L.F.; Donangelo, R. [Universidade Federal, Rio de Janeiro, RJ (Brazil). Inst. de Fisica; Lubian, J. [Universidade Federal Fluminense, Niteroi, RJ (Brazil). Inst. de Fisica; Centro de Aplicaciones Tecnologicas y Desarrollo Nuclear (CEADEN), Havana (Cuba); Romanelli, A. [Facultad de Ingenieria, Montevideo (Uruguay). Inst. de Fisica

    2000-07-01

    Some commonly used approximations for complete fusion and breakup transmission coefficients in collisions of weakly bound projectiles at near barrier energies are assessed. We show that they strongly depend on the adopted classical trajectory and can be significantly improved with proper treatment of the incident and emergent currents in the WKB approximation. (author)

  6. An approximation algorithm for the wireless gathering problem

    NARCIS (Netherlands)

    Bonifaci, V.; Korteweg, P.; Marchetti Spaccamela, A.; Stougie, L.

    2008-01-01

    The Wireless Gathering Problem is to find an interference-free schedule for data gathering in a wireless network in minimum time. We present a 4-approximate polynomial-time on-line algorithm for this NP-hard problem. We show that no shortest path following algorithm can have an approximation ratio

  7. Single kick approximations for beam-beam deflections

    Directory of Open Access Journals (Sweden)

    Takahiko Koyama

    1999-02-01

    Full Text Available A six-dimensional symplectic beam-beam interaction map using finite discrete slices of a strong beam is extended to infinitesimal slices. The new map is calculated under the assumption of a longitudinal Gaussian distribution with approximations. A round Gaussian beam is simulated to demonstrate accuracies of the approximations.

  8. Perturbation approximation for orbits in axially symmetric funnels

    Science.gov (United States)

    Nauenberg, Michael

    2014-11-01

    A perturbation method that can be traced back to Isaac Newton is applied to obtain approximate analytic solutions for objects sliding in axially symmetric funnels in near circular orbits. Some experimental observations are presented for balls rolling in inverted cones with different opening angles, and in a funnel with a hyperbolic surface that approximately simulates the gravitational force.

  9. An Approximation Algorithm for the Capacitated Arc Routing Problem

    DEFF Research Database (Denmark)

    Wøhlk, Sanne

    2008-01-01

    In this paper we consider approximation of the Capacitated Arc Routing Problem, which is the problem of servicing a set of edges in a graph using a fleet of capacity constrained vehicles. We present a 7/2 - 3/W-approximation algorithm for the problem and prove that this algorithm outperforms...

  10. A linear approach to shape preserving spline approximation

    NARCIS (Netherlands)

    Kuijt, F.; van Damme, Rudolf M.J.

    2001-01-01

    This paper deals with the approximation of a given large scattered univariate or bivariate data set that possesses certain shape properties, such as convexity, monotonicity, and/or range restrictions. The data are approximated for instance by tensor-product B-splines preserving the shape

  11. Saddlepoint Approximations for Expectations and an Application to CDO Pricing

    NARCIS (Netherlands)

    Huang, X.; Oosterlee, C.W.

    2011-01-01

    We derive two types of saddlepoint approximations for expectations in the form of E[(X - K)+], where X is the sum of n independent random variables and K is a known constant. We establish error convergence rates for both types of approximations in the independently and identically distributed case.

  12. Approximate solutions of the Wei Hua oscillator using the Pekeris ...

    Indian Academy of Sciences (India)

    to the orbital centrifugal term. Solutions of the corresponding hyper-radial equation are obtained using the conventional Nikiforov–Uvarov (NU) method. Keywords. Nikiforov–Uvarov (NU) method; N-dimensional Schrödinger equation; approximate solution through Pekeris approximation. PACS No. 03.65.Ge. 1. Introduction.

  13. The second Born approximation of electron–argon elastic scattering ...

    Indian Academy of Sciences (India)

    We evaluate the S-matrix elements numerically. The dependence of differential cross-section on the relative phase between the two laser components is presented. The results obtained in the first and second Born approximations are compared and analysed. Keywords. Second Born approximation; free–free transition; ...

  14. The second Born approximation of electron–argon elastic scattering ...

    Indian Academy of Sciences (India)

    We study the elastic scattering of atomic argon by electron in the presence of a bichromatic laser field in the second Born approximation. The target atom is approximated by a simple screening potential and the continuum states of the impinging and emitting electrons are described as Volkov states. We evaluate the S-matrix ...

  15. Local Approximation Schemes for Ad Hoc and Sensor Networks

    NARCIS (Netherlands)

    Kuhn, F.; Moscibroda, T.; Nieberg, T.; Wattenhofer, R.; Banerjee, S; Ganguly, S.

    2005-01-01

    We present two local approaches that yield polynomial-time approximation schemes (PTAS) for the Maximum Independent Set and Minimum Dominating Set problem in unit disk graphs. The algorithms run locally in each node and compute a (1+ε)-approximation to the problems at hand for any given ε > 0. The

  16. Delta-function Approximation SSC Model in 3C 273

    Indian Academy of Sciences (India)

    We obtain an approximate analytical solution using approximate calculation on the traditional one-zone synchrotron self-Compton (SSC) model. In this model, we describe the electron energy distribution by a broken power-law function with a sharp cut-off, and non-thermal photons are produced by both synchrotron and ...

  17. APPECT: An Approximate Backbone-Based Clustering Algorithm for Tags

    DEFF Research Database (Denmark)

    Zong, Yu; Xu, Guandong; Jin, Pin

    2011-01-01

    Agglomerative Clustering on tagging data, which possess the inherent drawbacks, such as the sensitivity of initialization. In this paper, we instead make use of the approximate backbone of tag clustering results to find out better tag clusters. In particular, we propose an APProximate backbonE-based Clustering...

  18. Breakdown of Modulational Approximations in Nonlinear Wave Interaction

    CERN Document Server

    Gerhardt, L; Barbedo-Rizzato, F; Lopes, S R

    1999-01-01

    In this work we investigate the validity limits of the modulational approximation as a method to describe the nonlinear interaction of conservative wave fields. We focus on a nonlinear Klein-Gordon equation and suggest that the breakdown of the approximation is accompanied by a transition to regimes of spatiotemporal chaos.

  19. Kinetics of calcium binding to dental biofilm bacteria.

    Science.gov (United States)

    Leitão, Tarcísio Jorge; Cury, Jaime Aparecido; Tenuta, Livia Maria Andaló

    2018-01-01

    Dental biofilm bacteria can bind calcium ions and release them during a pH drop, which could decrease the driving force for dental demineralization (i.e. hydroxyapatite dissolution) occurring at reduced pHs. However, the kinetics of this binding and release is not completely understood. Here we validated a method to evaluate the kinetics of calcium binding and release to/from Streptococcus mutans, and estimated the importance of this reservoir as a source of ions. The kinetics of calcium binding was assessed by measuring the amount of bound calcium in S. mutans Ingbrit 1600 pellets treated with PIPES buffer, pH 7.0, containing 1 or 10 mM Ca; for the release kinetics, bacterial pellets previously treated with 1 mM or 10 mM Ca were exposed to the calcium-free or 1 mM Ca PIPES buffer, pH 7.0, for up to 60 min. Binding and release curves were constructed and parameters of kinetics were calculated. Also, calcium release was assessed by exposing pellets previously treated with calcium to a pH 5.0 buffer for 10 min. Calcium binding to bacteria was concentration-dependent and rapid, with maximum binding reached at 5 min. On the other hand, calcium release was slower, and according to the calculations, would never be complete in the groups pretreated with 10 mM Ca. Decreasing pH from 7.0 to 5.0 caused a release of calcium able to increase the surrounding fluid calcium concentration in 2 mM. The results suggest that dental biofilm bacteria may act as a calcium reservoir, rapidly binding ions from surrounding fluids, releasing them slowly at neutral pH and promptly during a pH drop.

  20. The log-linear return approximation, bubbles, and predictability

    DEFF Research Database (Denmark)

    Engsted, Tom; Pedersen, Thomas Quistgaard; Tanggaard, Carsten

    We study in detail the log-linear return approximation introduced by Campbell and Shiller (1988a). First, we derive an upper bound for the mean approximation error, given stationarity of the log dividendprice ratio. Next, we simulate various rational bubbles which have explosive conditional...... expectation, and we investigate the magnitude of the approximation error in those cases. We find that surprisingly the Campbell-Shiller approximation is very accurate even in the presence of large explosive bubbles. Only in very large samples do we find evidence that bubbles generate large approximation...... errors. Finally,we show that a bubble model in which expected returns are constant can explain the predictability of stock returns from the dividend-price ratio that many previous studies have documented....

  1. The Log-Linear Return Approximation, Bubbles, and Predictability

    DEFF Research Database (Denmark)

    Engsted, Tom; Pedersen, Thomas Quistgaard; Tanggaard, Carsten

    2012-01-01

    We study in detail the log-linear return approximation introduced by Campbell and Shiller (1988a). First, we derive an upper bound for the mean approximation error, given stationarity of the log dividend-price ratio. Next, we simulate various rational bubbles which have explosive conditional...... expectation, and we investigate the magnitude of the approximation error in those cases. We …nd that surprisingly the Campbell-Shiller approximation is very accurate even in the presence of large explosive bubbles. Only in very large samples do we …nd evidence that bubbles generate large approximation errors....... Finally, we show that a bubble model in which expected returns are constant can explain the predictability of stock returns from the dividend-price ratio that many previous studies have documented....

  2. Plasma fluid modeling of microwave streamers: Approximations and accuracy

    Science.gov (United States)

    Arcese, Emanuele; Rogier, François; Boeuf, Jean-Pierre

    2017-11-01

    Fluid models of microwave streamers at 110 GHz in atmospheric pressure air predict the formation of filamentary plasma patterns that show a good qualitative agreement with experiments. In order to perform more quantitative comparisons with experiments, in this paper, we study the consequences of different types of approximations that are generally used in the fluid models. We consider here the streamer dynamics before gas heating effects become important, i.e., the first few tens of ns after breakdown at atmospheric pressure. The influence on the results of the local effective field approximation vs. the local mean energy approximation is analyzed in detail. Other approximations that are related to the choice and method of calculation of electron transport parameters are also discussed. It is shown that the local effective field approximation is rather good for a large range of conditions of high frequency breakdown at atmospheric pressure in air while the results may be very sensitive to the choice of transport coefficients.

  3. Hopping currents in the intrinsic region of III-N-V quantum well structures in the tight binding approximation

    Energy Technology Data Exchange (ETDEWEB)

    Varonides, Argyrios C.; Spalletta, Robert A. [Department of Physics and Electrical Engineering, University of Scranton, A Jesuit University, Scranton, PA 18510 (United States)

    2008-07-01

    We calculate for the first time Nearest Neighbor Hopping (NNH) current densities for III-N-V heterostructures embedded in the intrinsic layer of p-i-n geometries. We start from a general formalism that relates the density of states in individual wells with the transition probabilities from a quantum well state to a neighboring one, in a superlattice-geometry. In the process, we find and point out the fact that there is zero hopping-current without Fermi level splitting for any two consecutive layers. We then relate the eigen-energies with the transition probabilities and conclude that NNH-currents are of the order of 0.06 mA/cm{sup 2} at the most and in room temperatures, and depend on (a) device geometry (b) temperature (c) conduction band discontinuity and (d) Fermi level splitting. (copyright 2008 WILEY-VCH Verlag GmbH and Co. KGaA, Weinheim) (orig.)

  4. Approximate number word knowledge before the cardinal principle.

    Science.gov (United States)

    Gunderson, Elizabeth A; Spaepen, Elizabet; Levine, Susan C

    2015-02-01

    Approximate number word knowledge-understanding the relation between the count words and the approximate magnitudes of sets-is a critical piece of knowledge that predicts later math achievement. However, researchers disagree about when children first show evidence of approximate number word knowledge-before, or only after, they have learned the cardinal principle. In two studies, children who had not yet learned the cardinal principle (subset-knowers) produced sets in response to number words (verbal comprehension task) and produced number words in response to set sizes (verbal production task). As evidence of approximate number word knowledge, we examined whether children's numerical responses increased with increasing numerosity of the stimulus. In Study 1, subset-knowers (ages 3.0-4.2 years) showed approximate number word knowledge above their knower-level on both tasks, but this effect did not extend to numbers above 4. In Study 2, we collected data from a broader age range of subset-knowers (ages 3.1-5.6 years). In this sample, children showed approximate number word knowledge on the verbal production task even when only examining set sizes above 4. Across studies, children's age predicted approximate number word knowledge (above 4) on the verbal production task when controlling for their knower-level, study (1 or 2), and parents' education, none of which predicted approximation ability. Thus, children can develop approximate knowledge of number words up to 10 before learning the cardinal principle. Furthermore, approximate number word knowledge increases with age and might not be closely related to the development of exact number word knowledge. Copyright © 2014 Elsevier Inc. All rights reserved.

  5. Rapid manufacturing facilitated customisation

    OpenAIRE

    Tuck, Christopher John; Hague, Richard; Ruffo, Massimiliano; Ransley, Michelle; Adams, Paul Russell

    2008-01-01

    Abstract This paper describes the production of body-fitting customised seat profiles utilising the following digital methods: three dimensional laser scanning, reverse engineering and Rapid Manufacturing (RM). The seat profiles have been manufactured in order to influence the comfort characteristics of an existing ejector seat manufactured by Martin Baker Aircraft Ltd. The seat, known as Navy Aircrew Common Ejection Seat (NACES), was originally designed with a generic profile. ...

  6. Rapid Detection of Pathogens

    Energy Technology Data Exchange (ETDEWEB)

    David Perlin

    2005-08-14

    Pathogen identification is a crucial first defense against bioterrorism. A major emphasis of our national biodefense strategy is to establish fast, accurate and sensitive assays for diagnosis of infectious diseases agents. Such assays will ensure early and appropriate treatment of infected patients. Rapid diagnostics can also support infection control measures, which monitor and limit the spread of infectious diseases agents. Many select agents are highly transmissible in the early stages of disease, and it is critical to identify infected patients and limit the risk to the remainder of the population and to stem potential panic in the general population. Nucleic acid-based molecular approaches for identification overcome many of the deficiencies associated with conventional culture methods by exploiting both large- and small-scale genomic differences between organisms. PCR-based amplification of highly conserved ribosomal RNA (rRNA) genes, intergenic sequences, and specific toxin genes is currently the most reliable approach for bacterial, fungal and many viral pathogenic agents. When combined with fluorescence-based oligonucleotide detection systems, this approach provides real-time, quantitative, high fidelity analysis capable of single nucleotide allelic discrimination (4). These probe systems offer rapid turn around time (<2 h) and are suitable for high throughput, automated multiplex operations that are critical for clinical diagnostic laboratories. In this pilot program, we have used molecular beacon technology invented at the Public health Research Institute to develop a new generation of molecular probes to rapidly detect important agents of infectious diseases. We have also developed protocols to rapidly extract nucleic acids from a variety of clinical specimen including and blood and tissue to for detection in the molecular assays. This work represented a cooperative research development program between the Kramer-Tyagi/Perlin labs on probe development

  7. Two different corticosteroid-binding globulin variants that lack cortisol-binding activity in a greek woman.

    Science.gov (United States)

    Hill, L A; Vassiliadi, D A; Simard, M; Pavlaki, A; Perogamvros, I; Hadjidakis, D; Hammond, G L

    2012-11-01

    Corticosteroid-binding globulin (CBG), encoded by SERPINA6, is the principal plasma binding protein for cortisol. Most nonsynonymous single-nucleotide polymorphisms that alter the production or function of CBG occur rarely, and their clinical significance remains obscure. Serum and DNA were obtained from a Greek woman with low morning cortisol levels and from family members. SERPINA6 exons were sequenced, and serum CBG was measured by ELISA and cortisol-binding capacity assay. Recombinant CBG variants were produced for detailed functional studies. A novel heterozygous c.1282G>C transversion in exon 5 of SERPINA6, resulting in a p.Trp393Ser (W371S) substitution, was identified in the proband, who was also heterozygous for single-nucleotide polymorphisms encoding the CBG Lyon (D367N) and CBG A224S variants. The proband had no measurable plasma cortisol-binding activity despite a CBG level of 273 nm by ELISA. She inherited CBG W371S from her mother whose plasma cortisol-binding capacity was approximately 50% lower than the CBG measurements by ELISA (314 nm). The proband's father and four children were heterozygous for CBG D367N; their CBG levels by ELISA were normal, but corresponding cortisol-binding capacity measurements were 50% lower. Pedigree analysis revealed that W371S segregates with A224 and that D367N and W371S segregate separately. Recombinant CBG D367N and CBG W371S had no measureable cortisol-binding activity. A new CBG Athens (W371S) variant that lacks cortisol-binding activity has been identified in a carrier of the cortisol-binding deficient CBG Lyon (D367N) variant. Analyses of CBG levels in this pedigree illustrate how immunoassays fail to accurately reflect cortisol-binding activity.

  8. Tiber Personal Rapid Transit

    Directory of Open Access Journals (Sweden)

    Diego Carlo D'agostino

    2011-02-01

    Full Text Available The project “Tiber Personal Rapid Transit” have been presented by the author at the Rome City Vision Competition1 2010, an ideas competition, which challenges architects, engineers, designers, students and creatives individuals to develop visionary urban proposals with the intention of stimulating and supporting the contemporary city, in this case Rome. The Tiber PRT proposal tries to answer the competition questions with the definition of a provocative idea: a Personal Rapid transit System on the Tiber river banks. The project is located in the central section of the Tiber river and aims at the renewal of the river banks with the insertion of a Personal Rapid Transit infrastructure. The project area include the riverbank of Tiber from Rome Transtevere RFI station to Piazza del Popolo, an area where main touristic and leisure attractions are located. The intervention area is actually no used by the city users and residents and constitute itself a strong barrier in the heart of the historic city.

  9. Enhanced peptide nucleic acid binding to supercoiled DNA: possible implications for DNA "breathing" dynamics

    DEFF Research Database (Denmark)

    Bentin, T; Nielsen, Peter E.

    1996-01-01

    to that of relaxed DNA. The pseudo-first-order rate constant [k psi (sigma)] obeys an exponential function, k psi (sigma) = k psi (lin)e-sigma delta, where delta is a constant of 105 and k psi lin is the rate of PNA binding to linear DNA (sigma = 0). The activation energy [Ea(sigma)] was determined as approximately...... efficient with supercoiled than with linear DNA. In the presence of 140 mM KCI, the PNA binding rate was reduced but, notably, highly dependent on template topology. Negative supercoiling (mean superhelix density, sigma approximately -0.051) increased the rate of binding by 2 orders of magnitude compared...

  10. Mapping biological entities using the longest approximately common prefix method.

    Science.gov (United States)

    Rudniy, Alex; Song, Min; Geller, James

    2014-06-14

    The significant growth in the volume of electronic biomedical data in recent decades has pointed to the need for approximate string matching algorithms that can expedite tasks such as named entity recognition, duplicate detection, terminology integration, and spelling correction. The task of source integration in the Unified Medical Language System (UMLS) requires considerable expert effort despite the presence of various computational tools. This problem warrants the search for a new method for approximate string matching and its UMLS-based evaluation. This paper introduces the Longest Approximately Common Prefix (LACP) method as an algorithm for approximate string matching that runs in linear time. We compare the LACP method for performance, precision and speed to nine other well-known string matching algorithms. As test data, we use two multiple-source samples from the Unified Medical Language System (UMLS) and two SNOMED Clinical Terms-based samples. In addition, we present a spell checker based on the LACP method. The Longest Approximately Common Prefix method completes its string similarity evaluations in less time than all nine string similarity methods used for comparison. The Longest Approximately Common Prefix outperforms these nine approximate string matching methods in its Maximum F1 measure when evaluated on three out of the four datasets, and in its average precision on two of the four datasets.

  11. Megalin binds and mediates cellular internalization of folate binding protein

    DEFF Research Database (Denmark)

    Birn, Henrik; Zhai, Xiaoyue; Holm, Jan

    2005-01-01

    and semen. The function and significance of FBPs are unresolved, however, it has been suggested that they may facilitate folate uptake, e.g. during suckling. The present study shows that megalin, a large, multiligand endocytic receptor and member of the low-density lipoprotein-receptor family, is able...... to bind and mediate cellular uptake of FBP. Surface plasmon resonance analysis shows binding of bovine and human milk FBP to immobilized megalin, but not to low density lipoprotein receptor related protein. Binding of (125)I-labeled folate binding protein (FBP) to sections of kidney proximal tubule, known...

  12. Approximating quantum many-body wave functions using artificial neural networks

    Science.gov (United States)

    Cai, Zi; Liu, Jinguo

    2018-01-01

    In this paper, we demonstrate the expressibility of artificial neural networks (ANNs) in quantum many-body physics by showing that a feed-forward neural network with a small number of hidden layers can be trained to approximate with high precision the ground states of some notable quantum many-body systems. We consider the one-dimensional free bosons and fermions, spinless fermions on a square lattice away from half-filling, as well as frustrated quantum magnetism with a rapidly oscillating ground-state characteristic function. In the latter case, an ANN with a standard architecture fails, while that with a slightly modified one successfully learns the frustration-induced complex sign rule in the ground state and approximates the ground states with high precisions. As an example of practical use of our method, we also perform the variational method to explore the ground state of an antiferromagnetic J1-J2 Heisenberg model.

  13. Analysis of a finite PML approximation to the three dimensional elastic wave scattering problem

    KAUST Repository

    Bramble, James H.

    2010-01-01

    We consider the application of a perfectly matched layer (PML) technique to approximate solutions to the elastic wave scattering problem in the frequency domain. The PML is viewed as a complex coordinate shift in spherical coordinates which leads to a variable complex coefficient equation for the displacement vector posed on an infinite domain (the complement of the scatterer). The rapid decay of the PML solution suggests truncation to a bounded domain with a convenient outer boundary condition and subsequent finite element approximation (for the truncated problem). We prove existence and uniqueness of the solutions to the infinite domain and truncated domain PML equations (provided that the truncated domain is sufficiently large). We also show exponential convergence of the solution of the truncated PML problem to the solution of the original scattering problem in the region of interest. We then analyze a Galerkin numerical approximation to the truncated PML problem and prove that it is well posed provided that the PML damping parameter and mesh size are small enough. Finally, computational results illustrating the efficiency of the finite element PML approximation are presented. © 2010 American Mathematical Society.

  14. Proton-Nucleus Scattering Approximations and Implications for LHC Crystal Collimation

    Energy Technology Data Exchange (ETDEWEB)

    Noble, Robert; /SLAC

    2010-06-07

    In particle accelerators, scattered protons with energies close to the incident particles may travel considerable distances with the beam before impacting on accelerator components downstream. To analyze such problems, angular deflection and energy loss of scattered particles are the main quantities to be simulated since these lead to changes in the beam's phase space distribution and particle loss. Simple approximations for nuclear scattering processes causing limited energy loss to high-energy protons traversing matter are developed which are suitable for rapid estimates and reduced-description Monte Carlo simulations. The implications for proton loss in the Large Hadron Collider due to nuclear scattering on collimation crystals are discussed.

  15. Weak Approximation of SDEs by Discrete-Time Processes

    Directory of Open Access Journals (Sweden)

    Henryk Zähle

    2008-01-01

    Full Text Available We consider the martingale problem related to the solution of an SDE on the line. It is shown that the solution of this martingale problem can be approximated by solutions of the corresponding time-discrete martingale problems under some conditions. This criterion is especially expedient for establishing the convergence of population processes to SDEs. We also show that the criterion yields a weak Euler scheme approximation of SDEs under fairly weak assumptions on the driving force of the approximating processes.

  16. Approximate Quantum Adders with Genetic Algorithms: An IBM Quantum Experience

    Directory of Open Access Journals (Sweden)

    Li Rui

    2017-07-01

    Full Text Available It has been proven that quantum adders are forbidden by the laws of quantum mechanics. We analyze theoretical proposals for the implementation of approximate quantum adders and optimize them by means of genetic algorithms, improving previous protocols in terms of efficiency and fidelity. Furthermore, we experimentally realize a suitable approximate quantum adder with the cloud quantum computing facilities provided by IBM Quantum Experience. The development of approximate quantum adders enhances the toolbox of quantum information protocols, paving the way for novel applications in quantum technologies.

  17. Baby Skyrme model, near-BPS approximations, and supersymmetric extensions

    Science.gov (United States)

    Bolognesi, S.; Zakrzewski, W.

    2015-02-01

    We study the baby Skyrme model as a theory that interpolates between two distinct BPS systems. For this, a near-BPS approximation can be used when there is a small deviation from each of the two BPS limits. We provide analytical explanation and numerical support for the validity of this approximation. We then study the set of all possible supersymmetric extensions of the baby Skyrme model with N =1 and the particular ones with extended N =2 supersymmetries and relate this to the above mentioned almost-BPS approximation.

  18. Nonlinear Multigrid solver exploiting AMGe Coarse Spaces with Approximation Properties

    DEFF Research Database (Denmark)

    Christensen, Max la Cour; Villa, Umberto; Engsig-Karup, Allan Peter

    The paper introduces a nonlinear multigrid solver for mixed finite element discretizations based on the Full Approximation Scheme (FAS) and element-based Algebraic Multigrid (AMGe). The main motivation to use FAS for unstructured problems is the guaranteed approximation property of the AMGe coarse...... properties of the coarse spaces. With coarse spaces with approximation properties, our FAS approach on unstructured meshes has the ability to be as powerful/successful as FAS on geometrically refined meshes. For comparison, Newton’s method and Picard iterations with an inner state-of-the-art linear solver...

  19. Improved Approximation for Breakpoint Graph Decomposition and Sorting by Reversals

    DEFF Research Database (Denmark)

    Rizzi, Romeo; Caprara, Alberto

    2002-01-01

    Sorting by Reversals (SBR) is one of the most widely studied models of genome rearrangements in computational molecular biology. At present, 3/2 is the best known approximation ratio achievable in polynomial time for SBR. A very closely related problem, called Breakpoint Graph Decomposition (BGD......! instances of SBR on permutations with n elements. Our result uses the best known approximation algorithms for Stable Set on graphs with maximum degree 4 as well as for Set Packing where the maximum size of a set is 6. Any improvement in the ratio achieved by these approximation algorithms will yield...

  20. Approximation scheme based on effective interactions for stochastic gene regulation

    CERN Document Server

    Ohkubo, Jun

    2010-01-01

    Since gene regulatory systems contain sometimes only a small number of molecules, these systems are not described well by macroscopic rate equations; a master equation approach is needed for such cases. We develop an approximation scheme for dealing with the stochasticity of the gene regulatory systems. Using an effective interaction concept, original master equations can be reduced to simpler master equations, which can be solved analytically. We apply the approximation scheme to self-regulating systems with monomer or dimer interactions, and a two-gene system with an exclusive switch. The approximation scheme can recover bistability of the exclusive switch adequately.

  1. Communication: Improved pair approximations in local coupled-cluster methods

    Energy Technology Data Exchange (ETDEWEB)

    Schwilk, Max; Werner, Hans-Joachim [Institut für Theoretische Chemie, Universität Stuttgart, Pfaffenwaldring 55, D-70569 Stuttgart (Germany); Usvyat, Denis [Institute for Physical and Theoretical Chemistry, Universität Regensburg, Universitätsstrasse 31, D-93040 Regensburg (Germany)

    2015-03-28

    In local coupled cluster treatments the electron pairs can be classified according to the magnitude of their energy contributions or distances into strong, close, weak, and distant pairs. Different approximations are introduced for the latter three classes. In this communication, an improved simplified treatment of close and weak pairs is proposed, which is based on long-range cancellations of individually slowly decaying contributions in the amplitude equations. Benchmark calculations for correlation, reaction, and activation energies demonstrate that these approximations work extremely well, while pair approximations based on local second-order Møller-Plesset theory can lead to errors that are 1-2 orders of magnitude larger.

  2. On the Beebe-Linderberg two-electron integral approximation

    Science.gov (United States)

    Røeggen, I.; Wisløff-Nilssen, E.

    1986-12-01

    The Beebe-Linderberg two-electron integral approximation, which is generated by a Cholesky decomposition of the two-electron integral matrix ([μν|λσ]), is slightly modified. On the basis of test calculations, two key questions concerning this approximation are discussed: The numerical rank of the two-electron integral matrix and the relationship between the integral threshold and electronic properties. The numerical results presented in this work suggest that the modified Beebe-Linderberg approximation might be considered as an alternative to effective core potential methods.

  3. Approximate Quantum Adders with Genetic Algorithms: An IBM Quantum Experience

    Science.gov (United States)

    Li, Rui; Alvarez-Rodriguez, Unai; Lamata, Lucas; Solano, Enrique

    2017-07-01

    It has been proven that quantum adders are forbidden by the laws of quantum mechanics. We analyze theoretical proposals for the implementation of approximate quantum adders and optimize them by means of genetic algorithms, improving previous protocols in terms of efficiency and fidelity. Furthermore, we experimentally realize a suitable approximate quantum adder with the cloud quantum computing facilities provided by IBM Quantum Experience. The development of approximate quantum adders enhances the toolbox of quantum information protocols, paving the way for novel applications in quantum technologies.

  4. Beyond the Euler characteristic: Approximating the genus of general graphs

    OpenAIRE

    Kawarabayashi, Ken-ichi; Sidiropoulos, Anastasios

    2014-01-01

    Computing the Euler genus of a graph is a fundamental problem in graph theory and topology. It has been shown to be NP-hard by [Thomassen '89] and a linear-time fixed-parameter algorithm has been obtained by [Mohar '99]. Despite extensive study, the approximability of the Euler genus remains wide open. While the existence of an $O(1)$-approximation is not ruled out, the currently best-known upper bound is a trivial $O(n/g)$-approximation that follows from bounds on the Euler characteristic. I...

  5. Digital fixed points, approximate fixed points, and universal functions

    Directory of Open Access Journals (Sweden)

    Laurence Boxer

    2016-10-01

    Full Text Available A. Rosenfeld [23] introduced the notion of a digitally continuous function between digital images, and showed that although digital images need not have fixed point properties analogous to those of the Euclidean spaces modeled by the images, there often are approximate fixed point properties of such images. In the current paper, we obtain additional results concerning fixed points and approximate fixed points of digitally continuous functions. Among these are several results concerning the relationship between universal functions and the approximate fixed point property (AFPP.

  6. Evaluating approximations to the optimal exercise boundary for American options

    Directory of Open Access Journals (Sweden)

    Roland Mallier

    2002-01-01

    Full Text Available We consider series solutions for the location of the optimal exercise boundary of an American option close to expiry. By using Monte Carlo methods, we compute the expected value of an option if the holder uses the approximate location given by such a series as his exercise strategy, and compare this value to the actual value of the option. This gives an alternative method to evaluate approximations. We find the series solution for the call performs excellently under this criterion, even for large times, while the asymptotic approximation for the put is very good near to expiry but not so good further from expiry.

  7. Approximating methods for intractable probabilistic models: Applications in neuroscience

    DEFF Research Database (Denmark)

    Højen-Sørensen, Pedro

    2002-01-01

    . The approximating techniques used in this thesis originate from the field of statistical physics which for decades has been facing the same type of intractable computations when analyzing large systems of interacting variables e.g. magnetic spin systems. In general, these approximating techniques are known as mean...... with binary sources. It is shown this approach, which is computationally efficient, infers reasonable brain activation functions. Finally, we outline various ways of carrying out approximate message passing in probabilistic models for which marginalization over some of the clique variables is intractable....

  8. Carboplatin binding to histidine

    Science.gov (United States)

    Tanley, Simon W. M.; Diederichs, Kay; Kroon-Batenburg, Loes M. J.; Levy, Colin; Schreurs, Antoine M. M.; Helliwell, John R.

    2014-01-01

    Carboplatin is a second-generation platinum anticancer agent used for the treatment of a variety of cancers. Previous X-ray crystallographic studies of carboplatin binding to histidine (in hen egg-white lysozyme; HEWL) showed the partial conversion of carboplatin to cisplatin owing to the high NaCl concentration used in the crystallization conditions. HEWL co-crystallizations with carboplatin in NaBr conditions have now been carried out to confirm whether carboplatin converts to the bromine form and whether this takes place in a similar way to the partial conversion of carboplatin to cisplatin observed previously in NaCl conditions. Here, it is reported that a partial chemical transformation takes place but to a transplatin form. Thus, to attempt to resolve purely carboplatin binding at histidine, this study utilized co-crystallization of HEWL with carboplatin without NaCl to eliminate the partial chemical conversion of carboplatin. Tetragonal HEWL crystals co-crystallized with carboplatin were successfully obtained in four different conditions, each at a different pH value. The structural results obtained show carboplatin bound to either one or both of the N atoms of His15 of HEWL, and this particular variation was dependent on the concentration of anions in the crystallization mixture and the elapsed time, as well as the pH used. The structural details of the bound carboplatin molecule also differed between them. Overall, the most detailed crystal structure showed the majority of the carboplatin atoms bound to the platinum centre; however, the four-carbon ring structure of the cyclobutanedicarboxylate moiety (CBDC) remained elusive. The potential impact of the results for the administration of carboplatin as an anticancer agent are described. PMID:25195881

  9. Rapid quenching effects in PVC films

    Science.gov (United States)

    Lee, H. D.; Mandell, J. F.; Mcgarry, F. J.

    1981-01-01

    Using a specially constructed microbalance for hydrostatic weighing, density changes in PVC thin films (with no additives, 30-100 micrometers thick), due to rapid quenching (approximately 300 C/sec) through the glass transition temperature, have been observed. The more severe the quench, the greater is the free volume content. Isobaric volume recovery of PVC has also been studied by volume dilatometry. Both show aging of relaxing molecular rearrangements takes place as a linear function of logarithmic aging time at room temperature. Distribution of retardation times and Primak's distributed activation energy spectra have been applied to the volume recovery data. The concomitant changes in mechanical properties of PVC after quenching have been monitored by tensile creep and stress-strain to failure. All reflect the presence of excess free volume content, due to rapid quenching.

  10. Absolute FKBP binding affinities obtained via nonequilibrium unbinding simulations.

    Science.gov (United States)

    Ytreberg, F Marty

    2009-04-28

    We compute the absolute binding affinities for two ligands bound to the FKBP protein using nonequilibrium unbinding simulations. The methodology is straightforward requiring little or no modification to many modern molecular simulation packages. The approach makes use of a physical pathway, eliminating the need for complicated alchemical decoupling schemes. We compare our nonequilibrium results to those obtained via a fully equilibrium approach and to experiment. The results of this study suggest that to obtain accurate results using nonequilibrium approaches one should use the stiff-spring approximation with the second cumulant expansion. From this study we conclude that nonequilibrium simulation could provide a simple means to estimate protein-ligand binding affinities.

  11. Conductance of Graphene Nanoribbon Junctions and the Tight Binding Model

    Directory of Open Access Journals (Sweden)

    Wu Y

    2011-01-01

    Full Text Available Abstract Planar carbon-based electronic devices, including metal/semiconductor junctions, transistors and interconnects, can now be formed from patterned sheets of graphene. Most simulations of charge transport within graphene-based electronic devices assume an energy band structure based on a nearest-neighbour tight binding analysis. In this paper, the energy band structure and conductance of graphene nanoribbons and metal/semiconductor junctions are obtained using a third nearest-neighbour tight binding analysis in conjunction with an efficient nonequilibrium Green's function formalism. We find significant differences in both the energy band structure and conductance obtained with the two approximations.

  12. Characterization of an intracellular hyaluronic acid binding site in isolated rat hepatocytes

    Energy Technology Data Exchange (ETDEWEB)

    Frost, S.J.; Raja, R.H.; Weigel, P.H. (Univ. of Texas Medical Branch, Galveston (USA))

    1990-11-13

    125I-HA, prepared by chemical modification at the reducing sugar, specifically binds to rat hepatocytes in suspension or culture. Intact hepatocytes have relatively few surface 125I-HA binding sites and show low specific binding. However, permeabilization of hepatocytes with the nonionic detergent digitonin results in increased specific 125I-HA binding (45-65%) and a very large increase in the number of specific 125I-HA binding sites. Scatchard analysis of equilibrium 125I-HA binding to permeabilized hepatocytes in suspension at 4 degrees C indicates a Kd = 1.8 x 10(-7) M and 1.3 x 10(6) molecules of HA (Mr approximately 30,000) bound per cell at saturation. Hepatocytes in primary culture for 24 h show the same affinity but the total number of HA molecules bound per cell at saturation decreases to approximately 6.2 x 10(5). Increasing the ionic strength above physiologic concentrations decreases 125I-HA binding to permeable cells, whereas decreasing the ionic strength above causes an approximately 4-fold increase. The divalent cation chelator EGTA does not prevent binding nor does it release 125I-HA bound in the presence of 2 mM CaCl2, although higher divalent cation concentrations stimulate 125I-HA binding. Ten millimolar CaCl2 or MnCl2 increases HA binding 3-6-fold compared to EGTA-treated cells. Ten millimolar MgCl2, SrCl2, or BaCl2 increased HA binding by 2-fold. The specific binding of 125I-HA to digitonin-treated hepatocytes at 4{degrees}C increased greater than 10-fold at pH 5.0 as compared to pH 7.

  13. The RapidEye mission design

    Science.gov (United States)

    Tyc, George; Tulip, John; Schulten, Daniel; Krischke, Manfred; Oxfort, Michael

    2005-01-01

    The RapidEye mission is a commercial remote sensing mission by the German Company RapidEye AG. The RapidEye mission will deliver information products for various customers in the agricultural insurance market, large producers, international institutions and cartography. The mission consists of a constellation of five identical small satellites and a sophisticated ground infrastructure based on proven systems. The five satellites will be placed in a single sun-synchronous orbit of approximately 620 km, with the satellites equally spaced over the orbit. The RapidEye system has the unique ability to image any area on earth once per day and can also provide large area coverage within 5 days. The satellites will each carry a 5 band multi-spectral optical imager with a ground sampling distance of 6.5 m at nadir and a swath width of 80 km. These capabilities along with the processing throughput of the ground segment allows the system to deliver the information products needed by the customers reliably and in a time frame that meets their specific needs.

  14. Technical notes. Spherical harmonics approximations of neutron transport

    Energy Technology Data Exchange (ETDEWEB)

    Demeny, A.; Dede, K.M.; Erdei, K.

    1976-12-01

    A double-range spherical harmonics approximation obtained by expanding the angular flux separately in the two regions combined with the conventional single-range spherical harmonics is found to give superior description of neutron transport.

  15. Kullback-Leibler divergence and the Pareto-Exponential approximation.

    Science.gov (United States)

    Weinberg, G V

    2016-01-01

    Recent radar research interests in the Pareto distribution as a model for X-band maritime surveillance radar clutter returns have resulted in analysis of the asymptotic behaviour of this clutter model. In particular, it is of interest to understand when the Pareto distribution is well approximated by an Exponential distribution. The justification for this is that under the latter clutter model assumption, simpler radar detection schemes can be applied. An information theory approach is introduced to investigate the Pareto-Exponential approximation. By analysing the Kullback-Leibler divergence between the two distributions it is possible to not only assess when the approximation is valid, but to determine, for a given Pareto model, the optimal Exponential approximation.

  16. Approximate equations at breaking for nearshore wave transformation coefficients

    Digital Repository Service at National Institute of Oceanography (India)

    Chandramohan, P.; Nayak, B.U.; SanilKumar, V.

    Based on small amplitude wave theory approximate equations are evaluated for determining the coefficients of shoaling, refraction, bottom friction, bottom percolation and viscous dissipation at breaking. The results obtainEd. by these equations...

  17. Gaussian approximations of fluorescence microscope point-spread function models.

    Science.gov (United States)

    Zhang, Bo; Zerubia, Josiane; Olivo-Marin, Jean-Christophe

    2007-04-01

    We comprehensively study the least-squares Gaussian approximations of the diffraction-limited 2D-3D paraxial-nonparaxial point-spread functions (PSFs) of the wide field fluorescence microscope (WFFM), the laser scanning confocal microscope (LSCM), and the disk scanning confocal microscope (DSCM). The PSFs are expressed using the Debye integral. Under an L(infinity) constraint imposing peak matching, optimal and near-optimal Gaussian parameters are derived for the PSFs. With an L1 constraint imposing energy conservation, an optimal Gaussian parameter is derived for the 2D paraxial WFFM PSF. We found that (1) the 2D approximations are all very accurate; (2) no accurate Gaussian approximation exists for 3D WFFM PSFs; and (3) with typical pinhole sizes, the 3D approximations are accurate for the DSCM and nearly perfect for the LSCM. All the Gaussian parameters derived in this study are in explicit analytical form, allowing their direct use in practical applications.

  18. Comparison of different caries detectors for approximal caries detection

    Directory of Open Access Journals (Sweden)

    Esin Bozdemir

    2016-09-01

    Conclusion: The ability of bitewing radiography to identify sound surfaces was better than that of the other methods. The LF device was the most sensitive tool for detecting approximal surfaces with caries, followed by the LED device.

  19. GPS-ABC: Gaussian Process Surrogate Approximate Bayesian Computation

    NARCIS (Netherlands)

    Meeds, E.; Welling, M.; Zhang, N.; Tian, J.

    2014-01-01

    Scientists often express their understanding of the world through a computationally demanding simulation program. Analyzing the posterior distribution of the parameters given observations (the inverse problem) can be extremely challenging. The Approximate Bayesian Computation (ABC) framework is the

  20. Interpolation function for approximating knee joint behavior in human gait

    Science.gov (United States)

    Toth-Taşcǎu, Mirela; Pater, Flavius; Stoia, Dan Ioan

    2013-10-01

    Starting from the importance of analyzing the kinematic data of the lower limb in gait movement, especially the angular variation of the knee joint, the paper propose an approximation function that can be used for processing the correlation among a multitude of knee cycles. The approximation of the raw knee data was done by Lagrange polynomial interpolation on a signal acquired using Zebris Gait Analysis System. The signal used in approximation belongs to a typical subject extracted from a lot of ten investigated subjects, but the function domain of definition belongs to the entire group. The study of the knee joint kinematics plays an important role in understanding the kinematics of the gait, this articulation having the largest range of motion in whole joints, in gait. The study does not propose to find an approximation function for the adduction-abduction movement of the knee, this being considered a residual movement comparing to the flexion-extension.

  1. Exact and approximate expressions for the period of anharmonic oscillators

    Energy Technology Data Exchange (ETDEWEB)

    Amore, Paolo [Facultad de Ciencias, Universidad de Colima, Bernal DIaz del Castillo 340, Colima (Mexico); Fernandez, Francisco M [INIFTA (Conicet, UNLP), Blvd. 113 y 64 S/N, Sucursal 4, Casilla de Correo 16, 1900 La Plata (Argentina)

    2005-07-01

    In this paper, we present a straightforward systematic method for the exact and approximate calculation of integrals that appear in formulae for the period of anharmonic oscillators and other problems of interest in classical mechanics.

  2. Real-time creased approximate subdivision surfaces with displacements.

    Science.gov (United States)

    Kovacs, Denis; Mitchell, Jason; Drone, Shanon; Zorin, Denis

    2010-01-01

    We present an extension of Loop and Schaefer's approximation of Catmull-Clark surfaces (ACC) for surfaces with creases and corners. We discuss the integration of ACC into Valve's Source game engine and analyze performance of our implementation.

  3. Approximate inverse preconditioning of iterative methods for nonsymmetric linear systems

    Energy Technology Data Exchange (ETDEWEB)

    Benzi, M. [Universita di Bologna (Italy); Tuma, M. [Inst. of Computer Sciences, Prague (Czech Republic)

    1996-12-31

    A method for computing an incomplete factorization of the inverse of a nonsymmetric matrix A is presented. The resulting factorized sparse approximate inverse is used as a preconditioner in the iterative solution of Ax = b by Krylov subspace methods.

  4. The degenerate-internal-states approximation for cold collisions

    NARCIS (Netherlands)

    Maan, A.C.; Tiesinga, E.; Stoof, H.T.C.; Verhaar, B.J.

    1990-01-01

    The Degenerate-Internal-States approximation as well as its first-order correction are shown to provide a convenient method for calculating elastic and inelastic collision amplitudes for low temperature atomic scattering.

  5. Reinforcement Learning: Stochastic Approximation Algorithms for Markov Decision Processes

    OpenAIRE

    Krishnamurthy, Vikram

    2015-01-01

    This article presents a short and concise description of stochastic approximation algorithms in reinforcement learning of Markov decision processes. The algorithms can also be used as a suboptimal method for partially observed Markov decision processes.

  6. Global Stochastic Properties of Dynamic Models and their Linear Approximations

    NARCIS (Netherlands)

    A.M. Babus (Ana Maria); C.G. de Vries (Casper)

    2010-01-01

    textabstractThe dynamic properties of micro based stochastic macro models are often analyzed through a linearization around the associated deterministic steady state. Recent literature has investigated the error made by such a deterministic approximation. Complementary to this literature we

  7. Galerkin approximations of nonlinear optimal control problems in Hilbert spaces

    Directory of Open Access Journals (Sweden)

    Mickael D. Chekroun

    2017-07-01

    Full Text Available Nonlinear optimal control problems in Hilbert spaces are considered for which we derive approximation theorems for Galerkin approximations. Approximation theorems are available in the literature. The originality of our approach relies on the identification of a set of natural assumptions that allows us to deal with a broad class of nonlinear evolution equations and cost functionals for which we derive convergence of the value functions associated with the optimal control problem of the Galerkin approximations. This convergence result holds for a broad class of nonlinear control strategies as well. In particular, we show that the framework applies to the optimal control of semilinear heat equations posed on a general compact manifold without boundary. The framework is then shown to apply to geoengineering and mitigation of greenhouse gas emissions formulated here in terms of optimal control of energy balance climate models posed on the sphere $\\mathbb{S}^2$.

  8. Generalized -Bernstein-Schurer Operators and Some Approximation Theorems

    Directory of Open Access Journals (Sweden)

    M. Mursaleen

    2013-01-01

    Full Text Available We study statistical approximation properties of -Bernstein-Shurer operators and establish some direct theorems. Furthermore, we compute error estimation and show graphically the convergence for a function by operators and give its algorithm.

  9. Numerical approximation of random periodic solutions of stochastic differential equations

    Science.gov (United States)

    Feng, Chunrong; Liu, Yu; Zhao, Huaizhong

    2017-10-01

    In this paper, we discuss the numerical approximation of random periodic solutions of stochastic differential equations (SDEs) with multiplicative noise. We prove the existence of the random periodic solution as the limit of the pull-back flow when the starting time tends to -∞ along the multiple integrals of the period. As the random periodic solution is not explicitly constructible, it is useful to study the numerical approximation. We discretise the SDE using the Euler-Maruyama scheme and modified Milstein scheme. Subsequently, we obtain the existence of the random periodic solution as the limit of the pull-back of the discretised SDE. We prove that the latter is an approximated random periodic solution with an error to the exact one at the rate of √{Δ t} in the mean square sense in Euler-Maruyama method and Δ t in the Milstein method. We also obtain the weak convergence result for the approximation of the periodic measure.

  10. Reply to Steele & Ferrer: Modeling oscillation, approximately or exactly?

    NARCIS (Netherlands)

    Folmer, H.; Oud, J.H.L.

    2011-01-01

    This article addresses modeling oscillation in continuous time. It criticizes Steele and Ferrer's article "Latent Differential Equation Modeling of Self-Regulatory and Coregulatory Affective Processes" (2011), particularly the approximate estimation procedure applied. This procedure is the latent

  11. Reply to Steele & Ferrer : Modeling Oscillation, Approximately or Exactly?

    NARCIS (Netherlands)

    Oud, Johan H. L.; Folmer, Henk

    2011-01-01

    This article addresses modeling oscillation in continuous time. It criticizes Steele and Ferrer's article "Latent Differential Equation Modeling of Self-Regulatory and Coregulatory Affective Processes" (2011), particularly the approximate estimation procedure applied. This procedure is the latent

  12. Deterministic Approximation Algorithms for the Nearest Codeword Problem

    Science.gov (United States)

    Alon, Noga; Panigrahy, Rina; Yekhanin, Sergey

    The Nearest Codeword Problem (NCP) is a basic algorithmic question in the theory of error-correcting codes. Given a point v in mathbb{F}_2^n and a linear space Lsubseteq mathbb{F}_2^n of dimension k NCP asks to find a point l ∈ L that minimizes the (Hamming) distance from v. It is well-known that the nearest codeword problem is NP-hard. Therefore approximation algorithms are of interest. The best efficient approximation algorithms for the NCP to date are due to Berman and Karpinski. They are a deterministic algorithm that achieves an approximation ratio of O(k/c) for an arbitrary constant c, and a randomized algorithm that achieves an approximation ratio of O(k/logn).

  13. Approximation with positive linear operators and linear combinations

    CERN Document Server

    Gupta, Vijay

    2017-01-01

    This book presents a systematic overview of approximation by linear combinations of positive linear operators, a useful tool used to increase the order of approximation. Fundamental and recent results from the past decade are described with their corresponding proofs. The volume consists of eight chapters that provide detailed insight into the representation of monomials of the operators Ln , direct and inverse estimates for a broad class of positive linear operators, and case studies involving finite and unbounded intervals of real and complex functions. Strong converse inequalities of Type A in terminology of Ditzian–Ivanov for linear combinations of Bernstein and Bernstein–Kantorovich operators and various Voronovskaja-type estimates for some linear combinations are analyzed and explained. Graduate students and researchers in approximation theory will find the list of open problems in approximation of linear combinations useful. The book serves as a reference for graduate and postgraduate courses as we...

  14. Rapidly variable relatvistic absorption

    Science.gov (United States)

    Parker, M.; Pinto, C.; Fabian, A.; Lohfink, A.; Buisson, D.; Alston, W.; Jiang, J.

    2017-10-01

    I will present results from the 1.5Ms XMM-Newton observing campaign on the most X-ray variable AGN, IRAS 13224-3809. We find a series of nine absorption lines with a velocity of 0.24c from an ultra-fast outflow. For the first time, we are able to see extremely rapid variability of the UFO features, and can link this to the X-ray variability from the inner accretion disk. We find a clear flux dependence of the outflow features, suggesting that the wind is ionized by increasing X-ray emission.

  15. Rapid prototype and test

    Energy Technology Data Exchange (ETDEWEB)

    Gregory, D.L.; Hansche, B.D.

    1996-06-01

    In order to support advanced manufacturing, Sandia has acquired the capability to produce plastic prototypes using stereolithography. Currently, these prototypes are used mainly to verify part geometry and ``fit and form`` checks. This project investigates methods for rapidly testing these plastic prototypes, and inferring from prototype test data actual metal part performance and behavior. Performances examined include static load/stress response, and structural dynamic (modal) and vibration behavior. The integration of advanced non-contacting measurement techniques including scanning laser velocimetry, laser holography, and thermoelasticity into testing of these prototypes is described. Photoelastic properties of the epoxy prototypes to reveal full field stress/strain fields are also explored.

  16. Right-Rapid-Rough

    Science.gov (United States)

    Lawrence, Craig

    2003-01-01

    IDEO (pronounced 'eye-dee-oh') is an international design, engineering, and innovation firm that has developed thousands of products and services for clients across a wide range of industries. Its process and culture attracted the attention of academics, businesses, and journalists around the world, and are the subject of a bestselling book, The Art of Innovation by Tom Kelley. One of the keys to IDEO's success is its use of prototyping as a tool for rapid innovation. This story covers some of IDEO's projects, and gives reasons for why they were successful.

  17. bounding the error of a continuous approximation for linear systems

    African Journals Online (AJOL)

    DR S.E UWAMUSI

    The error analysis in LU factorization can be seen as follows: Assuming that d* is an approximate solution to the system of equations (1.1). We consider the problem of calculating the bounds of. ∞. -. - *. 1 d b. A where. ∞ d is the infinity norm in n. IR . We suppose that there is an approximate inverse matrix B to the interval ...

  18. Discussion of CoSA: Clustering of Sparse Approximations

    Energy Technology Data Exchange (ETDEWEB)

    Armstrong, Derek Elswick [Los Alamos National Lab. (LANL), Los Alamos, NM (United States)

    2017-03-07

    The purpose of this talk is to discuss the possible applications of CoSA (Clustering of Sparse Approximations) to the exploitation of HSI (HyperSpectral Imagery) data. CoSA is presented by Moody et al. in the Journal of Applied Remote Sensing (“Land cover classification in multispectral imagery using clustering of sparse approximations over learned feature dictionaries”, Vol. 8, 2014) and is based on machine learning techniques.

  19. The weighted curvature approximation in scattering from sea surfaces

    OpenAIRE

    GUERIN, Charles-Antoine; Soriano, Gabriel; Chapron, Bertrand

    2010-01-01

    A family of unified models in scattering from rough surfaces is based on local corrections of the tangent plane approximation through higher-order derivatives of the surface. We revisit these methods in a common framework when the correction is limited to the curvature, that is essentially the second-order derivative. The resulting expression is formally identical to the weighted curvature approximation, with several admissible kernels, however. For sea surfaces under the Gaussian assumption,...

  20. Approximation and online algorithms in scheduling and coloring

    OpenAIRE

    Fishkin, Aleksei V.

    2003-01-01

    In the last three decades, approximation and online algorithms have become a major area of theoretical computer science and discrete mathematics. Scheduling and coloring problems are among the most popular ones for which approximation and online algorithms have been analyzed. On one hand, motivated by the well-known difficulty to obtain good lower bounds for the problems, it is particularly hard to prove results on the online and offline performance of algorithms. On the other hand, the theor...