Mishev, A; Stamenov, J
2005-01-01
This work summarizes the results presented at 29th International Cosmic Ray Conference in Pune India. Generally the aim of this work is to obtain the lateral distribution of the atmospheric Cherenkov light in extensive air showers produced by different primary particles in wide energy range and at several observation levels and to fit the obtained lateral distributions. Using one large detector and partially modified CORSIKA code version are obtained the lateral distributions of Cherenkov light flux densities at several observation levels for different particle primaries precisely at 536 g/cm2 Chacaltaya, 700 g/cm2 Moussala and 875 g/cm2 Kartalska field observation levels for hadronic primaries and gamma quanta in the energy range 1011 eV-1016 eV. On the basis of the solution of over-determined inverse problem the approximation of these distributions is obtained. The same model function for all the primaries is used and for the different observation levels. The different model parameters for the different pri...
The 1988 Antarctic ozone depletion - Comparison with previous year depletions
Schoeberl, Mark R.; Stolarski, Richard S.; Krueger, Arlin J.
1989-01-01
The 1988 spring Antarctic ozone depletion was observed by TOMS to be substantially smaller than in recent years. The minimum polar total ozone values declined only 15 percent during September 1988, compared to nearly 50 percent during September 1987. At southern midlatitudes, exceptionally high total ozone values were recorded beginning in July 1988. The total integrated southern hemispheric ozone increased rapidly during the Austral spring, approaching 1980 levels during October. The high midlatitude total ozone values were associated with a substantial increase in eddy activity as indicated by the standard deviation in total ozone in the zonal band 30-60 deg S. Mechanisms through which the increased midlatitude eddy activity could disrupt the formation of the Antarctic ozone hole are briefly discussed.
2010-04-01
... pre-kindergarten programs previously funded by the Bureau. 39.1100 Section 39.1100 Indians BUREAU OF...-kindergarten Programs § 39.1100 Interim fiscal year 1980 and fiscal year 1981 funding for pre-kindergarten programs previously funded by the Bureau. Those schools having pre-kindergarten programs funded fully or...
Antiaging treatments have been legally prescribed for approximately thirty years.
Ukraintseva, Svetlana V; Arbeev, Konstantin G; Michalsky, Anatoly I; Yashin, Anatoly I
2004-06-01
There is an interesting divergence between the achievements of geriatrics and gerontology. On the one hand, during the last 30 years physicians in many developed countries have successfully prescribed several medicines to cure various symptoms of senescence. On the other hand, the influence of such medicines on human life span practically has not been studied. The most common of the relevant medicines are nootropic piracetam, gamma-aminobutyric acid (GABA), selegiline, Ginkgo biloba, pentoxifylline, cerebrolysin, solcoseryl, ergoloid, vinpocetin, sertraline, and estrogens, among others. Available data from human clinical practices and experimental animal studies indicate that treatments with these drugs improve learning, memory, brain metabolism, and capacity. Some of these drugs increase tolerance to various stresses such as oxygen deficit and exercise, stimulate the regeneration of neurons in the old brain, and speed up the performance of mental and physical tasks. This means that modern medicine already has "antiaging" treatments at its disposal. However, the influence of such treatments on the mean and maximal life span of humans, and on the age trajectory of a human survival curve has been poorly studied. The increase in human life expectancy at birth in the second half of the last century was mostly caused by the better survival at the old and oldest old rather than at the young ages. In parallel, the consumption of brain protective and regenerative drugs has been expanding in the elderly population. We provide evidence in support of the idea that the consumption of medicines exerting antiaging properties may contribute to the increase in human longevity.
Reichmann, Lara G; Sala, Osvaldo E; Peters, Debra P C
2013-02-01
In arid ecosystems, current-year precipitation often explains only a small proportion of annual aboveground net primary production (ANPP). We hypothesized that lags in the response of ecosystems to changes in water availability explain this low explanatory power, and that lags result from legacies from transitions from dry to wet years or the reverse. We explored five hypotheses regarding the magnitude of legacies, two possible mechanisms, and the differential effect of previous dry or wet years on the legacy magnitude. We used a three-year manipulative experiment with five levels of rainfall in the first two years (-80% and -50% reduced annual precipitation (PPT), ambient, +50% and +80% increased PPT), and reversed treatments in year 3. Legacies of previous two years, which were dry or wet, accounted for a large fraction (20%) of interannual variability in production on year 3. Legacies in ANPP were similar in absolute value for both types of precipitation transitions, and their magnitude was a function of the difference between previous and current-year precipitation. Tiller density accounted for 40% of legacy variability, while nitrogen and carryover water availability showed no effect. Understanding responses to changes in interannual precipitation will assist in assessing ecosystem responses to climate change-induced increases in precipitation variability.
Pulmonary Aspergillosis in a Previously Healthy 13-Year-Old Boy
Jonathan H. Rayment
2016-01-01
Full Text Available Chronic granulomatous disease (CGD is a rare, polygenic primary immunodeficiency. In this case report, we describe a previously healthy 13-year-old boy who presented with multifocal pulmonary aspergillosis and was subsequently diagnosed with an autosomal recessive form of chronic granulomatous disease. CGD has a variable natural history and age of presentation and should be considered when investigating a patient with recurrent or severe infections with catalase-positive organisms.
Incidence of cancer in adolescent idiopathic scoliosis patients treated 25 years previously
Simony, Ane; Hansen, Emil Jesper; Christensen, Steen Bach;
2016-01-01
PURPOSE: To report the incidence of cancer in a cohort of adolescent idiopathic scoliosis (AIS) patients treated 25 years previously. METHODS: 215 consecutive AIS patients treated between 1983 and 1990 were identified and requested to return for clinical and radiographic examination. The incidence...... of cancer was determined through chart review and follow-up interviews. Using the original radiographic log file that included patient position, mAs, kV and the total number of X-rays taken, a radiation physicist calculated the total radiation dose during treatment and follow-up adjusted for BMI and sex...... radiation exposure was 0.8-1.4 mSV per examination and 2.4-5.6 mSv/year. An average of 16 radiographs were taken during the treatment period. Nine AIS patients developed cancer, mostly breast (3) and endometrial (4). The AIS patients had a relative risk of 4.8 (CI 2.3-5.8, p
Kirschbaum, Dalia; Adler, Robert; Adler, David; Peters-Lidard, Christa; Huffman, George
2012-01-01
It is well known that extreme or prolonged rainfall is the dominant trigger of landslides worldwide. While research has evaluated the spatiotemporal distribution of extreme rainfall and landslides at local or regional scales using in situ data, few studies have mapped rainfall-triggered landslide distribution globally due to the dearth of landslide data and consistent precipitation information. This study uses a newly developed Global Landslide Catalog (GLC) and a 13-year satellite-based precipitation record from TRMM data. For the first time, these two unique products provide the foundation to quantitatively evaluate the co-occurrence of precipitation and landslides globally. Evaluation of the GLC indicates that 2010 had a large number of high-impact landslide events relative to previous years. This study considers how variations in extreme and prolonged satellite-based rainfall are related to the distribution of landslides over the same time scales for three active landslide areas: Central America, the Himalayan Arc, and central-eastern China. Several test statistics confirm that TRMM rainfall generally scales with the observed increase in landslide reports and fatal events for 2010 and previous years over each region. These findings suggest that the co-occurrence of satellite precipitation and landslide reports may serve as a valuable indicator for characterizing the spatiotemporal distribution of landslide-prone areas in order to establish a global rainfall-triggered landslide climatology. This study characterizes the variability of satellite precipitation data and reported landslide activity at the globally scale in order to improve landslide cataloging, forecasting and quantify potential triggering sources at daily, monthly and yearly time scales.
Jessica Sullivan
2016-08-01
Full Text Available Does nonverbal, approximate number acuity predict mathematics performance? Some studies report a correlation between acuity of representations in the Approximate Number System (ANS and early math achievement, while others do not. Few previous reports have addressed (1 whether reported correlations remain when other domain-general capacities are considered, and (2 whether such correlations are causal. In the present study, we addressed both questions using a large (N = 204 3-year longitudinal dataset from a successful math intervention, which included a wide array of non-numerical cognitive tasks. While we replicated past work finding correlations between approximate number acuity and math success, these correlations were very small when other domain-general capacities were considered. Also, we found no evidence that changes to math performance induced changes to approximate number acuity, militating against one class of causal accounts.
Bazot, Stephane; Fresneau, Chantal; Damesin, Claire; Barthes, Laure
2016-06-01
The origin of N which contributes to the synthesis of N reserves of in situ forest trees in autumn and to the growth of new organs the following spring is currently poorly documented. To characterize the metabolism of various possible N sources (plant N and soil N), six distinct 20-year-old sessile oaks were 15N labelled by spraying 15NH415NO3: (i) on leaves in May, to label the N pool remobilized in the autumn for synthesis of reserves, (ii) on soil in the autumn, to label the N pool taken up from soil and (iii) on soil at the beginning of the following spring, to label the N pool taken up from soil in the spring. The partitioning of 15N in leaves, twigs, phloem, xylem, fine roots, rhizospheric soil and microbial biomass was followed during two growing seasons. Results showed a significant incorporation of 15N into the soil-tree system; more than 30 % of the administered 15N was recovered. Analysis of the partitioning clearly revealed that in autumn, roots' N reserves were formed from foliage 15N (73 %) and to a lesser extent from soil 15N (27 %). The following spring, 15N used for the synthesis of new leaves came first from 15N stored during the previous autumn, mainly from 15N reserves formed from foliage (95 %). Thereafter, when leaves were fully expanded, 15N uptake from the soil during the previous autumn and before budburst contributed to the formation of new leaves (60 %).
2010-04-01
... the “taxable year of inclusion”) previous to the taxable year of exclusion shall be increased under... years intervening between such taxable year of inclusion and such taxable year of exclusion, as... earlier exclusions under section 959(a)(1) in respect of the same inclusion under section 951(a) for...
Vincenti, V; Pasanisi, E; Bacciu, A; Bacciu, S; Zini, C
2014-08-01
Cochlear implantation in the setting of chronic otitis media or previous middle ear surgery poses several problems for the surgeon: possible spread of infection to the cochlea and the subarachnoid spaces with consequent meningitis, risk of electrode array extrusion and possible recurrence of the original disease. Several surgical strategies have been proposed to overcome these problems. In the present study, clinical and functional results of cochlear implantation in 26 patients with chronic otitis media (8 cases) or previous middle ear surgery (18 cases) in the ear most suitable for implantation were retrospectively reviewed. Among the 8 patients with chronic otitis media, in 7 cases a subtotal petrosectomy associated with external auditory canal closure and mastoid and Eustachian tube obliteration was performed, while in the remaining patient cochlear implantation was done 6 months after a myringoplasty. The only complication observed was a reperforation of the tympanic membrane in this latter patient. Among the 18 patients with previous middle ear surgery, 2 had undergone intact canal wall tympanomastoidectomy and were implanted utilising the previous surgical approach. In the remaining 16 patients who had a radical cavity, an open technique was maintained in 3 cases; a cavity revision associated to external auditory canal closure, Eustachian tube and mastoid obliteration was performed in 12 patients, while in one case a middle cranial fossa approach was utilised. Two of the 3 patients in whom an open technique was maintained have experienced electrode array extrusion. The only complication observed in the remaining patients was the breakdown of the external auditory canal closure in one case. No problems were noted in patients who had undergone intact canal wall tympanomastoidectomy as well as in the subject implanted via the middle cranial fossa approach. All patients achieved and maintained good hearing performance over time. Subtotal petrosectomy associated
Friis, Ib; Weber, Odile
2014-01-01
The incompletely known Crotalaria trifoliolata Baker f. (Leguminosae subfam. Papilionoideae) has been rediscovered in the field. For 120 years, it has been known only from a fragmentary holotype with uncertain collecting locality. The habit and height of the plant, the pods and the seeds are here...
Transpacific pollution transport during INTEX-B: spring 2006 in context to previous years
G. G. Pfister
2009-08-01
Full Text Available We analyze the transport of pollution across the Pacific during the NASA INTEX-B (Intercontinental Chemical Transport Experiment Part B campaign in spring 2006 and examine how this year compares to the time period for 2000 through 2006. In addition to aircraft measurements of carbon monoxide (CO collected during INTEX-B, we include in this study multi-year satellite retrievals of CO from the Measurements of Pollution in the Troposphere (MOPITT instrument and simulations from the chemistry transport model MOZART-4. Model tracers are used to examine the contributions of different source regions and source types to pollution levels over the Pacific. Additional modeling studies are performed to separate the impacts of inter-annual variability in meteorology and dynamics from changes in source strength.
Interannual variability in the tropospheric CO burden over the Pacific and the US as estimated from the MOPITT data range up to 7% and a somewhat smaller estimate (5% is derived from the model. When keeping the emissions in the model constant between years, the year-to-year changes are reduced to (2%, but show that in addition to changes in emissions, variable meteorological conditions also impact transpacific pollution transport. We estimate that about 1/3 of the variability in the tropospheric CO loading over the contiguous US is explained by changes in emissions and about 2/3 by changes in meteorology and transport. Biomass burning sources are found to be a larger driver for inter-annual variability in the CO loading compared to fossil and biofuel sources or photochemical CO production even though their absolute contributions are smaller. Source contribution analysis shows that the aircraft sampling during INTEX-B was fairly representative of the larger scale region, but with a slight bias towards higher influence from Asian contributions.
Keaton S. Smetana
2013-11-01
Full Text Available A 52-year-old African American female presented with severe left thigh pain of unknown etiology. She had a past medical history of generalized seizure disorder treated with phenytoin for 7 years without incident. During admission a nurse witnessed a seizure, and consequently loading and maintenance doses of phenytoin were administered to obtain a therapeutic serum concentration. The patient had a history of noncompliance with multiple subtherapeutic phenytoin levels. Subsequently, unifocal blue discolored spots appeared, progressing to a bullous component that was positive for skin sloughing. Drug-induced fixed drug eruption was diagnosed and attributed to phenytoin. Clinicians should be cognizant of drug-induced fixed drug eruption in patients just initiated and those receiving long-term treatment with phenytoin. The administration rate of phenytoin may be associated with the development of fixed drug eruption.
Exercise Modality Choices One Year After Intervention in Previously Inactive Older Men and Women.
Stathokostas, Liza; Jones, Gareth R
2016-07-01
A convenience sample of 176 healthy, community-dwelling, inactive older adults (mean age 70 ± 5 years; 62 males, 114 females) were tracked for one year. The purpose was to describe the exercise modality choices older adults make one year following participation in an exercise and education intervention. Telephone follow-up contacted 137 participants (78%, men = 50, women = 87) and 62% of the men and 69% of the women reported to be "currently exercising." Exercising independently was the most common type of exercise reported by 81% and 64% of men and women, respectively. Walking was the most commonly reported modality by both genders. The setting of exercise was most often reported to be at home or outside for both men and women. The main reason for continued participation at 12 months was for overall health (50% of men and 40% of women). Little variation was observed for exercise modality choice. Future interventions should consider a variety of exercise and physical activity opportunities for older adults.
Williams, David E.; Gentry, Gregory J.
2015-01-01
The International Space Station (ISS) Environmental Control and Life Support (ECLS) system includes regenerative and non-regenerative technologies that provide the basic life support functions to support the crew, while maintaining a safe and habitable shirtsleeve environment. This paper provides a summary of the U.S. ECLS system activities over the past year and the impacts of the international partners' activities on them, covering the period of time between March 2013 and February 2014. The ISS continued permanent crew operations including the continuation of six crew members being on ISS. Work continues on the commercial crew vehicles, and work to try and extend ISS service life.
Evaluation of Olyset™ insecticide-treated nets distributed seven years previously in Tanzania
Mshinda Hassan
2004-06-01
Full Text Available Abstract Background Insecticide-treated nets represent currently a key malaria control strategy, but low insecticide re-treatment rates remain problematic. Olyset™ nets are currently one of two long-lasting insecticidal nets recommended by WHO. An assessment was carried out of the effect of Olyset™ nets after seven years of use in rural Tanzania. Methods A survey of Olyset™ nets was conducted in two Tanzanian villages to examine their insecticide dosage, bioassay efficacy and desirability compared with ordinary polyester nets. Results Of 103 randomly selected nets distributed in 1994 to 1995, 100 could be traced. Most nets were in a condition likely to offer protection against mosquito biting. Villagers appreciated mainly the durability of Olyset™ nets and insecticide persistence. People disliked the small size of these nets and the light blue colour and preferred a smaller mesh size, features that can easily be modified. At equal price, 51% said they would prefer to buy an Olyset™ net and 49% opted for an ordinary polyester net. The average permethrin content was 33%-41% of the initial insecticide dose of 20,000 mg/Kg. Bioassay results indicated high knock-down rates at 60 minutes, but the mosquito mortality after 24 hours was rather low (mean: 34%. No significant correlation was found between bioassay results and insecticide concentration in and on the net. Conclusions Olyset™ nets are popular, durable and with a much longer insecticide persistence than ordinary polyester nets. Hence, Olyset™ nets are one of the best choices for ITN programmes in rural malaria-endemic areas.
无
2003-01-01
A recent survey by Friedman Billings Ramsey (FBR) shows that the oil and gas companies worldwide plan to increase the fund for exploration and development to US$136 billion in 2003, 4.8 percent up from the previous year. The second half of 2003 will see even a higher increase in the fund. In 2002, the exploration and development expenditure of the surveyed oil and gas companies rose 3.6 percent as compared to 2001.
The transition to a sulphidic ocean approximately 1.84 billion years ago.
Poulton, Simon W; Fralick, Philip W; Canfield, Donald E
2004-09-09
The Proterozoic aeon (2.5 to 0.54 billion years (Gyr) ago) marks the time between the largely anoxic world of the Archean (> 2.5 Gyr ago) and the dominantly oxic world of the Phanerozoic (Proterozoic has traditionally been explained by progressive oxygenation of the deep ocean in response to an increase in atmospheric oxygen around 2.3 Gyr ago. This postulated rise in the oxygen content of the ocean is in turn thought to have led to the oxidation of dissolved iron, Fe(II), thus ending the deposition of banded iron formations (BIF) around 1.8 Gyr ago. An alternative interpretation suggests that the increasing atmospheric oxygen levels enhanced sulphide weathering on land and the flux of sulphate to the oceans. This increased rates of sulphate reduction, resulting in Fe(II) removal in the form of pyrite as the oceans became sulphidic. Here we investigate sediments from the approximately 1.8-Gyr-old Animikie group, Canada, which were deposited during the final stages of the main global period of BIF deposition. This allows us to evaluate the two competing hypotheses for the termination of BIF deposition. We use iron-sulphur-carbon (Fe-S-C) systematics to demonstrate continued ocean anoxia after the final global deposition of BIF and show that a transition to sulphidic bottom waters was ultimately responsible for the termination of BIF deposition. Sulphidic conditions may have persisted until a second major rise in oxygen between 0.8 to 0.58 Gyr ago, possibly reducing global rates of primary production and arresting the pace of algal evolution.
Ramo, Brandon A; Richards, B Stephens
2012-06-15
A retrospective case series. To identify the overall reoperation rate and factors contributing to reoperation in a recent 5-year cohort of patients (2003-2007) undergoing spinal deformity surgery. These patients were compared with a previously published 15-year cohort of consecutive patients (1988-2002) from the same institution to assess for any significant differences in reoperation rates. In a previously published report from this institution, the reoperation rate for patients with idiopathic scoliosis treated during a 15-year period (1988-2002) was 12.9%. That group was predominantly treated with first-generation TSRH (Medtronic, Memphis, TN) implants and CD implants. Lower profile, more rigid implant systems are now used along with refined techniques for correction of scoliosis deformity. We hypothesized that these factors would lead to lower rates of reoperation. METHODS.: The medical records of 452 consecutive patients (older than 9 yr) surgically treated for idiopathic scoliosis at one institution during 5 years (2003-2007) were reviewed to identify those who required reoperation. The reoperation rate for this cohort was 7.5% (34 of 452 patients). Compared with the prior cohort, significant decreases were noted with regard to total reoperation rate as well as reoperation due to infection and pseudarthrosis. Trends were noted toward decreased rates of reoperation due to prominent implants, dislodged implants, and implant proximity to vital structures. Within the newer cohort, a trend toward decreased reoperation rate was also noted for lower profile implant systems compared with first-generation TSRH implants. With the evolution of newer lower profile segmental implant systems that provide more rigid fixation and with the advancements in techniques for deformity correction, the repeat surgical intervention rate for idiopathic scoliosis has decreased.
Jamshid Gadoev
Full Text Available TB is one of the main health priorities in Uzbekistan and relatively high rates of unfavorable treatment outcomes have recently been reported. This requires closer analysis to explain the reasons and recommend interventions to improve the situation. Thus, by using countrywide data this study sought to determine trends in unfavorable outcomes (lost-to-follow-ups, deaths and treatment failures and describe their associations with socio-demographic and clinical factors.A countrywide retrospective cohort study of all new and previously treated TB patients registered in the National Tuberculosis programme between January 2006 and December 2010.Among 107,380 registered patients, 67% were adults, with smaller proportions of children (10%, adolescents (4% and elderly patients (19%. Sixty per cent were male, 66% lived in rural areas, 1% were HIV-infected and 1% had a history of imprisonment. Pulmonary TB (PTB was present in 77%, of which 43% were smear-positive and 53% were smear-negative. Overall, 83% of patients were successfully treated, 6% died, 6% were lost-to-follow-up, 3% failed treatment and 2% transferred out. Factors associated with death included being above 55 years of age, HIV-positive, sputum smear positive, previously treated, jobless and living in certain provinces. Factors associated with lost-to-follow-up were being male, previously treated, jobless, living in an urban area, and living in certain provinces. Having smear-positive PTB, being an adolescent, being urban population, being HIV-negative, previously treated, jobless and residing in particular provinces were associated with treatment failure.Overall, 83% treatment success rate was achieved. However, our study findings highlight the need to improve TB services for certain vulnerable groups and in specific areas of the country. They also emphasize the need to develop unified monitoring and evaluation tools for drug-susceptible and drug-resistant TB, and call for better TB
Libertus, Melissa E; Forsman, Lea; Adén, Ulrika; Hellgren, Kerstin
2017-01-01
Preterm children are at increased risk for poor academic achievement, especially in math. In the present study, we examined whether preterm children differ from term-born children in their intuitive sense of number that relies on an unlearned, approximate number system (ANS) and whether there is a link between preterm children's ANS acuity and their math abilities. To this end, 6.5-year-old extremely preterm (i.e., preterm children had significantly lower ANS acuity than term-born children and that these differences could not be fully explained by differences in verbal IQ, perceptual reasoning skills, working memory, or attention. Differences in ANS acuity persisted even when demands on visuo-spatial skills and attention were reduced in the ANS task. Finally, we found that ANS acuity and math ability are linked in extremely preterm children, similar to previous results from term-born children. These results suggest that deficits in the ANS may be at least partly responsible for the deficits in math abilities often observed in extremely preterm children.
Melissa E. Libertus
2017-07-01
Full Text Available Preterm children are at increased risk for poor academic achievement, especially in math. In the present study, we examined whether preterm children differ from term-born children in their intuitive sense of number that relies on an unlearned, approximate number system (ANS and whether there is a link between preterm children’s ANS acuity and their math abilities. To this end, 6.5-year-old extremely preterm (i.e., <27 weeks gestation, n = 82 and term-born children (n = 89 completed a non-symbolic number comparison (ANS acuity task and a standardized math test. We found that extremely preterm children had significantly lower ANS acuity than term-born children and that these differences could not be fully explained by differences in verbal IQ, perceptual reasoning skills, working memory, or attention. Differences in ANS acuity persisted even when demands on visuo-spatial skills and attention were reduced in the ANS task. Finally, we found that ANS acuity and math ability are linked in extremely preterm children, similar to previous results from term-born children. These results suggest that deficits in the ANS may be at least partly responsible for the deficits in math abilities often observed in extremely preterm children.
Félix-Redondo, Francisco Javier; Lozano Mera, Luis; Consuegra-Sánchez, Luciano; Giménez Sáez, Fernando; Garcipérez de Vargas, Francisco Javier; Castellano Vázquez, José María; Fernández-Bergés, Daniel
2016-01-01
Objectives To determine the degree of risk factor control, the clinical symptoms and the therapeutic management of patients with a history of previous myocardial infarction. Methods Cross-sectional study at 6 years of a first episode of acute myocardial infarction between 2000 and 2009, admitted at a hospital in the region of Extremadura (Spain). Of 2177 patients with this diagnosis, 1365 remained alive and therefore were included in the study. Results We conducted a person-to-person survey in 666 (48.8%) individuals and telephone survey in 437 (31.9%) individuals. The former are analysed. 130 were female (19.5%). The mean age was 67.4 years and the median time since the event was 5.8 (IQR 3.6–8.2) years. Active smokers made up 13.8%, low-density lipoprotein (LDL) cholesterol was ≥70 mg/dL: 82%, blood pressure ≥140/90 mm Hg (≥140/85 in diabetics): 49.8%, fasting glucose ≥126 mg/dL: 26%, heart rate 50–59 bpm: 60.7%, and obesity: 45.9%. Patients reported presenting angina comprised 22.4% and those with dyspnoea, 29.3%. Drug coverage was: 88.0% antiplatelet drugs, 86.5% statins, 75.6% β-blockers and 65.8% blockers of the renin-angiotensin system. Patients receiving all four types of drugs made up 41.9%, with only 3.0% having jointly controlled cholesterol, blood pressure, heart rate and glycaemia. Conclusions LDL cholesterol, heart rate and blood pressure were risk factors with less control. More than 1/5 of patients had angina and more than 1/4, dyspnoea. Risk factor control and the clinical condition were far from optimal, as was drug coverage, although to a lesser degree. PMID:27127637
Derosa, Giuseppe; Ragonesi, Pietro Dario; Fogari, Elena; Cicero, Arrigo Francesco Giuseppe; Bianchi, Lucio; Bonaventura, Aldo; Romano, Davide; Maffioli, Pamela
2014-04-01
The aim of this study was to evaluate whether the positive effects of sitagliptin on glycemic control and insulin resistance were maintained also after 2 years of therapy and whether sitagliptin could be effective also in improving lipid profile. In this randomized, double-blind, placebo-controlled trial, 205 patients with type 2 diabetes in therapy with different antidiabetic drugs were randomized to add sitagliptin 100 mg once a day or placebo to their current therapy. We evaluated at the baseline and after 6, 12, 18, and 24 months the following parameters: body mass index, glycated hemoglobin (HbA1c ), fasting plasma glucose (FPG), postprandial plasma glucose (PPG), fasting plasma insulin (FPI), homeostasis model assessment insulin resistance index (HOMA-IR), total cholesterol (TC), high-density lipoprotein cholesterol (HDL-C), low-density lipoprotein cholesterol (LDL-C), triglycerides (Tg). Sitagliptin, added to previously taken antidiabetic agents, proved to be effective in improving glycemic profile, reducing HbA1c by -17.5%, FPG by -12.7%, PPG by -20.5%. Regarding insulin resistance, sitagliptin decreased FPI by -8.3% and HOMA-IR by -20.0%, confirming that what have been already reported in short-term studies can be applied also after 2 years of treatment. Sitagliptin also reduced body weight by -4.3%. Our study also showed the positive effect of sitagliptin on lipid profile; in particular, sitagliptin decreased TC by -13.3%, LDL-C by -20.4%, and Tg by -32.3%, and also increased HDL-C by + 13.6%. Sitagliptin proved to be effective on glycemic profile and insulin resistance even after 2 years of therapy and to be effective in improving body weight and lipid profile. © 2012 The Authors Fundamental and Clinical Pharmacology © 2012 Société Française de Pharmacologie et de Thérapeutique.
Warth, Lucian C; Callaghan, John J; Liu, Steve S; Klaassen, Alison L; Goetz, Devon D; Johnston, Richard C
2014-11-05
We report the updated results for a previously described cohort of patients who were less than fifty years old at the time of the index Charnley total hip arthroplasty with cement. The original cohort consisted of ninety-three consecutive hips in sixty-nine patients. The patients were followed for a minimum of thirty-five years after surgery or until death. At the latest follow-up evaluation, there were forty-one total hip replacements (44%) in thirty-two living patients. Thirty-four (37%) of the ninety-three total hip replacements in the original cohort had been revised or removed. Twenty acetabular (22%) and seven femoral (8%) components had been revised for aseptic loosening. Since the twenty-five-year follow-up, the average six-minute-walk distance decreased from 395 m to 171 m, and this decrease correlated with increasing comorbidity. This study demonstrates the durability of cemented total hip replacements in a young patient population. Although 63% (fifty-nine) of the ninety-three original hip replacements were functioning at the latest follow-up or at the time of death, a significant decrease in activity level was seen over time (p < 0.001). Of the forty-one original implants in the patients who were alive at the time of the thirty-five-year follow-up, only 46% (nineteen) were retained. Copyright © 2014 by The Journal of Bone and Joint Surgery, Incorporated.
Winter, D.A.; Karolewska-Bochenek, K.; Lazowska-Przeorek, I.; Lionetti, P.; Mearin, ML; Chong, S.K.; Roma-Giannikou, E.; Maly, J.; Kolho, K.L.; Shaoul, R.; Staiano, A.; Damen, G.M.; Meij, T. de; Hendriks, D.; George, E.K.; Turner, D.; Escher, J.C.
2015-01-01
BACKGROUND: Inflammatory bowel disease-unclassified (IBD-U) is diagnosed in approximately 10% of pediatric and adolescent onset IBD patients. The EUROKIDS registry (2004) initiated by the Porto IBD working group of ESPGHAN prospectively monitors diagnostic workup of newly diagnosed pediatric and ado
Bach Okholm-Hansen, Anna; Brorson, Stig
2014-01-01
INTRODUCTION: We describe the clinical course and emphasize the difficulties in diagnosing T-cell lymphoblastic lymphoma. The differential diagnostic difficulties have previously been described in regard to pneumonia, but to the best of the authors' knowledge this is the first case report to desc...
Trygged, Sven; Hedlund, Ebba; Kåreholt, Ingemar
2014-01-01
Violence against women has many negative consequences. In this short report the authors investigate patterns of mortality among women experiencing violence leading to inpatient care from 1992 to 2006. Do women who are victims of severe violence have an increased mortality risk (a) in general? (b) by violence? (c) by suicide? Does socioeconomic position have any bearing on the mortality risk? The study was based on Swedish national registers, where 6,085 women exposed to violence resulting in inpatient care were compared with a nonexposed population sample of 55,016 women. Women of all social strata previously exposed to severe violence and treated in hospital had a highly increased risk of premature death from all-cause mortality, violence, or suicide. Women previously exposed to severe violence continue to live a life in danger. There is need for a societal response to support and protect these women against further violence after discharge from hospital.
Linde, A.A. van der; Lewiszong-Rutjens, C.A.; Verrips, A.; Gerrits, G.P.
2009-01-01
An 11-year-old girl was admitted with backpain, weight loss, fatigue and behavioural disturbances, starting seven weeks before admission. Physical examination showed acrodynia, tremor, cachexia, hypertension and extensive gingival ulceration. Routine laboratory tests were normal, except for a CRP of
Tanaka, Y.; Ide, S.
2014-12-01
It is well known that the statistical probability of earthquake occurrence changes over the course of a day due to periodic variations in the tidal stress acting on faults. However, periodicity on a decadal scale (8.85 and 18.61 years) has been studied by relatively few researchers and clear correlations have not been obtained. In this study, by investigating historical large earthquakes that occurred over 1,000 years in Japan, it is shown that a stronger periodicity of 8.85 years and a weaker periodicity of 18.61 years appear in the seismicity along the Japan Trench and the Nankai Trough, respectively. The past strain and tilt observations conducted during the 1950s through the 1970s indicate that, nationwide, gradual compression repeated every 8-10 years in the direction of relative plate motion. These compression periods are in accordance with the periods of higher seismic activity in the area along the Japan Trench. This agreement between the phase of the increasing seismicity and the compression periods seen in the long-term cyclic crustal deformation suggests that the periodicity is not merely a coincidence and that the transient crustal movement may be relevant with the tides. Considering the seismiity in the Nankai region, periodicity of 18.61 years should be superimposed on the crustal deformation with periods of 8-10 years. However, the approximately twenty-year observation was too short to extract it. According to a recently proposed model based on the combination of the nonlinear fault rheology and oscillating tidal stress, the above transient crustal deformation with periods of approximately 9 years may be caused by long-term variations in the occurrence rate of tremors. The initiation of the past slow slip events in the Tokai area also agreed with the phase of the 9-year mode except for the largest event from the year 2000.
Muhr, Jan; Messier, Christian; Delagrange, Sylvain; Trumbore, Susan; Xu, Xiaomei; Hartmann, Henrik
2016-03-01
While trees store substantial amounts of nonstructural carbon (NSC) for later use, storage regulation and mobilization of stored NSC in long-lived organisms like trees are still not well understood. At two different sites with sugar maple (Acer saccharum), we investigated ascending sap (sugar concentration, δ(13) C, Δ(14) C) as the mobilized component of stored stem NSC during early springtime. Using the bomb-spike radiocarbon approach we were able to estimate the average time elapsed since the mobilized carbon (C) was originally fixed from the atmosphere and to infer the turnover time of stem storage. Sites differed in concentration dynamics and overall δ(13) C, indicating different growing conditions. The absence of temporal trends for δ(13) C and Δ(14) C indicated sugar mobilization from a well-mixed pool with average Δ(14) C consistent with a mean turnover time (TT) of three to five years for this pool, with only minor differences between the sites. Sugar maple trees hence appear well buffered against single or even several years of negative plant C balance from environmental stress such as drought or repeated defoliation by insects. Manipulative investigations (e.g. starvation via girdling) combined with Δ(14) C measurements of this mobilized storage pool will provide further new insights into tree storage regulation and functioning.
Basant Repswal; Anuj Jain; Sunil Gupta; Aditya Aggarwal; Tushar Kohli; Devendra Pathrot
2014-01-01
Fall from height is a common cause of unintentional injuries in children and accounts for 6％ of all trauma-related childhood deaths,usually from head injury.We report a case of a 2-year-old child with multiple fractures of the bilateral lower limbs due to this reason.A child fell from a height of around 15 feet after toppling from a balcony.He developed multiple fractures involving the right femoral shaft,right distal femoral epiphysis (Salter Harris type 2),right distal metaphysis of the tibia and fibula,and undisplaced Salter Harris type 2 epiphyseal injury of the left distal tibia.There were no head,abdominal or spinal injuries.The patient was taken into emergency operation theatre after initial management which consisted of intravenous fluids,blood transfusion,and splintage of both lower limbs.Fracture of the femoral shaft was treated by closed reduction and fixation using two titanium elastic nails.Distal femoral physeal injury required open reduction and fixation with K wires.Distal tibia fractures were closely reduced and managed nonoperatively in both the lower limbs.All the fractures united in four weeks.At the last follow-up,the child had no disability and was able to perform daily activities comfortably.We also proposed the unique mechanism of injury in this report.
Anuj Jain
2014-10-01
Full Text Available 【Abstract】Fall from height is a common cause of unintentional injuries in children and accounts for 6% of all trauma-related childhood deaths, usually from head injury. We report a case of a 2-year-old child with multiple fractures of the bilateral lower limbs due to this reason. A child fell from a height of around 15 feet after toppling from a alcony. He developed multiple fractures involving the right femoral shaft, right distal femoral epiphysis (Salter Harris type 2, right distal metaphysis of the tibia and fi bula, and undisplaced Salter Harris type 2 epiphyseal injury of the left distal tibia. There were no head, abdominal or spinal injuries. The patient was taken into emergency operation theatre after initial management which consisted of intravenous fl uids, blood transfusion, and splintage of both lower limbs. Fracture of the femoral shaft was treated by closed reduction and fixation using two titanium elastic nails. Distal femoral physeal injury required open eduction and fixation with K wires. Distal tibia fractures were closely reduced and managed nonoperatively in both the lower limbs. All the fractures united in four weeks. At the last follow-up, the child had no disability and was able to perform daily ctivities comfortably. We also proposed the unique mechanism of injury in this report. Key words: Multiple bilateral lower limb fractures; Fall; Child
Fledelius, Hans C; Goldschmidt, Ernst
2010-01-01
This study describes the posterior pole contour and visual field (VF) findings in an unselected series of adults (aged approximately 54 years) with high myopia.......This study describes the posterior pole contour and visual field (VF) findings in an unselected series of adults (aged approximately 54 years) with high myopia....
Parrish, Randall R; Horstwood, Matthew; Arnason, John G; Chenery, Simon; Brewer, Tim; Lloyd, Nicholas S; Carpenter, David O
2008-02-01
Inhaled depleted uranium (DU) aerosols are recognised as a distinct human health hazard and DU has been suggested to be responsible in part for illness in both military and civilian populations that may have been exposed. This study aimed to develop and use a testing procedure capable of detecting an individual's historic milligram-quantity aerosol exposure to DU up to 20 years after the event. This method was applied to individuals associated with or living proximal to a DU munitions plant in Colonie New York that were likely to have had a significant DU aerosol inhalation exposure, in order to improve DU-exposure screening reliability and gain insight into the residence time of DU in humans. We show using sensitive mass spectrometric techniques that when exposure to aerosol has been unambiguous and in sufficient quantity, urinary excretion of DU can be detected more than 20 years after primary DU inhalation contamination ceased, even when DU constitutes only approximately 1% of the total excreted uranium. It seems reasonable to conclude that a chronically DU-exposed population exists within the contamination 'footprint' of the munitions plant in Colonie, New York. The method allows even a modest DU exposure to be identified where other less sensitive methods would have failed entirely. This should allow better assessment of historical exposure incidence than currently exists.
SMID, WM; VANDERMEER, J; HALIE, MR
1995-01-01
The efficacy and safety of a monoclonal purified factor VIII concentrate (Hemofil M) were assessed in a historically controlled study in 22 HIV-negative patients with haemophilia A, previously treated with various concentrates. Data from 5 years of follow-up were compared with those from the precedi
Smid, W. M.; van der Meer, J.; Halie, M. R.
1995-01-01
The efficacy and safety of a monoclonal purified factor VIII concentrate (Hemofil M) were assessed in a historically controlled study in 22 HIV-negative patients with haemophilia A, previously treated with various concentrates. Data from 5 years of follow-up were compared with those from the
Quaranta, Alessandro; Assenza, Bartolomeo; D'Isidoro, Orlando; Profili, Fabia; Polimeni, Antonella; Vozza, Iole
2015-01-01
To evaluate the impact of smoking and previous periodontal disease on peri-implant microbiota and health in medium to long-term maintained patients. A retrospective evaluation of partial edentulous patients restored with dental implants and enrolled in a regular supportive therapy was performed. Inclusion criteria were: medium to long-term periodontal and implant maintenance (at least 5 years), a minimum of 2 implants placed in each patient, absence of systemic diseases that may affect osseointegration. 30 implants in 15 patients were included in the study. Subjects were divided in smokers or non-smokers and between patients previously affected by periodontal disease and periodontally healthy. Peri-implant and periodontal parameters were assessed (PD,BoP, mPI). Microbiological samples were collected around implant and an adjacent tooth. Real- Time Polymerase Chain Reaction (RT-PCR) analysis was performed. In all the three groups no differences in bacterial counts between dental and implant sites were observed. Non smoker, healthy patients: healthy clinical parameters, significant counts of spirochetes in isolated patients. Non smokers with previous periodontal disease: occasional positive BoP values, significant high counts of pathogenic bacteria. Smokers with previous periodontal disease: clinical signs of inflammation including deep pockets and slight bone resorption, significant counts of pathogenic bacteria. Over a follow-up of 5 to 7 years, it is possible to state that the absence of smoking habit and previous periodontal disease positively influences the peri-implant microbiological and clinical conditions in partial edentulous patients restored with dental implants and enrolled in a strict regular supportive therapy.
Whitton, Clare; Nicholson, Sonja K; Roberts, Caireen; Prynne, Celia J; Pot, Gerda K; Olson, Ashley; Fitt, Emily; Cole, Darren; Teucher, Birgit; Bates, Beverley; Henderson, Helen; Pigott, Sarah; Deverill, Claire; Swan, Gillian; Stephen, Alison M
2011-12-01
The National Diet and Nutrition Survey (NDNS) is a cross-sectional survey designed to gather data representative of the UK population on food consumption, nutrient intakes and nutritional status. The objectives of the present paper were to identify and describe food consumption and nutrient intakes in the UK from the first year of the NDNS rolling programme (2008-09) and compare these with the 2000-01 NDNS of adults aged 19-64 years and the 1997 NDNS of young people aged 4-18 years. Differences in median daily food consumption and nutrient intakes between the surveys were compared by sex and age group (4-10 years, 11-18 years and 19-64 years). There were no changes in energy, total fat or carbohydrate intakes between the surveys. Children aged 4-10 years had significantly lower consumption of soft drinks (not low calorie), crisps and savoury snacks and chocolate confectionery in 2008-09 than in 1997 (all P < 0·0001). The percentage contribution of non-milk extrinsic sugars to food energy was also significantly lower than in 1997 in children aged 4-10 years (P < 0·0001), contributing 13·7-14·6 % in 2008-09 compared with 16·8 % in 1997. These changes were not as marked in older children and there were no changes in these foods and nutrients in adults. There was still a substantial proportion (46 %) of girls aged 11-18 years and women aged 19-64 years (21 %) with mean daily Fe intakes below the lower reference nutrient intake. Since previous surveys there have been some positive changes in intakes especially in younger children. However, further attention is required in other groups, in particular adolescent girls.
Esteves Lima, Rafael Paschoal; Cota, Luis Otávio Miranda; Silva, Tarcília Aparecida; Cortelli, Sheila Cavalca; Cortelli, José Roberto; Costa, Fernando Oliveira
2017-01-01
The aim of this study was to verify the incidence on the development of type 2 diabetes in women with previous gestational diabetes with and without periodontitis after a three-year time interval. Initial sample of this follow-up study consisted of 90 women diagnosed with gestational diabetes who underwent periodontal examination. After three years, 49 women were subjected to new periodontal examination and biological, behavioral, and social data of interest were collected. Additionally, the quantification of the C-reactive protein in blood samples was performed. Fasting glucose and glycated hemoglobin levels were requested. Saliva samples were collected for quantification of interleukin 6 and 10, tumor necrosis factor α, matrix metalloproteinase 2 and 9. The incidence of type 2 diabetes mellitus was 18.4% and of periodontitis was 10.2%. There was no significant difference in the incidence of type 2 diabetes mellitus among women with and without periodontitis. It was observed impact of C-reactive protein in the development of type 2 diabetes mellitus. However, it was not observed impact of periodontitis on the development of type 2 diabetes mellitus among women with previous gestational diabetes. It was not observed impact of periodontitis on the development of type 2 diabetes among women with previous gestational diabetes. The impact of C-reactive protein in the development of type 2 diabetes mellitus highlights the importance of an inflammatory process in the diabetes pathogenesis.
Icks, Andrea; Albers, Bernd; Haastert, Burkhard; Pechlivanis, Sonali; Pundt, Noreen; Slomiany, Uta; Erbel, Raimund; Jöckel, Karl-Heinz; Kruse, Johannes; Kulzer, Bernd; Nowotny, Bettina; Herder, Christian; Giani, Guido; Moebus, Susanne
2013-01-01
Objective The objective of this study was to determine the risk for the development of high depressive symptoms in study participants with diagnosed and previously undetected diabetes mellitus compared to those without diabetes in a prospective population-based cohort study in Germany. Methods We estimated the 5-year cumulative incidence of high depressive symptoms in participants without high depressive symptoms at baseline (n = 3,633, 51.4% men, mean age (SD) 59.1 (7.6) years, 7.0% diagnosed diabetes, 5.3% previously undetected diabetes) from the population-based Heinz Nixdorf Recall study. Diabetes was assessed by self-report, medication, and blood glucose. High depressive symptoms were assessed using CES-D. We calculated odds ratios and their corresponding 95% confidence interval, using multiple logistic regression analyses. Result Cumulative 5-year incidences (95% CI) of high depressive symptoms in participants with diagnosed, undetected, and without diabetes were 7.1 (4.2–10.9), 4.1 (1.8–8.0), and 6.5 (5.6–7.4), respectively. The age-sex-adjusted OR for developing high depressive symptoms was 1.22 (0.74–2.03) in participants with diagnosed compared to those without diabetes, and 1.00 (0.59–1.68) after adjustment for BMI, physical activity, education, stroke, and myocardial infarction. The age-sex adjusted OR for developing high depressive symptoms in participants with previously undetected diabetes compared to those without diabetes was 0.72; 0.35–1.48; and fully adjusted 0.62; 0.30–1.30. Conclusion We found no significant associations, maybe due to low power. However, our results are in line with a recent meta-analysis suggesting that risk of developing high depressive symptoms in patients with diagnosed diabetes may be moderately higher than in those without diabetes, and that comorbidity may explain in part this association. In participants with previously undetected diabetes, this first longitudinal study indicates that the risk is not
Andrea Icks
Full Text Available OBJECTIVE: The objective of this study was to determine the risk for the development of high depressive symptoms in study participants with diagnosed and previously undetected diabetes mellitus compared to those without diabetes in a prospective population-based cohort study in Germany. METHODS: We estimated the 5-year cumulative incidence of high depressive symptoms in participants without high depressive symptoms at baseline (n = 3,633, 51.4% men, mean age (SD 59.1 (7.6 years, 7.0% diagnosed diabetes, 5.3% previously undetected diabetes from the population-based Heinz Nixdorf Recall study. Diabetes was assessed by self-report, medication, and blood glucose. High depressive symptoms were assessed using CES-D. We calculated odds ratios and their corresponding 95% confidence interval, using multiple logistic regression analyses. RESULT: Cumulative 5-year incidences (95% CI of high depressive symptoms in participants with diagnosed, undetected, and without diabetes were 7.1 (4.2-10.9, 4.1 (1.8-8.0, and 6.5 (5.6-7.4, respectively. The age-sex-adjusted OR for developing high depressive symptoms was 1.22 (0.74-2.03 in participants with diagnosed compared to those without diabetes, and 1.00 (0.59-1.68 after adjustment for BMI, physical activity, education, stroke, and myocardial infarction. The age-sex adjusted OR for developing high depressive symptoms in participants with previously undetected diabetes compared to those without diabetes was 0.72; 0.35-1.48; and fully adjusted 0.62; 0.30-1.30. CONCLUSION: We found no significant associations, maybe due to low power. However, our results are in line with a recent meta-analysis suggesting that risk of developing high depressive symptoms in patients with diagnosed diabetes may be moderately higher than in those without diabetes, and that comorbidity may explain in part this association. In participants with previously undetected diabetes, this first longitudinal study indicates that the risk is not
Callaghan, John J; Wells, Christopher W; Liu, Steve S; Goetz, Devon D; Johnston, Richard C
2010-07-07
We previously evaluated 119 consecutive total knee arthroplasties performed by a single surgeon in eighty-six patients with use of the cemented LCS (low contact stress) mobile-bearing, rotating-platform system and an all-polyethylene patellar component. The average age of the patients at the time of surgery was seventy years. The patients were contacted as part of their routine follow-up and were asked to participate in this study. The purpose of the present study was to report the updated results at a minimum follow-up of twenty years. Twenty patients (twenty-six knees) were living, and one was lost to follow-up. Three knees required a reoperation (two for periprosthetic fractures and one for infection). No component was revised as a part of the reoperations. No knee required revision since the fifteen-year follow-up evaluation. Osteolysis was present in six knees compared with only three knees at the time of the fifteen-year follow-up. One knee had radiographic signs of femoral component loosening, which was associated with osteolysis. It occurred after the fifteen-year follow-up study. The average range of motion was from 1 degrees of extension to 105 degrees of flexion. The average clinical and functional Knee Society scores were 43 and 49 points, respectively, at the preoperative evaluation and 89 and 67 points at the time of the final follow-up. We concluded that the cemented LCS rotating-platform knee performed well, with durable clinical and radiographic results at a minimum follow-up of twenty years. However, the prevalence of osteolysis continues to increase with a longer duration of follow-up in these patients.
Bidoli Ettore
2010-05-01
Full Text Available Abstract Background A population of breast cancer patients exists who, for various reasons, never received adjuvant post-operative tamoxifen (TAM. This study was aimed to evaluate the role of late TAM in these patients. Methods From 1997 to 2003, patients aged 35 to 75 years, operated more than 2 years previously for monolateral breast cancer without adjuvant TAM, with no signs of metastases and no contraindication to TAM were randomized to TAM 20 mg/day orally for 2 years or follow-up alone. Events were categorized as locoregional relapse, distant metastases, metachronous breast cancer, tumours other than breast cancer and death from any causes, whichever occurred first. The sample size (197 patients per arm, plus 10% allowance was based on the assumption of a 30% decrease in the number of events occurring at a rate of 5% annually in the 10 years following randomization. Four hundred and thirty-three patients were randomized in the study (TAM 217, follow-up 216. Patients characteristics (TAM/follow-up included: median age 55/55 years, median time from surgery 25/25 months (range, 25-288/25-294, in situ carcinoma 18/24, oestrogen receptor (ER positive in 75/68, negative in 70/57, unknown in 72/91 patients. Previous adjuvant treatment included chemotherapy in 131/120 and an LHRH analogue in 11/13 patients. Results Thirty-six patients prematurely discontinued TAM after a median of 1 month, mostly because of subjective intolerance. Eighty-three events (TAM 39, follow-up 44 occurred: locoregional relapse in 10/8, distant metastases in 14/16, metachronous breast cancer in 4/10, other tumours in 11/10 patients. Less ER-positive secondary breast cancers occurred in the TAM treated patients than in follow-up patients (1 vs 10, p = 0.005. Event-free survival was similar in both groups of patients. Conclusions This 5-year analysis revealed significantly less metachronous ER-positive breast cancers in the TAM treated patients. No other statistically
Lanata, Claudio F; Andrade, Teresa; Gil, Ana I; Terrones, Cynthia; Valladolid, Omar; Zambrano, Betzana; Saville, Melanie; Crevat, Denis
2012-09-07
In a randomized, placebo-controlled, monocenter, observer blinded study conducted in an area where dengue is endemic, we assessed the safety and immunogenicity of a recombinant, live, attenuated, tetravalent dengue vaccine candidate (CYD-TDV) in 2-11 year-olds with varying levels of pre-existing yellow-fever immunity due to vaccination 1-7 years previously. 199 children received 3 injections of CYD-TDV (months 0, 6 and 12) and 99 received placebo (months 0 and 6) or pneumococcal polysaccharide vaccine (month 12). One month after the third dengue vaccination, serotype specific neutralizing antibody GMTs were in the range of 178-190 (1/dil) (versus 16.7-38.1 in the control group), a 10-20 fold-increase from baseline, and 94% of vaccines were seropositive to all four serotypes (versus 39% in the control group). There were no vaccine-related SAEs. The observed reactogenicity profile was consistent with phase I studies, with severity grade 1-2 injection site pain, headache, malaise and fever most frequently reported and no increase after subsequent vaccinations. Virologically confirmed dengue cases were seen after completion of the 3 doses: 1 in the CYD-TDV group (N=199), and 3 in the control group (N=99). A 3-dose regimen of CYD-TDV had a good safety profile in 2-11 year olds with a history of YF vaccination and elicited robust antibody responses that were balanced against the four serotypes.
Vanderwert, Ross E; Zeanah, Charles H; Fox, Nathan A; Nelson, Charles A
2016-02-01
Extreme social and cognitive deprivation as a result of institutional care has profound effects on developmental outcomes across multiple domains for many abandoned or orphaned children. The Bucharest Early Intervention Project (BEIP) examines the outcomes for children originally placed in institutions who were assessed comprehensively and then randomized to foster care (FCG) or care as usual (CAUG) and followed longitudinally. Here we report on the brain electrical activity (electroencephalogram: EEG) of 12-year-old children enrolled in the BEIP. Previous reports suggested improvement in resting EEG activity for the group of children placed in the foster care intervention, particularly those placed before 24 months of age compared to children who were randomized to CAUG or those placed into families after this age. At 12 years, differences between those in the FCG and those in the CAUG persist in the alpha band (8-13 Hz), but not in higher frequency bands (i.e. in the beta band; 15-30 Hz), except in those children placed into the FCG who remained in high quality care environments over the course of the study. These findings highlight the importance of maintaining a stable high quality caregiving environment, particularly for children exposed to early psychosocial deprivation, for promoting healthy brain development. Copyright © 2015 The Authors. Published by Elsevier Ltd.. All rights reserved.
Callaghan, John J; Bracha, Peter; Liu, Steve S; Piyaworakhun, Somyot; Goetz, Devon D; Johnston, Richard C
2009-11-01
The purpose of this study was to update the results, at a minimum of thirty-five years, in a single-surgeon series of primary Charnley total hip arthroplasties performed with cement. Twelve patients (fifteen hips) were alive, 249 patients (314 hips) had died, and one patient (one hip) had been lost to follow-up. Seven of the hips in the living patients had required at least one revision; 290 (88%) of the original group of total hip prostheses either continued to function or were in patients who had died. Since the time of a thirty-year study of this cohort, one hip that had previously been revised because of acetabular loosening required an additional revision because of acetabular loosening and two additional hips had evidence of radiographic loosening (of one acetabular and one femoral component). The survival rate with revision for any reason as the end point was 78%. This end result study should provide a benchmark for subsequent procedures and designs with the caveat that patient life expectancy will likely continue to increase and modern-design implants are being used in younger patients.
Lim, Lucy; Thompson, Alexander; Patterson, Scott; George, Jacob; Strasser, Simone; Lee, Alice; Sievert, William; Nicoll, Amanda; Desmond, Paul; Roberts, Stuart; Marion, Kaye; Bowden, Scott; Locarnini, Stephen; Angus, Peter
2017-06-01
Multidrug-resistant HBV continues to be an important clinical problem. The TDF-109 study demonstrated that TDF±LAM is an effective salvage therapy through 96 weeks for LAM-resistant patients who previously failed ADV add-on or switch therapy. We evaluated the 5-year efficacy and safety outcomes in patients receiving long-term TDF±LAM in the TDF-109 study. A total of 59 patients completed the first phase of the TDF-109 study and 54/59 were rolled over into a long-term prospective open-label study of TDF±LAM 300 mg daily. Results are reported at the end of year 5 of treatment. At year 5, 75% (45/59) had achieved viral suppression by intent-to-treat analysis. Per-protocol assessment revealed 83% (45/54) were HBV DNA undetectable. Nine patients remained HBV DNA detectable, however 8/9 had very low HBV DNA levels (<264IU/mL) and did not meet virological criteria for virological breakthrough (VBT). One patient experienced VBT, but this was in the setting of documented non-compliance. The response was independent of baseline LAM therapy or mutations conferring ADV resistance. Four patients discontinued TDF, one patient was lost to follow-up and one died from hepatocellular carcinoma. Long-term TDF treatment appears to be safe and effective in patients with prior failure of LAM and a suboptimal response to ADV therapy. These findings confirm that TDF has a high genetic barrier to resistance is active against multidrug-resistant HBV, and should be the preferred oral anti-HBV agent in CHB patients who fail treatment with LAM and ADV. © 2016 John Wiley & Sons A/S. Published by John Wiley & Sons Ltd.
Streifler, Jonathan Y; den Hartog, Anne G; Pan, Samuel; Pan, Hongchao; Bulbulia, Richard; Thomas, Dafydd J; Brown, Martin M; Halliday, Alison
2016-12-01
Silent brain infarcts are common in patients at increased risk of stroke and are associated with a poor prognosis. In patients with asymptomatic carotid stenosis, similar adverse associations were claimed, but the impact of previous infarction or symptoms on the beneficial effects of carotid endarterectomy is not clear. Our aim was to evaluate the impact of prior cerebral infarction in patients enrolled in the Asymptomatic Carotid Surgery Trial, a large trial with 10-year follow-up in which participants whose carotid stenosis had not caused symptoms for at least six months were randomly allocated either immediate or deferred carotid endarterectomy. The first Asymptomatic Carotid Surgery Trial included 3120 patients. Of these, 2333 patients with baseline brain imaging were identified and divided into two groups irrespective of treatment assignment, 1331 with evidence of previous cerebral infarction, defined as a history of ischemic stroke or transient ischemic attack > 6 months prior to randomization or radiological evidence of an asymptomatic infarct (group 1) and 1002 with normal imaging and no prior stroke or transient ischemic attack (group 2). Stroke and vascular deaths were compared during follow-up, and the impact of carotid endarterectomy was observed in both groups. Baseline characteristics of patients with and without baseline brain imaging were broadly similar. Of those included in the present report, male gender and hypertension were more common in group 1, while mean ipsilateral stenosis was slightly greater in group 2. At 10 years follow-up, stroke was more common among participants with cerebral infarction before randomization (absolute risk increase 5.8% (1.8-9.8), p = 0.004), and the risk of stroke and vascular death was also higher in this group (absolute risk increase 6.9% (1.9-12.0), p = 0.007). On multivariate analysis, prior cerebral infarction was associated with a greater risk of stroke (hazard ratio = 1.51, 95% confidence
Grip, Helena; Tengman, Eva; Häger, Charlotte K
2015-07-16
Finite helical axis (FHA) measures of the knee joint during weight-bearing tasks may capture dynamic knee stability following Anterior Cruciate Ligament (ACL) injury. The aim was to investigate dynamic knee stability during two-leg squat (TLS) and one-leg side hop (SH) in a long-term follow-up of ACL injury, and to examine correlations with knee laxity (KT-1000), osteoarthritis (OA, Kellgren-Lawrence) and knee function (Lysholm score). Participants were injured 17-28 years ago and then treated with surgery (n=33, ACLR) or physiotherapy only (n=37, ACLPT) and healthy-knee controls (n=33) were tested. Movements were registered with an optical motion capture system. We computed three FHA inclination angles, its' Anterior-Posterior (A-P) position, and an index quantifying directional changes (DI), during stepwise knee flexion intervals of ∼15°. Injured knees were less stable compared to healthy controls' and to contralateral non-injured knees, regardless of treatment: the A-P intersection was more anterior (indicating a more anterior positioning of tibia relative to femur) positively correlating with high laxity/low knee function, and during SH, the FHA was more inclined relative to the flexion-extension axis, possibly due to reduced rotational stability. During the TLS, A-P intersection was more anterior in the non-injured knee than the injured, and DI was higher, probably related to higher load on the non-injured knee. ACLR had less anterior A-P intersection than ACLPT, suggesting that surgery enhanced stability, although rotational stability may remain reduced. More anterior A-P intersection and greater inclination between the FHA and the knee flexion-extension axis best revealed reduced dynamic stability ∼23 years post-injury.
Sparse approximation with bases
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...
Boonen, Steven; Marin, Fernando; Obermayer-Pietsch, Barbara; Simões, Maria E; Barker, Clare; Glass, Emmett V; Hadji, Peyman; Lyritis, George; Oertel, Heide; Nickelsen, Thomas; McCloskey, Eugene V
2008-03-01
EUROFORS was a 2-yr prospective, randomized trial of postmenopausal women with established osteoporosis, designed to investigate various sequential treatments after teriparatide 20 microg/d for 1 yr. The present secondary analysis examined the effects of 2 yr of open-label teriparatide in women previously treated with antiresorptive drugs for at least 1 yr. A subgroup of 245 women with osteoporosis who had 2 yr of teriparatide treatment were stratified by previous predominant antiresorptive treatment into four groups: alendronate (n=107), risedronate (n=59), etidronate (n=30), and non-bisphosphonate (n=49). Bone mineral density (BMD) at the lumbar spine and hip was determined after 6, 12, 18, and 24 months, and bone formation markers were measured after 1 and 6 months. Significant increases in bone formation markers occurred in all groups after 1 month of teriparatide treatment. Lumbar spine BMD increased at all visits, whereas a transient decrease in hip BMD, which was subsequently reversed, was observed in all groups. BMD responses were similar in all previous antiresorptive groups. Previous etidronate users showed a higher increase at the spine but not at the hip BMD. Duration of previous antiresorptive therapy and lag time between stopping previous therapy and starting teriparatide did not affect the BMD response at any skeletal site. Treatment-emergent adverse events were similar to those reported in treatment-naive postmenopausal women with osteoporosis treated with teriparatide. Teriparatide induces positive effects on BMD and markers of bone formation in postmenopausal women with established osteoporosis, regardless of previous long-term exposure to antiresorptive therapies.
Approximate Representations and Approximate Homomorphisms
Moore, Cristopher
2010-01-01
Approximate algebraic structures play a defining role in arithmetic combinatorics and have found remarkable applications to basic questions in number theory and pseudorandomness. Here we study approximate representations of finite groups: functions f:G -> U_d such that Pr[f(xy) = f(x) f(y)] is large, or more generally Exp_{x,y} ||f(xy) - f(x)f(y)||^2$ is small, where x and y are uniformly random elements of the group G and U_d denotes the unitary group of degree d. We bound these quantities in terms of the ratio d / d_min where d_min is the dimension of the smallest nontrivial representation of G. As an application, we bound the extent to which a function f : G -> H can be an approximate homomorphism where H is another finite group. We show that if H's representations are significantly smaller than G's, no such f can be much more homomorphic than a random function. We interpret these results as showing that if G is quasirandom, that is, if d_min is large, then G cannot be embedded in a small number of dimensi...
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...
Rogers, Sinclair; Wheeler, T. J.
This paper reports the findings of a survey to determine the effects, if any, that experience in playgroups had upon children of varying social class backgrounds in differing areas within the United Kingdom. The project aimed at answering two major questions: (1) Did teachers perceive differences in first year infant school children that they…
Approximation techniques for engineers
Komzsik, Louis
2006-01-01
Presenting numerous examples, algorithms, and industrial applications, Approximation Techniques for Engineers is your complete guide to the major techniques used in modern engineering practice. Whether you need approximations for discrete data of continuous functions, or you''re looking for approximate solutions to engineering problems, everything you need is nestled between the covers of this book. Now you can benefit from Louis Komzsik''s years of industrial experience to gain a working knowledge of a vast array of approximation techniques through this complete and self-contained resource.
Yu-cheng Chen; Mei-ling Chen; Ying-ming Chiu
2011-01-01
Liquid injectable silicone has been used for soft tissue augmentation for five decades. Many complications following liquid silicone injection have been reported. To diagnose and manage silicone granuloma remains difficult. Silicone granuloma must be diagnosed with the history of liquid silicone injection and the histology of tissue biopsy. We presented a case of granulomatous reaction after the injection of liquid silicone for chin augmentation forty years ago, causing total facial swelling, which mimicking angioedema initially. We administered methylprednisolone to the patient. Initial response to methylprednisolone was favorable.
Olsen, Dorthe Reff; Montgomery, Edith; Bøjholm, Søren
2007-01-01
exposed to torture in their home country were interviewed at a Danish rehabilitation clinic on average 8 years after their final release from confinement and re-interviewed 10 years later. Interviews focused on history of exposure to physical and mental torture and on pain in the head, back and feet...... prevalent at study. RESULTS: The mean number of times imprisoned was 2.5 and the mean cumulative duration of imprisonment 19.4 months. The most frequent physical torture method reported was beating (95.0%) and the main mental torture method deprivation (88.5%). Pain reported at follow-up was strongly...... associated with pain reported at baseline, and the prevalence of pain increased considerably (pain in the head, 47.5% at baseline and 58.3% at follow-up; back, 48.2% and 75.5%; feet, 23.7% and 63.3%). Predictor patterns at baseline and at follow-up had common traits, so that pain in the head and pain...
Petersson, L G; Magnusson, K; Andersson, H; Deierborg, G; Twetman, S
1998-04-01
Development and progression of approximal caries is still difficult to prevent and control even in societies with declining caries prevalence. In this study, a test group of 115 12-yr old children were treated semi-annually with a mixture (1:1) of a varnish containing 0.1% F (Fluor Protector) and 1.0% chlorhexidine (Cervitec). A reference group of 104 children received fluoride varnish treatment (Fluor Protector) semi-annually. Approximal caries was recorded from bitewing radiographs at baseline and after 3 yr. At baseline, total decayed and filled surfaces (DFS) including enamel caries were 1.79+/-2.36 in the reference group and 2.0+/-2.77 in the test group. After 3 yr, the mean approximal caries incidence including enamel caries was 3.01+/-3.74 and 3.78+/-4.32, respectively. The differences at baseline as well as after 3 yr were not statistically significant. The results showed that both groups had a comparatively low incidence of approximal caries during the experimental period, and suggest that a mixture of fluoride and antibacterial varnish had no additional preventive effect on approximal caries incidence compared with fluoride varnish treatments alone.
Bevacqua, Daniele; Génard, Michel; Lescourret, Françoise
2012-01-01
In many woody plants, shoots emerging from buds can develop as short or long shoots. The probability of a bud to develop as a long or short shoot relies upon genetic, environmental and management factors and controlling it is an important issue in commercial orchard. We use peach (Prunus persicae) trees, subjected to different winter pruning levels and monitored for two years, to develop and calibrate a model linking the probability of a bud to develop as a long shoot to winter pruning intensity and previous year vegetative growth. Eventually we show how our model can be used to adjust pruning intensity to obtain a desired proportion of long and short shoots.
Diophantine approximation and automorphic spectrum
Ghosh, Anish; Nevo, Amos
2010-01-01
The present paper establishes qunatitative estimates on the rate of diophantine approximation in homogeneous varieties of semisimple algebraic groups. The estimates established generalize and improve previous ones, and are sharp in a number of cases. We show that the rate of diophantine approximation is controlled by the spectrum of the automorphic representation, and is thus subject to the generalised Ramanujan conjectures.
Error Minimization of Polynomial Approximation of Delta
Islam Sana; Sadiq Muhammad; Qureshi Muhammad Shahid
2008-09-01
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 developed to obtain the values of for any time of a year for the period AD 1620 to AD 2000 (Meeu 2000) as no dynamical theories describe the variations in . In this work, a new set of polynomials for is obtained for the period AD 1620 to AD 2007 that is found to produce better results compared to previous attempts.
Check, J H; Check, D L
2016-01-01
To evaluate the efficacy of intralipid intravenous infusion in achieving a live pregnancy following IVF--embryo transfer in women of advanced reproductive age (40-42 years). A matched control was performed. Women aged 40-42 with a previous history of miscarriage or who failed to conceive despite previous embryo transfer who entered an IVF program were offered intravenous intralipid therapy (four ml of 20% liposyn II in 100 ml normal saline over one hour) during the mid-follicular phase. Clinical pregnancy rates (eight weeks with viable gestation) and live delivered pregnancy rates were then determined and compared. The results were evaluated after ten matched cycles. There were no clinical pregnancies in those receiving intralipid vs. a 40% clinical and a 30% live delivered pregnancy rate in the untreated controls (p = 0.087, Fisher's exact test). The study was terminated because of these preliminary data. In the test tube, adding intralipid to natural killer cells can inhibit their cytolytic action. However, the use of intravenous intralipid to suppress natural killer cell activity does not seem to improve the chance of a live delivery in women aged 40-42 years with a previous history of miscarriage. In fact this therapy may actually be detrimental in this age group. Since efficacy of this therapy was not found in a group of advanced reproductive age, it is not clear why this should be effective for a younger population. A controlled study for the younger group is needed. Perhaps such a study could be limited to only those with miscarriage rather than also concluding failure to conceive despite embryo transfer. Intralipid failed to improve live delivered pregnancy rates in women with prior miscarriage or previous failure with embryo transfer.
Bevacqua, Daniele; Génard, Michel; Lescourret, Françoise
2012-01-01
In many woody plants, shoots emerging from buds can develop as short or long shoots. The probability of a bud to develop as a long or short shoot relies upon genetic, environmental and management factors and controlling it is an important issue in commercial orchard. We use peach (Prunus persicae) trees, subjected to different winter pruning levels and monitored for two years, to develop and calibrate a model linking the probability of a bud to develop as a long shoot to winter pruning intensity and previous year vegetative growth. Eventually we show how our model can be used to adjust pruning intensity to obtain a desired proportion of long and short shoots. PMID:23300609
Daniele Bevacqua
Full Text Available In many woody plants, shoots emerging from buds can develop as short or long shoots. The probability of a bud to develop as a long or short shoot relies upon genetic, environmental and management factors and controlling it is an important issue in commercial orchard. We use peach (Prunus persicae trees, subjected to different winter pruning levels and monitored for two years, to develop and calibrate a model linking the probability of a bud to develop as a long shoot to winter pruning intensity and previous year vegetative growth. Eventually we show how our model can be used to adjust pruning intensity to obtain a desired proportion of long and short shoots.
Wielders, Cornelia C. H.; Boerman, Anneroos W.; Schimmer, Barbara; van den Brom, René; Notermans, Daan W.; van der Hoek, Wim; Schneeberger, Peter M.
2015-01-01
Background Little is known about the development of chronic Q fever in occupational risk groups. The aim of this study was to perform long-term follow-up of Coxiella burnetii seropositive veterinarians and investigate the course of IgG phase I and phase II antibodies against C. burnetii antigens and to compare this course with that in patients previously diagnosed with acute Q fever. Methods Veterinarians with IgG phase I ≥1:256 (immunofluorescence assay) that participated in a previous seroprevalence study were asked to provide a second blood sample three years later. IgG antibody profiles were compared to a group of acute Q fever patients who had IgG phase I ≥1:256 twelve months after diagnosis. Results IgG phase I was detected in all veterinarians (n = 76) and in 85% of Q fever patients (n = 98) after three years (pveterinarians and 12% of patients (OR 3.95, 95% CI: 1.84–8.49). Conclusions IgG phase I persists among veterinarians presumably because of continuous exposure to C. burnetii during their work. Serological and clinical follow-up of occupationally exposed risk groups should be considered. PMID:25602602
de Whalley, Philip C S; Snape, Matthew D; Kelly, Dominic F; Banner, Carly; Lewis, Susan; Diggle, Linda; John, Tessa M; Yu, Ly-Mee; Omar, Omar; Borkowski, Astrid; Pollard, Andrew J
2011-11-01
Bactericidal antibody induced by immunization of infants with serogroup C Neisseria meningitidis (MenC) vaccines wanes rapidly during childhood. Adolescents are at particular risk from meningococcal disease, therefore they might benefit from a booster dose of vaccine. The duration of serologic response to such a booster in adolescents is unknown. In a previous study, English schoolchildren, aged 9 to 12 years, who had received a monovalent MenC glycoconjugate vaccine in 1999-2000, were given either a plain polysaccharide vaccine (MenC-PS group, n = 150) or a glycoconjugate vaccine (MenC-CRM group, n = 95) at 13 to 15 years of age. In this follow-up study, serum bactericidal antibody titers and specific immunoglobulin G concentrations were assessed 1 year later. Results were compared with unboosted controls of similar age (control group, n = 298). Compliance with study protocol was achieved for 146 of the MenC-PS group, 92 of the MenC-CRM group, and 293 of the control group. Compared with the control group, both the MenC-PS and MenC-CRM groups had a significantly higher (P CRM group 4417 [95% CI: 2951-6609]; control group 316 [95% CI: 252-396]). Specific immunoglobulin G concentration also rose and remained elevated 1 year after the booster. A booster dose of MenC vaccine given to adolescents produced a marked rise in bactericidal antibody, which remained elevated 1 year later. Introduction of an adolescent booster of MenC vaccine might provide enhanced long-term population control of the disease.
Diophantine approximation and badly approximable sets
Kristensen, S.; Thorn, R.; Velani, S.
2006-01-01
Let (X,d) be a metric space and (Omega, d) a compact subspace of X which supports a non-atomic finite measure m. We consider `natural' classes of badly approximable subsets of Omega. Loosely speaking, these consist of points in Omega which `stay clear' of some given set of points in X. The clas......Let (X,d) be a metric space and (Omega, d) a compact subspace of X which supports a non-atomic finite measure m. We consider `natural' classes of badly approximable subsets of Omega. Loosely speaking, these consist of points in Omega which `stay clear' of some given set of points in X....... The classical set Bad of `badly approximable' numbers in the theory of Diophantine approximation falls within our framework as do the sets Bad(i,j) of simultaneously badly approximable numbers. Under various natural conditions we prove that the badly approximable subsets of Omega have full Hausdorff dimension...
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.
Approximate Bayesian computation.
Mikael Sunnåker
Full Text Available 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.
Bergström, Eva-Karin; Birkhed, Dowen; Granlund, Christina; Sköld, Ulla Moberg
2014-10-01
To evaluate approximal caries increment among 12- to 16-year-olds in a low caries prevalence area in Sweden after a 3.5-year school-based fluoride (F) varnish programme with Bifluorid 12 and Duraphat. The design was a RCT study with 1365 adolescents, divided into following four groups: Group 1 Bifluorid 12 two applications/year; Group 2 Duraphat two applications/year; Group 3 Bifluorid 12 four applications/year and Group 4 no F varnish at school. 1143 children (84%) completed the study. Approximal caries was registered on bitewing radiographs. There were no statistically significant differences in caries prevalence among the groups either at baseline or after 3.5 years . The caries increment for Group 1 was 1.34 ± 2.99 (mean ± SD), 1.24 ± 2.84 for Group 2, 1.07 ± 2.66 for Group 3 and 1.25 ± 2.75 for Group 4, with no statically significant differences either between Bifluorid 12 and Duraphat with the same frequency of F varnish applications or between the F groups and the control group. In an area with low caries prevalence in Sweden, the supplementary caries-preventive effect of school-based F varnish applications, to regular use of F toothpaste at home and to regular caries prevention given at the Public Dental Clinics, appears to be nonsignificant regarding approximal caries increment. © 2014 John Wiley & Sons A/S. Published by John Wiley & Sons Ltd.
Leike, Reimar H
2016-01-01
In Bayesian statistics probability distributions express beliefs. However, for many problems the beliefs cannot be computed analytically and approximations of beliefs are needed. We seek a ranking function that quantifies how "embarrassing" it is to communicate a given approximation. We show that there is only one ranking under the requirements that (1) the best ranked approximation is the non-approximated belief and (2) that the ranking judges approximations only by their predictions for actual outcomes. We find that this ranking is equivalent to the Kullback-Leibler divergence that is frequently used in the literature. However, there seems to be confusion about the correct order in which its functional arguments, the approximated and non-approximated beliefs, should be used. We hope that our elementary derivation settles the apparent confusion. We show for example that when approximating beliefs with Gaussian distributions the optimal approximation is given by moment matching. This is in contrast to many su...
Rašin, Andrija
1994-01-01
We discuss the idea of approximate flavor symmetries. Relations between approximate flavor symmetries and natural flavor conservation and democracy models is explored. Implications for neutrino physics are also discussed.
On Element SDD Approximability
Avron, Haim; Toledo, Sivan
2009-01-01
This short communication shows that in some cases scalar elliptic finite element matrices cannot be approximated well by an SDD matrix. We also give a theoretical analysis of a simple heuristic method for approximating an element by an SDD matrix.
Approximate iterative algorithms
Almudevar, Anthony Louis
2014-01-01
Iterative algorithms often rely on approximate evaluation techniques, which may include statistical estimation, computer simulation or functional approximation. This volume presents methods for the study of approximate iterative algorithms, providing tools for the derivation of error bounds and convergence rates, and for the optimal design of such algorithms. Techniques of functional analysis are used to derive analytical relationships between approximation methods and convergence properties for general classes of algorithms. This work provides the necessary background in functional analysis a
Some relations between entropy and approximation numbers
郑志明
1999-01-01
A general result is obtained which relates the entropy numbers of compact maps on Hilbert space to its approximation numbers. Compared with previous works in this area, it is particularly convenient for dealing with the cases where the approximation numbers decay rapidly. A nice estimation between entropy and approximation numbers for noncompact maps is given.
Approximation of distributed delays
Lu, Hao; Eberard, Damien; Simon, Jean-Pierre
2010-01-01
We address in this paper the approximation problem of distributed delays. Such elements are convolution operators with kernel having bounded support, and appear in the control of time-delay systems. From the rich literature on this topic, we propose a general methodology to achieve such an approximation. For this, we enclose the approximation problem in the graph topology, and work with the norm defined over the convolution Banach algebra. The class of rational approximates is described, and a constructive approximation is proposed. Analysis in time and frequency domains is provided. This methodology is illustrated on the stabilization control problem, for which simulations results show the effectiveness of the proposed methodology.
Diophantine approximation and badly approximable sets
Kristensen, S.; Thorn, R.; Velani, S.
2006-01-01
Let (X,d) be a metric space and (Omega, d) a compact subspace of X which supports a non-atomic finite measure m. We consider `natural' classes of badly approximable subsets of Omega. Loosely speaking, these consist of points in Omega which `stay clear' of some given set of points in X. The clas......Let (X,d) be a metric space and (Omega, d) a compact subspace of X which supports a non-atomic finite measure m. We consider `natural' classes of badly approximable subsets of Omega. Loosely speaking, these consist of points in Omega which `stay clear' of some given set of points in X...
Achieser, N I
2004-01-01
A pioneer of many modern developments in approximation theory, N. I. Achieser designed this graduate-level text from the standpoint of functional analysis. The first two chapters address approximation problems in linear normalized spaces and the ideas of P. L. Tchebysheff. Chapter III examines the elements of harmonic analysis, and Chapter IV, integral transcendental functions of the exponential type. The final two chapters explore the best harmonic approximation of functions and Wiener's theorem on approximation. Professor Achieser concludes this exemplary text with an extensive section of pr
Reinforcement Learning via AIXI Approximation
Veness, Joel; Hutter, Marcus; Silver, David
2010-01-01
This paper introduces a principled approach for the design of a scalable general reinforcement learning agent. This approach is based on a direct approximation of AIXI, a Bayesian optimality notion for general reinforcement learning agents. Previously, it has been unclear whether the theory of AIXI could motivate the design of practical algorithms. We answer this hitherto open question in the affirmative, by providing the first computationally feasible approximation to the AIXI agent. To develop our approximation, we introduce a Monte Carlo Tree Search algorithm along with an agent-specific extension of the Context Tree Weighting algorithm. Empirically, we present a set of encouraging results on a number of stochastic, unknown, and partially observable domains.
Expectation Consistent Approximate Inference
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...
Ordered cones and approximation
Keimel, Klaus
1992-01-01
This book presents a unified approach to Korovkin-type approximation theorems. It includes classical material on the approximation of real-valuedfunctions as well as recent and new results on set-valued functions and stochastic processes, and on weighted approximation. The results are notonly of qualitative nature, but include quantitative bounds on the order of approximation. The book is addressed to researchers in functional analysis and approximation theory as well as to those that want to applythese methods in other fields. It is largely self- contained, but the readershould have a solid background in abstract functional analysis. The unified approach is based on a new notion of locally convex ordered cones that are not embeddable in vector spaces but allow Hahn-Banach type separation and extension theorems. This concept seems to be of independent interest.
Approximate Modified Policy Iteration
Scherrer, Bruno; Ghavamzadeh, Mohammad; Geist, Matthieu
2012-01-01
Modified policy iteration (MPI) is a dynamic programming (DP) algorithm that contains the two celebrated policy and value iteration methods. Despite its generality, MPI has not been thoroughly studied, especially its approximation form which is used when the state and/or action spaces are large or infinite. In this paper, we propose three approximate MPI (AMPI) algorithms that are extensions of the well-known approximate DP algorithms: fitted-value iteration, fitted-Q iteration, and classification-based policy iteration. We provide an error propagation analysis for AMPI that unifies those for approximate policy and value iteration. We also provide a finite-sample analysis for the classification-based implementation of AMPI (CBMPI), which is more general (and somehow contains) than the analysis of the other presented AMPI algorithms. An interesting observation is that the MPI's parameter allows us to control the balance of errors (in value function approximation and in estimating the greedy policy) in the fina...
Approximate calculation of integrals
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
Approximate and renormgroup symmetries
Ibragimov, Nail H. [Blekinge Institute of Technology, Karlskrona (Sweden). Dept. of Mathematics Science; Kovalev, Vladimir F. [Russian Academy of Sciences, Moscow (Russian Federation). Inst. of Mathematical Modeling
2009-07-01
''Approximate and Renormgroup Symmetries'' deals with approximate transformation groups, symmetries of integro-differential equations and renormgroup symmetries. It includes a concise and self-contained introduction to basic concepts and methods of Lie group analysis, and provides an easy-to-follow introduction to the theory of approximate transformation groups and symmetries of integro-differential equations. The book is designed for specialists in nonlinear physics - mathematicians and non-mathematicians - interested in methods of applied group analysis for investigating nonlinear problems in physical science and engineering. (orig.)
Approximating Stationary Statistical Properties
Xiaoming WANG
2009-01-01
It is well-known that physical laws for large chaotic dynamical systems are revealed statistically. Many times these statistical properties of the system must be approximated numerically. The main contribution of this manuscript is to provide simple and natural criterions on numerical methods (temporal and spatial discretization) that are able to capture the stationary statistical properties of the underlying dissipative chaotic dynamical systems asymptotically. The result on temporal approximation is a recent finding of the author, and the result on spatial approximation is a new one. Applications to the infinite Prandtl number model for convection and the barotropic quasi-geostrophic model are also discussed.
Malvina Baica
1985-01-01
Full Text Available The author uses a new modification of Jacobi-Perron Algorithm which holds for complex fields of any degree (abbr. ACF, and defines it as Generalized Euclidean Algorithm (abbr. GEA to approximate irrationals.
Approximations in Inspection Planning
Engelund, S.; Sørensen, John Dalsgaard; Faber, M. H.
2000-01-01
Planning of inspections of civil engineering structures may be performed within the framework of Bayesian decision analysis. The effort involved in a full Bayesian decision analysis is relatively large. Therefore, the actual inspection planning is usually performed using a number of approximations....... One of the more important of these approximations is the assumption that all inspections will reveal no defects. Using this approximation the optimal inspection plan may be determined on the basis of conditional probabilities, i.e. the probability of failure given no defects have been found...... by the inspection. In this paper the quality of this approximation is investigated. The inspection planning is formulated both as a full Bayesian decision problem and on the basis of the assumption that the inspection will reveal no defects....
The Karlqvist approximation revisited
Tannous, C
2015-01-01
The Karlqvist approximation signaling the historical beginning of magnetic recording head theory is reviewed and compared to various approaches progressing from Green, Fourier, Conformal mapping that obeys the Sommerfeld edge condition at angular points and leads to exact results.
Approximations in Inspection Planning
Engelund, S.; Sørensen, John Dalsgaard; Faber, M. H.
2000-01-01
Planning of inspections of civil engineering structures may be performed within the framework of Bayesian decision analysis. The effort involved in a full Bayesian decision analysis is relatively large. Therefore, the actual inspection planning is usually performed using a number of approximations....... One of the more important of these approximations is the assumption that all inspections will reveal no defects. Using this approximation the optimal inspection plan may be determined on the basis of conditional probabilities, i.e. the probability of failure given no defects have been found...... by the inspection. In this paper the quality of this approximation is investigated. The inspection planning is formulated both as a full Bayesian decision problem and on the basis of the assumption that the inspection will reveal no defects....
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
Approximation Behooves Calibration
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.......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....
Approximate kernel competitive learning.
Wu, Jian-Sheng; Zheng, Wei-Shi; Lai, Jian-Huang
2015-03-01
Kernel competitive learning has been successfully used to achieve robust clustering. However, kernel competitive learning (KCL) is not scalable for large scale data processing, because (1) it has to calculate and store the full kernel matrix that is too large to be calculated and kept in the memory and (2) it cannot be computed in parallel. In this paper we develop a framework of approximate kernel competitive learning for processing large scale dataset. The proposed framework consists of two parts. First, it derives an approximate kernel competitive learning (AKCL), which learns kernel competitive learning in a subspace via sampling. We provide solid theoretical analysis on why the proposed approximation modelling would work for kernel competitive learning, and furthermore, we show that the computational complexity of AKCL is largely reduced. Second, we propose a pseudo-parallelled approximate kernel competitive learning (PAKCL) based on a set-based kernel competitive learning strategy, which overcomes the obstacle of using parallel programming in kernel competitive learning and significantly accelerates the approximate kernel competitive learning for large scale clustering. The empirical evaluation on publicly available datasets shows that the proposed AKCL and PAKCL can perform comparably as KCL, with a large reduction on computational cost. Also, the proposed methods achieve more effective clustering performance in terms of clustering precision against related approximate clustering approaches.
Maksim Duškin
2015-11-01
Full Text Available Approximation and supposition This article compares exponents of approximation (expressions like Russian около, примерно, приблизительно, более, свыше and the words expressing supposition (for example Russian скорее всего, наверное, возможно. These words are often confused in research, in particular researchers often mention exponents of supposition in case of exponents of approximation. Such approach arouses some objections. The author intends to demonstrate in this article a notional difference between approximation and supposition, therefore the difference between exponents of these two notions. This difference could be described by specifying different attitude of approximation and supposition to the notion of knowledge. Supposition implies speaker’s ignorance of the exact number, while approximation does not mean such ignorance. The article offers examples proving this point of view.
Fiala, J.; Cernikovsky, L.; Leeuw, F. de; Kurfuerst, P.; Aalst, R. van (eds.)
2003-07-01
In the period 1995-2003 of reporting tinder the old ozone directive, there has been little or no change in the reported exceedances of ozone threshold values. This is not unexpected as reductions in the EU emissions of nitrogen oxides and nonmethane volatile organic compounds, the main ozone precursors, have so far been limited - about 30 % between 1990 and 2000. 2010 under the national emission teilings directive. While peak ozone concentrations seem to go down, ozone concentration statistics relevant to the target values set in the new ozone directive show little or no reduction in the period 1996-2000. Very few stations actually show a significant downward trend for these stabstics. The threshold for warning the population continues to be exceeded on a few occasions Bach year, while the threshold for informing the population is exceeded at riost stations in most countries (outside northern Europe and Ireland) each year, generally more so in warm summers. These exceedances are likely to retur in years with temperatures above the long-term average until there is a substantially larger decrease in precursor emissions. A further reduction of about 30 % is foreseen towards Under current legislation and with the rate of turnover of the vehicle fleet, furtber reductions will gradually occur towards 2010, and further reductions may be necessary to achieve the target values of the new ozone directive. Note that, due to the uncertainties caused by year-to-year meteorological variations and the changes in the monitoring station configuration, these conclusions are tentative. (au)
Repantis, Thomas; Vitsas, Vasilis; Korovessis, Panagiotis
2013-03-20
Between 1994 and 1999, 217 metal-on-metal total hip arthroplasties with a low-carbide bearing surface were performed with use of the cementless Zweymüller SL-Plus stem and the Bicon-Plus threaded cup in 194 consecutive patients. After a minimum follow-up of ten years, 181 living patients (203 hips) were available for evaluation. The revision rate after an average of twelve years was 18% (thirty-six hips in thirty-six patients were revised). The main reason for revision was aseptic loosening of one or both components. The probability of survival of the stem at fifteen years was 77% (95% confidence interval [CI], 65% to 86%). The probability of survival of the cup was 80% (95% CI, 62% to 90%). These high failure rates at mid-term follow-up led us to abandon the use of low-carbide metal-on-metal total hip arthroplasty components.
Stefoni, V; Casadei, B; Bottelli, C; Gaidano, G; Ciochetto, C; Cabras, M G; Ansuinelli, M; Argnani, L; Broccoli, A; Gandolfi, L; Pellegrini, C; Zinzani, P L
2016-01-01
An update at 7 years was conceived for our multicenter phase II study in which 55 elderly high-risk untreated diffuse large B-cell lymphoma patients were treated with 90Y-ibritumomab tiuxetan after a short course of rituximab, cyclophosphamide, doxorubicin, vincristine and prednisolone (R-CHOP) as long-term follow-up analyses of this combined therapeutic modality are lacking. The overall response rate to the entire regimen was 80%, including 73% (40/55) of complete response (CR) rate and 7% (4/55) of partial response rate. At the time of writing, 24/55 (43.6%) patients experienced a progression disease and 20 of 40 (50%) patients who obtained a CR are still alive in continuous CR. With a median follow-up of 7 years, the disease-free survival was 43.3% and the progression-free survival was 36.1%. The overall survival at 7.9 years was 38.9% (27 deaths mainly because of lymphoma). Two patients developed secondary hematological malignancies, an acute myeloid leukemia and a myelodysplastic syndrome, at 4 and 3 years from radioimmunotherapy, respectively. Our data confirm the feasibility, efficacy and safety of four cycles of R-CHOP followed by radioimmunotherapy consolidation even in the long term: this combination allows dispensing less chemotherapy in a frail group of patients without invalidating response quality and duration. PMID:27176801
Covariant approximation averaging
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.
Diophantine approximations on fractals
Einsiedler, Manfred; Shapira, Uri
2009-01-01
We exploit dynamical properties of diagonal actions to derive results in Diophantine approximations. In particular, we prove that the continued fraction expansion of almost any point on the middle third Cantor set (with respect to the natural measure) contains all finite patterns (hence is well approximable). Similarly, we show that for a variety of fractals in [0,1]^2, possessing some symmetry, almost any point is not Dirichlet improvable (hence is well approximable) and has property C (after Cassels). We then settle by similar methods a conjecture of M. Boshernitzan saying that there are no irrational numbers x in the unit interval such that the continued fraction expansions of {nx mod1 : n is a natural number} are uniformly eventually bounded.
Monotone Boolean approximation
Hulme, B.L.
1982-12-01
This report presents a theory of approximation of arbitrary Boolean functions by simpler, monotone functions. Monotone increasing functions can be expressed without the use of complements. Nonconstant monotone increasing functions are important in their own right since they model a special class of systems known as coherent systems. It is shown here that when Boolean expressions for noncoherent systems become too large to treat exactly, then monotone approximations are easily defined. The algorithms proposed here not only provide simpler formulas but also produce best possible upper and lower monotone bounds for any Boolean function. This theory has practical application for the analysis of noncoherent fault trees and event tree sequences.
No Previous Public Services Required
Taylor, Kelley R.
2009-01-01
In 2007, the Supreme Court heard a case that involved the question of whether a school district could be required to reimburse parents who unilaterally placed their child in private school when the child had not previously received special education and related services in a public institution ("Board of Education v. Tom F."). The…
Tanno Hugo
2011-06-01
Full Text Available Abstract Background Complex mutants can be selected under sequential selective pressure by HBV therapy. To determine hepatitis B virus genomic evolution during antiviral therapy we characterized the HBV quasi-species in a patient who did no respond to therapy following lamivudine breakthrough for a period of 14 years. Case Presentation The polymerase and precore/core genes were amplified and sequenced at determined intervals in a period of 14 years. HBV viral load and HBeAg/Anti-HBe serological profiles as well as amino transferase levels were also measured. A mixture of lamivudine-resistant genotype A2 HBV strains harboring the rtM204V mutation coexisted in the patient following viral breakthrough to lamivudine. The L180M+M204V dominant mutant displayed strong lamivudine-resistance. As therapy was changed to adefovir, then to entecavir, and finally to entecavir-tenofovir the viral load showed fluctuations but lamivudine-resistant strains continued to be selected, with minor contributions to the HBV quasi-species composition of additional resistance-associated mutations. At the end of the 14-year follow up period, high viral loads were predominant, with viral strains harboring the lamivudine-resistance signature rtL180M+M204V. The precore/core frame A1762T and G1764A double mutation was detected before treatment and remaining in this condition during the entire follow-up. Specific entecavir and tenofovir primary resistance-associated mutations were not detected at any time. Plasma concentrations of tenofovir indicated adequate metabolism of the drug. Conclusions We report the selection of HBV mutants carrying well-defined primary resistance mutations that escaped lamivudine in a fourteen-year follow-up period. With the exception of tenofovir resistance mutations, subsequent unselected primary resistance mutations were detected as minor populations into the HBV quasispecies composition during adefovir or entecavir monotherapies. Although
Prestack wavefield approximations
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.
On Convex Quadratic Approximation
den Hertog, D.; de Klerk, E.; Roos, J.
2000-01-01
In this paper we prove the counterintuitive result that the quadratic least squares approximation of a multivariate convex function in a finite set of points is not necessarily convex, even though it is convex for a univariate convex function. This result has many consequences both for the field of
Norton, Andrew H.
1991-01-01
Local spline approximants offer a means for constructing finite difference formulae for numerical solution of PDEs. These formulae seem particularly well suited to situations in which the use of conventional formulae leads to non-linear computational instability of the time integration. This is explained in terms of frequency responses of the FDF.
On Convex Quadratic Approximation
den Hertog, D.; de Klerk, E.; Roos, J.
2000-01-01
In this paper we prove the counterintuitive result that the quadratic least squares approximation of a multivariate convex function in a finite set of points is not necessarily convex, even though it is convex for a univariate convex function. This result has many consequences both for the field of
Approximation by Cylinder Surfaces
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...
Rollout Sampling Approximate Policy Iteration
Dimitrakakis, Christos
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 supervised learning problem. This paper proposes variants of an improved policy iteration scheme which addresses the core sampling problem in evaluating a policy through simulation as a multi-armed bandit machine. The resulting algorithm offers comparable performance to the previous algorithm achieved, however, with significantly less computational effort. An order of magnitude improvement is demonstrated experimentally in two standard reinforcement learning domains: inverted pendulum and mountain-car.
Koffi Alphonsine A
2012-04-01
Full Text Available Abstract Background At Yaokoffikro field site near Bouaké, in central Côte d'Ivoire, a group of experimental huts built in 1996 served over many years for the evaluation of insecticides against highly resistant mosquitoes. Breeding sites of mosquitoes and selection pressure in the area were maintained by local farming practices until a war broke out in September 2002. Six years after the crisis, we conducted bioassays and biochemical analysis to update the resistance status of Anopheles gambiae s.s. populations and detect other potential mechanisms of resistance that might have evolved. Methods An. gambiae s.s. larvae from Yaokoffikro were collected in breeding sites and reared to adults. Resistance status of this population to insecticides was assessed using WHO bioassay test kits for adult mosquitoes with seven insecticides: two pyrethroids, a pseudo-pyrethroid, an organochloride, two carbamates and an organophosphate. Molecular and biochemical assays were carried out to identify the L1014F kdr and ace-1R alleles in individual mosquitoes and to detect potential increase in mixed function oxidases (MFO, non-specific esterases (NSE and glutathione S-transferases (GST activity. Results High pyrethroids, DDT and carbamate resistance was confirmed in An. gambiae s.s. populations from Yaokoffikro. Mortality rates were less than 70% with pyrethroids and etofenprox, 12% with DDT, and less than 22% with the carbamates. Tolerance to fenitrothion was observed, with 95% mortality after 24 h. PCR analysis of samples from the site showed high allelic frequency of the L1014F kdr (0.94 and the ace-1R (0.50 as before the crisis. In addition, increased activity of NSE, GST and to a lesser extent MFO was found relative to the reference strain Kisumu. This was the first report detecting enhanced activity of these enzymes in An. gambiae s.s from Yaokoffikro, which could have serious implications in detoxification of insecticides. Their specific roles in
Topology, calculus and approximation
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...
Prestack traveltime approximations
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.
Optimization and approximation
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.
Topics in Metric Approximation
Leeb, William Edward
This thesis develops effective approximations of certain metrics that occur frequently in pure and applied mathematics. We show that distances that often arise in applications, such as the Earth Mover's Distance between two probability measures, can be approximated by easily computed formulas for a wide variety of ground distances. We develop simple and easily computed characterizations both of norms measuring a function's regularity -- such as the Lipschitz norm -- and of their duals. We are particularly concerned with the tensor product of metric spaces, where the natural notion of regularity is not the Lipschitz condition but the mixed Lipschitz condition. A theme that runs throughout this thesis is that snowflake metrics (metrics raised to a power less than 1) are often better-behaved than ordinary metrics. For example, we show that snowflake metrics on finite spaces can be approximated by the average of tree metrics with a distortion bounded by intrinsic geometric characteristics of the space and not the number of points. Many of the metrics for which we characterize the Lipschitz space and its dual are snowflake metrics. We also present applications of the characterization of certain regularity norms to the problem of recovering a matrix that has been corrupted by noise. We are able to achieve an optimal rate of recovery for certain families of matrices by exploiting the relationship between mixed-variable regularity conditions and the decay of a function's coefficients in a certain orthonormal basis.
Behre, Ulrich; Van Der Meeren, Olivier; Crasta, Priya; Hanssens, Linda; Mesaros, Narcisa
2016-11-01
Vaccinating infants against hepatitis B virus (HBV) is the most effective way of preventing the disease. However, since HBV exposure can increase during adolescence, it is essential that antibody persistence is maintained. We evaluated the antibody persistence and immune memory against hepatitis B, in 12-13 y olds who had received complete primary + booster vaccination with diphtheria-tetanus-acellular pertussis-hepatitis B-inactivated poliovirus/Haemophilus influenza type b (DTPa-HBV-IPV/Hib) vaccine in infancy. Open phase-IV study conducted at 12 centers in Germany [NCT02052661]. Adolescents aged 12-13 y, vaccinated with 4 doses of DTPa-HBV-IPV/Hib (Infanrix hexa™, GSK Vaccines) in infancy, received a single challenge dose of monovalent pediatric hepatitis B vaccine (Engerix™-B Kinder; GSK Vaccines). Blood samples were taken before and 1-month post-challenge to measure anti-hepatitis B (anti-HBs) antibodies using a chemiluminescence immunoassay (seroprotection cut-off: ≥10 mIU/ml). Post-challenge adverse events (AEs) were monitored. 300 subjects were vaccinated; of 293 subjects in the ATP immunogenicity cohort, 60.5% had pre-challenge anti-HBs antibodies ≥10 mIU/ml, which rose to 97.6% post-challenge (≥100 mIU/ml in 94.1%). An anamnestic response was seen in 96.5% subjects. A 150-fold increase in antibody geometric mean concentrations was observed (22.4 to 3502.6 mIU/ml). Pain (44%) and fatigue (24.3%) were the most frequent solicited local and general AEs, respectively; 14.7% subjects reported unsolicited symptoms during the 31-day post-vaccination period. Two vaccine-unrelated serious AEs occurred. Vaccination with DTPa-HBV-IPV/Hib in infancy induces sustained seroprotection and immune memory against HBV, as shown by the strong anamnestic response to the hepatitis B vaccine challenge in 12-13 year-old adolescents.
Chalasani, P.; Saias, I. [Los Alamos National Lab., NM (United States); Jha, S. [Carnegie Mellon Univ., Pittsburgh, PA (United States)
1996-04-08
As increasingly large volumes of sophisticated options (called derivative securities) are traded in world financial markets, determining a fair price for these options has become an important and difficult computational problem. Many valuation codes use the binomial pricing model, in which the stock price is driven by a random walk. In this model, the value of an n-period option on a stock is the expected time-discounted value of the future cash flow on an n-period stock price path. Path-dependent options are particularly difficult to value since the future cash flow depends on the entire stock price path rather than on just the final stock price. Currently such options are approximately priced by Monte carlo methods with error bounds that hold only with high probability and which are reduced by increasing the number of simulation runs. In this paper the authors show that pricing an arbitrary path-dependent option is {number_sign}-P hard. They show that certain types f path-dependent options can be valued exactly in polynomial time. Asian options are path-dependent options that are particularly hard to price, and for these they design deterministic polynomial-time approximate algorithms. They show that the value of a perpetual American put option (which can be computed in constant time) is in many cases a good approximation to the value of an otherwise identical n-period American put option. In contrast to Monte Carlo methods, the algorithms have guaranteed error bounds that are polynormally small (and in some cases exponentially small) in the maturity n. For the error analysis they derive large-deviation results for random walks that may be of independent interest.
Finite elements and approximation
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
Roy, Swapnoneel; Thakur, Ashok Kumar
2008-01-01
Genome rearrangements have been modelled by a variety of primitives such as reversals, transpositions, block moves and block interchanges. We consider such a genome rearrangement primitive Strip Exchanges. Given a permutation, the challenge is to sort it by using minimum number of strip exchanges. A strip exchanging move interchanges the positions of two chosen strips so that they merge with other strips. The strip exchange problem is to sort a permutation using minimum number of strip exchanges. We present here the first non-trivial 2-approximation algorithm to this problem. We also observe that sorting by strip-exchanges is fixed-parameter-tractable. Lastly we discuss the application of strip exchanges in a different area Optical Character Recognition (OCR) with an example.
Approximation by Cylinder Surfaces
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....
S-Approximation: A New Approach to Algebraic Approximation
M. R. Hooshmandasl
2014-01-01
Full Text Available We intend to study a new class of algebraic approximations, called S-approximations, and their properties. We have shown that S-approximations can be used for applied problems which cannot be modeled by inclusion based approximations. Also, in this work, we studied a subclass of S-approximations, called Sℳ-approximations, and showed that this subclass preserves most of the properties of inclusion based approximations but is not necessarily inclusionbased. The paper concludes by studying some basic operations on S-approximations and counting the number of S-min functions.
Dodgson's Rule Approximations and Absurdity
McCabe-Dansted, John C
2010-01-01
With the Dodgson rule, cloning the electorate can change the winner, which Young (1977) considers an "absurdity". Removing this absurdity results in a new rule (Fishburn, 1977) for which we can compute the winner in polynomial time (Rothe et al., 2003), unlike the traditional Dodgson rule. We call this rule DC and introduce two new related rules (DR and D&). Dodgson did not explicitly propose the "Dodgson rule" (Tideman, 1987); we argue that DC and DR are better realizations of the principle behind the Dodgson rule than the traditional Dodgson rule. These rules, especially D&, are also effective approximations to the traditional Dodgson's rule. We show that, unlike the rules we have considered previously, the DC, DR and D& scores differ from the Dodgson score by no more than a fixed amount given a fixed number of alternatives, and thus these new rules converge to Dodgson under any reasonable assumption on voter behaviour, including the Impartial Anonymous Culture assumption.
An overview on Approximate Bayesian computation*
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.
Staying Thermal with Hartree Ensemble Approximations
Salle, M; Vink, Jeroen C
2000-01-01
Using Hartree ensemble approximations to compute the real time dynamics of scalar fields in 1+1 dimension, we find that with suitable initial conditions, approximate thermalization is achieved much faster than found in our previous work. At large times, depending on the interaction strength and temperature, the particle distribution slowly changes: the Bose-Einstein distribution of the particle densities develops classical features. We also discuss variations of our method which are numerically more efficient.
Prestack traveltime approximations
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.
Operators of Approximations and Approximate Power Set Spaces
ZHANG Xian-yong; MO Zhi-wen; SHU Lan
2004-01-01
Boundary inner and outer operators are introduced; and union, intersection, complement operators of approximations are redefined. The approximation operators have a good property of maintaining union, intersection, complement operators, so the rough set theory has been enriched from the operator-oriented and set-oriented views. Approximate power set spaces are defined, and it is proved that the approximation operators are epimorphisms from power set space to approximate power set spaces. Some basic properties of approximate power set space are got by epimorphisms in contrast to power set space.
International Conference Approximation Theory XV
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...
Robust Generalized Low Rank Approximations of Matrices.
Jiarong Shi
Full Text Available In recent years, the intrinsic low rank structure of some datasets has been extensively exploited to reduce dimensionality, remove noise and complete the missing entries. As a well-known technique for dimensionality reduction and data compression, Generalized Low Rank Approximations of Matrices (GLRAM claims its superiority on computation time and compression ratio over the SVD. However, GLRAM is very sensitive to sparse large noise or outliers and its robust version does not have been explored or solved yet. To address this problem, this paper proposes a robust method for GLRAM, named Robust GLRAM (RGLRAM. We first formulate RGLRAM as an l1-norm optimization problem which minimizes the l1-norm of the approximation errors. Secondly, we apply the technique of Augmented Lagrange Multipliers (ALM to solve this l1-norm minimization problem and derive a corresponding iterative scheme. Then the weak convergence of the proposed algorithm is discussed under mild conditions. Next, we investigate a special case of RGLRAM and extend RGLRAM to a general tensor case. Finally, the extensive experiments on synthetic data show that it is possible for RGLRAM to exactly recover both the low rank and the sparse components while it may be difficult for previous state-of-the-art algorithms. We also discuss three issues on RGLRAM: the sensitivity to initialization, the generalization ability and the relationship between the running time and the size/number of matrices. Moreover, the experimental results on images of faces with large corruptions illustrate that RGLRAM obtains the best denoising and compression performance than other methods.
Robust Generalized Low Rank Approximations of Matrices.
Shi, Jiarong; Yang, Wei; Zheng, Xiuyun
2015-01-01
In recent years, the intrinsic low rank structure of some datasets has been extensively exploited to reduce dimensionality, remove noise and complete the missing entries. As a well-known technique for dimensionality reduction and data compression, Generalized Low Rank Approximations of Matrices (GLRAM) claims its superiority on computation time and compression ratio over the SVD. However, GLRAM is very sensitive to sparse large noise or outliers and its robust version does not have been explored or solved yet. To address this problem, this paper proposes a robust method for GLRAM, named Robust GLRAM (RGLRAM). We first formulate RGLRAM as an l1-norm optimization problem which minimizes the l1-norm of the approximation errors. Secondly, we apply the technique of Augmented Lagrange Multipliers (ALM) to solve this l1-norm minimization problem and derive a corresponding iterative scheme. Then the weak convergence of the proposed algorithm is discussed under mild conditions. Next, we investigate a special case of RGLRAM and extend RGLRAM to a general tensor case. Finally, the extensive experiments on synthetic data show that it is possible for RGLRAM to exactly recover both the low rank and the sparse components while it may be difficult for previous state-of-the-art algorithms. We also discuss three issues on RGLRAM: the sensitivity to initialization, the generalization ability and the relationship between the running time and the size/number of matrices. Moreover, the experimental results on images of faces with large corruptions illustrate that RGLRAM obtains the best denoising and compression performance than other methods.
Books average previous decade of economic misery.
R Alexander Bentley
Full Text Available For the 20(th century since the Depression, we find a strong correlation between a 'literary misery index' derived from English language books and a moving average of the previous decade of the annual U.S. economic misery index, which is the sum of inflation and unemployment rates. We find a peak in the goodness of fit at 11 years for the moving average. The fit between the two misery indices holds when using different techniques to measure the literary misery index, and this fit is significantly better than other possible correlations with different emotion indices. To check the robustness of the results, we also analysed books written in German language and obtained very similar correlations with the German economic misery index. The results suggest that millions of books published every year average the authors' shared economic experiences over the past decade.
Books average previous decade of economic misery.
Bentley, R Alexander; Acerbi, Alberto; Ormerod, Paul; Lampos, Vasileios
2014-01-01
For the 20(th) century since the Depression, we find a strong correlation between a 'literary misery index' derived from English language books and a moving average of the previous decade of the annual U.S. economic misery index, which is the sum of inflation and unemployment rates. We find a peak in the goodness of fit at 11 years for the moving average. The fit between the two misery indices holds when using different techniques to measure the literary misery index, and this fit is significantly better than other possible correlations with different emotion indices. To check the robustness of the results, we also analysed books written in German language and obtained very similar correlations with the German economic misery index. The results suggest that millions of books published every year average the authors' shared economic experiences over the past decade.
Asynchronous stochastic approximation with differential inclusions
David S. Leslie
2012-01-01
Full Text Available The asymptotic pseudo-trajectory approach to stochastic approximation of Benaïm, Hofbauer and Sorin is extended for asynchronous stochastic approximations with a set-valued mean field. The asynchronicity of the process is incorporated into the mean field to produce convergence results which remain similar to those of an equivalent synchronous process. In addition, this allows many of the restrictive assumptions previously associated with asynchronous stochastic approximation to be removed. The framework is extended for a coupled asynchronous stochastic approximation process with set-valued mean fields. Two-timescales arguments are used here in a similar manner to the original work in this area by Borkar. The applicability of this approach is demonstrated through learning in a Markov decision process.
On Approximating Four Covering and Packing Problems
Ashley, Mary; Berman, Piotr; Chaovalitwongse, Wanpracha; DasGupta, Bhaskar; Kao, Ming-Yang; 10.1016/j.jcss.2009.01.002
2011-01-01
In this paper, we consider approximability issues of the following four problems: triangle packing, full sibling reconstruction, maximum profit coverage and 2-coverage. All of them are generalized or specialized versions of set-cover and have applications in biology ranging from full-sibling reconstructions in wild populations to biomolecular clusterings; however, as this paper shows, their approximability properties differ considerably. Our inapproximability constant for the triangle packing problem improves upon the previous results; this is done by directly transforming the inapproximability gap of Haastad for the problem of maximizing the number of satisfied equations for a set of equations over GF(2) and is interesting in its own right. Our approximability results on the full siblings reconstruction problems answers questions originally posed by Berger-Wolf et al. and our results on the maximum profit coverage problem provides almost matching upper and lower bounds on the approximation ratio, answering a...
Hierarchical low-rank approximation for high dimensional approximation
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.
Nonlinear Approximation Using Gaussian Kernels
Hangelbroek, Thomas
2009-01-01
It is well-known that non-linear approximation has an advantage over linear schemes in the sense that it provides comparable approximation rates to those of the linear schemes, but to a larger class of approximands. This was established for spline approximations and for wavelet approximations, and more recently for homogeneous radial basis function (surface spline) approximations. However, no such results are known for the Gaussian function. The crux of the difficulty lies in the necessity to vary the tension parameter in the Gaussian function spatially according to local information about the approximand: error analysis of Gaussian approximation schemes with varying tension are, by and large, an elusive target for approximators. We introduce and analyze in this paper a new algorithm for approximating functions using translates of Gaussian functions with varying tension parameters. Our scheme is sophisticated to a degree that it employs even locally Gaussians with varying tensions, and that it resolves local ...
Forms of Approximate Radiation Transport
Brunner, G
2002-01-01
Photon radiation transport is described by the Boltzmann equation. Because this equation is difficult to solve, many different approximate forms have been implemented in computer codes. Several of the most common approximations are reviewed, and test problems illustrate the characteristics of each of the approximations. This document is designed as a tutorial so that code users can make an educated choice about which form of approximate radiation transport to use for their particular simulation.
Approximation by Multivariate Singular Integrals
Anastassiou, George A
2011-01-01
Approximation by Multivariate Singular Integrals is the first monograph to illustrate the approximation of multivariate singular integrals to the identity-unit operator. The basic approximation properties of the general multivariate singular integral operators is presented quantitatively, particularly special cases such as the multivariate Picard, Gauss-Weierstrass, Poisson-Cauchy and trigonometric singular integral operators are examined thoroughly. This book studies the rate of convergence of these operators to the unit operator as well as the related simultaneous approximation. The last cha
Approximations of fractional Brownian motion
Li, Yuqiang; 10.3150/10-BEJ319
2012-01-01
Approximations of fractional Brownian motion using Poisson processes whose parameter sets have the same dimensions as the approximated processes have been studied in the literature. In this paper, a special approximation to the one-parameter fractional Brownian motion is constructed using a two-parameter Poisson process. The proof involves the tightness and identification of finite-dimensional distributions.
Approximation by planar elastic curves
Brander, David; Gravesen, Jens; Nørbjerg, Toke Bjerge
2016-01-01
We give an algorithm for approximating a given plane curve segment by a planar elastic curve. The method depends on an analytic representation of the space of elastic curve segments, together with a geometric method for obtaining a good initial guess for the approximating curve. A gradient......-driven optimization is then used to find the approximating elastic curve....
Rates of induced abortion in Denmark according to age, previous births and previous abortions
Marie-Louise H. Hansen
2009-11-01
Full Text Available Background: Whereas the effects of various socio-demographic determinants on a woman's risk of having an abortion are relatively well-documented, less attention has been given to the effect of previous abortions and births. Objective: To study the effect of previous abortions and births on Danish women's risk of an abortion, in addition to a number of demographic and personal characteristics. Data and methods: From the Fertility of Women and Couples Dataset we obtained data on the number of live births and induced abortions by year (1981-2001, age (16-39, county of residence and marital status. Logistic regression analysis was used to estimate the influence of the explanatory variables on the probability of having an abortion in a relevant year. Main findings and conclusion: A woman's risk of having an abortion increases with the number of previous births and previous abortions. Some interactions were was found in the way a woman's risk of abortion varies with calendar year, age and parity. The risk of an abortion for women with no children decreases while the risk of an abortion for women with children increases over time. Furthermore, the risk of an abortion decreases with age, but relatively more so for women with children compared to childless women. Trends for teenagers are discussed in a separate section.
22 CFR 40.91 - Certain aliens previously removed.
2010-04-01
... 22 Foreign Relations 1 2010-04-01 2010-04-01 false Certain aliens previously removed. 40.91... IMMIGRANTS UNDER THE IMMIGRATION AND NATIONALITY ACT, AS AMENDED Aliens Previously Removed § 40.91 Certain aliens previously removed. (a) 5-year bar. An alien who has been found inadmissible, whether as a result...
International Conference Approximation Theory XIV
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.
Exact constants in approximation theory
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
Approximability of the discrete Fréchet distance
Karl Bringmann
2015-12-01
Full Text Available The Fréchet distance is a popular and widespread distance measure for point sequences and for curves. About two years ago, Agarwal et al. [SIAM J. Comput. 2014] presented a new (mildly subquadratic algorithm for the discrete version of the problem. This spawned a flurry of activity that has led to several new algorithms and lower bounds.In this paper, we study the approximability of the discrete Fréchet distance. Building on a recent result by Bringmann [FOCS 2014], we present a new conditional lower bound showing that strongly subquadratic algorithms for the discrete Fréchet distance are unlikely to exist, even in the one-dimensional case and even if the solution may be approximated up to a factor of 1.399.This raises the question of how well we can approximate the Fréchet distance (of two given $d$-dimensional point sequences of length $n$ in strongly subquadratic time. Previously, no general results were known. We present the first such algorithm by analysing the approximation ratio of a simple, linear-time greedy algorithm to be $2^{\\Theta(n}$. Moreover, we design an $\\alpha$-approximation algorithm that runs in time $O(n\\log n + n^2/\\alpha$, for any $\\alpha\\in [1, n]$. Hence, an $n^\\varepsilon$-approximation of the Fréchet distance can be computed in strongly subquadratic time, for any $\\varepsilon > 0$.
The tendon approximator device in traumatic injuries.
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.
BDD Minimization for Approximate Computing
Soeken, Mathias; Grosse, Daniel; Chandrasekharan, Arun; Drechsler, Rolf
2016-01-01
We present Approximate BDD Minimization (ABM) as a problem that has application in approximate computing. Given a BDD representation of a multi-output Boolean function, ABM asks whether there exists another function that has a smaller BDD representation but meets a threshold w.r.t. an error metric. We present operators to derive approximated functions and present algorithms to exactly compute the error metrics directly on the BDD representation. An experimental evaluation demonstrates the app...
Tree wavelet approximations with applications
XU Yuesheng; ZOU Qingsong
2005-01-01
We construct a tree wavelet approximation by using a constructive greedy scheme(CGS). We define a function class which contains the functions whose piecewise polynomial approximations generated by the CGS have a prescribed global convergence rate and establish embedding properties of this class. We provide sufficient conditions on a tree index set and on bi-orthogonal wavelet bases which ensure optimal order of convergence for the wavelet approximations encoded on the tree index set using the bi-orthogonal wavelet bases. We then show that if we use the tree index set associated with the partition generated by the CGS to encode a wavelet approximation, it gives optimal order of convergence.
Some results in Diophantine approximation
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...
Beyond the random phase approximation
Olsen, Thomas; Thygesen, Kristian S.
2013-01-01
We assess the performance of a recently proposed renormalized adiabatic local density approximation (rALDA) for ab initio calculations of electronic correlation energies in solids and molecules. The method is an extension of the random phase approximation (RPA) derived from time-dependent density...
Uniform approximation by (quantum) polynomials
Drucker, A.; de Wolf, R.
2011-01-01
We show that quantum algorithms can be used to re-prove a classical theorem in approximation theory, Jackson's Theorem, which gives a nearly-optimal quantitative version of Weierstrass's Theorem on uniform approximation of continuous functions by polynomials. We provide two proofs, based respectivel
Markov operators, positive semigroups and approximation processes
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.
Global approximation of convex functions
Azagra, D
2011-01-01
We show that for every (not necessarily bounded) open convex subset $U$ of $\\R^n$, every (not necessarily Lipschitz or strongly) convex function $f:U\\to\\R$ can be approximated by real analytic convex functions, uniformly on all of $U$. In doing so we provide a technique which transfers results on uniform approximation on bounded sets to results on uniform approximation on unbounded sets, in such a way that not only convexity and $C^k$ smoothness, but also local Lipschitz constants, minimizers, order, and strict or strong convexity, are preserved. This transfer method is quite general and it can also be used to obtain new results on approximation of convex functions defined on Riemannian manifolds or Banach spaces. We also provide a characterization of the class of convex functions which can be uniformly approximated on $\\R^n$ by strongly convex functions.
Approximate circuits for increased reliability
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.
Approximate circuits for increased reliability
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.
77 FR 70176 - Previous Participation Certification
2012-11-23
... URBAN DEVELOPMENT Previous Participation Certification AGENCY: Office of the Chief Information Officer... digital submission of all data and certifications is available via HUD's secure Internet systems. However...: Previous Participation Certification. OMB Approval Number: 2502-0118. Form Numbers: HUD-2530 ....
Previous gastric bypass surgery complicating total thyroidectomy.
Alfonso, Bianca; Jacobson, Adam S; Alon, Eran E; Via, Michael A
2015-03-01
Hypocalcemia is a well-known complication of total thyroidectomy. Patients who have previously undergone gastric bypass surgery may be at increased risk of hypocalcemia due to gastrointestinal malabsorption, secondary hyperparathyroidism, and an underlying vitamin D deficiency. We present the case of a 58-year-old woman who underwent a total thyroidectomy for the follicular variant of papillary thyroid carcinoma. Her history included Roux-en-Y gastric bypass surgery. Following the thyroid surgery, she developed postoperative hypocalcemia that required large doses of oral calcium carbonate (7.5 g/day), oral calcitriol (up to 4 μg/day), intravenous calcium gluconate (2.0 g/day), calcium citrate (2.0 g/day), and ergocalciferol (50,000 IU/day). Her serum calcium levels remained normal on this regimen after hospital discharge despite persistent hypoparathyroidism. Bariatric surgery patients who undergo thyroid surgery require aggressive supplementation to maintain normal serum calcium levels. Preoperative supplementation with calcium and vitamin D is strongly recommended.
Rytov approximation in electron scattering
Krehl, Jonas; Lubk, Axel
2017-06-01
In this work we introduce the Rytov approximation in the scope of high-energy electron scattering with the motivation of developing better linear models for electron scattering. Such linear models play an important role in tomography and similar reconstruction techniques. Conventional linear models, such as the phase grating approximation, have reached their limits in current and foreseeable applications, most importantly in achieving three-dimensional atomic resolution using electron holographic tomography. The Rytov approximation incorporates propagation effects which are the most pressing limitation of conventional models. While predominately used in the weak-scattering regime of light microscopy, we show that the Rytov approximation can give reasonable results in the inherently strong-scattering regime of transmission electron microscopy.
Rollout sampling approximate policy iteration
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
Approximate common divisors via lattices
Cohn, Henry
2011-01-01
We analyze the multivariate generalization of Howgrave-Graham's algorithm for the approximate common divisor problem. In the m-variable case with modulus N and approximate common divisor of size N^beta, this improves the size of the error tolerated from N^(beta^2) to N^(beta^((m+1)/m)), under a commonly used heuristic assumption. This gives a more detailed analysis of the hardness assumption underlying the recent fully homomorphic cryptosystem of van Dijk, Gentry, Halevi, and Vaikuntanathan. While these results do not challenge the suggested parameters, a 2^sqrt(n) approximation algorithm for lattice basis reduction in n dimensions could be used to break these parameters. We have implemented our algorithm, and it performs better in practice than the theoretical analysis suggests. Our results fit into a broader context of analogies between cryptanalysis and coding theory. The multivariate approximate common divisor problem is the number-theoretic analogue of noisy multivariate polynomial interpolation, and we ...
Approximate Implicitization Using Linear Algebra
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.
Binary nucleation beyond capillarity approximation
Kalikmanov, V.I.
2010-01-01
Large discrepancies between binary classical nucleation theory (BCNT) and experiments result from adsorption effects and inability of BCNT, based on the phenomenological capillarity approximation, to treat small clusters. We propose a model aimed at eliminating both of these deficiencies. Adsorption
Weighted approximation with varying weight
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.
Nonlinear approximation with redundant dictionaries
Borup, Lasse; Nielsen, M.; Gribonval, R.
2005-01-01
In this paper we study nonlinear approximation and data representation with redundant function dictionaries. In particular, approximation with redundant wavelet bi-frame systems is studied in detail. Several results for orthonormal wavelets are generalized to the redundant case. In general......, for a wavelet bi-frame system the approximation properties are limited by the number of vanishing moments of the system. In some cases this can be overcome by oversampling, but at a price of replacing the canonical expansion by another linear expansion. Moreover, for special non-oversampled wavelet bi-frames we...... can obtain good approximation properties not restricted by the number of vanishing moments, but again without using the canonical expansion....
Mathematical algorithms for approximate reasoning
Murphy, John H.; Chay, Seung C.; Downs, Mary M.
1988-01-01
Most state of the art expert system environments contain a single and often ad hoc strategy for approximate reasoning. Some environments provide facilities to program the approximate reasoning algorithms. However, the next generation of expert systems should have an environment which contain a choice of several mathematical algorithms for approximate reasoning. To meet the need for validatable and verifiable coding, the expert system environment must no longer depend upon ad hoc reasoning techniques but instead must include mathematically rigorous techniques for approximate reasoning. Popular approximate reasoning techniques are reviewed, including: certainty factors, belief measures, Bayesian probabilities, fuzzy logic, and Shafer-Dempster techniques for reasoning. A group of mathematically rigorous algorithms for approximate reasoning are focused on that could form the basis of a next generation expert system environment. These algorithms are based upon the axioms of set theory and probability theory. To separate these algorithms for approximate reasoning various conditions of mutual exclusivity and independence are imposed upon the assertions. Approximate reasoning algorithms presented include: reasoning with statistically independent assertions, reasoning with mutually exclusive assertions, reasoning with assertions that exhibit minimum overlay within the state space, reasoning with assertions that exhibit maximum overlay within the state space (i.e. fuzzy logic), pessimistic reasoning (i.e. worst case analysis), optimistic reasoning (i.e. best case analysis), and reasoning with assertions with absolutely no knowledge of the possible dependency among the assertions. A robust environment for expert system construction should include the two modes of inference: modus ponens and modus tollens. Modus ponens inference is based upon reasoning towards the conclusion in a statement of logical implication, whereas modus tollens inference is based upon reasoning away
Spatial ability explains the male advantage in approximate arithmetic
Wei eWei
2016-03-01
Full Text Available Previous research has shown that females consistently outperform males in exact arithmetic, perhaps due to the former’s advantage in language processing. Much less is known about gender difference in approximate arithmetic. Given that approximate arithmetic is highly associated with visuospatial processing and there is a male advantage in visuospatial processing, we hypothesized that males would perform better than females in approximate arithmetic. In two experiments (496 children in Experiment 1 and 554 college students in Experiment 2, we found that males showed better performance in approximate arithmetic. Furthermore, gender differences in approximate were accounted for by gender differences in spatial ability.
Twisted inhomogeneous Diophantine approximation and badly approximable sets
Harrap, Stephen
2010-01-01
For any real pair i, j geq 0 with i+j=1 let Bad(i, j) denote the set of (i, j)-badly approximable pairs. That is, Bad(i, j) consists of irrational vectors x:=(x_1, x_2) in R^2 for which there exists a positive constant c(x) such that max {||qx_1||^(-i), ||qx_2||^(-j)} > c(x)/q for all q in N. Building on a result of Kurzweil, a new characterization of the set Bad(i, j) in terms of `well-approximable' vectors in the area of `twisted' inhomogeneous Diophantine approximation is established. In addition, it is shown that Bad^x(i, j), the `twisted' inhomogeneous analogue of Bad(i, j), has full Hausdorff dimension 2 when x is chosen from the set Bad(i, j).
Approximate Matching of Hierarchial Data
Augsten, Nikolaus
The goal of this thesis is to design, develop, and evaluate new methods for the approximate matching of hierarchical data represented as labeled trees. In approximate matching scenarios two items should be matched if they are similar. Computing the similarity between labeled trees is hard...... as in addition to the data values also the structure must be considered. A well-known measure for comparing trees is the tree edit distance. It is computationally expensive and leads to a prohibitively high run time. Our solution for the approximate matching of hierarchical data are pq-grams. The pq...... formally proof that the pq-gram index can be incrementally updated based on the log of edit operations without reconstructing intermediate tree versions. The incremental update is independent of the data size and scales to a large number of changes in the data. We introduce windowed pq...
Concept Approximation between Fuzzy Ontologies
无
2006-01-01
Fuzzy ontologies are efficient tools to handle fuzzy and uncertain knowledge on the semantic web; but there are heterogeneity problems when gaining interoperability among different fuzzy ontologies. This paper uses concept approximation between fuzzy ontologies based on instances to solve the heterogeneity problems. It firstly proposes an instance selection technology based on instance clustering and weighting to unify the fuzzy interpretation of different ontologies and reduce the number of instances to increase the efficiency. Then the paper resolves the problem of computing the approximations of concepts into the problem of computing the least upper approximations of atom concepts. It optimizes the search strategies by extending atom concept sets and defining the least upper bounds of concepts to reduce the searching space of the problem. An efficient algorithm for searching the least upper bounds of concept is given.
Approximating Graphic TSP by Matchings
Mömke, Tobias
2011-01-01
We present a framework for approximating the metric TSP based on a novel use of matchings. Traditionally, matchings have been used to add edges in order to make a given graph Eulerian, whereas our approach also allows for the removal of certain edges leading to a decreased cost. For the TSP on graphic metrics (graph-TSP), the approach yields a 1.461-approximation algorithm with respect to the Held-Karp lower bound. For graph-TSP restricted to a class of graphs that contains degree three bounded and claw-free graphs, we show that the integrality gap of the Held-Karp relaxation matches the conjectured ratio 4/3. The framework allows for generalizations in a natural way and also leads to a 1.586-approximation algorithm for the traveling salesman path problem on graphic metrics where the start and end vertices are prespecified.
Diophantine approximation and Dirichlet series
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...
Approximation methods in probability theory
Č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.
Approximate Sparse Regularized Hyperspectral Unmixing
Chengzhi Deng
2014-01-01
Full Text Available Sparse regression based unmixing has been recently proposed to estimate the abundance of materials present in hyperspectral image pixel. In this paper, a novel sparse unmixing optimization model based on approximate sparsity, namely, approximate sparse unmixing (ASU, is firstly proposed to perform the unmixing task for hyperspectral remote sensing imagery. And then, a variable splitting and augmented Lagrangian algorithm is introduced to tackle the optimization problem. In ASU, approximate sparsity is used as a regularizer for sparse unmixing, which is sparser than l1 regularizer and much easier to be solved than l0 regularizer. Three simulated and one real hyperspectral images were used to evaluate the performance of the proposed algorithm in comparison to l1 regularizer. Experimental results demonstrate that the proposed algorithm is more effective and accurate for hyperspectral unmixing than state-of-the-art l1 regularizer.
Spatial ability explains the male advantage in approximate arithmetic
Wei eWei; Chuansheng eChen; Xinlin eZhou
2016-01-01
Previous research has shown that females consistently outperform males in exact arithmetic, perhaps due to the former’s advantage in language processing. Much less is known about gender difference in approximate arithmetic. Given that approximate arithmetic is highly associated with visuospatial processing and there is a male advantage in visuospatial processing, we hypothesized that males would perform better than females in approximate arithmetic. In two experiments (496 children in Experim...
Spatial Ability Explains the Male Advantage in Approximate Arithmetic
Wei, Wei; Chen, Chuansheng; Zhou, Xinlin
2016-01-01
© 2016 Wei, Chen and Zhou. Previous research has shown that females consistently outperform males in exact arithmetic, perhaps due to the former's advantage in language processing. Much less is known about gender difference in approximate arithmetic. Given that approximate arithmetic is closely associated with visuospatial processing, which shows a male advantage we hypothesized that males would perform better than females in approximate arithmetic. In two experiments (496 children in Experim...
Transfinite Approximation of Hindman's Theorem
Beiglböck, Mathias
2010-01-01
Hindman's Theorem states that in any finite coloring of the integers, there is an infinite set all of whose finite sums belong to the same color. This is much stronger than the corresponding finite form, stating that in any finite coloring of the integers there are arbitrarily long finite sets with the same property. We extend the finite form of Hindman's Theorem to a "transfinite" version for each countable ordinal, and show that Hindman's Theorem is equivalent to the appropriate transfinite approximation holding for every countable ordinal. We then give a proof of Hindman's Theorem by directly proving these transfinite approximations.
Sharp Bounds for Symmetric and Asymmetric Diophantine Approximation
Cornelis KRAAIKAMP; Ionica SMEETS
2011-01-01
In 2004,Tong found bounds for the approximation quality of a regular continued fraction convergent to a rational number,expressed in bounds for both the previous and next approximation.The authors sharpen his results with a geometric method and give both sharp upper and lower bounds.The asymptotic frequencies that these bounds occur are also calculated.
Tree wavelet approximations with applications
无
2005-01-01
[1]Baraniuk, R. G., DeVore, R. A., Kyriazis, G., Yu, X. M., Near best tree approximation, Adv. Comput. Math.,2002, 16: 357-373.[2]Cohen, A., Dahmen, W., Daubechies, I., DeVore, R., Tree approximation and optimal encoding, Appl. Comput.Harmonic Anal., 2001, 11: 192-226.[3]Dahmen, W., Schneider, R., Xu, Y., Nonlinear functionals of wavelet expansions-adaptive reconstruction and fast evaluation, Numer. Math., 2000, 86: 49-101.[4]DeVore, R. A., Nonlinear approximation, Acta Numer., 1998, 7: 51-150.[5]Davis, G., Mallat, S., Avellaneda, M., Adaptive greedy approximations, Const. Approx., 1997, 13: 57-98.[6]DeVore, R. A., Temlyakov, V. N., Some remarks on greedy algorithms, Adv. Comput. Math., 1996, 5: 173-187.[7]Kashin, B. S., Temlyakov, V. N., Best m-term approximations and the entropy of sets in the space L1, Mat.Zametki (in Russian), 1994, 56: 57-86.[8]Temlyakov, V. N., The best m-term approximation and greedy algorithms, Adv. Comput. Math., 1998, 8:249-265.[9]Temlyakov, V. N., Greedy algorithm and m-term trigonometric approximation, Constr. Approx., 1998, 14:569-587.[10]Hutchinson, J. E., Fractals and self similarity, Indiana. Univ. Math. J., 1981, 30: 713-747.[11]Binev, P., Dahmen, W., DeVore, R. A., Petruchev, P., Approximation classes for adaptive methods, Serdica Math.J., 2002, 28: 1001-1026.[12]Gilbarg, D., Trudinger, N. S., Elliptic Partial Differential Equations of Second Order, Berlin: Springer-Verlag,1983.[13]Ciarlet, P. G., The Finite Element Method for Elliptic Problems, New York: North Holland, 1978.[14]Birman, M. S., Solomiak, M. Z., Piecewise polynomial approximation of functions of the class Wαp, Math. Sb.,1967, 73: 295-317.[15]DeVore, R. A., Lorentz, G. G., Constructive Approximation, New York: Springer-Verlag, 1993.[16]DeVore, R. A., Popov, V., Interpolation of Besov spaces, Trans. Amer. Math. Soc., 1988, 305: 397-414.[17]Devore, R., Jawerth, B., Popov, V., Compression of wavelet decompositions, Amer. J. Math., 1992, 114: 737-785.[18]Storozhenko, E
WKB Approximation in Noncommutative Gravity
Maja Buric
2007-12-01
Full Text Available We consider the quasi-commutative approximation to a noncommutative geometry defined as a generalization of the moving frame formalism. The relation which exists between noncommutativity and geometry is used to study the properties of the high-frequency waves on the flat background.
Approximation properties of haplotype tagging
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.
Truthful approximations to range voting
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...
Approximate Reasoning with Fuzzy Booleans
Broek, van den P.M.; Noppen, J.A.R.
2004-01-01
This paper introduces, in analogy to the concept of fuzzy numbers, the concept of fuzzy booleans, and examines approximate reasoning with the compositional rule of inference using fuzzy booleans. It is shown that each set of fuzzy rules is equivalent to a set of fuzzy rules with singleton crisp ante
Ultrafast Approximation for Phylogenetic Bootstrap
Bui Quang Minh, [No Value; Nguyen, Thi; von Haeseler, Arndt
2013-01-01
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
On badly approximable complex numbers
Esdahl-Schou, Rune; Kristensen, S.
We show that the set of complex numbers which are badly approximable by ratios of elements of , where has maximal Hausdorff dimension. In addition, the intersection of these sets is shown to have maximal dimension. The results remain true when the sets in question are intersected with a suitably...
Rational approximation of vertical segments
Salazar Celis, Oliver; Cuyt, Annie; Verdonk, Brigitte
2007-08-01
In many applications, observations are prone to imprecise measurements. When constructing a model based on such data, an approximation rather than an interpolation approach is needed. Very often a least squares approximation is used. Here we follow a different approach. A natural way for dealing with uncertainty in the data is by means of an uncertainty interval. We assume that the uncertainty in the independent variables is negligible and that for each observation an uncertainty interval can be given which contains the (unknown) exact value. To approximate such data we look for functions which intersect all uncertainty intervals. In the past this problem has been studied for polynomials, or more generally for functions which are linear in the unknown coefficients. Here we study the problem for a particular class of functions which are nonlinear in the unknown coefficients, namely rational functions. We show how to reduce the problem to a quadratic programming problem with a strictly convex objective function, yielding a unique rational function which intersects all uncertainty intervals and satisfies some additional properties. Compared to rational least squares approximation which reduces to a nonlinear optimization problem where the objective function may have many local minima, this makes the new approach attractive.
Approximation on the complex sphere
Alsaud, Huda; Kushpel, Alexander; Levesley, Jeremy
2012-01-01
We develop new elements of harmonic analysis on the complex sphere on the basis of which Bernstein's, Jackson's and Kolmogorov's inequalities are established. We apply these results to get order sharp estimates of $m$-term approximations. The results obtained is a synthesis of new results on classical orthogonal polynomials, harmonic analysis on manifolds and geometric properties of Euclidean spaces.
On badly approximable complex numbers
Esdahl-Schou, Rune; Kristensen, S.
We show that the set of complex numbers which are badly approximable by ratios of elements of , where has maximal Hausdorff dimension. In addition, the intersection of these sets is shown to have maximal dimension. The results remain true when the sets in question are intersected with a suitably...
Pythagorean Approximations and Continued Fractions
Peralta, Javier
2008-01-01
In this article, we will show that the Pythagorean approximations of [the square root of] 2 coincide with those achieved in the 16th century by means of continued fractions. Assuming this fact and the known relation that connects the Fibonacci sequence with the golden section, we shall establish a procedure to obtain sequences of rational numbers…
Approximation of Surfaces by Cylinders
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...
Approximate Reanalysis in Topology Optimization
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...
Low Rank Approximation in $G_0W_0$ Approximation
Shao, Meiyue; Yang, Chao; Liu, Fang; da Jornada, Felipe H; Deslippe, Jack; Louie, Steven G
2016-01-01
The single particle energies obtained in a Kohn--Sham density functional theory (DFT) calculation are generally known to be poor approximations to electron excitation energies that are measured in transport, tunneling and spectroscopic experiments such as photo-emission spectroscopy. The correction to these energies can be obtained from the poles of a single particle Green's function derived from a many-body perturbation theory. From a computational perspective, the accuracy and efficiency of such an approach depends on how a self energy term that properly accounts for dynamic screening of electrons is approximated. The $G_0W_0$ approximation is a widely used technique in which the self energy is expressed as the convolution of a non-interacting Green's function ($G_0$) and a screened Coulomb interaction ($W_0$) in the frequency domain. The computational cost associated with such a convolution is high due to the high complexity of evaluating $W_0$ at multiple frequencies. In this paper, we discuss how the cos...
Counting independent sets using the Bethe approximation
Chertkov, Michael [Los Alamos National Laboratory; Chandrasekaran, V [MIT; Gamarmik, D [MIT; Shah, D [MIT; Sin, J [MIT
2009-01-01
The authors consider the problem of counting the number of independent sets or the partition function of a hard-core model in a graph. The problem in general is computationally hard (P hard). They study the quality of the approximation provided by the Bethe free energy. Belief propagation (BP) is a message-passing algorithm can be used to compute fixed points of the Bethe approximation; however, BP is not always guarantee to converge. As the first result, they propose a simple message-passing algorithm that converges to a BP fixed pont for any grapy. They find that their algorithm converges within a multiplicative error 1 + {var_epsilon} of a fixed point in {Omicron}(n{sup 2}E{sup -4} log{sup 3}(nE{sup -1})) iterations for any bounded degree graph of n nodes. In a nutshell, the algorithm can be thought of as a modification of BP with 'time-varying' message-passing. Next, they analyze the resulting error to the number of independent sets provided by such a fixed point of the Bethe approximation. Using the recently developed loop calculus approach by Vhertkov and Chernyak, they establish that for any bounded graph with large enough girth, the error is {Omicron}(n{sup -{gamma}}) for some {gamma} > 0. As an application, they find that for random 3-regular graph, Bethe approximation of log-partition function (log of the number of independent sets) is within o(1) of corret log-partition - this is quite surprising as previous physics-based predictions were expecting an error of o(n). In sum, their results provide a systematic way to find Bethe fixed points for any graph quickly and allow for estimating error in Bethe approximation using novel combinatorial techniques.
Erlotinib-induced rash spares previously irradiated skin
Lips, Irene M.; Vonk, Ernest J.A. [Radiotherapeutisch Instituut Stedendriehoek en Omstreken (RISO), Deventer (Netherlands). Dept. of Radiation Oncology; Koster, Mariska E.Y. [Deventer Hospital (Netherlands). Dept. of Lung Diseases; Houwing, Ronald H. [Deventer Hospital (Netherlands). Dept. of Dermatology
2011-08-15
Erlotinib is an epidermal growth factor receptor inhibitor prescribed to patients with locally advanced or metastasized non-small cell lung carcinoma after failure of at least one earlier chemotherapy treatment. Approximately 75% of the patients treated with erlotinib develop acneiform skin rashes. A patient treated with erlotinib 3 months after finishing concomitant treatment with chemotherapy and radiotherapy for non-small cell lung cancer is presented. Unexpectedly, the part of the skin that had been included in his previously radiotherapy field was completely spared from the erlotinib-induced acneiform skin rash. The exact mechanism of erlotinib-induced rash sparing in previously irradiated skin is unclear. The underlying mechanism of this phenomenon needs to be explored further, because the number of patients being treated with a combination of both therapeutic modalities is increasing. The therapeutic effect of erlotinib in the area of the previously irradiated lesion should be assessed. (orig.)
Melnikov's approximation dominance Some examples
Gallavotti, G; Mastropietro, V
1998-01-01
We continue a previous paper to show that Mel'nikov's first order formula for part of the separatrix splitting of a pendulum under fast quasi periodic forcing holds, in special examples, as an asymptotic formula in the forcing rapidity.
Approximate Inference for Wireless Communications
Hansen, Morten
This thesis investigates signal processing techniques for wireless communication receivers. The aim is to improve the performance or reduce the computationally complexity of these, where the primary focus area is cellular systems such as Global System for Mobile communications (GSM) (and extensions...... complexity can potentially lead to limited power consumption, which translates into longer battery life-time in the handsets. The scope of the thesis is more specifically to investigate approximate (nearoptimal) detection methods that can reduce the computationally complexity significantly compared...... to the optimal one, which usually requires an unacceptable high complexity. Some of the treated approximate methods are based on QL-factorization of the channel matrix. In the work presented in this thesis it is proven how the QL-factorization of frequency-selective channels asymptotically provides the minimum...
Hydrogen Beyond the Classic Approximation
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
Validity of the eikonal approximation
Kabat, D
1992-01-01
We summarize results on the reliability of the eikonal approximation in obtaining the high energy behavior of a two particle forward scattering amplitude. Reliability depends on the spin of the exchanged field. For scalar fields the eikonal fails at eighth order in perturbation theory, when it misses the leading behavior of the exchange-type diagrams. In a vector theory the eikonal gets the exchange diagrams correctly, but fails by ignoring certain non-exchange graphs which dominate the asymptotic behavior of the full amplitude. For spin--2 tensor fields the eikonal captures the leading behavior of each order in perturbation theory, but the sum of eikonal terms is subdominant to graphs neglected by the approximation. We also comment on the eikonal for Yang-Mills vector exchange, where the additional complexities of the non-abelian theory may be absorbed into Regge-type modifications of the gauge boson propagators.
Approximate Privacy: Foundations and Quantification
Feigenbaum, Joan; Schapira, Michael
2009-01-01
Increasing use of computers and networks in business, government, recreation, and almost all aspects of daily life has led to a proliferation of online sensitive data about individuals and organizations. Consequently, concern about the privacy of these data has become a top priority, particularly those data that are created and used in electronic commerce. There have been many formulations of privacy and, unfortunately, many negative results about the feasibility of maintaining privacy of sensitive data in realistic networked environments. We formulate communication-complexity-based definitions, both worst-case and average-case, of a problem's privacy-approximation ratio. We use our definitions to investigate the extent to which approximate privacy is achievable in two standard problems: the second-price Vickrey auction and the millionaires problem of Yao. For both the second-price Vickrey auction and the millionaires problem, we show that not only is perfect privacy impossible or infeasibly costly to achieve...
Validity of the Eikonal Approximation
Kabat, Daniel
1992-01-01
We summarize results on the reliability of the eikonal approximation in obtaining the high energy behavior of a two particle forward scattering amplitude. Reliability depends on the spin of the exchanged field. For scalar fields the eikonal fails at eighth order in perturbation theory, when it misses the leading behavior of the exchange-type diagrams. In a vector theory the eikonal gets the exchange diagrams correctly, but fails by ignoring certain non-exchange graphs which dominate the asymp...
Approximating the spin distributions in capture reactions between spherical nuclei
Chushnyakova, M.V., E-mail: maria.chushnyakova@gmail.com [Physics Department, Omsk State Technical University, 644050 Omsk (Russian Federation); Applied Physics Department, Tomsk Polytechnic University, 634028 Tomsk (Russian Federation); Gontchar, I.I. [Physics and Chemistry Department, Omsk State Transport University, 644046 Omsk (Russian Federation)
2015-09-15
Twenty years ago an approximation for the spin distribution of the dinuclear systems formed in capture reactions with heavy ions was proposed. This approximation is used nowadays. However, since that time the experimental errors of the measured capture cross sections were reduced drastically. We show that the accuracy of the old spin distribution approximation is certainly out of date and propose a new approximation built on the dynamical modeling of the capture process. Results suggest that this new approximation might be useful especially for performing modeling of decay of excited dinuclear systems (compound nuclei) formed during heavy-ion collisions.
Approximating the spin distributions in capture reactions between spherical nuclei
Chushnyakova, M. V.; Gontchar, I. I.
2015-09-01
Twenty years ago an approximation for the spin distribution of the dinuclear systems formed in capture reactions with heavy ions was proposed. This approximation is used nowadays. However, since that time the experimental errors of the measured capture cross sections were reduced drastically. We show that the accuracy of the old spin distribution approximation is certainly out of date and propose a new approximation built on the dynamical modeling of the capture process. Results suggest that this new approximation might be useful especially for performing modeling of decay of excited dinuclear systems (compound nuclei) formed during heavy-ion collisions.
Approximate Counting of Graphical Realizations.
Erdős, Péter L; Kiss, Sándor Z; Miklós, István; Soukup, Lajos
2015-01-01
In 1999 Kannan, Tetali and Vempala proposed a MCMC method to uniformly sample all possible realizations of a given graphical degree sequence and conjectured its rapidly mixing nature. Recently their conjecture was proved affirmative for regular graphs (by Cooper, Dyer and Greenhill, 2007), for regular directed graphs (by Greenhill, 2011) and for half-regular bipartite graphs (by Miklós, Erdős and Soukup, 2013). Several heuristics on counting the number of possible realizations exist (via sampling processes), and while they work well in practice, so far no approximation guarantees exist for such an approach. This paper is the first to develop a method for counting realizations with provable approximation guarantee. In fact, we solve a slightly more general problem; besides the graphical degree sequence a small set of forbidden edges is also given. We show that for the general problem (which contains the Greenhill problem and the Miklós, Erdős and Soukup problem as special cases) the derived MCMC process is rapidly mixing. Further, we show that this new problem is self-reducible therefore it provides a fully polynomial randomized approximation scheme (a.k.a. FPRAS) for counting of all realizations.
Approximate Counting of Graphical Realizations.
Péter L Erdős
Full Text Available In 1999 Kannan, Tetali and Vempala proposed a MCMC method to uniformly sample all possible realizations of a given graphical degree sequence and conjectured its rapidly mixing nature. Recently their conjecture was proved affirmative for regular graphs (by Cooper, Dyer and Greenhill, 2007, for regular directed graphs (by Greenhill, 2011 and for half-regular bipartite graphs (by Miklós, Erdős and Soukup, 2013. Several heuristics on counting the number of possible realizations exist (via sampling processes, and while they work well in practice, so far no approximation guarantees exist for such an approach. This paper is the first to develop a method for counting realizations with provable approximation guarantee. In fact, we solve a slightly more general problem; besides the graphical degree sequence a small set of forbidden edges is also given. We show that for the general problem (which contains the Greenhill problem and the Miklós, Erdős and Soukup problem as special cases the derived MCMC process is rapidly mixing. Further, we show that this new problem is self-reducible therefore it provides a fully polynomial randomized approximation scheme (a.k.a. FPRAS for counting of all realizations.
Many Faces of Boussinesq Approximations
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...
Approximate Deconvolution Reduced Order Modeling
Xie, Xuping; Wang, Zhu; Iliescu, Traian
2015-01-01
This paper proposes a large eddy simulation reduced order model(LES-ROM) framework for the numerical simulation of realistic flows. In this LES-ROM framework, the proper orthogonal decomposition(POD) is used to define the ROM basis and a POD differential filter is used to define the large ROM structures. An approximate deconvolution(AD) approach is used to solve the ROM closure problem and develop a new AD-ROM. This AD-ROM is tested in the numerical simulation of the one-dimensional Burgers equation with a small diffusion coefficient(10^{-3})
Approximation for Bayesian Ability Estimation.
1987-02-18
posterior pdfs of ande are given by p(-[Y) p(F) F P((y lei’ j)P )d. SiiJ i (4) a r~d p(e Iy) - p(t0) 1 J i P(Yij ei, (5) As shown in Tsutakawa and Lin...inverse A Hessian of the log of (27) with respect to , evaulatedat a Then, under regularity conditions, the marginal posterior pdf of O is...two-way contingency tables. Journal of Educational Statistics, 11, 33-56. Lindley, D.V. (1980). Approximate Bayesian methods. Trabajos Estadistica , 31
Subsequent pregnancy outcome after previous foetal death
Nijkamp, J. W.; Korteweg, F. J.; Holm, J. P.; Timmer, A.; Erwich, J. J. H. M.; van Pampus, M. G.
2013-01-01
Objective: A history of foetal death is a risk factor for complications and foetal death in subsequent pregnancies as most previous risk factors remain present and an underlying cause of death may recur. The purpose of this study was to evaluate subsequent pregnancy outcome after foetal death and to
Approximate simulation of Hawkes processes
Møller, Jesper; Rasmussen, Jakob Gulddahl
This article concerns a simulation algorithm for unmarked and marked Hawkes processes. The algorithm suffers from edge effects but is much faster than the perfect simulation algorithm introduced in our previous work. We derive various useful measures for the error committed when using the algorithm...
Plasma Physics Approximations in Ares
Managan, R. A.
2015-01-08
Lee & More derived analytic forms for the transport properties of a plasma. Many hydro-codes use their formulae for electrical and thermal conductivity. The coefficients are complex functions of Fermi-Dirac integrals, F_{n}( μ/θ ), the chemical potential, μ or ζ = ln(1+e^{ μ/θ} ), and the temperature, θ = kT. Since these formulae are expensive to compute, rational function approximations were fit to them. Approximations are also used to find the chemical potential, either μ or ζ . The fits use ζ as the independent variable instead of μ/θ . New fits are provided for A^{α} (ζ ),A^{β} (ζ ), ζ, f(ζ ) = (1 + e^{-μ/θ})F_{1/2}(μ/θ), F_{1/2}'/F_{1/2}, F_{c}^{α}, and F_{c}^{β}. In each case the relative error of the fit is minimized since the functions can vary by many orders of magnitude. The new fits are designed to exactly preserve the limiting values in the non-degenerate and highly degenerate limits or as ζ→ 0 or ∞. The original fits due to Lee & More and George Zimmerman are presented for comparison.
Rational approximations to fluid properties
Kincaid, J. M.
1990-05-01
The purpose of this report is to summarize some results that were presented at the Spring AIChE meeting in Orlando, Florida (20 March 1990). We report on recent attempts to develop a systematic method, based on the technique of rational approximation, for creating mathematical models of real-fluid equations of state and related properties. Equation-of-state models for real fluids are usually created by selecting a function tilde p(T,rho) that contains a set of parameters (gamma sub i); the (gamma sub i) is chosen such that tilde p(T,rho) provides a good fit to the experimental data. (Here p is the pressure, T the temperature and rho is the density). In most cases, a nonlinear least-squares numerical method is used to determine (gamma sub i). There are several drawbacks to this method: one has essentially to guess what tilde p(T,rho) should be; the critical region is seldom fit very well and nonlinear numerical methods are time consuming and sometimes not very stable. The rational approximation approach we describe may eliminate all of these drawbacks. In particular, it lets the data choose the function tilde p(T,rho) and its numerical implementation involves only linear algorithms.
Induced vaginal birth after previous caesarean section
Akylbek Tussupkaliyev; Andrey Gayday; Bibigul Karimsakova; Saule Bermagambetova; Lunara Uteniyazova; Guldana Iztleuova; Gulkhanym Kusherbayeva; Meruyert Konakbayeva; Assylzada Merekeyeva; Zamira Imangaliyeva
2016-01-01
Introduction The rate of operative birth by Caesarean section is constantly rising. In Kazakhstan, it reaches 27 per cent. Research data confirm that the percentage of successful vaginal births after previous Caesarean section is 50–70 per cent. How safe the induction of vaginal birth after Caesarean (VBAC) remains unclear. Methodology The studied techniques of labour induction were amniotomy of the foetal bladder with the vulsellum ramus, intravaginal administra...
Semiclassical approximations to quantum time correlation functions
Egorov, S. A.; Skinner, J. L.
1998-09-01
Over the last 40 years several ad hoc semiclassical approaches have been developed in order to obtain approximate quantum time correlation functions, using as input only the corresponding classical time correlation functions. The accuracy of these approaches has been tested for several exactly solvable gas-phase models. In this paper we test the accuracy of these approaches by comparing to an exactly solvable many-body condensed-phase model. We show that in the frequency domain the Egelstaff approach is the most accurate, especially at high frequencies, while in the time domain one of the other approaches is more accurate.
Approximation by double Walsh polynomials
Ferenc Móricz
1992-01-01
Full Text Available We study the rate of approximation by rectangular partial sums, Cesàro means, and de la Vallée Poussin means of double Walsh-Fourier series of a function in a homogeneous Banach space X. In particular, X may be Lp(I2, where 1≦p<∞ and I2=[0,1×[0,1, or CW(I2, the latter being the collection of uniformly W-continuous functions on I2. We extend the results by Watari, Fine, Yano, Jastrebova, Bljumin, Esfahanizadeh and Siddiqi from univariate to multivariate cases. As by-products, we deduce sufficient conditions for convergence in Lp(I2-norm and uniform convergence on I2 as well as characterizations of Lipschitz classes of functions. At the end, we raise three problems.
Interplay of approximate planning strategies.
Huys, Quentin J M; Lally, Níall; Faulkner, Paul; Eshel, Neir; Seifritz, Erich; Gershman, Samuel J; Dayan, Peter; Roiser, Jonathan P
2015-03-10
Humans routinely formulate plans in domains so complex that even the most powerful computers are taxed. To do so, they seem to avail themselves of many strategies and heuristics that efficiently simplify, approximate, and hierarchically decompose hard tasks into simpler subtasks. Theoretical and cognitive research has revealed several such strategies; however, little is known about their establishment, interaction, and efficiency. Here, we use model-based behavioral analysis to provide a detailed examination of the performance of human subjects in a moderately deep planning task. We find that subjects exploit the structure of the domain to establish subgoals in a way that achieves a nearly maximal reduction in the cost of computing values of choices, but then combine partial searches with greedy local steps to solve subtasks, and maladaptively prune the decision trees of subtasks in a reflexive manner upon encountering salient losses. Subjects come idiosyncratically to favor particular sequences of actions to achieve subgoals, creating novel complex actions or "options."
Approximate reduction of dynamical systems
Tabuada, Paulo; Julius, Agung; Pappas, George J
2007-01-01
The reduction of dynamical systems has a rich history, with many important applications related to stability, control and verification. Reduction of nonlinear systems is typically performed in an exact manner - as is the case with mechanical systems with symmetry--which, unfortunately, limits the type of systems to which it can be applied. The goal of this paper is to consider a more general form of reduction, termed approximate reduction, in order to extend the class of systems that can be reduced. Using notions related to incremental stability, we give conditions on when a dynamical system can be projected to a lower dimensional space while providing hard bounds on the induced errors, i.e., when it is behaviorally similar to a dynamical system on a lower dimensional space. These concepts are illustrated on a series of examples.
Diophantine approximations and Diophantine equations
Schmidt, Wolfgang M
1991-01-01
"This book by a leading researcher and masterly expositor of the subject studies diophantine approximations to algebraic numbers and their applications to diophantine equations. The methods are classical, and the results stressed can be obtained without much background in algebraic geometry. In particular, Thue equations, norm form equations and S-unit equations, with emphasis on recent explicit bounds on the number of solutions, are included. The book will be useful for graduate students and researchers." (L'Enseignement Mathematique) "The rich Bibliography includes more than hundred references. The book is easy to read, it may be a useful piece of reading not only for experts but for students as well." Acta Scientiarum Mathematicarum
Truthful approximations to range voting
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...... maximization in this setting. With m being the number of alternatives, we exhibit a randomized truthful-in-expectation ordinal mechanism implementing an outcome whose expected social welfare is at least an Omega(m^{-3/4}) fraction of the social welfare of the socially optimal alternative. On the other hand, we...... show that for sufficiently many agents and any truthful-in-expectation ordinal mechanism, there is a valuation profile where the mechanism achieves at most an O(m^{-{2/3}) fraction of the optimal social welfare in expectation. We get tighter bounds for the natural special case of m = 3...
Approximation of Surfaces by Cylinders
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....
Analytical approximations for spiral waves
Löber, Jakob, E-mail: jakob@physik.tu-berlin.de; Engel, Harald [Institut für Theoretische Physik, Technische Universität Berlin, Hardenbergstrasse 36, EW 7-1, 10623 Berlin (Germany)
2013-12-15
We propose a non-perturbative attempt to solve the kinematic equations for spiral waves in excitable media. From the eikonal equation for the wave front we derive an implicit analytical relation between rotation frequency Ω and core radius R{sub 0}. For free, rigidly rotating spiral waves our analytical prediction is in good agreement with numerical solutions of the linear eikonal equation not only for very large but also for intermediate and small values of the core radius. An equivalent Ω(R{sub +}) dependence improves the result by Keener and Tyson for spiral waves pinned to a circular defect of radius R{sub +} with Neumann boundaries at the periphery. Simultaneously, analytical approximations for the shape of free and pinned spirals are given. We discuss the reasons why the ansatz fails to correctly describe the dependence of the rotation frequency on the excitability of the medium.
On quantum and approximate privacy
Klauck, H
2001-01-01
This paper studies privacy in communication complexity. The focus is on quantum versions of the model and on protocols with only approximate privacy against honest players. We show that the privacy loss (the minimum divulged information) in computing a function can be decreased exponentially by using quantum protocols, while the class of privately computable functions (i.e., those with privacy loss 0) is not increased by quantum protocols. Quantum communication combined with small information leakage on the other hand makes certain functions computable (almost) privately which are not computable using quantum communication without leakage or using classical communication with leakage. We also give an example of an exponential reduction of the communication complexity of a function by allowing a privacy loss of o(1) instead of privacy loss 0.
Ranking Support Vector Machine with Kernel Approximation.
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.
IONIS: Approximate atomic photoionization intensities
Heinäsmäki, Sami
2012-02-01
A program to compute relative atomic photoionization cross sections is presented. The code applies the output of the multiconfiguration Dirac-Fock method for atoms in the single active electron scheme, by computing the overlap of the bound electron states in the initial and final states. The contribution from the single-particle ionization matrix elements is assumed to be the same for each final state. This method gives rather accurate relative ionization probabilities provided the single-electron ionization matrix elements do not depend strongly on energy in the region considered. The method is especially suited for open shell atoms where electronic correlation in the ionic states is large. Program summaryProgram title: IONIS Catalogue identifier: AEKK_v1_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEKK_v1_0.html Program obtainable from: CPC Program Library, Queen's University, Belfast, N. Ireland Licensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.html No. of lines in distributed program, including test data, etc.: 1149 No. of bytes in distributed program, including test data, etc.: 12 877 Distribution format: tar.gz Programming language: Fortran 95 Computer: Workstations Operating system: GNU/Linux, Unix Classification: 2.2, 2.5 Nature of problem: Photoionization intensities for atoms. Solution method: The code applies the output of the multiconfiguration Dirac-Fock codes Grasp92 [1] or Grasp2K [2], to compute approximate photoionization intensities. The intensity is computed within the one-electron transition approximation and by assuming that the sum of the single-particle ionization probabilities is the same for all final ionic states. Restrictions: The program gives nonzero intensities for those transitions where only one electron is removed from the initial configuration(s). Shake-type many-electron transitions are not computed. The ionized shell must be closed in the initial state. Running time: Few seconds for a
Approximate analytic solutions to the NPDD: Short exposure approximations
Close, Ciara E.; Sheridan, John T.
2014-04-01
There have been many attempts to accurately describe the photochemical processes that take places in photopolymer materials. As the models have become more accurate, solving them has become more numerically intensive and more 'opaque'. Recent models incorporate the major photochemical reactions taking place as well as the diffusion effects resulting from the photo-polymerisation process, and have accurately described these processes in a number of different materials. It is our aim to develop accessible mathematical expressions which provide physical insights and simple quantitative predictions of practical value to material designers and users. In this paper, starting with the Non-Local Photo-Polymerisation Driven Diffusion (NPDD) model coupled integro-differential equations, we first simplify these equations and validate the accuracy of the resulting approximate model. This new set of governing equations are then used to produce accurate analytic solutions (polynomials) describing the evolution of the monomer and polymer concentrations, and the grating refractive index modulation, in the case of short low intensity sinusoidal exposures. The physical significance of the results and their consequences for holographic data storage (HDS) are then discussed.
Haemophilus influenzae type f meningitis in a previously healthy boy
Ronit, Andreas; Berg, Ronan M G; Bruunsgaard, Helle;
2013-01-01
Non-serotype b strains of Haemophilus influenzae are extremely rare causes of acute bacterial meningitis in immunocompetent individuals. We report a case of acute bacterial meningitis in a 14-year-old boy, who was previously healthy and had been immunised against H influenzae serotype b (Hib...
Born approximation, scattering, and algorithm
Martinez, Alex; Hu, Mengqi; Gu, Haicheng; Qiao, Zhijun
2015-05-01
In the past few decades, there were many imaging algorithms designed in the case of the absence of multiple scattering. Recently, we discussed an algorithm for removing high order scattering components from collected data. This paper is a continuation of our previous work. First, we investigate the current state of multiple scattering in SAR. Then, we revise our method and test it. Given an estimate of our target reflectivity, we compute the multi scattering effects in the target region for various frequencies. Furthermore, we propagate this energy through free space towards our antenna, and remove it from the collected data.
Fast approximate quadratic programming for graph matching.
Joshua T Vogelstein
Full Text Available Quadratic assignment problems arise in a wide variety of domains, spanning operations research, graph theory, computer vision, and neuroscience, to name a few. The graph matching problem is a special case of the quadratic assignment problem, and graph matching is increasingly important as graph-valued data is becoming more prominent. With the aim of efficiently and accurately matching the large graphs common in big data, we present our graph matching algorithm, the Fast Approximate Quadratic assignment algorithm. We empirically demonstrate that our algorithm is faster and achieves a lower objective value on over 80% of the QAPLIB benchmark library, compared with the previous state-of-the-art. Applying our algorithm to our motivating example, matching C. elegans connectomes (brain-graphs, we find that it efficiently achieves performance.
Fast approximate quadratic programming for graph matching.
Vogelstein, Joshua T; Conroy, John M; Lyzinski, Vince; Podrazik, Louis J; Kratzer, Steven G; Harley, Eric T; Fishkind, Donniell E; Vogelstein, R Jacob; Priebe, Carey E
2015-01-01
Quadratic assignment problems arise in a wide variety of domains, spanning operations research, graph theory, computer vision, and neuroscience, to name a few. The graph matching problem is a special case of the quadratic assignment problem, and graph matching is increasingly important as graph-valued data is becoming more prominent. With the aim of efficiently and accurately matching the large graphs common in big data, we present our graph matching algorithm, the Fast Approximate Quadratic assignment algorithm. We empirically demonstrate that our algorithm is faster and achieves a lower objective value on over 80% of the QAPLIB benchmark library, compared with the previous state-of-the-art. Applying our algorithm to our motivating example, matching C. elegans connectomes (brain-graphs), we find that it efficiently achieves performance.
Unitary Approximations in Fault Detection Filter Design
Dušan Krokavec
2016-01-01
Full Text Available The paper is concerned with the fault detection filter design requirements that relax the existing conditions reported in the previous literature by adapting the unitary system principle in approximation of fault detection filter transfer function matrix for continuous-time linear MIMO systems. Conditions for the existence of a unitary construction are presented under which the fault detection filter with a unitary transfer function can be designed to provide high residual signals sensitivity with respect to faults. Otherwise, reflecting the emplacement of singular values in unitary construction principle, an associated structure of linear matrix inequalities with built-in constraints is outlined to design the fault detection filter only with a Hurwitz transfer function. All proposed design conditions are verified by the numerical illustrative examples.
Approximation algorithm for multiprocessor parallel job scheduling
陈松乔; 黄金贵; 陈建二
2002-01-01
Pk|fix|Cmax problem is a new scheduling problem based on the multiprocessor parallel job, and it is proved to be NP-hard problem when k≥3. This paper focuses on the case of k=3. Some new observations and new techniques for P3|fix|Cmax problem are offered. The concept of semi-normal schedulings is introduced, and a very simple linear time algorithm Semi-normal Algorithm for constructing semi-normal schedulings is developed. With the method of the classical Graham List Scheduling, a thorough analysis of the optimal scheduling on a special instance is provided, which shows that the algorithm is an approximation algorithm of ratio of 9/8 for any instance of P3|fix|Cmax problem, and improves the previous best ratio of 7/6 by M.X.Goemans.
On some applications of diophantine approximations
Chudnovsky, G. V.
1984-01-01
Siegel's results [Siegel, C. L. (1929) Abh. Preuss. Akad. Wiss. Phys.-Math. Kl. 1] on the transcendence and algebraic independence of values of E-functions are refined to obtain the best possible bound for the measures of irrationality and linear independence of values of arbitrary E-functions at rational points. Our results show that values of E-functions at rational points have measures of diophantine approximations typical to “almost all” numbers. In particular, any such number has the “2 + ε” exponent of irrationality: ǀΘ - p/qǀ > ǀqǀ-2-ε for relatively prime rational integers p,q, with q ≥ q0 (Θ, ε). These results answer some problems posed by Lang. The methods used here are based on the introduction of graded Padé approximations to systems of functions satisfying linear differential equations with rational function coefficients. The constructions and proofs of this paper were used in the functional (nonarithmetic case) in a previous paper [Chudnovsky, D. V. & Chudnovsky, G. V. (1983) Proc. Natl. Acad. Sci. USA 80, 5158-5162]. PMID:16593441
Exact and Approximate Sizes of Convex Datacubes
Nedjar, Sébastien
In various approaches, data cubes are pre-computed in order to efficiently answer Olap queries. The notion of data cube has been explored in various ways: iceberg cubes, range cubes, differential cubes or emerging cubes. Previously, we have introduced the concept of convex cube which generalizes all the quoted variants of cubes. More precisely, the convex cube captures all the tuples satisfying a monotone and/or antimonotone constraint combination. This paper is dedicated to a study of the convex cube size. Actually, knowing the size of such a cube even before computing it has various advantages. First of all, free space can be saved for its storage and the data warehouse administration can be improved. However the main interest of this size knowledge is to choose at best the constraints to apply in order to get a workable result. For an aided calibrating of constraints, we propose a sound characterization, based on inclusion-exclusion principle, of the exact size of convex cube as long as an upper bound which can be very quickly yielded. Moreover we adapt the nearly optimal algorithm HyperLogLog in order to provide a very good approximation of the exact size of convex cubes. Our analytical results are confirmed by experiments: the approximated size of convex cubes is really close to their exact size and can be computed quasi immediately.
Approximation of Failure Probability Using Conditional Sampling
Giesy. Daniel P.; Crespo, Luis G.; Kenney, Sean P.
2008-01-01
In analyzing systems which depend on uncertain parameters, one technique is to partition the uncertain parameter domain into a failure set and its complement, and judge the quality of the system by estimating the probability of failure. If this is done by a sampling technique such as Monte Carlo and the probability of failure is small, accurate approximation can require so many sample points that the computational expense is prohibitive. Previous work of the authors has shown how to bound the failure event by sets of such simple geometry that their probabilities can be calculated analytically. In this paper, it is shown how to make use of these failure bounding sets and conditional sampling within them to substantially reduce the computational burden of approximating failure probability. It is also shown how the use of these sampling techniques improves the confidence intervals for the failure probability estimate for a given number of sample points and how they reduce the number of sample point analyses needed to achieve a given level of confidence.
Cataract surgery in previously vitrectomized eyes.
Akinci, A; Batman, C; Zilelioglu, O
2008-05-01
To evaluate the results of extracapsular cataract extraction (ECCE) and phacoemulsification (PHACO) performed in previously vitrectomized eyes. In this retrospective study, 56 vitrectomized eyes that had ECCE and 60 vitrectomized eyes that had PHACO were included in the study group while 65 eyes that had PHACO in the control group. The evaluated parameters were the incidence of intra-operative and postoperative complications (IPC) and visual outcomes. Chi-squared, independent samples and paired samples tests were used for comparing the results. Deep anterior chamber (AC) was significantly more common in the PHACO group of vitrectomized eyes (PGVE) and observed in eyes that had undergone extensive vitreous removal (p ECCE group and the PGVE (p > 0.05). Some of the intra-operative conditions such as posterior synechiae, primary posterior capsular opacification (PCO) and postoperative complications such as retinal detachment (RD), PCO were significantly more common in vitrectomized eyes than the controls (p ECCE group and the PGVE (p > 0.05). Deep AC is more common in eyes with extensive vitreous removal during PHACO than ECCE. Decreasing the bottle height is advised in this case. Except for this, the results of ECCE and PHACO are similar in previously vitrectomized eyes. Posterior synechiaes, primary and postoperative PCO and RD are more common in vitrectomized eyes than the controls.
Spectra of absolute instruments from the WKB approximation
Tyc, Tomas
2013-01-01
We calculate frequency spectra of absolute optical instruments using the WKB approximation. The resulting eigenfrequencies approximate the actual values very accurately, in some cases they even give the exact values. Our calculations confirm results obtained previously by a completely different method. In particular, the eigenfrequencies of absolute instruments form tight groups that are almost equidistantly spaced. We demonstrate our method and its results on several examples.
The Log-Linear Return Approximation, Bubbles, and Predictability
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....... 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....
Iaia, F. M.; Perez-Gomez, J.; Nordsborg, Nikolai;
2010-01-01
The present study examined how metabolic response and work capacity are affected by previous exhaustive exercise. Seven subjects performed an exhaustive cycle exercise ( approximately 130%-max; EX2) after warm-up (CON) and 2 min after an exhaustive bout at a very high (VH; approximately 30 s), high...... during a repeated high-intensity exercise lasting 1/2-2 min....
Randomized approximate nearest neighbors algorithm.
Jones, Peter Wilcox; Osipov, Andrei; Rokhlin, Vladimir
2011-09-20
We present a randomized algorithm for the approximate nearest neighbor problem in d-dimensional Euclidean space. Given N points {x(j)} in R(d), the algorithm attempts to find k nearest neighbors for each of x(j), where k is a user-specified integer parameter. The algorithm is iterative, and its running time requirements are proportional to T·N·(d·(log d) + k·(d + log k)·(log N)) + N·k(2)·(d + log k), with T the number of iterations performed. The memory requirements of the procedure are of the order N·(d + k). A by-product of the scheme is a data structure, permitting a rapid search for the k nearest neighbors among {x(j)} for an arbitrary point x ∈ R(d). The cost of each such query is proportional to T·(d·(log d) + log(N/k)·k·(d + log k)), and the memory requirements for the requisite data structure are of the order N·(d + k) + T·(d + N). The algorithm utilizes random rotations and a basic divide-and-conquer scheme, followed by a local graph search. We analyze the scheme's behavior for certain types of distributions of {x(j)} and illustrate its performance via several numerical examples.
Brughelli, Matt; Cronin, John; Mendiguchia, Jurdan; Kinsella, Dave; Nosaka, Ken
2010-09-01
Contralateral leg deficits between lower limbs during athletic movements are thought to increase the risk of injury and compromise performance. The purpose of this study was to quantify the magnitude of leg deficits during running in noninjured and previously injured Australian Rules football (ARF) players. The players included a group of noninjured ARF players (n = 11) and a group of previously injured ARF players (n = 11; hamstring injuries only). The players in the injured group (IG) had at least 1 acute hamstring injury in the previous 2 years. The legs of the noninjured players (NIG) were classified as right and left, whereas the legs of the injured players were classified as injured or noninjured. The players ran on a nonmotorized force treadmill at approximately 80% of their maximum velocity (Vmax). For the NIG, there were no significant differences between right and left legs for any of the variables. For the IG, the only variable that was significantly (p velocities.
Obinutuzumab for previously untreated chronic lymphocytic leukemia.
Abraham, Jame; Stegner, Mark
2014-04-01
Obinutuzumab was approved by the Food and Drug Administration in late 2013 for use in combination with chlorambucil for the treatment of patients with previously untreated chronic lymphocytic leukemia (CLL). The approval was based on results of an open-label phase 3 trial that showed improved progression-free survival (PFS) with the combination of obinutuzumab plus chlorambucil compared with chlorambucil alone. Obinutuzumab is a monoclonal antibody that targets CD20 antigen expressed on the surface of pre B- and mature B-lymphocytes. After binding to CD20, obinutuzumab mediates B-cell lysis by engaging immune effector cells, directly activating intracellular death signaling pathways, and activating the complement cascade. Immune effector cell activities include antibody-dependent cellular cytotoxicity and antibody-dependent cellular phagocytosis.
Can previous learning alter future plasticity mechanisms?
Crestani, Ana Paula; Quillfeldt, Jorge Alberto
2016-02-01
The dynamic processes related to mnemonic plasticity have been extensively researched in the last decades. More recently, studies have attracted attention because they show an unusual plasticity mechanism that is independent of the receptor most usually related to first-time learning--that is, memory acquisition-the NMDA receptor. An interesting feature of this type of learning is that a previous experience may cause modifications in the plasticity mechanism of a subsequent learning, suggesting that prior experience in a very similar task triggers a memory acquisition process that does not depend on NMDARs. The intracellular molecular cascades necessary to assist the learning process seem to depend on the activation of hippocampal CP-AMPARs. Moreover, most of these studies were performed on hippocampus-dependent tasks, even though other brain areas, such as the basolateral amygdala, also display NMDAR-independent learning.
Induced vaginal birth after previous caesarean section
Akylbek Tussupkaliyev
2016-11-01
Full Text Available Introduction The rate of operative birth by Caesarean section is constantly rising. In Kazakhstan, it reaches 27 per cent. Research data confirm that the percentage of successful vaginal births after previous Caesarean section is 50–70 per cent. How safe the induction of vaginal birth after Caesarean (VBAC remains unclear. Methodology The studied techniques of labour induction were amniotomy of the foetal bladder with the vulsellum ramus, intravaginal administration of E1 prostaglandin (Misoprostol, and intravenous infusion of Oxytocin-Richter. The assessment of rediness of parturient canals was conducted by Bishop’s score; the labour course was assessed by a partogram. The effectiveness of labour induction techniques was assessed by the number of administered doses, the time of onset of regular labour, the course of labour and the postpartum period and the presence of complications, and the course of the early neonatal period, which implied the assessment of the child’s condition, described in the newborn development record. The foetus was assessed by medical ultrasound and antenatal and intranatal cardiotocography (CTG. Obtained results were analysed with SAS statistical processing software. Results The overall percentage of successful births with intravaginal administration of Misoprostol was 93 per cent (83 of cases. This percentage was higher than in the amniotomy group (relative risk (RR 11.7 and was similar to the oxytocin group (RR 0.83. Amniotomy was effective in 54 per cent (39 of cases, when it induced regular labour. Intravenous oxytocin infusion was effective in 94 per cent (89 of cases. This percentage was higher than that with amniotomy (RR 12.5. Conclusions The success of vaginal delivery after previous Caesarean section can be achieved in almost 70 per cent of cases. At that, labour induction does not decrease this indicator and remains within population boundaries.
Approximate Quantum Adders with Genetic Algorithms: An IBM Quantum Experience
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.
Approximate Quantum Adders with Genetic Algorithms: An IBM Quantum Experience
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.
Non-perturbative QCD amplitudes in quenched and eikonal approximations
Fried, H. M.; Grandou, T.; Sheu, Y.-M.
2014-05-01
Even though approximated, strong coupling non-perturbative QCD amplitudes remain very difficult to obtain. In this article, in eikonal and quenched approximations at least, physical insights are presented that rely on the newly-discovered property of effective locality. The present article also provides a more rigorous mathematical basis for the crude approximations used in the previous derivation of the binding potential of quarks and nucleons. Furthermore, the techniques of Random Matrix calculus along with Meijer G-functions are applied to analyze the generic structure of fermionic amplitudes in QCD.
Revisiting the envelope approximation: gravitational waves from bubble collisions
Weir, David J
2016-01-01
We study the envelope approximation and its applicability to first-order phase transitions in the early universe. We demonstrate that the power laws seen in previous studies exist independent of the nucleation rate. We also compare the envelope approximation prediction to results from large-scale phase transition simulations. For phase transitions where the contribution to gravitational waves from scalar fields dominates over that from the coupled plasma of light particles, the envelope approximation is in agreement, giving a power spectrum of the same form and order of magnitude. In all other cases the form and amplitude of the gravitational wave power spectrum is markedly different and new techniques are required.
Revisiting the envelope approximation: Gravitational waves from bubble collisions
Weir, David J.
2016-06-01
We study the envelope approximation and its applicability to first-order phase transitions in the early Universe. We demonstrate that the power laws seen in previous studies exist independently of the nucleation rate. We also compare the envelope approximation prediction to results from large-scale phase transition simulations. For phase transitions where the contribution to gravitational waves from scalar fields dominates over that from the coupled plasma of light particles, the envelope approximation is in agreement, giving a power spectrum of the same form and order of magnitude. In all other cases the form and amplitude of the gravitational wave power spectrum is markedly different and new techniques are required.
Endophthalmitis after tooth extraction in a patient with previous perforating eye injury.
Ogurel, Tevfik; Onaran, Zafer; Ogurel, Reyhan; Örnek, Kemal
2015-01-01
The aim of this stuty is to describe a case of endophthalmitis after tooth extraction in a patient with previous perforating eye injury. 50 years old male patient attempted to our clinic with complaints of sudden severe pain, reduced vision, light sensitivity and redness in the right eye. The patient stated that severe pain in his eye began approximately 12 hours following tooth extraction. The patient's ocular examination revealed a visual acuity of hand motion in the right eye. Anterior segment examination of the right eye showed intense conjunctival hyperemia, chemosis, a fine keraticprespitat and corneal edema. Dental procedures of the patients who had recently underwent ocular surgery or trauma should be done in a more controlled manner under anti -infective therapy or should be postponed in elective procedures.
Obtaining exact value by approximate computations
Jing-zhong ZHANG; Yong FENG
2007-01-01
Numerical approximate computations can solve large and complex problems fast. They have the advantage of high efficiency. However they only give approximate results, whereas we need exact results in some fields. There is a gap between approximate computations and exact results.In this paper, we build a bridge by which exact results can be obtained by numerical approximate computations.
Fuzzy Set Approximations in Fuzzy Formal Contexts
Mingwen Shao; Shiqing Fan
2006-01-01
In this paper, a kind of multi-level formal concept is introduced. Based on the proposed multi-level formal concept, we present a pair of rough fuzzy set approximations within fuzzy formal contexts. By the proposed rough fuzzy set approximations, we can approximate a fuzzy set according to different precision level. We discuss the properties of the proposed approximation operators in detail.
Obtaining exact value by approximate computations
2007-01-01
Numerical approximate computations can solve large and complex problems fast.They have the advantage of high efficiency.However they only give approximate results,whereas we need exact results in some fields.There is a gap between approximate computations and exact results. In this paper,we build a bridge by which exact results can be obtained by numerical approximate computations.
Sebacinales everywhere: previously overlooked ubiquitous fungal endophytes.
Weiss, Michael; Sýkorová, Zuzana; Garnica, Sigisfredo; Riess, Kai; Martos, Florent; Krause, Cornelia; Oberwinkler, Franz; Bauer, Robert; Redecker, Dirk
2011-02-15
Inconspicuous basidiomycetes from the order Sebacinales are known to be involved in a puzzling variety of mutualistic plant-fungal symbioses (mycorrhizae), which presumably involve transport of mineral nutrients. Recently a few members of this fungal order not fitting this definition and commonly referred to as 'endophytes' have raised considerable interest by their ability to enhance plant growth and to increase resistance of their host plants against abiotic stress factors and fungal pathogens. Using DNA-based detection and electron microscopy, we show that Sebacinales are not only extremely versatile in their mycorrhizal associations, but are also almost universally present as symptomless endophytes. They occurred in field specimens of bryophytes, pteridophytes and all families of herbaceous angiosperms we investigated, including liverworts, wheat, maize, and the non-mycorrhizal model plant Arabidopsis thaliana. They were present in all habitats we studied on four continents. We even detected these fungi in herbarium specimens originating from pioneering field trips to North Africa in the 1830s/40s. No geographical or host patterns were detected. Our data suggest that the multitude of mycorrhizal interactions in Sebacinales may have arisen from an ancestral endophytic habit by specialization. Considering their proven beneficial influence on plant growth and their ubiquity, endophytic Sebacinales may be a previously unrecognized universal hidden force in plant ecosystems.
Surgery of intracranial aneurysms previously treated endovascularly.
Tirakotai, Wuttipong; Sure, Ulrich; Yin, Yuhua; Benes, Ludwig; Schulte, Dirk Michael; Bien, Siegfried; Bertalanffy, Helmut
2007-11-01
To perform a retrospective study on the patients who underwent aneurysmal surgery following endovascular treatment. We performed a retrospective study on eight patients who underwent aneurysmal surgery following endovascular treatment (-attempts) with gugliemi detachable coils (GDCs). The indications for surgery, surgical techniques and clinical outcomes were analyzed. The indications for surgical treatment after GDC coiling of aneurysm were classified into three groups. First group: surgery of incompletely coiled aneurysms (n=4). Second group: surgery of mass effect on the neural structures due to coil compaction or rebleeding (n=2). Third group: surgery of vascular complications after endovascular procedure due to parent artery occlusion or thrombus propagation from aneurysm (n=2). Aneurysm obliterations could be performed in all cases confirmed by postoperative angiography. Six patients had an excellent outcome and returned to their profession. Patient's visual acuity was improved. One individual experienced right hemiparesis (grade IV/V) and hemihypesthesia. Microsurgical clipping is rarely necessary for previously coiled aneurysms. Surgical treatment is uncommonly required when an acute complication arises during endovascular treatment, or when there is a dynamic change of a residual aneurysm configuration over time that is considered to be insecure.
[Electronic cigarettes - effects on health. Previous reports].
Napierała, Marta; Kulza, Maksymilian; Wachowiak, Anna; Jabłecka, Katarzyna; Florek, Ewa
2014-01-01
Currently very popular in the market of tobacco products have gained electronic cigarettes (ang. E-cigarettes). These products are considered to be potentially less harmful in compared to traditional tobacco products. However, current reports indicate that the statements of the producers regarding to the composition of the e- liquids not always are sufficient, and consumers often do not have reliable information on the quality of the product used by them. This paper contain a review of previous reports on the composition of e-cigarettes and their impact on health. Most of the observed health effects was related to symptoms of the respiratory tract, mouth, throat, neurological complications and sensory organs. Particularly hazardous effects of the e-cigarettes were: pneumonia, congestive heart failure, confusion, convulsions, hypotension, aspiration pneumonia, face second-degree burns, blindness, chest pain and rapid heartbeat. In the literature there is no information relating to passive exposure by the aerosols released during e-cigarette smoking. Furthermore, the information regarding to the use of these products in the long term are not also available.
Sebacinales everywhere: previously overlooked ubiquitous fungal endophytes.
Michael Weiss
Full Text Available Inconspicuous basidiomycetes from the order Sebacinales are known to be involved in a puzzling variety of mutualistic plant-fungal symbioses (mycorrhizae, which presumably involve transport of mineral nutrients. Recently a few members of this fungal order not fitting this definition and commonly referred to as 'endophytes' have raised considerable interest by their ability to enhance plant growth and to increase resistance of their host plants against abiotic stress factors and fungal pathogens. Using DNA-based detection and electron microscopy, we show that Sebacinales are not only extremely versatile in their mycorrhizal associations, but are also almost universally present as symptomless endophytes. They occurred in field specimens of bryophytes, pteridophytes and all families of herbaceous angiosperms we investigated, including liverworts, wheat, maize, and the non-mycorrhizal model plant Arabidopsis thaliana. They were present in all habitats we studied on four continents. We even detected these fungi in herbarium specimens originating from pioneering field trips to North Africa in the 1830s/40s. No geographical or host patterns were detected. Our data suggest that the multitude of mycorrhizal interactions in Sebacinales may have arisen from an ancestral endophytic habit by specialization. Considering their proven beneficial influence on plant growth and their ubiquity, endophytic Sebacinales may be a previously unrecognized universal hidden force in plant ecosystems.
A previously undescribed pathway for pyrimidine catabolism.
Loh, Kevin D; Gyaneshwar, Prasad; Markenscoff Papadimitriou, Eirene; Fong, Rebecca; Kim, Kwang-Seo; Parales, Rebecca; Zhou, Zhongrui; Inwood, William; Kustu, Sydney
2006-03-28
The b1012 operon of Escherichia coli K-12, which is composed of seven unidentified ORFs, is one of the most highly expressed operons under control of nitrogen regulatory protein C. Examination of strains with lesions in this operon on Biolog Phenotype MicroArray (PM3) plates and subsequent growth tests indicated that they failed to use uridine or uracil as the sole nitrogen source and that the parental strain could use them at room temperature but not at 37 degrees C. A strain carrying an ntrB(Con) mutation, which elevates transcription of genes under nitrogen regulatory protein C control, could also grow on thymidine as the sole nitrogen source, whereas strains with lesions in the b1012 operon could not. Growth-yield experiments indicated that both nitrogens of uridine and thymidine were available. Studies with [(14)C]uridine indicated that a three-carbon waste product from the pyrimidine ring was excreted. After trimethylsilylation and gas chromatography, the waste product was identified by mass spectrometry as 3-hydroxypropionic acid. In agreement with this finding, 2-methyl-3-hydroxypropionic acid was released from thymidine. Both the number of available nitrogens and the waste products distinguished the pathway encoded by the b1012 operon from pyrimidine catabolic pathways described previously. We propose that the genes of this operon be named rutA-G for pyrimidine utilization. The product of the divergently transcribed gene, b1013, is a tetracycline repressor family regulator that controls transcription of the b1012 operon negatively.
Endoscopic Third Ventriculostomy in Previously Shunted Children
Eva Brichtova
2013-01-01
Full Text Available Endoscopic third ventriculostomy (ETV is a routine and safe procedure for therapy of obstructive hydrocephalus. The aim of our study is to evaluate ETV success rate in therapy of obstructive hydrocephalus in pediatric patients formerly treated by ventriculoperitoneal (V-P shunt implantation. From 2001 till 2011, ETV was performed in 42 patients with former V-P drainage implantation. In all patients, the obstruction in aqueduct or outflow parts of the fourth ventricle was proved by MRI. During the surgery, V-P shunt was clipped and ETV was performed. In case of favourable clinical state and MRI functional stoma, the V-P shunt has been removed 3 months after ETV. These patients with V-P shunt possible removing were evaluated as successful. In our group of 42 patients we were successful in 29 patients (69%. There were two serious complications (4.7%—one patient died 2.5 years and one patient died 1 year after surgery in consequence of delayed ETV failure. ETV is the method of choice in obstructive hydrocephalus even in patients with former V-P shunt implantation. In case of acute or scheduled V-P shunt surgical revision, MRI is feasible, and if ventricular system obstruction is diagnosed, the hydrocephalus may be solved endoscopically.
Nonlinear approximation with dictionaries I. Direct estimates
Gribonval, Rémi; Nielsen, Morten
2004-01-01
We study various approximation classes associated with m-term approximation by elements from a (possibly) redundant dictionary in a Banach space. The standard approximation class associated with the best m-term approximation is compared to new classes defined by considering m-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, and we prove...
Nonlinear approximation with dictionaries, I: Direct estimates
Gribonval, Rémi; Nielsen, Morten
We study various approximation classes associated with $m$-term approximation by elements from a (possibly redundant) dictionary in a Banach space. The standard approximation class associated with the best $m$-term approximation is compared to new classes defined by considering $m......$-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...
Photoelectron spectroscopy and the dipole approximation
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.
Wolf, Steven E
2009-12-01
For 2008, approximately 1200 original burn research articles were published in scientific journals using the English language. This article reviews those with the most impact on burn treatment according to the Editor of one of the major journals (Burns). As in the previous year's review, articles were divided into the following topic areas: epidemiology, wound characterisation, critical care physiology, inhalation injury, infection, metabolism and nutrition, psychological considerations, pain management, rehabilitation, and burn reconstruction. Each selected article is mentioned briefly with editorial comment.
Libertus, Melissa E; Feigenson, Lisa; Halberda, Justin
2013-12-01
Previous research has found a relationship between individual differences in children's precision when nonverbally approximating quantities and their school mathematics performance. School mathematics performance emerges from both informal (e.g., counting) and formal (e.g., knowledge of mathematics facts) abilities. It remains unknown whether approximation precision relates to both of these types of mathematics abilities. In the current study, we assessed the precision of numerical approximation in 85 3- to 7-year-old children four times over a span of 2years. In addition, at the final time point, we tested children's informal and formal mathematics abilities using the Test of Early Mathematics Ability (TEMA-3). We found that children's numerical approximation precision correlated with and predicted their informal, but not formal, mathematics abilities when controlling for age and IQ. These results add to our growing understanding of the relationship between an unlearned nonsymbolic system of quantity representation and the system of mathematics reasoning that children come to master through instruction. Copyright © 2013 Elsevier Inc. All rights reserved.
刘立涛; 孙韵; 卢涛; 谭显曙; 秦盼立; 周黎明
2012-01-01
Objective To investigate the antimicrobial susceptibility to clinically isolated strains in the previous five years and the drug resistance to antimicrobial agents so as to realize the antibacterial activity to erythromycin cyclic 11,12-carbonate in vitro. Methods Agar dilution method was used to detect the drug susceptibility to the 220 clinical isolates. Results Susceptibility test showed the resistance rates of Streptococcus pneumoniae, Streptococcus pyogenes, Staphylococcus aureus, Staphylococcus epidermidis and H. Influenzae to erythromycin cyclic 11,12-carbonate were 35.0%, 55.0%, 35.0%, 36.7% and 70.0%. The MIC50 of Staphylococcus aureus, Staphylococcus epidermidis and H. Influenzae were 1, 1, 32, 0.5 and 64ug/mL, and the MIC90 were 32, 8, 256, 32 and 128μg/mL. Conclusion The resistance of clinical isolates indicated that erythromycin cyclic 11,12-carbonate was comparative with azithromycin in the antibacterial activity, presenting no statistically significant between erythromycin cyclic 1 l,12-carbonate and azithromycin by SPSS17.0 (P>0.05).%目的 通过比较近五年临床分离菌株对多种抗菌药物的药物敏感性及耐药性研究,了解环酯红霉素的体外抗菌活性.方法 利用琼脂平板稀释法对临床分离220株细菌进行药敏性分析.结果 药物敏感性实验表明肺炎链球菌、化脓链球菌、金黄色葡萄球菌、表皮葡萄球菌和流感嗜血菌对环酯红霉素的耐药率分别为35.0％、55.0％、35.0％、36.7 ％和70.0 ％.肺炎链球菌、化脓链球菌、金黄色葡萄球菌、表皮葡萄球菌和流感嗜血菌对环酯红霉素的MIC50和MIC90分别为1、1、32、0.5、64μg/mL和32、8、256、32、128μg/mL.结论 经SPSS17.0统计分析后,发现临床分离菌株对环酯红霉素和阿奇霉素的耐药率表明两者的抗菌活性相当,不存在统计学差异(P＞0.05).
Cutaneous responses to vaccinia in individuals with previous smallpox vaccination.
Simpson, Eric L; Hercher, Michelle; Hammarlund, Erika K; Lewis, Matthew W; Slifka, Mark K; Hanifin, Jon M
2007-09-01
The durability of immune responses to smallpox vaccine is a subject of considerable debate. We compared cutaneous vaccinia responses in patients vaccinated in the distant past with vaccine-naïve individuals using serial close-up photographs. The previously vaccinated group had a significantly reduced time course and milder cutaneous reactions. Vaccinated individuals appear to maintain clinically detectable immunity against vaccinia for at least 20 years after smallpox vaccination.
Robotic Assisted Laparoscopic Prostatectomy Performed after Previous Suprapubic Prostatectomy
Tsui, Johnson F.; Feuerstein, Michael; Jazayeri, Seyed Behzad
2016-01-01
Operative management of prostate cancer in a patient who has undergone previous open suprapubic simple prostatectomy poses a unique surgical challenge. Herein, we describe a case of intermediate risk prostate cancer in a man who had undergone simple prostatectomy ten years prior to presentation. The patient was found to have Gleason 7 prostate cancer on MRI fusion biopsy of the prostate for elevated PSA and underwent an uncomplicated robot assisted laparoscopic radical prostatectomy. PMID:27882057
Fontan completion in a patient with previous liver transplantation.
Haida, Hirofumi; Aeba, Ryo; Hoshino, Ken; Morikawa, Yasuhide
2014-10-01
We present the first case of a successful Fontan completion in a patient with previous liver transplantation. An infant with polysplenia syndrome with a functional single ventricle and biliary atresia had been surgically managed by pulmonary artery banding, Kasai operation and living donor liver transplantation. Subsequently, the patient successfully underwent bidirectional cavopulmonary shunt and total cavopulmonary connection with extracardiac conduit at 3 and 5 years of age, respectively.
Approximation Preserving Reductions among Item Pricing Problems
Hamane, Ryoso; Itoh, Toshiya; Tomita, Kouhei
When a store sells items to customers, the store wishes to determine the prices of the items to maximize its profit. Intuitively, if the store sells the items with low (resp. high) prices, the customers buy more (resp. less) items, which provides less profit to the store. So it would be hard for the store to decide the prices of items. Assume that the store has a set V of n items and there is a set E of m customers who wish to buy those items, and also assume that each item i ∈ V has the production cost di and each customer ej ∈ E has the valuation vj on the bundle ej ⊆ V of items. When the store sells an item i ∈ V at the price ri, the profit for the item i is pi = ri - di. The goal of the store is to decide the price of each item to maximize its total profit. We refer to this maximization problem as the item pricing problem. In most of the previous works, the item pricing problem was considered under the assumption that pi ≥ 0 for each i ∈ V, however, Balcan, et al. [In Proc. of WINE, LNCS 4858, 2007] introduced the notion of “loss-leader, ” and showed that the seller can get more total profit in the case that pi < 0 is allowed than in the case that pi < 0 is not allowed. In this paper, we derive approximation preserving reductions among several item pricing problems and show that all of them have algorithms with good approximation ratio.
Using Propensity Score Methods to Approximate Factorial Experimental Designs
Dong, Nianbo
2011-01-01
The purpose of this study is through Monte Carlo simulation to compare several propensity score methods in approximating factorial experimental design and identify best approaches in reducing bias and mean square error of parameter estimates of the main and interaction effects of two factors. Previous studies focused more on unbiased estimates of…
APPROXIMATE SAMPLING THEOREM FOR BIVARIATE CONTINUOUS FUNCTION
杨守志; 程正兴; 唐远炎
2003-01-01
An approximate solution of the refinement equation was given by its mask, and the approximate sampling theorem for bivariate continuous function was proved by applying the approximate solution. The approximate sampling function defined uniquely by the mask of the refinement equation is the approximate solution of the equation, a piece-wise linear function, and posseses an explicit computation formula. Therefore the mask of the refinement equation is selected according to one' s requirement, so that one may controll the decay speed of the approximate sampling function.
Bernstein-type approximations of smooth functions
Andrea Pallini
2007-10-01
Full Text Available The Bernstein-type approximation for smooth functions is proposed and studied. We propose the Bernstein-type approximation with definitions that directly apply the binomial distribution and the multivariate binomial distribution. The Bernstein-type approximations generalize the corresponding Bernstein polynomials, by considering definitions that depend on a convenient approximation coefficient in linear kernels. In the Bernstein-type approximations, we study the uniform convergence and the degree of approximation. The Bernstein-type estimators of smooth functions of population means are also proposed and studied.
Chua, Kaw Bing; Crameri, Gary; Hyatt, Alex; Yu, Meng; Tompang, Mohd Rosli; Rosli, Juliana; McEachern, Jennifer; Crameri, Sandra; Kumarasamy, Verasingam; Eaton, Bryan T; Wang, Lin-Fa
2007-07-03
Respiratory infections constitute the most widespread human infectious disease, and a substantial proportion of them are caused by unknown etiological agents. Reoviruses (respiratory enteric orphan viruses) were first isolated from humans in the early 1950s and so named because they were not associated with any known disease. Here, we report a previously unknown reovirus (named "Melaka virus") isolated from a 39-year-old male patient in Melaka, Malaysia, who was suffering from high fever and acute respiratory disease at the time of virus isolation. Two of his family members developed similar symptoms approximately 1 week later and had serological evidence of infection with the same virus. Epidemiological tracing revealed that the family was exposed to a bat in the house approximately 1 week before the onset of the father's clinical symptoms. Genome sequence analysis indicated a close genetic relationship between Melaka virus and Pulau virus, a reovirus isolated in 1999 from fruit bats in Tioman Island, Malaysia. Screening of sera collected from human volunteers on the island revealed that 14 of 109 (13%) were positive for both Pulau and Melaka viruses. This is the first report of an orthoreovirus in association with acute human respiratory diseases. Melaka virus is serologically not related to the different types of mammalian reoviruses that were known to infect humans asymptomatically. These data indicate that bat-borne reoviruses can be transmitted to and cause clinical diseases in humans.
The local potential approximation in the background field formalism
Bridle, I Hamzaan; Morris, Tim R
2013-01-01
Working within the familiar local potential approximation, and concentrating on the example of a single scalar field in three dimensions, we show that the commonly used approximation method of identifying the total and background fields, leads to pathologies in the resulting fixed point structure and the associated spaces of eigenoperators. We then show how a consistent treatment of the background field through the corresponding modified shift Ward identity, can cure these pathologies, restoring universality of physical quantities with respect to the choice of dependence on the background field, even within the local potential approximation. Along the way we point out similarities to what has been previously found in the f(R) approximation in asymptotic safety for gravity.
Nonlinear Multigrid solver exploiting AMGe Coarse Spaces with Approximation Properties
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...... spaces that were developed recently at Lawrence Livermore National Laboratory. These give the ability to derive stable and accurate coarse nonlinear discretization problems. The previous attempts (including ones with the original AMGe method), were less successful due to lack of such good approximation...... are compared to FAS on a nonlinear saddle point problem with applications to porous media flow. It is demonstrated that FAS is faster than Newton’s method and Picard iterations for the experiments considered here. Due to the guaranteed approximation properties of our AMGe, the coarse spaces are very accurate...
Approximately Counting Embeddings into Random Graphs
Furer, Martin
2008-01-01
Let H be a graph, and let C(H,G) be the number of (subgraph isomorphic) copies of H contained in a graph G. We investigate the fundamental problem of estimating C(H,G). Previous results cover only a few specific instances of this general problem, for example, the case when H has degree at most one (monomer-dimer problem). In this paper, we present the first general subcase of the subgraph isomorphism counting problem which is almost always efficiently approximable. The results rely on a new graph decomposition technique. Informally, the decomposition is a labeling of the vertices generating a sequence of bipartite graphs. The decomposition permits us to break the problem of counting embeddings of large subgraphs into that of counting embeddings of small subgraphs. Using this method, we present a simple randomized algorithm for the counting problem. For all decomposable graphs H and all graphs G, the algorithm is an unbiased estimator. Furthermore, for all graphs H having a decomposition where each of the bipa...
Applications of Discrepancy Theory in Multiobjective Approximation
Glaßer, Christian; Witek, Maximilian
2011-01-01
We apply a multi-color extension of the Beck-Fiala theorem to show that the multiobjective maximum traveling salesman problem is randomized 1/2-approximable on directed graphs and randomized 2/3-approximable on undirected graphs. Using the same technique we show that the multiobjective maximum satisfiablilty problem is 1/2-approximable.
Fractal Trigonometric Polynomials for Restricted Range Approximation
Chand, A. K. B.; Navascués, M. A.; Viswanathan, P.; Katiyar, S. K.
2016-05-01
One-sided approximation tackles the problem of approximation of a prescribed function by simple traditional functions such as polynomials or trigonometric functions that lie completely above or below it. In this paper, we use the concept of fractal interpolation function (FIF), precisely of fractal trigonometric polynomials, to construct one-sided uniform approximants for some classes of continuous functions.
Axiomatic Characterizations of IVF Rough Approximation Operators
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.
Nonlinear approximation with dictionaries, I: Direct estimates
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...
Operator approximant problems arising from quantum theory
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.
Advanced Concepts and Methods of Approximate Reasoning
1989-12-01
and L. Valverde. On mode and implication in approximate reasoning. In M.M. Gupta, A. Kandel, W. Bandler , J.B. Kiszka, editors, Approximate Reasoning and...190, 1981. [43] E. Trillas and L. Valverde. On mode and implication in approximate reasoning. In M.M. Gupta, A. Kandel, W. Bandler , J.B. Kiszka
NONLINEAR APPROXIMATION WITH GENERAL WAVE PACKETS
L. Borup; M. Nielsen
2005-01-01
We study nonlinear approximation in the Triebel-Lizorkin spaces with dictionaries formed by dilating and translating one single function g. A general Jackson inequality is derived for best m-term approximation with such dictionaries. In some special cases where g has a special structure, a complete characterization of the approximation spaces is derived.
Approximate Nearest Neighbor Queries among Parallel Segments
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...
Nonlinear approximation with general wave packets
Borup, Lasse; Nielsen, Morten
2005-01-01
We study nonlinear approximation in the Triebel-Lizorkin spaces with dictionaries formed by dilating and translating one single function g. A general Jackson inequality is derived for best m-term approximation with such dictionaries. In some special cases where g has a special structure, a complete...... characterization of the approximation spaces is derived....
Nonlinear approximation with bi-framelets
Borup, Lasse; Nielsen, Morten; Gribonval, Rémi
2005-01-01
We study the approximation in Lebesgue spaces of wavelet bi-frame systems given by translations and dilations of a finite set of generators. A complete characterization of the approximation spaces associated with best m-term approximation of wavelet bi-framelet systems is given...
Approximation properties of fine hyperbolic graphs
Benyin Fu
2016-05-01
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.
Gholibeigian, Kazem; Gholibeigian, Hassan
2016-04-01
On March 13, 1989 the entire province of Quebec Blackout by solar storm during solar cycle 22. The solar storm of 1859, also known as the Carrington event, was a powerful geomagnetic solar storm during solar cycle 10. The solar storm of 2012 during solar cycle 24 was of similar magnitude, but it passed Earth's orbit without striking the plane. All of these solar storms occurred in the peak of 11 yearly solar cycles. In this way, the White House in its project which is focusing on hazards from solar system, in a new strategy and action plan to increase protection from damaging solar emissions, should focus on coupling of the matched Gravity and Electromagnetic Fields)GEFs) of the Sun with Jupiter and its moons together. On the other hand, in solar system, the Jupiter's gravity has largest effect to the Sun's core and its dislocation, because the gravity force between the Jupiter and the Sun is 11.834 times, In addition overlapping of the solar cycles with the Jupiter's orbit period is 11.856 years. These observable factors lead us to the effect of the Jupiter and Sun gravity fields coupling as the main cause of the approximately 11 years duration for solar cycles. Its peak in each cycle is when the Jupiter is in nearest portion to the Sun in its orbit. In this way, the other planets in their coupling with Sun help to the variations and strengthening solar cycles. [Gholibeigian, 7/24/2015http://adsabs.harvard.edu/abs/2014EGU]. In other words, the both matched GEFs are generating by the large scale forced convection system inside the stars and planets [Gholibeigian et. al, AGU Fall Meeting 2015]. These two fields are couple and strengthening each other. The Jupiter with its 67 moons generate the largest coupled and matched GEFs in its core and consequently strongest effect on the Sun's core. Generation and coupling of the Jupiter's GEFs with its moons like Europa, Io and Ganymede make this planet of thousands of times brighter and many times bigger than Earth as the
Birth after previous cesarean delivery: short-term maternal outcomes.
Lydon-Rochelle, Mona T; Cahill, Alison G; Spong, Catherine Y
2010-08-01
An estimated 40% of the 1.3 million cesarean deliveries performed each year in the United States are repeat procedures. The appropriate clinical management approach for women with previous cesarean delivery remains challenging because options are limited. The risks and benefits of clinical management choices in the woman's health need to be quantified. Thus, we discuss the available published scientific data on (1) the short-term maternal outcomes of trial of labor after cesarean and elective repeat cesarean delivery, (2) the differences between outcomes for both, (3) the important factors that influence these outcomes, and (4) successful vs. unsuccessful vaginal birth after cesarean. For women with a previous cesarean delivery, a successful trial of labor offers several distinct, consistently reproducible advantages compared with elective repeat cesarean delivery, including fewer hysterectomies, fewer thromboembolic events, lower blood transfusion rates, and shorter hospital stay. However, when trial of labor after cesarean fails, emergency cesarean is associated with increased uterine rupture, hysterectomy, operative injury, blood transfusion, endometritis, and longer hospital stay. Care of women with a history of previous cesarean delivery involves a confluence of interactions between medical and nonmedical factors; however, the most important determinants of the short-term outcomes among these women are likely individualized counseling, accurate clinical diagnoses, and careful management during a trial of labor. We recommend a randomized controlled trial among women undergoing a TOLAC and a longitudinal cohort study among women with previous cesarean to evaluate adverse outcomes, with focused attention on both mother and the infant.
An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem
Byrka, J.; Aardal, K.I.
2010-01-01
We obtain a 1.5-approximation algorithm for the metric uncapacitated facility location (UFL) problem, which improves on the previously best known 1.52-approximation algorithm by Mahdian, Ye, and Zhang. Note that the approximability lower bound by Guha and Khuller is 1.463 . . . . An algorithm is a (
Resonant-state expansion Born Approximation
Doost, M B
2015-01-01
The Born Approximation is a fundamental formula in Physics, it allows the calculation of weak scattering via the Fourier transform of the scattering potential. I extend the Born Approximation by including in the formula the Fourier transform of a truncated basis of the infinite number of appropriately normalised resonant states. This extension of the Born Approximation is named the Resonant-State Expansion Born Approximation or RSE Born Approximation. The resonant-states of the system can be calculated using the recently discovered RSE perturbation theory for electrodynamics and normalised correctly to appear in spectral Green's functions via the flux volume normalisation.
[Fatal amnioinfusion with previous choriocarcinoma in a parturient woman].
Hrgović, Z; Bukovic, D; Mrcela, M; Hrgović, I; Siebzehnrübl, E; Karelovic, D
2004-04-01
The case of 36-year-old tercipare is described who developed choriocharcinoma in a previous pregnancy. During the first term labour the patient developed cardiac arrest, so reanimation and sectio cesarea was performed. A male new-born was delivered in good condition, but even after intensive therapy and reanimation occurred death of parturient woman with picture of disseminate intravascular coagulopathia (DIK). On autopsy and on histology there was no sign of malignant disease, so it was not possible to connect previous choricarcinoma with amniotic fluid embolism. Maybe was place of choriocarcinoma "locus minoris resistentiae" which later resulted with failure in placentation what was hard to prove. On autopsy we found embolia of lung with a microthrombosis of terminal circulation with punctiformis bleeding in mucous, what stands for DIK.
Canonical Sets of Best L1-Approximation
Dimiter Dryanov
2012-01-01
Full Text Available In mathematics, the term approximation usually means either interpolation on a point set or approximation with respect to a given distance. There is a concept, which joins the two approaches together, and this is the concept of characterization of the best approximants via interpolation. It turns out that for some large classes of functions the best approximants with respect to a certain distance can be constructed by interpolation on a point set that does not depend on the choice of the function to be approximated. Such point sets are called canonical sets of best approximation. The present paper summarizes results on canonical sets of best L1-approximation with emphasis on multivariate interpolation and best L1-approximation by blending functions. The best L1-approximants are characterized as transfinite interpolants on canonical sets. The notion of a Haar-Chebyshev system in the multivariate case is discussed also. In this context, it is shown that some multivariate interpolation spaces share properties of univariate Haar-Chebyshev systems. We study also the problem of best one-sided multivariate L1-approximation by sums of univariate functions. Explicit constructions of best one-sided L1-approximants give rise to well-known and new inequalities.
Mapping moveout approximations in TI media
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.
An Approximate Approach to Automatic Kernel Selection.
Ding, Lizhong; Liao, Shizhong
2016-02-02
Kernel selection is a fundamental problem of kernel-based learning algorithms. In this paper, we propose an approximate approach to automatic kernel selection for regression from the perspective of kernel matrix approximation. We first introduce multilevel circulant matrices into automatic kernel selection, and develop two approximate kernel selection algorithms by exploiting the computational virtues of multilevel circulant matrices. The complexity of the proposed algorithms is quasi-linear in the number of data points. Then, we prove an approximation error bound to measure the effect of the approximation in kernel matrices by multilevel circulant matrices on the hypothesis and further show that the approximate hypothesis produced with multilevel circulant matrices converges to the accurate hypothesis produced with kernel matrices. Experimental evaluations on benchmark datasets demonstrate the effectiveness of approximate kernel selection.
On Gakerkin approximations for the quasigeostrophic equations
Rocha, Cesar B; Grooms, Ian
2015-01-01
We study the representation of approximate solutions of the three-dimensional quasigeostrophic (QG) equations using Galerkin series with standard vertical modes. In particular, we show that standard modes are compatible with nonzero buoyancy at the surfaces and can be used to solve the Eady problem. We extend two existing Galerkin approaches (A and B) and develop a new Galerkin approximation (C). Approximation A, due to Flierl (1978), represents the streamfunction as a truncated Galerkin series and defines the potential vorticity (PV) that satisfies the inversion problem exactly. Approximation B, due to Tulloch and Smith (2009b), represents the PV as a truncated Galerkin series and calculates the streamfunction that satisfies the inversion problem exactly. Approximation C, the true Galerkin approximation for the QG equations, represents both streamfunction and PV as truncated Galerkin series, but does not satisfy the inversion equation exactly. The three approximations are fundamentally different unless the b...
The long-term consequences of previous hyperthyroidism
Hjelm Brandt Kristensen, Frans
2015-01-01
of hyperthyroidism and outcome as well as sporadic control for confounding such as co-morbidity. In addition, since hyperthyroidism and various morbidities (and mortality) as well as a number of environmental risk factors are under genetic influence, a possible co-inheritance could, at least theoretically, cause......-up (>10 years) as well as control for co-morbidity and genetic confounding. The results provide a number of interesting insights into the long-term consequences of hyperthyroidism. Firstly, hyperthyroidism is associated with an approximately 30% increased all-cause mortality. The all-cause mortality does...... with CVD, LD and DM both before and after the diagnosis of hyperthyroidism. Although the design used does not allow a stringent distinction between cause and effect, the findings indicate a possible direct association between hyperthyroidism and these morbidities, or vice versa....
Approximal morphology as predictor of approximal caries in primary molar teeth
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...... 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...
Topology optimization for free vibrations using combined approximations
Bogomolny, Michael
2010-01-01
This study shows how the Combined Approximations (CA) can be used for reducing the computational effort in Topology Optimization for free vibrations. The previously developed approach is based on the integration of several concepts and methods, including matrix factorization, series expansion......, and reduced basis. In this paper the CA method is used for repeated eigenvalue analysis. Ad joint sensitivity analysis is developed such that the inaccuracies of the approximation are taken into consideration. Several 2-D and 3-D numerical examples show how optimal topology designs can be achieved...
Tight Lower Bounds on Envy-Free Makespan Approximation
Fiat, Amos
2012-01-01
In this work we give a tight lower bound on makespan approximations for envy-free allocation mechanism dedicated to scheduling tasks on unrelated machines. Specifically, we show that no mechanism exists that can guarantee an envy-free allocation of jobs to $m$ machines with a makespan of less than a factor of $O(\\log m)$ of the minimal makespan. Combined with previous results, this paper definitively proves that the optimal algorithm for obtaining a minimal makespan for any envy-free division can at best approximate the makespan to a factor of $O(\\log m)$.
Gutzwiller approximation in strongly correlated electron systems
Li, Chunhua
Gutzwiller wave function is an important theoretical technique for treating local electron-electron correlations nonperturbatively in condensed matter and materials physics. It is concerned with calculating variationally the ground state wave function by projecting out multi-occupation configurations that are energetically costly. The projection can be carried out analytically in the Gutzwiller approximation that offers an approximate way of calculating expectation values in the Gutzwiller projected wave function. This approach has proven to be very successful in strongly correlated systems such as the high temperature cuprate superconductors, the sodium cobaltates, and the heavy fermion compounds. In recent years, it has become increasingly evident that strongly correlated systems have a strong propensity towards forming inhomogeneous electronic states with spatially periodic superstrutural modulations. A good example is the commonly observed stripes and checkerboard states in high- Tc superconductors under a variety of conditions where superconductivity is weakened. There exists currently a real challenge and demand for new theoretical ideas and approaches that treats strongly correlated inhomogeneous electronic states, which is the subject matter of this thesis. This thesis contains four parts. In the first part of the thesis, the Gutzwiller approach is formulated in the grand canonical ensemble where, for the first time, a spatially (and spin) unrestricted Gutzwiller approximation (SUGA) is developed for studying inhomogeneous (both ordered and disordered) quantum electronic states in strongly correlated electron systems. The second part of the thesis applies the SUGA to the t-J model for doped Mott insulators which led to the discovery of checkerboard-like inhomogeneous electronic states competing with d-wave superconductivity, consistent with experimental observations made on several families of high-Tc superconductors. In the third part of the thesis, new
Improving biconnectivity approximation via local optimization
Ka Wong Chong; Tak Wah Lam [Univ. of Hong Kong (Hong Kong)
1996-12-31
The problem of finding the minimum biconnected spanning subgraph of an undirected graph is NP-hard. A lot of effort has been made to find biconnected spanning subgraphs that approximate to the minimum one as close as possible. Recently, new polynomial-time (sequential) approximation algorithms have been devised to improve the approximation factor from 2 to 5/3 , then 3/2, while NC algorithms have also been known to achieve 7/4 + {epsilon}. This paper presents a new technique which can be used to further improve parallel approximation factors to 5/3 + {epsilon}. In the sequential context, the technique reveals an algorithm with a factor of {alpha} + 1/5, where a is the approximation factor of any 2-edge connectivity approximation algorithm.
Frankenstein's Glue: Transition functions for approximate solutions
Yunes, N
2006-01-01
Approximations are commonly employed to find approximate solutions to the Einstein equations. These solutions, however, are usually only valid in some specific spacetime region. A global solution can be constructed by gluing approximate solutions together, but this procedure is difficult because discontinuities can arise, leading to large violations of the Einstein equations. In this paper, we provide an attempt to formalize this gluing scheme by studying transition functions that join approximate solutions together. In particular, we propose certain sufficient conditions on these functions and proof that these conditions guarantee that the joined solution still satisfies the Einstein equations to the same order as the approximate ones. An example is also provided for a binary system of non-spinning black holes, where the approximate solutions are taken to be given by a post-Newtonian expansion and a perturbed Schwarzschild solution. For this specific case, we show that if the transition functions satisfy the...
Floating-Point $L^2$-Approximations
Brisebarre, Nicolas; Hanrot, Guillaume
2007-01-01
International audience; Computing good polynomial approximations to usual functions is an important topic for the computer evaluation of those functions. These approximations can be good under several criteria, the most desirable being probably that the relative error is as small as possible in the $L^{\\infty}$ sense, i.e. everywhere on the interval under study. In the present paper, we investigate a simpler criterion, the $L^2$ case. Though finding a best polynomial $L^2$-approximation with ...
Metric Diophantine approximation on homogeneous varieties
Ghosh, Anish; Nevo, Amos
2012-01-01
We develop the metric theory of Diophantine approximation on homogeneous varieties of semisimple algebraic groups and prove results analogous to the classical Khinchin and Jarnik theorems. In full generality our results establish simultaneous Diophantine approximation with respect to several completions, and Diophantine approximation over general number fields using S-algebraic integers. In several important examples, the metric results we obtain are optimal. The proof uses quantitative equidistribution properties of suitable averaging operators, which are derived from spectral bounds in automorphic representations.
Approximately liner phase IIR digital filter banks
J. D. Ćertić; M. D. Lutovac; L. D. Milić
2013-01-01
In this paper, uniform and nonuniform digital filter banks based on approximately linear phase IIR filters and frequency response masking technique (FRM) are presented. Both filter banks are realized as a connection of an interpolated half-band approximately linear phase IIR filter as a first stage of the FRM design and an appropriate number of masking filters. The masking filters are half-band IIR filters with an approximately linear phase. The resulting IIR filter banks are compared with li...
Dynamical Vertex Approximation for the Hubbard Model
Toschi, Alessandro
A full understanding of correlated electron systems in the physically relevant situations of three and two dimensions represents a challenge for the contemporary condensed matter theory. However, in the last years considerable progress has been achieved by means of increasingly more powerful quantum many-body algorithms, applied to the basic model for correlated electrons, the Hubbard Hamiltonian. Here, I will review the physics emerging from studies performed with the dynamical vertex approximation, which includes diagrammatic corrections to the local description of the dynamical mean field theory (DMFT). In particular, I will first discuss the phase diagram in three dimensions with a special focus on the commensurate and incommensurate magnetic phases, their (quantum) critical properties, and the impact of fluctuations on electronic lifetimes and spectral functions. In two dimensions, the effects of non-local fluctuations beyond DMFT grow enormously, determining the appearance of a low-temperature insulating behavior for all values of the interaction in the unfrustrated model: Here the prototypical features of the Mott-Hubbard metal-insulator transition, as well as the existence of magnetically ordered phases, are completely overwhelmed by antiferromagnetic fluctuations of exponentially large extension, in accordance with the Mermin-Wagner theorem. Eventually, by a fluctuation diagnostics analysis of cluster DMFT self-energies, the same magnetic fluctuations are identified as responsible for the pseudogap regime in the holed-doped frustrated case, with important implications for the theoretical modeling of the cuprate physics.
A Note on Generalized Approximation Property
Antara Bhar
2013-01-01
Full Text Available We introduce a notion of generalized approximation property, which we refer to as --AP possessed by a Banach space , corresponding to an arbitrary Banach sequence space and a convex subset of , the class of bounded linear operators on . This property includes approximation property studied by Grothendieck, -approximation property considered by Sinha and Karn and Delgado et al., and also approximation property studied by Lissitsin et al. We characterize a Banach space having --AP with the help of -compact operators, -nuclear operators, and quasi--nuclear operators. A particular case for ( has also been characterized.
Upper Bounds on Numerical Approximation Errors
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....... The bounds apply to moregeneral problems than existing bounding methods do. For instance, since strict concavityis not required, linear models and piecewise linear approximations can bedealt with. Despite the generality, the bounds perform well in comparison with existingmethods even when applied...... to approximations of a standard (strictly concave)growth model.KEYWORDS: Numerical approximation errors, Bellman contractions, Error bounds...
TMB: Automatic differentiation and laplace approximation
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...... are automatically integrated out. This approximation, and its derivatives, are obtained using automatic differentiation (up to order three) of the joint likelihood. The computations are designed to be fast for problems with many random effects (approximate to 10(6)) and parameters (approximate to 10...
Relationship of deer and moose populations to previous winters' snow
Mech, L.D.; McRoberts, R.E.; Peterson, R.O.; Page, R.E.
1987-01-01
(1) Linear regression was used to relate snow accumulation during single and consecutive winters with white-tailed deer (Odocoileus virginianus) fawn:doe ratios, mosse (Alces alces) twinning rates and calf:cow ratios, and annual changes in deer and moose populations. Significant relationships were found between snow accumulation during individual winters and these dependent variables during the following year. However, the strongest relationships were between the dependent variables and the sums of the snow accumulations over the previous three winters. The percentage of the variability explained was 36 to 51. (2) Significant relationships were also found between winter vulnerability of moose calves and the sum of the snow accumulations in the current, and up to seven previous, winters, with about 49% of the variability explained. (3) No relationship was found between wolf numbers and the above dependent variables. (4) These relationships imply that winter influences on maternal nutrition can accumulate for several years and that this cumulative effect strongly determines fecundity and/or calf and fawn survivability. Although wolf (Canis lupus L.) predation is the main direct mortality agent on fawns and calves, wolf density itself appears to be secondary to winter weather in influencing the deer and moose populations.
Dolzhenko, E P; Sevast' yanov, E A [Moscow Institute of Municipal Engineering and Construction, Moscow (Russian Federation)
1999-06-30
Sign-sensitive approximations take into account not only the absolute value of the approximation error but also its sign. In the previous paper with the same title and the subtitle 'existence and uniqueness theorems' we studied the problems of existence, uniqueness and plurality for the element of best uniform approximation with a sign-sensitive weight p=(P{sub p},p{sub +}) (p{sub {+-}}(x)>=0, x element of E by some (in particular, Chebyshev) family L of bounded functions on a set E subset of R. An important role was played by the notions of rigidity and freedom of the system (p,L). Here we consider the stability of this process of approximation, that is, whether the least deviations E(p,L,f) and the best approximations l(p,L,f) by elements l element of L depend continuously on p if the variation of p is measured in the so-called d-metric. The results are applied to the theory of snakes and Hausdorff approximations of special multivalued functions.
Over 400 previously undocumented Svalbard surge-type glaciers identified
Farnsworth, Wesley R.; Ingólfsson, Ólafur; Retelle, Michael; Schomacker, Anders
2016-07-01
Identifying glaciers that exhibit surge-type behavior is important when using evidence of ice front fluctuations as a proxy for reconstructing past climate oscillations. This study identifies previously undocumented surge-type glaciers in Svalbard, based on the presence of crevasse squeeze ridges in glacier forelands. Crevasse squeeze ridges are landforms suggested to be unique to surging glacier land systems. Estimates vary greatly as to the actual percentage of surge-type glaciers in Svalbard, and consequently their distribution pattern is poorly understood. A detailed survey of recent (2008-2012), high-resolution aerial imagery from TopoSvalbard, provided by the Norwegian Polar Institute, allowed for a survey of all the glacier forelands in Svalbard. Before our study, 277 individual glaciers in Svalbard have been documented to exhibit surge behavior. By using crevasse squeeze ridges as indicators of surge behavior, we have identified 431 additional glaciers that have surged. We suggest that this is a modest value as the unique surge landforms were not visible in approximately one-third of the forelands with documented surge histories. Limits to the crevasse squeeze ridge technique are presented and potential controlling factors for crevasse squeeze ridge formation/preservation are discussed.
Cavity cooling beyond the Lamb-Dicke approximation
Blake, Tony; Beige, Almut
2011-01-01
Calculations based on the Lamb-Dicke approximation suggest that cavity cooling and ordinary laser cooling are essentially the same [see e.g. T. Blake et al., J. Mod. Opt., in press (2011)]. However, going beyond this approximation we obtain very different results. Here we show that cavity cooling can transfer particles to much lower temperatures than currently assumed, when the phonon frequency nu is comparable to or larger than the spontaneous cavity decay rate kappa. For nu << kappa, we predict much higher final phonon numbers than previous calculations. Moreover, we show that the optimal laser detuning is in both cases close to kappa. Our results should be more accurate than earlier predictions, since our calculations involve fewer approximations.
The periodic standing-wave approximation: post-Minkowski computation
Beetle, Christopher; Hernández, Napoleón; Price, Richard H
2007-01-01
The periodic standing wave method studies circular orbits of compact objects coupled to helically symmetric standing wave gravitational fields. From this solution an approximation is extracted for the strong field, slowly inspiralling motion of black holes and binary stars. Previous work on this model has dealt with nonlinear scalar models, and with linearized general relativity. Here we present the results of the method for the post-Minkowski (PM) approximation to general relativity, the first step beyond linearized gravity. We compute the PM approximation in two ways: first, via the standard approach of computing linearized gravitational fields and constructing from them quadratic driving sources for second-order fields, and second, by solving the second-order equations as an ``exact'' nonlinear system. The results of these computations have two distinct applications: (i) The computational infrastructure for the ``exact'' PM solution will be directly applicable to full general relativity. (ii) The results w...
Natural orbit approximations in single power-law potentials
Struck, Curtis
2014-01-01
In a previous paper, I demonstrated the accuracy of simple, precessing, power ellipse (p-ellipse) approximations to orbits of low-to-moderate eccentricity in power-law potentials. Here I explore several extensions of these approximations to improve accuracy, especially for nearly radial orbits. 1) It is found that moderately improved orbital fits can be achieved with higher order perturbation expansions (in eccentricity), with the addition of `harmonic' terms to the solution. 2) Alternately, a matching of the extreme radial excursions of an orbit can be imposed, and a more accurate estimate of the eccentricity parameter is obtained. However, the error in the precession frequency is usually increased. 3) A correction function of small magnitude corrects the frequency problem. With this correction, even first order approximations yield excellent fits at quite high eccentricity over a range of potential indices that includes flat and falling rotation curve cases. 4) Adding a first harmonic term to fit the breadt...
Non-perturbative QCD amplitudes in quenched and eikonal approximations
Fried, H.M. [Physics Department, Brown University, Providence, RI 02912 (United States); Grandou, T., E-mail: Thierry.Grandou@inln.cnrs.fr [Université de Nice-Sophia Antipolis, Institut Non Linéaire de Nice, UMR 6618 CNRS 7335, 1361 routes des Lucioles, 06560 Valbonne (France); Sheu, Y.-M., E-mail: ymsheu@alumni.brown.edu [Université de Nice-Sophia Antipolis, Institut Non Linéaire de Nice, UMR 6618 CNRS 7335, 1361 routes des Lucioles, 06560 Valbonne (France)
2014-05-15
Even though approximated, strong coupling non-perturbative QCD amplitudes remain very difficult to obtain. In this article, in eikonal and quenched approximations at least, physical insights are presented that rely on the newly-discovered property of effective locality. The present article also provides a more rigorous mathematical basis for the crude approximations used in the previous derivation of the binding potential of quarks and nucleons. Furthermore, the techniques of Random Matrix calculus along with Meijer G-functions are applied to analyze the generic structure of fermionic amplitudes in QCD. - Highlights: • We discuss the physical insight of effective locality to QCD fermionic amplitudes. • We show that an unavoidable delta function goes along with the effective locality property. • The generic structure of QCD fermion amplitudes is obtained through Random Matrix calculus.
Central Diabetes Insipidus: A Previously Unreported Side Effect of Temozolomide
Nachtigall, Lisa; Wexler, Deborah; Miller, Karen K.; Klibanski, Anne; Makimura, Hideo
2013-01-01
Context: Temozolomide (TMZ) is an alkylating agent primarily used to treat tumors of the central nervous system. We describe 2 patients with apparent TMZ-induced central diabetes insipidus. Using our institution's Research Patient Database Registry, we identified 3 additional potential cases of TMZ-induced diabetes insipidus among a group of 1545 patients treated with TMZ. Case Presentations: A 53-year-old male with an oligoastrocytoma and a 38-year-old male with an oligodendroglioma each developed symptoms of polydipsia and polyuria approximately 2 months after the initiation of TMZ. Laboratory analyses demonstrated hypernatremia and urinary concentrating defects, consistent with the presence of diabetes insipidus, and the patients were successfully treated with desmopressin acetate. Desmopressin acetate was withdrawn after the discontinuation of TMZ, and diabetes insipidus did not recur. Magnetic resonance imaging of the pituitary and hypothalamus was unremarkable apart from the absence of a posterior pituitary bright spot in both of the cases. Anterior pituitary function tests were normal in both cases. Using the Research Patient Database Registry database, we identified the 2 index cases and 3 additional potential cases of diabetes insipidus for an estimated prevalence of 0.3% (5 cases of diabetes insipidus per 1545 patients prescribed TMZ). Conclusions: Central diabetes insipidus is a rare but reversible side effect of treatment with TMZ. PMID:23928668
Central diabetes insipidus: a previously unreported side effect of temozolomide.
Faje, Alexander T; Nachtigall, Lisa; Wexler, Deborah; Miller, Karen K; Klibanski, Anne; Makimura, Hideo
2013-10-01
Temozolomide (TMZ) is an alkylating agent primarily used to treat tumors of the central nervous system. We describe 2 patients with apparent TMZ-induced central diabetes insipidus. Using our institution's Research Patient Database Registry, we identified 3 additional potential cases of TMZ-induced diabetes insipidus among a group of 1545 patients treated with TMZ. A 53-year-old male with an oligoastrocytoma and a 38-year-old male with an oligodendroglioma each developed symptoms of polydipsia and polyuria approximately 2 months after the initiation of TMZ. Laboratory analyses demonstrated hypernatremia and urinary concentrating defects, consistent with the presence of diabetes insipidus, and the patients were successfully treated with desmopressin acetate. Desmopressin acetate was withdrawn after the discontinuation of TMZ, and diabetes insipidus did not recur. Magnetic resonance imaging of the pituitary and hypothalamus was unremarkable apart from the absence of a posterior pituitary bright spot in both of the cases. Anterior pituitary function tests were normal in both cases. Using the Research Patient Database Registry database, we identified the 2 index cases and 3 additional potential cases of diabetes insipidus for an estimated prevalence of 0.3% (5 cases of diabetes insipidus per 1545 patients prescribed TMZ). Central diabetes insipidus is a rare but reversible side effect of treatment with TMZ.
Inversion and approximation of Laplace transforms
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.
Computing Functions by Approximating the Input
Goldberg, Mayer
2012-01-01
In computing real-valued functions, it is ordinarily assumed that the input to the function is known, and it is the output that we need to approximate. In this work, we take the opposite approach: we show how to compute the values of some transcendental functions by approximating the input to these functions, and obtaining exact answers for their…
Non-Linear Approximation of Bayesian Update
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.
Random Attractors of Stochastic Modified Boussinesq Approximation
郭春晓
2011-01-01
The Boussinesq approximation is a reasonable model to describe processes in body interior in planetary physics. We refer to [1] and [2] for a derivation of the Boussinesq approximation, and [3] for some related results of existence and uniqueness of solution.
Approximating a harmonizable isotropic random field
Randall J. Swift
2001-01-01
Full Text Available The class of harmonizable fields is a natural extension of the class of stationary fields. This paper considers a stochastic series approximation of a harmonizable isotropic random field. This approximation is useful for numerical simulation of such a field.
On approximating multi-criteria TSP
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 app
Regression with Sparse Approximations of Data
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...
A case where BO Approximation breaks down
无
2007-01-01
@@ The Bom-Oppenheimer (BO)Approximation is ubiquitous in molecular physics,quantum physics and quantum chemistry. However, CAS researchers recently observed a breakdown of the Approximation in the reaction of fluorine with deuterium atoms.The result has been published in the August 24 issue of Science.
Two Point Pade Approximants and Duality
Banks, Tom
2013-01-01
We propose the use of two point Pade approximants to find expressions valid uniformly in coupling constant for theories with both weak and strong coupling expansions. In particular, one can use these approximants in models with a strong/weak duality, when the symmetries do not determine exact expressions for some quantity.
Function Approximation Using Probabilistic Fuzzy Systems
J.H. van den Berg (Jan); U. Kaymak (Uzay); R.J. Almeida e Santos Nogueira (Rui Jorge)
2011-01-01
textabstractWe consider function approximation by fuzzy systems. Fuzzy systems are typically used for approximating deterministic functions, in which the stochastic uncertainty is ignored. We propose probabilistic fuzzy systems in which the probabilistic nature of uncertainty is taken into account.
Approximation of the Inverse -Frame Operator
M R Abdollahpour; A Najati
2011-05-01
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 like using finite-dimensional linear algebra.
Nonlinear approximation with dictionaries I. Direct estimates
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...
Approximations for stop-loss reinsurance premiums
Reijnen, Rajko; Albers, Willem/Wim; Kallenberg, W.C.M.
2005-01-01
Various approximations of stop-loss reinsurance premiums are described in literature. For a wide variety of claim size distributions and retention levels, such approximations are compared in this paper to each other, as well as to a quantitative criterion. For the aggregate claims two models are use
Quirks of Stirling's Approximation
Macrae, Roderick M.; Allgeier, Benjamin M.
2013-01-01
Stirling's approximation to ln "n"! is typically introduced to physical chemistry students as a step in the derivation of the statistical expression for the entropy. However, naive application of this approximation leads to incorrect conclusions. In this article, the problem is first illustrated using a familiar "toy…
INVARIANT RANDOM APPROXIMATION IN NONCONVEX DOMAIN
R. Shrivastava
2012-05-01
Full Text Available Random fixed point results in the setup of compact and weakly compact domain of Banach spaces which is not necessary starshaped have been obtained in the present work. Invariant random approximation results have also been determined asits application. In this way, random version of invariant approximation results due toMukherjee and Som [13] and Singh [17] have been given.
Approximability and Parameterized Complexity of Minmax Values
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...
Hardness of approximation for strip packing
Adamaszek, Anna Maria; Kociumaka, Tomasz; Pilipczuk, Marcin
2017-01-01
[SODA 2016] have recently proposed a (1.4 + ϵ)-approximation algorithm for this variant, thus showing that strip packing with polynomially bounded data can be approximated better than when exponentially large values are allowed in the input. Their result has subsequently been improved to a (4/3 + ϵ...
Approximations for stop-loss reinsurance premiums
Reijnen, Rajko; Albers, Willem; Kallenberg, Wilbert C.M.
2005-01-01
Various approximations of stop-loss reinsurance premiums are described in literature. For a wide variety of claim size distributions and retention levels, such approximations are compared in this paper to each other, as well as to a quantitative criterion. For the aggregate claims two models are use
Approximations for stop-loss reinsurance premiums
Reijnen, R.; Albers, W.; Kallenberg, W.C.M.
2003-01-01
Various approximations of stop-loss reinsurance premiums are described in literature. For a wide variety of claim size distributions and retention levels, such approximations are compared in this paper to each other, as well as to a quantitative criterion. For the aggregate claims two models are use
Lifetime of the Nonlinear Geometric Optics Approximation
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....
Simple Lie groups without the approximation property
Haagerup, Uffe; de Laat, Tim
2013-01-01
For a locally compact group G, let A(G) denote its Fourier algebra, and let M0A(G) denote the space of completely bounded Fourier multipliers on G. The group G is said to have the Approximation Property (AP) if the constant function 1 can be approximated by a net in A(G) in the weak-∗ topology...
An improved proximity force approximation for electrostatics
Fosco, C D; Mazzitelli, F D
2012-01-01
A quite straightforward approximation for the electrostatic interaction between two perfectly conducting surfaces suggests itself when the distance between them is much smaller than the characteristic lengths associated to their shapes. Indeed, in the so called "proximity force approximation" the electrostatic force is evaluated by first dividing each surface into a set of small flat patches, and then adding up the forces due two opposite pairs, the contribution of which are approximated as due to pairs of parallel planes. This approximation has been widely and successfully applied to different contexts, ranging from nuclear physics to Casimir effect calculations. We present here an improvement on this approximation, based on a derivative expansion for the electrostatic energy contained between the surfaces. The results obtained could be useful to discuss the geometric dependence of the electrostatic force, and also as a convenient benchmark for numerical analyses of the tip-sample electrostatic interaction i...
Approximate Furthest Neighbor in High Dimensions
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......-dimensional Euclidean space. We build on the technique of Indyk (SODA 2003), storing random projections to provide sublinear query time for AFN. However, we introduce a different query algorithm, improving on Indyk’s approximation factor and reducing the running time by a logarithmic factor. We also present a variation...
Trajectory averaging for stochastic approximation MCMC algorithms
Liang, Faming
2010-01-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 approximation MCMC algorithms, for example, a stochastic approximation MLE al...
Approximating maximum clique with a Hopfield network.
Jagota, A
1995-01-01
In a graph, a clique is a set of vertices such that every pair is connected by an edge. MAX-CLIQUE is the optimization problem of finding the largest clique in a given graph and is NP-hard, even to approximate well. Several real-world and theory problems can be modeled as MAX-CLIQUE. In this paper, we efficiently approximate MAX-CLIQUE in a special case of the Hopfield network whose stable states are maximal cliques. We present several energy-descent optimizing dynamics; both discrete (deterministic and stochastic) and continuous. One of these emulates, as special cases, two well-known greedy algorithms for approximating MAX-CLIQUE. We report on detailed empirical comparisons on random graphs and on harder ones. Mean-field annealing, an efficient approximation to simulated annealing, and a stochastic dynamics are the narrow but clear winners. All dynamics approximate much better than one which emulates a "naive" greedy heuristic.
A systematic sequence of relativistic approximations.
Dyall, Kenneth G
2002-06-01
An approach to the development of a systematic sequence of relativistic approximations is reviewed. The approach depends on the atomically localized nature of relativistic effects, and is based on the normalized elimination of the small component in the matrix modified Dirac equation. Errors in the approximations are assessed relative to four-component Dirac-Hartree-Fock calculations or other reference points. Projection onto the positive energy states of the isolated atoms provides an approximation in which the energy-dependent parts of the matrices can be evaluated in separate atomic calculations and implemented in terms of two sets of contraction coefficients. The errors in this approximation are extremely small, of the order of 0.001 pm in bond lengths and tens of microhartrees in absolute energies. From this approximation it is possible to partition the atoms into relativistic and nonrelativistic groups and to treat the latter with the standard operators of nonrelativistic quantum mechanics. This partitioning is shared with the relativistic effective core potential approximation. For atoms in the second period, errors in the approximation are of the order of a few hundredths of a picometer in bond lengths and less than 1 kJ mol(-1) in dissociation energies; for atoms in the third period, errors are a few tenths of a picometer and a few kilojoule/mole, respectively. A third approximation for scalar relativistic effects replaces the relativistic two-electron integrals with the nonrelativistic integrals evaluated with the atomic Foldy-Wouthuysen coefficients as contraction coefficients. It is similar to the Douglas-Kroll-Hess approximation, and is accurate to about 0.1 pm and a few tenths of a kilojoule/mole. The integrals in all the approximations are no more complicated than the integrals in the full relativistic methods, and their derivatives are correspondingly easy to formulate and evaluate.
High-Grade Leiomyosarcoma Arising in a Previously Replanted Limb
Tiffany J. Pan
2015-01-01
Full Text Available Sarcoma development has been associated with genetics, irradiation, viral infections, and immunodeficiency. Reports of sarcomas arising in the setting of prior trauma, as in burn scars or fracture sites, are rare. We report a case of a leiomyosarcoma arising in an arm that had previously been replanted at the level of the elbow joint following traumatic amputation when the patient was eight years old. He presented twenty-four years later with a 10.8 cm mass in the replanted arm located on the volar forearm. The tumor was completely resected and pathology examination showed a high-grade, subfascial spindle cell sarcoma diagnosed as a grade 3 leiomyosarcoma with stage pT2bNxMx. The patient underwent treatment with brachytherapy, reconstruction with a free flap, and subsequently chemotherapy. To the best of our knowledge, this is the first case report of leiomyosarcoma developing in a replanted extremity. Development of leiomyosarcoma in this case could be related to revascularization, scar formation, or chronic injury after replantation. The patient remains healthy without signs of recurrence at three-year follow-up.
Yoo, J.; Shin, H. S.; Song, T. Y.; Park, W. S. [Korea Atomic Energy Research Institute, Taejon (Korea, Republic of)
1997-12-31
Previous our numerical results in computing point kinetics equations show a possibility in developing approximations to estimate sensitivity responses of nuclear reactor. We recalculate sensitivity responses by maintaining the corrections with first order of sensitivity parameter. We present a method for computing sensitivity responses of nuclear reactor based on an approximation derived from point kinetics equations. Exploiting this approximation, we found that the first order approximation works to estimate variations in the time to reach peak power because of their linear dependence on a sensitivity parameter, and that there are errors in estimating the peak power in the first order approximation for larger sensitivity parameters. To confirm legitimacy of out approximation, these approximate results are compared with exact results obtained from out previous numerical study. 4 refs., 2 figs., 3 tabs. (Author)
Dissociation between exact and approximate addition in developmental dyslexia.
Yang, Xiujie; Meng, Xiangzhi
2016-09-01
Previous research has suggested that number sense and language are involved in number representation and calculation, in which number sense supports approximate arithmetic, and language permits exact enumeration and calculation. Meanwhile, individuals with dyslexia have a core deficit in phonological processing. Based on these findings, we thus hypothesized that children with dyslexia may exhibit exact calculation impairment while doing mental arithmetic. The reaction time and accuracy while doing exact and approximate addition with symbolic Arabic digits and non-symbolic visual arrays of dots were compared between typically developing children and children with dyslexia. Reaction time analyses did not reveal any differences across two groups of children, the accuracies, interestingly, revealed a distinction of approximation and exact addition across two groups of children. Specifically, two groups of children had no differences in approximation. Children with dyslexia, however, had significantly lower accuracy in exact addition in both symbolic and non-symbolic tasks than that of typically developing children. Moreover, linguistic performances were selectively associated with exact calculation across individuals. These results suggested that children with dyslexia have a mental arithmetic deficit specifically in the realm of exact calculation, while their approximation ability is relatively intact.
NONLINEAR MULTIGRID SOLVER EXPLOITING AMGe COARSE SPACES WITH APPROXIMATION PROPERTIES
Christensen, Max La Cour [Technical Univ. of Denmark, Lyngby (Denmark); Villa, Umberto E. [Univ. of Texas, Austin, TX (United States); Engsig-Karup, Allan P. [Technical Univ. of Denmark, Lyngby (Denmark); Vassilevski, Panayot S. [Lawrence Livermore National Lab. (LLNL), Livermore, CA (United States)
2016-01-22
The paper introduces a nonlinear multigrid solver for mixed nite element discretizations based on the Full Approximation Scheme (FAS) and element-based Algebraic Multigrid (AMGe). The main motivation to use FAS for unstruc- tured problems is the guaranteed approximation property of the AMGe coarse spaces that were developed recently at Lawrence Livermore National Laboratory. These give the ability to derive stable and accurate coarse nonlinear discretization problems. The previous attempts (including ones with the original AMGe method, [5, 11]), were less successful due to lack of such good approximation properties of the coarse spaces. With coarse spaces with approximation properties, our FAS approach on un- structured meshes should be as powerful/successful as FAS on geometrically re ned meshes. For comparison, Newton's method and Picard iterations with an inner state-of-the-art linear solver is compared to FAS on a nonlinear saddle point problem with applications to porous media ow. It is demonstrated that FAS is faster than Newton's method and Picard iterations for the experiments considered here. Due to the guaranteed approximation properties of our AMGe, the coarse spaces are very accurate, providing a solver with the potential for mesh-independent convergence on general unstructured meshes.
An optimized semiclassical approximation for vibrational response functions
Gerace, Mallory; Loring, Roger F.
2013-03-01
The observables of multidimensional infrared spectroscopy may be calculated from nonlinear vibrational response functions. Fully quantum dynamical calculations of vibrational response functions are generally impractical, while completely classical calculations are qualitatively incorrect at long times. These challenges motivate the development of semiclassical approximations to quantum mechanics, which use classical mechanical information to reconstruct quantum effects. The mean-trajectory (MT) approximation is a semiclassical approach to quantum vibrational response functions employing classical trajectories linked by deterministic transitions representing the effects of the radiation-matter interaction. Previous application of the MT approximation to the third-order response function R(3)(t3, t2, t1) demonstrated that the method quantitatively describes the coherence dynamics of the t3 and t1 evolution times, but is qualitatively incorrect for the waiting-time t2 period. Here we develop an optimized version of the MT approximation by elucidating the connection between this semiclassical approach and the double-sided Feynman diagrams (2FD) that represent the quantum response. Establishing the direct connection between 2FD and semiclassical paths motivates a systematic derivation of an optimized MT approximation (OMT). The OMT uses classical mechanical inputs to accurately reproduce quantum dynamics associated with all three propagation times of the third-order vibrational response function.
Uniform and Pointwise Shape Preserving Approximation by Algebraic Polynomials
Kopotun, K A; Prymak, A; Shevchuk, I A
2011-01-01
We survey developments, over the last thirty years, in the theory of Shape Preserving Approximation (SPA) by algebraic polynomials on a finite interval. In this article, "shape" refers to (finitely many changes of) monotonicity, convexity, or q-monotonicity of a function (for definition, see Section 4). It is rather well known that it is possible to approximate a function by algebraic polynomials that preserve its shape (i.e., the Weierstrass approximation theorem is valid for SPA). At the same time, the degree of SPA is much worse than the degree of best unconstrained approximation in some cases, and it is "about the same" in others. Numerous results quantifying this difference in degrees of SPA and unconstrained approximation have been obtained in recent years, and the main purpose of this article is to provide a "bird's-eye view" on this area, and discuss various approaches used. In particular, we present results on the validity and invalidity of uniform and pointwise estimates in terms of various moduli o...
Frankenstein's glue: transition functions for approximate solutions
Yunes, Nicolás
2007-09-01
Approximations are commonly employed to find approximate solutions to the Einstein equations. These solutions, however, are usually only valid in some specific spacetime region. A global solution can be constructed by gluing approximate solutions together, but this procedure is difficult because discontinuities can arise, leading to large violations of the Einstein equations. In this paper, we provide an attempt to formalize this gluing scheme by studying transition functions that join approximate analytic solutions together. In particular, we propose certain sufficient conditions on these functions and prove that these conditions guarantee that the joined solution still satisfies the Einstein equations analytically to the same order as the approximate ones. An example is also provided for a binary system of non-spinning black holes, where the approximate solutions are taken to be given by a post-Newtonian expansion and a perturbed Schwarzschild solution. For this specific case, we show that if the transition functions satisfy the proposed conditions, then the joined solution does not contain any violations to the Einstein equations larger than those already inherent in the approximations. We further show that if these functions violate the proposed conditions, then the matter content of the spacetime is modified by the introduction of a matter shell, whose stress energy tensor depends on derivatives of these functions.
Entanglement in the Born-Oppenheimer Approximation
Izmaylov, Artur F
2016-01-01
The role of electron-nuclear entanglement on the validity of the Born-Oppenheimer (BO) approximation is investigated. While nonadiabatic couplings generally lead to entanglement and to a failure of the BO approximation, surprisingly the degree of electron-nuclear entanglement is found to be uncorrelated with the degree of validity of the BO approximation. This is because while the degree of entanglement of BO states is determined by their deviation from the corresponding states in the crude BO approximation, the accuracy of the BO approximation is dictated, instead, by the deviation of the BO states from the exact electron-nuclear states. In fact, in the context of a minimal avoided crossing model, extreme cases are identified where an adequate BO state is seen to be maximally entangled, and where the BO approximation fails but the associated BO state remains approximately unentangled. Further, the BO states are found to not preserve the entanglement properties of the exact electron-nuclear eigenstates, and t...
DIFFERENCE SCHEMES BASING ON COEFFICIENT APPROXIMATION
MOU Zong-ze; LONG Yong-xing; QU Wen-xiao
2005-01-01
In respect of variable coefficient differential equations, the equations of coefficient function approximation were more accurate than the coefficient to be frozen as a constant in every discrete subinterval. Usually, the difference schemes constructed based on Taylor expansion approximation of the solution do not suit the solution with sharp function.Introducing into local bases to be combined with coefficient function approximation, the difference can well depict more complex physical phenomena, for example, boundary layer as well as high oscillatory, with sharp behavior. The numerical test shows the method is more effective than the traditional one.
Approximate equivalence in von Neumann algebras
DING; Huiru; Don; Hadwin
2005-01-01
One formulation of D. Voiculescu's theorem on approximate unitary equivalence is that two unital representations π and ρ of a separable C*-algebra are approximately unitarily equivalent if and only if rank o π = rank o ρ. We study the analog when the ranges of π and ρ are contained in a von Neumann algebra R, the unitaries inducing the approximate equivalence must come from R, and "rank" is replaced with "R-rank" (defined as the Murray-von Neumann equivalence of the range projection).
Approximation of free-discontinuity problems
Braides, Andrea
1998-01-01
Functionals involving both volume and surface energies have a number of applications ranging from Computer Vision to Fracture Mechanics. In order to tackle numerical and dynamical problems linked to such functionals many approximations by functionals defined on smooth functions have been proposed (using high-order singular perturbations, finite-difference or non-local energies, etc.) The purpose of this book is to present a global approach to these approximations using the theory of gamma-convergence and of special functions of bounded variation. The book is directed to PhD students and researchers in calculus of variations, interested in approximation problems with possible applications.
Mathematical analysis, approximation theory and their applications
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.
Regression with Sparse Approximations of Data
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 a sparse approximation of the point in terms of the regressors. We show SPARROW can be considered a variant of \\(k\\)-nearest neighbors regression (\\(k\\)-NNR), and more generally, local polynomial kernel regression. Unlike \\(k\\)-NNR, however, SPARROW can adapt the number of regressors to use based...
Orthorhombic rational approximants for decagonal quasicrystals
S Ranganathan; Anandh Subramaniam
2003-10-01
An important exercise in the study of rational approximants is to derive their metric, especially in relation to the corresponding quasicrystal or the underlying clusters. Kuo’s model has been the widely accepted model to calculate the metric of the decagonal approximants. Using an alternate model, the metric of the approximants and other complex structures with the icosahedral cluster are explained elsewhere. In this work a comparison is made between the two models bringing out their equivalence. Further, using the concept of average lattices, a modified model is proposed.
Approximation of the semi-infinite interval
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.
Melanoma diagnosed in lesions previously treated by laser therapy.
Delker, Sarah; Livingstone, Elisabeth; Schimming, Tobias; Schadendorf, Dirk; Griewank, Klaus G
2017-01-01
Laser therapy has become a routine procedure in dermatological practice and is frequently also used for pigmented lesions. Few reports exist of melanomas diagnosed in lesions previously treated by laser therapy. Between 2007 and 2014, we identified 11 patients who presented to our department with a melanoma diagnosed in a region previously treated by laser therapy. The course of events until the diagnosis of melanoma was assessed as well as patient outcome including treatment for disease progression. No histological assessment had been performed prior to laser therapy in nine of 11 (82%) cases. Benign melanocytic lesions had been diagnosed by biopsy prior to laser therapy in the other two cases. Time from laser therapy to diagnosis of melanoma ranged from less than 1 to 10 years. Stage of disease at diagnosis varied from stage IA to IIIC. Four patients progressed to stage IV disease, of whom at least one died of melanoma. We conclude that laser treatment of pigmented lesions can complicate the diagnosis of melanoma and lead to diagnosis delay with potentially fatal consequences. Considering this risk, we believe laser therapy for pigmented lesions should either be avoided entirely or at a minimum performed only after prior histological assessment. © 2016 Japanese Dermatological Association.
Trigonometric Approximations for Some Bessel Functions
Muhammad Taher Abuelma'atti
1999-01-01
Formulas are obtained for approximating the tabulated Bessel functions Jn(x), n = 0–9 in terms of trigonometric functions. These formulas can be easily integrated and differentiated and are convenient for personal computers and pocket calculators.
Low Rank Approximation Algorithms, Implementation, Applications
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; ...
An approximate Expression for Viscosity of Nanosuspensions
Domostroeva, N G
2009-01-01
We consider liquid suspensions with dispersed nanoparticles. Using two-points Pade approximants and combining results of both hydrodynamic and molecular dynamics methods, we obtain the effective viscosity for any diameters of nanoparticles
Staying thermal with Hartree ensemble approximations
Salle, Mischa E-mail: msalle@science.uva.nl; Smit, Jan E-mail: jsmit@science.uva.nl; Vink, Jeroen C. E-mail: jcvink@science.uva.nl
2002-03-25
We study thermal behavior of a recently introduced Hartree ensemble approximation, which allows for non-perturbative inhomogeneous field configurations as well as for approximate thermalization, in the phi (cursive,open) Greek{sup 4} model in 1+1 dimensions. Using ensembles with a free field thermal distribution as out-of-equilibrium initial conditions we determine thermalization time scales. The time scale for which the system stays in approximate quantum thermal equilibrium is an indication of the time scales for which the approximation method stays reasonable. This time scale turns out to be two orders of magnitude larger than the time scale for thermalization, in the range of couplings and temperatures studied. We also discuss simplifications of our method which are numerically more efficient and make a comparison with classical dynamics.
Approximations of solutions to retarded integrodifferential equations
Dhirendra Bahuguna
2004-11-01
Full Text Available In this paper we consider a retarded integrodifferential equation and prove existence, uniqueness and convergence of approximate solutions. We also give some examples to illustrate the applications of the abstract results.
Approximation methods in gravitational-radiation theory
Will, C. M.
1986-02-01
The observation of gravitational-radiation damping in the binary pulsar PSR 1913+16 and the ongoing experimental search for gravitational waves of extraterrestrial origin have made the theory of gravitational radiation an active branch of classical general relativity. In calculations of gravitational radiation, approximation methods play a crucial role. The author summarizes recent developments in two areas in which approximations are important: (1) the quadrupole approximation, which determines the energy flux and the radiation reaction forces in weak-field, slow-motion, source-within-the-near-zone systems such as the binary pulsar; and (2) the normal modes of oscillation of black holes, where the Wentzel-Kramers-Brillouin approximation gives accurate estimates of the complex frequencies of the modes.
APPROXIMATE DEVELOPMENTS FOR SURFACES OF REVOLUTION
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
Methods of Fourier analysis and approximation theory
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.
Seismic wave extrapolation using lowrank symbol approximation
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.
Approximate Flavor Symmetry in Supersymmetric Model
Tao, Zhijian
1998-01-01
We investigate the maximal approximate flavor symmetry in the framework of generic minimal supersymmetric standard model. We consider the low energy effective theory of the flavor physics with all the possible operators included. Spontaneous flavor symmetry breaking leads to the approximate flavor symmetry in Yukawa sector and the supersymmetry breaking sector. Fermion mass and mixing hierachies are the results of the hierachy of the flavor symmetry breaking. It is found that in this theory i...
Pointwise approximation by elementary complete contractions
Magajna, Bojan
2009-01-01
A complete contraction on a C*-algebra A, which preserves all closed two sided ideals J, can be approximated pointwise by elementary complete contractions if and only if the induced map on the tensor product of B with A/J is contractive for every C*-algebra B, ideal J in A and C*-tensor norm on the tensor product. A lifting obstruction for such an approximation is also obtained.
Polynomial approximation of functions in Sobolev spaces
Dupont, T.; Scott, R.
1980-01-01
Constructive proofs and several generalizations of approximation results of J. H. Bramble and S. R. Hilbert are presented. Using an averaged Taylor series, we represent a function as a polynomial plus a remainder. The remainder can be manipulated in many ways to give different types of bounds. Approximation of functions in fractional order Sobolev spaces is treated as well as the usual integer order spaces and several nonstandard Sobolev-like spaces.
Parallel local approximation MCMC for expensive models
Conrad, Patrick; Davis, Andrew; Marzouk, Youssef; Pillai, Natesh; Smith, Aaron
2016-01-01
Performing Bayesian inference via Markov chain Monte Carlo (MCMC) can be exceedingly expensive when posterior evaluations invoke the evaluation of a computationally expensive model, such as a system of partial differential equations. In recent work [Conrad et al. JASA 2015, arXiv:1402.1694] we described a framework for constructing and refining local approximations of such models during an MCMC simulation. These posterior--adapted approximations harness regularity of the model to reduce the c...
The Actinide Transition Revisited by Gutzwiller Approximation
Xu, Wenhu; Lanata, Nicola; Yao, Yongxin; Kotliar, Gabriel
2015-03-01
We revisit the problem of the actinide transition using the Gutzwiller approximation (GA) in combination with the local density approximation (LDA). In particular, we compute the equilibrium volumes of the actinide series and reproduce the abrupt change of density found experimentally near plutonium as a function of the atomic number. We discuss how this behavior relates with the electron correlations in the 5 f states, the lattice structure, and the spin-orbit interaction. Our results are in good agreement with the experiments.
Intuitionistic Fuzzy Automaton for Approximate String Matching
K.M. Ravi
2014-03-01
Full Text Available This paper introduces an intuitionistic fuzzy automaton model for computing the similarity between pairs of strings. The model details the possible edit operations needed to transform any input (observed string into a target (pattern string by providing a membership and non-membership value between them. In the end, an algorithm is given for approximate string matching and the proposed model computes the similarity and dissimilarity between the pair of strings leading to better approximation.
Approximations for the Erlang Loss Function
Mejlbro, Leif
1998-01-01
Theoretically, at least three formulae are needed for arbitrarily good approximates of the Erlang Loss Function. In the paper, for convenience five formulae are presented guaranteeing a relative error <1E-2, and methods are indicated for improving this bound.......Theoretically, at least three formulae are needed for arbitrarily good approximates of the Erlang Loss Function. In the paper, for convenience five formulae are presented guaranteeing a relative error
Lattice quantum chromodynamics with approximately chiral fermions
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.)
Nonlinear approximation in alpha-modulation spaces
Borup, Lasse; Nielsen, Morten
2006-01-01
The α-modulation spaces are a family of spaces that contain the Besov and modulation spaces as special cases. In this paper we prove that brushlet bases can be constructed to form unconditional and even greedy bases for the α-modulation spaces. We study m -term nonlinear approximation with brushlet...... bases, and give complete characterizations of the associated approximation spaces in terms of α-modulation spaces....
On surface approximation using developable surfaces
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....
On surface approximation using developable surfaces
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....
Differential geometry of proteins. Helical approximations.
Louie, A H; Somorjai, R L
1983-07-25
We regard a protein molecule as a geometric object, and in a first approximation represent it as a regular parametrized space curve passing through its alpha-carbon atoms (the backbone). In an earlier paper we argued that the regular patterns of secondary structures of proteins (morphons) correspond to geodesics on minimal surfaces. In this paper we discuss methods of recognizing these morphons on space curves that represent the protein backbone conformation. The mathematical tool we employ is the differential geometry of curves and surfaces. We introduce a natural approximation of backbone space curves in terms of helical approximating elements and present a computer algorithm to implement the approximation. Simple recognition criteria are given for the various morphons of proteins. These are incorporated into our helical approximation algorithm, together with more non-local criteria for the recognition of beta-sheet topologies. The method and the algorithm are illustrated with several examples of representative proteins. Generalizations of the helical approximation method are considered and their possible implications for protein energetics are sketched.
Clinical Analysis of Placenta Previa Complicated with Previous Caesarean Section
Liang-kun Ma; Na Han; Jian-qiu Yang; Xu-ming Bian; Jun-tao Liu
2012-01-01
Objective To investigate the clinical features and treatment of placenta previa complicated with previous caesarean section.Methods The clinical data of 29 patients with placenta previa complicated with a previous caesarean section (RCS group) admitted in Peking Union Medical College Hospital during a period from 2003 to 2011 were retrospectively reviewed and compared with those of 243 patients with placenta previa without a previous caesarean section (FCS group) during the same period.Results There was no difference in the mean age (28.9±3.6 vs.28.1±4.5 years) and the average gravidity (2.35 ± 1.48 vs.2.21 ± 1.53) between RCS group and FCS group (all P＞0.05).The RCS group had more preterm births (24.1％ vs.13.2％),complete placenta previa (55.2％ vs.4.9％),placenta accreta (34.5％ vs.2.5％),more blood loss during caesarean section (1412±602 vs.648 ±265 mL),blood transfusion (51.7％ vs.4.9％),disseminated intravascular coagulation (13.8％ vs.2.1％),and obstetric hysterectomy ( 13.8 ％ vs.0.8 ％) than the F C S group (all P＜ 0.05).The preterm infant rate ( 30.0％ vs.13.0％),neonatal asphyxia rate (10.0％ vs.4.9％),and perinatal mortality rate (6.7％ vs.0.4％) of the RCS group were higher than those of the FCS group (all P＜0.05).Conclusions More patients had complete placenta previa and placenta accreta,postpartum hemorrhage,transfusion,uterine packing,obstetric hysterectomy,and perinatal morbidity in the placenta previa patients with previous caesarean section.The patient should be informed of the risk and unnecessary first cesarean sections should be avoided.
Exact and approximation algorithms for DNA tag set design.
Măndoiu, Ion I; Trincă, Dragoş
2006-04-01
In this paper, we propose new solution methods for designing tag sets for use in universal DNA arrays. First, we give integer linear programming formulations for two previous formalizations of the tag set design problem. We show that these formulations can be solved to optimality for problem instances of moderate size by using general purpose optimization packages and also give more scalable algorithms based on an approximation scheme for packing linear programs. Second, we note the benefits of periodic tags and establish an interesting connection between the tag design problem and the problem of packing the maximum number of vertex-disjoint directed cycles in a given graph. We show that combining a simple greedy cycle packing algorithm with a previously proposed alphabetic tree search strategy yields an increase of over 40% in the number of tags compared to previous methods.
Sadegh, Payman
1997-01-01
This paper deals with a projection algorithm for stochastic approximation using simultaneous perturbation gradient approximation for optimization under inequality constraints where no direct gradient of the loss function is available and the inequality constraints are given as explicit functions...
Ito, K.
1984-01-01
The stability and convergence properties of the Legendre-tau approximation for hereditary differential systems are analyzed. A charactristic equation is derived for the eigenvalues of the resulting approximate system. As a result of this derivation the uniform exponential stability of the solution semigroup is preserved under approximation. It is the key to obtaining the convergence of approximate solutions of the algebraic Riccati equation in trace norm.
Ito, K.
1985-01-01
The stability and convergence properties of the Legendre-tau approximation for hereditary differential systems are analyzed. A characteristic equation is derived for the eigenvalues of the resulting approximate system. As a result of this derivation the uniform exponential stability of the solution semigroup is preserved under approximation. It is the key to obtaining the convergence of approximate solutions of the algebraic Riccati equation in trace norm.
Improved Analysis for Graphic TSP Approximation via Matchings
Mucha, Marcin
2011-01-01
The Travelling Salesman Problem is one the most fundamental and most studied problems in approximation algorithms. For more than 30 years, the best algorithm known for general metrics has been Christofides's algorithm with approximation factor of 3/2, even though the so-called Held-Karp LP relaxation of the problem is conjectured to have the integrality gap of only 4/3. Very recently, significant progress has been made for the important special case of graphic metrics, first by Oveis Gharan et al., and then by Momke and Svensson. In this paper, we provide an improved analysis for the approach introduced by Momke and Svensson yielding a bound of 35/24 on the approximation factor, as well as a bound of 19/12+epsilon for any epsilon>0 for a more general Travelling Salesman Path Problem in graphic metrics.
Zhou Shi-Qi
2007-01-01
A universal theoretical approach is proposed which enables all hard sphere density functional approximations(DFAs) applicable to van der Waals fluids. The resultant DFA obtained by combining the universal theoretical approach with any hard sphere DFAs only needs as input a second-order direct correlation function (DCF) of a coexistence bulk fluid, and is applicable in both supercritical and subcritical temperature regions. The associated effective hard sphere density can be specified by a hard wall sum rule. It is indicated that the value of the effective hard sphere density so determined can be universal, i.e. can be applied to any external potentials different from the single hard wall. As an illustrating example, the universal theoretical approach is combined with a hard sphere bridge DFA to predict the density profile of a hard core attractive Yukawa model fluid influenced by diverse external fields; agreement between the present formalism's predictions and the corresponding simulation data is good or at least comparable to several previous DFT approaches. The primary advantage of the present theoretical approach combined with other hard sphere DFAs is discussed.
无
2010-01-01
"Standards there as high as achieved elsewhere";news delivered to the world by Science in China Approximately forty years ago when China was undergoing a period of great difficulty, Science in China, previously
Dietary intake of different carbohydrates among incident stroke patients during previous year
Maryam Hajishafiee
2013-01-01
Conclusions: High carbohydrate intake specially refined sources with high glycemic index (GI and glycemic load (GL is associated with increased risk of stroke. Hence, dietary intake requires improvement to provide protection from life threatening outcomes.
Previously Homeschooled College Freshmen: Their First Year Experiences and Persistence Rates
Saunders, Mary K.
2010-01-01
Utilizing survey research on the entire 2004-2005 freshmen class of a private, interdenominational Christian college (n = 261), this study examined the social experiences and persistence rates of college freshmen who were homeschooled prior to attending higher education, and compared this group to college freshmen who were educated in a classroom…
Tree-fold loop approximation of AMD
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.)
Trajectory averaging for stochastic approximation MCMC algorithms
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.
Approximation of Bivariate Functions via Smooth Extensions
Zhang, Zhihua
2014-01-01
For a smooth bivariate function defined on a general domain with arbitrary shape, it is difficult to do Fourier approximation or wavelet approximation. In order to solve these problems, in this paper, we give an extension of the bivariate function on a general domain with arbitrary shape to a smooth, periodic function in the whole space or to a smooth, compactly supported function in the whole space. These smooth extensions have simple and clear representations which are determined by this bivariate function and some polynomials. After that, we expand the smooth, periodic function into a Fourier series or a periodic wavelet series or we expand the smooth, compactly supported function into a wavelet series. Since our extensions are smooth, the obtained Fourier coefficients or wavelet coefficients decay very fast. Since our extension tools are polynomials, the moment theorem shows that a lot of wavelet coefficients vanish. From this, with the help of well-known approximation theorems, using our extension methods, the Fourier approximation and the wavelet approximation of the bivariate function on the general domain with small error are obtained. PMID:24683316
Rogers, J.; Porter, K.
2012-03-01
This paper updates previous work that describes time period-based and other approximation methods for estimating the capacity value of wind power and extends it to include solar power. The paper summarizes various methods presented in utility integrated resource plans, regional transmission organization methodologies, regional stakeholder initiatives, regulatory proceedings, and academic and industry studies. Time period-based approximation methods typically measure the contribution of a wind or solar plant at the time of system peak - sometimes over a period of months or the average of multiple years.
Surgical treatment of breast cancer in previously augmented patients.
Karanas, Yvonne L; Leong, Darren S; Da Lio, Andrew; Waldron, Kathleen; Watson, James P; Chang, Helena; Shaw, William W
2003-03-01
The incidence of breast cancer is increasing each year. Concomitantly, cosmetic breast augmentation has become the second most often performed cosmetic surgical procedure. As the augmented patient population ages, an increasing number of breast cancer cases among previously augmented women can be anticipated. The surgical treatment of these patients is controversial, with several questions remaining unanswered. Is breast conservation therapy feasible in this patient population and can these patients retain their implants? A retrospective review of all breast cancer patients with a history of previous augmentation mammaplasty who were treated at the Revlon/UCLA Breast Center between 1991 and 2001 was performed. During the study period, 58 patients were treated. Thirty patients (52 percent) were treated with a modified radical mastectomy with implant removal. Twenty-eight patients (48 percent) underwent breast conservation therapy, which consisted of lumpectomy, axillary lymph node dissection, and radiotherapy. Twenty-two of the patients who underwent breast conservation therapy initially retained their implants. Eleven of those 22 patients (50 percent) ultimately required completion mastectomies with implant removal because of implant complications (two patients), local recurrences (five patients), or the inability to obtain negative margins (four patients). Nine additional patients experienced complications resulting from their implants, including contracture, erosion, pain, and rupture. The data illustrate that breast conservation therapy with maintenance of the implant is not ideal for the majority of augmented patients. Breast conservation therapy with explantation and mastopexy might be appropriate for rare patients with large volumes of native breast tissue. Mastectomy with immediate reconstruction might be a more suitable choice for these patients.
FETOMATERNAL OUTCOME OF PREGNANCY WITH PREVIOUS CESAREAN SECTION
Nigamananda
2014-09-01
Full Text Available OBJECTIVE: The aim of the study was to see the fetomaternal outcome of pregnancy with previous cesarean section. METHODS: This study was conducted in the department of OBGYN, BARC Hospital, Mumbai from October 2011 to September 2012, a period of one year. All the pregnant women with previous one cesarean section attending ANC clinic for confinement were included in the study group after giving consent. RESULTS: Out of total75 cases, a total of 23 patients (30.67% were given trial of labor. Out of 23 patients given trial of labor, 12 patients (52.17% had successful VBAC. Commonest indication for unsuccessful trial of labor undergoing repeat cesarean section was non-progress of labor (54.55% and failed IOL (36.67%. Out of 12 patients who had successful VBAC, 3 patients (25% had complication like episiotomy hematoma, perineal tear and cervical tear. No patients had major complications. In present study no baby had apgar score <7 at 1min and 5 min in VBAC group and elective LSCS group. CONCLUSION: The current study concludes that women with a prior cesarean are at increased risk for repeat cesarean section. Vigilance with respect to indication at primary cesarean delivery, proper counseling for trial of labor and proper antepartum and intrapartum monitoring of patients, are key to reducing the cesarean section rates. The antepartum, intrapartum and postpartum complications are more in repeat cesarean section cases. There is no doubt that a trial of labor is a relatively safe procedure, but it is not risk free. Therefore, patient evaluation prior to TOLAC, careful observation throughout labor in a well-equipped unit with around the clock services for emergency surgery and availability of expertise is the backbone for successful VBAC.
Approximation Limits of Linear Programs (Beyond Hierarchies)
Braun, Gábor; Pokutta, Sebastian; Steurer, David
2012-01-01
We develop a framework for approximation limits of polynomial-size linear programs from lower bounds on the nonnegative ranks of suitably defined matrices. This framework yields unconditional impossibility results that are applicable to any linear program as opposed to only programs generated by hierarchies. Using our framework, we prove that O(n^{1/2-eps})-approximations for CLIQUE require linear programs of size 2^{n^\\Omega(eps)}. (This lower bound applies to linear programs using a certain encoding of CLIQUE as a linear optimization problem.) Moreover, we establish a similar result for approximations of semidefinite programs by linear programs. Our main ingredient is a quantitative improvement of Razborov's rectangle corruption lemma for the high error regime, which gives strong lower bounds on the nonnegative rank of certain perturbations of the unique disjointness matrix.
Discontinuous Galerkin Methods with Trefftz Approximation
Kretzschmar, Fritz; Tsukerman, Igor; Weiland, Thomas
2013-01-01
We present a novel Discontinuous Galerkin Finite Element Method for wave propagation problems. The method employs space-time Trefftz-type basis functions that satisfy the underlying partial differential equations and the respective interface boundary conditions exactly in an element-wise fashion. The basis functions can be of arbitrary high order, and we demonstrate spectral convergence in the $\\Lebesgue_2$-norm. In this context, spectral convergence is obtained with respect to the approximation error in the entire space-time domain of interest, i.e. in space and time simultaneously. Formulating the approximation in terms of a space-time Trefftz basis makes high order time integration an inherent property of the method and clearly sets it apart from methods, that employ a high order approximation in space only.
Approximating light rays in the Schwarzschild field
Semerak, Oldrich
2014-01-01
A short formula is suggested which approximates photon trajectories in the Schwarzschild field better than other simple prescriptions from the literature. We compare it with various "low-order competitors", namely with those following from exact formulas for small $M$, with one of the results based on pseudo-Newtonian potentials, with a suitably adjusted hyperbola, and with the effective and often employed approximation by Beloborodov. Our main concern is the shape of the photon trajectories at finite radii, yet asymptotic behaviour is also discussed, important for lensing. An example is attached indicating that the newly suggested approximation is usable--and very accurate--for practical solving of the ray-deflection exercise.
On the approximate zero of Newton method
黄正达
2003-01-01
A judgment criterion to guarantee a point to be a Chen' s approximate zero of Newton method for solving nonlinear equation is sought by dominating sequence techniques. The criterion is based on the fact that the dominating function may have only one simple positive zero, assuming that the operator is weak Lipschitz continuous, which is much more relaxed and can be checked much more easily than Lipschitz continuous in practice. It is demonstrated that a Chen' s approximate zero may not be a Smale' s approximate zero. The error estimate obtained indicated the convergent order when we use |f(x) | < ε to stop computation in software.The result can also be applied for solving partial derivative and integration equations.
On the approximate zero of Newton method
黄正达
2003-01-01
A judgment criterion to guarantee a point to be a Chen's approximate zero of Newton method for solving nonlinear equation is sought by dominating sequence techniques. The criterion is based on the fact that the dominating function may have only one simple positive zero, assuming that the operator is weak Lipschitz continuous, which is much more relaxed and can be checked much more easily than Lipschitz continuous in practice. It is demonstrated that a Chen's approximate zero may not be a Smale's approximate zero. The error estimate obtained indicated the convergent order when we use |f(x)|<ε to stop computation in software. The result can also be applied for solving partial derivative and integration equations.
Optical pulse propagation with minimal approximations
Kinsler, Paul
2010-01-01
Propagation equations for optical pulses are needed to assist in describing applications in ever more extreme situations—including those in metamaterials with linear and nonlinear magnetic responses. Here I show how to derive a single first-order propagation equation using a minimum of approximations and a straightforward “factorization” mathematical scheme. The approach generates exact coupled bidirectional equations, after which it is clear that the description can be reduced to a single unidirectional first-order wave equation by means of a simple “slow evolution” approximation, where the optical pulse changes little over the distance of one wavelength. It also allows a direct term-to-term comparison of an exact bidirectional theory with the approximate unidirectional theory.
Rough interfaces beyond the Gaussian approximation
Caselle, M; Gliozzi, F; Hasenbusch, M; Pinn, K; Vinti, S; Caselle, M; Gliozzi, F; Fiore, R; Hasenbusch, M; Pinn, K; Vinti, S
1994-01-01
We compare predictions of the Capillary Wave Model beyond its Gaussian approximation with Monte Carlo results for the energy gap and the surface energy of the 3D Ising model in the scaling region. Our study reveals that the finite size effects of these quantities are well described by the Capillary Wave Model, expanded to two--loop order ( one order beyond the Gaussian approximation). We compare predictions of the Capillary Wave Model with Monte Carlo results for the energy gap and the interface energy of the 3D Ising model in the scaling region. Our study reveals that the finite size effects of these quantities are well described by the Capillary Wave Model, expanded to two-loop order (one order beyond the Gaussian approximation).
Implementing regularization implicitly via approximate eigenvector computation
Mahoney, Michael W
2010-01-01
Regularization is a powerful technique for extracting useful information from noisy data. Typically, it is implemented by adding some sort of norm constraint to an objective function and then exactly optimizing the modified objective function. This procedure typically leads to optimization problems that are computationally more expensive than the original problem, a fact that is clearly problematic if one is interested in large-scale applications. On the other hand, a large body of empirical work has demonstrated that heuristics, and in some cases approximation algorithms, developed to speed up computations sometimes have the side-effect of performing regularization implicitly. Thus, we consider the question: What is the regularized optimization objective that an approximation algorithm is exactly optimizing? We address this question in the context of computing approximations to the smallest nontrivial eigenvector of a graph Laplacian; and we consider three random-walk-based procedures: one based on the heat ...
On approximation of Markov binomial distributions
Xia, Aihua; 10.3150/09-BEJ194
2010-01-01
For a Markov chain $\\mathbf{X}=\\{X_i,i=1,2,...,n\\}$ with the state space $\\{0,1\\}$, the random variable $S:=\\sum_{i=1}^nX_i$ is said to follow a Markov binomial distribution. The exact distribution of $S$, denoted $\\mathcal{L}S$, is very computationally intensive for large $n$ (see Gabriel [Biometrika 46 (1959) 454--460] and Bhat and Lal [Adv. in Appl. Probab. 20 (1988) 677--680]) and this paper concerns suitable approximate distributions for $\\mathcal{L}S$ when $\\mathbf{X}$ is stationary. We conclude that the negative binomial and binomial distributions are appropriate approximations for $\\mathcal{L}S$ when $\\operatorname {Var}S$ is greater than and less than $\\mathbb{E}S$, respectively. Also, due to the unique structure of the distribution, we are able to derive explicit error estimates for these approximations.
Fast wavelet based sparse approximate inverse preconditioner
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.
Numerical approximation of partial differential equations
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 ...
On Born approximation in black hole scattering
Batic, D. [University of West Indies, Department of Mathematics, Kingston (Jamaica); Kelkar, N.G.; Nowakowski, M. [Universidad de los Andes, Departamento de Fisica, Bogota (Colombia)
2011-12-15
A massless field propagating on spherically symmetric black hole metrics such as the Schwarzschild, Reissner-Nordstroem and Reissner-Nordstroem-de Sitter backgrounds is considered. In particular, explicit formulae in terms of transcendental functions for the scattering of massless scalar particles off black holes are derived within a Born approximation. It is shown that the conditions on the existence of the Born integral forbid a straightforward extraction of the quasi normal modes using the Born approximation for the scattering amplitude. Such a method has been used in literature. We suggest a novel, well defined method, to extract the large imaginary part of quasinormal modes via the Coulomb-like phase shift. Furthermore, we compare the numerically evaluated exact scattering amplitude with the Born one to find that the approximation is not very useful for the scattering of massless scalar, electromagnetic as well as gravitational waves from black holes. (orig.)
Time Stamps for Fixed-Point Approximation
Damian, Daniela
2001-01-01
Time stamps were introduced in Shivers's PhD thesis for approximating the result of a control-flow analysis. We show them to be suitable for computing program analyses where the space of results (e.g., control-flow graphs) is large. We formalize time-stamping as a top-down, fixed-point approximat......Time stamps were introduced in Shivers's PhD thesis for approximating the result of a control-flow analysis. We show them to be suitable for computing program analyses where the space of results (e.g., control-flow graphs) is large. We formalize time-stamping as a top-down, fixed......-point approximation algorithm which maintains a single copy of intermediate results. We then prove the correctness of this algorithm....
Exponential Approximations Using Fourier Series Partial Sums
Banerjee, Nana S.; Geer, James F.
1997-01-01
The problem of accurately reconstructing a piece-wise smooth, 2(pi)-periodic function f and its first few derivatives, given only a truncated Fourier series representation of f, is studied and solved. The reconstruction process is divided into two steps. In the first step, the first 2N + 1 Fourier coefficients of f are used to approximate the locations and magnitudes of the discontinuities in f and its first M derivatives. This is accomplished by first finding initial estimates of these quantities based on certain properties of Gibbs phenomenon, and then refining these estimates by fitting the asymptotic form of the Fourier coefficients to the given coefficients using a least-squares approach. It is conjectured that the locations of the singularities are approximated to within O(N(sup -M-2), and the associated jump of the k(sup th) derivative of f is approximated to within O(N(sup -M-l+k), as N approaches infinity, and the method is robust. These estimates are then used with a class of singular basis functions, which have certain 'built-in' singularities, to construct a new sequence of approximations to f. Each of these new approximations is the sum of a piecewise smooth function and a new Fourier series partial sum. When N is proportional to M, it is shown that these new approximations, and their derivatives, converge exponentially in the maximum norm to f, and its corresponding derivatives, except in the union of a finite number of small open intervals containing the points of singularity of f. The total measure of these intervals decreases exponentially to zero as M approaches infinity. The technique is illustrated with several examples.
Vestergaard, H; Laurberg, P
1992-01-01
Radioiodine therapy is often employed for treatment of patients with relapse of hyperthyroidism due to Graves' disease, after previous thyroid surgery. Little is known about the outcome of this treatment compared to patients with no previous surgery. A total of 20 patients who had received surgical...... treatment for Graves' hyperthyroidism 1-46 years previously and with relapse of the hyperthyroidism, and 25 patients with hyperthyroidism due to Graves' disease and no previous thyroid surgery were treated with radioiodine, following the same protocol. Early after treatment the previously operated patients...
A. Beléndez; ALVAREZ, M. L.; Francés, J.; S. Bleda; Beléndez, T.; Nájera, A.; Arribas, E.
2012-01-01
Accurate approximate closed-form solutions for the cubic-quintic Duffing oscillator are obtained in terms of elementary functions. To do this, we use the previous results obtained using a cubication method in which the restoring force is expanded in Chebyshev polynomials and the original nonlinear differential equation is approximated by a cubic Duffing equation. Explicit approximate solutions are then expressed as a function of the complete elliptic integral of the first kind and the Jacobi ...
Mean Spherical Approximation-Based Partitioned Density Functional Theory
ZHOU Shi-Qi
2003-01-01
Previous literature claims that the density functional theory for non-uniform non-hard sphere interaction potential fluid can be improved on by treating the tail part by the third order functional perturbation expansion approximation (FPEA) with the symmetrical and intuitive consideration-based simple function C0(3)(r1, r2, r3) =ζ∫ dr4a(r4 - r1)a(r4 - r2)a(r4 - r3) as the uniform third order direct correlation function (DCF) for the tail part,here kernel function a(r) = (6/πσ3)Heaviside(σ/2 - r). The present contribution concludes that for the mean spherical approximation-based second order DCF, the terms higher than second order in the FPEA of the tail part of the non-uniform first order DCF are exactly zero. The reason for the partial success of the previous a kernel function-based third order FPEA for the tail part is due to the adjustable parameter ζ and the short range of the a kernel function.Improvement over the previous theories is proposed and tested.
Mean Spherical Approximation-Based Partitioned Density Functional Theory
ZHOUShi-Qi
2003-01-01
Previous literature claims that the density functional theory for non-uniform non-hard sphere interaction potential fluid can be improved on by treating the tail part by the third order functional perturbation expansion approximation (FPEA) with the symmetrical and intuitive consideration-based simple function C0(3)(r1, r2, r3) =(∫dr4a(r4-r1)a(r4-r2)a(r4-r3) as the uniform third order direct correlation function (DCF) for the tail part,here kernel function a(r) = (6/πσ3)Heaviside(σ/2 - r). The present contribution concludes that for the mean spherical approximation-based second order DCF, the terms higher than second order in the FPEA of the tail part of the non-uniform first order DCF are exactly zero. The reason for the partial success of the previous a kernel function-based third order FPEA for the tail part is due to the adjustable parameter ξ and the short range of the a kernel function.Improvement over the previous theories is proposed and tested.
Preschool acuity of the approximate number system correlates with school math ability.
Libertus, Melissa E; Feigenson, Lisa; Halberda, Justin
2011-11-01
Previous research shows a correlation between individual differences in people's school math abilities and the accuracy with which they rapidly and nonverbally approximate how many items are in a scene. This finding is surprising because the Approximate Number System (ANS) underlying numerical estimation is shared with infants and with non-human animals who never acquire formal mathematics. However, it remains unclear whether the link between individual differences in math ability and the ANS depends on formal mathematics instruction. Earlier studies demonstrating this link tested participants only after they had received many years of mathematics education, or assessed participants' ANS acuity using tasks that required additional symbolic or arithmetic processing similar to that required in standardized math tests. To ask whether the ANS and math ability are linked early in life, we measured the ANS acuity of 200 3- to 5-year-old children using a task that did not also require symbol use or arithmetic calculation. We also measured children's math ability and vocabulary size prior to the onset of formal math instruction. We found that children's ANS acuity correlated with their math ability, even when age and verbal skills were controlled for. These findings provide evidence for a relationship between the primitive sense of number and math ability starting early in life. 2011 Blackwell Publishing Ltd.
Extending the Eikonal Approximation to Low Energy
Capel, Pierre; Ogata, Kazuyuki
2014-01-01
E-CDCC and DEA, two eikonal-based reaction models are compared to CDCC at low energy (e.g. 20AMeV) to study their behaviour in the regime at which the eikonal approximation is supposed to fail. We confirm that these models lack the Coulomb deflection of the projectile by the target. We show that a hybrid model, built on the CDCC framework at low angular momenta and the eikonal approximation at larger angular momenta gives a perfect agreement with CDCC. An empirical shift in impact parameter can also be used reliably to simulate this missing Coulomb deflection.
Approximately-Balanced Drilling in Daqing Oilfield
Xia Bairu; Zheng Xiuhua; Li Guoqing; Tian Tuo
2004-01-01
The Daqing oilfield is a multilayered heterogeneous oil field where the pressure are different in the same vertical profile causing many troubles to the adjustment well drillings. The approximately-balanced drilling technique has been developed and proved to be efficient and successful in Daqing oilfield. This paper discusses the application of approximately-balanced drilling technique under the condition of multilayered pressure in Daqing oilfield, including the prediction of formation pressure, the pressure discharge technique for the drilling well and the control of the density of drilling fluid.
Faddeev Random Phase Approximation for Molecules
Degroote, Matthias; Barbieri, Carlo
2010-01-01
The Faddeev Random Phase Approximation is a Green's function technique that makes use of Faddeev-equations to couple the motion of a single electron to the two-particle--one-hole and two-hole--one-particle excitations. This method goes beyond the frequently used third-order Algebraic Diagrammatic Construction method: all diagrams involving the exchange of phonons in the particle-hole and particle-particle channel are retained, but the phonons are described at the level of the Random Phase Approximation. This paper presents the first results for diatomic molecules at equilibrium geometry. The behavior of the method in the dissociation limit is also investigated.
An Approximate Bayesian Fundamental Frequency Estimator
Nielsen, Jesper Kjær; Christensen, Mads Græsbøll; Jensen, Søren Holdt
2012-01-01
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...... 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...
Approximate Controllability of Fractional Integrodifferential Evolution Equations
R. Ganesh
2013-01-01
Full Text Available This paper addresses the issue of approximate controllability for a class of control system which is represented by nonlinear fractional integrodifferential equations with nonlocal conditions. By using semigroup theory, p-mean continuity and fractional calculations, a set of sufficient conditions, are formulated and proved for the nonlinear fractional control systems. More precisely, the results are established under the assumption that the corresponding linear system is approximately controllable and functions satisfy non-Lipschitz conditions. The results generalize and improve some known results.
Excluded-Volume Approximation for Supernova Matter
Yudin, A V
2014-01-01
A general scheme of the excluded-volume approximation as applied to multicomponent systems with an arbitrary degree of degeneracy has been developed. This scheme also admits an allowance for additional interactions between the components of a system. A specific form of the excluded-volume approximation for investigating supernova matter at subnuclear densities has been found from comparison with the hard-sphere model. The possibility of describing the phase transition to uniform nuclear matter in terms of the formalism under consideration is discussed.
Generalized companion matrix for approximate GCD
Boito, Paola
2011-01-01
We study a variant of the univariate approximate GCD problem, where the coe?- cients of one polynomial f(x)are known exactly, whereas the coe?cients of the second polynomial g(x)may be perturbed. Our approach relies on the properties of the matrix which describes the operator of multiplication by gin the quotient ring C[x]=(f). In particular, the structure of the null space of the multiplication matrix contains all the essential information about GCD(f; g). Moreover, the multiplication matrix exhibits a displacement structure that allows us to design a fast algorithm for approximate GCD computation with quadratic complexity w.r.t. polynomial degrees.
An approximate analytical approach to resampling averages
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 appr......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...
Static correlation beyond the random phase approximation
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...... derived from Hedin's equations (Random Phase Approximation (RPA), Time-dependent Hartree-Fock (TDHF), Bethe-Salpeter equation (BSE), and Time-Dependent GW) all reproduce the correct dissociation limit. We also show that the BSE improves the correlation energies obtained within RPA and TDHF significantly...
Approximate formulas for moderately small eikonal amplitudes
Kisselev, A. V.
2016-08-01
We consider the eikonal approximation for moderately small scattering amplitudes. To find numerical estimates of these approximations, we derive formulas that contain no Bessel functions and consequently no rapidly oscillating integrands. To obtain these formulas, we study improper integrals of the first kind containing products of the Bessel functions J0(z). We generalize the expression with four functions J0(z) and also find expressions for the integrals with the product of five and six Bessel functions. We generalize a known formula for the improper integral with two functions Jυ (az) to the case with noninteger υ and complex a.
The exact renormalization group and approximation solutions
Morris, T R
1994-01-01
We investigate the structure of Polchinski's formulation of the flow equations for the continuum Wilson effective action. Reinterpretations in terms of I.R. cutoff greens functions are given. A promising non-perturbative approximation scheme is derived by carefully taking the sharp cutoff limit and expanding in `irrelevancy' of operators. We illustrate with two simple models of four dimensional $\\lambda \\varphi^4$ theory: the cactus approximation, and a model incorporating the first irrelevant correction to the renormalized coupling. The qualitative and quantitative behaviour give confidence in a fuller use of this method for obtaining accurate results.
Approximating W projection as a separable kernel
Merry, Bruce
2016-02-01
W projection is a commonly used approach to allow interferometric imaging to be accelerated by fast Fourier transforms, but it can require a huge amount of storage for convolution kernels. The kernels are not separable, but we show that they can be closely approximated by separable kernels. The error scales with the fourth power of the field of view, and so is small enough to be ignored at mid- to high frequencies. We also show that hybrid imaging algorithms combining W projection with either faceting, snapshotting, or W stacking allow the error to be made arbitrarily small, making the approximation suitable even for high-resolution wide-field instruments.
BEST APPROXIMATION BY DOWNWARD SETS WITH APPLICATIONS
H.Mohebi; A. M. Rubinov
2006-01-01
We develop a theory of downward sets for a class of normed ordered spaces. We study best approximation in a normed ordered space X by elements of downward sets, and give necessary and sufficient conditions for any element of best approximation by a closed downward subset of X. We also characterize strictly downward subsets of X, and prove that a downward subset of X is strictly downward if and only if each its boundary point is Chebyshev. The results obtained are used for examination of some Chebyshev pairs (W,x), where x ∈ X and W is a closed downward subset of X.
Local density approximations from finite systems
Entwistle, Mike; Wetherell, Jack; Longstaff, Bradley; Ramsden, James; Godby, Rex
2016-01-01
The local density approximation (LDA) constructed through quantum Monte Carlo calculations of the homogeneous electron gas (HEG) is the most common approximation to the exchange-correlation functional in density functional theory. We introduce an alternative set of LDAs constructed from slab-like systems of one, two and three electrons that resemble the HEG within a finite region, and illustrate the concept in one dimension. Comparing with the exact densities and Kohn-Sham potentials for various test systems, we find that the LDAs give a good account of the self-interaction correction, but are less reliable when correlation is stronger or currents flow.
On a mixed Khintchine problem in Diophantine approximation
Harrap, Stephen George; Yusupova, Tatiana
2013-01-01
We establish a `mixed' version of a fundamental theorem of Khintchine within the field of simultaneous Diophantine approximation. Via the notion of ubiquity we are able to make significant progress towards the completion of the metric theory associated with mixed problems in this setting. This in......We establish a `mixed' version of a fundamental theorem of Khintchine within the field of simultaneous Diophantine approximation. Via the notion of ubiquity we are able to make significant progress towards the completion of the metric theory associated with mixed problems in this setting....... This includes finding a natural mixed analogue of the classical Jarn\\'ik-Besicovich Theorem. Previous knowledge surrounding mixed problems was almost entirely restricted to the multiplicative setup of de Mathan & Teuli\\'e [21], where the concept originated....
A better approximation algorithm for finding planar subgraphs
Calinescu, G.; Karloff, H.; Fernandes, C.G. [Georgia Inst. of Technology, Atlanta, GA (United States); Finkler, U. [Max-Planch-Inst. fuer Informatik, Saarbruecken (Germany)
1996-12-31
The MAXIMUM PLANAR SUBGRAPH problem-given a graph G, find a largest planar subgraph of G-has applications in circuit layout, facility layout, and graph drawing. No previous polynomial-time approximation algorithm for this NP-Complete problem was known to achieve a performance ratio larger than 1/3, which is achieved simply by producing a spanning tree of G. We present the first approximation algorithm for MAXIMUM PLANAR SUBGRAPH with higher performance ratio (2/5 instead of 1/3). We also apply our algorithm to find large outerplanar subgraphs. Last, we show that both MAXIMUM PLANAR SUBGRAPH and its complement, the problem of removing as few edges as possible to leave a planar subgraph, are Max SNP-Hard.
Approximated mutual information training for speech recognition using myoelectric signals.
Guo, Hua J; Chan, A D C
2006-01-01
A new training algorithm called the approximated maximum mutual information (AMMI) is proposed to improve the accuracy of myoelectric speech recognition using hidden Markov models (HMMs). Previous studies have demonstrated that automatic speech recognition can be performed using myoelectric signals from articulatory muscles of the face. Classification of facial myoelectric signals can be performed using HMMs that are trained using the maximum likelihood (ML) algorithm; however, this algorithm maximizes the likelihood of the observations in the training sequence, which is not directly associated with optimal classification accuracy. The AMMI training algorithm attempts to maximize the mutual information, thereby training the HMMs to optimize their parameters for discrimination. Our results show that AMMI training consistently reduces the error rates compared to these by the ML training, increasing the accuracy by approximately 3% on average.
Approximating the Generalized Voronoi Diagram of Closely Spaced Objects
Edwards, John; Daniel, Eric; Pascucci, Valerio; Bajaj, Chandrajit
2016-01-01
We present an algorithm to compute an approximation of the generalized Voronoi diagram (GVD) on arbitrary collections of 2D or 3D geometric objects. In particular, we focus on datasets with closely spaced objects; GVD approximation is expensive and sometimes intractable on these datasets using previous algorithms. With our approach, the GVD can be computed using commodity hardware even on datasets with many, extremely tightly packed objects. Our approach is to subdivide the space with an octree that is represented with an adjacency structure. We then use a novel adaptive distance transform to compute the distance function on octree vertices. The computed distance field is sampled more densely in areas of close object spacing, enabling robust and parallelizable GVD surface generation. We demonstrate our method on a variety of data and show example applications of the GVD in 2D and 3D. PMID:27540272
Approximation methods for efficient learning of Bayesian networks
Riggelsen, C
2008-01-01
This publication offers and investigates efficient Monte Carlo simulation methods in order to realize a Bayesian approach to approximate learning of Bayesian networks from both complete and incomplete data. For large amounts of incomplete data when Monte Carlo methods are inefficient, approximations are implemented, such that learning remains feasible, albeit non-Bayesian. The topics discussed are: basic concepts about probabilities, graph theory and conditional independence; Bayesian network learning from data; Monte Carlo simulation techniques; and, the concept of incomplete data. In order to provide a coherent treatment of matters, thereby helping the reader to gain a thorough understanding of the whole concept of learning Bayesian networks from (in)complete data, this publication combines in a clarifying way all the issues presented in the papers with previously unpublished work.
Convergence of the natural approximations of piecewise monotone interval maps.
Haydn, Nicolai
2004-06-01
We consider piecewise monotone interval mappings which are topologically mixing and satisfy the Markov property. It has previously been shown that the invariant densities of the natural approximations converge exponentially fast in uniform pointwise topology to the invariant density of the given map provided its derivative is piecewise Lipshitz continuous. We provide an example of a map which is Lipshitz continuous and for which the densities converge in the bounded variation norm at a logarithmic rate. This shows that in general one cannot expect exponential convergence in the bounded variation norm. Here we prove that if the derivative of the interval map is Holder continuous and its variation is well approximable (gamma-uniform variation for gamma>0), then the densities converge exponentially fast in the norm.
Approximate energy expression for spin-polarized Fermi liquids
Takano, M; Endo, T; Kimura, R
2003-01-01
An approximate energy expression is proposed for arbitrarily spin-polarized Fermi liquids with central two-body forces. It is explicitly expression as a functional of spin-dependent radial distribution functions and can be used conveniently in the variational method. It includes the potential energies completely and the kinetic energies up to main parts of the three-body cluster terms. This approximation is similar to that used previously for spin-unpolarized and fully polarized matter. A notable feature of this expressed is that it guarantees the necessary conditions on arbitrarily spin-polarized structure functions automatically. The Euler-Lagrange equations are derived from this energy expression and are numerically solved for arbitrarily spin-polarized liquid sup 3 He. The results for liquid sup 3 He with the HFDHE2 potential are consistent with the nearly ferromagnetic property. (author)
Pseudoscalar decays into lepton pairs from rational approximants
Sanchez-Puertas, Pablo
2015-01-01
The pseudoscalar decays into lepton pairs $P\\rightarrow\\overline{\\ell}\\ell$ are analyzed with the machinery of Canterbury approximants, an extension of Pad\\'e approximants to bivariate functions. This framework provides an ideal model-independent approach to implement all our knowledge of the pseudoscalar transition form factors driving these decays, can be used for data analysis, and allows to include experimental data and theoretical constraints in an easy way, and determine a systematic error. We find that previous theoretical estimates for these branching ratios have underestimated their theoretical uncertainties. From our updated results, the existing experimental discrepancies for $\\pi^0\\rightarrow e^+e^-$ and $\\eta\\rightarrow \\mu^+\\mu^-$ channels cannot be explained unless the doubly-virtual transition form factors behavior -not yet measured- are out of theoretical expectations, which is an interesting result both for anomalous magnetic moments of leptons, and for physics beyond the standard model.
Approximate Universal Relations among Tidal Parameters for Neutron Star Binaries
Yagi, Kent
2016-01-01
One of largest uncertainties in nuclear physics is the relation between the pressure and density of supranuclear matter: the equation of state. Some of this uncertainty may be removed through future gravitational wave observations of neutron star binaries by extracting the tidal deformabilities (or Love numbers) of neutron stars. Previous studies showed that only a certain combination of the individual deformabilities of each body (chirp tidal deformability) can be measured with second-generation gravitational wave interferometers, such as Adv. LIGO, due to correlations between the individual deformabilities. To overcome this, we search for approximately universal (or equation-of-state independent) relations between two combinations of the individual tidal deformabilities, such that once one of them has been measured, the other can be automatically obtained and the individual ones decoupled through these relations. We find an approximately universal relation between the symmetric and the anti-symmetric combin...
La Budde, R. A.
1972-01-01
Sampling techniques have been used previously to evaluate Jacobian determinants that occur in classical mechanical descriptions of molecular scattering. These determinants also occur in the quasiclassical approximation. A new technique is described which can be used to evaluate Jacobian determinants which occur in either description. This method is expected to be valuable in the study of reactive scattering using the quasiclassical approximation.
Validity of the Aluminum Equivalent Approximation in Space Radiation Shielding
Badavi, Francis F.; Adams, Daniel O.; Wilson, John W.
2009-01-01
The origin of the aluminum equivalent shield approximation in space radiation analysis can be traced back to its roots in the early years of the NASA space programs (Mercury, Gemini and Apollo) wherein the primary radiobiological concern was the intense sources of ionizing radiation causing short term effects which was thought to jeopardize the safety of the crew and hence the mission. Herein, it is shown that the aluminum equivalent shield approximation, although reasonably well suited for that time period and to the application for which it was developed, is of questionable usefulness to the radiobiological concerns of routine space operations of the 21 st century which will include long stays onboard the International Space Station (ISS) and perhaps the moon. This is especially true for a risk based protection system, as appears imminent for deep space exploration where the long-term effects of Galactic Cosmic Ray (GCR) exposure is of primary concern. The present analysis demonstrates that sufficiently large errors in the interior particle environment of a spacecraft result from the use of the aluminum equivalent approximation, and such approximations should be avoided in future astronaut risk estimates. In this study, the aluminum equivalent approximation is evaluated as a means for estimating the particle environment within a spacecraft structure induced by the GCR radiation field. For comparison, the two extremes of the GCR environment, the 1977 solar minimum and the 2001 solar maximum, are considered. These environments are coupled to the Langley Research Center (LaRC) deterministic ionized particle transport code High charge (Z) and Energy TRaNsport (HZETRN), which propagates the GCR spectra for elements with charges (Z) in the range I shield, and the effects of the aluminum equivalent approximation for a good polymeric shield material such as genetic polyethylene (PE). The shield thickness is represented by a 25 g/cm spherical shell. Although one could
Rational approximations and quantum algorithms with postselection
Mahadev, U.; de Wolf, R.
2015-01-01
We study the close connection between rational functions that approximate a given Boolean function, and quantum algorithms that compute the same function using post-selection. We show that the minimal degree of the former equals (up to a factor of 2) the minimal query complexity of the latter. We gi
Kravchuk functions for the finite oscillator approximation
Atakishiyev, Natig M.; Wolf, Kurt Bernardo
1995-01-01
Kravchuk orthogonal functions - Kravchuk polynomials multiplied by the square root of the weight function - simplify the inversion algorithm for the analysis of discrete, finite signals in harmonic oscillator components. They can be regarded as the best approximation set. As the number of sampling points increases, the Kravchuk expansion becomes the standard oscillator expansion.
Optical bistability without the rotating wave approximation
Sharaby, Yasser A., E-mail: Yasser_Sharaby@hotmail.co [Physics Department, Faculty of Applied Sciences, Suez Canal University, Suez (Egypt); Joshi, Amitabh, E-mail: ajoshi@eiu.ed [Department of Physics, Eastern Illinois University, Charleston, IL 61920 (United States); Hassan, Shoukry S., E-mail: Shoukryhassan@hotmail.co [Mathematics Department, College of Science, University of Bahrain, P.O. Box 32038 (Bahrain)
2010-04-26
Optical bistability for two-level atomic system in a ring cavity is investigated outside the rotating wave approximation (RWA) using non-autonomous Maxwell-Bloch equations with Fourier decomposition up to first harmonic. The first harmonic output field component exhibits reversed or closed loop bistability simultaneously with the usual (anti-clockwise) bistability in the fundamental field component.
Improved Approximations for Multiprocessor Scheduling Under Uncertainty
Crutchfield, Christopher; Fineman, Jeremy T; Karger, David R; Scott, Jacob
2008-01-01
This paper presents improved approximation algorithms for the problem of multiprocessor scheduling under uncertainty, or SUU, in which the execution of each job may fail probabilistically. This problem is motivated by the increasing use of distributed computing to handle large, computationally intensive tasks. In the SUU problem we are given n unit-length jobs and m machines, a directed acyclic graph G of precedence constraints among jobs, and unrelated failure probabilities q_{ij} for each job j when executed on machine i for a single timestep. Our goal is to find a schedule that minimizes the expected makespan, which is the expected time at which all jobs complete. Lin and Rajaraman gave the first approximations for this NP-hard problem for the special cases of independent jobs, precedence constraints forming disjoint chains, and precedence constraints forming trees. In this paper, we present asymptotically better approximation algorithms. In particular, we give an O(loglog min(m,n))-approximation for indep...
Image Compression Via a Fast DCT Approximation
Bayer, F. M.; Cintra, R. J.
2010-01-01
Discrete transforms play an important role in digital signal processing. In particular, due to its transform domain energy compaction properties, the discrete cosine transform (DCT) is pivotal in many image processing problems. This paper introduces a numerical approximation method for the DCT based
Approximation algorithms for planning and control
Boddy, Mark; Dean, Thomas
1989-01-01
A control system operating in a complex environment will encounter a variety of different situations, with varying amounts of time available to respond to critical events. Ideally, such a control system will do the best possible with the time available. In other words, its responses should approximate those that would result from having unlimited time for computation, where the degree of the approximation depends on the amount of time it actually has. There exist approximation algorithms for a wide variety of problems. Unfortunately, the solution to any reasonably complex control problem will require solving several computationally intensive problems. Algorithms for successive approximation are a subclass of the class of anytime algorithms, algorithms that return answers for any amount of computation time, where the answers improve as more time is allotted. An architecture is described for allocating computation time to a set of anytime algorithms, based on expectations regarding the value of the answers they return. The architecture described is quite general, producing optimal schedules for a set of algorithms under widely varying conditions.
Large hierarchies from approximate R symmetries
Kappl, Rolf; Ratz, Michael [Technische Univ. Muenchen, Garching (Germany). Physik Dept. T30; Nilles, Hans Peter [Bonn Univ. (Germany). Bethe Zentrum fuer Theoretische Physik und Physikalisches Inst.; Ramos-Sanchez, Saul; Schmidt-Hoberg, Kai [Deutsches Elektronen-Synchrotron (DESY), Hamburg (Germany); Vaudrevange, Patrick K.S. [Ludwig-Maximilians-Univ. Muenchen (Germany). Arnold Sommerfeld Zentrum fuer Theoretische Physik
2008-12-15
We show that hierarchically small vacuum expectation values of the superpotential in supersymmetric theories can be a consequence of an approximate R symmetry. We briefly discuss the role of such small constants in moduli stabilization and understanding the huge hierarchy between the Planck and electroweak scales. (orig.)
Strong washout approximation to resonant leptogenesis
Garbrecht, Bjoern; Gautier, Florian; Klaric, Juraj [Physik Department T70, James-Franck-Strasse, Techniche Universitaet Muenchen, 85748 Garching (Germany)
2016-07-01
We study resonant Leptogenesis with two sterile neutrinos with masses M{sub 1} and M{sub 2}, Yukawa couplings Y{sub 1} and Y{sub 2}, and a single active flavor. Specifically, we focus on the strong washout regime, where the decay width dominates the mass splitting of the two sterile neutrinos. We show that one can approximate the effective decay asymmetry by it's late time limit ε = X sin(2 φ)/(X{sup 2}+sin{sup 2}φ), where X=8 π Δ/(vertical stroke Y{sub 1} vertical stroke {sup 2}+ vertical stroke Y{sub 2} vertical stroke {sup 2}), Δ=4(M{sub 1}-M{sub 2})/(M{sub 1}+M{sub 2}), and φ=arg(Y{sub 2}/Y{sub 1}), and establish criteria for the validity of this approximation. We compare the approximate results with numerical ones, obtained by solving the mixing and oscillations of the sterile neutrinos. We generalize the formula to the case of several active flavors, and demonstrate how it can be used to calculate the lepton asymmetry in phenomenological scenarios which are in agreement with the neutrino oscillation data. We find that that using the late time limit is an applicable approximation throughout the phenomenologically viable parameter space.
Lower Bound Approximation for Elastic Buckling Loads
Vrouwenvelder, A.; Witteveen, J.
1975-01-01
An approximate method for the elastic buckling analysis of two-dimensional frames is introduced. The method can conveniently be explained with reference to a physical interpretation: In the frame every member is replaced by two new members: - a flexural member without extensional rigidity to transmi
Approximate Equilibrium Problems and Fixed Points
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.
Approximations in diagnosis: motivations and techniques
Harmelen, van F.A.H.; Teije, A. ten
1995-01-01
We argue that diagnosis should not be seen as solving a problem with a unique definition, but rather that there exists a whole space of reasonable notions of diagnosis. These notions can be seen as mutual approximations. We present a number of reasons for choosing among different notions of diagnos
Eignets for function approximation on manifolds
Mhaskar, H N
2009-01-01
Let $\\XX$ be a compact, smooth, connected, Riemannian manifold without boundary, $G:\\XX\\times\\XX\\to \\RR$ be a kernel. Analogous to a radial basis function network, an eignet is an expression of the form $\\sum_{j=1}^M a_jG(\\circ,y_j)$, where $a_j\\in\\RR$, $y_j\\in\\XX$, $1\\le j\\le M$. We describe a deterministic, universal algorithm for constructing an eignet for approximating functions in $L^p(\\mu;\\XX)$ for a general class of measures $\\mu$ and kernels $G$. Our algorithm yields linear operators. Using the minimal separation amongst the centers $y_j$ as the cost of approximation, we give modulus of smoothness estimates for the degree of approximation by our eignets, and show by means of a converse theorem that these are the best possible for every \\emph{individual function}. We also give estimates on the coefficients $a_j$ in terms of the norm of the eignet. Finally, we demonstrate that if any sequence of eignets satisfies the optimal estimates for the degree of approximation of a smooth function, measured in ter...
Approximations in diagnosis: motivations and techniques
Harmelen, van F.A.H.; Teije, A. ten
1995-01-01
We argue that diagnosis should not be seen as solving a problem with a unique definition, but rather that there exists a whole space of reasonable notions of diagnosis. These notions can be seen as mutual approximations. We present a number of reasons for choosing among different notions of
Empirical progress and nomic truth approximation revisited
Kuipers, Theodorus
2014-01-01
In my From Instrumentalism to Constructive Realism (2000) I have shown how an instrumentalist account of empirical progress can be related to nomic truth approximation. However, it was assumed that a strong notion of nomic theories was needed for that analysis. In this paper it is shown, in terms of
Faddeev Random Phase Approximation applied to molecules
Degroote, Matthias
2012-01-01
This Ph.D. thesis derives the equations of the Faddeev Random Phase Approximation (FRPA) and applies the method to a set of small atoms and molecules. The occurence of RPA instabilities in the dissociation limit is addressed in molecules and by the study of the Hubbard molecule as a test system with reduced dimensionality.
Auction analysis by normal form game approximation
Kaisers, Michael; Tuyls, Karl; Thuijsman, Frank; Parsons, Simon
2008-01-01
Auctions are pervasive in todaypsilas society and provide a variety of real markets. This article facilitates a strategic choice between a set of available trading strategies by introducing a methodology to approximate heuristic payoff tables by normal form games. An example from the auction domain
Fostering Formal Commutativity Knowledge with Approximate Arithmetic.
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.
Approximate fixed point of Reich operator
M. Saha
2013-01-01
Full Text Available In the present paper, we study the existence of approximate fixed pointfor Reich operator together with the property that the ε-fixed points are concentrated in a set with the diameter tends to zero if ε $to$ > 0.
Approximation of Aggregate Losses Using Simulation
Mohamed A. Mohamed
2010-01-01
Full Text Available Problem statement: The modeling of aggregate losses is one of the main objectives in actuarial theory and practice, especially in the process of making important business decisions regarding various aspects of insurance contracts. The aggregate losses over a fixed time period is often modeled by mixing the distributions of loss frequency and severity, whereby the distribution resulted from this approach is called a compound distribution. However, in many cases, realistic probability distributions for loss frequency and severity cannot be combined mathematically to derive the compound distribution of aggregate losses. Approach: This study aimed to approximate the aggregate loss distribution using simulation approach. In particular, the approximation of aggregate losses was based on a compound Poisson-Pareto distribution. The effects of deductible and policy limit on the individual loss as well as the aggregate losses were also investigated. Results: Based on the results, the approximation of compound Poisson-Pareto distribution via simulation approach agreed with the theoretical mean and variance of each of the loss frequency, loss severity and aggregate losses. Conclusion: This study approximated the compound distribution of aggregate losses using simulation approach. The investigation on retained losses and insurance claims allowed an insured or a company to select an insurance contract that fulfills its requirement. In particular, if a company wants to have an additional risk reduction, it can compare alternative policies by considering the worthiness of the additional expected total cost which can be estimated via simulation approach.
Hierarchical matrix approximation of large covariance matrices
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.
Approximations in the PE-method
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...
Approximating the DGP of China's Quarterly GDP
Ph.H.B.F. Franses (Philip Hans); H. Mees (Heleen)
2010-01-01
textabstractWe demonstrate that the data generating process (DGP) of China’s cumulated quarterly Gross Domestic Product (GDP, current prices), as it is reported by the National Bureau of Statistics of China, can be (very closely) approximated by a simple rule. This rule is that annual growth in any
OPTICAL QUANTIFICATION OF APPROXIMAL CARIES INVITRO
VANDERIJKE, JW; HERKSTROTER, FM; TENBOSCH, JJ
1991-01-01
A fluorescent dye was applied to extracted premolars with either early artificial lesions or natural white-spot lesions. The teeth were placed in an approximal geometry, and with a specially designed fibre-optic probe the fluorescence of the dye was measured in the lesions. The same fibre-optic
Approximation Algorithms for Model-Based Diagnosis
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 a
An Approximation of Ultra-Parabolic Equations
Allaberen Ashyralyev
2012-01-01
Full Text Available The first and second order of accuracy difference schemes for the approximate solution of the initial boundary value problem for ultra-parabolic equations are presented. Stability of these difference schemes is established. Theoretical results are supported by the result of numerical examples.
Approximation Algorithms for Model-Based Diagnosis
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 a
Approximating the DGP of China's Quarterly GDP
Ph.H.B.F. Franses (Philip Hans); H. Mees (Heleen)
2010-01-01
textabstractWe demonstrate that the data generating process (DGP) of China’s cumulated quarterly Gross Domestic Product (GDP, current prices), as it is reported by the National Bureau of Statistics of China, can be (very closely) approximated by a simple rule. This rule is that annual growth in any
$\\Phi$-derivable approximations in gauge theories
Arrizabalaga, A
2003-01-01
We discuss the method of $\\Phi$-derivable approximations in gauge theories. There, two complications arise, namely the violation of Bose symmetry in correlation functions and the gauge dependence. For the latter we argue that the error introduced by the gauge dependent terms is controlled, therefore not invalidating the method.
Approximations of Two-Attribute Utility Functions
1976-09-01
Introduction to Approximation Theory, McGraw-Hill, New York, 1966. Faber, G., Uber die interpolatorische Darstellung stetiger Funktionen, Deutsche...Management Review 14 (1972b) 37-50. Keeney, R. L., A decision analysis with multiple objectives: the Mexico City airport, Bell Journal of Economics
Approximate Furthest Neighbor in High Dimensions
Pagh, Rasmus; Silvestri, Francesco; Sivertsen, Johan von Tangen
2015-01-01
-dimensional Euclidean space. We build on the technique of Indyk (SODA 2003), storing random projections to provide sublinear query time for AFN. However, we introduce a different query algorithm, improving on Indyk’s approximation factor and reducing the running time by a logarithmic factor. We also present a variation...
Virial expansion coefficients in the harmonic approximation
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...
Nonlinear approximation with dictionaries,.. II: Inverse estimates
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...
Intrinsic Diophantine approximation on general polynomial surfaces
Tiljeset, Morten Hein
2017-01-01
We study the Hausdorff measure and dimension of the set of intrinsically simultaneously -approximable points on a curve, surface, etc, given as a graph of integer polynomials. We obtain complete answers to these questions for algebraically “nice” manifolds. This generalizes earlier work done...
Turbo Equalization Using Partial Gaussian Approximation
Zhang, Chuanzong; Wang, Zhongyong; Manchón, Carles Navarro
2016-01-01
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...
Subset Selection by Local Convex Approximation
Ø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...
Nonlinear approximation with dictionaries. II. Inverse Estimates
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-diagonal...
Measles Outbreak among Previously Immunized Adult Healthcare Workers, China, 2015
Zhengyi Zhang
2016-01-01
Full Text Available Measles is caused by measles virus belonging to genus Morbillivirus of the family Paramyxoviridae. Vaccination has played a critical role in controlling measles infection worldwide. However, in the recent years, outbreaks of measles infection still occur in many developing countries. Here, we report an outbreak of measles among healthcare workers and among the 60 measles infected patients 50 were healthcare workers including doctors, nurses, staff, and medics. Fifty-one patients (85% tested positive for IgM antibodies against the measles virus and 50 patients (83.3% tested positive for measles virus RNA. Surprisingly, 73.3% of the infected individuals had been previously immunized against measles. Since there is no infection division in our hospital, the fever clinics are located in the Emergency Division. In addition, the fever and rash were not recognized as measles symptoms at the beginning of the outbreak. These factors result in delay in isolation and early confirmation of the suspected patients and eventually a measles outbreak in the hospital. Our report highlights the importance of following a two-dose measles vaccine program in people including the healthcare workers. In addition, vigilant attention should be paid to medical staff with clinical fever and rash symptoms to avoid a possible nosocomial transmission of measles infection.
Cerebral Metastasis from a Previously Undiagnosed Appendiceal Adenocarcinoma
Antonio Biroli
2012-01-01
Full Text Available Brain metastases arise in 10%–40% of all cancer patients. Up to one third of the patients do not have previous cancer history. We report a case of a 67-years-old male patient who presented with confusion, tremor, and apraxia. A brain MRI revealed an isolated right temporal lobe lesion. A thorax-abdomen-pelvis CT scan showed no primary lesion. The patient underwent a craniotomy with gross-total resection. Histopathology revealed an intestinal-type adenocarcinoma. A colonoscopy found no primary lesion, but a PET-CT scan showed elevated FDG uptake in the appendiceal nodule. A right hemicolectomy was performed, and the specimen showed a moderately differentiated mucinous appendiceal adenocarcinoma. Whole brain radiotherapy was administrated. A subsequent thorax-abdomen CT scan revealed multiple lung and hepatic metastasis. Seven months later, the patient died of disease progression. In cases of undiagnosed primary lesions, patients present in better general condition, but overall survival does not change. Eventual identification of the primary tumor does not affect survival. PET/CT might be a helpful tool in detecting lesions of the appendiceal region. To the best of our knowledge, such a case was never reported in the literature, and an appendiceal malignancy should be suspected in patients with brain metastasis from an undiagnosed primary tumor.
Measles Outbreak among Previously Immunized Adult Healthcare Workers, China, 2015
Zhang, Zhengyi; Zhao, Yuan; Yang, Lili; Lu, Changhong; Meng, Ying; Guan, Xiaoli; An, Hongjin; Zhang, Meizhong; Guo, Wenqin; Shang, Bo; Yu, Jing
2016-01-01
Measles is caused by measles virus belonging to genus Morbillivirus of the family Paramyxoviridae. Vaccination has played a critical role in controlling measles infection worldwide. However, in the recent years, outbreaks of measles infection still occur in many developing countries. Here, we report an outbreak of measles among healthcare workers and among the 60 measles infected patients 50 were healthcare workers including doctors, nurses, staff, and medics. Fifty-one patients (85%) tested positive for IgM antibodies against the measles virus and 50 patients (83.3%) tested positive for measles virus RNA. Surprisingly, 73.3% of the infected individuals had been previously immunized against measles. Since there is no infection division in our hospital, the fever clinics are located in the Emergency Division. In addition, the fever and rash were not recognized as measles symptoms at the beginning of the outbreak. These factors result in delay in isolation and early confirmation of the suspected patients and eventually a measles outbreak in the hospital. Our report highlights the importance of following a two-dose measles vaccine program in people including the healthcare workers. In addition, vigilant attention should be paid to medical staff with clinical fever and rash symptoms to avoid a possible nosocomial transmission of measles infection. PMID:27366157
Motivational activities based on previous knowledge of students
García, J. A.; Gómez-Robledo, L.; Huertas, R.; Perales, F. J.
2014-07-01
Academic results depend strongly on the individual circumstances of students: background, motivation and aptitude. We think that academic activities conducted to increase motivation must be tuned to the special situation of the students. Main goal of this work is analyze the students in the first year of the Degree in Optics and Optometry in the University of Granada and the suitability of an activity designed for those students. Initial data were obtained from a survey inquiring about the reasons to choose this degree, their knowledge of it, and previous academic backgrounds. Results show that: 1) the group is quite heterogeneous, since students have very different background. 2) Reasons to choose the Degree in Optics and Optometry are also very different, and in many cases were selected as a second option. 3) Knowledge and motivations about the Degree are in general quite low. Trying to increase the motivation of the students we designed an academic activity in which we show different topics studied in the Degree. Results show that students that have been involved in this activity are the most motivated and most satisfied with their election of the degree.
Characterization of surface EMG signals using improved approximate entropy
CHEN Wei-ting; WANG Zhi-zhong; REN Xiao-mei
2006-01-01
An improved approximate entropy (ApEn) is presented and applied to characterize surface electromyography (sEMG)signals. In most previous experiments using nonlinear dynamic analysis, this certain processing was often confronted with the problem of insufficient data points and noisy circumstances, which led to unsatisfactory results. Compared with fractal dimension as well as the standard ApEn, the improved ApEn can extract information underlying sEMG signals more efficiently and accurately. The method introduced here can also be applied to other medium-sized and noisy physiological signals.
Natural orbit approximations in single power-law potentials
Struck, Curtis
2015-01-01
In a previous paper, I demonstrated the accuracy of simple, precessing, power ellipse (p-ellipse) approximations to orbits of low-to-moderate eccentricity in power-law potentials. Here, I explore several extensions of these approximations to improve accuracy, especially for nearly radial orbits. (1) It is found that moderately improved orbital fits can be achieved with higher order perturbation expansions (in eccentricity), with the addition of `harmonic' terms to the solution. (2) Alternately, a matching of the extreme radial excursions of an orbit can be imposed, and a more accurate estimate of the eccentricity parameter is obtained. However, the error in the precession frequency is usually increased. (3) A correction function of small magnitude corrects the frequency problem. With this correction, even first-order approximations yield excellent fits at quite high eccentricity over a range of potential indices that includes flat and falling rotation-curve cases. (4) Adding a first harmonic term to fit the breadth of the orbital loops, and determining the fundamental and harmonic coefficients by matching to three orbital positions further improves the fit. With a couple of additional small corrections, one obtains excellent fits to orbits with radial ranges of more than a thousand for some potentials. These simple corrections to the basic p-ellipse are basically in the form of several successive approximations, and can provide high accuracy. They suggest new results including that the apsidal precession rate scales approximately as log(1 - e) at very high eccentricities e. New insights are also provided on the occurrence of periodic orbits in various potentials, especially at high eccentricity.
Hybrid diffusion approximation in highly absorbing media and its effects of source approximation
Huijuan Tian; Ying Liu; Lijun Wang; Yuhui Zhang; Lifeng Xiao
2009-01-01
A modified diffusion approximation model called the hybrid diffusion approximation that can be used for highly absorbing media is investigated.The analytic solution of the hybrid diffusion approximation for reflectance in two-source approximation and steady-state case with extrapolated boundary is obtained.The effects of source approximation on the analytic solution are investigated,and it is validated that two-source approximation in highly absorbing media to describe the optical properties of biological tissue is necessary.Monte Carlo simulation of recovering optical parameters from reflectant data is done with the use of this model.The errors of recovering μa and μ's are smaller than 15% for the reduced albedo between 0.77 and 0.5 with the source-detector separation of 0.4-3 ram.
Kaw Bing Chua; Gary Crameri; Alex Hyatt; Meng Yu; Mohd Rosli Tompang; Juliana Rosli; Jennifer McEachern; Sandra Crameri; Verasingam Kumarasamy; Bryan T. Eaton; Lin-Fa Wang
2007-01-01
.... Here, we report a previously unknown reovirus (named "Melaka virus") isolated from a 39-year-old male patient in Melaka, Malaysia, who was suffering from high fever and acute respiratory disease at the time of virus isolation...
Carotid surgery following previous carotid endarterectomy is safe and effective.
Abou-Zamzam, Ahmed M; Moneta, Gregory L; Landry, Gregory J; Yeager, Richard A; Edwards, James M; McConnell, Donald B; Taylor, Lloyd M; Porter, John M
2002-01-01
With the perceived high risk of repeat carotid surgery, carotid angioplasty and stenting have been advocated recently as the preferred treatment of recurrent carotid disease following carotid endarterectomy. An experience with the operative treatment of recurrent carotid disease to document the risks and benefits of this procedure is presented. A review of a prospectively acquired vascular registry over a 10-year period (Jan. 1990-Jan. 2000) was undertaken to identify patients undergoing repeat carotid surgery following previous carotid endarterectomy. All patients were treated with repeat carotid endarterectomy, carotid interposition graft, or subclavian-carotid bypass. The perioperative stroke and death rate, operative complications, life-table freedom from stroke, and rates of recurrent stenosis were documented. During the study period 56 patients underwent repeat carotid surgery, comprising 6% of all carotid operations during this period. The indication for operation was symptomatic disease recurrence in 41 cases (73%) and asymptomatic recurrent stenosis >/=80% in 15 cases (27%). The average interval from the prior carotid endarterectomy to the repeat operation was 78 months (range 3 weeks-297 months). The operations performed included repeat carotid endarterectomy with patch angioplasty in 31 cases (55%), interposition grafts in 19 cases (34%), and subclavian-carotid bypass in 6 cases (11%). There were three perioperative strokes with one resulting in death for a perioperative stroke and death rate of 5.4%. One minor transient cranial nerve (CN IX) injury occurred. Mean follow-up was 29 months (range, 1-116 months). Life-table freedom from stroke was 95% at 1 year and 90% at 5 years. Recurrent stenosis (>/=80%) developed in three patients (5.4%) during follow-up, including one internal carotid artery occlusion. Two patients (3.6%) underwent repeat surgery. Repeat surgery for recurrent cerebrovascular disease following carotid endarterectomy is safe and
Sköld, U M
2016-12-01
Approximal surfaces are a focal point for caries prevention among adolescents in Sweden and the aims of this study were therefore to evaluate approximal caries incidence and caries progression among adolescents with and without a three-year school-based fluoride varnish programme in relation to approximal caries prevalence at baseline. In all, 758 (89%) 13-year-olds completed the three-year randomised controlled trial. They all used fluoride toothpaste at home and had regular dental check-ups at the public dental clinics. The mean approximal caries incidence for the adolescents who were caries free on these surfaces at baseline was 0.13 (SD 0.54) in the fluoride varnish group and 0.79 (1.93) in the control group. The corresponding values for those who had caries at baseline in these groups were 1.29 (2.21) and 2.62 (3.22) respectively. The latter two groups also had 0.34 (1.00) and 0.70 (1.13) approximal enamel lesions that progressed. All differences were statistically significant (p⟨0.001). Among those individuals who had approximal caries at baseline, double the number of early approximal enamel lesions in the control group progressed compared with the fluoride varnish group. The school-based fluoride varnish programme inhibited new approximal lesions to a great extent and effectively kept approximal enamel lesions within the enamel among 13-16-year-olds. It is therefore recommended that such a programme is warranted when the approximal surfaces are still caries free in order to keep these surfaces free from caries and keep upcoming approximal enamel lesions within the enamel.
Polynomial approximation and cubature at approximate Fekete and Leja points of the cylinder
De Marchi, Stefano
2011-01-01
The paper deals with polynomial interpolation, least-square approximation and cubature of functions defined on the rectangular cylinder, $K=D\\times [-1,1]$, with $D$ the unit disk. The nodes used for these processes are the {\\it Approximate Fekete Points} (AFP) and the {\\it Discrete Leja Points} (DLP) extracted from suitable {\\it Weakly Admissible Meshes} (WAMs) of the cylinder. From the analysis of the growth of the Lebesgue constants, approximation and cubature errors, we show that the AFP and the DLP extracted from WAM are good points for polynomial approximation and numerical integration of functions defined on the cylinder.
Ju, JongDoo [Department of Nuclear Engineering and Radiological Sciences, The University of Michigan, Ann Arbor, MI (United States); Atzmon, Michael, E-mail: atzmon@umich.edu [Department of Nuclear Engineering and Radiological Sciences, The University of Michigan, Ann Arbor, MI (United States); Department of Materials Science and Engineering, The University of Michigan, Ann Arbor, MI (United States)
2015-09-15
Highlights: • We simulate measured activation energy spectra for anelastic relaxation in metallic glasses. • Simulated spectra exhibit the same shape as earlier data obtained by temperature stepping. • The drop previously observed at high activation free energy is an artifact of the measurements. - Abstract: For many years, the only experimental activation free energy spectrum for shear transformations in metallic glasses had been obtained by quenching from high temperature during creep, followed by temperature stepping (Argon and Kuo, 1980). We show that the approximation associated with attributing a single activation energy to each temperature leads to an artificial drop in the spectrum at high activation energies. The detailed spectra of potential shear transformation zones we have recently obtained, which exhibit an atomically quantized hierarchy and are monotonic, lead to the same spectrum shape as obtained by Argon and Kuo when the approximation inherent to the temperature stepping method is applied.
Efficient Method to Approximately Solve Retrial Systems with Impatience
Jose Manuel Gimenez-Guzman
2012-01-01
Full Text Available We present a novel technique to solve multiserver retrial systems with impatience. Unfortunately these systems do not present an exact analytic solution, so it is mandatory to resort to approximate techniques. This novel technique does not rely on the numerical solution of the steady-state Kolmogorov equations of the Continuous Time Markov Chain as it is common for this kind of systems but it considers the system in its Markov Decision Process setting. This technique, known as value extrapolation, truncates the infinite state space using a polynomial extrapolation method to approach the states outside the truncated state space. A numerical evaluation is carried out to evaluate this technique and to compare its performance with previous techniques. The obtained results show that value extrapolation greatly outperforms the previous approaches appeared in the literature not only in terms of accuracy but also in terms of computational cost.
Technical Note: Approximate Bayesian parameterization of a complex tropical forest model
F. Hartig
2013-08-01
Full Text Available Inverse parameter estimation of process-based models is a long-standing problem in ecology and evolution. A key problem of inverse parameter estimation is to define a metric that quantifies how well model predictions fit to the data. Such a metric can be expressed by general cost or objective functions, but statistical inversion approaches are based on a particular metric, the probability of observing the data given the model, known as the likelihood. Deriving likelihoods for dynamic models requires making assumptions about the probability for observations to deviate from mean model predictions. For technical reasons, these assumptions are usually derived without explicit consideration of the processes in the simulation. Only in recent years have new methods become available that allow generating likelihoods directly from stochastic simulations. Previous applications of these approximate Bayesian methods have concentrated on relatively simple models. Here, we report on the application of a simulation-based likelihood approximation for FORMIND, a parameter-rich individual-based model of tropical forest dynamics. We show that approximate Bayesian inference, based on a parametric likelihood approximation placed in a conventional MCMC, performs well in retrieving known parameter values from virtual field data generated by the forest model. We analyze the results of the parameter estimation, examine the sensitivity towards the choice and aggregation of model outputs and observed data (summary statistics, and show results from using this method to fit the FORMIND model to field data from an Ecuadorian tropical forest. Finally, we discuss differences of this approach to Approximate Bayesian Computing (ABC, another commonly used method to generate simulation-based likelihood approximations. Our results demonstrate that simulation-based inference, which offers considerable conceptual advantages over more traditional methods for inverse parameter
Traveltime approximations for inhomogeneous HTI media
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.
Approximate inverse preconditioners for general sparse matrices
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.
Approximate Lesion Localization in Dermoscopy Images
Celebi, M Emre; Schaefer, Gerald; Stoecker, William V; 10.1111/j.1600-0846.2009.00357.x
2010-01-01
Background: Dermoscopy is one of the major imaging modalities used in the diagnosis of melanoma and other pigmented skin lesions. Due to the difficulty and subjectivity of human interpretation, automated analysis of dermoscopy images has become an important research area. Border detection is often the first step in this analysis. Methods: In this article, we present an approximate lesion localization method that serves as a preprocessing step for detecting borders in dermoscopy images. In this method, first the black frame around the image is removed using an iterative algorithm. The approximate location of the lesion is then determined using an ensemble of thresholding algorithms. Results: The method is tested on a set of 428 dermoscopy images. The localization error is quantified by a metric that uses dermatologist determined borders as the ground truth. Conclusion: The results demonstrate that the method presented here achieves both fast and accurate localization of lesions in dermoscopy images.
Performance of a Distributed Stochastic Approximation Algorithm
Bianchi, Pascal; Hachem, Walid
2012-01-01
In this paper, a distributed stochastic approximation algorithm is studied. Applications of such algorithms include decentralized estimation, optimization, control or computing. The algorithm consists in two steps: a local step, where each node in a network updates a local estimate using a stochastic approximation algorithm with decreasing step size, and a gossip step, where a node computes a local weighted average between its estimates and those of its neighbors. Convergence of the estimates toward a consensus is established under weak assumptions. The approach relies on two main ingredients: the existence of a Lyapunov function for the mean field in the agreement subspace, and a contraction property of the random matrices of weights in the subspace orthogonal to the agreement subspace. A second order analysis of the algorithm is also performed under the form of a Central Limit Theorem. The Polyak-averaged version of the algorithm is also considered.
Approximate gauge symemtry of composite vector bosons
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.
Quasi-chemical approximation for polyatomic mixtures
Dávila, M V; Matoz-Fernandez, D A; Ramirez-Pastor, A J
2016-01-01
The statistical thermodynamics of binary mixtures of polyatomic species was developed on a generalization in the spirit of the lattice-gas model and the quasi-chemical approximation (QCA). The new theoretical framework is obtained by combining: (i) the exact analytical expression for the partition function of non-interacting mixtures of linear $k$-mers and $l$-mers (species occupying $k$ sites and $l$ sites, respectively) adsorbed in one dimension, and its extension to higher dimensions; and (ii) a generalization of the classical QCA for multicomponent adsorbates and multisite-occupancy adsorption. The process is analyzed through the partial adsorption isotherms corresponding to both species of the mixture. Comparisons with analytical data from Bragg-Williams approximation (BWA) and Monte Carlo simulations are performed in order to test the validity of the theoretical model. Even though a good fitting is obtained from BWA, it is found that QCA provides a more accurate description of the phenomenon of adsorpti...
Improved Approximations for Some Polymer Extension Models
Petrosyan, Rafayel
2016-01-01
We propose approximations for force-extension dependencies for the freely jointed chain (FJC) and worm-like chain (WLC) models as well as for extension-force dependence for the WLC model. Proposed expressions show less than 1% relative error in the useful range of the corresponding variables. These results can be applied for fitting force-extension curves obtained in molecular force spectroscopy experiments. Particularly they can be useful for cases where one has geometries of springs in series and/or in parallel where particular combination of expressions should be used for fitting the data. All approximations have been obtained following the same procedure of determining the asymptotes and then reducing the relative error of that expression by adding an appropriate term obtained from fitting its absolute error.
Regularized Laplacian Estimation and Fast Eigenvector Approximation
Perry, Patrick O
2011-01-01
Recently, Mahoney and Orecchia demonstrated that popular diffusion-based procedures to compute a quick \\emph{approximation} to the first nontrivial eigenvector of a data graph Laplacian \\emph{exactly} solve certain regularized Semi-Definite Programs (SDPs). In this paper, we extend that result by providing a statistical interpretation of their approximation procedure. Our interpretation will be analogous to the manner in which $\\ell_2$-regularized or $\\ell_1$-regularized $\\ell_2$-regression (often called Ridge regression and Lasso regression, respectively) can be interpreted in terms of a Gaussian prior or a Laplace prior, respectively, on the coefficient vector of the regression problem. Our framework will imply that the solutions to the Mahoney-Orecchia regularized SDP can be interpreted as regularized estimates of the pseudoinverse of the graph Laplacian. Conversely, it will imply that the solution to this regularized estimation problem can be computed very quickly by running, e.g., the fast diffusion-base...
On approximative solutions of multistopping problems
Faller, Andreas; 10.1214/10-AAP747
2012-01-01
In this paper, we consider multistopping problems for finite discrete time sequences $X_1,...,X_n$. $m$-stops are allowed and the aim is to maximize the expected value of the best of these $m$ stops. The random variables are neither assumed to be independent not to be identically distributed. The basic assumption is convergence of a related imbedded point process to a continuous time Poisson process in the plane, which serves as a limiting model for the stopping problem. The optimal $m$-stopping curves for this limiting model are determined by differential equations of first order. A general approximation result is established which ensures convergence of the finite discrete time $m$-stopping problem to that in the limit model. This allows the construction of approximative solutions of the discrete time $m$-stopping problem. In detail, the case of i.i.d. sequences with discount and observation costs is discussed and explicit results are obtained.
Numerical and approximate solutions for plume rise
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).
Approximated solutions to Born-Infeld dynamics
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.
SOME CONVERSE RESULTS ON ONESIDED APPROXIMATION: JUSTIFICATIONS
Wang Jianli; Zhou Songping
2003-01-01
The present paper deals with best onesided approximation rate in Lp spaces ～En (f)Lp of f ∈ C2π. Although it is clear that the estimate ～En(f)Lp≤C ‖f‖ Lp cannot be correct for all f ∈ Lp2π in case p＜∞, the question whether ～En (f)Lp ≤Cω (f, n-1 )Lp or ～En(f)Lp ≤CEn(f)Lp holds for f ∈ C2π remains totally untouched.Therefore it forms a basic problem to justify onesided approximation. The present paper will provide an answer to settle down the basis.