WorldWideScience

Sample records for recursive partitioning analysis-based

  1. Molecular-based recursive partitioning analysis model for glioblastoma in the temozolomide era a correlative analysis based on nrg oncology RTOG 0525

    NARCIS (Netherlands)

    Bell, Erica Hlavin; Pugh, Stephanie L.; McElroy, Joseph P.; Gilbert, Mark R.; Mehta, Minesh; Klimowicz, Alexander C.; Magliocco, Anthony; Bredel, Markus; Robe, Pierre; Grosu, Anca L.; Stupp, Roger; Curran, Walter; Becker, Aline P.; Salavaggione, Andrea L.; Barnholtz-Sloan, Jill S.; Aldape, Kenneth; Blumenthal, Deborah T.; Brown, Paul D.; Glass, Jon; Souhami, Luis; Lee, R. Jeffrey; Brachman, David; Flickinger, John; Won, Minhee; Chakravarti, Arnab

    2017-01-01

    IMPORTANCE: There is a need for a more refined, molecularly based classification model for glioblastoma (GBM) in the temozolomide era. OBJECTIVE: To refine the existing clinically based recursive partitioning analysis (RPA) model by incorporating molecular variables. DESIGN, SETTING, AND

  2. Model-based Recursive Partitioning for Subgroup Analyses

    OpenAIRE

    Seibold, Heidi; Zeileis, Achim; Hothorn, Torsten

    2016-01-01

    The identification of patient subgroups with differential treatment effects is the first step towards individualised treatments. A current draft guideline by the EMA discusses potentials and problems in subgroup analyses and formulated challenges to the development of appropriate statistical procedures for the data-driven identification of patient subgroups. We introduce model-based recursive partitioning as a procedure for the automated detection of patient subgroups that are identifiable by...

  3. Model-Based Recursive Partitioning for Subgroup Analyses.

    Science.gov (United States)

    Seibold, Heidi; Zeileis, Achim; Hothorn, Torsten

    2016-05-01

    The identification of patient subgroups with differential treatment effects is the first step towards individualised treatments. A current draft guideline by the EMA discusses potentials and problems in subgroup analyses and formulated challenges to the development of appropriate statistical procedures for the data-driven identification of patient subgroups. We introduce model-based recursive partitioning as a procedure for the automated detection of patient subgroups that are identifiable by predictive factors. The method starts with a model for the overall treatment effect as defined for the primary analysis in the study protocol and uses measures for detecting parameter instabilities in this treatment effect. The procedure produces a segmented model with differential treatment parameters corresponding to each patient subgroup. The subgroups are linked to predictive factors by means of a decision tree. The method is applied to the search for subgroups of patients suffering from amyotrophic lateral sclerosis that differ with respect to their Riluzole treatment effect, the only currently approved drug for this disease.

  4. The prostate cancer risk stratification (ProCaRS) project: Recursive partitioning risk stratification analysis

    International Nuclear Information System (INIS)

    Rodrigues, George; Lukka, Himu; Warde, Padraig; Brundage, Michael; Souhami, Luis; Crook, Juanita; Cury, Fabio; Catton, Charles; Mok, Gary; Martin, Andre-Guy; Vigneault, Eric; Morris, Jim; Warner, Andrew; Gonzalez Maldonado, Sandra; Pickles, Tom

    2013-01-01

    Background: The Genitourinary Radiation Oncologists of Canada (GUROC) published a three-group risk stratification (RS) system to assist prostate cancer decision-making in 2001. The objective of this project is to use the ProCaRS database to statistically model the predictive accuracy and clinical utility of a proposed new multi-group RS schema. Methods: The RS analyses utilized the ProCaRS database that consists of 7974 patients from four Canadian institutions. Recursive partitioning analysis (RPA) was utilized to explore the sub-stratification of groups defined by the existing three-group GUROC scheme. 10-fold cross-validated C-indices and the Net Reclassification Index were both used to assess multivariable models and compare the predictive accuracy of existing and proposed RS systems, respectively. Results: The recursive partitioning analysis has suggested that the existing GUROC classification system could be altered to accommodate as many as six separate and statistical unique groups based on differences in BFFS (C-index 0.67 and AUC 0.70). GUROC low-risk patients would be divided into new favorable-low and low-risk groups based on PSA ⩽6 and PSA >6. GUROC intermediate-risk patients can be subclassified into low-intermediate and high-intermediate groups. GUROC high-intermediate-risk is defined as existing GUROC intermediate-risk with PSA >=10 AND either T2b/c disease or T1T2a disease with Gleason 7. GUROC high-risk patients would be subclassified into an additional extreme-risk group (GUROC high-risk AND (positive cores ⩾87.5% OR PSA >30). Conclusions: Proposed RS subcategories have been identified by a RPA of the ProCaRS database

  5. Recursive analysis

    CERN Document Server

    Goodstein, R L

    2010-01-01

    Recursive analysis develops natural number computations into a framework appropriate for real numbers. This text is based upon primary recursive arithmetic and presents a unique combination of classical analysis and intuitional analysis. Written by a master in the field, it is suitable for graduate students of mathematics and computer science and can be read without a detailed knowledge of recursive arithmetic.Introductory chapters on recursive convergence and recursive and relative continuity are succeeded by explorations of recursive and relative differentiability, the relative integral, and

  6. Identifying risk profiles for childhood obesity using recursive partitioning based on individual, familial, and neighborhood environment factors.

    Science.gov (United States)

    Van Hulst, Andraea; Roy-Gagnon, Marie-Hélène; Gauvin, Lise; Kestens, Yan; Henderson, Mélanie; Barnett, Tracie A

    2015-02-15

    Few studies consider how risk factors within multiple levels of influence operate synergistically to determine childhood obesity. We used recursive partitioning analysis to identify unique combinations of individual, familial, and neighborhood factors that best predict obesity in children, and tested whether these predict 2-year changes in body mass index (BMI). Data were collected in 2005-2008 and in 2008-2011 for 512 Quebec youth (8-10 years at baseline) with a history of parental obesity (QUALITY study). CDC age- and sex-specific BMI percentiles were computed and children were considered obese if their BMI was ≥95th percentile. Individual (physical activity and sugar-sweetened beverage intake), familial (household socioeconomic status and measures of parental obesity including both BMI and waist circumference), and neighborhood (disadvantage, prestige, and presence of parks, convenience stores, and fast food restaurants) factors were examined. Recursive partitioning, a method that generates a classification tree predicting obesity based on combined exposure to a series of variables, was used. Associations between resulting varying risk group membership and BMI percentile at baseline and 2-year follow up were examined using linear regression. Recursive partitioning yielded 7 subgroups with a prevalence of obesity equal to 8%, 11%, 26%, 28%, 41%, 60%, and 63%, respectively. The 2 highest risk subgroups comprised i) children not meeting physical activity guidelines, with at least one BMI-defined obese parent and 2 abdominally obese parents, living in disadvantaged neighborhoods without parks and, ii) children with these characteristics, except with access to ≥1 park and with access to ≥1 convenience store. Group membership was strongly associated with BMI at baseline, but did not systematically predict change in BMI. Findings support the notion that obesity is predicted by multiple factors in different settings and provide some indications of potentially

  7. Risk-group definition by recursive partitioning analysis of patients with squamous cell head and neck carcinoma treated with surgery and postoperative radiotherapy

    NARCIS (Netherlands)

    Langendijk, JA; Slotman, BJ; van der Waal, [No Value; Doornaert, P; Berkof, J; Leemans, CR

    2005-01-01

    BACKGROUND. The objective of this study was to define different prognostic groups with regard to locoregional control (LRC) derived from recursive partitioning analysis (RPA). METHODS. Eight hundred one patients with squamous cell head and neck carcinoma underwent with primary surgery and received

  8. Prognostic Classification Factors Associated With Development of Multiple Autoantibodies, Dysglycemia, and Type 1 Diabetes?A Recursive Partitioning Analysis

    OpenAIRE

    Xu, Ping; Krischer, Jeffrey P.

    2016-01-01

    OBJECTIVE To define prognostic classification factors associated with the progression from single to multiple autoantibodies, multiple autoantibodies to dysglycemia, and dysglycemia to type 1 diabetes onset in relatives of individuals with type 1 diabetes. RESEARCH DESIGN AND METHODS Three distinct cohorts of subjects from the Type 1 Diabetes TrialNet Pathway to Prevention Study were investigated separately. A recursive partitioning analysis (RPA) was used to determine the risk classes. Clini...

  9. Multicenter validation of recursive partitioning analysis classification for patients with squamous cell head and neck carcinoma treated with surgery and postoperative radiotherapy.

    NARCIS (Netherlands)

    Jonkman, A.; Kaanders, J.H.A.M.; Terhaard, C.H.J.; Hoebers, F.J.; Ende, P.L. van den; Wijers, O.B.; Verhoef, C.G.; Jong, M. de; Leemans, C.R.; Langendijk, J.A.

    2007-01-01

    PURPOSE: To validate the recursive partitioning analysis (RPA) classification system for squamous cell head and neck cancer as recently reported by the VU University Medical Center. METHODS AND MATERIALS: In eight Dutch head and neck cancer centers, data necessary to classify patients according to

  10. Binary recursive partitioning: background, methods, and application to psychology.

    Science.gov (United States)

    Merkle, Edgar C; Shaffer, Victoria A

    2011-02-01

    Binary recursive partitioning (BRP) is a computationally intensive statistical method that can be used in situations where linear models are often used. Instead of imposing many assumptions to arrive at a tractable statistical model, BRP simply seeks to accurately predict a response variable based on values of predictor variables. The method outputs a decision tree depicting the predictor variables that were related to the response variable, along with the nature of the variables' relationships. No significance tests are involved, and the tree's 'goodness' is judged based on its predictive accuracy. In this paper, we describe BRP methods in a detailed manner and illustrate their use in psychological research. We also provide R code for carrying out the methods.

  11. Predicting cannabis abuse screening test (CAST scores: a recursive partitioning analysis using survey data from Czech Republic, Italy, the Netherlands and Sweden.

    Directory of Open Access Journals (Sweden)

    Matthijs Blankers

    Full Text Available Cannabis is Europe's most commonly used illicit drug. Some users do not develop dependence or other problems, whereas others do. Many factors are associated with the occurrence of cannabis-related disorders. This makes it difficult to identify key risk factors and markers to profile at-risk cannabis users using traditional hypothesis-driven approaches. Therefore, the use of a data-mining technique called binary recursive partitioning is demonstrated in this study by creating a classification tree to profile at-risk users.59 variables on cannabis use and drug market experiences were extracted from an internet-based survey dataset collected in four European countries (Czech Republic, Italy, Netherlands and Sweden, n = 2617. These 59 potential predictors of problematic cannabis use were used to partition individual respondents into subgroups with low and high risk of having a cannabis use disorder, based on their responses on the Cannabis Abuse Screening Test. Both a generic model for the four countries combined and four country-specific models were constructed.Of the 59 variables included in the first analysis step, only three variables were required to construct a generic partitioning model to classify high risk cannabis users with 65-73% accuracy. Based on the generic model for the four countries combined, the highest risk for cannabis use disorder is seen in participants reporting a cannabis use on more than 200 days in the last 12 months. In comparison to the generic model, the country-specific models led to modest, non-significant improvements in classification accuracy, with an exception for Italy (p = 0.01.Using recursive partitioning, it is feasible to construct classification trees based on only a few variables with acceptable performance to classify cannabis users into groups with low or high risk of meeting criteria for cannabis use disorder. The number of cannabis use days in the last 12 months is the most relevant variable

  12. Understanding who benefits at each step in an internet-based diabetes self-management program: application of a recursive partitioning approach.

    Science.gov (United States)

    Glasgow, Russell E; Strycker, Lisa A; King, Diane K; Toobert, Deborah J

    2014-02-01

    Efforts to predict success in chronic disease management programs have been generally unsuccessful. To identify patient subgroups associated with success at each of 6 steps in a diabetes self-management (DSM) program. Using data from a randomized trial, recursive partitioning with signal detection analysis was used to identify subgroups associated with 6 sequential steps of program success: agreement to participate, completion of baseline, initial website engagement, 4-month behavior change, later engagement, and longer-term maintenance. The study was conducted in 5 primary care clinics within Kaiser Permanente Colorado. Different numbers of patients participated in each step, including 2076, 544, 270, 219, 127, and 89. All measures available were used to address success at each step. Intervention. Participants were randomized to receive either enhanced usual care or 1 of 2 Internet-based DSM programs: 1) self-administered, computer-assisted self-management and 2) the self-administered program with the addition of enhanced social support. Two sets of potential predictor variables and 6 dichotomous outcomes were created. Signal detection analysis differentiated successful and unsuccessful subgroups at all but the final step. Different patient subgroups were associated with success at these different steps. Demographic factors (education, ethnicity, income) were associated with initial participation but not with later steps, and the converse was true of health behavior variables. Analyses were limited to one setting, and the sample sizes for some of the steps were modest. Signal detection and recursive partitioning methods may be useful for identifying subgroups that are more or less successful at different steps of intervention and may aid in understanding variability in outcomes.

  13. Model-based clustering of DNA methylation array data: a recursive-partitioning algorithm for high-dimensional data arising as a mixture of beta distributions

    Directory of Open Access Journals (Sweden)

    Wiemels Joseph

    2008-09-01

    Full Text Available Abstract Background Epigenetics is the study of heritable changes in gene function that cannot be explained by changes in DNA sequence. One of the most commonly studied epigenetic alterations is cytosine methylation, which is a well recognized mechanism of epigenetic gene silencing and often occurs at tumor suppressor gene loci in human cancer. Arrays are now being used to study DNA methylation at a large number of loci; for example, the Illumina GoldenGate platform assesses DNA methylation at 1505 loci associated with over 800 cancer-related genes. Model-based cluster analysis is often used to identify DNA methylation subgroups in data, but it is unclear how to cluster DNA methylation data from arrays in a scalable and reliable manner. Results We propose a novel model-based recursive-partitioning algorithm to navigate clusters in a beta mixture model. We present simulations that show that the method is more reliable than competing nonparametric clustering approaches, and is at least as reliable as conventional mixture model methods. We also show that our proposed method is more computationally efficient than conventional mixture model approaches. We demonstrate our method on the normal tissue samples and show that the clusters are associated with tissue type as well as age. Conclusion Our proposed recursively-partitioned mixture model is an effective and computationally efficient method for clustering DNA methylation data.

  14. Validation of the RTOG recursive partitioning analysis (RPA) classification for brain metastases

    International Nuclear Information System (INIS)

    Gaspar, Laurie E.; Scott, Charles; Murray, Kevin; Curran, Walter

    2000-01-01

    Purpose: The Radiation Therapy Oncology Group (RTOG) previously developed three prognostic classes for brain metastases using recursive partitioning analysis (RPA) of a large database. These classes were based on Karnofsky performance status (KPS), primary tumor status, presence of extracranial system metastases, and age. An analysis of RTOG 91-04, a randomized study comparing two dose-fractionation schemes with a comparison to the established RTOG database, was considered important to validate the RPA classes. Methods and Materials: A total of 445 patients were randomized on RTOG 91-04, a Phase III study of accelerated hyperfractionation versus accelerated fractionation. No difference was observed between the two treatment arms with respect to survival. Four hundred thirty-two patients were included in this analysis. The majority of the patients were under age 65, had KPS 70-80, primary tumor controlled, and brain-only metastases. The initial RPA had three classes, but only patients in RPA Classes I and II were eligible for RTOG 91-04. Results: For RPA Class I, the median survival time was 6.2 months and 7.1 months for 91-04 and the database, respectively. The 1-year survival was 29% for 91-04 versus 32% for the database. There was no significant difference in the two survival distributions (p = 0.72). For RPA Class II, the median survival time was 3.8 months for 91-04 versus 4.2 months for the database. The 1-year survival was 12% and 16% for 91-04 and the database, respectively (p = 0.22). Conclusion: This analysis indicates that the RPA classes are valid and reliable for historical comparisons. Both the RTOG and other clinical trial organizers should currently utilize this RPA classification as a stratification factor for clinical trials

  15. Local recurrence after surgery for non-small cell lung cancer: a recursive partitioning analysis of multi-institutional data.

    Science.gov (United States)

    Kelsey, Chris R; Higgins, Kristin A; Peterson, Bercedis L; Chino, Junzo P; Marks, Lawrence B; D'Amico, Thomas A; Varlotto, John M

    2013-10-01

    To define subgroups at high risk of local recurrence (LR) after surgery for non-small cell lung cancer using a recursive partitioning analysis (RPA). This Institutional Review Board-approved study included patients who underwent upfront surgery for I-IIIA non-small cell lung cancer at Duke Cancer Institute (primary set) or at other participating institutions (validation set). The 2 data sets were analyzed separately and identically. Disease recurrence at the surgical margin, ipsilateral hilum, and/or mediastinum was considered an LR. Recursive partitioning was used to build regression trees for the prediction of local recurrence-free survival (LRFS) from standard clinical and pathological factors. LRFS distributions were estimated with the Kaplan-Meier method. The 1411 patients in the primary set had a 5-year LRFS rate of 77% (95% confidence interval [CI], 0.74-0.81), and the 889 patients in the validation set had a 5-year LRFS rate of 76% (95% CI, 0.72-0.80). The RPA of the primary data set identified 3 terminal nodes based on stage and histology. These nodes and their 5-year LRFS rates were as follows: (1) stage I/adenocarcinoma, 87% (95% CI, 0.83-0.90); (2) stage I/squamous or large cell, 72% (95% CI, 0.65-0.79); and (3) stage II-IIIA, 62% (95% CI, 0.55-0.69). The validation RPA identified 3 terminal nodes based on lymphovascular invasion (LVI) and stage: (1) no LVI/stage IA, 82% (95% CI, 0.76-0.88); (2) no LVI/stage IB-IIIA, 73% (95% CI, 0.69-0.80); and (3) LVI, 58% (95% CI, 0.47-0.69). The risk of LR was similar in the primary and validation patient data sets. There was discordance between the 2 data sets regarding the clinical factors that best segregate patients into risk groups. Copyright © 2013 The American Association for Thoracic Surgery. Published by Mosby, Inc. All rights reserved.

  16. Recursive Partitioning Analysis for New Classification of Patients With Esophageal Cancer Treated by Chemoradiotherapy

    International Nuclear Information System (INIS)

    Nomura, Motoo; Shitara, Kohei; Kodaira, Takeshi; Kondoh, Chihiro; Takahari, Daisuke; Ura, Takashi; Kojima, Hiroyuki; Kamata, Minoru; Muro, Kei; Sawada, Satoshi

    2012-01-01

    Background: The 7th edition of the American Joint Committee on Cancer staging system does not include lymph node size in the guidelines for staging patients with esophageal cancer. The objectives of this study were to determine the prognostic impact of the maximum metastatic lymph node diameter (ND) on survival and to develop and validate a new staging system for patients with esophageal squamous cell cancer who were treated with definitive chemoradiotherapy (CRT). Methods: Information on 402 patients with esophageal cancer undergoing CRT at two institutions was reviewed. Univariate and multivariate analyses of data from one institution were used to assess the impact of clinical factors on survival, and recursive partitioning analysis was performed to develop the new staging classification. To assess its clinical utility, the new classification was validated using data from the second institution. Results: By multivariate analysis, gender, T, N, and ND stages were independently and significantly associated with survival (p < 0.05). The resulting new staging classification was based on the T and ND. The four new stages led to good separation of survival curves in both the developmental and validation datasets (p < 0.05). Conclusions: Our results showed that lymph node size is a strong independent prognostic factor and that the new staging system, which incorporated lymph node size, provided good prognostic power, and discriminated effectively for patients with esophageal cancer undergoing CRT.

  17. Assessing the relative importance of correlates of loneliness in later life: Gaining insight using recursive partitioning

    DEFF Research Database (Denmark)

    Ejlskov, Linda; Wulff, Jesper; Bøggild, Henrik

    2017-01-01

    and demographic correlates were poor identifiers of loneliness. The regression tree suggested that loneliness was not raised among those with poor mental wellbeing if they identified their partner as closest confidante and had frequent social contact. CONCLUSION: Recursive partitioning can identify which......OBJECTIVES: Improving the design and targeting of interventions is important for alleviating loneliness among older adults. This requires identifying which correlates are the most important predictors of loneliness. This study demonstrates the use of recursive partitioning in exploring...... the characteristics and assessing the relative importance of correlates of loneliness in older adults. METHOD: Using exploratory regression trees and random forests, we examined combinations and the relative importance of 42 correlates in relation to loneliness at age 68 among 2453 participants from the birth cohort...

  18. Fuzzy 2-partition entropy threshold selection based on Big Bang–Big Crunch Optimization algorithm

    Directory of Open Access Journals (Sweden)

    Baljit Singh Khehra

    2015-03-01

    Full Text Available The fuzzy 2-partition entropy approach has been widely used to select threshold value for image segmenting. This approach used two parameterized fuzzy membership functions to form a fuzzy 2-partition of the image. The optimal threshold is selected by searching an optimal combination of parameters of the membership functions such that the entropy of fuzzy 2-partition is maximized. In this paper, a new fuzzy 2-partition entropy thresholding approach based on the technology of the Big Bang–Big Crunch Optimization (BBBCO is proposed. The new proposed thresholding approach is called the BBBCO-based fuzzy 2-partition entropy thresholding algorithm. BBBCO is used to search an optimal combination of parameters of the membership functions for maximizing the entropy of fuzzy 2-partition. BBBCO is inspired by the theory of the evolution of the universe; namely the Big Bang and Big Crunch Theory. The proposed algorithm is tested on a number of standard test images. For comparison, three different algorithms included Genetic Algorithm (GA-based, Biogeography-based Optimization (BBO-based and recursive approaches are also implemented. From experimental results, it is observed that the performance of the proposed algorithm is more effective than GA-based, BBO-based and recursion-based approaches.

  19. An Introduction to Recursive Partitioning: Rationale, Application, and Characteristics of Classification and Regression Trees, Bagging, and Random Forests

    Science.gov (United States)

    Strobl, Carolin; Malley, James; Tutz, Gerhard

    2009-01-01

    Recursive partitioning methods have become popular and widely used tools for nonparametric regression and classification in many scientific fields. Especially random forests, which can deal with large numbers of predictor variables even in the presence of complex interactions, have been applied successfully in genetics, clinical medicine, and…

  20. Validation of the RTOG recursive partitioning analysis (RPA) classification for small-cell lung cancer-only brain metastases

    International Nuclear Information System (INIS)

    Videtic, Gregory M.M.; Adelstein, David J.; Mekhail, Tarek M.; Rice, Thomas W.; Stevens, Glen H.J.; Lee, S.-Y.; Suh, John H.

    2007-01-01

    Purpose: Radiation Therapy Oncology Group (RTOG) developed a prognostic classification based on a recursive partitioning analysis (RPA) of patient pretreatment characteristics from three completed brain metastases randomized trials. Clinical trials for patients with brain metastases generally exclude small-cell lung cancer (SCLC) cases. We hypothesize that the RPA classes are valid in the setting of SCLC brain metastases. Methods and Materials: A retrospective review of 154 SCLC patients with brain metastases treated between April 1983 and May 2005 was performed. RPA criteria used for class assignment were Karnofsky performance status (KPS), primary tumor status (PT), presence of extracranial metastases (ED), and age. Results: Median survival was 4.9 months, with 4 patients (2.6%) alive at analysis. Median follow-up was 4.7 months (range, 0.3-40.3 months). Median age was 65 (range, 42-85 years). Median KPS was 70 (range, 40-100). Number of patients with controlled PT and no ED was 20 (13%) and with ED, 27 (18%); without controlled PT and ED, 34 (22%) and with ED, 73 (47%). RPA class distribution was: Class I: 8 (5%); Class II: 96 (62%); Class III: 51 (33%). Median survivals (in months) by RPA class were: Class I: 8.6; Class II: 4.2; Class III: 2.3 (p = 0.0023). Conclusions: Survivals for SCLC-only brain metastases replicate the results from the RTOG RPA classification. These classes are therefore valid for brain metastases from SCLC, support the inclusion of SCLC patients in future brain metastases trials, and may also serve as a basis for historical comparisons

  1. Recursive partitioning analysis (RPA) classification predicts survival in patients with brain metastases from sarcoma.

    Science.gov (United States)

    Grossman, Rachel; Ram, Zvi

    2014-12-01

    Sarcoma rarely metastasizes to the brain, and there are no specific treatment guidelines for these tumors. The recursive partitioning analysis (RPA) classification is a well-established prognostic scale used in many malignancies. In this study we assessed the clinical characteristics of metastatic sarcoma to the brain and the validity of the RPA classification system in a subset of 21 patients who underwent surgical resection of metastatic sarcoma to the brain We retrospectively analyzed the medical, radiological, surgical, pathological, and follow-up clinical records of 21 patients who were operated for metastatic sarcoma to the brain between 1996 and 2012. Gliosarcomas, sarcomas of the head and neck with local extension into the brain, and metastatic sarcomas to the spine were excluded from this reported series. The patients' mean age was 49.6 ± 14.2 years (range, 25-75 years) at the time of diagnosis. Sixteen patients had a known history of systemic sarcoma, mostly in the extremities, and had previously received systemic chemotherapy and radiation therapy for their primary tumor. The mean maximal tumor diameter in the brain was 4.9 ± 1.7 cm (range 1.7-7.2 cm). The group's median preoperative Karnofsky Performance Scale was 80, with 14 patients presenting with Karnofsky Performance Scale of 70 or greater. The median overall survival was 7 months (range 0.2-204 months). The median survival time stratified by the Radiation Therapy Oncology Group RPA classes were 31, 7, and 2 months for RPA class I, II, and III, respectively (P = 0.0001). This analysis is the first to support the prognostic utility of the Radiation Therapy Oncology Group RPA classification for sarcoma brain metastases and may be used as a treatment guideline tool in this rare disease. Copyright © 2014 Elsevier Inc. All rights reserved.

  2. Subclassification of Recursive Partitioning Analysis Class II Patients With Brain Metastases Treated Radiosurgically

    Energy Technology Data Exchange (ETDEWEB)

    Yamamoto, Masaaki, E-mail: BCD06275@nifty.com [Katsuta Hospital Mito GammaHouse, Hitachi-naka (Japan); Department of Neurosurgery, Tokyo Women' s Medical University Medical Center East, Tokyo (Japan); Sato, Yasunori [Clinical Research Center, Chiba University Graduate School of Medicine, Chiba (Japan); Serizawa, Toru [Tokyo Gamma Unit Center, Tsukiji Neurologic Clinic, Tokyo (Japan); Kawabe, Takuya [Katsuta Hospital Mito GammaHouse, Hitachi-naka (Japan); Department of Neurosurgery, Kyoto Prefectural University of Medicine Graduate School of Medical Sciences, Kyoto (Japan); Higuchi, Yoshinori [Department of Neurosurgery, Chiba University Graduate School of Medicine, Chiba (Japan); Nagano, Osamu [Gamma Knife House, Chiba Cardiovascular Center, Ichihara (Japan); Barfod, Bierta E. [Katsuta Hospital Mito GammaHouse, Hitachi-naka (Japan); Ono, Junichi [Gamma Knife House, Chiba Cardiovascular Center, Ichihara (Japan); Kasuya, Hidetoshi [Department of Neurosurgery, Tokyo Women' s Medical University Medical Center East, Tokyo (Japan); Urakawa, Yoichi [Katsuta Hospital Mito GammaHouse, Hitachi-naka (Japan)

    2012-08-01

    Purpose: Although the recursive partitioning analysis (RPA) class is generally used for predicting survival periods of patients with brain metastases (METs), the majority of such patients are Class II and clinical factors vary quite widely within this category. This prompted us to divide RPA Class II patients into three subclasses. Methods and Materials: This was a two-institution, institutional review board-approved, retrospective cohort study using two databases: the Mito series (2,000 consecutive patients, comprising 787 women and 1,213 men; mean age, 65 years [range, 19-96 years]) and the Chiba series (1,753 patients, comprising 673 female and 1,080 male patients; mean age, 65 years [range, 7-94 years]). Both patient series underwent Gamma Knife radiosurgery alone, without whole-brain radiotherapy, for brain METs during the same 10-year period, July 1998 through June 2008. The Cox proportional hazard model with a step-wise selection procedure was used for multivariate analysis. Results: In the Mito series, four factors were identified as favoring longer survival: Karnofsky Performance Status (90% to 100% vs. 70% to 80%), tumor numbers (solitary vs. multiple), primary tumor status (controlled vs. not controlled), and non-brain METs (no vs. yes). This new index is the sum of scores (0 and 1) of these four factors: RPA Class II-a, score of 0 or 1; RPA Class II-b, score of 2; and RPA Class II-c, score of 3 or 4. Next, using the Chiba series, we tested whether our index is valid for a different patient group. This new system showed highly statistically significant differences among subclasses in both the Mito series and the Chiba series (p < 0.001 for all subclasses). In addition, this new index was confirmed to be applicable to Class II patients with four major primary tumor sites, that is, lung, breast, alimentary tract, and urogenital organs. Conclusions: Our new grading system should be considered when designing future clinical trials involving brain MET

  3. Symbolic Reachability for Process Algebras with Recursive Data Types

    NARCIS (Netherlands)

    Blom, Stefan; van de Pol, Jan Cornelis; Fitzgerald, J.S.; Haxthausen, A.E.; Yenigun, H.

    2008-01-01

    In this paper, we present a symbolic reachability algorithm for process algebras with recursive data types. Like the various saturation based algorithms of Ciardo et al, the algorithm is based on partitioning of the transition relation into events whose influence is local. As new features, our

  4. The ABCD of topological recursion

    DEFF Research Database (Denmark)

    Andersen, Jorgen Ellegaard; Borot, Gaëtan; Chekhov, Leonid O.

    Kontsevich and Soibelman reformulated and slightly generalised the topological recursion of math-ph/0702045, seeing it as a quantization of certain quadratic Lagrangians in T*V for some vector space V. KS topological recursion is a procedure which takes as initial data a quantum Airy structure...... the 2d TQFT partition function as a special case), non-commutative Frobenius algebras, loop spaces of Frobenius algebras and a Z2-invariant version of the latter. This Z2-invariant version in the case of a semi-simple Frobenius algebra corresponds to the topological recursion of math-ph/0702045....

  5. Space-partition method for the variance-based sensitivity analysis: Optimal partition scheme and comparative study

    International Nuclear Information System (INIS)

    Zhai, Qingqing; Yang, Jun; Zhao, Yu

    2014-01-01

    Variance-based sensitivity analysis has been widely studied and asserted itself among practitioners. Monte Carlo simulation methods are well developed in the calculation of variance-based sensitivity indices but they do not make full use of each model run. Recently, several works mentioned a scatter-plot partitioning method to estimate the variance-based sensitivity indices from given data, where a single bunch of samples is sufficient to estimate all the sensitivity indices. This paper focuses on the space-partition method in the estimation of variance-based sensitivity indices, and its convergence and other performances are investigated. Since the method heavily depends on the partition scheme, the influence of the partition scheme is discussed and the optimal partition scheme is proposed based on the minimized estimator's variance. A decomposition and integration procedure is proposed to improve the estimation quality for higher order sensitivity indices. The proposed space-partition method is compared with the more traditional method and test cases show that it outperforms the traditional one

  6. Prognostic factors in brain metastases: should patients be selected for aggressive treatment according to recursive partitioning analysis (RPA) classes?

    International Nuclear Information System (INIS)

    Nieder, Carsten; Nestle, Ursula; Motaref, Babak; Walter, Karin; Niewald, Marcus; Schnabel, Klaus

    2000-01-01

    Purpose: To determine whether or not Radiation Therapy Oncology Group (RTOG) recursive partitioning analysis (RPA) derived prognostic classes for patients with brain metastases are generally applicable and can be recommended as rational strategy for patient selection for future clinical trials. Inclusion of time to non-CNS death as additional endpoint besides death from any cause might result in further valuable information, as survival limitation due to uncontrolled extracranial disease can be explored. Methods: We performed a retrospective analysis of prognostic factors for survival and time to non-CNS death in 528 patients treated at a single institution with radiotherapy or surgery plus radiotherapy for brain metastases. For this purpose, patients were divided into groups with Karnofsky performance status (KPS) 0.05 for RPA class II versus III). However, it was 8.5 months in RPA class II patients with controlled primary tumor, which was found to be the only prognostic factor for time to non-CNS death in patients with KPS ≥70%. In patients with KPS <70%, no statistically significant prognostic factors were identified for this endpoint. Conclusions: Despite some differences, this analysis essentially confirmed the value of RPA-derived prognostic classes, as published by the RTOG, when survival was chosen as endpoint. RPA class I patients seem to be most likely to profit from aggressive treatment strategies and should be included in appropriate clinical trials. However, their number appears to be very limited. Considering time to non-CNS death, our results suggest that certain patients in RPA class II also might benefit from increased local control of brain metastases

  7. Prognostic Classification Factors Associated With Development of Multiple Autoantibodies, Dysglycemia, and Type 1 Diabetes-A Recursive Partitioning Analysis.

    Science.gov (United States)

    Xu, Ping; Krischer, Jeffrey P

    2016-06-01

    To define prognostic classification factors associated with the progression from single to multiple autoantibodies, multiple autoantibodies to dysglycemia, and dysglycemia to type 1 diabetes onset in relatives of individuals with type 1 diabetes. Three distinct cohorts of subjects from the Type 1 Diabetes TrialNet Pathway to Prevention Study were investigated separately. A recursive partitioning analysis (RPA) was used to determine the risk classes. Clinical characteristics, including genotype, antibody titers, and metabolic markers were analyzed. Age and GAD65 autoantibody (GAD65Ab) titers defined three risk classes for progression from single to multiple autoantibodies. The 5-year risk was 11% for those subjects >16 years of age with low GAD65Ab titers, 29% for those ≤16 years of age with low GAD65Ab titers, and 45% for those subjects with high GAD65Ab titers regardless of age. Progression to dysglycemia was associated with islet antigen 2 Ab titers, and 2-h glucose and fasting C-peptide levels. The 5-year risk is 28%, 39%, and 51% for respective risk classes defined by the three predictors. Progression to type 1 diabetes was associated with the number of positive autoantibodies, peak C-peptide level, HbA1c level, and age. Four risk classes defined by RPA had a 5-year risk of 9%, 33%, 62%, and 80%, respectively. The use of RPA offered a new classification approach that could predict the timing of transitions from one preclinical stage to the next in the development of type 1 diabetes. Using these RPA classes, new prevention techniques can be tailored based on the individual prognostic risk characteristics at different preclinical stages. © 2016 by the American Diabetes Association. Readers may use this article as long as the work is properly cited, the use is educational and not for profit, and the work is not altered.

  8. Prognostic Classification Factors Associated With Development of Multiple Autoantibodies, Dysglycemia, and Type 1 Diabetes—A Recursive Partitioning Analysis

    Science.gov (United States)

    Krischer, Jeffrey P.

    2016-01-01

    OBJECTIVE To define prognostic classification factors associated with the progression from single to multiple autoantibodies, multiple autoantibodies to dysglycemia, and dysglycemia to type 1 diabetes onset in relatives of individuals with type 1 diabetes. RESEARCH DESIGN AND METHODS Three distinct cohorts of subjects from the Type 1 Diabetes TrialNet Pathway to Prevention Study were investigated separately. A recursive partitioning analysis (RPA) was used to determine the risk classes. Clinical characteristics, including genotype, antibody titers, and metabolic markers were analyzed. RESULTS Age and GAD65 autoantibody (GAD65Ab) titers defined three risk classes for progression from single to multiple autoantibodies. The 5-year risk was 11% for those subjects >16 years of age with low GAD65Ab titers, 29% for those ≤16 years of age with low GAD65Ab titers, and 45% for those subjects with high GAD65Ab titers regardless of age. Progression to dysglycemia was associated with islet antigen 2 Ab titers, and 2-h glucose and fasting C-peptide levels. The 5-year risk is 28%, 39%, and 51% for respective risk classes defined by the three predictors. Progression to type 1 diabetes was associated with the number of positive autoantibodies, peak C-peptide level, HbA1c level, and age. Four risk classes defined by RPA had a 5-year risk of 9%, 33%, 62%, and 80%, respectively. CONCLUSIONS The use of RPA offered a new classification approach that could predict the timing of transitions from one preclinical stage to the next in the development of type 1 diabetes. Using these RPA classes, new prevention techniques can be tailored based on the individual prognostic risk characteristics at different preclinical stages. PMID:27208341

  9. Recursive partition analysis of peritoneal and systemic recurrence in patients with gastric cancer who underwent D2 gastrectomy: Implications for neoadjuvant therapy consideration.

    Science.gov (United States)

    Chang, Jee Suk; Kim, Kyung Hwan; Keum, Ki Chang; Noh, Sung Hoon; Lim, Joon Seok; Kim, Hyo Song; Rha, Sun Young; Lee, Yong Chan; Hyung, Woo Jin; Koom, Woong Sub

    2016-12-01

    To classify patients with nonmetastatic advanced gastric cancer who underwent D2-gastrectomy into prognostic groups based on peritoneal and systemic recurrence risks. Between 2004 and 2007, 1,090 patients with T3-4 or N+ gastric cancer were identified from our registry. Recurrence rates were estimated using a competing-risk analysis. Different prognostic groups were defined using recursive partitioning analysis (RPA). Median follow-up was 7 years. In the RPA-model for peritoneal recurrence risk, the initial node was split by T stage, indicating that differences between patients with T1-3 and T4 cancer were the greatest. The 5-year peritoneal recurrence rates for patients with T4 (n = 627) and T1-3 (n = 463) disease were 34.3% and 9.1%, respectively. N stage and neural invasion had an additive impact on high-risk patients. The RPA model for systemic relapse incorporated N stage alone and gave two terminal nodes: N0-2 (n = 721) and N3 (n = 369). The 5-year cumulative incidences were 7.7% and 24.5%, respectively. We proposed risk stratification models of peritoneal and systemic recurrence in patients undergoing D2-gastrectomy. This classification could be used for stratification protocols in future studies evaluating adjuvant therapies such as preoperative chemoradiotherapy. J. Surg. Oncol. 2016;114:859-864. © 2016 2016 Wiley Periodicals, Inc. © 2016 Wiley Periodicals, Inc.

  10. Recursive automatic classification algorithms

    Energy Technology Data Exchange (ETDEWEB)

    Bauman, E V; Dorofeyuk, A A

    1982-03-01

    A variational statement of the automatic classification problem is given. The dependence of the form of the optimal partition surface on the form of the classification objective functional is investigated. A recursive algorithm is proposed for maximising a functional of reasonably general form. The convergence problem is analysed in connection with the proposed algorithm. 8 references.

  11. CP-Recursion in Danish

    DEFF Research Database (Denmark)

    Nyvad, Anne Mette; Christensen, Ken Ramshøj; Vikner, Sten

    2017-01-01

    Based on data from extraction, embedded V2, and complementizer stacking, this paper proposes a cP/CP-analysis of CP-recursion in Danish. Because extraction can be shown to be possible from relative clauses, wh-islands, and adverbial clauses, and given that long extraction is successive......-cyclic, an extra specifier position has to be available as an escape hatch. Consequently, such extractions require a CP-recursion analysis, as has been argued for embedded V2 and for complementizer stacking. Given that CP-recursion in embedded V2 clauses does not allow extraction, whereas other types of CP......-recursion do, we suggest that embedded V2 is fundamentally different, in that main clause V2 and embedded V2 involve a CP (“big CP”), whereas all other clausal projections above IP are instances of cP (“little cP”). The topmost “little” c° has an occurrence feature that enables extraction but bars spell...

  12. Recursive sequences in first-year calculus

    Science.gov (United States)

    Krainer, Thomas

    2016-02-01

    This article provides ready-to-use supplementary material on recursive sequences for a second-semester calculus class. It equips first-year calculus students with a basic methodical procedure based on which they can conduct a rigorous convergence or divergence analysis of many simple recursive sequences on their own without the need to invoke inductive arguments as is typically required in calculus textbooks. The sequences that are accessible to this kind of analysis are predominantly (eventually) monotonic, but also certain recursive sequences that alternate around their limit point as they converge can be considered.

  13. Gender, Race, and Survival: A Study in Non-Small-Cell Lung Cancer Brain Metastases Patients Utilizing the Radiation Therapy Oncology Group Recursive Partitioning Analysis Classification

    International Nuclear Information System (INIS)

    Videtic, Gregory M.M.; Reddy, Chandana A.; Chao, Samuel T.; Rice, Thomas W.; Adelstein, David J.; Barnett, Gene H.; Mekhail, Tarek M.; Vogelbaum, Michael A.; Suh, John H.

    2009-01-01

    Purpose: To explore whether gender and race influence survival in non-small-cell lung cancer (NSCLC) in patients with brain metastases, using our large single-institution brain tumor database and the Radiation Therapy Oncology Group recursive partitioning analysis (RPA) brain metastases classification. Methods and materials: A retrospective review of a single-institution brain metastasis database for the interval January 1982 to September 2004 yielded 835 NSCLC patients with brain metastases for analysis. Patient subsets based on combinations of gender, race, and RPA class were then analyzed for survival differences. Results: Median follow-up was 5.4 months (range, 0-122.9 months). There were 485 male patients (M) (58.4%) and 346 female patients (F) (41.6%). Of the 828 evaluable patients (99%), 143 (17%) were black/African American (B) and 685 (83%) were white/Caucasian (W). Median survival time (MST) from time of brain metastasis diagnosis for all patients was 5.8 months. Median survival time by gender (F vs. M) and race (W vs. B) was 6.3 months vs. 5.5 months (p = 0.013) and 6.0 months vs. 5.2 months (p = 0.08), respectively. For patients stratified by RPA class, gender, and race, MST significantly favored BFs over BMs in Class II: 11.2 months vs. 4.6 months (p = 0.021). On multivariable analysis, significant variables were gender (p = 0.041, relative risk [RR] 0.83) and RPA class (p < 0.0001, RR 0.28 for I vs. III; p < 0.0001, RR 0.51 for II vs. III) but not race. Conclusions: Gender significantly influences NSCLC brain metastasis survival. Race trended to significance in overall survival but was not significant on multivariable analysis. Multivariable analysis identified gender and RPA classification as significant variables with respect to survival.

  14. Mesh Partitioning Algorithm Based on Parallel Finite Element Analysis and Its Actualization

    Directory of Open Access Journals (Sweden)

    Lei Zhang

    2013-01-01

    Full Text Available In parallel computing based on finite element analysis, domain decomposition is a key technique for its preprocessing. Generally, a domain decomposition of a mesh can be realized through partitioning of a graph which is converted from a finite element mesh. This paper discusses the method for graph partitioning and the way to actualize mesh partitioning. Relevant softwares are introduced, and the data structure and key functions of Metis and ParMetis are introduced. The writing, compiling, and testing of the mesh partitioning interface program based on these key functions are performed. The results indicate some objective law and characteristics to guide the users who use the graph partitioning algorithm and software to write PFEM program, and ideal partitioning effects can be achieved by actualizing mesh partitioning through the program. The interface program can also be used directly by the engineering researchers as a module of the PFEM software. So that it can reduce the application of the threshold of graph partitioning algorithm, improve the calculation efficiency, and promote the application of graph theory and parallel computing.

  15. On Recursion

    Directory of Open Access Journals (Sweden)

    Jeffrey eWatumull

    2014-01-01

    Full Text Available It is a truism that conceptual understanding of a hypothesis is required for its empirical investigation. However the concept of recursion as articulated in the context of linguistic analysis has been perennially confused. Nowhere has this been more evident than in attempts to critique and extend Hauser, Chomsky, and Fitch’s (2002 articulation. These authors put forward the hypothesis that what is uniquely human and unique to the faculty of language—the faculty of language in the narrow sense (FLN—is a recursive system that generates and maps syntactic objects to conceptual-intentional and sensory-motor systems. This thesis was based on the standard mathematical definition of recursion as understood by Gödel and Turing, and yet has commonly been interpreted in other ways, most notably and incorrectly as a thesis about the capacity for syntactic embedding. As we explain, the recursiveness of a function is defined independent of such output, whether infinite or finite, embedded or unembedded—existent or nonexistent. And to the extent that embedding is a sufficient, though not necessary, diagnostic of recursion, it has not been established that the apparent restriction on embedding in some languages is of any theoretical import. Misunderstanding of these facts has generated research that is often irrelevant to the FLN thesis as well as to other theories of language competence that focus on its generative power of expression. This essay is an attempt to bring conceptual clarity to such discussions as well as to future empirical investigations by explaining three criterial properties of recursion: computability (i.e., rules in intension rather than lists in extension; definition by induction (i.e., rules strongly generative of structure; and mathematical induction (i.e., rules for the principled—and potentially unbounded—expansion of strongly generated structure. By these necessary and sufficient criteria, the grammars of all natural

  16. Determinants for swine mycoplasmal pneumonia reproduction under experimental conditions: A systematic review and recursive partitioning analysis

    Science.gov (United States)

    Garcia-Morante, Beatriz; Segalés, Joaquim; Serrano, Emmanuel

    2017-01-01

    One of the main Mycoplasma hyopneumoniae (M. hyopneumoniae) swine experimental model objectives is to reproduce mycoplasmal pneumonia (MP). Unfortunately, experimental validated protocols to maximize the chance to successfully achieve lung lesions induced by M. hyopneumoniae are not available at the moment. Thus, the objective of this work was to identify those factors that might have a major influence on the effective development of MP, measured as macroscopic lung lesions, under experimental conditions. Data from 85 studies describing M. hyopneumoniae inoculation experiments were compiled by means of a systematic review and analyzed thereafter. Several variables were considered in the analyses such as the number of pigs in the experiment, serological status against M. hyopneumoniae, source of the animals, age at inoculation, type of inoculum, strain of M. hyopneumoniae, route, dose and times of inoculation, study duration and co-infection with other swine pathogens. Descriptive statistics were used to depict M. hyopneumoniae experimental model main characteristics whereas a recursive partitioning approach, using regression trees, assessed the importance of the abovementioned experimental variables as MP triggering factors. A strong link between the time period between challenge and necropsies and lung lesion severity was observed. Results indicated that the most important factors to explain the observed lung lesion score variability were: (1) study duration, (2) M. hyopneumoniae strain, (3) age at inoculation, (4) co-infection with other swine pathogens and (5) animal source. All other studied variables were not relevant to explain the variability on M. hyopneumoniae lung lesions. The results provided in the present work may serve as a basis for debate in the search for a universally accepted M. hyopneumoniae challenge model. PMID:28742802

  17. Determinants for swine mycoplasmal pneumonia reproduction under experimental conditions: A systematic review and recursive partitioning analysis.

    Directory of Open Access Journals (Sweden)

    Beatriz Garcia-Morante

    Full Text Available One of the main Mycoplasma hyopneumoniae (M. hyopneumoniae swine experimental model objectives is to reproduce mycoplasmal pneumonia (MP. Unfortunately, experimental validated protocols to maximize the chance to successfully achieve lung lesions induced by M. hyopneumoniae are not available at the moment. Thus, the objective of this work was to identify those factors that might have a major influence on the effective development of MP, measured as macroscopic lung lesions, under experimental conditions. Data from 85 studies describing M. hyopneumoniae inoculation experiments were compiled by means of a systematic review and analyzed thereafter. Several variables were considered in the analyses such as the number of pigs in the experiment, serological status against M. hyopneumoniae, source of the animals, age at inoculation, type of inoculum, strain of M. hyopneumoniae, route, dose and times of inoculation, study duration and co-infection with other swine pathogens. Descriptive statistics were used to depict M. hyopneumoniae experimental model main characteristics whereas a recursive partitioning approach, using regression trees, assessed the importance of the abovementioned experimental variables as MP triggering factors. A strong link between the time period between challenge and necropsies and lung lesion severity was observed. Results indicated that the most important factors to explain the observed lung lesion score variability were: (1 study duration, (2 M. hyopneumoniae strain, (3 age at inoculation, (4 co-infection with other swine pathogens and (5 animal source. All other studied variables were not relevant to explain the variability on M. hyopneumoniae lung lesions. The results provided in the present work may serve as a basis for debate in the search for a universally accepted M. hyopneumoniae challenge model.

  18. On the Relation between Spector's Bar Recursion and Modified Bar Recursion

    DEFF Research Database (Denmark)

    Oliva, Paulo Borges

    2002-01-01

    We introduce a variant of Spector's Bar Recursion in finite types to give a realizability interpretation of the classical axiom of dependent choice allowing for the extraction of witnesses from proofs of Sigma_1 formulas in classical analysis. We also give a bar recursive definition of the fan...... functional and study the relationship of our variant of Bar Recursion with others....

  19. On Modified Bar recursion

    DEFF Research Database (Denmark)

    Oliva, Paulo Borges

    2002-01-01

    Modified bar recursion is a variant of Spector's bar recursion which can be used to give a realizability interpretation of the classical axiom of dependent choice. This realizability allows for the extraction of witnesses from proofs of forall-exists-formulas in classical analysis. In this talk I...... shall report on results regarding the relationship between modified and Spector's bar recursion. I shall also show that a seemingly weak form of modified bar recursion is as strong as "full" modified bar recursion in higher types....

  20. A bijection between phylogenetic trees and plane oriented recursive trees

    OpenAIRE

    Prodinger, Helmut

    2017-01-01

    Phylogenetic trees are binary nonplanar trees with labelled leaves, and plane oriented recursive trees are planar trees with an increasing labelling. Both families are enumerated by double factorials. A bijection is constructed, using the respective representations a 2-partitions and trapezoidal words.

  1. Domain wall partition function of the eight-vertex model with a non-diagonal reflecting end

    International Nuclear Information System (INIS)

    Yang Wenli; Chen Xi; Feng Jun; Hao Kun; Shi Kangjie; Sun Chengyi; Yang Zhanying; Zhang Yaozhong

    2011-01-01

    With the help of the Drinfeld twist or factorizing F-matrix for the eight-vertex SOS model, we derive the recursion relations of the partition function for the eight-vertex model with a generic non-diagonal reflecting end and domain wall boundary condition. Solving the recursion relations, we obtain the explicit determinant expression of the partition function. Our result shows that, contrary to the eight-vertex model without a reflecting end, the partition function can be expressed as a single determinant.

  2. Is recursion language-specific? Evidence of recursive mechanisms in the structure of intentional action.

    Science.gov (United States)

    Vicari, Giuseppe; Adenzato, Mauro

    2014-05-01

    In their 2002 seminal paper Hauser, Chomsky and Fitch hypothesize that recursion is the only human-specific and language-specific mechanism of the faculty of language. While debate focused primarily on the meaning of recursion in the hypothesis and on the human-specific and syntax-specific character of recursion, the present work focuses on the claim that recursion is language-specific. We argue that there are recursive structures in the domain of motor intentionality by way of extending John R. Searle's analysis of intentional action. We then discuss evidence from cognitive science and neuroscience supporting the claim that motor-intentional recursion is language-independent and suggest some explanatory hypotheses: (1) linguistic recursion is embodied in sensory-motor processing; (2) linguistic and motor-intentional recursions are distinct and mutually independent mechanisms. Finally, we propose some reflections about the epistemic status of HCF as presenting an empirically falsifiable hypothesis, and on the possibility of testing recursion in different cognitive domains. Copyright © 2014 Elsevier Inc. All rights reserved.

  3. Recursive grid partitioning on a cortical surface model: an optimized technique for the localization of implanted subdural electrodes.

    Science.gov (United States)

    Pieters, Thomas A; Conner, Christopher R; Tandon, Nitin

    2013-05-01

    Precise localization of subdural electrodes (SDEs) is essential for the interpretation of data from intracranial electrocorticography recordings. Blood and fluid accumulation underneath the craniotomy flap leads to a nonlinear deformation of the brain surface and of the SDE array on postoperative CT scans and adversely impacts the accurate localization of electrodes located underneath the craniotomy. Older methods that localize electrodes based on their identification on a postimplantation CT scan with coregistration to a preimplantation MR image can result in significant problems with accuracy of the electrode localization. The authors report 3 novel methods that rely on the creation of a set of 3D mesh models to depict the pial surface and a smoothed pial envelope. Two of these new methods are designed to localize electrodes, and they are compared with 6 methods currently in use to determine their relative accuracy and reliability. The first method involves manually localizing each electrode using digital photographs obtained at surgery. This is highly accurate, but requires time intensive, operator-dependent input. The second uses 4 electrodes localized manually in conjunction with an automated, recursive partitioning technique to localize the entire electrode array. The authors evaluated the accuracy of previously published methods by applying the methods to their data and comparing them against the photograph-based localization. Finally, the authors further enhanced the usability of these methods by using automatic parcellation techniques to assign anatomical labels to individual electrodes as well as by generating an inflated cortical surface model while still preserving electrode locations relative to the cortical anatomy. The recursive grid partitioning had the least error compared with older methods (672 electrodes, 6.4-mm maximum electrode error, 2.0-mm mean error, p < 10(-18)). The maximum errors derived using prior methods of localization ranged from 8

  4. A new design for SLAM front-end based on recursive SOM

    Science.gov (United States)

    Yang, Xuesi; Xia, Shengping

    2015-12-01

    Aiming at the graph optimization-based monocular SLAM, a novel design for the front-end in single camera SLAM is proposed, based on the recursive SOM. Pixel intensities are directly used to achieve image registration and motion estimation, which can save time compared with the current appearance-based frameworks, usually including feature extraction and matching. Once a key-frame is identified, a recursive SOM is used to actualize loop-closure detecting, resulting a more precise location. The experiment on a public dataset validates our method on a computer with a quicker and effective result.

  5. Prognostic factors in children and adolescents with acute myeloid leukemia (excluding children with Down syndrome and acute promyelocytic leukemia): univariate and recursive partitioning analysis of patients treated on Pediatric Oncology Group (POG) Study 8821.

    Science.gov (United States)

    Chang, M; Raimondi, S C; Ravindranath, Y; Carroll, A J; Camitta, B; Gresik, M V; Steuber, C P; Weinstein, H

    2000-07-01

    The purpose of the paper was to define clinical or biological features associated with the risk for treatment failure for children with acute myeloid leukemia. Data from 560 children and adolescents with newly diagnosed acute myeloid leukemia who entered the Pediatric Oncology Group Study 8821 from June 1988 to March 1993 were analyzed by univariate and recursive partitioning methods. Children with Down syndrome or acute promyelocytic leukemia were excluded from the study. Factors examined included age, number of leukocytes, sex, FAB morphologic subtype, cytogenetic findings, and extramedullary disease at the time of diagnosis. The overall event-free survival (EFS) rate at 4 years was 32.7% (s.e. = 2.2%). Age > or =2 years, fewer than 50 x 10(9)/I leukocytes, and t(8;21) or inv(16), and normal chromosomes were associated with higher rates of EFS (P value = 0.003, 0.049, 0.0003, 0.031, respectively), whereas the M5 subtype of AML (P value = 0.0003) and chromosome abnormalities other than t(8;21) and inv(16) were associated with lower rates of EFS (P value = 0.0001). Recursive partitioning analysis defined three groups of patients with widely varied prognoses: female patients with t(8;21), inv(16), or a normal karyotype (n = 89) had the best prognosis (4-year EFS = 55.1%, s.e. = 5.7%); male patients with t(8;21), inv(16) or normal chromosomes (n = 106) had an intermediate prognosis (4-year EFS = 38.1%, s.e. = 5.3%); patients with chromosome abnormalities other than t(8;21) and inv(16) (n = 233) had the worst prognosis (4-year EFS = 27.0%, s.e. = 3.2%). One hundred and thirty-two patients (24%) could not be grouped because of missing cytogenetic data, mainly due to inadequate marrow samples. The results suggest that pediatric patients with acute myeloid leukemia can be categorized into three potential risk groups for prognosis and that differences in sex and chromosomal abnormalities are associated with differences in estimates of EFS. These results are tentative and

  6. Model-based dispersive wave processing: A recursive Bayesian solution

    International Nuclear Information System (INIS)

    Candy, J.V.; Chambers, D.H.

    1999-01-01

    Wave propagation through dispersive media represents a significant problem in many acoustic applications, especially in ocean acoustics, seismology, and nondestructive evaluation. In this paper we propose a propagation model that can easily represent many classes of dispersive waves and proceed to develop the model-based solution to the wave processing problem. It is shown that the underlying wave system is nonlinear and time-variable requiring a recursive processor. Thus the general solution to the model-based dispersive wave enhancement problem is developed using a Bayesian maximum a posteriori (MAP) approach and shown to lead to the recursive, nonlinear extended Kalman filter (EKF) processor. The problem of internal wave estimation is cast within this framework. The specific processor is developed and applied to data synthesized by a sophisticated simulator demonstrating the feasibility of this approach. copyright 1999 Acoustical Society of America.

  7. Updating Recursive XML Views of Relations

    DEFF Research Database (Denmark)

    Choi, Byron; Cong, Gao; Fan, Wenfei

    2009-01-01

    This paper investigates the view update problem for XML views published from relational data. We consider XML views defined in terms of mappings directed by possibly recursive DTDs compressed into DAGs and stored in relations. We provide new techniques to efficiently support XML view updates...... specified in terms of XPath expressions with recursion and complex filters. The interaction between XPath recursion and DAG compression of XML views makes the analysis of the XML view update problem rather intriguing. Furthermore, many issues are still open even for relational view updates, and need...... to be explored. In response to these, on the XML side, we revise the notion of side effects and update semantics based on the semantics of XML views, and present effecient algorithms to translate XML updates to relational view updates. On the relational side, we propose a mild condition on SPJ views, and show...

  8. Generalized Path Analysis and Generalized Simultaneous Equations Model for Recursive Systems with Responses of Mixed Types

    Science.gov (United States)

    Tsai, Tien-Lung; Shau, Wen-Yi; Hu, Fu-Chang

    2006-01-01

    This article generalizes linear path analysis (PA) and simultaneous equations models (SiEM) to deal with mixed responses of different types in a recursive or triangular system. An efficient instrumental variable (IV) method for estimating the structural coefficients of a 2-equation partially recursive generalized path analysis (GPA) model and…

  9. Recursion Theory Week

    CERN Document Server

    Müller, Gert; Sacks, Gerald

    1990-01-01

    These proceedings contain research and survey papers from many subfields of recursion theory, with emphasis on degree theory, in particular the development of frameworks for current techniques in this field. Other topics covered include computational complexity theory, generalized recursion theory, proof theoretic questions in recursion theory, and recursive mathematics.

  10. The Partition of Multi-Resolution LOD Based on Qtm

    Science.gov (United States)

    Hou, M.-L.; Xing, H.-Q.; Zhao, X.-S.; Chen, J.

    2011-08-01

    The partition hierarch of Quaternary Triangular Mesh (QTM) determine the accuracy of spatial analysis and application based on QTM. In order to resolve the problem that the partition hierarch of QTM is limited by the level of the computer hardware, the new method that Multi- Resolution LOD (Level of Details) based on QTM will be discussed in this paper. This method can make the resolution of the cells varying with the viewpoint position by partitioning the cells of QTM, selecting the particular area according to the viewpoint; dealing with the cracks caused by different subdivisions, it satisfies the request of unlimited partition in part.

  11. THE PARTITION OF MULTI-RESOLUTION LOD BASED ON QTM

    Directory of Open Access Journals (Sweden)

    M.-L. Hou

    2012-08-01

    Full Text Available The partition hierarch of Quaternary Triangular Mesh (QTM determine the accuracy of spatial analysis and application based on QTM. In order to resolve the problem that the partition hierarch of QTM is limited by the level of the computer hardware, the new method that Multi- Resolution LOD (Level of Details based on QTM will be discussed in this paper. This method can make the resolution of the cells varying with the viewpoint position by partitioning the cells of QTM, selecting the particular area according to the viewpoint; dealing with the cracks caused by different subdivisions, it satisfies the request of unlimited partition in part.

  12. Further Stable methods for the calculation of partition functions

    International Nuclear Information System (INIS)

    Wilson, B G; Gilleron, F; Pain, J

    2007-01-01

    The extension to recursion over holes of the Gilleron and Pain method for calculating partition functions of a canonical ensemble of non-interacting bound electrons is presented as well as a generalization for the efficient computation of collisional line broadening

  13. Joint Analysis of Binomial and Continuous Traits with a Recursive Model

    DEFF Research Database (Denmark)

    Varona, Louis; Sorensen, Daniel

    2014-01-01

    This work presents a model for the joint analysis of a binomial and a Gaussian trait using a recursive parametrization that leads to a computationally efficient implementation. The model is illustrated in an analysis of mortality and litter size in two breeds of Danish pigs, Landrace and Yorkshir...

  14. Prognostic factors derived from recursive partition analysis (RPA) of radiation therapy oncology group (RTOG) brain metastases trials applied to surgically resected and irradiated brain metastatic cases

    International Nuclear Information System (INIS)

    Agboola, Olusegun; Benoit, Brien; Cross, Peter; Silva, Vasco da; Esche, Bernd; Lesiuk, Howard; Gonsalves, Carol

    1998-01-01

    Purpose: (a) To identify the prognostic factors that determine survival after surgical resection and irradiation of tumors metastatic to brain. (b) To determine if the prognostic factors used in the recursive partition analysis (RPA) of brain metastases cases from Radiation Therapy Oncology Group (RTOG) studies into three distinct survival classes is applicable to surgically resected and irradiated patients. Method: The medical records of 125 patients who had surgical resection and radiotherapy for brain metastases from 1985 to 1997 were reviewed. The patients' disease and treatment related factors were analyzed to identify factors that independently determine survival after diagnosis of brain metastasis. The patients were also grouped into three classes using the RPA-derived prognostic parameters which are: age, performance status, state of the primary disease, and presence or absence of extracranial metastases. Class 1: patients ≤ 65 years of age, Karnofsky performance status (KPS) of ≥70, with controlled primary disease and no extracranial metastases; Class 3: patients with KPS < 70. Patients who do not qualify for Class 1 or 3 are grouped as Class 2. The survival of these patients was determined from the time of diagnosis of brain metastases to the time of death. Results: The median survival of the entire group was 9.5 months. The three classes of patients as grouped had median survivals of 14.8, 9.9, and 6.0 months respectively (p = 0.0002). Age of < 65 years, KPS of ≥ 70, controlled primary disease, absence of extracranial metastases, complete surgical resection of the brain lesion(s) were found to be independent prognostic factors for survival; the total dose of radiation was not. Conclusion: Based on the results of this study, the patients and disease characteristics have significant impact on the survival of patients with brain metastases treated with a combination of surgical resection and radiotherapy. These parameters could be used in selecting

  15. Partition function zeros of the one-dimensional Potts model: the recursive method

    International Nuclear Information System (INIS)

    Ghulghazaryan, R G; Ananikian, N S

    2003-01-01

    The Yang-Lee, Fisher and Potts zeros of the one-dimensional Q-state Potts model are studied using the theory of dynamical systems. An exact recurrence relation for the partition function is derived. It is shown that zeros of the partition function may be associated with neutral fixed points of the recurrence relation. Further, a general equation for zeros of the partition function is found and a classification of the Yang-Lee, Fisher and Potts zeros is given. It is shown that the Fisher zeros in a nonzero magnetic field are located on several lines in the complex temperature plane and that the number of these lines depends on the value of the magnetic field. Analytical expressions for the densities of the Yang-Lee, Fisher and Potts zeros are derived. It is shown that densities of all types of zeros of the partition function are singular at the edge singularity points with the same critical exponent

  16. Exploiting fine-grain parallelism in recursive LU factorization

    KAUST Repository

    Dongarra, Jack

    2012-01-01

    The LU factorization is an important numerical algorithm for solving system of linear equations. This paper proposes a novel approach for computing the LU factorization in parallel on multicore architectures. It improves the overall performance and also achieves the numerical quality of the standard LU factorization with partial pivoting. While the update of the trailing submatrix is computationally intensive and highly parallel, the inherently problematic portion of the LU factorization is the panel factorization due to its memory-bound characteristic and the atomicity of selecting the appropriate pivots. We remedy this in our new approach to LU factorization of (narrow and tall) panel submatrices. We use a parallel fine-grained recursive formulation of the factorization. It is based on conflict-free partitioning of the data and lock-less synchronization mechanisms. Our implementation lets the overall computation naturally flow with limited contention. Our recursive panel factorization provides the necessary performance increase for the inherently problematic portion of the LU factorization of square matrices. A large panel width results in larger Amdahl\\'s fraction as our experiments have revealed which is consistent with related efforts. The performance results of our implementation reveal superlinear speedup and far exceed what can be achieved with equivalent MKL and/or LAPACK routines. © 2012 The authors and IOS Press. All rights reserved.

  17. Recursion method in the k-space representation

    International Nuclear Information System (INIS)

    Anlage, S.M.; Smith, D.L.

    1986-01-01

    We show that by using a unitary transformation to k space and the special-k-point method for evaluating Brillouin-zone sums, the recursion method can be very effectively applied to translationally invariant systems. We use this approach to perform recursion calculations for realistic tight-binding Hamiltonians which describe diamond- and zinc-blende-structure semiconductors. Projected densities of states for these Hamiltonians have band gaps and internal van Hove singularities. We calculate coefficients for 63 recursion levels exactly and for about 200 recursion levels to a good approximation. Comparisons are made for materials with different magnitude band gaps (diamond, Si, α-Sn). Comparison is also made between materials with one (e.g., diamond) and two (e.g., GaAs) band gaps. The asymptotic behavior of the recursion coefficients is studied by Fourier analysis. Band gaps in the projected density of states dominate the asymptotic behavior. Perturbation analysis describes the asymptotic behavior rather well. Projected densities of states are calculated using a very simple termination scheme. These densities of states compare favorably with the results of Gilat-Raubenheimer integration

  18. A step-indexed Kripke model of hidden state via recursive properties on recursively defined metric spaces

    DEFF Research Database (Denmark)

    Birkedal, Lars; Schwinghammer, Jan; Støvring, Kristian

    2010-01-01

    for Chargu´eraud and Pottier’s type and capability system including frame and anti-frame rules, based on the operational semantics and step-indexed heap relations. The worlds are constructed as a recursively defined predicate on a recursively defined metric space, which provides a considerably simpler...

  19. Validation and predictive power of radiation therapy oncology group (RTOG) recursive partitioning analysis classes for malignant glioma patients: a report using RTOG 90-06

    International Nuclear Information System (INIS)

    Scott, Charles B.; Scarantino, Charles; Urtasun, Raul; Movsas, Benjamin; Jones, Christopher U.; Simpson, Joseph R.; Fischbach, A. Jennifer; Curran, Walter J.

    1996-01-01

    Background/Purpose: The recursive partitioning analysis (RPA) classes for malignant glioma patients were previously established by Curran et al. (JNCI 85:704-10, 1993) using data on over 1500 patients from the Radiation Therapy Oncology Group (RTOG). The current analysis was to validate the RPA classes on a new dataset (RTOG 90-06) and determine the predictive power of the RPA classes. Patients and Methods: There are six RPA classes for malignant glioma patients that comprise distinct groups of patients with significantly different survival outcome. RTOG 90-06 is a randomized phase III study of 712 patients accrued from 1990 to 1994. The minimum potential follow-up is 18 months. The treatment arms were combined for the purpose of this analysis. There were 84, 13, 105, 240, 150, and 23 patients in the six RPA classes from RTOG 90-06. Results: The median survival times (MST) and two-year survivals for the six RPA classes in RTOG 90-06 are compared to those published by Curran et al. (JNCI 1993). The RPA classes appear in descending order in the following table. The MST and 2-year survivals for the RTOG RPA classes were within 95% confidence intervals of the 90-06 estimates for classes I, III, IV, and V. The RPA classes explained 43% of the variation (squared error loss). By comparison, a model containing only histology explains only 13% of the variation. The RPA classes are statistically distinct with all comparisons exceeding 0.0001, except those involving class II. Conclusion: The validity of the model is verified by the reliability of the RPA classes to define distinct groups with respect to survival. Further evidence is given by prediction of MST and 2-year survival for all classes except class II. The RPA classes explained a good portion of the variation in the data. RPA class II did not perform well which may be an artifact of the small sample size or an indication that this class is not distinct. The validation of the RPA classes attests to their usefulness as

  20. Recursive definition of global cellular-automata mappings

    DEFF Research Database (Denmark)

    Feldberg, Rasmus; Knudsen, Carsten; Rasmussen, Steen

    1994-01-01

    A method for a recursive definition of global cellular-automata mappings is presented. The method is based on a graphical representation of global cellular-automata mappings. For a given cellular-automaton rule the recursive algorithm defines the change of the global cellular-automaton mapping...... as the number of lattice sites is incremented. A proof of lattice size invariance of global cellular-automata mappings is derived from an approximation to the exact recursive definition. The recursive definitions are applied to calculate the fractal dimension of the set of reachable states and of the set...

  1. Validation and predictive power of Radiation Therapy Oncology Group (RTOG) recursive partitioning analysis classes for malignant glioma patients: A report using RTOG 90-06

    International Nuclear Information System (INIS)

    Scott, Charles B.; Scarantino, Charles; Urtasun, Raul; Movsas, Benjamin; Jones, Christopher U.; Simpson, Joseph R.; Fischbach, A. Jennifer; Curran, Walter J.

    1998-01-01

    Purpose: The recursive partitioning analysis (RPA) classes for malignant glioma patients were previously established using data on over 1500 patients entered on Radiation Therapy Oncology Group (RTOG) clinical trials. The purpose of the current analysis was to validate the RPA classes with a new dataset (RTOG 90-06), determine the predictive power of the RPA classes, and establish the usefulness of the database norms for the RPA classes. Patients and Methods: There are six RPA classes for malignant glioma patients that comprise distinct groups of patients with significantly different survival outcome. RTOG 90-06 is a randomized Phase III study of 712 patients accrued from 1990 to 1994. The minimum potential follow-up is 18 months. The treatment arms were combined for the purpose of this analysis. There were 84, 13, 105, 240, 150, and 23 patients in the RPA Classes I-VI from RTOG 90-06, respectively. Results: The median survival times (MST) and 2-year survival rates for the six RPA classes in RTOG 90-06 are compared to those previously published. The MST and 2-year survival rates for the RTOG RPA classes were within 95% confidence intervals of the 90-06 estimates for Classes I, III, IV, and V. The RPA classes explained 43% of the variation (squared error loss). By comparison, a Cox model explains 30% of the variation. The RPA classes within RTOG 90-06 are statistically distinct with all comparisons exceeding 0.0001, except those involving Class II. A survival analysis from a prior RTOG study indicated that 72.0 Gy had superior outcome to literature controls; analysis of this data by RPA classes indicates the survival results were not superior to the RTOG database norms. Conclusion: The validity of the model is verified by the reliability of the RPA classes to define distinct groups with respect to survival. Further evidence is given by prediction of MST and 2-year survival for all classes except Class II. The RPA classes explained a good portion of the variation in

  2. Recursive evaluation of interaction forces of unbounded soil in time domain

    International Nuclear Information System (INIS)

    Motosaka, M.

    1987-01-01

    Recursive formulations have hardly been used in the analysis of soil-structure interaction. A notable exception is described in Verbic 1973, which corresponds to the impulse-invariant way discussed in Section 2. Section 3 describes another possibility to derive a recursive relation based on a segment approach using z-transforms. An illustrative example is examined in Section 4, and in Section 5 the number of operations is addressed. This compact paper is based on Wolf and Motosaka 1988. (orig./HP)

  3. Syntactic Recursion Facilitates and Working Memory Predicts Recursive Theory of Mind

    Science.gov (United States)

    Arslan, Burcu; Hohenberger, Annette; Verbrugge, Rineke

    2017-01-01

    In this study, we focus on the possible roles of second-order syntactic recursion and working memory in terms of simple and complex span tasks in the development of second-order false belief reasoning. We tested 89 Turkish children in two age groups, one younger (4;6–6;5 years) and one older (6;7–8;10 years). Although second-order syntactic recursion is significantly correlated with the second-order false belief task, results of ordinal logistic regressions revealed that the main predictor of second-order false belief reasoning is complex working memory span. Unlike simple working memory and second-order syntactic recursion tasks, the complex working memory task required processing information serially with additional reasoning demands that require complex working memory strategies. Based on our results, we propose that children’s second-order theory of mind develops when they have efficient reasoning rules to process embedded beliefs serially, thus overcoming a possible serial processing bottleneck. PMID:28072823

  4. Syntactic Recursion Facilitates and Working Memory Predicts Recursive Theory of Mind.

    Directory of Open Access Journals (Sweden)

    Burcu Arslan

    Full Text Available In this study, we focus on the possible roles of second-order syntactic recursion and working memory in terms of simple and complex span tasks in the development of second-order false belief reasoning. We tested 89 Turkish children in two age groups, one younger (4;6-6;5 years and one older (6;7-8;10 years. Although second-order syntactic recursion is significantly correlated with the second-order false belief task, results of ordinal logistic regressions revealed that the main predictor of second-order false belief reasoning is complex working memory span. Unlike simple working memory and second-order syntactic recursion tasks, the complex working memory task required processing information serially with additional reasoning demands that require complex working memory strategies. Based on our results, we propose that children's second-order theory of mind develops when they have efficient reasoning rules to process embedded beliefs serially, thus overcoming a possible serial processing bottleneck.

  5. A Step-Indexed Kripke Model of Hidden State via Recursive Properties on Recursively Defined Metric Spaces

    DEFF Research Database (Denmark)

    Schwinghammer, Jan; Birkedal, Lars; Støvring, Kristian

    2011-01-01

    ´eraud and Pottier’s type and capability system including both frame and anti-frame rules. The model is a possible worlds model based on the operational semantics and step-indexed heap relations, and the worlds are constructed as a recursively defined predicate on a recursively defined metric space. We also extend...

  6. Recursive definition of global cellular-automata mappings

    International Nuclear Information System (INIS)

    Feldberg, R.; Knudsen, C.; Rasmussen, S.

    1994-01-01

    A method for a recursive definition of global cellular-automata mappings is presented. The method is based on a graphical representation of global cellular-automata mappings. For a given cellular-automaton rule the recursive algorithm defines the change of the global cellular-automaton mapping as the number of lattice sites is incremented. A proof of lattice size invariance of global cellular-automata mappings is derived from an approximation to the exact recursive definition. The recursive definitions are applied to calculate the fractal dimension of the set of reachable states and of the set of fixed points of cellular automata on an infinite lattice

  7. Feasibility Analysis of Sustainability-Based Measures to Reduce VOC Emissions in Office Partition Manufacturing

    Directory of Open Access Journals (Sweden)

    Marc A. Rosen

    2010-02-01

    Full Text Available A feasibility analysis is reported of reduction opportunities for volatile organic compound (VOC emissions in manufacturing office furniture partitions, aimed at contributing to efforts to improve the sustainability of the process. A pollution prevention methodology is utilized. The purpose is to provide practical options for VOC emissions reductions during the manufacturing of office furniture partitions, but the concepts can be generally applied to the wood furniture industry. Baseline VOC emissions for a typical plant are estimated using a mass balance approach. The feasibility analysis expands on a preliminary screening to identify viable pollution prevention options using realistic criteria and weightings, and is based on technical, environmental and economic considerations. The measures deemed feasible include the implementation of several best management practices, ceasing the painting of non-visible parts, switching to hot melt backwrapping glue, application of solvent recycling and modification of the mechanical clip attachment. Implementation, measurement and control plans are discussed for the measures considered feasible, which can enhance the sustainability of the manufacturing of office furniture partitions. Reducing VOC emissions using the measures identified can, in conjunction with other measures, improve the sustainability of the manufacturing process.

  8. Hopf algebras and topological recursion

    International Nuclear Information System (INIS)

    Esteves, João N

    2015-01-01

    We consider a model for topological recursion based on the Hopf algebra of planar binary trees defined by Loday and Ronco (1998 Adv. Math. 139 293–309 We show that extending this Hopf algebra by identifying pairs of nearest neighbor leaves, and thus producing graphs with loops, we obtain the full recursion formula discovered by Eynard and Orantin (2007 Commun. Number Theory Phys. 1 347–452). (paper)

  9. Parallelizable approximate solvers for recursions arising in preconditioning

    Energy Technology Data Exchange (ETDEWEB)

    Shapira, Y. [Israel Inst. of Technology, Haifa (Israel)

    1996-12-31

    For the recursions used in the Modified Incomplete LU (MILU) preconditioner, namely, the incomplete decomposition, forward elimination and back substitution processes, a parallelizable approximate solver is presented. The present analysis shows that the solutions of the recursions depend only weakly on their initial conditions and may be interpreted to indicate that the inexact solution is close, in some sense, to the exact one. The method is based on a domain decomposition approach, suitable for parallel implementations with message passing architectures. It requires a fixed number of communication steps per preconditioned iteration, independently of the number of subdomains or the size of the problem. The overlapping subdomains are either cubes (suitable for mesh-connected arrays of processors) or constructed by the data-flow rule of the recursions (suitable for line-connected arrays with possibly SIMD or vector processors). Numerical examples show that, in both cases, the overhead in the number of iterations required for convergence of the preconditioned iteration is small relatively to the speed-up gained.

  10. Implant volume as a prognostic variable in brachytherapy decision-making for malignant gliomas stratified by the RTOG recursive partitioning analysis

    International Nuclear Information System (INIS)

    Videtic, Gregory M.M.; Gaspar, Laurie E.; Zamorano, Lucia; Stitt, Larry W.; Fontanesi, James; Levin, Kenneth J.

    2001-01-01

    Purpose: When an initial retrospective review of malignant glioma patients (MG) undergoing brachytherapy was carried out using the Radiation Therapy Oncology Group (RTOG) recursive partitioning analysis (RPA) criteria, it revealed that glioblastoma multiforme (GBM) cases benefit the most from implant. In the present study, we focused exclusively on these GBM patients stratified by RPA survival class and looked at the relationship between survival and implanted target volume, to distinguish the prognostic value of volume in general and for a given GBM class. Methods and Materials: Between 1991 and 1998, 75 MG patients were treated with surgery, external beam radiation, and stereotactic iodine-125 (I-125) implant. Of these, 53 patients (70.7%) had GBMs, with 52 (98%) having target volume (TV) data for analysis. Stratification by RPA criteria showed 12, 26, 13, and 1 patients in classes III to VI, respectively. For analysis purposes, classes V and VI were merged. There were 27 (51.9%) male and 25 (48.1%) female patients. Mean age was 57.5 years (range 14-79). Median Karnofsky performance status (KPS) was 90 (range 50-100). Median follow-up time was 11 months (range 2-79). Results: At analysis, 18 GBM patients (34.6%) were alive and 34 (65.4%) were dead. Two-year and 5-year survivals were 42% and 17.5%, respectively, with a median survival time (MST) of 16 months. Two-year survivals and MSTs for the implanted GBM patients compared to the RTOG database were as follows: 74% vs. 35% and 28 months vs. 17.9 months for class III; 32% vs. 15% and 16 months vs. 11.1 months for class IV; 29% vs. 6% and 11 months vs. 8.9 months for class V/VI. Mean implanted TV was 15.5 cc (range 0.8-78), which corresponds to a spherical implant diameter of 3.1 cm. Plotting survival as a function of 5-cc TV increments suggested a trend toward poorer survival as the implanted volume increases. The impact of incremental changes in TV on survival within a given RPA class of GBMs was compared to the

  11. Analysis of litter size and average litter weight in pigs using a recursive model

    DEFF Research Database (Denmark)

    Varona, Luis; Sorensen, Daniel; Thompson, Robin

    2007-01-01

    An analysis of litter size and average piglet weight at birth in Landrace and Yorkshire using a standard two-trait mixed model (SMM) and a recursive mixed model (RMM) is presented. The RMM establishes a one-way link from litter size to average piglet weight. It is shown that there is a one......-to-one correspondence between the parameters of SMM and RMM and that they generate equivalent likelihoods. As parameterized in this work, the RMM tests for the presence of a recursive relationship between additive genetic values, permanent environmental effects, and specific environmental effects of litter size......, on average piglet weight. The equivalent standard mixed model tests whether or not the covariance matrices of the random effects have a diagonal structure. In Landrace, posterior predictive model checking supports a model without any form of recursion or, alternatively, a SMM with diagonal covariance...

  12. Partitioning of unstructured meshes for load balancing

    International Nuclear Information System (INIS)

    Martin, O.C.; Otto, S.W.

    1994-01-01

    Many large-scale engineering and scientific calculations involve repeated updating of variables on an unstructured mesh. To do these types of computations on distributed memory parallel computers, it is necessary to partition the mesh among the processors so that the load balance is maximized and inter-processor communication time is minimized. This can be approximated by the problem, of partitioning a graph so as to obtain a minimum cut, a well-studied combinatorial optimization problem. Graph partitioning algorithms are discussed that give good but not necessarily optimum solutions. These algorithms include local search methods recursive spectral bisection, and more general purpose methods such as simulated annealing. It is shown that a general procedure enables to combine simulated annealing with Kernighan-Lin. The resulting algorithm is both very fast and extremely effective. (authors) 23 refs., 3 figs., 1 tab

  13. CFT and topological recursion

    CERN Document Server

    Kostov, Ivan

    2010-01-01

    We study the quasiclassical expansion associated with a complex curve. In a more specific context this is the 1/N expansion in U(N)-invariant matrix integrals. We compare two approaches, the CFT approach and the topological recursion, and show their equivalence. The CFT approach reformulates the problem in terms of a conformal field theory on a Riemann surface, while the topological recursion is based on a recurrence equation for the observables representing symplectic invariants on the complex curve. The two approaches lead to two different graph expansions, one of which can be obtained as a partial resummation of the other.

  14. Recursive Trees for Practical ORAM

    Directory of Open Access Journals (Sweden)

    Moataz Tarik

    2015-06-01

    Full Text Available We present a new, general data structure that reduces the communication cost of recent tree-based ORAMs. Contrary to ORAM trees with constant height and path lengths, our new construction r-ORAM allows for trees with varying shorter path length. Accessing an element in the ORAM tree results in different communication costs depending on the location of the element. The main idea behind r-ORAM is a recursive ORAM tree structure, where nodes in the tree are roots of other trees. While this approach results in a worst-case access cost (tree height at most as any recent tree-based ORAM, we show that the average cost saving is around 35% for recent binary tree ORAMs. Besides reducing communication cost, r-ORAM also reduces storage overhead on the server by 4% to 20% depending on the ORAM’s client memory type. To prove r-ORAM’s soundness, we conduct a detailed overflow analysis. r-ORAM’s recursive approach is general in that it can be applied to all recent tree ORAMs, both constant and poly-log client memory ORAMs. Finally, we implement and benchmark r-ORAM in a practical setting to back up our theoretical claims.

  15. A physically based catchment partitioning method for hydrological analysis

    Science.gov (United States)

    Menduni, Giovanni; Riboni, Vittoria

    2000-07-01

    We propose a partitioning method for the topographic surface, which is particularly suitable for hydrological distributed modelling and shallow-landslide distributed modelling. The model provides variable mesh size and appears to be a natural evolution of contour-based digital terrain models. The proposed method allows the drainage network to be derived from the contour lines. The single channels are calculated via a search for the steepest downslope lines. Then, for each network node, the contributing area is determined by means of a search for both steepest upslope and downslope lines. This leads to the basin being partitioned into physically based finite elements delimited by irregular polygons. In particular, the distributed computation of local geomorphological parameters (i.e. aspect, average slope and elevation, main stream length, concentration time, etc.) can be performed easily for each single element. The contributing area system, together with the information on the distribution of geomorphological parameters provide a useful tool for distributed hydrological modelling and simulation of environmental processes such as erosion, sediment transport and shallow landslides.

  16. Recursive Neural Networks Based on PSO for Image Parsing

    Directory of Open Access Journals (Sweden)

    Guo-Rong Cai

    2013-01-01

    Full Text Available This paper presents an image parsing algorithm which is based on Particle Swarm Optimization (PSO and Recursive Neural Networks (RNNs. State-of-the-art method such as traditional RNN-based parsing strategy uses L-BFGS over the complete data for learning the parameters. However, this could cause problems due to the nondifferentiable objective function. In order to solve this problem, the PSO algorithm has been employed to tune the weights of RNN for minimizing the objective. Experimental results obtained on the Stanford background dataset show that our PSO-based training algorithm outperforms traditional RNN, Pixel CRF, region-based energy, simultaneous MRF, and superpixel MRF.

  17. Recursion Operators for Dispersionless KP Hierarchy

    International Nuclear Information System (INIS)

    Cheng Qiusheng; He Jingsong

    2012-01-01

    Based on the corresponding theorem between dispersionless KP (dKP) hierarchy and ħ-dependent KP (ħKP) hierarchy, a general formal representation of the recursion operators for dKP hierarchy under n-reduction is given in a systematical way from the corresponding ħKP hierarchy. To illustrate this method, the recursion operators for dKP hierarchy under 2-reduction and 3-reduction are calculated in detail.

  18. A new algorithm for recursive estimation of ARMA parameters in reactor noise analysis

    International Nuclear Information System (INIS)

    Tran Dinh Tri

    1992-01-01

    In this paper a new recursive algorithm for estimating the parameters of the Autoregressive Moving Average (ARMA) model from measured data is presented. The Yule-Walker equations for the case of the ARMA model are derived from the ARMA equation with innovations. The recursive algorithm is based on choosing an appropriate form of the operator functions and suitable representation of the (n + 1)-th order operator functions according to those with lower order. Two cases, when the order of the AR part is equal to that of the MA part, and the general case, were considered. (Author)

  19. A Timing-Driven Partitioning System for Multiple FPGAs

    Directory of Open Access Journals (Sweden)

    Kalapi Roy

    1996-01-01

    Full Text Available Field-programmable systems with multiple FPGAs on a PCB or an MCM are being used by system designers when a single FPGA is not sufficient. We address the problem of partitioning a large technology mapped FPGA circuit onto multiple FPGA devices of a specific target technology. The physical characteristics of the multiple FPGA system (MFS pose additional constraints to the circuit partitioning algorithms: the capacity of each FPGA, the timing constraints, the number of I/Os per FPGA, and the pre-designed interconnection patterns of each FPGA and the package. Existing partitioning techniques which minimize just the cut sizes of partitions fail to satisfy the above challenges. We therefore present a timing driven N-way partitioning algorithm based on simulated annealing for technology-mapped FPGA circuits. The signal path delays are estimated during partitioning using a timing model specific to a multiple FPGA architecture. The model combines all possible delay factors in a system with multiple FPGA chips of a target technology. Furthermore, we have incorporated a new dynamic net-weighting scheme to minimize the number of pin-outs for each chip. Finally, we have developed a graph-based global router for pin assignment which can handle the pre-routed connections of our MFS structure. In order to reduce the time spent in the simulated annealing phase of the partitioner, clusters of circuit components are identified by a new linear-time bottom-up clustering algorithm. The annealing-based N-way partitioner executes four times faster using the clusters as opposed to a flat netlist with improved partitioning results. For several industrial circuits, our approach outperforms the recursive min-cut bi-partitioning algorithm by 35% in terms of nets cut. Our approach also outperforms an industrial FPGA partitioner by 73% on average in terms of unroutable nets. Using the performance optimization capabilities in our approach we have successfully partitioned the

  20. Thinking recursively

    CERN Document Server

    Roberts, Eric S

    1986-01-01

    Concentrating on the practical value of recursion, this text, the first of its kind, is essential to computer science students' education. In this text, students will learn the concept and programming applications of recursive thinking. This will ultimately prepare students for advanced topics in computer science such as compiler construction, formal language theory, and the mathematical foundations of computer science.

  1. Structural properties of recursively partitionable graphs with connectivity 2

    DEFF Research Database (Denmark)

    Baudon, Olivier; Bensmail, Julien; Foucaud, Florent

    2017-01-01

    , namely the ones of being online arbitrarily partitionable and recursively arbitrarily partitionable (OL-AP and R-AP for short, respectively), in which the subgraphs induced by a partition of G must not only be con-nected but also ful_l additional conditions. In this paper, we point out some structural...... properties of OL-AP and R-AP graphs with connectivity 2. In particular, we show that deleting a cut pair of these graphs results in a graph with a bounded number of components, some of whom have a small number of vertices. We obtain these results by studying a simple class of 2-connected graphs called...

  2. Analysis and application of two recursive parametric estimation algorithms for an asynchronous machine

    International Nuclear Information System (INIS)

    Damek, Nawel; Kamoun, Samira

    2011-01-01

    In this communication, two recursive parametric estimation algorithms are analyzed and applied to an squirrelcage asynchronous machine located at the research ''Unit of Automatic Control'' (UCA) at ENIS. The first algorithm which, use the transfer matrix mathematical model, is based on the gradient principle. The second algorithm, which use the state-space mathematical model, is based on the minimization of the estimation error. These algorithms are applied as a key technique to estimate asynchronous machine with unknown, but constant or timevarying parameters. Stator voltage and current are used as measured data. The proposed recursive parametric estimation algorithms are validated on the experimental data of an asynchronous machine under normal operating condition as full load. The results show that these algorithms can estimate effectively the machine parameters with reliability.

  3. Betweenness-based algorithm for a partition scale-free graph

    International Nuclear Information System (INIS)

    Zhang Bai-Da; Wu Jun-Jie; Zhou Jing; Tang Yu-Hua

    2011-01-01

    Many real-world networks are found to be scale-free. However, graph partition technology, as a technology capable of parallel computing, performs poorly when scale-free graphs are provided. The reason for this is that traditional partitioning algorithms are designed for random networks and regular networks, rather than for scale-free networks. Multilevel graph-partitioning algorithms are currently considered to be the state of the art and are used extensively. In this paper, we analyse the reasons why traditional multilevel graph-partitioning algorithms perform poorly and present a new multilevel graph-partitioning paradigm, top down partitioning, which derives its name from the comparison with the traditional bottom—up partitioning. A new multilevel partitioning algorithm, named betweenness-based partitioning algorithm, is also presented as an implementation of top—down partitioning paradigm. An experimental evaluation of seven different real-world scale-free networks shows that the betweenness-based partitioning algorithm significantly outperforms the existing state-of-the-art approaches. (interdisciplinary physics and related areas of science and technology)

  4. PAQ: Partition Analysis of Quasispecies.

    Science.gov (United States)

    Baccam, P; Thompson, R J; Fedrigo, O; Carpenter, S; Cornette, J L

    2001-01-01

    The complexities of genetic data may not be accurately described by any single analytical tool. Phylogenetic analysis is often used to study the genetic relationship among different sequences. Evolutionary models and assumptions are invoked to reconstruct trees that describe the phylogenetic relationship among sequences. Genetic databases are rapidly accumulating large amounts of sequences. Newly acquired sequences, which have not yet been characterized, may require preliminary genetic exploration in order to build models describing the evolutionary relationship among sequences. There are clustering techniques that rely less on models of evolution, and thus may provide nice exploratory tools for identifying genetic similarities. Some of the more commonly used clustering methods perform better when data can be grouped into mutually exclusive groups. Genetic data from viral quasispecies, which consist of closely related variants that differ by small changes, however, may best be partitioned by overlapping groups. We have developed an intuitive exploratory program, Partition Analysis of Quasispecies (PAQ), which utilizes a non-hierarchical technique to partition sequences that are genetically similar. PAQ was used to analyze a data set of human immunodeficiency virus type 1 (HIV-1) envelope sequences isolated from different regions of the brain and another data set consisting of the equine infectious anemia virus (EIAV) regulatory gene rev. Analysis of the HIV-1 data set by PAQ was consistent with phylogenetic analysis of the same data, and the EIAV rev variants were partitioned into two overlapping groups. PAQ provides an additional tool which can be used to glean information from genetic data and can be used in conjunction with other tools to study genetic similarities and genetic evolution of viral quasispecies.

  5. Language and Recursion

    Science.gov (United States)

    Lowenthal, Francis

    2010-11-01

    This paper examines whether the recursive structure imbedded in some exercises used in the Non Verbal Communication Device (NVCD) approach is actually the factor that enables this approach to favor language acquisition and reacquisition in the case of children with cerebral lesions. For that a definition of the principle of recursion as it is used by logicians is presented. The two opposing approaches to the problem of language development are explained. For many authors such as Chomsky [1] the faculty of language is innate. This is known as the Standard Theory; the other researchers in this field, e.g. Bates and Elman [2], claim that language is entirely constructed by the young child: they thus speak of Language Acquisition. It is also shown that in both cases, a version of the principle of recursion is relevant for human language. The NVCD approach is defined and the results obtained in the domain of language while using this approach are presented: young subjects using this approach acquire a richer language structure or re-acquire such a structure in the case of cerebral lesions. Finally it is shown that exercises used in this framework imply the manipulation of recursive structures leading to regular grammars. It is thus hypothesized that language development could be favored using recursive structures with the young child. It could also be the case that the NVCD like exercises used with children lead to the elaboration of a regular language, as defined by Chomsky [3], which could be sufficient for language development but would not require full recursion. This double claim could reconcile Chomsky's approach with psychological observations made by adherents of the Language Acquisition approach, if it is confirmed by researches combining the use of NVCDs, psychometric methods and the use of Neural Networks. This paper thus suggests that a research group oriented towards this problematic should be organized.

  6. Geometric recursion

    DEFF Research Database (Denmark)

    Andersen, Jørgen Ellegaard; Borot, Gaëtan; Orantin, Nicolas

    We propose a general theory whose main component are functorial assignments ∑→Ω∑ ∈ E (∑), for a large class of functors E from a certain category of bordered surfaces (∑'s) to a suitable a target category of topological vector spaces. The construction is done by summing appropriate compositions...... as Poisson structures on the moduli space of flat connections. The theory has a wider scope than that and one expects that many functorial objects in low-dimensional geometry and topology should have a GR construction. The geometric recursion has various projections to topological recursion (TR) and we...... in particular show it retrieves all previous variants and applications of TR. We also show that, for any initial data for topological recursion, one can construct initial data for GR with values in Frobenius algebra-valued continuous functions on Teichmueller space, such that the ωg,n of TR are obtained...

  7. Adaptable recursive binary entropy coding technique

    Science.gov (United States)

    Kiely, Aaron B.; Klimesh, Matthew A.

    2002-07-01

    We present a novel data compression technique, called recursive interleaved entropy coding, that is based on recursive interleaving of variable-to variable length binary source codes. A compression module implementing this technique has the same functionality as arithmetic coding and can be used as the engine in various data compression algorithms. The encoder compresses a bit sequence by recursively encoding groups of bits that have similar estimated statistics, ordering the output in a way that is suited to the decoder. As a result, the decoder has low complexity. The encoding process for our technique is adaptable in that each bit to be encoded has an associated probability-of-zero estimate that may depend on previously encoded bits; this adaptability allows more effective compression. Recursive interleaved entropy coding may have advantages over arithmetic coding, including most notably the admission of a simple and fast decoder. Much variation is possible in the choice of component codes and in the interleaving structure, yielding coder designs of varying complexity and compression efficiency; coder designs that achieve arbitrarily small redundancy can be produced. We discuss coder design and performance estimation methods. We present practical encoding and decoding algorithms, as well as measured performance results.

  8. Simple recursion relations for general field theories

    International Nuclear Information System (INIS)

    Cheung, Clifford; Shen, Chia-Hsien; Trnka, Jaroslav

    2015-01-01

    On-shell methods offer an alternative definition of quantum field theory at tree-level, replacing Feynman diagrams with recursion relations and interaction vertices with a handful of seed scattering amplitudes. In this paper we determine the simplest recursion relations needed to construct a general four-dimensional quantum field theory of massless particles. For this purpose we define a covering space of recursion relations which naturally generalizes all existing constructions, including those of BCFW and Risager. The validity of each recursion relation hinges on the large momentum behavior of an n-point scattering amplitude under an m-line momentum shift, which we determine solely from dimensional analysis, Lorentz invariance, and locality. We show that all amplitudes in a renormalizable theory are 5-line constructible. Amplitudes are 3-line constructible if an external particle carries spin or if the scalars in the theory carry equal charge under a global or gauge symmetry. Remarkably, this implies the 3-line constructibility of all gauge theories with fermions and complex scalars in arbitrary representations, all supersymmetric theories, and the standard model. Moreover, all amplitudes in non-renormalizable theories without derivative interactions are constructible; with derivative interactions, a subset of amplitudes is constructible. We illustrate our results with examples from both renormalizable and non-renormalizable theories. Our study demonstrates both the power and limitations of recursion relations as a self-contained formulation of quantum field theory.

  9. Tracking of Multiple Moving Sources Using Recursive EM Algorithm

    Directory of Open Access Journals (Sweden)

    Böhme Johann F

    2005-01-01

    Full Text Available We deal with recursive direction-of-arrival (DOA estimation of multiple moving sources. Based on the recursive EM algorithm, we develop two recursive procedures to estimate the time-varying DOA parameter for narrowband signals. The first procedure requires no prior knowledge about the source movement. The second procedure assumes that the motion of moving sources is described by a linear polynomial model. The proposed recursion updates the polynomial coefficients when a new data arrives. The suggested approaches have two major advantages: simple implementation and easy extension to wideband signals. Numerical experiments show that both procedures provide excellent results in a slowly changing environment. When the DOA parameter changes fast or two source directions cross with each other, the procedure designed for a linear polynomial model has a better performance than the general procedure. Compared to the beamforming technique based on the same parameterization, our approach is computationally favorable and has a wider range of applications.

  10. A recursive field-normalized bibliometric performance indicator: an application to the field of library and information science.

    Science.gov (United States)

    Waltman, Ludo; Yan, Erjia; van Eck, Nees Jan

    2011-10-01

    Two commonly used ideas in the development of citation-based research performance indicators are the idea of normalizing citation counts based on a field classification scheme and the idea of recursive citation weighing (like in PageRank-inspired indicators). We combine these two ideas in a single indicator, referred to as the recursive mean normalized citation score indicator, and we study the validity of this indicator. Our empirical analysis shows that the proposed indicator is highly sensitive to the field classification scheme that is used. The indicator also has a strong tendency to reinforce biases caused by the classification scheme. Based on these observations, we advise against the use of indicators in which the idea of normalization based on a field classification scheme and the idea of recursive citation weighing are combined.

  11. A novel intrusion detection method based on OCSVM and K-means recursive clustering

    Directory of Open Access Journals (Sweden)

    Leandros A. Maglaras

    2015-01-01

    Full Text Available In this paper we present an intrusion detection module capable of detecting malicious network traffic in a SCADA (Supervisory Control and Data Acquisition system, based on the combination of One-Class Support Vector Machine (OCSVM with RBF kernel and recursive k-means clustering. Important parameters of OCSVM, such as Gaussian width o and parameter v affect the performance of the classifier. Tuning of these parameters is of great importance in order to avoid false positives and over fitting. The combination of OCSVM with recursive k- means clustering leads the proposed intrusion detection module to distinguish real alarms from possible attacks regardless of the values of parameters o and v, making it ideal for real-time intrusion detection mechanisms for SCADA systems. Extensive simulations have been conducted with datasets extracted from small and medium sized HTB SCADA testbeds, in order to compare the accuracy, false alarm rate and execution time against the base line OCSVM method.

  12. Adding Recursive Constructs to Bialgebraic Semantics

    DEFF Research Database (Denmark)

    Klin, Bartek

    2004-01-01

    This paper aims at fitting a general class of recursive equations into the framework of ‘well-behaved' structural operational semantics, formalized as bialgebraic semantics by Turi and Plotkin. Rather than interpreting recursive constructs by means of operational rules, separate recursive equatio...

  13. Conjugate gradient algorithms using multiple recursions

    Energy Technology Data Exchange (ETDEWEB)

    Barth, T.; Manteuffel, T.

    1996-12-31

    Much is already known about when a conjugate gradient method can be implemented with short recursions for the direction vectors. The work done in 1984 by Faber and Manteuffel gave necessary and sufficient conditions on the iteration matrix A, in order for a conjugate gradient method to be implemented with a single recursion of a certain form. However, this form does not take into account all possible recursions. This became evident when Jagels and Reichel used an algorithm of Gragg for unitary matrices to demonstrate that the class of matrices for which a practical conjugate gradient algorithm exists can be extended to include unitary and shifted unitary matrices. The implementation uses short double recursions for the direction vectors. This motivates the study of multiple recursion algorithms.

  14. Cross-Validation of Survival Bump Hunting by Recursive Peeling Methods.

    Science.gov (United States)

    Dazard, Jean-Eudes; Choe, Michael; LeBlanc, Michael; Rao, J Sunil

    2014-08-01

    We introduce a survival/risk bump hunting framework to build a bump hunting model with a possibly censored time-to-event type of response and to validate model estimates. First, we describe the use of adequate survival peeling criteria to build a survival/risk bump hunting model based on recursive peeling methods. Our method called "Patient Recursive Survival Peeling" is a rule-induction method that makes use of specific peeling criteria such as hazard ratio or log-rank statistics. Second, to validate our model estimates and improve survival prediction accuracy, we describe a resampling-based validation technique specifically designed for the joint task of decision rule making by recursive peeling (i.e. decision-box) and survival estimation. This alternative technique, called "combined" cross-validation is done by combining test samples over the cross-validation loops, a design allowing for bump hunting by recursive peeling in a survival setting. We provide empirical results showing the importance of cross-validation and replication.

  15. Recursive solution for dynamic response of one-dimensional structures with time-dependent boundary conditions

    Energy Technology Data Exchange (ETDEWEB)

    Abadi, Mohammad Tahaye [Aerospace Research Institute, Tehran (Iran, Islamic Republic of)

    2015-10-15

    A recursive solution method is derived for the transient response of one-dimensional structures subjected to the general form of time dependent boundary conditions. Unlike previous solution methods that assumed the separation of variables, the present method involves formulating and solving the dynamic problems using the summation of two single-argument functions satisfying the motion equation. Based on boundary and initial conditions, a recursive procedure is derived to determine the single-argument functions. Such a procedure is applied to the general form of boundary conditions, and an analytical solution is derived by solving the recursive equation. The present solution method is implemented for base excitation problems, and the results are compared with those of the previous analytical solution and the Finite element (FE) analysis. The FE results converge to the present analytical solution, although considerable error is found in predicting a solution method on the basis of the separation of variables. The present analytical solution predicts the transient response for wave propagation problems in broadband excitation frequencies.

  16. Recursive solution for dynamic response of one-dimensional structures with time-dependent boundary conditions

    International Nuclear Information System (INIS)

    Abadi, Mohammad Tahaye

    2015-01-01

    A recursive solution method is derived for the transient response of one-dimensional structures subjected to the general form of time dependent boundary conditions. Unlike previous solution methods that assumed the separation of variables, the present method involves formulating and solving the dynamic problems using the summation of two single-argument functions satisfying the motion equation. Based on boundary and initial conditions, a recursive procedure is derived to determine the single-argument functions. Such a procedure is applied to the general form of boundary conditions, and an analytical solution is derived by solving the recursive equation. The present solution method is implemented for base excitation problems, and the results are compared with those of the previous analytical solution and the Finite element (FE) analysis. The FE results converge to the present analytical solution, although considerable error is found in predicting a solution method on the basis of the separation of variables. The present analytical solution predicts the transient response for wave propagation problems in broadband excitation frequencies.

  17. PATH ANALYSIS WITH LOGISTIC REGRESSION MODELS : EFFECT ANALYSIS OF FULLY RECURSIVE CAUSAL SYSTEMS OF CATEGORICAL VARIABLES

    OpenAIRE

    Nobuoki, Eshima; Minoru, Tabata; Geng, Zhi; Department of Medical Information Analysis, Faculty of Medicine, Oita Medical University; Department of Applied Mathematics, Faculty of Engineering, Kobe University; Department of Probability and Statistics, Peking University

    2001-01-01

    This paper discusses path analysis of categorical variables with logistic regression models. The total, direct and indirect effects in fully recursive causal systems are considered by using model parameters. These effects can be explained in terms of log odds ratios, uncertainty differences, and an inner product of explanatory variables and a response variable. A study on food choice of alligators as a numerical exampleis reanalysed to illustrate the present approach.

  18. Accelerated solution of non-linear flow problems using Chebyshev iteration polynomial based RK recursions

    Energy Technology Data Exchange (ETDEWEB)

    Lorber, A.A.; Carey, G.F.; Bova, S.W.; Harle, C.H. [Univ. of Texas, Austin, TX (United States)

    1996-12-31

    The connection between the solution of linear systems of equations by iterative methods and explicit time stepping techniques is used to accelerate to steady state the solution of ODE systems arising from discretized PDEs which may involve either physical or artificial transient terms. Specifically, a class of Runge-Kutta (RK) time integration schemes with extended stability domains has been used to develop recursion formulas which lead to accelerated iterative performance. The coefficients for the RK schemes are chosen based on the theory of Chebyshev iteration polynomials in conjunction with a local linear stability analysis. We refer to these schemes as Chebyshev Parameterized Runge Kutta (CPRK) methods. CPRK methods of one to four stages are derived as functions of the parameters which describe an ellipse {Epsilon} which the stability domain of the methods is known to contain. Of particular interest are two-stage, first-order CPRK and four-stage, first-order methods. It is found that the former method can be identified with any two-stage RK method through the correct choice of parameters. The latter method is found to have a wide range of stability domains, with a maximum extension of 32 along the real axis. Recursion performance results are presented below for a model linear convection-diffusion problem as well as non-linear fluid flow problems discretized by both finite-difference and finite-element methods.

  19. Partition of some key regulating services in terrestrial ecosystems: Meta-analysis and review

    Energy Technology Data Exchange (ETDEWEB)

    Viglizzo, E.F., E-mail: evigliz@cpenet.com.ar [INTA, EEA Anguil, Grupo de Investigaciones en Gestión Ambiental (GIGA), Av. Spinetto 785, 6300 Santa Rosa, La Pampa (Argentina); INCITAP-CONICET, Ruta 35, km 335, 6300 Santa Rosa, La Pampa (Argentina); UNLPam, Facultad de Ciencias Exactas y Naturales, Av. Uruguay 151, 6300 Santa Rosa, La Pampa (Argentina); Jobbágy, E.G. [CONICET, Andes 950, 5700 San Luis, San Luis (Argentina); Grupo de Estudios Ambientales IMASL, Ejército de los, Andes 950, 5700 San Luis, San Luis (Argentina); Ricard, M.F. [INCITAP-CONICET, Ruta 35, km 335, 6300 Santa Rosa, La Pampa (Argentina); UNLPam, Facultad de Ciencias Exactas y Naturales, Av. Uruguay 151, 6300 Santa Rosa, La Pampa (Argentina); Paruelo, J.M. [Laboratorio de Análisis Regional y Teledetección, Departamento de Métodos Cuantitativos Sistemas de información, Facultad de Agronomía and IFEVA, Universidad de Buenos Aires and CONICET, Av. San Martín 4453, 1417 Buenos Aires (Argentina)

    2016-08-15

    Our knowledge about the functional foundations of ecosystem service (ES) provision is still limited and more research is needed to elucidate key functional mechanisms. Using a simplified eco-hydrological scheme, in this work we analyzed how land-use decisions modify the partition of some essential regulatory ES by altering basic relationships between biomass stocks and water flows. A comprehensive meta-analysis and review was conducted based on global, regional and local data from peer-reviewed publications. We analyzed five datasets comprising 1348 studies and 3948 records on precipitation (PPT), aboveground biomass (AGB), AGB change, evapotranspiration (ET), water yield (WY), WY change, runoff (R) and infiltration (I). The conceptual framework was focused on ES that are associated with the ecological functions (e.g., intermediate ES) of ET, WY, R and I. ES included soil protection, carbon sequestration, local climate regulation, water-flow regulation and water recharge. To address the problem of data normality, the analysis included both parametric and non-parametric regression analysis. Results demonstrate that PPT is a first-order biophysical factor that controls ES release at the broader scales. At decreasing scales, ES are partitioned as result of PPT interactions with other biophysical and anthropogenic factors. At intermediate scales, land-use change interacts with PPT modifying ES partition as it the case of afforestation in dry regions, where ET and climate regulation may be enhanced at the expense of R and water-flow regulation. At smaller scales, site-specific conditions such as topography interact with PPT and AGB displaying different ES partition formats. The probable implications of future land-use and climate change on some key ES production and partition are discussed. - Highlights: • The partition of regulatory services in ecosystems poses a major policy challenge. • We examined how partitions occur at the hydrosphere

  20. Partition of some key regulating services in terrestrial ecosystems: Meta-analysis and review

    International Nuclear Information System (INIS)

    Viglizzo, E.F.; Jobbágy, E.G.; Ricard, M.F.; Paruelo, J.M.

    2016-01-01

    Our knowledge about the functional foundations of ecosystem service (ES) provision is still limited and more research is needed to elucidate key functional mechanisms. Using a simplified eco-hydrological scheme, in this work we analyzed how land-use decisions modify the partition of some essential regulatory ES by altering basic relationships between biomass stocks and water flows. A comprehensive meta-analysis and review was conducted based on global, regional and local data from peer-reviewed publications. We analyzed five datasets comprising 1348 studies and 3948 records on precipitation (PPT), aboveground biomass (AGB), AGB change, evapotranspiration (ET), water yield (WY), WY change, runoff (R) and infiltration (I). The conceptual framework was focused on ES that are associated with the ecological functions (e.g., intermediate ES) of ET, WY, R and I. ES included soil protection, carbon sequestration, local climate regulation, water-flow regulation and water recharge. To address the problem of data normality, the analysis included both parametric and non-parametric regression analysis. Results demonstrate that PPT is a first-order biophysical factor that controls ES release at the broader scales. At decreasing scales, ES are partitioned as result of PPT interactions with other biophysical and anthropogenic factors. At intermediate scales, land-use change interacts with PPT modifying ES partition as it the case of afforestation in dry regions, where ET and climate regulation may be enhanced at the expense of R and water-flow regulation. At smaller scales, site-specific conditions such as topography interact with PPT and AGB displaying different ES partition formats. The probable implications of future land-use and climate change on some key ES production and partition are discussed. - Highlights: • The partition of regulatory services in ecosystems poses a major policy challenge. • We examined how partitions occur at the hydrosphere

  1. BPSK Receiver Based on Recursive Adaptive Filter with Remodulation

    Directory of Open Access Journals (Sweden)

    N. Milosevic

    2011-12-01

    Full Text Available This paper proposes a new binary phase shift keying (BPSK signal receiver intended for reception under conditions of significant carrier frequency offsets. The recursive adaptive filter with least mean squares (LMS adaptation is used. The proposed receiver has a constant, defining the balance between the recursive and the nonrecursive part of the filter, whose proper choice allows a simple construction of the receiver. The correct choice of this parameter could result in unitary length of the filter. The proposed receiver has performance very close to the performance of the BPSK receiver with perfect frequency synchronization, in a wide range of frequency offsets (plus/minus quarter of the signal bandwidth. The results obtained by the software simulation are confirmed by the experimental results measured on the receiver realized with the universal software radio peripheral (USRP, with the baseband signal processing at personal computer (PC.

  2. All-Pole Recursive Digital Filters Design Based on Ultraspherical Polynomials

    Directory of Open Access Journals (Sweden)

    N. Stojanovic

    2014-09-01

    Full Text Available A simple method for approximation of all-pole recursive digital filters, directly in digital domain, is described. Transfer function of these filters, referred to as Ultraspherical filters, is controlled by order of the Ultraspherical polynomial, nu. Parameter nu, restricted to be a nonnegative real number (nu ≥ 0, controls ripple peaks in the passband of the magnitude response and enables a trade-off between the passband loss and the group delay response of the resulting filter. Chebyshev filters of the first and of the second kind, and also Legendre and Butterworth filters are shown to be special cases of these allpole recursive digital filters. Closed form equations for the computation of the filter coefficients are provided. The design technique is illustrated with examples.

  3. Recursive wind speed forecasting based on Hammerstein Auto-Regressive model

    International Nuclear Information System (INIS)

    Ait Maatallah, Othman; Achuthan, Ajit; Janoyan, Kerop; Marzocca, Pier

    2015-01-01

    Highlights: • Developed a new recursive WSF model for 1–24 h horizon based on Hammerstein model. • Nonlinear HAR model successfully captured chaotic dynamics of wind speed time series. • Recursive WSF intrinsic error accumulation corrected by applying rotation. • Model verified for real wind speed data from two sites with different characteristics. • HAR model outperformed both ARIMA and ANN models in terms of accuracy of prediction. - Abstract: A new Wind Speed Forecasting (WSF) model, suitable for a short term 1–24 h forecast horizon, is developed by adapting Hammerstein model to an Autoregressive approach. The model is applied to real data collected for a period of three years (2004–2006) from two different sites. The performance of HAR model is evaluated by comparing its prediction with the classical Autoregressive Integrated Moving Average (ARIMA) model and a multi-layer perceptron Artificial Neural Network (ANN). Results show that the HAR model outperforms both the ARIMA model and ANN model in terms of root mean square error (RMSE), mean absolute error (MAE), and Mean Absolute Percentage Error (MAPE). When compared to the conventional models, the new HAR model can better capture various wind speed characteristics, including asymmetric (non-gaussian) wind speed distribution, non-stationary time series profile, and the chaotic dynamics. The new model is beneficial for various applications in the renewable energy area, particularly for power scheduling

  4. Continued development of recursive thinking in adolescence : Longitudinal analyses with a revised recursive thinking test

    NARCIS (Netherlands)

    van den Bos, E.; de Rooij, M.; Sumter, S.R.; Westenberg, P.M.

    2016-01-01

    The present study adds to the emerging literature on the development of social cognition in adolescence by investigating the development of recursive thinking (i.e., thinking about thinking). Previous studies have indicated that the development of recursive thinking is not completed during

  5. Proof Rules for Recursive Procedures

    NARCIS (Netherlands)

    Hesselink, Wim H.

    1993-01-01

    Four proof rules for recursive procedures in a Pascal-like language are presented. The main rule deals with total correctness and is based on results of Gries and Martin. The rule is easier to apply than Martin's. It is introduced as an extension of a specification format for Pascal-procedures, with

  6. How Learning Logic Programming Affects Recursion Comprehension

    Science.gov (United States)

    Haberman, Bruria

    2004-01-01

    Recursion is a central concept in computer science, yet it is difficult for beginners to comprehend. Israeli high-school students learn recursion in the framework of a special modular program in computer science (Gal-Ezer & Harel, 1999). Some of them are introduced to the concept of recursion in two different paradigms: the procedural…

  7. Recursive regularization step for high-order lattice Boltzmann methods

    Science.gov (United States)

    Coreixas, Christophe; Wissocq, Gauthier; Puigt, Guillaume; Boussuge, Jean-François; Sagaut, Pierre

    2017-09-01

    A lattice Boltzmann method (LBM) with enhanced stability and accuracy is presented for various Hermite tensor-based lattice structures. The collision operator relies on a regularization step, which is here improved through a recursive computation of nonequilibrium Hermite polynomial coefficients. In addition to the reduced computational cost of this procedure with respect to the standard one, the recursive step allows to considerably enhance the stability and accuracy of the numerical scheme by properly filtering out second- (and higher-) order nonhydrodynamic contributions in under-resolved conditions. This is first shown in the isothermal case where the simulation of the doubly periodic shear layer is performed with a Reynolds number ranging from 104 to 106, and where a thorough analysis of the case at Re=3 ×104 is conducted. In the latter, results obtained using both regularization steps are compared against the Bhatnagar-Gross-Krook LBM for standard (D2Q9) and high-order (D2V17 and D2V37) lattice structures, confirming the tremendous increase of stability range of the proposed approach. Further comparisons on thermal and fully compressible flows, using the general extension of this procedure, are then conducted through the numerical simulation of Sod shock tubes with the D2V37 lattice. They confirm the stability increase induced by the recursive approach as compared with the standard one.

  8. Probabilistic Decision Based Block Partitioning for Future Video Coding

    KAUST Repository

    Wang, Zhao

    2017-11-29

    In the latest Joint Video Exploration Team development, the quadtree plus binary tree (QTBT) block partitioning structure has been proposed for future video coding. Compared to the traditional quadtree structure of High Efficiency Video Coding (HEVC) standard, QTBT provides more flexible patterns for splitting the blocks, which results in dramatically increased combinations of block partitions and high computational complexity. In view of this, a confidence interval based early termination (CIET) scheme is proposed for QTBT to identify the unnecessary partition modes in the sense of rate-distortion (RD) optimization. In particular, a RD model is established to predict the RD cost of each partition pattern without the full encoding process. Subsequently, the mode decision problem is casted into a probabilistic framework to select the final partition based on the confidence interval decision strategy. Experimental results show that the proposed CIET algorithm can speed up QTBT block partitioning structure by reducing 54.7% encoding time with only 1.12% increase in terms of bit rate. Moreover, the proposed scheme performs consistently well for the high resolution sequences, of which the video coding efficiency is crucial in real applications.

  9. The recursive solution of the Schroedinger equation

    International Nuclear Information System (INIS)

    Haydock, R.

    The transformation of an arbitrary quantum model and its subsequent analysis is proposed. The chain expresses mathematically the physical concept of local environment. The recursive transformation yields analytic chains for some systems, but it is also convenient and efficient for constructing numerical chain models enabling the solution of problems which are too big for numerical matrix methods. The chain model sugests new approach to quantum mechanical models. Because of the simple solution of chain models, the qualitative behaviour of different physical properties can be determined. Unlike many methods for solving quantum models, one has rigorous results about the convergence of approximation. Because they are defined recursively, the approsimations are suited to computation. (Ha)

  10. A Revised Piecewise Linear Recursive Convolution FDTD Method for Magnetized Plasmas

    International Nuclear Information System (INIS)

    Liu Song; Zhong Shuangying; Liu Shaobin

    2005-01-01

    The piecewise linear recursive convolution (PLRC) finite-different time-domain (FDTD) method improves accuracy over the original recursive convolution (RC) FDTD approach and current density convolution (JEC) but retains their advantages in speed and efficiency. This paper describes a revised piecewise linear recursive convolution PLRC-FDTD formulation for magnetized plasma which incorporates both anisotropy and frequency dispersion at the same time, enabling the transient analysis of magnetized plasma media. The technique is illustrated by numerical simulations of the reflection and transmission coefficients through a magnetized plasma layer. The results show that the revised PLRC-FDTD method has improved the accuracy over the original RC FDTD method and JEC FDTD method

  11. Recursive B-spline approximation using the Kalman filter

    Directory of Open Access Journals (Sweden)

    Jens Jauch

    2017-02-01

    Full Text Available This paper proposes a novel recursive B-spline approximation (RBA algorithm which approximates an unbounded number of data points with a B-spline function and achieves lower computational effort compared with previous algorithms. Conventional recursive algorithms based on the Kalman filter (KF restrict the approximation to a bounded and predefined interval. Conversely RBA includes a novel shift operation that enables to shift estimated B-spline coefficients in the state vector of a KF. This allows to adapt the interval in which the B-spline function can approximate data points during run-time.

  12. Adaptable Iterative and Recursive Kalman Filter Schemes

    Science.gov (United States)

    Zanetti, Renato

    2014-01-01

    Nonlinear filters are often very computationally expensive and usually not suitable for real-time applications. Real-time navigation algorithms are typically based on linear estimators, such as the extended Kalman filter (EKF) and, to a much lesser extent, the unscented Kalman filter. The Iterated Kalman filter (IKF) and the Recursive Update Filter (RUF) are two algorithms that reduce the consequences of the linearization assumption of the EKF by performing N updates for each new measurement, where N is the number of recursions, a tuning parameter. This paper introduces an adaptable RUF algorithm to calculate N on the go, a similar technique can be used for the IKF as well.

  13. Probabilistic Decision Based Block Partitioning for Future Video Coding

    KAUST Repository

    Wang, Zhao; Wang, Shiqi; Zhang, Jian; Wang, Shanshe; Ma, Siwei

    2017-01-01

    , the mode decision problem is casted into a probabilistic framework to select the final partition based on the confidence interval decision strategy. Experimental results show that the proposed CIET algorithm can speed up QTBT block partitioning structure

  14. Cosymmetries and Nijenhuis recursion operators for difference equations

    International Nuclear Information System (INIS)

    Mikhailov, Alexander V; Xenitidis, Pavlos; Wang, Jing Ping

    2011-01-01

    In this paper we discuss the concept of cosymmetries and co-recursion operators for difference equations and present a co-recursion operator for the Viallet equation. We also discover a new type of factorization for the recursion operators of difference equations. This factorization enables us to give an elegant proof that the pseudo-difference operator R presented in Mikhailov et al 2011 Theor. Math. Phys. 167 421–43 is a recursion operator for the Viallet equation. Moreover, we show that the operator R is Nijenhuis and thus generates infinitely many commuting local symmetries. The recursion operator R and its factorization into Hamiltonian and symplectic operators have natural applications to Yamilov's discretization of the Krichever–Novikov equation

  15. COMPARISON OF RECURSIVE ESTIMATION TECHNIQUES FOR POSITION TRACKING RADIOACTIVE SOURCES

    International Nuclear Information System (INIS)

    Muske, K.; Howse, J.

    2000-01-01

    This paper compares the performance of recursive state estimation techniques for tracking the physical location of a radioactive source within a room based on radiation measurements obtained from a series of detectors at fixed locations. Specifically, the extended Kalman filter, algebraic observer, and nonlinear least squares techniques are investigated. The results of this study indicate that recursive least squares estimation significantly outperforms the other techniques due to the severe model nonlinearity

  16. Recursive parameter estimation for Hammerstein-Wiener systems using modified EKF algorithm.

    Science.gov (United States)

    Yu, Feng; Mao, Zhizhong; Yuan, Ping; He, Dakuo; Jia, Mingxing

    2017-09-01

    This paper focuses on the recursive parameter estimation for the single input single output Hammerstein-Wiener system model, and the study is then extended to a rarely mentioned multiple input single output Hammerstein-Wiener system. Inspired by the extended Kalman filter algorithm, two basic recursive algorithms are derived from the first and the second order Taylor approximation. Based on the form of the first order approximation algorithm, a modified algorithm with larger parameter convergence domain is proposed to cope with the problem of small parameter convergence domain of the first order one and the application limit of the second order one. The validity of the modification on the expansion of convergence domain is shown from the convergence analysis and is demonstrated with two simulation cases. Copyright © 2017 ISA. Published by Elsevier Ltd. All rights reserved.

  17. Recursion Relations for Conformal Blocks

    CERN Document Server

    Penedones, João; Yamazaki, Masahito

    2016-09-12

    In the context of conformal field theories in general space-time dimension, we find all the possible singularities of the conformal blocks as functions of the scaling dimension $\\Delta$ of the exchanged operator. In particular, we argue, using representation theory of parabolic Verma modules, that in odd spacetime dimension the singularities are only simple poles. We discuss how to use this information to write recursion relations that determine the conformal blocks. We first recover the recursion relation introduced in 1307.6856 for conformal blocks of external scalar operators. We then generalize this recursion relation for the conformal blocks associated to the four point function of three scalar and one vector operator. Finally we specialize to the case in which the vector operator is a conserved current.

  18. Recursive subspace identification for in flight modal analysis of airplanes

    OpenAIRE

    De Cock , Katrien; Mercère , Guillaume; De Moor , Bart

    2006-01-01

    International audience; In this paper recursive subspace identification algorithms are applied to track the modal parameters of airplanes on-line during test flights. The ability to track changes in the damping ratios and the influence of the forgetting factor are studied through simulations.

  19. Chaos synchronization basing on symbolic dynamics with nongenerating partition.

    Science.gov (United States)

    Wang, Xingyuan; Wang, Mogei; Liu, Zhenzhen

    2009-06-01

    Using symbolic dynamics and information theory, we study the information transmission needed for synchronizing unidirectionally coupled oscillators. It is found that when sustaining chaos synchronization with nongenerating partition, the synchronization error will be larger than a critical value, although the required coupled channel capacity can be smaller than the case of using a generating partition. Then we show that no matter whether a generating or nongenerating partition is in use, a high-quality detector can guarantee the lead of the response oscillator, while the lag responding can make up the low precision of the detector. A practicable synchronization scheme basing on a nongenerating partition is also proposed in this paper.

  20. A Survey on Teaching and Learning Recursive Programming

    Science.gov (United States)

    Rinderknecht, Christian

    2014-01-01

    We survey the literature about the teaching and learning of recursive programming. After a short history of the advent of recursion in programming languages and its adoption by programmers, we present curricular approaches to recursion, including a review of textbooks and some programming methodology, as well as the functional and imperative…

  1. Geometrical interpretation of the topological recursion, and integrable string theories

    CERN Document Server

    Eynard, Bertrand

    2009-01-01

    Symplectic invariants introduced in math-ph/0702045 can be computed for an arbitrary spectral curve. For some examples of spectral curves, those invariants can solve loop equations of matrix integrals, and many problems of enumerative geometry like maps, partitions, Hurwitz numbers, intersection numbers, Gromov-Witten invariants... The problem is thus to understand what they count, or in other words, given a spectral curve, construct an enumerative geometry problem. This is what we do in a semi-heuristic approach in this article. Starting from a spectral curve, i.e. an integrable system, we use its flat connection and flat coordinates, to define a family of worldsheets, whose enumeration is indeed solved by the topological recursion and symplectic invariants. In other words, for any spectral curve, we construct a corresponding string theory, whose target space is a submanifold of the Jacobian.

  2. Nonasymptotic form of the recursion relations of the three-dimensional Ising model

    International Nuclear Information System (INIS)

    Kozlovskii, M.P.

    1989-01-01

    Approximate recursion relations for the three-dimensional Ising model are obtained in the form of rapidly converging series. The representation of the recursion relations in the form of nonasymptotic series entails the abandonment of traditional perturbation theory based on a Gaussian measure density. The recursion relations proposed in the paper are used to calculate the critical exponent ν of the correlation length. It is shown that the difference form of the recursion relations leads, when higher non-Gaussian basis measures are used, to disappearance of a dependence of the critical exponent ν on s when s > 2 (s is the parameter of the division of the phase space into layers). The obtained results make it possible to calculate explicit expressions for the thermodynamic functions near the phase transition point

  3. Error Analysis of Explicit Partitioned Runge–Kutta Schemes for Conservation Laws

    KAUST Repository

    Hundsdorfer, Willem

    2014-08-27

    An error analysis is presented for explicit partitioned Runge–Kutta methods and multirate methods applied to conservation laws. The interfaces, across which different methods or time steps are used, lead to order reduction of the schemes. Along with cell-based decompositions, also flux-based decompositions are studied. In the latter case mass conservation is guaranteed, but it will be seen that the accuracy may deteriorate.

  4. Error Analysis of Explicit Partitioned Runge–Kutta Schemes for Conservation Laws

    KAUST Repository

    Hundsdorfer, Willem; Ketcheson, David I.; Savostianov, Igor

    2014-01-01

    An error analysis is presented for explicit partitioned Runge–Kutta methods and multirate methods applied to conservation laws. The interfaces, across which different methods or time steps are used, lead to order reduction of the schemes. Along with cell-based decompositions, also flux-based decompositions are studied. In the latter case mass conservation is guaranteed, but it will be seen that the accuracy may deteriorate.

  5. a Recursive Approach to Compute Normal Forms

    Science.gov (United States)

    HSU, L.; MIN, L. J.; FAVRETTO, L.

    2001-06-01

    Normal forms are instrumental in the analysis of dynamical systems described by ordinary differential equations, particularly when singularities close to a bifurcation are to be characterized. However, the computation of a normal form up to an arbitrary order is numerically hard. This paper focuses on the computer programming of some recursive formulas developed earlier to compute higher order normal forms. A computer program to reduce the system to its normal form on a center manifold is developed using the Maple symbolic language. However, it should be stressed that the program relies essentially on recursive numerical computations, while symbolic calculations are used only for minor tasks. Some strategies are proposed to save computation time. Examples are presented to illustrate the application of the program to obtain high order normalization or to handle systems with large dimension.

  6. On Recursive Modification in Child L1 French

    Directory of Open Access Journals (Sweden)

    Yves Roberge

    2018-03-01

    Full Text Available This paper investigates nominal recursive modification (RM in the L1 acquisition of French. Although recursion is considered the fundamental property of human languages, recursive self-embedding is found to be difficult for children in a variety of languages and constructions. Despite these challenges, the acquisition of RM proves to be resilient; acquirable even under severely degraded input conditions. From a minimalist perspective on the operations of narrow syntax, recursive embedding is essentially the application of a sequence of Merge operations (Chomsky 1995; Trotzke and Zwart 2014; therefore, given the universality of Merge, we do not expect to find cross-linguistic differences in how difficult recursion is. But if the challenging nature of recursion stems from factors which might differ from language to language, we expect different outcomes cross-linguistically. We compare new data from French to existing English data (Pérez-Leroux et al. 2012 in order to examine to what extent language-specific properties of RM structures determine the acquisition path. While children’s production differs significantly from their adult’s counterparts, we find no differences between French-speaking and English-speaking children. Our findings suggest that the challenging nature of recursion does not stem from the grammar itself and that what shapes the acquisition path is the interaction between universal properties of language and considerations not specific to language, namely computational efficiency.

  7. Recursive relations for a quiver gauge theory

    International Nuclear Information System (INIS)

    Park, Jaemo; Sim, Woojoo

    2006-01-01

    We study the recursive relations for a quiver gauge theory with the gauge group SU(N 1 ) x SU(N 2 ) with bifundamental fermions transforming as (N 1 , N-bar 2 ). We work out the recursive relation for the amplitudes involving a pair of quark and antiquark and gluons of each gauge group. We realize directly in the recursive relations the invariance under the order preserving permutations of the gluons of the first and the second gauge group. We check the proposed relations for MHV, 6-point and 7-point amplitudes and find the agreements with the known results and the known relations with the single gauge group amplitudes. The proposed recursive relation is much more efficient in calculating the amplitudes than using the known relations with the amplitudes of the single gauge group

  8. [On the partition of acupuncture academic schools].

    Science.gov (United States)

    Yang, Pengyan; Luo, Xi; Xia, Youbing

    2016-05-01

    Nowadays extensive attention has been paid on the research of acupuncture academic schools, however, a widely accepted method of partition of acupuncture academic schools is still in need. In this paper, the methods of partition of acupuncture academic schools in the history have been arranged, and three typical methods of"partition of five schools" "partition of eighteen schools" and "two-stage based partition" are summarized. After adeep analysis on the disadvantages and advantages of these three methods, a new method of partition of acupuncture academic schools that is called "three-stage based partition" is proposed. In this method, after the overall acupuncture academic schools are divided into an ancient stage, a modern stage and a contemporary stage, each schoolis divided into its sub-school category. It is believed that this method of partition can remedy the weaknesses ofcurrent methods, but also explore a new model of inheritance and development under a different aspect through thedifferentiation and interaction of acupuncture academic schools at three stages.

  9. Recursive Neural Networks in Quark/Gluon Tagging

    CERN Multimedia

    CERN. Geneva

    2018-01-01

    Vidyo contribution Based on the natural tree-like structure of jet sequential clustering, the recursive neural networks (RecNNs) embed jet clustering history recursively as in natural language processing. We explore the performance of RecNN in quark/gluon discrimination. The results show that RecNNs work better than the baseline BDT by a few percent in gluon rejection at the working point of 50\\% quark acceptance. We also experimented on some relevant aspects which might influence the performance of networks. It shows that even only particle flow identification as input feature without any extra information on momentum or angular position is already giving a fairly good result, which indicates that most of the information for q/g discrimination is already included in the tree-structure itself.

  10. Multiple predictor smoothing methods for sensitivity analysis.

    Energy Technology Data Exchange (ETDEWEB)

    Helton, Jon Craig; Storlie, Curtis B.

    2006-08-01

    The use of multiple predictor smoothing methods in sampling-based sensitivity analyses of complex models is investigated. Specifically, sensitivity analysis procedures based on smoothing methods employing the stepwise application of the following nonparametric regression techniques are described: (1) locally weighted regression (LOESS), (2) additive models, (3) projection pursuit regression, and (4) recursive partitioning regression. The indicated procedures are illustrated with both simple test problems and results from a performance assessment for a radioactive waste disposal facility (i.e., the Waste Isolation Pilot Plant). As shown by the example illustrations, the use of smoothing procedures based on nonparametric regression techniques can yield more informative sensitivity analysis results than can be obtained with more traditional sensitivity analysis procedures based on linear regression, rank regression or quadratic regression when nonlinear relationships between model inputs and model predictions are present.

  11. Multiple predictor smoothing methods for sensitivity analysis

    International Nuclear Information System (INIS)

    Helton, Jon Craig; Storlie, Curtis B.

    2006-01-01

    The use of multiple predictor smoothing methods in sampling-based sensitivity analyses of complex models is investigated. Specifically, sensitivity analysis procedures based on smoothing methods employing the stepwise application of the following nonparametric regression techniques are described: (1) locally weighted regression (LOESS), (2) additive models, (3) projection pursuit regression, and (4) recursive partitioning regression. The indicated procedures are illustrated with both simple test problems and results from a performance assessment for a radioactive waste disposal facility (i.e., the Waste Isolation Pilot Plant). As shown by the example illustrations, the use of smoothing procedures based on nonparametric regression techniques can yield more informative sensitivity analysis results than can be obtained with more traditional sensitivity analysis procedures based on linear regression, rank regression or quadratic regression when nonlinear relationships between model inputs and model predictions are present

  12. Countering oversegmentation in partitioning-based connectivities

    NARCIS (Netherlands)

    Ouzounis, Georgios K.; Wilkinson, Michael H.F.

    2005-01-01

    A new theoretical development is presented for handling the over-segmentation problem in partitioning-based connected openings. The definition we propose treats singletons generated with the earlier method, as elements of a larger connected component. Unlike the existing formalism, this new method

  13. A recursive Monte Carlo method for estimating importance functions in deep penetration problems

    International Nuclear Information System (INIS)

    Goldstein, M.

    1980-04-01

    A pratical recursive Monte Carlo method for estimating the importance function distribution, aimed at importance sampling for the solution of deep penetration problems in three-dimensional systems, was developed. The efficiency of the recursive method was investigated for sample problems including one- and two-dimensional, monoenergetic and and multigroup problems, as well as for a practical deep-penetration problem with streaming. The results of the recursive Monte Carlo calculations agree fairly well with Ssub(n) results. It is concluded that the recursive Monte Carlo method promises to become a universal method for estimating the importance function distribution for the solution of deep-penetration problems, in all kinds of systems: for many systems the recursive method is likely to be more efficient than previously existing methods; for three-dimensional systems it is the first method that can estimate the importance function with the accuracy required for an efficient solution based on importance sampling of neutron deep-penetration problems in those systems

  14. New Linear Partitioning Models Based on Experimental Water: Supercritical CO2 Partitioning Data of Selected Organic Compounds.

    Science.gov (United States)

    Burant, Aniela; Thompson, Christopher; Lowry, Gregory V; Karamalidis, Athanasios K

    2016-05-17

    Partitioning coefficients of organic compounds between water and supercritical CO2 (sc-CO2) are necessary to assess the risk of migration of these chemicals from subsurface CO2 storage sites. Despite the large number of potential organic contaminants, the current data set of published water-sc-CO2 partitioning coefficients is very limited. Here, the partitioning coefficients of thiophene, pyrrole, and anisole were measured in situ over a range of temperatures and pressures using a novel pressurized batch-reactor system with dual spectroscopic detectors: a near-infrared spectrometer for measuring the organic analyte in the CO2 phase and a UV detector for quantifying the analyte in the aqueous phase. Our measured partitioning coefficients followed expected trends based on volatility and aqueous solubility. The partitioning coefficients and literature data were then used to update a published poly parameter linear free-energy relationship and to develop five new linear free-energy relationships for predicting water-sc-CO2 partitioning coefficients. A total of four of the models targeted a single class of organic compounds. Unlike models that utilize Abraham solvation parameters, the new relationships use vapor pressure and aqueous solubility of the organic compound at 25 °C and CO2 density to predict partitioning coefficients over a range of temperature and pressure conditions. The compound class models provide better estimates of partitioning behavior for compounds in that class than does the model built for the entire data set.

  15. Dominant partition method. [based on a wave function formalism

    Science.gov (United States)

    Dixon, R. M.; Redish, E. F.

    1979-01-01

    By use of the L'Huillier, Redish, and Tandy (LRT) wave function formalism, a partially connected method, the dominant partition method (DPM) is developed for obtaining few body reductions of the many body problem in the LRT and Bencze, Redish, and Sloan (BRS) formalisms. The DPM maps the many body problem to a fewer body one by using the criterion that the truncated formalism must be such that consistency with the full Schroedinger equation is preserved. The DPM is based on a class of new forms for the irreducible cluster potential, which is introduced in the LRT formalism. Connectivity is maintained with respect to all partitions containing a given partition, which is referred to as the dominant partition. Degrees of freedom corresponding to the breakup of one or more of the clusters of the dominant partition are treated in a disconnected manner. This approach for simplifying the complicated BRS equations is appropriate for physical problems where a few body reaction mechanism prevails.

  16. Primitive recursive realizability and basic propositional logic

    NARCIS (Netherlands)

    Plisko, Valery

    2007-01-01

    Two notions of primitive recursive realizability for arithmetic sentences are considered. The first one is strictly primitive recursive realizability introduced by Z. Damnjanovic in 1994. We prove that intuitionistic predicate logic is not sound with this kind of realizability. Namely there

  17. Recursive Cluster Elimination (RCE for classification and feature selection from gene expression data

    Directory of Open Access Journals (Sweden)

    Showe Louise C

    2007-05-01

    Full Text Available Abstract Background Classification studies using gene expression datasets are usually based on small numbers of samples and tens of thousands of genes. The selection of those genes that are important for distinguishing the different sample classes being compared, poses a challenging problem in high dimensional data analysis. We describe a new procedure for selecting significant genes as recursive cluster elimination (RCE rather than recursive feature elimination (RFE. We have tested this algorithm on six datasets and compared its performance with that of two related classification procedures with RFE. Results We have developed a novel method for selecting significant genes in comparative gene expression studies. This method, which we refer to as SVM-RCE, combines K-means, a clustering method, to identify correlated gene clusters, and Support Vector Machines (SVMs, a supervised machine learning classification method, to identify and score (rank those gene clusters for the purpose of classification. K-means is used initially to group genes into clusters. Recursive cluster elimination (RCE is then applied to iteratively remove those clusters of genes that contribute the least to the classification performance. SVM-RCE identifies the clusters of correlated genes that are most significantly differentially expressed between the sample classes. Utilization of gene clusters, rather than individual genes, enhances the supervised classification accuracy of the same data as compared to the accuracy when either SVM or Penalized Discriminant Analysis (PDA with recursive feature elimination (SVM-RFE and PDA-RFE are used to remove genes based on their individual discriminant weights. Conclusion SVM-RCE provides improved classification accuracy with complex microarray data sets when it is compared to the classification accuracy of the same datasets using either SVM-RFE or PDA-RFE. SVM-RCE identifies clusters of correlated genes that when considered together

  18. Knowledge base rule partitioning design for CLIPS

    Science.gov (United States)

    Mainardi, Joseph D.; Szatkowski, G. P.

    1990-01-01

    This describes a knowledge base (KB) partitioning approach to solve the problem of real-time performance using the CLIPS AI shell when containing large numbers of rules and facts. This work is funded under the joint USAF/NASA Advanced Launch System (ALS) Program as applied research in expert systems to perform vehicle checkout for real-time controller and diagnostic monitoring tasks. The Expert System advanced development project (ADP-2302) main objective is to provide robust systems responding to new data frames of 0.1 to 1.0 second intervals. The intelligent system control must be performed within the specified real-time window, in order to meet the demands of the given application. Partitioning the KB reduces the complexity of the inferencing Rete net at any given time. This reduced complexity improves performance but without undo impacts during load and unload cycles. The second objective is to produce highly reliable intelligent systems. This requires simple and automated approaches to the KB verification & validation task. Partitioning the KB reduces rule interaction complexity overall. Reduced interaction simplifies the V&V testing necessary by focusing attention only on individual areas of interest. Many systems require a robustness that involves a large number of rules, most of which are mutually exclusive under different phases or conditions. The ideal solution is to control the knowledge base by loading rules that directly apply for that condition, while stripping out all rules and facts that are not used during that cycle. The practical approach is to cluster rules and facts into associated 'blocks'. A simple approach has been designed to control the addition and deletion of 'blocks' of rules and facts, while allowing real-time operations to run freely. Timing tests for real-time performance for specific machines under R/T operating systems have not been completed but are planned as part of the analysis process to validate the design.

  19. Step-indexed Kripke models over recursive worlds

    DEFF Research Database (Denmark)

    Birkedal, Lars; Reus, Bernhard; Schwinghammer, Jan

    2011-01-01

    worlds that are recursively defined in a category of metric spaces. In this paper, we broaden the scope of this technique from the original domain-theoretic setting to an elementary, operational one based on step indexing. The resulting method is widely applicable and leads to simple, succinct models...

  20. Decision tree modeling using R.

    Science.gov (United States)

    Zhang, Zhongheng

    2016-08-01

    In machine learning field, decision tree learner is powerful and easy to interpret. It employs recursive binary partitioning algorithm that splits the sample in partitioning variable with the strongest association with the response variable. The process continues until some stopping criteria are met. In the example I focus on conditional inference tree, which incorporates tree-structured regression models into conditional inference procedures. While growing a single tree is subject to small changes in the training data, random forests procedure is introduced to address this problem. The sources of diversity for random forests come from the random sampling and restricted set of input variables to be selected. Finally, I introduce R functions to perform model based recursive partitioning. This method incorporates recursive partitioning into conventional parametric model building.

  1. Recursion to food plants by free-ranging Bornean elephant.

    Science.gov (United States)

    English, Megan; Gillespie, Graeme; Goossens, Benoit; Ismail, Sulaiman; Ancrenaz, Marc; Linklater, Wayne

    2015-01-01

    Plant recovery rates after herbivory are thought to be a key factor driving recursion by herbivores to sites and plants to optimise resource-use but have not been investigated as an explanation for recursion in large herbivores. We investigated the relationship between plant recovery and recursion by elephants (Elephas maximus borneensis) in the Lower Kinabatangan Wildlife Sanctuary, Sabah. We identified 182 recently eaten food plants, from 30 species, along 14 × 50 m transects and measured their recovery growth each month over nine months or until they were re-browsed by elephants. The monthly growth in leaf and branch or shoot length for each plant was used to calculate the time required (months) for each species to recover to its pre-eaten length. Elephant returned to all but two transects with 10 eaten plants, a further 26 plants died leaving 146 plants that could be re-eaten. Recursion occurred to 58% of all plants and 12 of the 30 species. Seventy-seven percent of the re-eaten plants were grasses. Recovery times to all plants varied from two to twenty months depending on the species. Recursion to all grasses coincided with plant recovery whereas recursion to most browsed plants occurred four to twelve months before they had recovered to their previous length. The small sample size of many browsed plants that received recursion and uneven plant species distribution across transects limits our ability to generalise for most browsed species but a prominent pattern in plant-scale recursion did emerge. Plant recovery time was a good predictor of time to recursion but varied as a function of growth form (grass, ginger, palm, liana and woody) and differences between sites. Time to plant recursion coincided with plant recovery time for the elephant's preferred food, grasses, and perhaps also gingers, but not the other browsed species. Elephants are bulk feeders so it is likely that they time their returns to bulk feed on these grass species when quantities have

  2. Down two steps: Are bilinguals delayed in the acquisition of recursively embedded PPs?

    Directory of Open Access Journals (Sweden)

    Ana Pérez-Leroux

    2017-08-01

    Full Text Available The present study examines whether bilingual children are delayed in the ability to produce complex DPs. We elicited production of DPs containing two PP modifiers, in two conditions designed to tease apart the acquisition of an embedding rule from the acquisition of the recursivity of an embedding rule. In the recursive condition, one modifier PP was itself modified by an additional PP. In the non-recursive condition, both PPs sequentially modified the main noun. Participants were 71 English monolingual children and 35 bilinguals between the ages of four and six. The evidence suggested an overall difference between groups, however further analysis revealed that bilinguals differed from monolinguals only insofar as the onset of PP embedding. No specific additional bilingual delay arose from the recursive condition. This suggests that recursive embedding is a resilient domain in language acquisition and supports proposals that link morphosyntactic delays in bilingual children to domains of grammar that are heavily reliant on lexical learning, which would include learning the first instance of PP embedding. --- Original in English.   --- DOI: http://dx.doi.org/10.12957/matraga.2017.28781

  3. Timing Analysis of Mixed-Criticality Hard Real-Time Applications Implemented on Distributed Partitioned Architectures

    DEFF Research Database (Denmark)

    Marinescu, Sorin Ovidiu; Tamas-Selicean, Domitian; Acretoaie, Vlad

    In this paper we are interested in the timing analysis of mixed-criticality embedded real-time applications mapped on distributed heterogeneous architectures. Mixedcriticality tasks can be integrated onto the same architecture only if there is enough spatial and temporal separation among them. We...... in partitions using fixedpriority preemptive scheduling. We have extended the stateof- the-art algorithms for schedulability analysis to take into account the partitions. The proposed algorithm has been evaluated using several synthetic and real-life benchmarks....... consider that the separation is provided by partitioning, such that applications run in separate partitions, and each partition is allocated several time slots on a processor. Each partition can have its own scheduling policy. We are interested to determine the worst-case response times of tasks scheduled...

  4. Anti-Authoritarian Metrics: Recursivity as a strategy for post-capitalism

    Directory of Open Access Journals (Sweden)

    David Adam Banks

    2016-12-01

    Full Text Available This essay proposes that those seeking to build counter-power institutions and communities learn to think in terms of what I call “recursivity.” Recursivity is an anti-authoritarian metric that helps bring about a sensitivity to feedback loops at multiple levels of organization. I begin by describing how technological systems and the socio-economic order co-constitute one-another around efficiency metrics. I then go on to define recursivity as social conditions that contain within them all of the parts and practices for their maturation and expansion, and show how organizations that demonstrate recursivity, like the historical English commons, have been marginalized or destroyed all together. Finally, I show how the ownership of property is inherently antithetical to the closed loops of recursivity. All of this is bookended by a study of urban planning’s recursive beginnings.

  5. Recursive Subspace Identification of AUV Dynamic Model under General Noise Assumption

    Directory of Open Access Journals (Sweden)

    Zheping Yan

    2014-01-01

    Full Text Available A recursive subspace identification algorithm for autonomous underwater vehicles (AUVs is proposed in this paper. Due to the advantages at handling nonlinearities and couplings, the AUV model investigated here is for the first time constructed as a Hammerstein model with nonlinear feedback in the linear part. To better take the environment and sensor noises into consideration, the identification problem is concerned as an errors-in-variables (EIV one which means that the identification procedure is under general noise assumption. In order to make the algorithm recursively, propagator method (PM based subspace approach is extended into EIV framework to form the recursive identification method called PM-EIV algorithm. With several identification experiments carried out by the AUV simulation platform, the proposed algorithm demonstrates its effectiveness and feasibility.

  6. Partition-based discrete-time quantum walks

    Science.gov (United States)

    Konno, Norio; Portugal, Renato; Sato, Iwao; Segawa, Etsuo

    2018-04-01

    We introduce a family of discrete-time quantum walks, called two-partition model, based on two equivalence-class partitions of the computational basis, which establish the notion of local dynamics. This family encompasses most versions of unitary discrete-time quantum walks driven by two local operators studied in literature, such as the coined model, Szegedy's model, and the 2-tessellable staggered model. We also analyze the connection of those models with the two-step coined model, which is driven by the square of the evolution operator of the standard discrete-time coined walk. We prove formally that the two-step coined model, an extension of Szegedy model for multigraphs, and the two-tessellable staggered model are unitarily equivalent. Then, selecting one specific model among those families is a matter of taste not generality.

  7. Algorithmic correspondence and completeness in modal logic. V. Recursive extensions of SQEMA

    DEFF Research Database (Denmark)

    Conradie, Willem; Goranko, Valentin; Vakarelov, Dimiter

    2010-01-01

    The previously introduced algorithm SQEMA computes first-order frame equivalents for modal formulae and also proves their canonicity. Here we extend SQEMA with an additional rule based on a recursive version of Ackermann's lemma, which enables the algorithm to compute local frame equivalents...... on the class of ‘recursive formulae’. We also show that a certain version of this algorithm guarantees the canonicity of the formulae on which it succeeds....

  8. Recursive Definitions of Monadic Functions

    Directory of Open Access Journals (Sweden)

    Alexander Krauss

    2010-12-01

    Full Text Available Using standard domain-theoretic fixed-points, we present an approach for defining recursive functions that are formulated in monadic style. The method works both in the simple option monad and the state-exception monad of Isabelle/HOL's imperative programming extension, which results in a convenient definition principle for imperative programs, which were previously hard to define. For such monadic functions, the recursion equation can always be derived without preconditions, even if the function is partial. The construction is easy to automate, and convenient induction principles can be derived automatically.

  9. Real-time recursive hyperspectral sample and band processing algorithm architecture and implementation

    CERN Document Server

    Chang, Chein-I

    2017-01-01

    This book explores recursive architectures in designing progressive hyperspectral imaging algorithms. In particular, it makes progressive imaging algorithms recursive by introducing the concept of Kalman filtering in algorithm design so that hyperspectral imagery can be processed not only progressively sample by sample or band by band but also recursively via recursive equations. This book can be considered a companion book of author’s books, Real-Time Progressive Hyperspectral Image Processing, published by Springer in 2016. Explores recursive structures in algorithm architecture Implements algorithmic recursive architecture in conjunction with progressive sample and band processing Derives Recursive Hyperspectral Sample Processing (RHSP) techniques according to Band-Interleaved Sample/Pixel (BIS/BIP) acquisition format Develops Recursive Hyperspectral Band Processing (RHBP) techniques according to Band SeQuential (BSQ) acquisition format for hyperspectral data.

  10. Functional Dual Adaptive Control with Recursive Gaussian Process Model

    International Nuclear Information System (INIS)

    Prüher, Jakub; Král, Ladislav

    2015-01-01

    The paper deals with dual adaptive control problem, where the functional uncertainties in the system description are modelled by a non-parametric Gaussian process regression model. Current approaches to adaptive control based on Gaussian process models are severely limited in their practical applicability, because the model is re-adjusted using all the currently available data, which keeps growing with every time step. We propose the use of recursive Gaussian process regression algorithm for significant reduction in computational requirements, thus bringing the Gaussian process-based adaptive controllers closer to their practical applicability. In this work, we design a bi-criterial dual controller based on recursive Gaussian process model for discrete-time stochastic dynamic systems given in an affine-in-control form. Using Monte Carlo simulations, we show that the proposed controller achieves comparable performance with the full Gaussian process-based controller in terms of control quality while keeping the computational demands bounded. (paper)

  11. Improved Undecidability Results for Reachability Games on Recursive Timed Automata

    Directory of Open Access Journals (Sweden)

    Shankara Narayanan Krishna

    2014-08-01

    Full Text Available We study reachability games on recursive timed automata (RTA that generalize Alur-Dill timed automata with recursive procedure invocation mechanism similar to recursive state machines. It is known that deciding the winner in reachability games on RTA is undecidable for automata with two or more clocks, while the problem is decidable for automata with only one clock. Ouaknine and Worrell recently proposed a time-bounded theory of real-time verification by claiming that restriction to bounded-time recovers decidability for several key decision problem related to real-time verification. We revisited games on recursive timed automata with time-bounded restriction in the hope of recovering decidability. However, we found that the problem still remains undecidable for recursive timed automata with three or more clocks. Using similar proof techniques we characterize a decidability frontier for a generalization of RTA to recursive stopwatch automata.

  12. Recursive tridiagonalization of infinite dimensional Hamiltonians

    International Nuclear Information System (INIS)

    Haydock, R.; Oregon Univ., Eugene, OR

    1989-01-01

    Infinite dimensional, computable, sparse Hamiltonians can be numerically tridiagonalized to finite precision using a three term recursion. Only the finite number of components whose relative magnitude is greater than the desired precision are stored at any stage in the computation. Thus the particular components stored change as the calculation progresses. This technique avoids errors due to truncation of the orbital set, and makes terminators unnecessary in the recursion method. (orig.)

  13. Recursion theory computational aspects of definability

    CERN Document Server

    Chong, Chi Tat

    2015-01-01

    This monograph presents recursion theory from a generalized and largely global point of view. A major theme is the study of the structures of degrees arising from two key notions of reducibility, the Turing degrees and the hyperdegrees, using ideas and techniques beyond those of classical recursion theory. These include structure theory, hyperarithmetic determinacy and rigidity, basis theorems, independence results on Turing degrees, as well as applications to higher randomness.

  14. Attitude determination and calibration using a recursive maximum likelihood-based adaptive Kalman filter

    Science.gov (United States)

    Kelly, D. A.; Fermelia, A.; Lee, G. K. F.

    1990-01-01

    An adaptive Kalman filter design that utilizes recursive maximum likelihood parameter identification is discussed. At the center of this design is the Kalman filter itself, which has the responsibility for attitude determination. At the same time, the identification algorithm is continually identifying the system parameters. The approach is applicable to nonlinear, as well as linear systems. This adaptive Kalman filter design has much potential for real time implementation, especially considering the fast clock speeds, cache memory and internal RAM available today. The recursive maximum likelihood algorithm is discussed in detail, with special attention directed towards its unique matrix formulation. The procedure for using the algorithm is described along with comments on how this algorithm interacts with the Kalman filter.

  15. Recursion to food plants by free-ranging Bornean elephant

    Directory of Open Access Journals (Sweden)

    Megan English

    2015-08-01

    Full Text Available Plant recovery rates after herbivory are thought to be a key factor driving recursion by herbivores to sites and plants to optimise resource-use but have not been investigated as an explanation for recursion in large herbivores. We investigated the relationship between plant recovery and recursion by elephants (Elephas maximus borneensis in the Lower Kinabatangan Wildlife Sanctuary, Sabah. We identified 182 recently eaten food plants, from 30 species, along 14 × 50 m transects and measured their recovery growth each month over nine months or until they were re-browsed by elephants. The monthly growth in leaf and branch or shoot length for each plant was used to calculate the time required (months for each species to recover to its pre-eaten length. Elephant returned to all but two transects with 10 eaten plants, a further 26 plants died leaving 146 plants that could be re-eaten. Recursion occurred to 58% of all plants and 12 of the 30 species. Seventy-seven percent of the re-eaten plants were grasses. Recovery times to all plants varied from two to twenty months depending on the species. Recursion to all grasses coincided with plant recovery whereas recursion to most browsed plants occurred four to twelve months before they had recovered to their previous length. The small sample size of many browsed plants that received recursion and uneven plant species distribution across transects limits our ability to generalise for most browsed species but a prominent pattern in plant-scale recursion did emerge. Plant recovery time was a good predictor of time to recursion but varied as a function of growth form (grass, ginger, palm, liana and woody and differences between sites. Time to plant recursion coincided with plant recovery time for the elephant’s preferred food, grasses, and perhaps also gingers, but not the other browsed species. Elephants are bulk feeders so it is likely that they time their returns to bulk feed on these grass species when

  16. Fermionic Approach to Weighted Hurwitz Numbers and Topological Recursion

    Science.gov (United States)

    Alexandrov, A.; Chapuy, G.; Eynard, B.; Harnad, J.

    2017-12-01

    A fermionic representation is given for all the quantities entering in the generating function approach to weighted Hurwitz numbers and topological recursion. This includes: KP and 2D Toda {τ} -functions of hypergeometric type, which serve as generating functions for weighted single and double Hurwitz numbers; the Baker function, which is expanded in an adapted basis obtained by applying the same dressing transformation to all vacuum basis elements; the multipair correlators and the multicurrent correlators. Multiplicative recursion relations and a linear differential system are deduced for the adapted bases and their duals, and a Christoffel-Darboux type formula is derived for the pair correlator. The quantum and classical spectral curves linking this theory with the topological recursion program are derived, as well as the generalized cut-and-join equations. The results are detailed for four special cases: the simple single and double Hurwitz numbers, the weakly monotone case, corresponding to signed enumeration of coverings, the strongly monotone case, corresponding to Belyi curves and the simplest version of quantum weighted Hurwitz numbers.

  17. Fermionic Approach to Weighted Hurwitz Numbers and Topological Recursion

    Science.gov (United States)

    Alexandrov, A.; Chapuy, G.; Eynard, B.; Harnad, J.

    2018-06-01

    A fermionic representation is given for all the quantities entering in the generating function approach to weighted Hurwitz numbers and topological recursion. This includes: KP and 2 D Toda {τ} -functions of hypergeometric type, which serve as generating functions for weighted single and double Hurwitz numbers; the Baker function, which is expanded in an adapted basis obtained by applying the same dressing transformation to all vacuum basis elements; the multipair correlators and the multicurrent correlators. Multiplicative recursion relations and a linear differential system are deduced for the adapted bases and their duals, and a Christoffel-Darboux type formula is derived for the pair correlator. The quantum and classical spectral curves linking this theory with the topological recursion program are derived, as well as the generalized cut-and-join equations. The results are detailed for four special cases: the simple single and double Hurwitz numbers, the weakly monotone case, corresponding to signed enumeration of coverings, the strongly monotone case, corresponding to Belyi curves and the simplest version of quantum weighted Hurwitz numbers.

  18. A new recursion operator for Adler's equation in the Viallet form

    International Nuclear Information System (INIS)

    Mikhailov, A.V.; Wang, J.P.

    2011-01-01

    For Adler's equation in the Viallet form and Yamilov's discretisation of the Krichever-Novikov equation we present new recursion and Hamiltonian operators. This new recursion operator and the recursion operator found in [A.V. Mikhailov, et al., Theor. Math. Phys. 167 (2011) 421, (arXiv:1004.5346)] satisfy the spectral curve associated with the equation. -- Highlights: → We present new recursion and Hamiltonian operators for the equation. → We establish the relation between this recursion operator and the known one. → The relation is given by the spectral curve associated with the equation.

  19. Recursive modeling of loss of control in human and organizational processes: a systemic model for accident analysis.

    Science.gov (United States)

    Kontogiannis, Tom; Malakis, Stathis

    2012-09-01

    A recursive model of accident investigation is proposed by exploiting earlier work in systems thinking. Safety analysts can understand better the underlying causes of decision or action flaws by probing into the patterns of breakdown in the organization of safety. For this deeper analysis, a cybernetic model of organizational factors and a control model of human processes have been integrated in this article (i.e., the viable system model and the extended control model). The joint VSM-ECOM framework has been applied to a case study to help safety practitioners with the analysis of patterns of breakdown with regard to how operators and organizations manage goal conflicts, monitor work progress, recognize weak signals, align goals across teams, and adapt plans on the fly. The recursive accident representation brings together several organizational issues (e.g., the dilemma of autonomy versus compliance, or the interaction between structure and strategy) and addresses how operators adapt to challenges in their environment by adjusting their modes of functioning and recovery. Finally, it facilitates the transfer of knowledge from diverse incidents and near misses within similar domains of practice. Copyright © 2012 Elsevier Ltd. All rights reserved.

  20. Gate-tunable current partition in graphene-based topological zero lines

    Science.gov (United States)

    Wang, Ke; Ren, Yafei; Deng, Xinzhou; Yang, Shengyuan A.; Jung, Jeil; Qiao, Zhenhua

    2017-06-01

    We demonstrate new mechanisms for gate-tunable current partition at topological zero-line intersections in a graphene-based current splitter. Based on numerical calculations of the nonequilibrium Green's functions and Landauer-Büttiker formula, we show that the presence of a perpendicular magnetic field on the order of a few Teslas allows for carrier sign dependent current routing. In the zero-field limit the control on current routing and partition can be achieved within a range of 10-90 % of the total incoming current by tuning the carrier density at tilted intersections or by modifying the relative magnitude of the bulk band gaps via gate voltage. We discuss the implications of our findings in the design of topological zero-line networks where finite orbital magnetic moments are expected when the current partition is asymmetric.

  1. Analysis of load balance in hybrid partitioning | Talib | Botswana ...

    African Journals Online (AJOL)

    In information retrieval systems, there are three types of index partitioning schemes - term partitioning, document partitioning, and hybrid partitioning. The hybrid-partitioning scheme combines both term and document partitioning schemes. Term partitioning provides high concurrency, which means that queries can be ...

  2. Testing digital recursive filtering method for radiation measurement channel using pin diode detector

    International Nuclear Information System (INIS)

    Talpalariu, C. M.; Talpalariu, J.; Popescu, O.; Mocanasu, M.; Lita, I.; Visan, D. A.

    2016-01-01

    In this work we have studied a software filtering method implemented in a pulse counting computerized measuring channel using PIN diode radiation detector. In case our interest was focalized for low rate decay radiation measurement accuracies improvement and response time optimization. During works for digital mathematical algorithm development, we used a hardware radiation measurement channel configuration based on PIN diode BPW34 detector, preamplifier, filter and programmable counter, computer connected. We report measurement results using two digital recursive methods in statically and dynamically field evolution. Software for graphical input/output real time diagram representation was designed and implemented, facilitating performances evaluation between the response of fixed configuration software recursive filter and dynamically adaptive configuration recursive filter. (authors)

  3. Recursion complexity in cognition

    CERN Document Server

    Roeper, Thomas

    2014-01-01

    This volume focuses on recursion, highlighting its central role in modern science. It reveals a host of new theoretical arguments, philosophical perspectives, formal representations and empirical evidence from parsing, acquisition and computer models.

  4. The Method of Recursive Counting: Can one go further?

    International Nuclear Information System (INIS)

    Creutz, M.; Horvath, I.

    1993-12-01

    After a short review of the Method of Recursive Counting we introduce a general algebraic description of recursive lattice building. This provides a rigorous framework for discussion of method's limitations

  5. Image defog algorithm based on open close filter and gradient domain recursive bilateral filter

    Science.gov (United States)

    Liu, Daqian; Liu, Wanjun; Zhao, Qingguo; Fei, Bowen

    2017-11-01

    To solve the problems of fuzzy details, color distortion, low brightness of the image obtained by the dark channel prior defog algorithm, an image defog algorithm based on open close filter and gradient domain recursive bilateral filter, referred to as OCRBF, was put forward. The algorithm named OCRBF firstly makes use of weighted quad tree to obtain more accurate the global atmospheric value, then exploits multiple-structure element morphological open and close filter towards the minimum channel map to obtain a rough scattering map by dark channel prior, makes use of variogram to correct the transmittance map,and uses gradient domain recursive bilateral filter for the smooth operation, finally gets recovery images by image degradation model, and makes contrast adjustment to get bright, clear and no fog image. A large number of experimental results show that the proposed defog method in this paper can be good to remove the fog , recover color and definition of the fog image containing close range image, image perspective, the image including the bright areas very well, compared with other image defog algorithms,obtain more clear and natural fog free images with details of higher visibility, what's more, the relationship between the time complexity of SIDA algorithm and the number of image pixels is a linear correlation.

  6. Video game for learning and metaphorization of recursive algorithms

    Directory of Open Access Journals (Sweden)

    Ricardo Inacio Alvares Silva

    2013-09-01

    Full Text Available The learning of recursive algorithms in computer programming is problematic, because its execution and resolution is not natural to the thinking way people are trained and used to since young. As with other topics in algorithms, we use metaphors to make parallels between the abstract and the concrete to help in understanding the operation of recursive algorithms. However, the classic metaphors employed in this area, such as calculating factorial recursively and Towers of Hanoi game, may just confuse more or be insufficient. In this work, we produced a computer game to assist students in computer courses in learning recursive algorithms. It was designed to have regular video game characteristics, with narrative and classical gameplay elements, commonly found in this kind of product. Aiding to education occurs through metaphorization, or in other words, through experiences provided by game situations that refer to recursive algorithms. To this end, we designed and imbued in the game four valid metaphors related to the theory, and other minor references to the subject.

  7. Differential constraints for bounded recursive identification with multivariate splines

    NARCIS (Netherlands)

    De Visser, C.C.; Chu, Q.P.; Mulder, J.A.

    2011-01-01

    The ability to perform online model identification for nonlinear systems with unknown dynamics is essential to any adaptive model-based control system. In this paper, a new differential equality constrained recursive least squares estimator for multivariate simplex splines is presented that is able

  8. N/om, Change, and Social Work: A Recursive Frame Analysis of the Transformative Rituals of the Ju/'hoan Bushmen

    Science.gov (United States)

    Keeney, Hillary; Keeney, Bradford

    2013-01-01

    The Ju/'hoan Bushman origin myth is depicted as a contextual frame for their healing and transformative ways. Using Recursive Frame Analysis, these performances are shown to be an enactment of the border crossing between First and Second Creation, that is, pre-linguistic and linguistic domains of experience. Here n/om, or the presumed creative…

  9. Multiple predictor smoothing methods for sensitivity analysis: Description of techniques

    International Nuclear Information System (INIS)

    Storlie, Curtis B.; Helton, Jon C.

    2008-01-01

    The use of multiple predictor smoothing methods in sampling-based sensitivity analyses of complex models is investigated. Specifically, sensitivity analysis procedures based on smoothing methods employing the stepwise application of the following nonparametric regression techniques are described: (i) locally weighted regression (LOESS), (ii) additive models, (iii) projection pursuit regression, and (iv) recursive partitioning regression. Then, in the second and concluding part of this presentation, the indicated procedures are illustrated with both simple test problems and results from a performance assessment for a radioactive waste disposal facility (i.e., the Waste Isolation Pilot Plant). As shown by the example illustrations, the use of smoothing procedures based on nonparametric regression techniques can yield more informative sensitivity analysis results than can be obtained with more traditional sensitivity analysis procedures based on linear regression, rank regression or quadratic regression when nonlinear relationships between model inputs and model predictions are present

  10. Kinetic partitioning mechanism of HDV ribozyme folding

    Energy Technology Data Exchange (ETDEWEB)

    Chen, Jiawen; Gong, Sha; Wang, Yujie; Zhang, Wenbing, E-mail: wbzhang@whu.edu.cn [Department of Physics, Wuhan University, Wuhan, Hubei 430072 (China)

    2014-01-14

    RNA folding kinetics is directly tied to RNA biological functions. We introduce here a new approach for predicting the folding kinetics of RNA secondary structure with pseudoknots. This approach is based on our previous established helix-based method for predicting the folding kinetics of RNA secondary structure. In this approach, the transition rates for an elementary step: (1) formation, (2) disruption of a helix stem, and (3) helix formation with concomitant partial melting of an incompatible helix, are calculated with the free energy landscape. The folding kinetics of the Hepatitis delta virus (HDV) ribozyme and the mutated sequences are studied with this method. The folding pathways are identified by recursive searching the states with high net flux-in(out) population starting from the native state. The theory results are in good agreement with that of the experiments. The results indicate that the bi-phasic folding kinetics for the wt HDV sequence is ascribed to the kinetic partitioning mechanism: Part of the population will quickly fold to the native state along the fast pathway, while another part of the population will fold along the slow pathway, in which the population is trapped in a non-native state. Single mutation not only changes the folding rate but also the folding pathway.

  11. Recursion Of Binary Space As A Foundation Of Repeatable Programs

    Directory of Open Access Journals (Sweden)

    Jeremy Horne

    2006-10-01

    Full Text Available Every computation, including recursion, is based on natural philosophy. Our world may be expressed in terms of a binary logical space that contains functions that act simultaneously as objects and processes (operands and operators. This paper presents an outline of the results of research about that space and suggests routes for further inquiry. Binary logical space is generated sequentially from an origin in a standard coordinate system. At least one method exists to show that each of the resulting 16 functions repeats itself by repeatedly forward-feeding outputs of a function operating over two others as new operands of the original function until the original function appears as an output, thus behaving as an apparent homeostatic automaton. As any space of any dimension is composed of one or more of these functions, so the space is recursive, as well. Semantics gives meaning to recursive structures, computer programs and fundamental constituents of our universe being two examples. Such thoughts open inquiry into larger philosophical issues as free will and determinism.

  12. All-Pole Recursive Digital Filters Design Based on Ultraspherical Polynomials

    OpenAIRE

    N. Stojanovic; N. Stamenkovic; V. Stojanovic

    2014-01-01

    A simple method for approximation of all-pole recursive digital filters, directly in digital domain, is described. Transfer function of these filters, referred to as Ultraspherical filters, is controlled by order of the Ultraspherical polynomial, nu. Parameter nu, restricted to be a nonnegative real number (nu ≥ 0), controls ripple peaks in the passband of the magnitude response and enables a trade-off between the passband loss and the group delay response of the resulting filter. Chebyshev f...

  13. Syntactic Recursion Facilitates and Working Memory Predicts Recursive Theory of Mind

    NARCIS (Netherlands)

    Arslan, Burcu; Hohenberger, Annette; Verbrugge, Rineke

    2017-01-01

    In this study, we focus on the possible roles of second-order syntactic recursion and working memory in terms of simple and complex span tasks in the development of second-order false belief reasoning. We tested 89 Turkish children in two age groups, one younger (4;6-6;5 years) and one older

  14. Design and Implementation of Recursive Model Predictive Control for Permanent Magnet Synchronous Motor Drives

    Directory of Open Access Journals (Sweden)

    Xuan Wu

    2015-01-01

    Full Text Available In order to control the permanent-magnet synchronous motor system (PMSM with different disturbances and nonlinearity, an improved current control algorithm for the PMSM systems using recursive model predictive control (RMPC is developed in this paper. As the conventional MPC has to be computed online, its iterative computational procedure needs long computing time. To enhance computational speed, a recursive method based on recursive Levenberg-Marquardt algorithm (RLMA and iterative learning control (ILC is introduced to solve the learning issue in MPC. RMPC is able to significantly decrease the computation cost of traditional MPC in the PMSM system. The effectiveness of the proposed algorithm has been verified by simulation and experimental results.

  15. Inner and Outer Recursive Neural Networks for Chemoinformatics Applications.

    Science.gov (United States)

    Urban, Gregor; Subrahmanya, Niranjan; Baldi, Pierre

    2018-02-26

    Deep learning methods applied to problems in chemoinformatics often require the use of recursive neural networks to handle data with graphical structure and variable size. We present a useful classification of recursive neural network approaches into two classes, the inner and outer approach. The inner approach uses recursion inside the underlying graph, to essentially "crawl" the edges of the graph, while the outer approach uses recursion outside the underlying graph, to aggregate information over progressively longer distances in an orthogonal direction. We illustrate the inner and outer approaches on several examples. More importantly, we provide open-source implementations [available at www.github.com/Chemoinformatics/InnerOuterRNN and cdb.ics.uci.edu ] for both approaches in Tensorflow which can be used in combination with training data to produce efficient models for predicting the physical, chemical, and biological properties of small molecules.

  16. Separating the Classes of Recursively Enumerable Languages Based on Machine Size

    Czech Academy of Sciences Publication Activity Database

    van Leeuwen, J.; Wiedermann, Jiří

    2015-01-01

    Roč. 26, č. 6 (2015), s. 677-695 ISSN 0129-0541 R&D Projects: GA ČR GAP202/10/1333 Grant - others:GA ČR(CZ) GA15-04960S Institutional support: RVO:67985807 Keywords : recursively enumerable languages * RE hierarchy * finite languages * machine size * descriptional complexity * Turing machines with advice Subject RIV: IN - Informatics, Computer Science Impact factor: 0.467, year: 2015

  17. Recursive smoothers for hidden discrete-time Markov chains

    Directory of Open Access Journals (Sweden)

    Lakhdar Aggoun

    2005-01-01

    Full Text Available We consider a discrete-time Markov chain observed through another Markov chain. The proposed model extends models discussed by Elliott et al. (1995. We propose improved recursive formulae to update smoothed estimates of processes related to the model. These recursive estimates are used to update the parameter of the model via the expectation maximization (EM algorithm.

  18. Multiple predictor smoothing methods for sensitivity analysis: Example results

    International Nuclear Information System (INIS)

    Storlie, Curtis B.; Helton, Jon C.

    2008-01-01

    The use of multiple predictor smoothing methods in sampling-based sensitivity analyses of complex models is investigated. Specifically, sensitivity analysis procedures based on smoothing methods employing the stepwise application of the following nonparametric regression techniques are described in the first part of this presentation: (i) locally weighted regression (LOESS), (ii) additive models, (iii) projection pursuit regression, and (iv) recursive partitioning regression. In this, the second and concluding part of the presentation, the indicated procedures are illustrated with both simple test problems and results from a performance assessment for a radioactive waste disposal facility (i.e., the Waste Isolation Pilot Plant). As shown by the example illustrations, the use of smoothing procedures based on nonparametric regression techniques can yield more informative sensitivity analysis results than can be obtained with more traditional sensitivity analysis procedures based on linear regression, rank regression or quadratic regression when nonlinear relationships between model inputs and model predictions are present

  19. 3. Procedures and Recursion

    Indian Academy of Sciences (India)

    Home; Journals; Resonance – Journal of Science Education; Volume 1; Issue 6. Algorithms Procedures and Recursion. R K Shyamasundar. Series Article Volume 1 ... Author Affiliations. R K Shyamasundar1. Computer Science Group, Tata Institute of Fundamental Research, Homi Bhabha Road Mumbai 400 005, India.

  20. Analytic study of the Migdal-Kadanoff recursion formula

    International Nuclear Information System (INIS)

    Ito, K.R.

    1984-01-01

    After proposing lattice gauge field models in which the Migdal renormalization group recursion formulas are exact, we study the recursion formulas analytically. If D is less than 4, it is shown that the effective actions of D-dimensional U(1) lattice gauge models are uniformly driven to the high temperature region no matter how low the initial temperature is. If the initial temperature is large enough, this holds for any D and gauge group G. These are also the cases for the recursion formulas of Kadanoff type. It turns out, however, that the string tension for D=3 obtained by these methods is rather big compared with the one already obtained by Mack, Goepfert and by the present author. The reason is clarified. (orig.)

  1. Output-Only Modal Parameter Recursive Estimation of Time-Varying Structures via a Kernel Ridge Regression FS-TARMA Approach

    Directory of Open Access Journals (Sweden)

    Zhi-Sai Ma

    2017-01-01

    Full Text Available Modal parameter estimation plays an important role in vibration-based damage detection and is worth more attention and investigation, as changes in modal parameters are usually being used as damage indicators. This paper focuses on the problem of output-only modal parameter recursive estimation of time-varying structures based upon parameterized representations of the time-dependent autoregressive moving average (TARMA. A kernel ridge regression functional series TARMA (FS-TARMA recursive identification scheme is proposed and subsequently employed for the modal parameter estimation of a numerical three-degree-of-freedom time-varying structural system and a laboratory time-varying structure consisting of a simply supported beam and a moving mass sliding on it. The proposed method is comparatively assessed against an existing recursive pseudolinear regression FS-TARMA approach via Monte Carlo experiments and shown to be capable of accurately tracking the time-varying dynamics in a recursive manner.

  2. A Novel Method for Lithium-Ion Battery Online Parameter Identification Based on Variable Forgetting Factor Recursive Least Squares

    Directory of Open Access Journals (Sweden)

    Zizhou Lao

    2018-05-01

    Full Text Available For model-based state of charge (SOC estimation methods, the battery model parameters change with temperature, SOC, and so forth, causing the estimation error to increase. Constantly updating model parameters during battery operation, also known as online parameter identification, can effectively solve this problem. In this paper, a lithium-ion battery is modeled using the Thevenin model. A variable forgetting factor (VFF strategy is introduced to improve forgetting factor recursive least squares (FFRLS to variable forgetting factor recursive least squares (VFF-RLS. A novel method based on VFF-RLS for the online identification of the Thevenin model is proposed. Experiments verified that VFF-RLS gives more stable online parameter identification results than FFRLS. Combined with an unscented Kalman filter (UKF algorithm, a joint algorithm named VFF-RLS-UKF is proposed for SOC estimation. In a variable-temperature environment, a battery SOC estimation experiment was performed using the joint algorithm. The average error of the SOC estimation was as low as 0.595% in some experiments. Experiments showed that VFF-RLS can effectively track the changes in model parameters. The joint algorithm improved the SOC estimation accuracy compared to the method with the fixed forgetting factor.

  3. Features and Recursive Structure

    Directory of Open Access Journals (Sweden)

    Kuniya Nasukawa

    2015-01-01

    Full Text Available Based on the cross-linguistic tendency that weak vowels are realized with a central quality such as ə, ɨ, or ɯ, this paper attempts to account for this choice by proposing that the nucleus itself is one of the three monovalent vowel elements |A|, |I| and |U| which function as the building blocks of melodic structure. I claim that individual languages make a parametric choice to determine which of the three elements functions as the head of a nuclear expression. In addition, I show that elements can be freely concatenated to create melodic compounds. The resulting phonetic value of an element compound is determined by the specific elements it contains and by the head-dependency relations between those elements. This concatenation-based recursive mechanism of melodic structure can also be extended to levels above the segment, thus ultimately eliminating the need for syllabic constituents. This approach reinterprets the notion of minimalism in phonology by opposing the string-based flat structure.

  4. Active control versus recursive backstepping control of a chaotic ...

    African Journals Online (AJOL)

    ... than for the recursive backstepping controllers. However, the flexibility in the choice of the control laws for recursive backstepping design gives room for further improvement in its performance and enables it to achieve the goals of stabilization and tracking. Journal of the Nigerian Association of Mathematical Physics Vol.

  5. Pedestrian Path Prediction with Recursive Bayesian Filters: A Comparative Study

    NARCIS (Netherlands)

    Schneider, N.; Gavrila, D.M.

    2013-01-01

    In the context of intelligent vehicles, we perform a comparative study on recursive Bayesian filters for pedestrian path prediction at short time horizons (< 2s). We consider Extended Kalman Filters (EKF) based on single dynamical models and Interacting Multiple Models (IMM) combining several such

  6. Nonparametric bootstrap procedures for predictive inference based on recursive estimation schemes

    OpenAIRE

    Corradi, Valentina; Swanson, Norman R.

    2005-01-01

    Our objectives in this paper are twofold. First, we introduce block bootstrap techniques that are (first order) valid in recursive estimation frameworks. Thereafter, we present two examples where predictive accuracy tests are made operational using our new bootstrap procedures. In one application, we outline a consistent test for out-of-sample nonlinear Granger causality, and in the other we outline a test for selecting amongst multiple alternative forecasting models, all of which are possibl...

  7. Projection-based Bayesian recursive estimation of ARX model with uniform innovations

    Czech Academy of Sciences Publication Activity Database

    Kárný, Miroslav; Pavelková, Lenka

    2007-01-01

    Roč. 56, 9/10 (2007), s. 646-655 ISSN 0167-6911 R&D Projects: GA AV ČR 1ET100750401; GA MŠk 2C06001; GA MDS 1F43A/003/120 Institutional research plan: CEZ:AV0Z10750506 Keywords : ARX model * Bayesian recursive estimation * Uniform distribution Subject RIV: BC - Control Systems Theory Impact factor: 1.634, year: 2007 http://dx.doi.org/10.1016/j.sysconle.2007.03.005

  8. Recursive prediction error methods for online estimation in nonlinear state-space models

    Directory of Open Access Journals (Sweden)

    Dag Ljungquist

    1994-04-01

    Full Text Available Several recursive algorithms for online, combined state and parameter estimation in nonlinear state-space models are discussed in this paper. Well-known algorithms such as the extended Kalman filter and alternative formulations of the recursive prediction error method are included, as well as a new method based on a line-search strategy. A comparison of the algorithms illustrates that they are very similar although the differences can be important for the online tracking capabilities and robustness. Simulation experiments on a simple nonlinear process show that the performance under certain conditions can be improved by including a line-search strategy.

  9. Evaluation of the Kubo formula for the conductivity using the recursion method

    International Nuclear Information System (INIS)

    Yeyati, A.L.; Weissmann, M.; Anda, E.

    1988-09-01

    We propose a numerical algorithm based on the recursion method to calculate the conductivity of a disordered system described by a tight-binding Hamiltonian. It has the advantage that the density of states and the conductivity can be obtained in a single recursion calculation. The method is applied to simple one and two-dimensional incommensurate systems in order to check the validity of the assumptions made and the numerical efficiency. The calculated conductivity shows a clear drop when the Fermi energy crosses a mobility edge. Potential applications of this work to other systems are discussed. (author). 13 refs, 9 figs

  10. Partitioned based approach for very large scale database in Indian nuclear power plants

    International Nuclear Information System (INIS)

    Tiwari, Sachin; Upadhyay, Pushp; Sengupta, Nabarun; Bhandarkar, S.G.; Agilandaeswari

    2012-01-01

    This paper presents a partition based approach for handling very large tables with size running in giga-bytes to tera-bytes. The scheme is developed from our experience in handling large signal storage which is required in various computer based data acquisition and control room operator information systems such as Distribution Recording System (DRS) and Computerised Operator Information System (COIS). Whenever there is a disturbance in an operating nuclear power plant, it triggers an action where a large volume of data from multiple sources is generated and this data needs to be stored. Concurrency issues as data is from multiple sources and very large amount of data are the problems which are addressed in this paper by applying partition based approach. Advantages of partition based approach with other techniques are discussed. (author)

  11. An extensive analysis of the parity of broken 3-diamond partitions

    OpenAIRE

    Radu, Silviu; Sellers, James A.

    2013-01-01

    In 2007, Andrews and Paule introduced the family of functions ? k ( n ) which enumerate the number of broken k-diamond partitions for a fixed positive integer k. Since then, numerous mathematicians have considered partitions congruences satisfied by ? k ( n ) for small values of k. In this work, we provide an extensive analysis of the parity of the function ? 3 ( n ) , including a number of Ramanujan-like congruences modulo 2. This will be accomplished by completely characterizing the values ...

  12. Discovery of a Recursive Principle: An Artificial Grammar Investigation of Human Learning of a Counting Recursion Language.

    Science.gov (United States)

    Cho, Pyeong Whan; Szkudlarek, Emily; Tabor, Whitney

    2016-01-01

    Learning is typically understood as a process in which the behavior of an organism is progressively shaped until it closely approximates a target form. It is easy to comprehend how a motor skill or a vocabulary can be progressively learned-in each case, one can conceptualize a series of intermediate steps which lead to the formation of a proficient behavior. With grammar, it is more difficult to think in these terms. For example, center embedding recursive structures seem to involve a complex interplay between multiple symbolic rules which have to be in place simultaneously for the system to work at all, so it is not obvious how the mechanism could gradually come into being. Here, we offer empirical evidence from a new artificial language (or "artificial grammar") learning paradigm, Locus Prediction, that, despite the conceptual conundrum, recursion acquisition occurs gradually, at least for a simple formal language. In particular, we focus on a variant of the simplest recursive language, a (n) b (n) , and find evidence that (i) participants trained on two levels of structure (essentially ab and aabb) generalize to the next higher level (aaabbb) more readily than participants trained on one level of structure (ab) combined with a filler sentence; nevertheless, they do not generalize immediately; (ii) participants trained up to three levels (ab, aabb, aaabbb) generalize more readily to four levels than participants trained on two levels generalize to three; (iii) when we present the levels in succession, starting with the lower levels and including more and more of the higher levels, participants show evidence of transitioning between the levels gradually, exhibiting intermediate patterns of behavior on which they were not trained; (iv) the intermediate patterns of behavior are associated with perturbations of an attractor in the sense of dynamical systems theory. We argue that all of these behaviors indicate a theory of mental representation in which recursive

  13. Fast parallel DNA-based algorithms for molecular computation: the set-partition problem.

    Science.gov (United States)

    Chang, Weng-Long

    2007-12-01

    This paper demonstrates that basic biological operations can be used to solve the set-partition problem. In order to achieve this, we propose three DNA-based algorithms, a signed parallel adder, a signed parallel subtractor and a signed parallel comparator, that formally verify our designed molecular solutions for solving the set-partition problem.

  14. Recursive Estimation for Dynamical Systems with Different Delay Rates Sensor Network and Autocorrelated Process Noises

    Directory of Open Access Journals (Sweden)

    Jianxin Feng

    2014-01-01

    Full Text Available The recursive estimation problem is studied for a class of uncertain dynamical systems with different delay rates sensor network and autocorrelated process noises. The process noises are assumed to be autocorrelated across time and the autocorrelation property is described by the covariances between different time instants. The system model under consideration is subject to multiplicative noises or stochastic uncertainties. The sensor delay phenomenon occurs in a random way and each sensor in the sensor network has an individual delay rate which is characterized by a binary switching sequence obeying a conditional probability distribution. By using the orthogonal projection theorem and an innovation analysis approach, the desired recursive robust estimators including recursive robust filter, predictor, and smoother are obtained. Simulation results are provided to demonstrate the effectiveness of the proposed approaches.

  15. Normalized Minimum Error Entropy Algorithm with Recursive Power Estimation

    Directory of Open Access Journals (Sweden)

    Namyong Kim

    2016-06-01

    Full Text Available The minimum error entropy (MEE algorithm is known to be superior in signal processing applications under impulsive noise. In this paper, based on the analysis of behavior of the optimum weight and the properties of robustness against impulsive noise, a normalized version of the MEE algorithm is proposed. The step size of the MEE algorithm is normalized with the power of input entropy that is estimated recursively for reducing its computational complexity. The proposed algorithm yields lower minimum MSE (mean squared error and faster convergence speed simultaneously than the original MEE algorithm does in the equalization simulation. On the condition of the same convergence speed, its performance enhancement in steady state MSE is above 3 dB.

  16. Recursive Algorithm For Linear Regression

    Science.gov (United States)

    Varanasi, S. V.

    1988-01-01

    Order of model determined easily. Linear-regression algorithhm includes recursive equations for coefficients of model of increased order. Algorithm eliminates duplicative calculations, facilitates search for minimum order of linear-regression model fitting set of data satisfactory.

  17. A RECURSIVE ALGORITHM SUITABLE FOR REAL-TIME MEASUREMENT

    Directory of Open Access Journals (Sweden)

    Giovanni Bucci

    1995-12-01

    Full Text Available This paper deals with a recursive algorithm suitable for realtime measurement applications, based on an indirect technique, useful in those applications where the required quantities cannot be measured in a straightforward way. To cope with time constraints a parallel formulation of it, suitable to be implemented on multiprocessor systems, is presented. The adopted concurrent implementation is based on factorization techniques. Some experimental results related to the application of the system for carrying out measurements on synchronous motors are included.

  18. Recursive and non-linear logistic regression: moving on from the original EuroSCORE and EuroSCORE II methodologies.

    Science.gov (United States)

    Poullis, Michael

    2014-11-01

    EuroSCORE II, despite improving on the original EuroSCORE system, has not solved all the calibration and predictability issues. Recursive, non-linear and mixed recursive and non-linear regression analysis were assessed with regard to sensitivity, specificity and predictability of the original EuroSCORE and EuroSCORE II systems. The original logistic EuroSCORE, EuroSCORE II and recursive, non-linear and mixed recursive and non-linear regression analyses of these risk models were assessed via receiver operator characteristic curves (ROC) and Hosmer-Lemeshow statistic analysis with regard to the accuracy of predicting in-hospital mortality. Analysis was performed for isolated coronary artery bypass grafts (CABGs) (n = 2913), aortic valve replacement (AVR) (n = 814), mitral valve surgery (n = 340), combined AVR and CABG (n = 517), aortic (n = 350), miscellaneous cases (n = 642), and combinations of the above cases (n = 5576). The original EuroSCORE had an ROC below 0.7 for isolated AVR and combined AVR and CABG. None of the methods described increased the ROC above 0.7. The EuroSCORE II risk model had an ROC below 0.7 for isolated AVR only. Recursive regression, non-linear regression, and mixed recursive and non-linear regression all increased the ROC above 0.7 for isolated AVR. The original EuroSCORE had a Hosmer-Lemeshow statistic that was above 0.05 for all patients and the subgroups analysed. All of the techniques markedly increased the Hosmer-Lemeshow statistic. The EuroSCORE II risk model had a Hosmer-Lemeshow statistic that was significant for all patients (P linear regression failed to improve on the original Hosmer-Lemeshow statistic. The mixed recursive and non-linear regression using the EuroSCORE II risk model was the only model that produced an ROC of 0.7 or above for all patients and procedures and had a Hosmer-Lemeshow statistic that was highly non-significant. The original EuroSCORE and the EuroSCORE II risk models do not have adequate ROC and Hosmer

  19. EEG and MEG source localization using recursively applied (RAP) MUSIC

    Energy Technology Data Exchange (ETDEWEB)

    Mosher, J.C. [Los Alamos National Lab., NM (United States); Leahy, R.M. [University of Southern California, Los Angeles, CA (United States). Signal and Image Processing Inst.

    1996-12-31

    The multiple signal characterization (MUSIC) algorithm locates multiple asynchronous dipolar sources from electroencephalography (EEG) and magnetoencephalography (MEG) data. A signal subspace is estimated from the data, then the algorithm scans a single dipole model through a three-dimensional head volume and computes projections onto this subspace. To locate the sources, the user must search the head volume for local peaks in the projection metric. Here we describe a novel extension of this approach which we refer to as RAP (Recursively APplied) MUSIC. This new procedure automatically extracts the locations of the sources through a recursive use of subspace projections, which uses the metric of principal correlations as a multidimensional form of correlation analysis between the model subspace and the data subspace. The dipolar orientations, a form of `diverse polarization,` are easily extracted using the associated principal vectors.

  20. Recursion rules for scattering amplitudes in non-Abelian gauge theories

    International Nuclear Information System (INIS)

    Kim, C.; Nair, V.P.

    1997-01-01

    We present a functional derivation of recursion rules for scattering amplitudes in a non-Abelian gauge theory in a form valid to arbitrary loop order. The tree-level and one-loop recursion rules are explicitly displayed. copyright 1997 The American Physical Society

  1. Recursive representation of Wronskians in confluent supersymmetric quantum mechanics

    International Nuclear Information System (INIS)

    Contreras-Astorga, Alonso; Schulze-Halberg, Axel

    2017-01-01

    A recursive form of arbitrary-order Wronskian associated with transformation functions in the confluent algorithm of supersymmetric quantum mechanics (SUSY) is constructed. With this recursive form regularity conditions for the generated potentials can be analyzed. Moreover, as byproducts we obtain new representations of solutions to Schrödinger equations that underwent a confluent SUSY-transformation. (paper)

  2. A strange recursion operator demystified

    International Nuclear Information System (INIS)

    Sergyeyev, A

    2005-01-01

    We show that a new integrable two-component system of KdV type studied by Karasu (Kalkanli) et al (2004 Acta Appl. Math. 83 85-94) is bi-Hamiltonian, and its recursion operator, which has a highly unusual structure of nonlocal terms, can be written as a ratio of two compatible Hamiltonian operators found by us. Using this we prove that the system in question possesses an infinite hierarchy of local commuting generalized symmetries and conserved quantities in involution, and the evolution systems corresponding to these symmetries are bi-Hamiltonian as well. We also show that upon introduction of suitable nonlocal variables the nonlocal terms of the recursion operator under study can be written in the usual form, with the integration operator D -1 x appearing in each term at most once. (letter to the editor)

  3. Cobham recursive set functions

    Czech Academy of Sciences Publication Activity Database

    Beckmann, A.; Buss, S.; Friedman, S.-D.; Müller, M.; Thapen, Neil

    2016-01-01

    Roč. 167, č. 3 (2016), s. 335-369 ISSN 0168-0072 R&D Projects: GA ČR GBP202/12/G061 Institutional support: RVO:67985840 Keywords : set function * polynomial time * Cobham recursion Subject RIV: BA - General Mathematics Impact factor: 0.647, year: 2016 http://www.sciencedirect.com/science/article/pii/S0168007215001293

  4. A Proof-Theoretic Account of Primitive Recursion and Primitive Iteration

    DEFF Research Database (Denmark)

    Cherabini, Luca; Danvy, Olivier

    2011-01-01

    We revisit both the usual ``going-up'' induction principle and Manna and Waldinger's ``going-down'' induction principle for primitive recursion,`a la Goedel, and primitive iteration, `a la Church. We use 'Kleene's trick' to show that primitive recursion and primitive iiteration are as expressive...

  5. A New Model for Optimal Mechanical and Thermal Performance of Cement-Based Partition Wall.

    Science.gov (United States)

    Huang, Shiping; Hu, Mengyu; Huang, Yonghui; Cui, Nannan; Wang, Weifeng

    2018-04-17

    The prefabricated cement-based partition wall has been widely used in assembled buildings because of its high manufacturing efficiency, high-quality surface, and simple and convenient construction process. In this paper, a general porous partition wall that is made from cement-based materials was proposed to meet the optimal mechanical and thermal performance during transportation, construction and its service life. The porosity of the proposed partition wall is formed by elliptic-cylinder-type cavities. The finite element method was used to investigate the mechanical and thermal behaviour, which shows that the proposed model has distinct advantages over the current partition wall that is used in the building industry. It is found that, by controlling the eccentricity of the elliptic-cylinder cavities, the proposed wall stiffness can be adjusted to respond to the imposed loads and to improve the thermal performance, which can be used for the optimum design. Finally, design guidance is provided to obtain the optimal mechanical and thermal performance. The proposed model could be used as a promising candidate for partition wall in the building industry.

  6. A New Model for Optimal Mechanical and Thermal Performance of Cement-Based Partition Wall

    Directory of Open Access Journals (Sweden)

    Shiping Huang

    2018-04-01

    Full Text Available The prefabricated cement-based partition wall has been widely used in assembled buildings because of its high manufacturing efficiency, high-quality surface, and simple and convenient construction process. In this paper, a general porous partition wall that is made from cement-based materials was proposed to meet the optimal mechanical and thermal performance during transportation, construction and its service life. The porosity of the proposed partition wall is formed by elliptic-cylinder-type cavities. The finite element method was used to investigate the mechanical and thermal behaviour, which shows that the proposed model has distinct advantages over the current partition wall that is used in the building industry. It is found that, by controlling the eccentricity of the elliptic-cylinder cavities, the proposed wall stiffness can be adjusted to respond to the imposed loads and to improve the thermal performance, which can be used for the optimum design. Finally, design guidance is provided to obtain the optimal mechanical and thermal performance. The proposed model could be used as a promising candidate for partition wall in the building industry.

  7. TREAT (TREe-based Association Test)

    Science.gov (United States)

    TREAT is an R package for detecting complex joint effects in case-control studies. The test statistic is derived from a tree-structure model by recursive partitioning the data. Ultra-fast algorithm is designed to evaluate the significance of association between candidate gene and disease outcome

  8. Recursive Ultrasound Imaging

    DEFF Research Database (Denmark)

    Nikolov, Svetoslav; Gammelmark, Kim; Jensen, Jørgen Arendt

    1999-01-01

    This paper presents a new imaging method, applicable for both 2D and 3D imaging. It is based on Synthetic Transmit Aperture Focusing, but unlike previous approaches a new frame is created after every pulse emission. The elements from a linear transducer array emit pulses one after another. The same...... transducer element is used after N-xmt emissions. For each emission the signals from the individual elements are beam-formed in parallel for all directions in the image. A new frame is created by adding the new RF lines to the RF lines from the previous frame. The RF data recorded at the previous emission...... with the same element are subtracted. This yields a new image after each pulse emission and can give a frame rate of e.g. 5000 images/sec. The paper gives a derivation of the recursive imaging technique and compares simulations for fast B-mode imaging with measurements. A low value of N-xmt is necessary...

  9. Image coding based on maximum entropy partitioning for identifying ...

    Indian Academy of Sciences (India)

    A new coding scheme based on maximum entropy partitioning is proposed in our work, particularly to identify the improbable intensities related to different emotions. The improbable intensities when used as a mask decode the facial expression correctly, providing an effectiveplatform for future emotion categorization ...

  10. PARTITION: A program for defining the source term/consequence analysis interface in the NUREG--1150 probabilistic risk assessments

    International Nuclear Information System (INIS)

    Iman, R.L.; Helton, J.C.; Johnson, J.D.

    1990-05-01

    The individual plant analyses in the US Nuclear Regulatory Commission's reassessment of the risk from commercial nuclear power plants (NUREG-1150) consist of four parts: systems analysis, accident progression analysis, source term analysis, and consequence analysis. Careful definition of the interfaces between these parts is necessary for both information flow and computational efficiency. This document has been designed for users of the PARTITION computer program developed by the authors at Sandia National Laboratories for defining the interface between the source term analysis (performed with the XXSOR programs) and the consequence analysis (performed with the MACCS program). This report provides a tutorial that details how the interactive partitioning is performed, along with detailed information on the partitioning process. The PARTITION program was written in ANSI standard FORTRAN 77 to make the code as machine-independent (i.e., portable) as possible. 9 refs., 4 figs

  11. Efficient design of two-dimensional recursive digital filters. Final report

    International Nuclear Information System (INIS)

    Twogood, R.E.; Mitra, S.K.

    1980-01-01

    This report outlines the research progress during the period August 1978 to July 1979. This work can be divided into seven basic project areas. Project 1 deals with a comparative study of 2-D recursive and nonrecursive digital filters. The second project addresses a new design technique for 2-D half-plane recursive filters, and Projects 3 thru 5 deal with implementation issues. The sixth project presents our recent study of the applicability of array processors to 2-D digital signal processing. The final project involves our investigation into techniques for incorporating symmetry constraints on 2-D recursive filters in order to yield more efficient implementations

  12. Study of recursive model for pole-zero cancellation circuit

    International Nuclear Information System (INIS)

    Zhou Jianbin; Zhou Wei; Hong Xu; Hu Yunchuan; Wan Xinfeng; Du Xin; Wang Renbo

    2014-01-01

    The output of charge sensitive amplifier (CSA) is a negative exponential signal with long decay time which will result in undershoot after C-R differentiator. Pole-zero cancellation (PZC) circuit is often applied to eliminate undershoot in many radiation detectors. However, it is difficult to use a zero created by PZC circuit to cancel a pole in CSA output signal accurately because of the influences of electronic components inherent error and environmental factors. A novel recursive model for PZC circuit is presented based on Kirchhoff's Current Law (KCL) in this paper. The model is established by numerical differentiation algorithm between the input and the output signal. Some simulation experiments for a negative exponential signal are carried out using Visual Basic for Application (VBA) program and a real x-ray signal is also tested. Simulated results show that the recursive model can reduce the time constant of input signal and eliminate undershoot. (authors)

  13. Adaptive operational modal identification for slow linear time-varying structures based on frozen-in coefficient method and limited memory recursive principal component analysis

    Science.gov (United States)

    Wang, Cheng; Guan, Wei; Wang, J. Y.; Zhong, Bineng; Lai, Xiongming; Chen, Yewang; Xiang, Liang

    2018-02-01

    To adaptively identify the transient modal parameters for linear weakly damped structures with slow time-varying characteristics under unmeasured stationary random ambient loads, this paper proposes a novel operational modal analysis (OMA) method based on the frozen-in coefficient method and limited memory recursive principal component analysis (LMRPCA). In the modal coordinate, the random vibration response signals of mechanical weakly damped structures can be decomposed into the inner product of modal shapes and modal responses, from which the natural frequencies and damping ratios can be well acquired by single-degree-of-freedom (SDOF) identification approach such as FFT. Hence, for the OMA method based on principal component analysis (PCA), it becomes very crucial to examine the relation between the transformational matrix and the modal shapes matrix, to find the association between the principal components (PCs) matrix and the modal responses matrix, and to turn the operational modal parameter identification problem into PCA of the stationary random vibration response signals of weakly damped mechanical structures. Based on the theory of "time-freezing", the method of frozen-in coefficient, and the assumption of "short time invariant" and "quasistationary", the non-stationary random response signals of the weakly damped and slow linear time-varying structures (LTV) can approximately be seen as the stationary random response time series of weakly damped and linear time invariant structures (LTI) in a short interval. Thus, the adaptive identification of time-varying operational modal parameters is turned into decompositing the PCs of stationary random vibration response signals subsection of weakly damped mechanical structures after choosing an appropriate limited memory window. Finally, a three-degree-of-freedom (DOF) structure with weakly damped and slow time-varying mass is presented to illustrate this method of identification. Results show that the LMRPCA

  14. Approximate Bayesian recursive estimation

    Czech Academy of Sciences Publication Activity Database

    Kárný, Miroslav

    2014-01-01

    Roč. 285, č. 1 (2014), s. 100-111 ISSN 0020-0255 R&D Projects: GA ČR GA13-13502S Institutional support: RVO:67985556 Keywords : Approximate parameter estimation * Bayesian recursive estimation * Kullback–Leibler divergence * Forgetting Subject RIV: BB - Applied Statistics, Operational Research Impact factor: 4.038, year: 2014 http://library.utia.cas.cz/separaty/2014/AS/karny-0425539.pdf

  15. Solute partitioning and interfacial segregation in TiAl-based alloys

    International Nuclear Information System (INIS)

    Larson, D.J.; Miller, M.K.

    1999-01-01

    Atom probe microscopy has been used to investigate elemental partitioning and segregation behavior in a TiAl-based alloy with a variety of alloying additions including Cr, Nb, W and B. These results indicate that in a stress-relieved state (2h at 900 C) and a reheated state (2h at 900 C, 2,184h at 800 C and 2h at 1,210 C) chromium, and to a lesser extent tungsten, is partitioned to the α 2 phase. However, in an annealed state (2h at 900 C and 720 h at 800 C), these elements are partitioned to the γ phase. Segregation of chromium and tungsten to lamellar interfaces is observed in the stress-relieved material, but significant segregation was not observed in material subjected to the other heat treatments. A W- and B-enriched precipitate was observed in the reheated material and provides a possible explanation for the low tungsten concentrations measured in the matrix phases

  16. A dynamic re-partitioning strategy based on the distribution of key in Spark

    Science.gov (United States)

    Zhang, Tianyu; Lian, Xin

    2018-05-01

    Spark is a memory-based distributed data processing framework, has the ability of processing massive data and becomes a focus in Big Data. But the performance of Spark Shuffle depends on the distribution of data. The naive Hash partition function of Spark can not guarantee load balancing when data is skewed. The time of job is affected by the node which has more data to process. In order to handle this problem, dynamic sampling is used. In the process of task execution, histogram is used to count the key frequency distribution of each node, and then generate the global key frequency distribution. After analyzing the distribution of key, load balance of data partition is achieved. Results show that the Dynamic Re-Partitioning function is better than the default Hash partition, Fine Partition and the Balanced-Schedule strategy, it can reduce the execution time of the task and improve the efficiency of the whole cluster.

  17. Yoink: An interaction-based partitioning API.

    Science.gov (United States)

    Zheng, Min; Waller, Mark P

    2018-05-15

    Herein, we describe the implementation details of our interaction-based partitioning API (application programming interface) called Yoink for QM/MM modeling and fragment-based quantum chemistry studies. Interactions are detected by computing density descriptors such as reduced density gradient, density overlap regions indicator, and single exponential decay detector. Only molecules having an interaction with a user-definable QM core are added to the QM region of a hybrid QM/MM calculation. Moreover, a set of molecule pairs having density-based interactions within a molecular system can be computed in Yoink, and an interaction graph can then be constructed. Standard graph clustering methods can then be applied to construct fragments for further quantum chemical calculations. The Yoink API is licensed under Apache 2.0 and can be accessed via yoink.wallerlab.org. © 2018 Wiley Periodicals, Inc. © 2018 Wiley Periodicals, Inc.

  18. Time-area efficient multiplier-free recursive filter architectures for FPGA implementation

    DEFF Research Database (Denmark)

    Shajaan, Mohammad; Sørensen, John Aasted

    1996-01-01

    Simultaneous design of multiplier-free recursive filters (IIR filters) and their hardware implementation in Xilinx field programmable gate array (XC4000) is presented. The hardware design methodology leads to high performance recursive filters with sampling frequencies in the interval 15-21 MHz (...

  19. Language, Mind, Practice: Families of Recursive Thinking in Human Reasoning

    Science.gov (United States)

    Josephson, Marika

    2011-01-01

    In 2002, Chomsky, Hauser, and Fitch asserted that recursion may be the one aspect of the human language faculty that makes human language unique in the narrow sense--unique to language and unique to human beings. They also argue somewhat more quietly (as do Pinker and Jackendoff 2005) that recursion may be possible outside of language: navigation,…

  20. Mining IP to Domain Name Interactions to Detect DNS Flood Attacks on Recursive DNS Servers

    Directory of Open Access Journals (Sweden)

    Roberto Alonso

    2016-08-01

    Full Text Available The Domain Name System (DNS is a critical infrastructure of any network, and, not surprisingly a common target of cybercrime. There are numerous works that analyse higher level DNS traffic to detect anomalies in the DNS or any other network service. By contrast, few efforts have been made to study and protect the recursive DNS level. In this paper, we introduce a novel abstraction of the recursive DNS traffic to detect a flooding attack, a kind of Distributed Denial of Service (DDoS. The crux of our abstraction lies on a simple observation: Recursive DNS queries, from IP addresses to domain names, form social groups; hence, a DDoS attack should result in drastic changes on DNS social structure. We have built an anomaly-based detection mechanism, which, given a time window of DNS usage, makes use of features that attempt to capture the DNS social structure, including a heuristic that estimates group composition. Our detection mechanism has been successfully validated (in a simulated and controlled setting and with it the suitability of our abstraction to detect flooding attacks. To the best of our knowledge, this is the first time that work is successful in using this abstraction to detect these kinds of attacks at the recursive level. Before concluding the paper, we motivate further research directions considering this new abstraction, so we have designed and tested two additional experiments which exhibit promising results to detect other types of anomalies in recursive DNS servers.

  1. Mining IP to Domain Name Interactions to Detect DNS Flood Attacks on Recursive DNS Servers.

    Science.gov (United States)

    Alonso, Roberto; Monroy, Raúl; Trejo, Luis A

    2016-08-17

    The Domain Name System (DNS) is a critical infrastructure of any network, and, not surprisingly a common target of cybercrime. There are numerous works that analyse higher level DNS traffic to detect anomalies in the DNS or any other network service. By contrast, few efforts have been made to study and protect the recursive DNS level. In this paper, we introduce a novel abstraction of the recursive DNS traffic to detect a flooding attack, a kind of Distributed Denial of Service (DDoS). The crux of our abstraction lies on a simple observation: Recursive DNS queries, from IP addresses to domain names, form social groups; hence, a DDoS attack should result in drastic changes on DNS social structure. We have built an anomaly-based detection mechanism, which, given a time window of DNS usage, makes use of features that attempt to capture the DNS social structure, including a heuristic that estimates group composition. Our detection mechanism has been successfully validated (in a simulated and controlled setting) and with it the suitability of our abstraction to detect flooding attacks. To the best of our knowledge, this is the first time that work is successful in using this abstraction to detect these kinds of attacks at the recursive level. Before concluding the paper, we motivate further research directions considering this new abstraction, so we have designed and tested two additional experiments which exhibit promising results to detect other types of anomalies in recursive DNS servers.

  2. On Recursion Operator of the q -KP Hierarchy

    International Nuclear Information System (INIS)

    Tian Ke-Lei; Zhu Xiao-Ming; He Jing-Song

    2016-01-01

    It is the aim of the present article to give a general expression of flow equations of the q-KP hierarchy. The distinct difference between the q-KP hierarchy and the KP hierarchy is due to q-binomial and the action of q-shift operator θ, which originates from the Leibnitz rule of the quantum calculus. We further show that the n-reduction leads to a recursive scheme for these flow equations. The recursion operator for the flow equations of the q-KP hierarchy under the n-reduction is also derived. (paper)

  3. Polymers as reference partitioning phase: polymer calibration for an analytically operational approach to quantify multimedia phase partitioning

    DEFF Research Database (Denmark)

    Gilbert, Dorothea; Witt, Gesine; Smedes, Foppe

    2016-01-01

    Polymers are increasingly applied for the enrichment of hydrophobic organic chemicals (HOCs) from various types of samples and media in many analytical partitioning-based measuring techniques. We propose using polymers as a reference partitioning phase and introduce polymer-polymer partitioning......-air) and multimedia partition coefficients (lipid-water, air-water) were calculated by applying the new concept of a polymer as reference partitioning phase and by using polymer-polymer partition coefficients as conversion factors. The present study encourages the use of polymer-polymer partition coefficients...

  4. Hypergraph partitioning implementation for parallelizing matrix-vector multiplication using CUDA GPU-based parallel computing

    Science.gov (United States)

    Murni, Bustamam, A.; Ernastuti, Handhika, T.; Kerami, D.

    2017-07-01

    Calculation of the matrix-vector multiplication in the real-world problems often involves large matrix with arbitrary size. Therefore, parallelization is needed to speed up the calculation process that usually takes a long time. Graph partitioning techniques that have been discussed in the previous studies cannot be used to complete the parallelized calculation of matrix-vector multiplication with arbitrary size. This is due to the assumption of graph partitioning techniques that can only solve the square and symmetric matrix. Hypergraph partitioning techniques will overcome the shortcomings of the graph partitioning technique. This paper addresses the efficient parallelization of matrix-vector multiplication through hypergraph partitioning techniques using CUDA GPU-based parallel computing. CUDA (compute unified device architecture) is a parallel computing platform and programming model that was created by NVIDIA and implemented by the GPU (graphics processing unit).

  5. A self-applicable online partial evaluator for recursive flowchart languages

    DEFF Research Database (Denmark)

    Glück, Robert

    2012-01-01

    This paper describes a self-applicable online partial evaluator for a ¿owchart language with recursive calls. Self-application of the partial evaluator yields generating extensions that are as ef¿cient as those reported in the literature for of¿ine partial evaluation. This result is remarkable...... because it has been assumed that online partial evaluation techniques unavoidably lead to inef¿cient and overgeneralized generating extensions. The purpose of this paper is not to determine which kind of partial evaluation is better, but to show how the problem can be solved by recursive polyvariant...... specialization. The design of the self-applicable online partial evaluator is based on a number of known techniques, but by combining them in a new way this result can be produced. The partial evaluator, its techniques, and its implementation are presented in full. Self-application according to all three...

  6. Overlapping communities detection based on spectral analysis of line graphs

    Science.gov (United States)

    Gui, Chun; Zhang, Ruisheng; Hu, Rongjing; Huang, Guoming; Wei, Jiaxuan

    2018-05-01

    Community in networks are often overlapping where one vertex belongs to several clusters. Meanwhile, many networks show hierarchical structure such that community is recursively grouped into hierarchical organization. In order to obtain overlapping communities from a global hierarchy of vertices, a new algorithm (named SAoLG) is proposed to build the hierarchical organization along with detecting the overlap of community structure. SAoLG applies the spectral analysis into line graphs to unify the overlap and hierarchical structure of the communities. In order to avoid the limitation of absolute distance such as Euclidean distance, SAoLG employs Angular distance to compute the similarity between vertices. Furthermore, we make a micro-improvement partition density to evaluate the quality of community structure and use it to obtain the more reasonable and sensible community numbers. The proposed SAoLG algorithm achieves a balance between overlap and hierarchy by applying spectral analysis to edge community detection. The experimental results on one standard network and six real-world networks show that the SAoLG algorithm achieves higher modularity and reasonable community number values than those generated by Ahn's algorithm, the classical CPM and GN ones.

  7. Adaptively loaded IM/DD optical OFDM based on set-partitioned QAM formats.

    Science.gov (United States)

    Zhao, Jian; Chen, Lian-Kuan

    2017-04-17

    We investigate the constellation design and symbol error rate (SER) of set-partitioned (SP) quadrature amplitude modulation (QAM) formats. Based on the SER analysis, we derive the adaptive bit and power loading algorithm for SP QAM based intensity-modulation direct-detection (IM/DD) orthogonal frequency division multiplexing (OFDM). We experimentally show that the proposed system significantly outperforms the conventional adaptively-loaded IM/DD OFDM and can increase the data rate from 36 Gbit/s to 42 Gbit/s in the presence of severe dispersion-induced spectral nulls after 40-km single-mode fiber. It is also shown that the adaptive algorithm greatly enhances the tolerance to fiber nonlinearity and allows for more power budget.

  8. Radio Wave Propagation Scene Partitioning for High-Speed Rails

    Directory of Open Access Journals (Sweden)

    Bo Ai

    2012-01-01

    Full Text Available Radio wave propagation scene partitioning is necessary for wireless channel modeling. As far as we know, there are no standards of scene partitioning for high-speed rail (HSR scenarios, and therefore we propose the radio wave propagation scene partitioning scheme for HSR scenarios in this paper. Based on our measurements along the Wuhan-Guangzhou HSR, Zhengzhou-Xian passenger-dedicated line, Shijiazhuang-Taiyuan passenger-dedicated line, and Beijing-Tianjin intercity line in China, whose operation speeds are above 300 km/h, and based on the investigations on Beijing South Railway Station, Zhengzhou Railway Station, Wuhan Railway Station, Changsha Railway Station, Xian North Railway Station, Shijiazhuang North Railway Station, Taiyuan Railway Station, and Tianjin Railway Station, we obtain an overview of HSR propagation channels and record many valuable measurement data for HSR scenarios. On the basis of these measurements and investigations, we partitioned the HSR scene into twelve scenarios. Further work on theoretical analysis based on radio wave propagation mechanisms, such as reflection and diffraction, may lead us to develop the standard of radio wave propagation scene partitioning for HSR. Our work can also be used as a basis for the wireless channel modeling and the selection of some key techniques for HSR systems.

  9. Recursion relations for AdS/CFT correlators

    International Nuclear Information System (INIS)

    Raju, Suvrat

    2011-01-01

    We expand on the results of our recent letter [Phys. Rev. Lett. 106, 091601 (2011)], where we presented new recursion relations for correlation functions of the stress-tensor and conserved currents in conformal field theories with an AdS d+1 dual for d≥4. These recursion relations are derived by generalizing the Britto-Cachazo-Feng-Witten (BCFW) relations to amplitudes in anti-de Sitter space (AdS) that are dual to boundary correlators, and are usually computed perturbatively by Witten diagrams. Our results relate vacuum-correlation functions to integrated products of lower-point transition amplitudes, which correspond to correlators calculated between states dual to certain normalizable modes. We show that the set of ''polarization vectors'' for which amplitudes behave well under the BCFW extension is smaller than in flat-space. We describe how transition amplitudes for more general external polarizations can be constructed by combining answers obtained by different pairs of BCFW shifts. We then generalize these recursion relations to supersymmetric theories. In AdS, unlike flat-space, even maximal supersymmetry is insufficient to permit the computation of all correlators of operators in the same multiplet as a stress-tensor or conserved current. Finally, we work out some simple examples to verify our results.

  10. Recursion theory for metamathematics

    CERN Document Server

    Smullyan, Raymond M

    1993-01-01

    This work is a sequel to the author''s Godel''s Incompleteness Theorems, though it can be read independently by anyone familiar with Godel''s incompleteness theorem for Peano arithmetic. The book deals mainly with those aspects of recursion theory that have applications to the metamathematics of incompleteness, undecidability, and related topics. It is both an introduction to the theory and a presentation of new results in the field.

  11. An OSKit-Based Implementation of Least Privilege Separation Kernel Memory Partitioning

    National Research Council Canada - National Science Library

    Carter, Donald W

    2007-01-01

    .... This work is to build a working prototype of selected TCX kernel functionality. The prototype is constructed and based on OSKit, and restricts information flow between memory partitions and resource accesses...

  12. An Integrated Approach for Non-Recursive Formulation of Connection-Coefficients of Orthogonal Functions

    Directory of Open Access Journals (Sweden)

    Monika GARG

    2012-08-01

    Full Text Available In this paper, an integrated approach is proposed for non-recursive formulation of connection coefficients of different orthogonal functions in terms of a generic orthogonal function. The application of these coefficients arises when the product of two orthogonal basis functions are to be expressed in terms of single basis functions. Two significant advantages are achieved; one, the non-recursive formulations avoid memory and stack overflows in computer implementations; two, the integrated approach provides for digital hardware once-designed can be used for different functions. Computational savings achieved with the proposed non-recursive formulation vis-à-vis recursive formulation, reported in the literature so far, have been demonstrated using MATLAB PROFILER.

  13. Variable length adjacent partitioning for PTS based PAPR reduction of OFDM signal

    International Nuclear Information System (INIS)

    Ibraheem, Zeyid T.; Rahman, Md. Mijanur; Yaakob, S. N.; Razalli, Mohammad Shahrazel; Kadhim, Rasim A.

    2015-01-01

    Peak-to-Average power ratio (PAPR) is a major drawback in OFDM communication. It leads the power amplifier into nonlinear region operation resulting into loss of data integrity. As such, there is a strong motivation to find techniques to reduce PAPR. Partial Transmit Sequence (PTS) is an attractive scheme for this purpose. Judicious partitioning the OFDM data frame into disjoint subsets is a pivotal component of any PTS scheme. Out of the existing partitioning techniques, adjacent partitioning is characterized by an attractive trade-off between cost and performance. With an aim of determining effects of length variability of adjacent partitions, we performed an investigation into the performances of a variable length adjacent partitioning (VL-AP) and fixed length adjacent partitioning in comparison with other partitioning schemes such as pseudorandom partitioning. Simulation results with different modulation and partitioning scenarios showed that fixed length adjacent partition had better performance compared to variable length adjacent partitioning. As expected, simulation results showed a slightly better performance of pseudorandom partitioning technique compared to fixed and variable adjacent partitioning schemes. However, as the pseudorandom technique incurs high computational complexities, adjacent partitioning schemes were still seen as favorable candidates for PAPR reduction

  14. Variable length adjacent partitioning for PTS based PAPR reduction of OFDM signal

    Energy Technology Data Exchange (ETDEWEB)

    Ibraheem, Zeyid T.; Rahman, Md. Mijanur; Yaakob, S. N.; Razalli, Mohammad Shahrazel; Kadhim, Rasim A. [School of Computer and Communication Engineering, Universiti Malaysia Perlis, 02600 Arau, Perlis (Malaysia)

    2015-05-15

    Peak-to-Average power ratio (PAPR) is a major drawback in OFDM communication. It leads the power amplifier into nonlinear region operation resulting into loss of data integrity. As such, there is a strong motivation to find techniques to reduce PAPR. Partial Transmit Sequence (PTS) is an attractive scheme for this purpose. Judicious partitioning the OFDM data frame into disjoint subsets is a pivotal component of any PTS scheme. Out of the existing partitioning techniques, adjacent partitioning is characterized by an attractive trade-off between cost and performance. With an aim of determining effects of length variability of adjacent partitions, we performed an investigation into the performances of a variable length adjacent partitioning (VL-AP) and fixed length adjacent partitioning in comparison with other partitioning schemes such as pseudorandom partitioning. Simulation results with different modulation and partitioning scenarios showed that fixed length adjacent partition had better performance compared to variable length adjacent partitioning. As expected, simulation results showed a slightly better performance of pseudorandom partitioning technique compared to fixed and variable adjacent partitioning schemes. However, as the pseudorandom technique incurs high computational complexities, adjacent partitioning schemes were still seen as favorable candidates for PAPR reduction.

  15. CP-recursion and the derivation of verb second in Germanic main and embedded clauses

    DEFF Research Database (Denmark)

    Vikner, Sten

    2017-01-01

    , this is normally not the case for all types of embedded clauses, as e. g. embedded questions (almost) never allow V2 (Julien 2007, Vikner 2001, though see McCloskey 2006 and Biberauer 2015). As in Nyvad et al. (2016), I will explore a particular derivation of (embedded) V2, in terms of a cP/CP-distinction, which...... may be seen as a version of the CP-recursion analysis (deHaan & Weerman 1986, Vikner 1995 and many others). The idea is that because embedded V2 clauses do not allow extraction, whereas other types of CP-recursion clauses do (Christensen et al. 2013a; Christensen et al. 2013b; Christensen & Nyvad 2014...

  16. Real-time recursive motion segmentation of video data on a programmable device

    NARCIS (Netherlands)

    Wittebrood, R.B; Haan, de G.

    2001-01-01

    We previously reported on a recursive algorithm enabling real-time object-based motion estimation (OME) of standard definition video on a digital signal processor (DSP). The algorithm approximates the motion of the objects in the image with parametric motion models and creates a segmentation mask by

  17. Efficient O(N) recursive computation of the operational space inertial matrix

    International Nuclear Information System (INIS)

    Lilly, K.W.; Orin, D.E.

    1993-01-01

    The operational space inertia matrix Λ reflects the dynamic properties of a robot manipulator to its tip. In the control domain, it may be used to decouple force and/or motion control about the manipulator workspace axes. The matrix Λ also plays an important role in the development of efficient algorithms for the dynamic simulation of closed-chain robotic mechanisms, including simple closed-chain mechanisms such as multiple manipulator systems and walking machines. The traditional approach used to compute Λ has a computational complexity of O(N 3 ) for an N degree-of-freedom manipulator. This paper presents the development of a recursive algorithm for computing the operational space inertia matrix (OSIM) that reduces the computational complexity to O(N). This algorithm, the inertia propagation method, is based on a single recursion that begins at the base of the manipulator and progresses out to the last link. Also applicable to redundant systems and mechanisms with multiple-degree-of-freedom joints, the inertia propagation method is the most efficient method known for computing Λ for N ≥ 6. The numerical accuracy of the algorithm is discussed for a PUMA 560 robot with a fixed base

  18. Discovery of novel SERCA inhibitors by virtual screening of a large compound library.

    Science.gov (United States)

    Elam, Christopher; Lape, Michael; Deye, Joel; Zultowsky, Jodie; Stanton, David T; Paula, Stefan

    2011-05-01

    Two screening protocols based on recursive partitioning and computational ligand docking methodologies, respectively, were employed for virtual screens of a compound library with 345,000 entries for novel inhibitors of the enzyme sarco/endoplasmic reticulum calcium ATPase (SERCA), a potential target for cancer chemotherapy. A total of 72 compounds that were predicted to be potential inhibitors of SERCA were tested in bioassays and 17 displayed inhibitory potencies at concentrations below 100 μM. The majority of these inhibitors were composed of two phenyl rings tethered to each other by a short link of one to three atoms. Putative interactions between SERCA and the inhibitors were identified by inspection of docking-predicted poses and some of the structural features required for effective SERCA inhibition were determined by analysis of the classification pattern employed by the recursive partitioning models. Copyright © 2011 Elsevier Masson SAS. All rights reserved.

  19. A recursion relation for coefficients of fractional parentage in the seniority scheme

    International Nuclear Information System (INIS)

    Evans, T.

    1985-01-01

    A recursion relations for coefficients as fractional parentage in the seniority scheme are discussed. Determinated dependence of recursion relations from the particle number permit to evaluate matrix elements of creation and annihilation operators for fermions or bosons. 10 refs. (author)

  20. Lessons in Contingent, Recursive Humility

    Science.gov (United States)

    Vagle, Mark D.

    2011-01-01

    In this article, the author argues that critical work in teacher education should begin with teacher educators turning a critical eye on their own practices. The author uses Lesko's conception of contingent, recursive growth and change to analyze a lesson he observed as part of a phenomenological study aimed at understanding more about what it is…

  1. Interacting via the Heap in the Presence of Recursion

    Directory of Open Access Journals (Sweden)

    Jurriaan Rot

    2012-12-01

    Full Text Available Almost all modern imperative programming languages include operations for dynamically manipulating the heap, for example by allocating and deallocating objects, and by updating reference fields. In the presence of recursive procedures and local variables the interactions of a program with the heap can become rather complex, as an unbounded number of objects can be allocated either on the call stack using local variables, or, anonymously, on the heap using reference fields. As such a static analysis is, in general, undecidable. In this paper we study the verification of recursive programs with unbounded allocation of objects, in a simple imperative language for heap manipulation. We present an improved semantics for this language, using an abstraction that is precise. For any program with a bounded visible heap, meaning that the number of objects reachable from variables at any point of execution is bounded, this abstraction is a finitary representation of its behaviour, even though an unbounded number of objects can appear in the state. As a consequence, for such programs model checking is decidable. Finally we introduce a specification language for temporal properties of the heap, and discuss model checking these properties against heap-manipulating programs.

  2. On the asymptotic form of the recursion method basis vectors for periodic Hamiltonians

    International Nuclear Information System (INIS)

    O'Reilly, E.P.; Weaire, D.

    1984-01-01

    The authors present the first detailed study of the recursion method basis vectors for the case of a periodic Hamiltonian. In the examples chosen, the probability density scales linearly with n as n → infinity, whenever the local density of states is bounded. Whenever it is unbounded and the recursion coefficients diverge, different scaling behaviour is found. These findings are explained and a scaling relationship between the asymptotic forms of the recursion coefficients and basis vectors is proposed. (author)

  3. Nonlinear Disturbance Attenuation Controller for Turbo-Generators in Power Systems via Recursive Design

    NARCIS (Netherlands)

    Cao, M.; Shen, T.L.; Song, Y.H.; Mei, S.W.

    2002-01-01

    The paper proposes a nonlinear robust controller for steam governor control in power systems. Based on dissipation theory, an innovative recursive design method is presented to construct the storage function of single machine infinite bus (SMIB) and multi-machine power systems. Furthermore, the

  4. Partitioning of copy-number genotypes in pedigrees

    Directory of Open Access Journals (Sweden)

    Andelfinger Gregor U

    2010-05-01

    Full Text Available Abstract Background Copy number variations (CNVs and polymorphisms (CNPs have only recently gained the genetic community's attention. Conservative estimates have shown that CNVs and CNPs might affect more than 10% of the genome and that they may be at least as important as single nucleotide polymorphisms in assessing human variability. Widely used tools for CNP analysis have been implemented in Birdsuite and PLINK for the purpose of conducting genetic association studies based on the unpartitioned total number of CNP copies provided by the intensities from Affymetrix's Genome-Wide Human SNP Array. Here, we are interested in partitioning copy number variations and polymorphisms in extended pedigrees for the purpose of linkage analysis on familial data. Results We have developed CNGen, a new software for the partitioning of copy number polymorphism using the integrated genotypes from Birdsuite with the Affymetrix platform. The algorithm applied to familial trios or extended pedigrees can produce partitioned copy number genotypes with distinct parental alleles. We have validated the algorithm using simulations on a complex pedigree structure using frequencies calculated from a real dataset of 300 genotyped samples from 42 pedigrees segregating a congenital heart defect phenotype. Conclusions CNGen is the first published software for the partitioning of copy number genotypes in pedigrees, making possible the use CNPs and CNVs for linkage analysis. It was implemented with the Python interpreter version 2.5.2. It was successfully tested on current Linux, Windows and Mac OS workstations.

  5. A nested recursive logit model for route choice analysis

    DEFF Research Database (Denmark)

    Mai, Tien; Frejinger, Emma; Fosgerau, Mogens

    2015-01-01

    choices and the model does not require any sampling of choice sets. Furthermore, the model can be consistently estimated and efficiently used for prediction.A key challenge lies in the computation of the value functions, i.e. the expected maximum utility from any position in the network to a destination....... The value functions are the solution to a system of non-linear equations. We propose an iterative method with dynamic accuracy that allows to efficiently solve these systems.We report estimation results and a cross-validation study for a real network. The results show that the NRL model yields sensible......We propose a route choice model that relaxes the independence from irrelevant alternatives property of the logit model by allowing scale parameters to be link specific. Similar to the recursive logit (RL) model proposed by Fosgerau et al. (2013), the choice of path is modeled as a sequence of link...

  6. Structural analysis of the ParR/parC plasmid partition complex

    DEFF Research Database (Denmark)

    Møller-Jensen, Jakob; Ringgaard, Simon; Mercogliano, Christopher P

    2007-01-01

    Accurate DNA partition at cell division is vital to all living organisms. In bacteria, this process can involve partition loci, which are found on both chromosomes and plasmids. The initial step in Escherichia coli plasmid R1 partition involves the formation of a partition complex between the DNA...

  7. Research on the Automatic Fusion Strategy of Fixed Value Boundary Based on the Weak Coupling Condition of Grid Partition

    Science.gov (United States)

    Wang, X. Y.; Dou, J. M.; Shen, H.; Li, J.; Yang, G. S.; Fan, R. Q.; Shen, Q.

    2018-03-01

    With the continuous strengthening of power grids, the network structure is becoming more and more complicated. An open and regional data modeling is used to complete the calculation of the protection fixed value based on the local region. At the same time, a high precision, quasi real-time boundary fusion technique is needed to seamlessly integrate the various regions so as to constitute an integrated fault computing platform which can conduct transient stability analysis of covering the whole network with high accuracy and multiple modes, deal with the impact results of non-single fault, interlocking fault and build “the first line of defense” of the power grid. The boundary fusion algorithm in this paper is an automatic fusion algorithm based on the boundary accurate coupling of the networking power grid partition, which takes the actual operation mode for qualification, complete the boundary coupling algorithm of various weak coupling partition based on open-loop mode, improving the fusion efficiency, truly reflecting its transient stability level, and effectively solving the problems of too much data, too many difficulties of partition fusion, and no effective fusion due to mutually exclusive conditions. In this paper, the basic principle of fusion process is introduced firstly, and then the method of boundary fusion customization is introduced by scene description. Finally, an example is given to illustrate the specific algorithm on how it effectively implements the boundary fusion after grid partition and to verify the accuracy and efficiency of the algorithm.

  8. A new Bayesian recursive technique for parameter estimation

    Science.gov (United States)

    Kaheil, Yasir H.; Gill, M. Kashif; McKee, Mac; Bastidas, Luis

    2006-08-01

    The performance of any model depends on how well its associated parameters are estimated. In the current application, a localized Bayesian recursive estimation (LOBARE) approach is devised for parameter estimation. The LOBARE methodology is an extension of the Bayesian recursive estimation (BARE) method. It is applied in this paper on two different types of models: an artificial intelligence (AI) model in the form of a support vector machine (SVM) application for forecasting soil moisture and a conceptual rainfall-runoff (CRR) model represented by the Sacramento soil moisture accounting (SAC-SMA) model. Support vector machines, based on statistical learning theory (SLT), represent the modeling task as a quadratic optimization problem and have already been used in various applications in hydrology. They require estimation of three parameters. SAC-SMA is a very well known model that estimates runoff. It has a 13-dimensional parameter space. In the LOBARE approach presented here, Bayesian inference is used in an iterative fashion to estimate the parameter space that will most likely enclose a best parameter set. This is done by narrowing the sampling space through updating the "parent" bounds based on their fitness. These bounds are actually the parameter sets that were selected by BARE runs on subspaces of the initial parameter space. The new approach results in faster convergence toward the optimal parameter set using minimum training/calibration data and fewer sets of parameter values. The efficacy of the localized methodology is also compared with the previously used BARE algorithm.

  9. Recursive Subsystems in Aphasia and Alzheimer's Disease: Case Studies in Syntax and Theory of Mind

    Science.gov (United States)

    Bánréti, Zoltán; Hoffmann, Ildikó; Vincze, Veronika

    2016-01-01

    The relationship between recursive sentence embedding and theory-of-mind (ToM) inference is investigated in three persons with Broca's aphasia, two persons with Wernicke's aphasia, and six persons with mild and moderate Alzheimer's disease (AD). We asked questions of four types about photographs of various real-life situations. Type 4 questions asked participants about intentions, thoughts, or utterances of the characters in the pictures (“What may X be thinking/asking Y to do?”). The expected answers typically involved subordinate clauses introduced by conjunctions or direct quotations of the characters' utterances. Broca's aphasics did not produce answers with recursive sentence embedding. Rather, they projected themselves into the characters' mental states and gave direct answers in the first person singular, with relevant ToM content. We call such replies “situative statements.” Where the question concerned the mental state of the character but did not require an answer with sentence embedding (“What does X hate?”), aphasics gave descriptive answers rather than situative statements. Most replies given by persons with AD to Type 4 questions were grammatical instances of recursive sentence embedding. They also gave a few situative statements but the ToM content of these was irrelevant. In more than one third of their well-formed sentence embeddings, too, they conveyed irrelevant ToM contents. Persons with moderate AD were unable to pass secondary false belief tests. The results reveal double dissociation: Broca's aphasics are unable to access recursive sentence embedding but they can make appropriate ToM inferences; moderate AD persons make the wrong ToM inferences but they are able to access recursive sentence embedding. The double dissociation may be relevant for the nature of the relationship between the two recursive capacities. Broca's aphasics compensated for the lack of recursive sentence embedding by recursive ToM reasoning represented in very

  10. An Efficient Technique for Hardware/Software Partitioning Process in Codesign

    Directory of Open Access Journals (Sweden)

    Imene Mhadhbi

    2016-01-01

    Full Text Available Codesign methodology deals with the problem of designing complex embedded systems, where automatic hardware/software partitioning is one key issue. The research efforts in this issue are focused on exploring new automatic partitioning methods which consider only binary or extended partitioning problems. The main contribution of this paper is to propose a hybrid FCMPSO partitioning technique, based on Fuzzy C-Means (FCM and Particle Swarm Optimization (PSO algorithms suitable for mapping embedded applications for both binary and multicores target architecture. Our FCMPSO optimization technique has been compared using different graphical models with a large number of instances. Performance analysis reveals that FCMPSO outperforms PSO algorithm as well as the Genetic Algorithm (GA, Simulated Annealing (SA, Ant Colony Optimization (ACO, and FCM standard metaheuristic based techniques and also hybrid solutions including PSO then GA, GA then SA, GA then ACO, ACO then SA, FCM then GA, FCM then SA, and finally ACO followed by FCM.

  11. Compact QED tree-level amplitudes from dressed BCFW recursion relations

    International Nuclear Information System (INIS)

    Badger, Simon D.; Henn, Johannes M.

    2010-05-01

    We construct a modified on-shell BCFW recursion relation to derive compact analytic representations of tree-level amplitudes in QED. As an application, we study the amplitudes of a fermion pair coupling to an arbitrary number of photons and give compact formulae for the NMHV and N 2 MHV case. We demonstrate that the new recursion relation reduces the growth in complexity with additional photons to be exponential rather than factorial. (orig.)

  12. Compact QED tree-level amplitudes from dressed BCFW recursion relations

    Energy Technology Data Exchange (ETDEWEB)

    Badger, Simon D. [Deutsches Elektronen-Synchrotron (DESY), Zeuthen (Germany); Henn, Johannes M. [Humboldt Univ., Berlin (Germany). Inst. fuer Physik

    2010-05-15

    We construct a modified on-shell BCFW recursion relation to derive compact analytic representations of tree-level amplitudes in QED. As an application, we study the amplitudes of a fermion pair coupling to an arbitrary number of photons and give compact formulae for the NMHV and N{sup 2}MHV case. We demonstrate that the new recursion relation reduces the growth in complexity with additional photons to be exponential rather than factorial. (orig.)

  13. Quantum rings and recursion relations in 2D quantum gravity

    International Nuclear Information System (INIS)

    Kachru, S.

    1992-01-01

    This paper discusses tachyon condensate perturbations to the action of the two-dimensional string theory corresponding to the c + 1 matrix model. These are shown to deform the action of the ground ring on the tachyon modules, confirming a conjecture of Witten. The ground ring structure is used to derive recursion relations which relate (N + 1) and N tachyon bulk scattering amplitudes. These recursion relations allow one to compute all bulk amplitudes

  14. Phylogenetic systematics and biogeography of hummingbirds: Bayesian and maximum likelihood analyses of partitioned data and selection of an appropriate partitioning strategy.

    Science.gov (United States)

    McGuire, Jimmy A; Witt, Christopher C; Altshuler, Douglas L; Remsen, J V

    2007-10-01

    Hummingbirds are an important model system in avian biology, but to date the group has been the subject of remarkably few phylogenetic investigations. Here we present partitioned Bayesian and maximum likelihood phylogenetic analyses for 151 of approximately 330 species of hummingbirds and 12 outgroup taxa based on two protein-coding mitochondrial genes (ND2 and ND4), flanking tRNAs, and two nuclear introns (AK1 and BFib). We analyzed these data under several partitioning strategies ranging between unpartitioned and a maximum of nine partitions. In order to select a statistically justified partitioning strategy following partitioned Bayesian analysis, we considered four alternative criteria including Bayes factors, modified versions of the Akaike information criterion for small sample sizes (AIC(c)), Bayesian information criterion (BIC), and a decision-theoretic methodology (DT). Following partitioned maximum likelihood analyses, we selected a best-fitting strategy using hierarchical likelihood ratio tests (hLRTS), the conventional AICc, BIC, and DT, concluding that the most stringent criterion, the performance-based DT, was the most appropriate methodology for selecting amongst partitioning strategies. In the context of our well-resolved and well-supported phylogenetic estimate, we consider the historical biogeography of hummingbirds using ancestral state reconstructions of (1) primary geographic region of occurrence (i.e., South America, Central America, North America, Greater Antilles, Lesser Antilles), (2) Andean or non-Andean geographic distribution, and (3) minimum elevational occurrence. These analyses indicate that the basal hummingbird assemblages originated in the lowlands of South America, that most of the principle clades of hummingbirds (all but Mountain Gems and possibly Bees) originated on this continent, and that there have been many (at least 30) independent invasions of other primary landmasses, especially Central America.

  15. A Lego Mindstorms NXT based test bench for multiagent exploratory systems and distributed network partitioning

    Science.gov (United States)

    Patil, Riya Raghuvir

    Networks of communicating agents require distributed algorithms for a variety of tasks in the field of network analysis and control. For applications such as swarms of autonomous vehicles, ad hoc and wireless sensor networks, and such military and civilian applications as exploring and patrolling a robust autonomous system that uses a distributed algorithm for selfpartitioning can be significantly helpful. A single team of autonomous vehicles in a field may need to self-dissemble into multiple teams, conducive to completing multiple control tasks. Moreover, because communicating agents are subject to changes, namely, addition or failure of an agent or link, a distributed or decentralized algorithm is favorable over having a central agent. A framework to help with the study of self-partitioning of such multi agent systems that have most basic mobility model not only saves our time in conception but also gives us a cost effective prototype without negotiating the physical realization of the proposed idea. In this thesis I present my work on the implementation of a flexible and distributed stochastic partitioning algorithm on the LegoRTM Mindstorms' NXT on a graphical programming platform using National Instruments' LabVIEW(TM) forming a team of communicating agents via NXT-Bee radio module. We single out mobility, communication and self-partition as the core elements of the work. The goal is to randomly explore a precinct for reference sites. Agents who have discovered the reference sites announce their target acquisition to form a network formed based upon the distance of each agent with the other wherein the self-partitioning begins to find an optimal partition. Further, to illustrate the work, an experimental test-bench of five Lego NXT robots is presented.

  16. Analysis and Optimization of Mixed-Criticality Applications on Partitioned Distributed Architectures

    DEFF Research Database (Denmark)

    Tamas-Selicean, Domitian; Marinescu, S. O.; Pop, Paul

    2012-01-01

    Constrained (RC) messages, transmitted if there are no TT messages, and Best Effort (BE) messages. We assume that applications are scheduled using Static Cyclic Scheduling (SCS) or Fixed-Priority Preemptive Scheduling (FPS). We are interested in analysis and optimization methods and tools, which decide...... within predefined time slots, allocated on each processor. At the communication-level, TTEthernet uses the concepts of virtual links for the separation of mixed-criticality messages. TTEthernet integrates three types of traffic: Time-Triggered (TT) messages, transmitted based on schedule tables, Rate...... the mapping of tasks to PEs, the sequence and length of the time partitions on each PE and the schedule tables of the SCS tasks and TT messages, such that the applications are schedulable and the response times of FPS tasks and RC messages is minimized. We have proposed a Tabu Search-based meta...

  17. Application of the Recursive Finite Element Approach on 2D Periodic Structures under Harmonic Vibrations

    Directory of Open Access Journals (Sweden)

    Reem Yassine

    2016-12-01

    Full Text Available The frequency response function is a quantitative measure used in structural analysis and engineering design; hence, it is targeted for accuracy. For a large structure, a high number of substructures, also called cells, must be considered, which will lead to a high amount of computational time. In this paper, the recursive method, a finite element method, is used for computing the frequency response function, independent of the number of cells with much lesser time costs. The fundamental principle is eliminating the internal degrees of freedom that are at the interface between a cell and its succeeding one. The method is applied solely for free (no load nodes. Based on the boundary and interior degrees of freedom, the global dynamic stiffness matrix is computed by means of products and inverses resulting with a dimension the same as that for one cell. The recursive method is demonstrated on periodic structures (cranes and buildings under harmonic vibrations. The method yielded a satisfying time decrease with a maximum time ratio of 1 18 and a percentage difference of 19%, in comparison with the conventional finite element method. Close values were attained at low and very high frequencies; the analysis is supported for two types of materials (steel and plastic. The method maintained its efficiency with a high number of forces, excluding the case when all of the nodes are under loads.

  18. Certified higher-order recursive path ordering

    NARCIS (Netherlands)

    Koprowski, A.; Pfenning, F.

    2006-01-01

    The paper reports on a formalization of a proof of wellfoundedness of the higher-order recursive path ordering (HORPO) in the proof checker Coq. The development is axiom-free and fully constructive. Three substantive parts that could be used also in other developments are the formalizations of the

  19. Chiodo formulas for the r-th roots and topological recursion

    OpenAIRE

    Lewanski, Danilo; Popolitov, Alexandr; Shadrin, Sergey; Zvonkine, Dimitri

    2015-01-01

    We analyze Chiodo's formulas for the Chern classes related to the r-th roots of the suitably twisted integer powers of the canonical class on the moduli space of curves. The intersection numbers of these classes with psi-classes are reproduced via the Chekhov-Eynard-Orantin topological recursion. As an application, we prove that the Johnson-Pandharipande-Tseng formula for the orbifold Hurwitz numbers is equivalent to the topological recursion for the orbifold Hurwitz numbers. In particular, t...

  20. Recursive relations for processes with n photons of noncommutative QED

    International Nuclear Information System (INIS)

    Jafari, Abolfazl

    2007-01-01

    Recursion relations are derived in the sense of Berends-Giele for the multi-photon processes of noncommutative QED. The relations concern purely photonic processes as well as the processes with two fermions involved, both for arbitrary number of photons at tree level. It is shown that despite of the dependence of noncommutative vertices on momentum, in contrast to momentum-independent color factors of QCD, the recursion relation method can be employed for multi-photon processes of noncommutative QED

  1. PARALLEL PROCESSING OF BIG POINT CLOUDS USING Z-ORDER-BASED PARTITIONING

    Directory of Open Access Journals (Sweden)

    C. Alis

    2016-06-01

    Full Text Available As laser scanning technology improves and costs are coming down, the amount of point cloud data being generated can be prohibitively difficult and expensive to process on a single machine. This data explosion is not only limited to point cloud data. Voluminous amounts of high-dimensionality and quickly accumulating data, collectively known as Big Data, such as those generated by social media, Internet of Things devices and commercial transactions, are becoming more prevalent as well. New computing paradigms and frameworks are being developed to efficiently handle the processing of Big Data, many of which utilize a compute cluster composed of several commodity grade machines to process chunks of data in parallel. A central concept in many of these frameworks is data locality. By its nature, Big Data is large enough that the entire dataset would not fit on the memory and hard drives of a single node hence replicating the entire dataset to each worker node is impractical. The data must then be partitioned across worker nodes in a manner that minimises data transfer across the network. This is a challenge for point cloud data because there exist different ways to partition data and they may require data transfer. We propose a partitioning based on Z-order which is a form of locality-sensitive hashing. The Z-order or Morton code is computed by dividing each dimension to form a grid then interleaving the binary representation of each dimension. For example, the Z-order code for the grid square with coordinates (x = 1 = 012, y = 3 = 112 is 10112 = 11. The number of points in each partition is controlled by the number of bits per dimension: the more bits, the fewer the points. The number of bits per dimension also controls the level of detail with more bits yielding finer partitioning. We present this partitioning method by implementing it on Apache Spark and investigating how different parameters affect the accuracy and running time of the k nearest

  2. Coding Partitions

    Directory of Open Access Journals (Sweden)

    Fabio Burderi

    2007-05-01

    Full Text Available Motivated by the study of decipherability conditions for codes weaker than Unique Decipherability (UD, we introduce the notion of coding partition. Such a notion generalizes that of UD code and, for codes that are not UD, allows to recover the ``unique decipherability" at the level of the classes of the partition. By tacking into account the natural order between the partitions, we define the characteristic partition of a code X as the finest coding partition of X. This leads to introduce the canonical decomposition of a code in at most one unambiguouscomponent and other (if any totally ambiguouscomponents. In the case the code is finite, we give an algorithm for computing its canonical partition. This, in particular, allows to decide whether a given partition of a finite code X is a coding partition. This last problem is then approached in the case the code is a rational set. We prove its decidability under the hypothesis that the partition contains a finite number of classes and each class is a rational set. Moreover we conjecture that the canonical partition satisfies such a hypothesis. Finally we consider also some relationships between coding partitions and varieties of codes.

  3. The complex formation-partition and partition-association models of solvent extraction of ions

    International Nuclear Information System (INIS)

    Siekierski, S.

    1976-01-01

    Two models of the extraction process have been proposed. In the first model it is assumed that the partitioning neutral species is at first formed in the aqueous phase and then transferred into the organic phase. The second model is based on the assumption that equivalent amounts of cations are at first transferred from the aqueous into the organic phase and then associated to form a neutral molecule. The role of the solubility parameter in extraction and the relation between the solubility of liquid organic substances in water and the partition of complexes have been discussed. The extraction of simple complexes and complexes with organic ligands has been discussed using the first model. Partition coefficients have been calculated theoretically and compared with experimental values in some very simple cases. The extraction of ion pairs has been discussed using the partition-association model and the concept of single-ion partition coefficients. (author)

  4. Recursive analytical solution describing artificial satellite motion perturbed by an arbitrary number of zonal terms

    Science.gov (United States)

    Mueller, A. C.

    1977-01-01

    An analytical first order solution has been developed which describes the motion of an artificial satellite perturbed by an arbitrary number of zonal harmonics of the geopotential. A set of recursive relations for the solution, which was deduced from recursive relations of the geopotential, was derived. The method of solution is based on Von-Zeipel's technique applied to a canonical set of two-body elements in the extended phase space which incorporates the true anomaly as a canonical element. The elements are of Poincare type, that is, they are regular for vanishing eccentricities and inclinations. Numerical results show that this solution is accurate to within a few meters after 500 revolutions.

  5. Prediction of Protein Structural Class Based on Gapped-Dipeptides and a Recursive Feature Selection Approach

    Directory of Open Access Journals (Sweden)

    Taigang Liu

    2015-12-01

    Full Text Available The prior knowledge of protein structural class may offer useful clues on understanding its functionality as well as its tertiary structure. Though various significant efforts have been made to find a fast and effective computational approach to address this problem, it is still a challenging topic in the field of bioinformatics. The position-specific score matrix (PSSM profile has been shown to provide a useful source of information for improving the prediction performance of protein structural class. However, this information has not been adequately explored. To this end, in this study, we present a feature extraction technique which is based on gapped-dipeptides composition computed directly from PSSM. Then, a careful feature selection technique is performed based on support vector machine-recursive feature elimination (SVM-RFE. These optimal features are selected to construct a final predictor. The results of jackknife tests on four working datasets show that our method obtains satisfactory prediction accuracies by extracting features solely based on PSSM and could serve as a very promising tool to predict protein structural class.

  6. STATE ESTIMATION IN ALCOHOLIC CONTINUOUS FERMENTATION OF ZYMOMONAS MOBILIS USING RECURSIVE BAYESIAN FILTERING: A SIMULATION APPROACH

    Directory of Open Access Journals (Sweden)

    Olga Lucia Quintero

    2008-05-01

    Full Text Available This work presents a state estimator for a continuous bioprocess. To this aim, the Non Linear Filtering theory based on the recursive application of Bayes rule and Monte Carlo techniques is used. Recursive Bayesian Filters Sampling Importance Resampling (SIR is employed, including different kinds of resampling. Generally, bio-processes have strong non-linear and non-Gaussian characteristics, and this tool becomes attractive. The estimator behavior and performance are illustrated with the continuous process of alcoholic fermentation of Zymomonas mobilis. Not too many applications with this tool have been reported in the biotechnological area.

  7. A recursive reduction of tensor Feynman integrals

    International Nuclear Information System (INIS)

    Diakonidis, T.; Riemann, T.; Tausk, J.B.; Fleischer, J.

    2009-07-01

    We perform a recursive reduction of one-loop n-point rank R tensor Feynman integrals [in short: (n,R)-integrals] for n≤6 with R≤n by representing (n,R)-integrals in terms of (n,R-1)- and (n-1,R-1)-integrals. We use the known representation of tensor integrals in terms of scalar integrals in higher dimension, which are then reduced by recurrence relations to integrals in generic dimension. With a systematic application of metric tensor representations in terms of chords, and by decomposing and recombining these representations, we find the recursive reduction for the tensors. The procedure represents a compact, sequential algorithm for numerical evaluations of tensor Feynman integrals appearing in next-to-leading order contributions to massless and massive three- and four-particle production at LHC and ILC, as well as at meson factories. (orig.)

  8. The Paradigm Recursion: Is It More Accessible When Introduced in Middle School?

    Science.gov (United States)

    Gunion, Katherine; Milford, Todd; Stege, Ulrike

    2009-01-01

    Recursion is a programming paradigm as well as a problem solving strategy thought to be very challenging to grasp for university students. This article outlines a pilot study, which expands the age range of students exposed to the concept of recursion in computer science through instruction in a series of interesting and engaging activities. In…

  9. Decidability and Expressiveness of Recursive Weighted Logic

    DEFF Research Database (Denmark)

    Xue, Bingtian; Larsen, Kim Guldstrand; Mardare, Radu Iulian

    2014-01-01

    Labelled weighted transition systems (LWSs) are transition systems labelled with actions and real numbers. The numbers represent the costs of the corresponding actions in terms of resources. RecursiveWeighted Logic (RWL) is a multimodal logic that expresses qualitative and quantitative properties...

  10. Equilibrium partitioning of drug molecules between aqueous and amino acid ester-based ionic liquids

    International Nuclear Information System (INIS)

    Jing, Jun; Li, Zhiyong; Pei, Yuanchao; Wang, Huiyong; Wang, Jianji

    2013-01-01

    Highlights: ► Partition coefficients of twelve drug molecules in ILs have been determined. ► The possible mechanism has been investigated from 13 C NMR measurements. ► Hydrophobic π–π interaction is the main driving force for the partitioning of drug molecules. -- Abstract: In this work, a series of novel room temperature ionic liquids (ILs) have been synthesized with cheap, naturally α-amino acid ester as cations and bis(trifluoromethylsulfonyl)imide as anion. The glass transition temperature and thermal decomposition temperature of these ILs, partition coefficients of some coumarins and purine alkaloids between water and the amino acid ester-based ILs at T = 298.15 K, and Gibbs energy, enthalpy and entropy changes for the transfer of caffeine and 6,7-dihydroxycoumarin from water to [LeuC 2 ][Tf 2 N] have been determined. It is shown that these ILs are highly effective materials for the extraction of drug compounds like coumarin, 4-hydroxycoumarin, 7-hydroxycoumarin, 3-aminocoumarin, coumarin-3-carboxylic acid, 6,7-dihydroxycoumarin, 6,7-dihydroxy-4-methylcoumarin, caffeine, theobromine, theophylline, inosine, and 2,6-diaminopurine. The partition process is driven by enthalpy term, and partition coefficients of the drug molecules increase with the increase of hydrophobicity of both the drug molecules and the ILs. Furthermore, the possible partition mechanism has been investigated from 13 C NMR measurements

  11. Lossless medical image compression using geometry-adaptive partitioning and least square-based prediction.

    Science.gov (United States)

    Song, Xiaoying; Huang, Qijun; Chang, Sheng; He, Jin; Wang, Hao

    2018-06-01

    To improve the compression rates for lossless compression of medical images, an efficient algorithm, based on irregular segmentation and region-based prediction, is proposed in this paper. Considering that the first step of a region-based compression algorithm is segmentation, this paper proposes a hybrid method by combining geometry-adaptive partitioning and quadtree partitioning to achieve adaptive irregular segmentation for medical images. Then, least square (LS)-based predictors are adaptively designed for each region (regular subblock or irregular subregion). The proposed adaptive algorithm not only exploits spatial correlation between pixels but it utilizes local structure similarity, resulting in efficient compression performance. Experimental results show that the average compression performance of the proposed algorithm is 10.48, 4.86, 3.58, and 0.10% better than that of JPEG 2000, CALIC, EDP, and JPEG-LS, respectively. Graphical abstract ᅟ.

  12. Element partitioning in combustion- and gasification-based waste-to-energy units

    International Nuclear Information System (INIS)

    Arena, Umberto; Di Gregorio, Fabrizio

    2013-01-01

    Highlights: ► Element partitioning of waste-to-energy units by means of a substance flow analysis. ► A comparison between moving grate combustors and high temperature gasifiers. ► Classification of key elements according to their behavior during WtE processes. ► Slags and metals from waste gasifiers are completely and immediately recyclable. ► Potential reduction of amounts of solid residue to be sent to landfill disposal. - Abstract: A critical comparison between combustion- and gasification-based waste-to-energy systems needs a deep knowledge of the mass flows of materials and elements inside and throughout the units. The study collected and processed data from several moving grate conventional incinerators and high-temperature shaft gasifiers with direct melting, which are in operation worldwide. A material and substance flow analysis was then developed to systematically assess the flows and stocks of materials and elements within each waste-to-energy unit, by connecting the sources, pathways, and intermediate and final sinks of each species. The patterns of key elements, such as carbon, chloride and heavy metals, in the different solid and gaseous output streams of the two compared processes have been then defined. The combination of partitioning coefficients with the mass balances on atomic species and results of mineralogical characterization from recent literatures was used to estimate a composition of bottom ashes and slags from the two types of waste-to-energy technologies. The results also allow to quantify some of the performance parameters of the units and, in particular, the potential reduction of the amount of solid residues to be sent to final disposal

  13. Chain of matrices, loop equations and topological recursion

    CERN Document Server

    Orantin, Nicolas

    2009-01-01

    Random matrices are used in fields as different as the study of multi-orthogonal polynomials or the enumeration of discrete surfaces. Both of them are based on the study of a matrix integral. However, this term can be confusing since the definition of a matrix integral in these two applications is not the same. These two definitions, perturbative and non-perturbative, are discussed in this chapter as well as their relation. The so-called loop equations satisfied by integrals over random matrices coupled in chain is discussed as well as their recursive solution in the perturbative case when the matrices are Hermitean.

  14. Online Parameter Identification and State of Charge Estimation of Lithium-Ion Batteries Based on Forgetting Factor Recursive Least Squares and Nonlinear Kalman Filter

    Directory of Open Access Journals (Sweden)

    Bizhong Xia

    2017-12-01

    Full Text Available State of charge (SOC estimation is the core of any battery management system. Most closed-loop SOC estimation algorithms are based on the equivalent circuit model with fixed parameters. However, the parameters of the equivalent circuit model will change as temperature or SOC changes, resulting in reduced SOC estimation accuracy. In this paper, two SOC estimation algorithms with online parameter identification are proposed to solve this problem based on forgetting factor recursive least squares (FFRLS and nonlinear Kalman filter. The parameters of a Thevenin model are constantly updated by FFRLS. The nonlinear Kalman filter is used to perform the recursive operation to estimate SOC. Experiments in variable temperature environments verify the effectiveness of the proposed algorithms. A combination of four driving cycles is loaded on lithium-ion batteries to test the adaptability of the approaches to different working conditions. Under certain conditions, the average error of the SOC estimation dropped from 5.6% to 1.1% after adding the online parameters identification, showing that the estimation accuracy of proposed algorithms is greatly improved. Besides, simulated measurement noise is added to the test data to prove the robustness of the algorithms.

  15. On semantics and applications of guarded recursion

    DEFF Research Database (Denmark)

    Bizjak, Aleš

    2016-01-01

    denotational model and a logic for reasoning about program equivalence. In the last three chapters we study syntax and semantics of a dependent type theory with a family of later modalities indexed by the set of clocks, and clock quantifiers. In the fourth and fifth chapters we provide two model constructions......In this dissertation we study applications and semantics of guarded recursion, which is a method for ensuring that self-referential descriptions of objects define a unique object. The first two chapters are devoted to applications. We use guarded recursion, first in the form of explicit step......-indexing and then in the form of the internal language of particular sheaf topos, to construct logical relations for reasoning about contextual approximation of probabilistic and nondeterministic programs. These logical relations are sound and complete and useful for showing a range of example equivalences. In the third...

  16. Natural product-like virtual libraries: recursive atom-based enumeration.

    Science.gov (United States)

    Yu, Melvin J

    2011-03-28

    A new molecular enumerator is described that allows chemically and architecturally diverse sets of natural product-like and drug-like structures to be generated from a core structure as simple as a single carbon atom or as complex as a polycyclic ring system. Integrated with a rudimentary machine-learning algorithm, the enumerator has the ability to assemble biased virtual libraries enriched in compounds predicted to meet target criteria. The ability to dynamically generate relatively small focused libraries in a recursive manner could reduce the computational time and infrastructure necessary to construct and manage extremely large static libraries. Depending on enumeration conditions, natural product-like structures can be produced with a wide range of heterocyclic and alicyclic ring assemblies. Because natural products represent a proven source of validated structures for identifying and designing new drug candidates, mimicking the structural and topological diversity found in nature with a dynamic set of virtual natural product-like compounds may facilitate the creation of new ideas for novel, biologically relevant lead structures in areas of uncharted chemical space.

  17. Protein multi-scale organization through graph partitioning and robustness analysis: application to the myosin–myosin light chain interaction

    International Nuclear Information System (INIS)

    Delmotte, A; Barahona, M; Tate, E W; Yaliraki, S N

    2011-01-01

    Despite the recognized importance of the multi-scale spatio-temporal organization of proteins, most computational tools can only access a limited spectrum of time and spatial scales, thereby ignoring the effects on protein behavior of the intricate coupling between the different scales. Starting from a physico-chemical atomistic network of interactions that encodes the structure of the protein, we introduce a methodology based on multi-scale graph partitioning that can uncover partitions and levels of organization of proteins that span the whole range of scales, revealing biological features occurring at different levels of organization and tracking their effect across scales. Additionally, we introduce a measure of robustness to quantify the relevance of the partitions through the generation of biochemically-motivated surrogate random graph models. We apply the method to four distinct conformations of myosin tail interacting protein, a protein from the molecular motor of the malaria parasite, and study properties that have been experimentally addressed such as the closing mechanism, the presence of conserved clusters, and the identification through computational mutational analysis of key residues for binding

  18. New recursive-least-squares algorithms for nonlinear active control of sound and vibration using neural networks.

    Science.gov (United States)

    Bouchard, M

    2001-01-01

    In recent years, a few articles describing the use of neural networks for nonlinear active control of sound and vibration were published. Using a control structure with two multilayer feedforward neural networks (one as a nonlinear controller and one as a nonlinear plant model), steepest descent algorithms based on two distinct gradient approaches were introduced for the training of the controller network. The two gradient approaches were sometimes called the filtered-x approach and the adjoint approach. Some recursive-least-squares algorithms were also introduced, using the adjoint approach. In this paper, an heuristic procedure is introduced for the development of recursive-least-squares algorithms based on the filtered-x and the adjoint gradient approaches. This leads to the development of new recursive-least-squares algorithms for the training of the controller neural network in the two networks structure. These new algorithms produce a better convergence performance than previously published algorithms. Differences in the performance of algorithms using the filtered-x and the adjoint gradient approaches are discussed in the paper. The computational load of the algorithms discussed in the paper is evaluated for multichannel systems of nonlinear active control. Simulation results are presented to compare the convergence performance of the algorithms, showing the convergence gain provided by the new algorithms.

  19. A Novel AMR-WB Speech Steganography Based on Diameter-Neighbor Codebook Partition

    Directory of Open Access Journals (Sweden)

    Junhui He

    2018-01-01

    Full Text Available Steganography is a means of covert communication without revealing the occurrence and the real purpose of communication. The adaptive multirate wideband (AMR-WB is a widely adapted format in mobile handsets and is also the recommended speech codec for VoLTE. In this paper, a novel AMR-WB speech steganography is proposed based on diameter-neighbor codebook partition algorithm. Different embedding capacity may be achieved by adjusting the iterative parameters during codebook division. The experimental results prove that the presented AMR-WB steganography may provide higher and flexible embedding capacity without inducing perceptible distortion compared with the state-of-the-art methods. With 48 iterations of cluster merging, twice the embedding capacity of complementary-neighbor-vertices-based embedding method may be obtained with a decrease of only around 2% in speech quality and much the same undetectability. Moreover, both the quality of stego speech and the security regarding statistical steganalysis are better than the recent speech steganography based on neighbor-index-division codebook partition.

  20. Statistical prediction of immunity to placental malaria based on multi-assay antibody data for malarial antigens

    DEFF Research Database (Denmark)

    Siriwardhana, Chathura; Fang, Rui; Salanti, Ali

    2017-01-01

    Background Plasmodium falciparum infections are especially severe in pregnant women because infected erythrocytes (IE) express VAR2CSA, a ligand that binds to placental trophoblasts, causing IE to accumulate in the placenta. Resulting inflammation and pathology increases a woman’s risk of anemia...... to 28 malarial antigens and used the data to develop statistical models for predicting if a woman has sufficient immunity to prevent PM. Methods Archival plasma samples from 1377 women were screened in a bead-based multiplex assay for Ab to 17 VAR2CSA-associated antigens (full length VAR2CSA (FV2), DBL...... in the following seven statistical approaches: logistic regression full model, logistic regression reduced model, recursive partitioning, random forests, linear discriminant analysis, quadratic discriminant analysis, and support vector machine. Results The best and simplest model proved to be the logistic...

  1. Delineating Spatial Patterns in Human Settlements Using VIIRS Nighttime Light Data: A Watershed-Based Partition Approach

    Directory of Open Access Journals (Sweden)

    Ting Ma

    2018-03-01

    Full Text Available As an informative proxy measure for a range of urbanization and socioeconomic variables, satellite-derived nighttime light data have been widely used to investigate diverse anthropogenic activities in human settlements over time and space from the regional to the national scale. With a higher spatial resolution and fewer over-glow and saturation effects, nighttime light data derived from the Visible Infrared Imaging Radiometer Suite (VIIRS instrument with day/night band (DNB, which is on the Suomi National Polar-Orbiting Partnership satellite (Suomi-NPP, may further improve our understanding of spatiotemporal dynamics and socioeconomic activities, particularly at the local scale. Capturing and identifying spatial patterns in human settlements from VIIRS images, however, is still challenging due to the lack of spatially explicit texture characteristics, which are usually crucial for general image classification methods. In this study, we propose a watershed-based partition approach by combining a second order exponential decay model for the spatial delineation of human settlements with VIIRS-derived nighttime light images. Our method spatially partitions the human settlement into five different types of sub-regions: high, medium-high, medium, medium-low and low lighting areas with different degrees of human activity. This is primarily based on the local coverage of locally maximum radiance signals (watershed-based and the rank and magnitude of the nocturnal radiance signal across the whole region, as well as remotely sensed building density data and social media-derived human activity information. The comparison results for the relationship between sub-regions with various density nighttime brightness levels and human activities, as well as the densities of different types of interest points (POIs, show that our method can distinctly identify various degrees of human activity based on artificial nighttime radiance and ancillary data. Furthermore

  2. Binary-space-partitioned images for resolving image-based visibility.

    Science.gov (United States)

    Fu, Chi-Wing; Wong, Tien-Tsin; Tong, Wai-Shun; Tang, Chi-Keung; Hanson, Andrew J

    2004-01-01

    We propose a novel 2D representation for 3D visibility sorting, the Binary-Space-Partitioned Image (BSPI), to accelerate real-time image-based rendering. BSPI is an efficient 2D realization of a 3D BSP tree, which is commonly used in computer graphics for time-critical visibility sorting. Since the overall structure of a BSP tree is encoded in a BSPI, traversing a BSPI is comparable to traversing the corresponding BSP tree. BSPI performs visibility sorting efficiently and accurately in the 2D image space by warping the reference image triangle-by-triangle instead of pixel-by-pixel. Multiple BSPIs can be combined to solve "disocclusion," when an occluded portion of the scene becomes visible at a novel viewpoint. Our method is highly automatic, including a tensor voting preprocessing step that generates candidate image partition lines for BSPIs, filters the noisy input data by rejecting outliers, and interpolates missing information. Our system has been applied to a variety of real data, including stereo, motion, and range images.

  3. Paths and partitions: Combinatorial descriptions of the parafermionic states

    Science.gov (United States)

    Mathieu, Pierre

    2009-09-01

    The Zk parafermionic conformal field theories, despite the relative complexity of their modes algebra, offer the simplest context for the study of the bases of states and their different combinatorial representations. Three bases are known. The classic one is given by strings of the fundamental parafermionic operators whose sequences of modes are in correspondence with restricted partitions with parts at distance k -1 differing at least by 2. Another basis is expressed in terms of the ordered modes of the k -1 different parafermionic fields, which are in correspondence with the so-called multiple partitions. Both types of partitions have a natural (Bressoud) path representation. Finally, a third basis, formulated in terms of different paths, is inherited from the solution of the restricted solid-on-solid model of Andrews-Baxter-Forrester. The aim of this work is to review, in a unified and pedagogical exposition, these four different combinatorial representations of the states of the Zk parafermionic models. The first part of this article presents the different paths and partitions and their bijective relations; it is purely combinatorial, self-contained, and elementary; it can be read independently of the conformal-field-theory applications. The second part links this combinatorial analysis with the bases of states of the Zk parafermionic theories. With the prototypical example of the parafermionic models worked out in detail, this analysis contributes to fix some foundations for the combinatorial study of more complicated theories. Indeed, as we briefly indicate in ending, generalized versions of both the Bressoud and the Andrews-Baxter-Forrester paths emerge naturally in the description of the minimal models.

  4. A model partitioning method based on dynamic decoupling for the efficient simulation of multibody systems

    Energy Technology Data Exchange (ETDEWEB)

    Papadopoulos, Alessandro Vittorio, E-mail: alessandro.papadopoulos@control.lth.se [Lund University, Department of Automatic Control (Sweden); Leva, Alberto, E-mail: alberto.leva@polimi.it [Politecnico di Milano, Dipartimento di Elettronica, Informazione e Bioingegneria (Italy)

    2015-06-15

    The presence of different time scales in a dynamic model significantly hampers the efficiency of its simulation. In multibody systems the fact is particularly relevant, as the mentioned time scales may be very different, due, for example, to the coexistence of mechanical components controled by electronic drive units, and may also appear in conjunction with significant nonlinearities. This paper proposes a systematic technique, based on the principles of dynamic decoupling, to partition a model based on the time scales that are relevant for the particular simulation studies to be performed and as transparently as possible for the user. In accordance with said purpose, peculiar to the technique is its neat separation into two parts: a structural analysis of the model, which is general with respect to any possible simulation scenario, and a subsequent decoupled integration, which can conversely be (easily) tailored to the study at hand. Also, since the technique does not aim at reducing but rather at partitioning the model, the state space and the physical interpretation of the dynamic variables are inherently preserved. Moreover, the proposed analysis allows us to define some novel indices relative to the separability of the system, thereby extending the idea of “stiffness” in a way that is particularly keen to its use for the improvement of simulation efficiency, be the envisaged integration scheme monolithic, parallel, or even based on cosimulation. Finally, thanks to the way the analysis phase is conceived, the technique is naturally applicable to both linear and nonlinear models. The paper contains a methodological presentation of the proposed technique, which is related to alternatives available in the literature so as to evidence the peculiarities just sketched, and some application examples illustrating the achieved advantages and motivating the major design choice from an operational viewpoint.

  5. Construction of Scaling Partitions of Unity

    Directory of Open Access Journals (Sweden)

    Ole Christensen

    2017-11-01

    Full Text Available Partitions of unity in ℝd formed by (matrix scales of a fixed function appear in many parts of harmonic analysis, e.g., wavelet analysis and the analysis of Triebel-Lizorkin spaces. We give a simple characterization of the functions and matrices yielding such a partition of unity. For expanding matrices, the characterization leads to easy ways of constructing appropriate functions with attractive properties like high regularity and small support. We also discuss a class of integral transforms that map functions having the partition of unity property to functions with the same property. The one-dimensional version of the transform allows a direct definition of a class of nonuniform splines with properties that are parallel to those of the classical B-splines. The results are illustrated with the construction of dual pairs of wavelet frames.

  6. Theory of Mind Development in Adolescence and Early Adulthood: The Growing Complexity of Recursive Thinking Ability

    Science.gov (United States)

    Valle, Annalisa; Massaro, Davide; Castelli, Ilaria; Marchetti, Antonella

    2015-01-01

    This study explores the development of theory of mind, operationalized as recursive thinking ability, from adolescence to early adulthood (N = 110; young adolescents = 47; adolescents = 43; young adults = 20). The construct of theory of mind has been operationalized in two different ways: as the ability to recognize the correct mental state of a character, and as the ability to attribute the correct mental state in order to predict the character’s behaviour. The Imposing Memory Task, with five recursive thinking levels, and a third-order false-belief task with three recursive thinking levels (devised for this study) have been used. The relationship among working memory, executive functions, and linguistic skills are also analysed. Results show that subjects exhibit less understanding of elevated recursive thinking levels (third, fourth, and fifth) compared to the first and second levels. Working memory is correlated with total recursive thinking, whereas performance on the linguistic comprehension task is related to third level recursive thinking in both theory of mind tasks. An effect of age on third-order false-belief task performance was also found. A key finding of the present study is that the third-order false-belief task shows significant age differences in the application of recursive thinking that involves the prediction of others’ behaviour. In contrast, such an age effect is not observed in the Imposing Memory Task. These results may support the extension of the investigation of the third order false belief after childhood. PMID:27247645

  7. A foundation for real recursive function theory

    NARCIS (Netherlands)

    J.F. Costa; B. S. Loff Barreto (Bruno Serra); J. Mycka

    2009-01-01

    htmlabstractThe class of recursive functions over the reals, denoted by REC(R), was introduced by Cristopher Moore in his seminal paper written in 1995. Since then many subsequent investigations brought new results: the class REC(R) was put in relation with the class of functions generated by the

  8. Multiple Memory Structure Bit Reversal Algorithm Based on Recursive Patterns of Bit Reversal Permutation

    Directory of Open Access Journals (Sweden)

    K. K. L. B. Adikaram

    2014-01-01

    Full Text Available With the increasing demand for online/inline data processing efficient Fourier analysis becomes more and more relevant. Due to the fact that the bit reversal process requires considerable processing time of the Fast Fourier Transform (FFT algorithm, it is vital to optimize the bit reversal algorithm (BRA. This paper is to introduce an efficient BRA with multiple memory structures. In 2009, Elster showed the relation between the first and the second halves of the bit reversal permutation (BRP and stated that it may cause serious impact on cache performance of the computer, if implemented. We found exceptions, especially when the said index mapping was implemented with multiple one-dimensional memory structures instead of multidimensional or one-dimensional memory structure. Also we found a new index mapping, even after the recursive splitting of BRP into equal sized slots. The four-array and the four-vector versions of BRA with new index mapping reported 34% and 16% improvement in performance in relation to similar versions of Linear BRA of Elster which uses single one-dimensional memory structure.

  9. Classification algorithms using adaptive partitioning

    KAUST Repository

    Binev, Peter; Cohen, Albert; Dahmen, Wolfgang; DeVore, Ronald

    2014-01-01

    © 2014 Institute of Mathematical Statistics. Algorithms for binary classification based on adaptive tree partitioning are formulated and analyzed for both their risk performance and their friendliness to numerical implementation. The algorithms can be viewed as generating a set approximation to the Bayes set and thus fall into the general category of set estimators. In contrast with the most studied tree-based algorithms, which utilize piecewise constant approximation on the generated partition [IEEE Trans. Inform. Theory 52 (2006) 1335.1353; Mach. Learn. 66 (2007) 209.242], we consider decorated trees, which allow us to derive higher order methods. Convergence rates for these methods are derived in terms the parameter - of margin conditions and a rate s of best approximation of the Bayes set by decorated adaptive partitions. They can also be expressed in terms of the Besov smoothness β of the regression function that governs its approximability by piecewise polynomials on adaptive partition. The execution of the algorithms does not require knowledge of the smoothness or margin conditions. Besov smoothness conditions are weaker than the commonly used Holder conditions, which govern approximation by nonadaptive partitions, and therefore for a given regression function can result in a higher rate of convergence. This in turn mitigates the compatibility conflict between smoothness and margin parameters.

  10. Classification algorithms using adaptive partitioning

    KAUST Repository

    Binev, Peter

    2014-12-01

    © 2014 Institute of Mathematical Statistics. Algorithms for binary classification based on adaptive tree partitioning are formulated and analyzed for both their risk performance and their friendliness to numerical implementation. The algorithms can be viewed as generating a set approximation to the Bayes set and thus fall into the general category of set estimators. In contrast with the most studied tree-based algorithms, which utilize piecewise constant approximation on the generated partition [IEEE Trans. Inform. Theory 52 (2006) 1335.1353; Mach. Learn. 66 (2007) 209.242], we consider decorated trees, which allow us to derive higher order methods. Convergence rates for these methods are derived in terms the parameter - of margin conditions and a rate s of best approximation of the Bayes set by decorated adaptive partitions. They can also be expressed in terms of the Besov smoothness β of the regression function that governs its approximability by piecewise polynomials on adaptive partition. The execution of the algorithms does not require knowledge of the smoothness or margin conditions. Besov smoothness conditions are weaker than the commonly used Holder conditions, which govern approximation by nonadaptive partitions, and therefore for a given regression function can result in a higher rate of convergence. This in turn mitigates the compatibility conflict between smoothness and margin parameters.

  11. Local Stability Conditions for Two Types of Monetary Models with Recursive Utility

    OpenAIRE

    Miyazaki, Kenji; Utsunomiya, Hitoshi

    2009-01-01

    This paper explores local stability conditions for money-in-utility-function (MIUF) and transaction-costs (TC) models with recursive utility.A monetary variant of the Brock-Gale condition provides a theoretical justification of the comparative statics analysis. One of sufficient conditions for local stability is increasing marginal impatience (IMI) in consumption and money. However, this does not deny the possibility of decreasing marginal impatience (DMI). The local stability with DMI is mor...

  12. Molecular Descriptors Family on Structure Activity Relationships 6. Octanol-Water Partition Coefficient of Polychlorinated Biphenyls

    Directory of Open Access Journals (Sweden)

    Lorentz JÄNTSCHI

    2006-01-01

    Full Text Available Octanol-water partition coefficient of two hundred and six polychlorinated biphenyls was model by the use of an original method based on complex information obtained from compounds structure. The regression analysis shows that best results are obtained in four-varied model (r2 = 0.9168. The prediction ability of the model was studied through leave-one-out analysis (r2cv(loo = 0.9093 and in training and test sets analysis. Modeling the octanol-water partition coefficient of polychlorinated biphenyls by integration of complex structural information provide a stable and performing four-varied model, allowing us to make remarks about relationship between structure of polychlorinated biphenyls and associated octanol-water partition coefficients.

  13. Numerical solution of recirculating flow by a simple finite element recursion relation

    Energy Technology Data Exchange (ETDEWEB)

    Pepper, D W; Cooper, R E

    1980-01-01

    A time-split finite element recursion relation, based on linear basis functions, is used to solve the two-dimensional equations of motion. Recirculating flow in a rectangular cavity and free convective flow in an enclosed container are analyzed. The relation has the advantage of finite element accuracy and finite difference speed and simplicity. Incorporating dissipation parameters in the functionals decreases numerical dispersion and improves phase lag.

  14. Reliability evaluation of non-reparable three-state systems using Markov model and its comparison with the UGF and the recursive methods

    International Nuclear Information System (INIS)

    Pourkarim Guilani, Pedram; Sharifi, Mani; Niaki, S.T.A.; Zaretalab, Arash

    2014-01-01

    In multi-state systems (MSS) reliability problems, it is assumed that the components of each subsystem have different performance rates with certain probabilities. This leads into extensive computational efforts involved in using the commonly employed universal generation function (UGF) and the recursive algorithm to obtain reliability of systems consisting of a large number of components. This research deals with evaluating non-repairable three-state systems reliability and proposes a novel method based on a Markov process for which an appropriate state definition is provided. It is shown that solving the derived differential equations significantly reduces the computational time compared to the UGF and the recursive algorithm. - Highlights: • Reliability evaluation of a non-repairable three-state systems is aimed. • A novel method based on a Markov process is proposed. • An appropriate state definition is provided. • Computational time is significantly less compared to the ones in the UGF and the recursive methods

  15. Locating one pairwise interaction: Three recursive constructions

    Directory of Open Access Journals (Sweden)

    Charles J. Colbourn

    2016-09-01

    Full Text Available In a complex component-based system, choices (levels for components (factors may interact tocause faults in the system behaviour. When faults may be caused by interactions among few factorsat specific levels, covering arrays provide a combinatorial test suite for discovering the presence offaults. While well studied, covering arrays do not enable one to determine the specific levels of factorscausing the faults; locating arrays ensure that the results from test suite execution suffice to determinethe precise levels and factors causing faults, when the number of such causes is small. Constructionsfor locating arrays are at present limited to heuristic computational methods and quite specific directconstructions. In this paper three recursive constructions are developed for locating arrays to locateone pairwise interaction causing a fault.

  16. Convolution of second order linear recursive sequences II.

    Directory of Open Access Journals (Sweden)

    Szakács Tamás

    2017-12-01

    Full Text Available We continue the investigation of convolutions of second order linear recursive sequences (see the first part in [1]. In this paper, we focus on the case when the characteristic polynomials of the sequences have common root.

  17. Shlaer-Mellor object-oriented analysis and recursive design, an effective modern software development method for development of computing systems for a large physics detector

    International Nuclear Information System (INIS)

    Kozlowski, T.; Carey, T.A.; Maguire, C.F.

    1995-01-01

    After evaluation of several modern object-oriented methods for development of the computing systems for the PHENIX detector at RHIC, we selected the Shlaer-Mellor Object-Oriented Analysis and Recursive Design method as the most appropriate for the needs and development environment of a large nuclear or high energy physics detector. This paper discusses our specific needs and environment, our method selection criteria, and major features and components of the Shlaer-Mellor method

  18. Exploiting fine-grain parallelism in recursive LU factorization

    KAUST Repository

    Dongarra, Jack; Faverge, Mathieu; Ltaief, Hatem; Luszczek, Piotr R.

    2012-01-01

    is the panel factorization due to its memory-bound characteristic and the atomicity of selecting the appropriate pivots. We remedy this in our new approach to LU factorization of (narrow and tall) panel submatrices. We use a parallel fine-grained recursive

  19. A hybrid bit-encoding for SAT planning based on clique-partitioning

    Science.gov (United States)

    Tapia, Cristóbal; San Segundo, Pablo; Galán, Ramón

    2017-09-01

    Planning as satisfiability is one of the most efficient ways to solve classic automated planning problems. In SAT planning, the encoding used to convert the problem to a SAT formula is critical for the performance of the SAT solver. This paper presents a novel bit-encoding that reduces the number of bits required to represent actions in a SAT-based automated planning problem. To obtain such encoding we first build a conflict graph, which represents incompatibilities of pairs of actions, and bitwise encode the subsets of actions determined by a clique partition. This reduces the number of Boolean variables and clauses of the SAT encoding, while preserving the possibility of parallel execution of compatible (non-neighbor) actions. The article also describes an appropriate algorithm for selecting the clique partition for this application and compares the new encodings obtained over some standard planning problems.

  20. Recursive utility in a Markov environment with stochastic growth.

    Science.gov (United States)

    Hansen, Lars Peter; Scheinkman, José A

    2012-07-24

    Recursive utility models that feature investor concerns about the intertemporal composition of risk are used extensively in applied research in macroeconomics and asset pricing. These models represent preferences as the solution to a nonlinear forward-looking difference equation with a terminal condition. In this paper we study infinite-horizon specifications of this difference equation in the context of a Markov environment. We establish a connection between the solution to this equation and to an arguably simpler Perron-Frobenius eigenvalue equation of the type that occurs in the study of large deviations for Markov processes. By exploiting this connection, we establish existence and uniqueness results. Moreover, we explore a substantive link between large deviation bounds for tail events for stochastic consumption growth and preferences induced by recursive utility.

  1. One loop integration with hypergeometric series by using recursion relations

    International Nuclear Information System (INIS)

    Watanabe, Norihisa; Kaneko, Toshiaki

    2014-01-01

    General one-loop integrals with arbitrary mass and kinematical parameters in d-dimensional space-time are studied. By using Bernstein theorem, a recursion relation is obtained which connects (n + 1)-point to n-point functions. In solving this recursion relation, we have shown that one-loop integrals are expressed by a newly defined hypergeometric function, which is a special case of Aomoto-Gelfand hypergeometric functions. We have also obtained coefficients of power series expansion around 4-dimensional space-time for two-, three- and four-point functions. The numerical results are compared with ''LoopTools'' for the case of two- and three-point functions as examples

  2. Recursive inverse kinematics for robot arms via Kalman filtering and Bryson-Frazier smoothing

    Science.gov (United States)

    Rodriguez, G.; Scheid, R. E., Jr.

    1987-01-01

    This paper applies linear filtering and smoothing theory to solve recursively the inverse kinematics problem for serial multilink manipulators. This problem is to find a set of joint angles that achieve a prescribed tip position and/or orientation. A widely applicable numerical search solution is presented. The approach finds the minimum of a generalized distance between the desired and the actual manipulator tip position and/or orientation. Both a first-order steepest-descent gradient search and a second-order Newton-Raphson search are developed. The optimal relaxation factor required for the steepest descent method is computed recursively using an outward/inward procedure similar to those used typically for recursive inverse dynamics calculations. The second-order search requires evaluation of a gradient and an approximate Hessian. A Gauss-Markov approach is used to approximate the Hessian matrix in terms of products of first-order derivatives. This matrix is inverted recursively using a two-stage process of inward Kalman filtering followed by outward smoothing. This two-stage process is analogous to that recently developed by the author to solve by means of spatial filtering and smoothing the forward dynamics problem for serial manipulators.

  3. Predicate Transformers for Recursive Procedures with Local Variables

    NARCIS (Netherlands)

    Hesselink, Wim H.

    1999-01-01

    The weakest precondition semantics of recursive procedures with local variables are developed for an imperative language with demonic and angelic operators for unbounded nondeterminate choice. This does not require stacking of local variables. The formalism serves as a foundation for a proof rule

  4. Central Decoding for Multiple Description Codes based on Domain Partitioning

    Directory of Open Access Journals (Sweden)

    M. Spiertz

    2006-01-01

    Full Text Available Multiple Description Codes (MDC can be used to trade redundancy against packet loss resistance for transmitting data over lossy diversity networks. In this work we focus on MD transform coding based on domain partitioning. Compared to Vaishampayan’s quantizer based MDC, domain based MD coding is a simple approach for generating different descriptions, by using different quantizers for each description. Commonly, only the highest rate quantizer is used for reconstruction. In this paper we investigate the benefit of using the lower rate quantizers to enhance the reconstruction quality at decoder side. The comparison is done on artificial source data and on image data. 

  5. A Recursive Formula for the Evaluation of Earth Return Impedance on Buried Cables

    Directory of Open Access Journals (Sweden)

    Reynaldo Iracheta

    2015-09-01

    Full Text Available This paper presents an alternative solution based on infinite series for the accurate and efficient evaluation of cable earth return impedances. This method uses Wedepohl and Wilcox’s transformation to decompose Pollaczek’s integral in a set of Bessel functions and a definite integral. The main feature of Bessel functions is that they are easy to compute in modern mathematical software tools such as Matlab. The main contributions of this paper are the approximation of the definite integral by an infinite series, since it does not have analytical solution; and its numerical solution by means of a recursive formula. The accuracy and efficiency of this recursive formula is compared against the numerical integration method for a broad range of frequencies and cable  configurations. Finally, the proposed method is used as a subroutine for cable parameter calculation in the inverse Numerical Laplace Transform (NLT to obtain accurate transient responses in the time domain.

  6. Unique Path Partitions

    DEFF Research Database (Denmark)

    Bessenrodt, Christine; Olsson, Jørn Børling; Sellers, James A.

    2013-01-01

    We give a complete classification of the unique path partitions and study congruence properties of the function which enumerates such partitions.......We give a complete classification of the unique path partitions and study congruence properties of the function which enumerates such partitions....

  7. Purification of biomaterials by phase partitioning

    Science.gov (United States)

    Harris, J. M.

    1984-01-01

    A technique which is particularly suited to microgravity environments and which is potentially more powerful than electrophoresis is phase partitioning. Phase partitioning is purification by partitioning between the two immiscible aqueous layers formed by solution of the polymers poly(ethylene glycol) and dextran in water. This technique proved to be very useful for separations in one-g but is limited for cells because the cells are more dense than the phase solutions thus tend to sediment to the bottom of the container before reaching equilibrium with the preferred phase. There are three phases to work in this area: synthesis of new polymers for affinity phase partitioning; development of automated apparatus for ground-based separations; and design of apparatus for performing simple phase partitioning space experiments, including examination of mechanisms for separating phases in the absence of gravity.

  8. Aspects of system modelling in Hardware/Software partitioning

    DEFF Research Database (Denmark)

    Knudsen, Peter Voigt; Madsen, Jan

    1996-01-01

    This paper addresses fundamental aspects of system modelling and partitioning algorithms in the area of Hardware/Software Codesign. Three basic system models for partitioning are presented and the consequences of partitioning according to each of these are analyzed. The analysis shows...... the importance of making a clear distinction between the model used for partitioning and the model used for evaluation It also illustrates the importance of having a realistic hardware model such that hardware sharing can be taken into account. Finally, the importance of integrating scheduling and allocation...

  9. Data partitions, Bayesian analysis and phylogeny of the zygomycetous fungal family Mortierellaceae, inferred from nuclear ribosomal DNA sequences.

    Directory of Open Access Journals (Sweden)

    Tamás Petkovits

    Full Text Available Although the fungal order Mortierellales constitutes one of the largest classical groups of Zygomycota, its phylogeny is poorly understood and no modern taxonomic revision is currently available. In the present study, 90 type and reference strains were used to infer a comprehensive phylogeny of Mortierellales from the sequence data of the complete ITS region and the LSU and SSU genes with a special attention to the monophyly of the genus Mortierella. Out of 15 alternative partitioning strategies compared on the basis of Bayes factors, the one with the highest number of partitions was found optimal (with mixture models yielding the best likelihood and tree length values, implying a higher complexity of evolutionary patterns in the ribosomal genes than generally recognized. Modeling the ITS1, 5.8S, and ITS2, loci separately improved model fit significantly as compared to treating all as one and the same partition. Further, within-partition mixture models suggests that not only the SSU, LSU and ITS regions evolve under qualitatively and/or quantitatively different constraints, but that significant heterogeneity can be found within these loci also. The phylogenetic analysis indicated that the genus Mortierella is paraphyletic with respect to the genera Dissophora, Gamsiella and Lobosporangium and the resulting phylogeny contradict previous, morphology-based sectional classification of Mortierella. Based on tree structure and phenotypic traits, we recognize 12 major clades, for which we attempt to summarize phenotypic similarities. M. longicollis is closely related to the outgroup taxon Rhizopus oryzae, suggesting that it belongs to the Mucorales. Our results demonstrate that traits used in previous classifications of the Mortierellales are highly homoplastic and that the Mortierellales is in a need of a reclassification, where new, phylogenetically informative phenotypic traits should be identified, with molecular phylogenies playing a decisive role.

  10. Recursive approach for non-Markovian time-convolutionless master equations

    Science.gov (United States)

    Gasbarri, G.; Ferialdi, L.

    2018-02-01

    We consider a general open system dynamics and we provide a recursive method to derive the associated non-Markovian master equation in a perturbative series. The approach relies on a momenta expansion of the open system evolution. Unlike previous perturbative approaches of this kind, the method presented in this paper provides a recursive definition of each perturbative term. Furthermore, we give an intuitive diagrammatic description of each term of the series, which provides a useful analytical tool to build them and to derive their structure in terms of commutators and anticommutators. We eventually apply our formalism to the evolution of the observables of the reduced system, by showing how the method can be applied to the adjoint master equation, and by developing a diagrammatic description of the associated series.

  11. Recursive Bayesian recurrent neural networks for time-series modeling.

    Science.gov (United States)

    Mirikitani, Derrick T; Nikolaev, Nikolay

    2010-02-01

    This paper develops a probabilistic approach to recursive second-order training of recurrent neural networks (RNNs) for improved time-series modeling. A general recursive Bayesian Levenberg-Marquardt algorithm is derived to sequentially update the weights and the covariance (Hessian) matrix. The main strengths of the approach are a principled handling of the regularization hyperparameters that leads to better generalization, and stable numerical performance. The framework involves the adaptation of a noise hyperparameter and local weight prior hyperparameters, which represent the noise in the data and the uncertainties in the model parameters. Experimental investigations using artificial and real-world data sets show that RNNs equipped with the proposed approach outperform standard real-time recurrent learning and extended Kalman training algorithms for recurrent networks, as well as other contemporary nonlinear neural models, on time-series modeling.

  12. Accelerating SPARQL queries by exploiting hash-based locality and adaptive partitioning

    KAUST Repository

    Al-Harbi, Razen; Abdelaziz, Ibrahim; Kalnis, Panos; Mamoulis, Nikos; Ebrahim, Yasser; Sahli, Majed

    2016-01-01

    State-of-the-art distributed RDF systems partition data across multiple computer nodes (workers). Some systems perform cheap hash partitioning, which may result in expensive query evaluation. Others try to minimize inter-node communication, which

  13. An efficient recursive least square-based condition monitoring approach for a rail vehicle suspension system

    Science.gov (United States)

    Liu, X. Y.; Alfi, S.; Bruni, S.

    2016-06-01

    A model-based condition monitoring strategy for the railway vehicle suspension is proposed in this paper. This approach is based on recursive least square (RLS) algorithm focusing on the deterministic 'input-output' model. RLS has Kalman filtering feature and is able to identify the unknown parameters from a noisy dynamic system by memorising the correlation properties of variables. The identification of suspension parameter is achieved by machine learning of the relationship between excitation and response in a vehicle dynamic system. A fault detection method for the vertical primary suspension is illustrated as an instance of this condition monitoring scheme. Simulation results from the rail vehicle dynamics software 'ADTreS' are utilised as 'virtual measurements' considering a trailer car of Italian ETR500 high-speed train. The field test data from an E464 locomotive are also employed to validate the feasibility of this strategy for the real application. Results of the parameter identification performed indicate that estimated suspension parameters are consistent or approximate with the reference values. These results provide the supporting evidence that this fault diagnosis technique is capable of paving the way for the future vehicle condition monitoring system.

  14. LRSim: A Linked-Reads Simulator Generating Insights for Better Genome Partitioning

    Directory of Open Access Journals (Sweden)

    Ruibang Luo

    Full Text Available Linked-read sequencing, using highly-multiplexed genome partitioning and barcoding, can span hundreds of kilobases to improve de novo assembly, haplotype phasing, and other applications. Based on our analysis of 14 datasets, we introduce LRSim that simulates linked-reads by emulating the library preparation and sequencing process with fine control over variants, linked-read characteristics, and the short-read profile. We conclude from the phasing and assembly of multiple datasets, recommendations on coverage, fragment length, and partitioning when sequencing genomes of different sizes and complexities. These optimizations improve results by orders of magnitude, and enable the development of novel methods. LRSim is available at https://github.com/aquaskyline/LRSIM. Keywords: Linked-read, Molecular barcoding, Reads partitioning, Phasing, Reads simulation, Genome assembly, 10X Genomics

  15. The Benefits of Adaptive Partitioning for Parallel AMR Applications

    Energy Technology Data Exchange (ETDEWEB)

    Steensland, Johan [Sandia National Lab. (SNL-CA), Livermore, CA (United States). Advanced Software Research and Development

    2008-07-01

    Parallel adaptive mesh refinement methods potentially lead to realistic modeling of complex three-dimensional physical phenomena. However, the dynamics inherent in these methods present significant challenges in data partitioning and load balancing. Significant human resources, including time, effort, experience, and knowledge, are required for determining the optimal partitioning technique for each new simulation. In reality, scientists resort to using the on-board partitioner of the computational framework, or to using the partitioning industry standard, ParMetis. Adaptive partitioning refers to repeatedly selecting, configuring and invoking the optimal partitioning technique at run-time, based on the current state of the computer and application. In theory, adaptive partitioning automatically delivers superior performance and eliminates the need for repeatedly spending valuable human resources for determining the optimal static partitioning technique. In practice, however, enabling frameworks are non-existent due to the inherent significant inter-disciplinary research challenges. This paper presents a study of a simple implementation of adaptive partitioning and discusses implied potential benefits from the perspective of common groups of users within computational science. The study is based on a large set of data derived from experiments including six real-life, multi-time-step adaptive applications from various scientific domains, five complementing and fundamentally different partitioning techniques, a large set of parameters corresponding to a wide spectrum of computing environments, and a flexible cost function that considers the relative impact of multiple partitioning metrics and diverse partitioning objectives. The results show that even a simple implementation of adaptive partitioning can automatically generate results statistically equivalent to the best static partitioning. Thus, it is possible to effectively eliminate the problem of determining the

  16. Estimation of Mechanical Signals in Induction Motors using the Recursive Prediction Error Method

    DEFF Research Database (Denmark)

    Børsting, H.; Knudsen, Morten; Rasmussen, Henrik

    1993-01-01

    Sensor feedback of mechanical quantities for control applications in induction motors is troublesome and relative expensive. In this paper a recursive prediction error (RPE) method has successfully been used to estimate the angular rotor speed ........Sensor feedback of mechanical quantities for control applications in induction motors is troublesome and relative expensive. In this paper a recursive prediction error (RPE) method has successfully been used to estimate the angular rotor speed .....

  17. ETHICS AND KNOWLEDGE OF RECURSIVITY IN PSYCHOLOGISTS TRAINING

    Directory of Open Access Journals (Sweden)

    Ramón Sanz Ferramola

    2008-07-01

    Full Text Available This work deals with the characterization of psychology as a science and profession. Thisfeature is part of the Argentine academic tradition which goes from the origins of psychology as an undergraduate program by the end of the 1950s to the present day. In relation to this topic, four issues are analysed: a the knowledges of psychology showing the necessity of two epistemic dimensions closely related, namely the discursivity and recursivity, or knowledge and metaknowledge, b the role of psychology as a profession within the praxis, rather than in the poiesis, according to the Greek distinction between the implications of these two modalities of the “doing”, c the concurrence and difference of ethics and deontology, their roles, bounds and potentialities within the psychological field in general, and that of scientific-professional morality in particular, and d the definition and characterization of ethics and epistemology as knowledge of recursivity in psychologists’ training.

  18. Partitioning of naphthalene, methylnaphthalenes and biphenyl between wastewater treatment sludges and water

    International Nuclear Information System (INIS)

    Southworth, G.R.; Keller, J.L.

    1984-01-01

    Partition coefficients (K/sub p/) describing the partitioning of naphthalene, methylnaphthalenes and biphenyl between organic-rich wastes and water were determined using 14 C-tracer techniques as well as high performance liquid chromatographic analysis of the wastes and their aqueous extracts. Results of the two procedures were in good agreement. The concentrations of the specific organics in the wastes were not good predictors of concentrations in aqueous extracts, since K/sub p/ varied among the materials tested. Predictions of k/sub p/ based on organic carbon content of the sludges were well below observed values. Oil content of the wastes and oil-water partition coefficients appeared to be important factors in determining K/sub p/. 11 references, 5 tables

  19. Layer-splitting technique for testing the recursive scheme for multilayer shields gamma ray buildup factors

    International Nuclear Information System (INIS)

    Alkhatib, Sari F.; Park, Chang Je; Jeong, Hae Yong; Lee, Yongdeok

    2016-01-01

    Highlights: • A simple formalism is suggested for the recursive approach and then it is used to produce buildup factors for certain multilayer shields. • The newly layer-splitting technique is implemented on the studied cases for testing the suggested formalism performance. • The buildup factors are generated using cubic polynomial fitting functions that are produced based on previous well-acknowledge data. - Abstract: This study illustrates the implementation of the newly suggested layer-splitting testing technique. This technique is introduced in order to be implemented in examining suggested formalisms for the recursive scheme (or iterative scheme). The recursive scheme is a concept used in treating and producing the gamma ray buildup factors in the case of multilayer shields. The layer-splitting technique simply enforces the scheme to treat a single layer of one material as two separated layers with similar characteristics. Thus it subjects the scheme to an abnormal definition of the multilayer shield that will test its performance in treating the successive layers. Thus, it will act as a method of verification for the approximations and assumptions taken in consideration. A simple formalism was suggested for the recursive scheme then the splitting technique was implemented on it. The results of implementing both the suggested formalism and the splitting technique are then illustrated and discussed. Throughout this study, cubic polynomial fitting functions were used to generate the data of buildup factors for the basic single-media that constitute the multilayer shields understudy. This study is limited to the cases of multiple shields consisting of repeated consecutive thin layers of lead–water and iron–water shields for 1 MeV gamma rays. The produced results of the buildup factor values through the implementation of the suggested formalism showed good consistency with the Monte Carlo simulation results of Lin and Jiang work. In the implementation of

  20. AR-RBFS: Aware-Routing Protocol Based on Recursive Best-First Search Algorithm for Wireless Sensor Networks

    Directory of Open Access Journals (Sweden)

    Farzad Kiani

    2016-01-01

    Full Text Available Energy issue is one of the most important problems in wireless sensor networks. They consist of low-power sensor nodes and a few base station nodes. They must be adaptive and efficient in data transmission to sink in various areas. This paper proposes an aware-routing protocol based on clustering and recursive search approaches. The paper focuses on the energy efficiency issue with various measures such as prolonging network lifetime along with reducing energy consumption in the sensor nodes and increasing the system reliability. Our proposed protocol consists of two phases. In the first phase (network development phase, the sensors are placed into virtual layers. The second phase (data transmission is related to routes discovery and data transferring so it is based on virtual-based Classic-RBFS algorithm in the lake of energy problem environments but, in the nonchargeable environments, all nodes in each layer can be modeled as a random graph and then begin to be managed by the duty cycle method. Additionally, the protocol uses new topology control, data aggregation, and sleep/wake-up schemas for energy saving in the network. The simulation results show that the proposed protocol is optimal in the network lifetime and packet delivery parameters according to the present protocols.

  1. Multiphonon theory: generalized Wick's theorem and recursion formulas

    International Nuclear Information System (INIS)

    Silvestre-Brac, B.; Piepenbring, R.

    1982-04-01

    Overlaps and matrix elements of one and two-body operators are calculated in a space spanned by multiphonons of different types taking properly the Pauli principle into account. Two methods are developped: a generalized Wick's theorem dealing with new contractions and recursion formulas well suited for numerical applications

  2. Parameter Estimation of a Closed Loop Coupled Tank Time Varying System using Recursive Methods

    International Nuclear Information System (INIS)

    Basir, Siti Nora; Yussof, Hanafiah; Shamsuddin, Syamimi; Selamat, Hazlina; Zahari, Nur Ismarrubie

    2013-01-01

    This project investigates the direct identification of closed loop plant using discrete-time approach. The uses of Recursive Least Squares (RLS), Recursive Instrumental Variable (RIV) and Recursive Instrumental Variable with Centre-Of-Triangle (RIV + COT) in the parameter estimation of closed loop time varying system have been considered. The algorithms were applied in a coupled tank system that employs covariance resetting technique where the time of parameter changes occur is unknown. The performances of all the parameter estimation methods, RLS, RIV and RIV + COT were compared. The estimation of the system whose output was corrupted with white and coloured noises were investigated. Covariance resetting technique successfully executed when the parameters change. RIV + COT gives better estimates than RLS and RIV in terms of convergence and maximum overshoot

  3. Parametric output-only identification of time-varying structures using a kernel recursive extended least squares TARMA approach

    Science.gov (United States)

    Ma, Zhi-Sai; Liu, Li; Zhou, Si-Da; Yu, Lei; Naets, Frank; Heylen, Ward; Desmet, Wim

    2018-01-01

    The problem of parametric output-only identification of time-varying structures in a recursive manner is considered. A kernelized time-dependent autoregressive moving average (TARMA) model is proposed by expanding the time-varying model parameters onto the basis set of kernel functions in a reproducing kernel Hilbert space. An exponentially weighted kernel recursive extended least squares TARMA identification scheme is proposed, and a sliding-window technique is subsequently applied to fix the computational complexity for each consecutive update, allowing the method to operate online in time-varying environments. The proposed sliding-window exponentially weighted kernel recursive extended least squares TARMA method is employed for the identification of a laboratory time-varying structure consisting of a simply supported beam and a moving mass sliding on it. The proposed method is comparatively assessed against an existing recursive pseudo-linear regression TARMA method via Monte Carlo experiments and shown to be capable of accurately tracking the time-varying dynamics. Furthermore, the comparisons demonstrate the superior achievable accuracy, lower computational complexity and enhanced online identification capability of the proposed kernel recursive extended least squares TARMA approach.

  4. ESPRIT-Tree: hierarchical clustering analysis of millions of 16S rRNA pyrosequences in quasilinear computational time.

    Science.gov (United States)

    Cai, Yunpeng; Sun, Yijun

    2011-08-01

    Taxonomy-independent analysis plays an essential role in microbial community analysis. Hierarchical clustering is one of the most widely employed approaches to finding operational taxonomic units, the basis for many downstream analyses. Most existing algorithms have quadratic space and computational complexities, and thus can be used only for small or medium-scale problems. We propose a new online learning-based algorithm that simultaneously addresses the space and computational issues of prior work. The basic idea is to partition a sequence space into a set of subspaces using a partition tree constructed using a pseudometric, then recursively refine a clustering structure in these subspaces. The technique relies on new methods for fast closest-pair searching and efficient dynamic insertion and deletion of tree nodes. To avoid exhaustive computation of pairwise distances between clusters, we represent each cluster of sequences as a probabilistic sequence, and define a set of operations to align these probabilistic sequences and compute genetic distances between them. We present analyses of space and computational complexity, and demonstrate the effectiveness of our new algorithm using a human gut microbiota data set with over one million sequences. The new algorithm exhibits a quasilinear time and space complexity comparable to greedy heuristic clustering algorithms, while achieving a similar accuracy to the standard hierarchical clustering algorithm.

  5. Recursive-operator method in vibration problems for rod systems

    Science.gov (United States)

    Rozhkova, E. V.

    2009-12-01

    Using linear differential equations with constant coefficients describing one-dimensional dynamical processes as an example, we show that the solutions of these equations and systems are related to the solution of the corresponding numerical recursion relations and one does not have to compute the roots of the corresponding characteristic equations. The arbitrary functions occurring in the general solution of the homogeneous equations are determined by the initial and boundary conditions or are chosen from various classes of analytic functions. The solutions of the inhomogeneous equations are constructed in the form of integro-differential series acting on the right-hand side of the equation, and the coefficients of the series are determined from the same recursion relations. The convergence of formal solutions as series of a more general recursive-operator construction was proved in [1]. In the special case where the solutions of the equation can be represented in separated variables, the power series can be effectively summed, i.e., expressed in terms of elementary functions, and coincide with the known solutions. In this case, to determine the natural vibration frequencies, one obtains algebraic rather than transcendental equations, which permits exactly determining the imaginary and complex roots of these equations without using the graphic method [2, pp. 448-449]. The correctness of the obtained formulas (differentiation formulas, explicit expressions for the series coefficients, etc.) can be verified directly by appropriate substitutions; therefore, we do not prove them here.

  6. Detecting treatment-subgroup interactions in clustered data with generalized linear mixed-effects model trees.

    Science.gov (United States)

    Fokkema, M; Smits, N; Zeileis, A; Hothorn, T; Kelderman, H

    2017-10-25

    Identification of subgroups of patients for whom treatment A is more effective than treatment B, and vice versa, is of key importance to the development of personalized medicine. Tree-based algorithms are helpful tools for the detection of such interactions, but none of the available algorithms allow for taking into account clustered or nested dataset structures, which are particularly common in psychological research. Therefore, we propose the generalized linear mixed-effects model tree (GLMM tree) algorithm, which allows for the detection of treatment-subgroup interactions, while accounting for the clustered structure of a dataset. The algorithm uses model-based recursive partitioning to detect treatment-subgroup interactions, and a GLMM to estimate the random-effects parameters. In a simulation study, GLMM trees show higher accuracy in recovering treatment-subgroup interactions, higher predictive accuracy, and lower type II error rates than linear-model-based recursive partitioning and mixed-effects regression trees. Also, GLMM trees show somewhat higher predictive accuracy than linear mixed-effects models with pre-specified interaction effects, on average. We illustrate the application of GLMM trees on an individual patient-level data meta-analysis on treatments for depression. We conclude that GLMM trees are a promising exploratory tool for the detection of treatment-subgroup interactions in clustered datasets.

  7. Topological recursion for Gaussian means and cohomological field theories

    Science.gov (United States)

    Andersen, J. E.; Chekhov, L. O.; Norbury, P.; Penner, R. C.

    2015-12-01

    We introduce explicit relations between genus-filtrated s-loop means of the Gaussian matrix model and terms of the genus expansion of the Kontsevich-Penner matrix model (KPMM), which is the generating function for volumes of discretized (open) moduli spaces M g,s disc (discrete volumes). Using these relations, we express Gaussian means in all orders of the genus expansion as polynomials in special times weighted by ancestor invariants of an underlying cohomological field theory. We translate the topological recursion of the Gaussian model into recurrence relations for the coefficients of this expansion, which allows proving that they are integers and positive. We find the coefficients in the first subleading order for M g,1 for all g in three ways: using the refined Harer-Zagier recursion, using the Givental-type decomposition of the KPMM, and counting diagrams explicitly.

  8. Use of genomic recursions and algorithm for proven and young animals for single-step genomic BLUP analyses--a simulation study.

    Science.gov (United States)

    Fragomeni, B O; Lourenco, D A L; Tsuruta, S; Masuda, Y; Aguilar, I; Misztal, I

    2015-10-01

    The purpose of this study was to examine accuracy of genomic selection via single-step genomic BLUP (ssGBLUP) when the direct inverse of the genomic relationship matrix (G) is replaced by an approximation of G(-1) based on recursions for young genotyped animals conditioned on a subset of proven animals, termed algorithm for proven and young animals (APY). With the efficient implementation, this algorithm has a cubic cost with proven animals and linear with young animals. Ten duplicate data sets mimicking a dairy cattle population were simulated. In a first scenario, genomic information for 20k genotyped bulls, divided in 7k proven and 13k young bulls, was generated for each replicate. In a second scenario, 5k genotyped cows with phenotypes were included in the analysis as young animals. Accuracies (average for the 10 replicates) in regular EBV were 0.72 and 0.34 for proven and young animals, respectively. When genomic information was included, they increased to 0.75 and 0.50. No differences between genomic EBV (GEBV) obtained with the regular G(-1) and the approximated G(-1) via the recursive method were observed. In the second scenario, accuracies in GEBV (0.76, 0.51 and 0.59 for proven bulls, young males and young females, respectively) were also higher than those in EBV (0.72, 0.35 and 0.49). Again, no differences between GEBV with regular G(-1) and with recursions were observed. With the recursive algorithm, the number of iterations to achieve convergence was reduced from 227 to 206 in the first scenario and from 232 to 209 in the second scenario. Cows can be treated as young animals in APY without reducing the accuracy. The proposed algorithm can be implemented to reduce computing costs and to overcome current limitations on the number of genotyped animals in the ssGBLUP method. © 2015 Blackwell Verlag GmbH.

  9. ANALYSIS OF HYGROTHERMAL CONDITIONS OF EXTERNAL PARTITIONS IN AN UNDERGROUND FRUIT STORE

    Directory of Open Access Journals (Sweden)

    Grzegorz Nawalany

    2016-09-01

    Full Text Available The paper presents the analysis of hygrothermal conditions of external partitions in an underground fruit store. The results of measurements of temperature and humidity of the indoor and outdoor air as well as the surface surrounding temperature and the temperature of the air surrounding the store constituted the boundary conditions for the hygrothermal calculations. The paper presents the calculation of the distribution of the temperature and humidity on the ground floor, the wall contacting the ground, the wall contacting the outside air, and the ceiling above the storage chamber. The heat and moisture calculations have shown high risk of condensation submerged in non-insulated external walls. The condition of the adaptation of a traditional cold store to a simple and atmosphere controlled cold one is to increase the thermal resistance of the partitions. Such a solution will let cut the energy demand in those types of agricultural buildings.

  10. Recursive estimation of the claim rates and sizes in an insurance model

    Directory of Open Access Journals (Sweden)

    Lakhdar Aggoun

    2004-01-01

    Full Text Available It is a common fact that for most classes of general insurance, many possible sources of heterogeneity of risk exist. Premium rates based on information from a heterogeneous portfolio might be quite inadequate. One way of reducing this danger is by grouping policies according to the different levels of the various risk factors involved. Using measure change techniques, we derive recursive filters and predictors for the claim rates and claim sizes for the different groups.

  11. Characterization of Phase Chemistry and Partitioning in a Family of High-Strength Nickel-Based Superalloys

    Science.gov (United States)

    Lapington, M. T.; Crudden, D. J.; Reed, R. C.; Moody, M. P.; Bagot, P. A. J.

    2018-06-01

    A family of novel polycrystalline Ni-based superalloys with varying Ti:Nb ratios has been created using computational alloy design techniques, and subsequently characterized using atom probe tomography and electron microscopy. Phase chemistry, elemental partitioning, and γ' character have been analyzed and compared with thermodynamic predictions created using Thermo-Calc. Phase compositions and γ' volume fraction were found to compare favorably with the thermodynamically predicted values, while predicted partitioning behavior for Ti, Nb, Cr, and Co tended to overestimate γ' preference over the γ matrix, often with opposing trends vs Nb concentration.

  12. Quality Control Procedure Based on Partitioning of NMR Time Series

    Directory of Open Access Journals (Sweden)

    Michał Staniszewski

    2018-03-01

    Full Text Available The quality of the magnetic resonance spectroscopy (MRS depends on the stability of magnetic resonance (MR system performance and optimal hardware functioning, which ensure adequate levels of signal-to-noise ratios (SNR as well as good spectral resolution and minimal artifacts in the spectral data. MRS quality control (QC protocols and methodologies are based on phantom measurements that are repeated regularly. In this work, a signal partitioning algorithm based on a dynamic programming (DP method for QC assessment of the spectral data is described. The proposed algorithm allows detection of the change points—the abrupt variations in the time series data. The proposed QC method was tested using the simulated and real phantom data. Simulated data were randomly generated time series distorted by white noise. The real data were taken from the phantom quality control studies of the MRS scanner collected for four and a half years and analyzed by LCModel software. Along with the proposed algorithm, performance of various literature methods was evaluated for the predefined number of change points based on the error values calculated by subtracting the mean values calculated for the periods between the change-points from the original data points. The time series were checked using external software, a set of external methods and the proposed tool, and the obtained results were comparable. The application of dynamic programming in the analysis of the phantom MRS data is a novel approach to QC. The obtained results confirm that the presented change-point-detection tool can be used either for independent analysis of MRS time series (or any other or as a part of quality control.

  13. Soft sensor modelling by time difference, recursive partial least squares and adaptive model updating

    International Nuclear Information System (INIS)

    Fu, Y; Xu, O; Yang, W; Zhou, L; Wang, J

    2017-01-01

    To investigate time-variant and nonlinear characteristics in industrial processes, a soft sensor modelling method based on time difference, moving-window recursive partial least square (PLS) and adaptive model updating is proposed. In this method, time difference values of input and output variables are used as training samples to construct the model, which can reduce the effects of the nonlinear characteristic on modelling accuracy and retain the advantages of recursive PLS algorithm. To solve the high updating frequency of the model, a confidence value is introduced, which can be updated adaptively according to the results of the model performance assessment. Once the confidence value is updated, the model can be updated. The proposed method has been used to predict the 4-carboxy-benz-aldehyde (CBA) content in the purified terephthalic acid (PTA) oxidation reaction process. The results show that the proposed soft sensor modelling method can reduce computation effectively, improve prediction accuracy by making use of process information and reflect the process characteristics accurately. (paper)

  14. Consumption-Portfolio Optimization with Recursive Utility in Incomplete Markets

    DEFF Research Database (Denmark)

    Kraft, Holger; Seifried, Frank Thomas; Steffensen, Mogens

    2013-01-01

    In an incomplete market, we study the optimal consumption-portfolio decision of an investor with recursive preferences of Epstein–Zin type. Applying a classical dynamic programming approach, we formulate the associated Hamilton–Jacobi–Bellman equation and provide a suitable verification theorem...

  15. A recursive Formulation of the Inversion of symmetric positive defite matrices in packed storage data format

    DEFF Research Database (Denmark)

    Andersen, Bjarne Stig; Gunnels, John A.; Gustavson, Fred

    2002-01-01

    A new Recursive Packed Inverse Calculation Algorithm for symmetric positive definite matrices has been developed. The new Recursive Inverse Calculation algorithm uses minimal storage, \\$n(n+1)/2\\$, and has nearly the same performance as the LAPACK full storage algorithm using \\$n\\^2\\$ memory words...

  16. Prediction of Partition Coefficients of Organic Compounds for SPME/PDMS

    Directory of Open Access Journals (Sweden)

    Liao Hsuan-Yu

    2016-01-01

    Full Text Available The partition coefficients of 51 organic compounds between SPME/PDMS and gas were compiled from the literature sources in this study. The effect of physicochemical properties and descriptors on the partitioning process of partition coefficients was explicated by the correlation analysis. The PDMS-gas partition coefficients were well correlated to the molecular weight of organic compounds (r = 0.832, p < 0.05. An empirical model, consisting of the molecular weight and the polarizability, was developed to appropriately predict the partition coefficients of organic compounds. The empirical model for estimating the PDMS-gas partition coefficient will contribute to the practical applications of the SPME technique.

  17. Non-abelian Z-theory: Berends-Giele recursion for the α{sup ′}-expansion of disk integrals

    Energy Technology Data Exchange (ETDEWEB)

    Mafra, Carlos R. [STAG Research Centre and Mathematical Sciences, University of Southampton,Southampton (United Kingdom); Institute for Advanced Study, School of Natural Sciences,Einstein Drive, Princeton, NJ 08540 (United States); Schlotterer, Oliver [Max-Planck-Institut für Gravitationsphysik, Albert-Einstein-Institut,Am Mühlenberg 1, 14476 Potsdam (Germany)

    2017-01-09

    We present a recursive method to calculate the α{sup ′}-expansion of disk integrals arising in tree-level scattering of open strings which resembles the approach of Berends and Giele to gluon amplitudes. Following an earlier interpretation of disk integrals as doubly partial amplitudes of an effective theory of scalars dubbed as Z-theory, we pinpoint the equation of motion of Z-theory from the Berends-Giele recursion for its tree amplitudes. A computer implementation of this method including explicit results for the recursion up to order α{sup ′7} is made available on the website repo.or.cz/BGap.git.

  18. Comparison of modeling approaches for carbon partitioning: Impact on estimates of global net primary production and equilibrium biomass of woody vegetation from MODIS GPP

    Science.gov (United States)

    Ise, Takeshi; Litton, Creighton M.; Giardina, Christian P.; Ito, Akihiko

    2010-12-01

    Partitioning of gross primary production (GPP) to aboveground versus belowground, to growth versus respiration, and to short versus long-lived tissues exerts a strong influence on ecosystem structure and function, with potentially large implications for the global carbon budget. A recent meta-analysis of forest ecosystems suggests that carbon partitioning to leaves, stems, and roots varies consistently with GPP and that the ratio of net primary production (NPP) to GPP is conservative across environmental gradients. To examine influences of carbon partitioning schemes employed by global ecosystem models, we used this meta-analysis-based model and a satellite-based (MODIS) terrestrial GPP data set to estimate global woody NPP and equilibrium biomass, and then compared it to two process-based ecosystem models (Biome-BGC and VISIT) using the same GPP data set. We hypothesized that different carbon partitioning schemes would result in large differences in global estimates of woody NPP and equilibrium biomass. Woody NPP estimated by Biome-BGC and VISIT was 25% and 29% higher than the meta-analysis-based model for boreal forests, with smaller differences in temperate and tropics. Global equilibrium woody biomass, calculated from model-specific NPP estimates and a single set of tissue turnover rates, was 48 and 226 Pg C higher for Biome-BGC and VISIT compared to the meta-analysis-based model, reflecting differences in carbon partitioning to structural versus metabolically active tissues. In summary, we found that different carbon partitioning schemes resulted in large variations in estimates of global woody carbon flux and storage, indicating that stand-level controls on carbon partitioning are not yet accurately represented in ecosystem models.

  19. Optimal hydrograph separation using a recursive digital filter constrained by chemical mass balance, with application to selected Chesapeake Bay watersheds

    Science.gov (United States)

    Raffensperger, Jeff P.; Baker, Anna C.; Blomquist, Joel D.; Hopple, Jessica A.

    2017-06-26

    Quantitative estimates of base flow are necessary to address questions concerning the vulnerability and response of the Nation’s water supply to natural and human-induced change in environmental conditions. An objective of the U.S. Geological Survey National Water-Quality Assessment Project is to determine how hydrologic systems are affected by watershed characteristics, including land use, land cover, water use, climate, and natural characteristics (geology, soil type, and topography). An important component of any hydrologic system is base flow, generally described as the part of streamflow that is sustained between precipitation events, fed to stream channels by delayed (usually subsurface) pathways, and more specifically as the volumetric discharge of water, estimated at a measurement site or gage at the watershed scale, which represents groundwater that discharges directly or indirectly to stream reaches and is then routed to the measurement point.Hydrograph separation using a recursive digital filter was applied to 225 sites in the Chesapeake Bay watershed. The recursive digital filter was chosen for the following reasons: it is based in part on the assumption that groundwater acts as a linear reservoir, and so has a physical basis; it has only two adjustable parameters (alpha, obtained directly from recession analysis, and beta, the maximum value of the base-flow index that can be modeled by the filter), which can be determined objectively and with the same physical basis of groundwater reservoir linearity, or that can be optimized by applying a chemical-mass-balance constraint. Base-flow estimates from the recursive digital filter were compared with those from five other hydrograph-separation methods with respect to two metrics: the long-term average fraction of streamflow that is base flow, or base-flow index, and the fraction of days where streamflow is entirely base flow. There was generally good correlation between the methods, with some biased

  20. Recursivity: A Working Paper on Rhetoric and "Mnesis"

    Science.gov (United States)

    Stormer, Nathan

    2013-01-01

    This essay proposes the genealogical study of remembering and forgetting as recursive rhetorical capacities that enable discourse to place itself in an ever-changing present. "Mnesis" is a meta-concept for the arrangements of remembering and forgetting that enable rhetoric to function. Most of the essay defines the materiality of "mnesis", first…

  1. Innovative Bayesian and Parsimony Phylogeny of Dung Beetles (Coleoptera, Scarabaeidae, Scarabaeinae) Enhanced by Ontology-Based Partitioning of Morphological Characters

    Science.gov (United States)

    Tarasov, Sergei; Génier, François

    2015-01-01

    Scarabaeine dung beetles are the dominant dung feeding group of insects and are widely used as model organisms in conservation, ecology and developmental biology. Due to the conflicts among 13 recently published phylogenies dealing with the higher-level relationships of dung beetles, the phylogeny of this lineage remains largely unresolved. In this study, we conduct rigorous phylogenetic analyses of dung beetles, based on an unprecedented taxon sample (110 taxa) and detailed investigation of morphology (205 characters). We provide the description of morphology and thoroughly illustrate the used characters. Along with parsimony, traditionally used in the analysis of morphological data, we also apply the Bayesian method with a novel approach that uses anatomy ontology for matrix partitioning. This approach allows for heterogeneity in evolutionary rates among characters from different anatomical regions. Anatomy ontology generates a number of parameter-partition schemes which we compare using Bayes factor. We also test the effect of inclusion of autapomorphies in the morphological analysis, which hitherto has not been examined. Generally, schemes with more parameters were favored in the Bayesian comparison suggesting that characters located on different body regions evolve at different rates and that partitioning of the data matrix using anatomy ontology is reasonable; however, trees from the parsimony and all the Bayesian analyses were quite consistent. The hypothesized phylogeny reveals many novel clades and provides additional support for some clades recovered in previous analyses. Our results provide a solid basis for a new classification of dung beetles, in which the taxonomic limits of the tribes Dichotomiini, Deltochilini and Coprini are restricted and many new tribes must be described. Based on the consistency of the phylogeny with biogeography, we speculate that dung beetles may have originated in the Mesozoic contrary to the traditional view pointing to a

  2. Prediction of Partition Coefficients of Organic Compounds for SPME/PDMS

    OpenAIRE

    Liao Hsuan-Yu; Huang Miao-Ling; Lu Yu-Ting; Chao Keh-Ping

    2016-01-01

    The partition coefficients of 51 organic compounds between SPME/PDMS and gas were compiled from the literature sources in this study. The effect of physicochemical properties and descriptors on the partitioning process of partition coefficients was explicated by the correlation analysis. The PDMS-gas partition coefficients were well correlated to the molecular weight of organic compounds (r = 0.832, p < 0.05). An empirical model, consisting of the molecular weight and the polarizability, was ...

  3. A brief history of partitions of numbers, partition functions and their modern applications

    Science.gov (United States)

    Debnath, Lokenath

    2016-04-01

    'Number rules the universe.' The Pythagoras 'If you wish to forsee the future of mathematics our course is to study the history and present conditions of the science.' Henri Poincaré 'The primary source (Urqell) of all mathematics are integers.' Hermann Minkowski This paper is written to commemorate the centennial anniversary of the Mathematical Association of America. It deals with a short history of different kinds of natural numbers including triangular, square, pentagonal, hexagonal and k-gonal numbers, and their simple properties and their geometrical representations. Included are Euclid's and Pythagorean's main contributions to elementary number theory with the main contents of the Euclid Elements of the 13-volume masterpiece of mathematical work. This is followed by Euler's new discovery of the additive number theory based on partitions of numbers. Special attention is given to many examples, Euler's theorems on partitions of numbers with geometrical representations of Ferrers' graphs, Young's diagrams, Lagrange's four-square theorem and the celebrated Waring problem. Included are Euler's generating functions for the partitions of numbers, Euler's pentagonal number theorem, Gauss' triangular and square number theorems and the Jacobi triple product identity. Applications of the theory of partitions of numbers to different statistics such as the Bose- Einstein, Fermi- Dirac, Gentile, and Maxwell- Boltzmann statistics are briefly discussed. Special attention is given to pedagogical information through historical approach to number theory so that students and teachers at the school, college and university levels can become familiar with the basic concepts of partitions of numbers, partition functions and their modern applications, and can pursue advanced study and research in analytical and computational number theory.

  4. DCE-MRI texture analysis with tumor subregion partitioning for predicting Ki-67 status of estrogen receptor-positive breast cancers

    KAUST Repository

    Fan, Ming

    2017-12-08

    Breast tumor heterogeneity is related to risk factors that lead to worse prognosis, yet such heterogeneity has not been well studied.To predict the Ki-67 status of estrogen receptor (ER)-positive breast cancer patients via analysis of tumor heterogeneity with subgroup identification based on patterns of dynamic contrast-enhanced magnetic resonance imaging (DCE-MRI).Retrospective study.Seventy-seven breast cancer patients with ER-positive breast cancer were investigated, of whom 51 had low Ki-67 expression.T1 -weighted 3.0T DCE-MR images.Each tumor was partitioned into multiple subregions using three methods based on patterns of dynamic enhancement: 1) time to peak (TTP), 2) peak enhancement rate (PER), and 3) kinetic pattern clustering (KPC). In each tumor subregion, 18 texture features were computed.Univariate and multivariate logistic regression analyses were performed using a leave-one-out-based cross-validation (LOOCV) method. The partitioning results were compared with the same feature extraction methods across the whole tumor.In the univariate analysis, the best-performing feature was the texture statistic of sum variance in the tumor subregion with early TTP for differentiating between patients with high and low Ki-67 expression (area under the receiver operating characteristic curves, AUC = 0.748). Multivariate analysis showed that features from the tumor subregion associated with early TTP yielded the highest performance (AUC = 0.807) among the subregions for predicting the Ki-67 status. Among all regions, the tumor area with high PER at a precontrast MR image achieved the highest performance (AUC = 0.722), while the subregion that exhibited the highest overall enhancement rate based on KPC had an AUC of 0.731. These three models based on intratumoral texture analysis significantly (P < 0.01) outperformed the model using features from the whole tumor (AUC = 0.59).Texture analysis of intratumoral heterogeneity has the potential to serve as a valuable

  5. Isotope decay equations solved by means of a recursive method

    International Nuclear Information System (INIS)

    Grant, Carlos

    2009-01-01

    The isotope decay equations have been solved using forward finite differences taking small time steps, among other methods. This is the case of the cell code WIMS, where it is assumed that concentrations of all fissionable isotopes remain constant during the integration interval among other simplifications. Even when the problem could be solved running through a logical tree, all algorithms used for resolution of these equations used an iterative programming formulation. That happened because nearly all computer languages used up to a recent past by the scientific programmers did not support recursion, such as the case of the old versions of FORTRAN or BASIC. Nowadays also an integral form of the depletion equations is used in Monte Carlo simulation. In this paper we propose another programming solution using a recursive algorithm, running through all descendants of each isotope and adding their contributions to all isotopes in each generation. The only assumption made for this solution is that fluxes remain constant during the whole time step. Recursive process is interrupted when a stable isotope was attained or the calculated contributions are smaller than a given precision. These algorithms can be solved by means an exact analytic method that can have some problems when circular loops appear for isotopes with alpha decay, and a more general polynomial method. Both methods are shown. (author)

  6. Partitioning a macroscopic system into independent subsystems

    Science.gov (United States)

    Delle Site, Luigi; Ciccotti, Giovanni; Hartmann, Carsten

    2017-08-01

    We discuss the problem of partitioning a macroscopic system into a collection of independent subsystems. The partitioning of a system into replica-like subsystems is nowadays a subject of major interest in several fields of theoretical and applied physics. The thermodynamic approach currently favoured by practitioners is based on a phenomenological definition of an interface energy associated with the partition, due to a lack of easily computable expressions for a microscopic (i.e. particle-based) interface energy. In this article, we outline a general approach to derive sharp and computable bounds for the interface free energy in terms of microscopic statistical quantities. We discuss potential applications in nanothermodynamics and outline possible future directions.

  7. Partitioning in aqueous two-phase systems: Analysis of strengths, weaknesses, opportunities and threats.

    Science.gov (United States)

    Soares, Ruben R G; Azevedo, Ana M; Van Alstine, James M; Aires-Barros, M Raquel

    2015-08-01

    For half a century aqueous two-phase systems (ATPSs) have been applied for the extraction and purification of biomolecules. In spite of their simplicity, selectivity, and relatively low cost they have not been significantly employed for industrial scale bioprocessing. Recently their ability to be readily scaled and interface easily in single-use, flexible biomanufacturing has led to industrial re-evaluation of ATPSs. The purpose of this review is to perform a SWOT analysis that includes a discussion of: (i) strengths of ATPS partitioning as an effective and simple platform for biomolecule purification; (ii) weaknesses of ATPS partitioning in regard to intrinsic problems and possible solutions; (iii) opportunities related to biotechnological challenges that ATPS partitioning may solve; and (iv) threats related to alternative techniques that may compete with ATPS in performance, economic benefits, scale up and reliability. This approach provides insight into the current status of ATPS as a bioprocessing technique and it can be concluded that most of the perceived weakness towards industrial implementation have now been largely overcome, thus paving the way for opportunities in fermentation feed clarification, integration in multi-stage operations and in single-step purification processes. Copyright © 2015 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

  8. Ab initio and template-based prediction of multi-class distance maps by two-dimensional recursive neural networks

    Directory of Open Access Journals (Sweden)

    Martin Alberto JM

    2009-01-01

    Full Text Available Abstract Background Prediction of protein structures from their sequences is still one of the open grand challenges of computational biology. Some approaches to protein structure prediction, especially ab initio ones, rely to some extent on the prediction of residue contact maps. Residue contact map predictions have been assessed at the CASP competition for several years now. Although it has been shown that exact contact maps generally yield correct three-dimensional structures, this is true only at a relatively low resolution (3–4 Å from the native structure. Another known weakness of contact maps is that they are generally predicted ab initio, that is not exploiting information about potential homologues of known structure. Results We introduce a new class of distance restraints for protein structures: multi-class distance maps. We show that Cα trace reconstructions based on 4-class native maps are significantly better than those from residue contact maps. We then build two predictors of 4-class maps based on recursive neural networks: one ab initio, or relying on the sequence and on evolutionary information; one template-based, or in which homology information to known structures is provided as a further input. We show that virtually any level of sequence similarity to structural templates (down to less than 10% yields more accurate 4-class maps than the ab initio predictor. We show that template-based predictions by recursive neural networks are consistently better than the best template and than a number of combinations of the best available templates. We also extract binary residue contact maps at an 8 Å threshold (as per CASP assessment from the 4-class predictors and show that the template-based version is also more accurate than the best template and consistently better than the ab initio one, down to very low levels of sequence identity to structural templates. Furthermore, we test both ab-initio and template-based 8

  9. OCL-BASED TEST CASE GENERATION USING CATEGORY PARTITIONING METHOD

    Directory of Open Access Journals (Sweden)

    A. Jalila

    2015-10-01

    Full Text Available The adoption of fault detection techniques during initial stages of software development life cycle urges to improve reliability of a software product. Specification-based testing is one of the major criterions to detect faults in the requirement specification or design of a software system. However, due to the non-availability of implementation details, test case generation from formal specifications become a challenging task. As a novel approach, the proposed work presents a methodology to generate test cases from OCL (Object constraint Language formal specification using Category Partitioning Method (CPM. The experiment results indicate that the proposed methodology is more effective in revealing specification based faults. Furthermore, it has been observed that OCL and CPM form an excellent combination for performing functional testing at the earliest to improve software quality with reduced cost.

  10. Recursive stochastic effects in valley hybrid inflation

    Science.gov (United States)

    Levasseur, Laurence Perreault; Vennin, Vincent; Brandenberger, Robert

    2013-10-01

    Hybrid inflation is a two-field model where inflation ends because of a tachyonic instability, the duration of which is determined by stochastic effects and has important observational implications. Making use of the recursive approach to the stochastic formalism presented in [L. P. Levasseur, preceding article, Phys. Rev. D 88, 083537 (2013)], these effects are consistently computed. Through an analysis of backreaction, this method is shown to converge in the valley but points toward an (expected) instability in the waterfall. It is further shown that the quasistationarity of the auxiliary field distribution breaks down in the case of a short-lived waterfall. We find that the typical dispersion of the waterfall field at the critical point is then diminished, thus increasing the duration of the waterfall phase and jeopardizing the possibility of a short transition. Finally, we find that stochastic effects worsen the blue tilt of the curvature perturbations by an O(1) factor when compared with the usual slow-roll contribution.

  11. Spatially Partitioned Embedded Runge--Kutta Methods

    KAUST Repository

    Ketcheson, David I.

    2013-10-30

    We study spatially partitioned embedded Runge--Kutta (SPERK) schemes for partial differential equations (PDEs), in which each of the component schemes is applied over a different part of the spatial domain. Such methods may be convenient for problems in which the smoothness of the solution or the magnitudes of the PDE coefficients vary strongly in space. We focus on embedded partitioned methods as they offer greater efficiency and avoid the order reduction that may occur in nonembedded schemes. We demonstrate that the lack of conservation in partitioned schemes can lead to nonphysical effects and propose conservative additive schemes based on partitioning the fluxes rather than the ordinary differential equations. A variety of SPERK schemes are presented, including an embedded pair suitable for the time evolution of fifth-order weighted nonoscillatory spatial discretizations. Numerical experiments are provided to support the theory.

  12. Spatially Partitioned Embedded Runge--Kutta Methods

    KAUST Repository

    Ketcheson, David I.; MacDonald, Colin B.; Ruuth, Steven J.

    2013-01-01

    We study spatially partitioned embedded Runge--Kutta (SPERK) schemes for partial differential equations (PDEs), in which each of the component schemes is applied over a different part of the spatial domain. Such methods may be convenient for problems in which the smoothness of the solution or the magnitudes of the PDE coefficients vary strongly in space. We focus on embedded partitioned methods as they offer greater efficiency and avoid the order reduction that may occur in nonembedded schemes. We demonstrate that the lack of conservation in partitioned schemes can lead to nonphysical effects and propose conservative additive schemes based on partitioning the fluxes rather than the ordinary differential equations. A variety of SPERK schemes are presented, including an embedded pair suitable for the time evolution of fifth-order weighted nonoscillatory spatial discretizations. Numerical experiments are provided to support the theory.

  13. Theory of Mind, linguistic recursion and autism spectrum disorder

    DEFF Research Database (Denmark)

    Polyanskaya, Irina; Blackburn, Patrick Rowan; Braüner, Torben

    2017-01-01

    In this paper we give the motivation for and discuss the design of an experiment investigating whether the acquisition of linguistic recur-sion helps children with Autism Spectrum Disorder (ASD) develop second-order false belief skills. We first present the relevant psycho-logical concepts (in...

  14. Algebraic computability and enumeration models recursion theory and descriptive complexity

    CERN Document Server

    Nourani, Cyrus F

    2016-01-01

    This book, Algebraic Computability and Enumeration Models: Recursion Theory and Descriptive Complexity, presents new techniques with functorial models to address important areas on pure mathematics and computability theory from the algebraic viewpoint. The reader is first introduced to categories and functorial models, with Kleene algebra examples for languages. Functorial models for Peano arithmetic are described toward important computational complexity areas on a Hilbert program, leading to computability with initial models. Infinite language categories are also introduced to explain descriptive complexity with recursive computability with admissible sets and urelements. Algebraic and categorical realizability is staged on several levels, addressing new computability questions with omitting types realizably. Further applications to computing with ultrafilters on sets and Turing degree computability are examined. Functorial models computability is presented with algebraic trees realizing intuitionistic type...

  15. Recursive estimation techniques for detection of small objects in infrared image data

    Science.gov (United States)

    Zeidler, J. R.; Soni, T.; Ku, W. H.

    1992-04-01

    This paper describes a recursive detection scheme for point targets in infrared (IR) images. Estimation of the background noise is done using a weighted autocorrelation matrix update method and the detection statistic is calculated using a recursive technique. A weighting factor allows the algorithm to have finite memory and deal with nonstationary noise characteristics. The detection statistic is created by using a matched filter for colored noise, using the estimated noise autocorrelation matrix. The relationship between the weighting factor, the nonstationarity of the noise and the probability of detection is described. Some results on one- and two-dimensional infrared images are presented.

  16. Replica analysis of partition-function zeros in spin-glass models

    International Nuclear Information System (INIS)

    Takahashi, Kazutaka

    2011-01-01

    We study the partition-function zeros in mean-field spin-glass models. We show that the replica method is useful to find the locations of zeros in a complex parameter plane. For the random energy model, we obtain the phase diagram in the plane and find that there are two types of distributions of zeros: two-dimensional distribution within a phase and one-dimensional one on a phase boundary. Phases with a two-dimensional distribution are characterized by a novel order parameter defined in the present replica analysis. We also discuss possible patterns of distributions by studying several systems.

  17. Explicit flow equations and recursion operator of the ncKP hierarchy

    International Nuclear Information System (INIS)

    He, Jingsong; Wang, Lihong; Tu, Junyi; Li, Xiaodong

    2011-01-01

    The explicit expression of the flow equations of the noncommutative Kadomtsev–Petviashvili (ncKP) hierarchy is derived. Compared with the flow equations of the KP hierarchy, our result shows that the additional terms in the flow equations of the ncKP hierarchy indeed consist of commutators of dynamical coordinates {u i }. The recursion operator for the flow equations under n-reduction is presented. Further, under 2-reduction, we calculate a nonlocal recursion operator Φ(2) of the noncommutative Korteweg–de Vries(ncKdV) hierarchy, which generates a hierarchy of local, higher-order flows. Thus we solve the open problem proposed by Olver and Sokolov (1998 Commun. Math. Phys. 193 245–68)

  18. Berends-Giele recursions and the BCJ duality in superspace and components

    Energy Technology Data Exchange (ETDEWEB)

    Mafra, Carlos R. [Institute for Advanced Study, School of Natural Sciences,Einstein Drive, Princeton, NJ 08540 (United States); DAMTP, University of Cambridge,Wilberforce Road, Cambridge, CB3 0WA (United Kingdom); Schlotterer, Oliver [Max-Planck-Institut für Gravitationsphysik, Albert-Einstein-Institut,Am Muehlenberg, 14476 Potsdam (Germany)

    2016-03-15

    The recursive method of Berends and Giele to compute tree-level gluon amplitudes is revisited using the framework of ten-dimensional super Yang-Mills. First, we prove that the pure spinor formula to compute SYM tree amplitudes derived in 2010 reduces to the standard Berends-Giele formula from the 80s when restricted to gluon amplitudes and additionally determine the fermionic completion. Second, using BRST cohomology manipulations in superspace, alternative representations of the component amplitudes are explored and the Bern-Carrasco-Johansson relations among partial tree amplitudes are derived in a novel way. Finally, it is shown how the supersymmetric components of manifestly local BCJ-satisfying tree-level numerators can be computed in a recursive fashion.

  19. Berends-Giele recursions and the BCJ duality in superspace and components

    International Nuclear Information System (INIS)

    Mafra, Carlos R.; Schlotterer, Oliver

    2016-01-01

    The recursive method of Berends and Giele to compute tree-level gluon amplitudes is revisited using the framework of ten-dimensional super Yang-Mills. First, we prove that the pure spinor formula to compute SYM tree amplitudes derived in 2010 reduces to the standard Berends-Giele formula from the 80s when restricted to gluon amplitudes and additionally determine the fermionic completion. Second, using BRST cohomology manipulations in superspace, alternative representations of the component amplitudes are explored and the Bern-Carrasco-Johansson relations among partial tree amplitudes are derived in a novel way. Finally, it is shown how the supersymmetric components of manifestly local BCJ-satisfying tree-level numerators can be computed in a recursive fashion.

  20. Recursive Pyramid Algorithm-Based Discrete Wavelet Transform for Reactive Power Measurement in Smart Meters

    Directory of Open Access Journals (Sweden)

    Mahin K. Atiq

    2013-09-01

    Full Text Available Measurement of the active, reactive, and apparent power is one of the most fundamental tasks of smart meters in energy systems. Recently, a number of studies have employed the discrete wavelet transform (DWT for power measurement in smart meters. The most common way to implement DWT is the pyramid algorithm; however, this is not feasible for practical DWT computation because it requires either a log N cascaded filter or O (N word size memory storage for an input signal of the N-point. Both solutions are too expensive for practical applications of smart meters. It is proposed that the recursive pyramid algorithm is more suitable for smart meter implementation because it requires only word size storage of L × Log (N-L, where L is the length of filter. We also investigated the effect of varying different system parameters, such as the sampling rate, dc offset, phase offset, linearity error in current and voltage sensors, analog to digital converter resolution, and number of harmonics in a non-sinusoidal system, on the reactive energy measurement using DWT. The error analysis is depicted in the form of the absolute difference between the measured and the true value of the reactive energy.

  1. Efficient Integrity Checking for Databases with Recursive Views

    DEFF Research Database (Denmark)

    Martinenghi, Davide; Christiansen, Henning

    2005-01-01

    Efficient and incremental maintenance of integrity constraints involving recursive views is a difficult issue that has received some attention in the past years, but for which no widely accepted solution exists yet. In this paper a technique is proposed for compiling such integrity constraints in...... approaches have not achieved comparable optimization with the same level of generality....

  2. A Multi-Objective Partition Method for Marine Sensor Networks Based on Degree of Event Correlation

    Directory of Open Access Journals (Sweden)

    Dongmei Huang

    2017-09-01

    Full Text Available Existing marine sensor networks acquire data from sea areas that are geographically divided, and store the data independently in their affiliated sea area data centers. In the case of marine events across multiple sea areas, the current network structure needs to retrieve data from multiple data centers, and thus severely affects real-time decision making. In this study, in order to provide a fast data retrieval service for a marine sensor network, we use all the marine sensors as the vertices, establish the edge based on marine events, and abstract the marine sensor network as a graph. Then, we construct a multi-objective balanced partition method to partition the abstract graph into multiple regions and store them in the cloud computing platform. This method effectively increases the correlation of the sensors and decreases the retrieval cost. On this basis, an incremental optimization strategy is designed to dynamically optimize existing partitions when new sensors are added into the network. Experimental results show that the proposed method can achieve the optimal layout for distributed storage in the process of disaster data retrieval in the China Sea area, and effectively optimize the result of partitions when new buoys are deployed, which eventually will provide efficient data access service for marine events.

  3. A Multi-Objective Partition Method for Marine Sensor Networks Based on Degree of Event Correlation.

    Science.gov (United States)

    Huang, Dongmei; Xu, Chenyixuan; Zhao, Danfeng; Song, Wei; He, Qi

    2017-09-21

    Existing marine sensor networks acquire data from sea areas that are geographically divided, and store the data independently in their affiliated sea area data centers. In the case of marine events across multiple sea areas, the current network structure needs to retrieve data from multiple data centers, and thus severely affects real-time decision making. In this study, in order to provide a fast data retrieval service for a marine sensor network, we use all the marine sensors as the vertices, establish the edge based on marine events, and abstract the marine sensor network as a graph. Then, we construct a multi-objective balanced partition method to partition the abstract graph into multiple regions and store them in the cloud computing platform. This method effectively increases the correlation of the sensors and decreases the retrieval cost. On this basis, an incremental optimization strategy is designed to dynamically optimize existing partitions when new sensors are added into the network. Experimental results show that the proposed method can achieve the optimal layout for distributed storage in the process of disaster data retrieval in the China Sea area, and effectively optimize the result of partitions when new buoys are deployed, which eventually will provide efficient data access service for marine events.

  4. Item Anomaly Detection Based on Dynamic Partition for Time Series in Recommender Systems.

    Science.gov (United States)

    Gao, Min; Tian, Renli; Wen, Junhao; Xiong, Qingyu; Ling, Bin; Yang, Linda

    2015-01-01

    In recent years, recommender systems have become an effective method to process information overload. However, recommendation technology still suffers from many problems. One of the problems is shilling attacks-attackers inject spam user profiles to disturb the list of recommendation items. There are two characteristics of all types of shilling attacks: 1) Item abnormality: The rating of target items is always maximum or minimum; and 2) Attack promptness: It takes only a very short period time to inject attack profiles. Some papers have proposed item anomaly detection methods based on these two characteristics, but their detection rate, false alarm rate, and universality need to be further improved. To solve these problems, this paper proposes an item anomaly detection method based on dynamic partitioning for time series. This method first dynamically partitions item-rating time series based on important points. Then, we use chi square distribution (χ2) to detect abnormal intervals. The experimental results on MovieLens 100K and 1M indicate that this approach has a high detection rate and a low false alarm rate and is stable toward different attack models and filler sizes.

  5. Item Anomaly Detection Based on Dynamic Partition for Time Series in Recommender Systems

    Science.gov (United States)

    Gao, Min; Tian, Renli; Wen, Junhao; Xiong, Qingyu; Ling, Bin; Yang, Linda

    2015-01-01

    In recent years, recommender systems have become an effective method to process information overload. However, recommendation technology still suffers from many problems. One of the problems is shilling attacks-attackers inject spam user profiles to disturb the list of recommendation items. There are two characteristics of all types of shilling attacks: 1) Item abnormality: The rating of target items is always maximum or minimum; and 2) Attack promptness: It takes only a very short period time to inject attack profiles. Some papers have proposed item anomaly detection methods based on these two characteristics, but their detection rate, false alarm rate, and universality need to be further improved. To solve these problems, this paper proposes an item anomaly detection method based on dynamic partitioning for time series. This method first dynamically partitions item-rating time series based on important points. Then, we use chi square distribution (χ2) to detect abnormal intervals. The experimental results on MovieLens 100K and 1M indicate that this approach has a high detection rate and a low false alarm rate and is stable toward different attack models and filler sizes. PMID:26267477

  6. Recursive ultrasound imaging

    DEFF Research Database (Denmark)

    2000-01-01

    A method and an apparatus for recursive ultrasound imaging is presented. The method uses a Synthetic Transmit Aperture, but unlike previous approaches a new frame is created at every pulse emission. In receive, parallel beam forming is implemented. The beam formed RF data is added to the previously...... created RF lines. To keep the level of the signal, the RF data obtained previously, when emitting with the same element is subtracted from the RF lines. Up to 5000 frames/sec can be achieved for a tissue depth of 15 cm with a speed of sound of c = 1540 m/s. The high frame rate makes continuous imaging...... data possible, which can significantly enhance flow imaging. A point spread function 2° wide at -6 dB and grating lobes of $m(F) -50 dB is obtained with a 64 elements phased array with a central frequency ƒ¿0? = 3 MHz using a sparse transmit aperture using only 10 elements (N¿xmt? = 10) during pulse...

  7. The Free Energy in the Derrida-Retaux Recursive Model

    Science.gov (United States)

    Hu, Yueyun; Shi, Zhan

    2018-05-01

    We are interested in a simple max-type recursive model studied by Derrida and Retaux (J Stat Phys 156:268-290, 2014) in the context of a physics problem, and find a wide range for the exponent in the free energy in the nearly supercritical regime.

  8. A metric model of lambda calculus with guarded recursion

    DEFF Research Database (Denmark)

    Birkedal, Lars; Schwinghammer, Jan; Støvring, Kristian

    2010-01-01

    We give a model for Nakano’s typed lambda calculus with guarded recursive definitions in a category of metric spaces. By proving a computational adequacy result that relates the interpretation with the operational semantics, we show that the model can be used to reason about contextual equivalence....

  9. VLSI PARTITIONING ALGORITHM WITH ADAPTIVE CONTROL PARAMETER

    Directory of Open Access Journals (Sweden)

    P. N. Filippenko

    2013-03-01

    Full Text Available The article deals with the problem of very large-scale integration circuit partitioning. A graph is selected as a mathematical model describing integrated circuit. Modification of ant colony optimization algorithm is presented, which is used to solve graph partitioning problem. Ant colony optimization algorithm is an optimization method based on the principles of self-organization and other useful features of the ants’ behavior. The proposed search system is based on ant colony optimization algorithm with the improved method of the initial distribution and dynamic adjustment of the control search parameters. The experimental results and performance comparison show that the proposed method of very large-scale integration circuit partitioning provides the better search performance over other well known algorithms.

  10. Multivariate analysis of attenuated total reflection Fourier transform infrared (ATR FT-IR) spectroscopic data to confirm phase partitioning in methacrylate-based dentin adhesive.

    Science.gov (United States)

    Ye, Qiang; Parthasarathy, Ranganathan; Abedin, Farhana; Laurence, Jennifer S; Misra, Anil; Spencer, Paulette

    2013-12-01

    Water is ubiquitous in the mouths of healthy individuals and is a major interfering factor in the development of a durable seal between the tooth and composite restoration. Water leads to the formation of a variety of defects in dentin adhesives; these defects undermine the tooth-composite bond. Our group recently analyzed phase partitioning of dentin adhesives using high-performance liquid chromatography (HPLC). The concentration measurements provided by HPLC offered a more thorough representation of current adhesive performance and elucidated directions to be taken for further improvement. The sample preparation and instrument analysis using HPLC are, however, time-consuming and labor-intensive. The objective of this work was to develop a methodology for rapid, reliable, and accurate quantitative analysis of near-equilibrium phase partitioning in adhesives exposed to conditions simulating the wet oral environment. Analysis by Fourier transform infrared (FT-IR) spectroscopy in combination with multivariate statistical methods, including partial least squares (PLS) regression and principal component regression (PCR), were used for multivariate calibration to quantify the compositions in separated phases. Excellent predictions were achieved when either the hydrophobic-rich phase or the hydrophilic-rich phase mixtures were analyzed. These results indicate that FT-IR spectroscopy has excellent potential as a rapid method of detection and quantification of dentin adhesives that experience phase separation under conditions that simulate the wet oral environment.

  11. LHCb: Optimising query execution time in LHCb Bookkeeping System using partition pruning and partition wise joins

    CERN Multimedia

    Mathe, Z

    2013-01-01

    The LHCb experiment produces a huge amount of data which has associated metadata such as run number, data taking condition (detector status when the data was taken), simulation condition, etc. The data are stored in files, replicated on the Computing Grid around the world. The LHCb Bookkeeping System provides methods for retrieving datasets based on their metadata. The metadata is stored in a hybrid database model, which is a mixture of Relational and Hierarchical database models and is based on the Oracle Relational Database Management System (RDBMS). The database access has to be reliable and fast. In order to achieve a high timing performance, the tables are partitioned and the queries are executed in parallel. When we store large amounts of data the partition pruning is essential for database performance, because it reduces the amount of data retrieved from the disk and optimises the resource utilisation. This research presented here is focusing on the extended composite partitioning strategy such as rang...

  12. Entropy based file type identification and partitioning

    Science.gov (United States)

    2017-06-01

    energy spectrum,” Proceedings of the Twenty-Ninth International Florida Artificial Intelligence Research Society Conference, pp. 288–293, 2016...ABBREVIATIONS AES Advanced Encryption Standard ANN Artificial Neural Network ASCII American Standard Code for Information Interchange CWT...the identification of file types and file partitioning. This approach has applications in cybersecurity as it allows for a quick determination of

  13. Relationship between Maximum Principle and Dynamic Programming for Stochastic Recursive Optimal Control Problems and Applications

    Directory of Open Access Journals (Sweden)

    Jingtao Shi

    2013-01-01

    Full Text Available This paper is concerned with the relationship between maximum principle and dynamic programming for stochastic recursive optimal control problems. Under certain differentiability conditions, relations among the adjoint processes, the generalized Hamiltonian function, and the value function are given. A linear quadratic recursive utility portfolio optimization problem in the financial engineering is discussed as an explicitly illustrated example of the main result.

  14. A fast iterative recursive least squares algorithm for Wiener model identification of highly nonlinear systems.

    Science.gov (United States)

    Kazemi, Mahdi; Arefi, Mohammad Mehdi

    2017-03-01

    In this paper, an online identification algorithm is presented for nonlinear systems in the presence of output colored noise. The proposed method is based on extended recursive least squares (ERLS) algorithm, where the identified system is in polynomial Wiener form. To this end, an unknown intermediate signal is estimated by using an inner iterative algorithm. The iterative recursive algorithm adaptively modifies the vector of parameters of the presented Wiener model when the system parameters vary. In addition, to increase the robustness of the proposed method against variations, a robust RLS algorithm is applied to the model. Simulation results are provided to show the effectiveness of the proposed approach. Results confirm that the proposed method has fast convergence rate with robust characteristics, which increases the efficiency of the proposed model and identification approach. For instance, the FIT criterion will be achieved 92% in CSTR process where about 400 data is used. Copyright © 2016 ISA. Published by Elsevier Ltd. All rights reserved.

  15. Optimisation-Based Solution Methods for Set Partitioning Models

    DEFF Research Database (Denmark)

    Rasmussen, Matias Sevel

    The scheduling of crew, i.e. the construction of work schedules for crew members, is often not a trivial task, but a complex puzzle. The task is complicated by rules, restrictions, and preferences. Therefore, manual solutions as well as solutions from standard software packages are not always su......_cient with respect to solution quality and solution time. Enhancement of the overall solution quality as well as the solution time can be of vital importance to many organisations. The _elds of operations research and mathematical optimisation deal with mathematical modelling of di_cult scheduling problems (among...... other topics). The _elds also deal with the development of sophisticated solution methods for these mathematical models. This thesis describes the set partitioning model which has been widely used for modelling crew scheduling problems. Integer properties for the set partitioning model are shown...

  16. An efficient sampling approach for variance-based sensitivity analysis based on the law of total variance in the successive intervals without overlapping

    Science.gov (United States)

    Yun, Wanying; Lu, Zhenzhou; Jiang, Xian

    2018-06-01

    To efficiently execute the variance-based global sensitivity analysis, the law of total variance in the successive intervals without overlapping is proved at first, on which an efficient space-partition sampling-based approach is subsequently proposed in this paper. Through partitioning the sample points of output into different subsets according to different inputs, the proposed approach can efficiently evaluate all the main effects concurrently by one group of sample points. In addition, there is no need for optimizing the partition scheme in the proposed approach. The maximum length of subintervals is decreased by increasing the number of sample points of model input variables in the proposed approach, which guarantees the convergence condition of the space-partition approach well. Furthermore, a new interpretation on the thought of partition is illuminated from the perspective of the variance ratio function. Finally, three test examples and one engineering application are employed to demonstrate the accuracy, efficiency and robustness of the proposed approach.

  17. Recursive deconvolution of combinatorial chemical libraries.

    OpenAIRE

    Erb, E; Janda, K D; Brenner, S

    1994-01-01

    A recursive strategy that solves for the active members of a chemical library is presented. A pentapeptide library with an alphabet of Gly, Leu, Phe, and Tyr (1024 members) was constructed on a solid support by the method of split synthesis. One member of this library (NH2-Tyr-Gly-Gly-Phe-Leu) is a native binder to a beta-endorphin antibody. A variation of the split synthesis approach is used to build the combinatorial library. In four vials, a member of the library's alphabet is coupled to a...

  18. Conformal symmetry in two-dimensional space: recursion representation of conformal block

    International Nuclear Information System (INIS)

    Zamolodchikov, A.B.

    1988-01-01

    The four-point conformal block plays an important part in the analysis of the conformally invariant operator algebra in two-dimensional space. The behavior of the conformal block is calculated in the present paper in the limit in which the dimension Δ of the intermediate operator tends to infinity. This makes it possible to construct a recursion relation for this function that connects the conformal block at arbitrary Δ to the blocks corresponding to the dimensions of the zero vectors in the degenerate representations of the Virasoro algebra. The relation is convenient for calculating the expansion of the conformal block in powers of the uniformizing parameters q = i π tau

  19. Partitional clustering algorithms

    CERN Document Server

    2015-01-01

    This book summarizes the state-of-the-art in partitional clustering. Clustering, the unsupervised classification of patterns into groups, is one of the most important tasks in exploratory data analysis. Primary goals of clustering include gaining insight into, classifying, and compressing data. Clustering has a long and rich history that spans a variety of scientific disciplines including anthropology, biology, medicine, psychology, statistics, mathematics, engineering, and computer science. As a result, numerous clustering algorithms have been proposed since the early 1950s. Among these algorithms, partitional (nonhierarchical) ones have found many applications, especially in engineering and computer science. This book provides coverage of consensus clustering, constrained clustering, large scale and/or high dimensional clustering, cluster validity, cluster visualization, and applications of clustering. Examines clustering as it applies to large and/or high-dimensional data sets commonly encountered in reali...

  20. Modeling water and hydrogen networks with partitioning regeneration units

    Directory of Open Access Journals (Sweden)

    W.M. Shehata

    2015-03-01

    Full Text Available Strict environment regulations in chemical and refinery industries lead to minimize resource consumption by designing utility networks within industrial process plants. The present study proposed a superstructure based optimization model for the synthesis of water and hydrogen networks with partitioning regenerators without mixing the regenerated sources. This method determines the number of partitioning regenerators needed for the regeneration of the sources. The number of the regenerators is based on the number of sources required to be treated for recovery. Each source is regenerated in an individual partitioning regenerator. Multiple regeneration systems can be employed to achieve minimum flowrate and costs. The formulation is linear in the regenerator balance equations. The optimized model is applied for two systems, partitioning regeneration systems of the fixed outlet impurity concentration and partitioning regeneration systems of the fixed impurity load removal ratio (RR for water and hydrogen networks. Several case studies from the literature are solved to illustrate the ease and applicability of the proposed method.

  1. Determination of partition behavior of organic surrogates between paperboard packaging materials and air.

    Science.gov (United States)

    Triantafyllou, V I; Akrida-Demertzi, K; Demertzis, P G

    2005-06-03

    The suitability of recycled paperboard packaging materials for direct food contact applications is a major area of investigation. Chemical contaminants (surrogates) partitioning between recycled paper packaging and foods may affect the safety and health of the consumer. The partition behavior of all possible organic compounds between cardboards and individual foodstuffs is difficult and too time consuming for being fully investigated. Therefore it may be more efficient to determine these partition coefficients indirectly through experimental determination of the partitioning behavior between cardboard samples and air. In this work, the behavior of organic pollutants present in a set of two paper and board samples intended to be in contact with foods was studied. Adsorption isotherms have been plotted and partition coefficients between paper and air have been calculated as a basis for the estimation of their migration potential into food. Values of partition coefficients (Kpaper/air) from 47 to 1207 were obtained at different temperatures. For the less volatile surrogates such as dibutyl phthalate and methyl stearate higher Kpaper/air values were obtained. The adsorption curves showed that the more volatile substances are partitioning mainly in air phase and increasing the temperature from 70 to 100 degrees C their concentrations in air (Cair) have almost doubled. The analysis of surrogates was performed with a method based on solvent extraction and gas chromatographic-flame ionization detection (GC-FID) quantification.

  2. On а Recursive-Parallel Algorithm for Solving the Knapsack Problem

    Directory of Open Access Journals (Sweden)

    Vladimir V. Vasilchikov

    2018-01-01

    Full Text Available In this paper, we offer an efficient parallel algorithm for solving the NP-complete Knapsack Problem in its basic, so-called 0-1 variant. To find its exact solution, algorithms belonging to the category ”branch and bound methods” have long been used. To speed up the solving with varying degrees of efficiency, various options for parallelizing computations are also used. We propose here an algorithm for solving the problem, based on the paradigm of recursive-parallel computations. We consider it suited well for problems of this kind, when it is difficult to immediately break up the computations into a sufficient number of subtasks that are comparable in complexity, since they appear dynamically at run time. We used the RPM ParLib library, developed by the author, as the main tool to program the algorithm. This library allows us to develop effective applications for parallel computing on a local network in the .NET Framework. Such applications have the ability to generate parallel branches of computation directly during program execution and dynamically redistribute work between computing modules. Any language with support for the .NET Framework can be used as a programming language in conjunction with this library. For our experiments, we developed some C# applications using this library. The main purpose of these experiments was to study the acceleration achieved by recursive-parallel computing. A detailed description of the algorithm and its testing, as well as the results obtained, are also given in the paper.

  3. Systemic treatment after whole-brain radiotherapy may improve survival in RPA class II/III breast cancer patients with brain metastasis.

    Science.gov (United States)

    Zhang, Qian; Chen, Jian; Yu, Xiaoli; Ma, Jinli; Cai, Gang; Yang, Zhaozhi; Cao, Lu; Chen, Xingxing; Guo, Xiaomao; Chen, Jiayi

    2013-09-01

    Whole brain radiotherapy (WBRT) is the most widely used treatment for brain metastasis (BM), especially for patients with multiple intracranial lesions. The purpose of this study was to examine the efficacy of systemic treatments following WBRT in breast cancer patients with BM who had different clinical characteristics, based on the classification of the Radiation Therapy Oncology Group recursive partitioning analysis (RPA) and the breast cancer-specific Graded Prognostic Assessment (Breast-GPA). One hundred and one breast cancer patients with BM treated between 2006 and 2010 were analyzed. The median interval between breast cancer diagnosis and identification of BM in the triple-negative patients was shorter than in the luminal A subtype (26 vs. 36 months, respectively; P = 0.021). Univariate analysis indicated that age at BM diagnosis, Karnofsky performance status/recursive partitioning analysis (KPS/RPA) classes, number of BMs, primary tumor control, extracranial metastases and systemic treatment following WBRT were significant prognostic factors for overall survival (OS) (P RPA classes and systemic treatments following WBRT remained the significant prognostic factors for OS. For RPA class I, the median survival with and without systemic treatments following WBRT was 25 and 22 months, respectively (P = 0.819), while for RPA class II/III systemic treatments significantly improved OS from 7 and 2 months to 11 and 5 months, respectively (P RPA class II/III patients.

  4. QCD amplitudes with 2 initial spacelike legs via generalised BCFW recursion

    Energy Technology Data Exchange (ETDEWEB)

    Kutak, Krzysztof; Hameren, Andreas van; Serino, Mirko [The H. Niewodniczański Institute of Nuclear Physics, Polish Academy of Sciences, ul. Radzikowskiego 152, 31-342, Cracow (Poland)

    2017-02-02

    We complete the generalisation of the BCFW recursion relation to the off-shell case, allowing for the computation of tree level scattering amplitudes for full High Energy Factorisation (HEF), i.e. with both incoming partons having a non-vanishing transverse momentum. We provide explicit results for color-ordered amplitudes with two off-shell legs in massless QCD up to 4 point, continuing the program begun in two previous papers. For the 4-fermion amplitudes, which are not BCFW-recursible, we perform a diagrammatic computation, so as to offer a complete set of expressions. We explicitly show and discuss some plots of the squared 2→2 matrix elements as functions of the differences in rapidity and azimuthal angle of the final state particles.

  5. Exact partition functions for deformed N=2 theories with N_f=4 flavours

    International Nuclear Information System (INIS)

    Beccaria, Matteo; Fachechi, Alberto; Macorini, Guido; Martina, Luigi

    2016-01-01

    We consider the Ω-deformed N=2SU(2) gauge theory in four dimensions with N_f=4 massive fundamental hypermultiplets. The low energy effective action depends on the deformation parameters ε_1,ε_2, the scalar field expectation value a, and the hypermultiplet masses m=(m_1,m_2,m_3,m_4). Motivated by recent findings in the N=2"∗ theory, we explore the theories that are characterized by special fixed ratios ε_2/ε_1 and m/ε_1 and propose a simple condition on the structure of the multi-instanton contributions to the prepotential determining the effective action. This condition determines a finite set Π_N of special points such that the prepotential has N poles at fixed positions independent on the instanton number. In analogy with what happens in the N=2"∗ gauge theory, the full prepotential of the Π_N theories may be given in closed form as an explicit function of a and the modular parameter q appearing in special combinations of Eisenstein series and Jacobi theta functions with well defined modular properties. The resulting finite pole partition functions are related by AGT correspondence to special 4-point spherical conformal blocks of the Virasoro algebra. We examine in full details special cases where the closed expression of the block is known and confirms our Ansatz. We systematically study the special features of Zamolodchikov’s recursion for the Π_N conformal blocks. As a result, we provide a novel effective recursion relation that can be exactly solved and allows to prove the conjectured closed expressions analytically in the case of the Π_1 and Π_2 conformal blocks.

  6. Complimentary analysis of metacommunity nestedness and diversity partitioning highlights the need for a holistic conservation strategy for highland lake fish assemblages

    Directory of Open Access Journals (Sweden)

    Jun Xu

    2015-01-01

    Full Text Available Metacommunity nestedness can be affected by both idiosyncratic species and species turnover, and diversity partitioning allows one to separate turnover and nested components within β-diversity. Thus, complimentary analysis of metacommunity nestedness and diversity partitioning allows for the identification of the underlying changes at both local and regional scales. We examined changes of fish assemblages in metacommunity nestedness and α-, β-, and γ-diversities resulting from the intense loss of native species and the invasion of nonnative species in Chinese highland lakes over the past 60 years. We found metacommunity nestedness rose markedly over time, following the loss of both β- and γ-diversity resulting from the loss of native species, and the increase of α diversity by the addition of nonnative species. This pattern is contradictory to the selective extinction leading to larger nestedness in natural ecosystems and indicates the human-induced negative effects on the metacommunity. However, β-diversity partitioning showed that the turnover component due to species replacement among lakes still contributes more than the nested component, suggesting the importance of avoiding setting conservation priorities based exclusively on metacommunity nestedness theory, but taking a more holistic metacommunity-approach to conservation instead.

  7. Accelerating SPARQL queries by exploiting hash-based locality and adaptive partitioning

    KAUST Repository

    Al-Harbi, Razen

    2016-02-08

    State-of-the-art distributed RDF systems partition data across multiple computer nodes (workers). Some systems perform cheap hash partitioning, which may result in expensive query evaluation. Others try to minimize inter-node communication, which requires an expensive data preprocessing phase, leading to a high startup cost. Apriori knowledge of the query workload has also been used to create partitions, which, however, are static and do not adapt to workload changes. In this paper, we propose AdPart, a distributed RDF system, which addresses the shortcomings of previous work. First, AdPart applies lightweight partitioning on the initial data, which distributes triples by hashing on their subjects; this renders its startup overhead low. At the same time, the locality-aware query optimizer of AdPart takes full advantage of the partitioning to (1) support the fully parallel processing of join patterns on subjects and (2) minimize data communication for general queries by applying hash distribution of intermediate results instead of broadcasting, wherever possible. Second, AdPart monitors the data access patterns and dynamically redistributes and replicates the instances of the most frequent ones among workers. As a result, the communication cost for future queries is drastically reduced or even eliminated. To control replication, AdPart implements an eviction policy for the redistributed patterns. Our experiments with synthetic and real data verify that AdPart: (1) starts faster than all existing systems; (2) processes thousands of queries before other systems become online; and (3) gracefully adapts to the query load, being able to evaluate queries on billion-scale RDF data in subseconds.

  8. Recursive form of general limited memory variable metric methods

    Czech Academy of Sciences Publication Activity Database

    Lukšan, Ladislav; Vlček, Jan

    2013-01-01

    Roč. 49, č. 2 (2013), s. 224-235 ISSN 0023-5954 Institutional support: RVO:67985807 Keywords : unconstrained optimization * large scale optimization * limited memory methods * variable metric updates * recursive matrix formulation * algorithms Subject RIV: BA - General Mathematics Impact factor: 0.563, year: 2013 http://dml.cz/handle/10338.dmlcz/143365

  9. Active control versus recursive backstepping control of a chaotic ...

    African Journals Online (AJOL)

    In this paper active controllers and recursive backstepping controllers are designed for a third order chaotic system. The performances of these controllers in the control of the dynamics of the chaotic system are investigated numerically and are found to be effective. Comparison of their transient performances show that the ...

  10. A Recursive Fuzzy System for Efficient Digital Image Stabilization

    Directory of Open Access Journals (Sweden)

    Nikolaos Kyriakoulis

    2008-01-01

    Full Text Available A novel digital image stabilization technique is proposed in this paper. It is based on a fuzzy Kalman compensation of the global motion vector (GMV, which is estimated in the log-polar plane. The GMV is extracted using four local motion vectors (LMVs computed on respective subimages in the logpolar plane. The fuzzy Kalman system consists of a fuzzy system with the Kalman filter's discrete time-invariant definition. Due to this inherited recursiveness, the output results into smoothed image sequences. The proposed stabilization system aims to compensate any oscillations of the frame absolute positions, based on the motion estimation in the log-polar domain, filtered by the fuzzy Kalman system, and thus the advantages of both the fuzzy Kalman system and the log-polar transformation are exploited. The described technique produces optimal results in terms of the output quality and the level of compensation.

  11. Combinatorics and complexity of partition functions

    CERN Document Server

    Barvinok, Alexander

    2016-01-01

    Partition functions arise in combinatorics and related problems of statistical physics as they encode in a succinct way the combinatorial structure of complicated systems. The main focus of the book is on efficient ways to compute (approximate) various partition functions, such as permanents, hafnians and their higher-dimensional versions, graph and hypergraph matching polynomials, the independence polynomial of a graph and partition functions enumerating 0-1 and integer points in polyhedra, which allows one to make algorithmic advances in otherwise intractable problems. The book unifies various, often quite recent, results scattered in the literature, concentrating on the three main approaches: scaling, interpolation and correlation decay. The prerequisites include moderate amounts of real and complex analysis and linear algebra, making the book accessible to advanced math and physics undergraduates. .

  12. A recursive algorithm for trees and forests

    OpenAIRE

    Guo, Song; Guo, Victor J. W.

    2017-01-01

    Trees or rooted trees have been generously studied in the literature. A forest is a set of trees or rooted trees. Here we give recurrence relations between the number of some kind of rooted forest with $k$ roots and that with $k+1$ roots on $\\{1,2,\\ldots,n\\}$. Classical formulas for counting various trees such as rooted trees, bipartite trees, tripartite trees, plane trees, $k$-ary plane trees, $k$-edge colored trees follow immediately from our recursive relations.

  13. Some recursive formulas for Selberg-type integrals

    Energy Technology Data Exchange (ETDEWEB)

    Iguri, Sergio [Instituto de AstronomIa y Fisica del Espacio (CONICET-UBA). C. C. 67, Suc. 28, 1428 Buenos Aires (Argentina); Mansour, Toufik, E-mail: siguri@iafe.uba.a, E-mail: toufik@math.haifa.ac.i [Department of Mathematics, University of Haifa, Haifa 31905 (Israel)

    2010-02-12

    A set of recursive relations satisfied by Selberg-type integrals involving monomial symmetric polynomials are derived, generalizing previous results in Aomoto (1987) SIAM J. Math. Anal. 18 545-49 and Iguri (2009) Lett. Math. Phys. 89 141-58. These formulas provide a well-defined algorithm for computing Selberg-Schur integrals whenever the Kostka numbers relating Schur functions and the corresponding monomial polynomials are explicitly known. We illustrate the usefulness of our results discussing some interesting examples.

  14. Stochastic Recursive Algorithms for Optimization Simultaneous Perturbation Methods

    CERN Document Server

    Bhatnagar, S; Prashanth, L A

    2013-01-01

    Stochastic Recursive Algorithms for Optimization presents algorithms for constrained and unconstrained optimization and for reinforcement learning. Efficient perturbation approaches form a thread unifying all the algorithms considered. Simultaneous perturbation stochastic approximation and smooth fractional estimators for gradient- and Hessian-based methods are presented. These algorithms: • are easily implemented; • do not require an explicit system model; and • work with real or simulated data. Chapters on their application in service systems, vehicular traffic control and communications networks illustrate this point. The book is self-contained with necessary mathematical results placed in an appendix. The text provides easy-to-use, off-the-shelf algorithms that are given detailed mathematical treatment so the material presented will be of significant interest to practitioners, academic researchers and graduate students alike. The breadth of applications makes the book appropriate for reader from sim...

  15. Recursive model for the fragmentation of polarized quarks

    Science.gov (United States)

    Kerbizi, A.; Artru, X.; Belghobsi, Z.; Bradamante, F.; Martin, A.

    2018-04-01

    We present a model for Monte Carlo simulation of the fragmentation of a polarized quark. The model is based on string dynamics and the 3P0 mechanism of quark pair creation at string breaking. The fragmentation is treated as a recursive process, where the splitting function of the subprocess q →h +q' depends on the spin density matrix of the quark q . The 3P0 mechanism is parametrized by a complex mass parameter μ , the imaginary part of which is responsible for single spin asymmetries. The model has been implemented in a Monte Carlo program to simulate jets made of pseudoscalar mesons. Results for single hadron and hadron pair transverse-spin asymmetries are found to be in agreement with experimental data from SIDIS and e+e- annihilation. The model predictions on the jet-handedness are also discussed.

  16. Survival in patients with brain metastases treated with radiotherapy holoencefalica at the National Institute of Cancerology

    International Nuclear Information System (INIS)

    Ospino, Rosalba; Cendales, Ricardo; Tria, Jaime

    2009-01-01

    Objective: To describe the overall survival among patients with brain metastases treated with whole brain radiation therapy at the Instituto Nacional de Cancerologia (INC) during 2004-2006. Methods: A survival study was conducted. All patients with brain metastases treated with whole brain radiotherapy were included. Frequencies, central tendency, and dispersion measures were used to describe discrete and continuous variables. Survival analysis was performed by the Kaplan-Meyer method. Results: 109 patients were included and the vital status was updated in 85 patients (80%). The median follow-up time was 2.76 months. 78 deaths were observed; the median survival time was 5.2 months and the cumulated one-year overall survival 25.5%. Karnofsky index, extra-cranial metastases, type of lesion, and recursive partitioning analysis (RPA) were significant prognostic factors. The overall median survival for recursive partitioning analysis class I was 7.2 months; class II 6.9 months; class III 1.8 months. Conclusion: Overall survival INC are similar than previous international series for RPA class I and III, while it was better in RPA class II.

  17. Recursive representation of the torus 1-point conformal block

    Science.gov (United States)

    Hadasz, Leszek; Jaskólski, Zbigniew; Suchanek, Paulina

    2010-01-01

    The recursive relation for the 1-point conformal block on a torus is derived and used to prove the identities between conformal blocks recently conjectured by Poghossian in [1]. As an illustration of the efficiency of the recurrence method the modular invariance of the 1-point Liouville correlation function is numerically analyzed.

  18. Actinide and fission product partitioning and transmutation. Status and assessment report

    International Nuclear Information System (INIS)

    1999-01-01

    Implementation and partitioning technology is intended to reduce the inventory of actinides and long-lived fission products in nuclear waste. Such technology can decrease hazards of pre-disposal waste management and of physical disturbance of a waste repository. An authoritative analysis is given of the technical, radiological and economic consequences of the proposed partitioning and transmutation operations on the present and future fuel cycle options. The report is subdivided to a general part for non-specialist readers, and to a technical systems analysis discussing issues on partitioning, transmutation and long-term waste management. (R.P.)

  19. Evaluation and selection of aqueous-based technology for partitioning radionuclides from ICPP calcine

    International Nuclear Information System (INIS)

    Olson, A.L.; Schulz, W.W.; Burchfield, L.A.; Carlson, C.D.; Swanson, J.L.; Thompson, M.C.

    1993-02-01

    Early in 1993 Westinghouse Idaho Nuclear Company (WINCO) chartered a Panel of Nuclear Separations Experts. The purpose of this Panel was to assist WINCO scientists and engineers in selecting, evaluating, and ranking candidate aqueous-based processes and technologies for potential use in partitioning selected radionuclides from nitric acid solutions of retrieved Idaho Chemical Processing Plant (ICPP) calcine. Radionuclides of interest are all transuranium elements, 90 Sr, 99 Tc, 129 I, and 137 Cs. The six man Panel met for 4 days (February 16--19, 1993) on the campus of the Idaho State University in Pocatello, Idaho. Principal topics addressed included: Available radionuclide removal technology; applicability of separations technology and processes to ICPP calcine; and potential integrated radionuclide partitioning schemes. This report, prepared from contributions from all Panel members, presents a comprehensive account of the proceedings and significant findings of the February, 1993 meeting in Pocatello

  20. Denotational semantics of recursive types in synthetic guarded domain theory

    DEFF Research Database (Denmark)

    Møgelberg, Rasmus Ejlers; Paviotti, Marco

    2016-01-01

    typed lambda calculus with fixed points). This model was intensional in that it could distinguish between computations computing the same result using a different number of fixed point unfoldings. In this work we show how also programming languages with recursive types can be given denotational...

  1. Phase Grouping Line Extraction Algorithm Using Overlapped Partition

    Directory of Open Access Journals (Sweden)

    WANG Jingxue

    2015-07-01

    Full Text Available Aiming at solving the problem of fracture at the discontinuities area and the challenges of line fitting in each partition, an innovative line extraction algorithm is proposed based on phase grouping using overlapped partition. The proposed algorithm adopted dual partition steps, which will generate overlapped eight partitions. Between the two steps, the middle axis in the first step coincides with the border lines in the other step. Firstly, the connected edge points that share the same phase gradients are merged into the line candidates, and fitted into line segments. Then to remedy the break lines at the border areas, the break segments in the second partition steps are refitted. The proposed algorithm is robust and does not need any parameter tuning. Experiments with various datasets have confirmed that the method is not only capable of handling the linear features, but also powerful enough in handling the curve features.

  2. Hierarchical Recursive Organization and the Free Energy Principle: From Biological Self-Organization to the Psychoanalytic Mind

    Directory of Open Access Journals (Sweden)

    Patrick Connolly

    2017-09-01

    Full Text Available The present paper argues that a systems theory epistemology (and particularly the notion of hierarchical recursive organization provides the critical theoretical context within which the significance of Friston's (2010a Free Energy Principle (FEP for both evolution and psychoanalysis is best understood. Within this perspective, the FEP occupies a particular level of the hierarchical organization of the organism, which is the level of biological self-organization. This form of biological self-organization is in turn understood as foundational and pervasive to the higher levels of organization of the human organism that are of interest to both neuroscience as well as psychoanalysis. Consequently, central psychoanalytic claims should be restated, in order to be located in their proper place within a hierarchical recursive organization of the (situated organism. In light of the FEP the realization of the psychoanalytic mind by the brain should be seen in terms of the evolution of different levels of systematic organization where the concepts of psychoanalysis describe a level of hierarchical recursive organization superordinate to that of biological self-organization and the FEP. The implication of this formulation is that while “psychoanalytic” mental processes are fundamentally subject to the FEP, they nonetheless also add their own principles of process over and above that of the FEP. A model found in Grobbelaar (1989 offers a recursive bottom-up description of the self-organization of the psychoanalytic ego as dependent on the organization of language (and affect, which is itself founded upon the tendency toward autopoiesis (self-making within the organism, which is in turn described as formally similar to the FEP. Meaningful consilience between Grobbelaar's model and the hierarchical recursive description available in Friston's (2010a theory is described. The paper concludes that the valuable contribution of the FEP to psychoanalysis

  3. Recursive SVM feature selection and sample classification for mass-spectrometry and microarray data

    Directory of Open Access Journals (Sweden)

    Harris Lyndsay N

    2006-04-01

    Full Text Available Abstract Background Like microarray-based investigations, high-throughput proteomics techniques require machine learning algorithms to identify biomarkers that are informative for biological classification problems. Feature selection and classification algorithms need to be robust to noise and outliers in the data. Results We developed a recursive support vector machine (R-SVM algorithm to select important genes/biomarkers for the classification of noisy data. We compared its performance to a similar, state-of-the-art method (SVM recursive feature elimination or SVM-RFE, paying special attention to the ability of recovering the true informative genes/biomarkers and the robustness to outliers in the data. Simulation experiments show that a 5 %-~20 % improvement over SVM-RFE can be achieved regard to these properties. The SVM-based methods are also compared with a conventional univariate method and their respective strengths and weaknesses are discussed. R-SVM was applied to two sets of SELDI-TOF-MS proteomics data, one from a human breast cancer study and the other from a study on rat liver cirrhosis. Important biomarkers found by the algorithm were validated by follow-up biological experiments. Conclusion The proposed R-SVM method is suitable for analyzing noisy high-throughput proteomics and microarray data and it outperforms SVM-RFE in the robustness to noise and in the ability to recover informative features. The multivariate SVM-based method outperforms the univariate method in the classification performance, but univariate methods can reveal more of the differentially expressed features especially when there are correlations between the features.

  4. Radionuclide partitioning in environmental systems: a critical analysis

    International Nuclear Information System (INIS)

    Cremers, A.; Maes, A.

    1986-01-01

    A survey is given of some of the important processes involved in the solid-liquid distribution behaviour of radionuclides in both well-defined adsorbents and multicomponent natural systems. The thermodynamic significance of distribution coefficients is analyzed and the various parameters affecting partition behaviour are discussed in relation to possible retention mechanisms. Attention is being given to factors such as solid/liquid ratio, pH-Eh, reversibility, liquid phase composition and speciation effects. Various processes are discussed such as ion exchange and complex formation involving clays, oxides, humic acids. It is shown that, only in rare cases, Ksub(D) values can be rationalized in terms of process mechanistics. In addition, it is indicated that, in general, radionuclide distribution coefficients cannot be considered as constants unless the conditions are restricted to very small loading intervals. It is furthermore suggested that, in order to produce meaningful data on radionuclide partitioning behaviour, efforts should be made to operate under conditions which are representative for the 'in situ' situation. (author)

  5. Rapid analysis of dissolved methane, ethylene, acetylene and ethane using partition coefficients and headspace-gas chromatography.

    Science.gov (United States)

    Lomond, Jasmine S; Tong, Anthony Z

    2011-01-01

    Analysis of dissolved methane, ethylene, acetylene, and ethane in water is crucial in evaluating anaerobic activity and investigating the sources of hydrocarbon contamination in aquatic environments. A rapid chromatographic method based on phase equilibrium between water and its headspace is developed for these analytes. The new method requires minimal sample preparation and no special apparatus except those associated with gas chromatography. Instead of Henry's Law used in similar previous studies, partition coefficients are used for the first time to calculate concentrations of dissolved hydrocarbon gases, which considerably simplifies the calculation involved. Partition coefficients are determined to be 128, 27.9, 1.28, and 96.3 at 30°C for methane, ethylene, acetylene, and ethane, respectively. It was discovered that the volume ratio of gas-to-liquid phase is critical to the accuracy of the measurements. The method performance can be readily improved by reducing the volume ratio of the two phases. Method validation shows less than 6% variation in accuracy and precision except at low levels of methane where interferences occur in ambient air. Method detection limits are determined to be in the low ng/L range for all analytes. The performance of the method is further tested using environmental samples collected from various sites in Nova Scotia.

  6. Predictive Parameters of Symptomatic Hematochezia Following 5-Fraction Gantry-Based SABR in Prostate Cancer

    Energy Technology Data Exchange (ETDEWEB)

    Musunuru, Hima Bindu [Odette Cancer Centre, Sunnybrook Health Sciences Centre, Toronto, Ontario (Canada); Department of Radiation Oncology, University of Toronto, Toronto, Ontario (Canada); Davidson, Melanie [Odette Cancer Centre, Sunnybrook Health Sciences Centre, Toronto, Ontario (Canada); Department of Medical Physics, Odette Cancer Centre, Toronto, Ontario (Canada); Cheung, Patrick; Vesprini, Danny; Liu, Stanley; Chung, Hans; Chu, William [Odette Cancer Centre, Sunnybrook Health Sciences Centre, Toronto, Ontario (Canada); Department of Radiation Oncology, University of Toronto, Toronto, Ontario (Canada); Mamedov, Alexandre [Odette Cancer Centre, Sunnybrook Health Sciences Centre, Toronto, Ontario (Canada); Ravi, Ananth [Odette Cancer Centre, Sunnybrook Health Sciences Centre, Toronto, Ontario (Canada); Department of Medical Physics, Odette Cancer Centre, Toronto, Ontario (Canada); D' Alimonte, Laura [Odette Cancer Centre, Sunnybrook Health Sciences Centre, Toronto, Ontario (Canada); Department of Radiation Oncology, University of Toronto, Toronto, Ontario (Canada); Commisso, Kristina [Odette Cancer Centre, Sunnybrook Health Sciences Centre, Toronto, Ontario (Canada); Helou, Joelle [Odette Cancer Centre, Sunnybrook Health Sciences Centre, Toronto, Ontario (Canada); Department of Radiation Oncology, University of Toronto, Toronto, Ontario (Canada); Deabreu, Andrea [Odette Cancer Centre, Sunnybrook Health Sciences Centre, Toronto, Ontario (Canada); Zhang, Liying [MacroStat, Inc, Toronto, Ontario (Canada); Loblaw, Andrew, E-mail: andrew.loblaw@sunnybrook.ca [Odette Cancer Centre, Sunnybrook Health Sciences Centre, Toronto, Ontario (Canada); Department of Radiation Oncology, University of Toronto, Toronto, Ontario (Canada); Department of Health Policy, Measurement and Evaluation, University of Toronto, Toronto, Ontario (Canada)

    2016-04-01

    Purpose: This study identified predictors of high-grade late hematochezia (HH) following 5-fraction gantry-based stereotactic ablative radiation therapy (SABR). Methods and Materials: Hematochezia data for 258 patients who received 35 to 40 Gy SABR in 5-fractions as part of sequential phase 2 prospective trials was retrieved. Grade 2 or higher late rectal bleeding was labeled HH. Hematochezia needing steroid suppositories, 4% formalin, or 1 to 2 sessions of argon plasma coagulation (APC) was labeled grade 2. More than 2 sessions of APC, blood transfusion, or a course of hyperbaric oxygen was grade 3 and development of visceral fistula, grade 4. Various dosimetric and clinical factors were analyzed using univariate and multivariate analyses. Receiver operating characteristic (ROC) curve analysis and recursive partitioning analysis were used to determine clinically valid cut-off points and identify risk groups, respectively. Results: HH was observed in 19.4%, grade ≥3 toxicity in 3.1%. Median follow-up was 29.7 months (interquartile range [IQR]: 20.6-61.7) Median time to develop HH was 11.7 months (IQR: 9.0-15.2) from the start of radiation. At 2 years, cumulative HH was 4.9%, 27.2%, and 42.1% in patients who received 35 Gy to prostate (4-mm planning target volume [PTV] margin), 40 Gy to prostate (5-mm PTV margin), and 40 Gy to prostate/seminal vesicles (5-mm PTV margin), respectively (P<.0001). In the ROC analysis, volume of rectum receiving radiation dose of 38 Gy (V38) was a strong predictor of HH with an area under the curve of 0.65. In multivariate analysis, rectal V38 (≥2.0 cm{sup 3}; odds ratio [OR]: 4.7); use of anticoagulants in the follow-up period (OR: 6.5) and presence of hemorrhoids (OR: 2.7) were the strongest predictors. Recursive partitioning analysis showed rectal V38 < 2.0 cm{sup 3}, and use of anticoagulants or rectal V38 ≥ 2.0 cm{sup 3} plus 1 other risk factor resulted in an HH risk of >30%. Conclusions: Rectal V38 and 2

  7. Sharing-Aware Horizontal Partitioning for Exploiting Correlations during Query Processing

    DEFF Research Database (Denmark)

    Tzoumas, Kostas; Deshpande, Amol; Jensen, Christian Søndergaard

    2010-01-01

    Optimization of join queries based on average selectivities is suboptimal in highly correlated databases. In such databases, relations are naturally divided into partitions, each partition having substantially different statistical characteristics. It is very compelling to discover such data...... partitions during query optimization and create multiple plans for a given query, one plan being optimal for a particular combination of data partitions. This scenario calls for the sharing of state among plans, so that common intermediate results are not recomputed. We study this problem in a setting...

  8. Scanning Auger microscopy study of lanthanum partitioning in sphene-based glass-ceramics

    International Nuclear Information System (INIS)

    Hocking, W.H.; Hayward, P.J.; Watson, D.G.; Allen, G.C.

    1984-01-01

    Glass-ceramics are being investigated as possible hosts for the radioactive wastes that would result from recycling irradiated nuclear fuels. The partitioning of lanthanum in sphene-based glass-ceramics has been studied by scanning Auger electron microscopy for lanthanum concentrations from 0.2 to 2.0 mol.%. Sphene crystals (CaTiSiO 5 ) were located in the silica-rich glass matrix by recording digital Auger images of the calcium and titanium distributions. The sphene crystals were typically 0.5 to 5 μm in size and occupied approximately 40% of the total specimen volume. Auger spot analyses revealed that lanthanum was strongly partitioned into the sphene phase of phosphorus-free glass-ceramics; however, when a small amount of phosphorus was included in the glass-ceramic composition as a crystal nucleating agent, the lanthanum was concentrated in a third minor phase which also contained calcium, phosphorus and oxygen. Chemical shift effects in the Auger spectra of silicon, titanium and phosphorus showed evidence for electron-stimulated desorption of oxygen. (author)

  9. Parameter Identification of Ship Maneuvering Models Using Recursive Least Square Method Based on Support Vector Machines

    Directory of Open Access Journals (Sweden)

    Man Zhu

    2017-03-01

    Full Text Available Determination of ship maneuvering models is a tough task of ship maneuverability prediction. Among several prime approaches of estimating ship maneuvering models, system identification combined with the full-scale or free- running model test is preferred. In this contribution, real-time system identification programs using recursive identification method, such as the recursive least square method (RLS, are exerted for on-line identification of ship maneuvering models. However, this method seriously depends on the objects of study and initial values of identified parameters. To overcome this, an intelligent technology, i.e., support vector machines (SVM, is firstly used to estimate initial values of the identified parameters with finite samples. As real measured motion data of the Mariner class ship always involve noise from sensors and external disturbances, the zigzag simulation test data include a substantial quantity of Gaussian white noise. Wavelet method and empirical mode decomposition (EMD are used to filter the data corrupted by noise, respectively. The choice of the sample number for SVM to decide initial values of identified parameters is extensively discussed and analyzed. With de-noised motion data as input-output training samples, parameters of ship maneuvering models are estimated using RLS and SVM-RLS, respectively. The comparison between identification results and true values of parameters demonstrates that both the identified ship maneuvering models from RLS and SVM-RLS have reasonable agreements with simulated motions of the ship, and the increment of the sample for SVM positively affects the identification results. Furthermore, SVM-RLS using data de-noised by EMD shows the highest accuracy and best convergence.

  10. The influence of hydrogen bonding on partition coefficients

    Science.gov (United States)

    Borges, Nádia Melo; Kenny, Peter W.; Montanari, Carlos A.; Prokopczyk, Igor M.; Ribeiro, Jean F. R.; Rocha, Josmar R.; Sartori, Geraldo Rodrigues

    2017-02-01

    This Perspective explores how consideration of hydrogen bonding can be used to both predict and better understand partition coefficients. It is shown how polarity of both compounds and substructures can be estimated from measured alkane/water partition coefficients. When polarity is defined in this manner, hydrogen bond donors are typically less polar than hydrogen bond acceptors. Analysis of alkane/water partition coefficients in conjunction with molecular electrostatic potential calculations suggests that aromatic chloro substituents may be less lipophilic than is generally believed and that some of the effect of chloro-substitution stems from making the aromatic π-cloud less available to hydrogen bond donors. Relationships between polarity and calculated hydrogen bond basicity are derived for aromatic nitrogen and carbonyl oxygen. Aligned hydrogen bond acceptors appear to present special challenges for prediction of alkane/water partition coefficients and this may reflect `frustration' of solvation resulting from overlapping hydration spheres. It is also shown how calculated hydrogen bond basicity can be used to model the effect of aromatic aza-substitution on octanol/water partition coefficients.

  11. Prediction of passive blood-brain partitioning: straightforward and effective classification models based on in silico derived physicochemical descriptors.

    Science.gov (United States)

    Vilar, Santiago; Chakrabarti, Mayukh; Costanzi, Stefano

    2010-06-01

    The distribution of compounds between blood and brain is a very important consideration for new candidate drug molecules. In this paper, we describe the derivation of two linear discriminant analysis (LDA) models for the prediction of passive blood-brain partitioning, expressed in terms of logBB values. The models are based on computationally derived physicochemical descriptors, namely the octanol/water partition coefficient (logP), the topological polar surface area (TPSA) and the total number of acidic and basic atoms, and were obtained using a homogeneous training set of 307 compounds, for all of which the published experimental logBB data had been determined in vivo. In particular, since molecules with logBB>0.3 cross the blood-brain barrier (BBB) readily while molecules with logBB<-1 are poorly distributed to the brain, on the basis of these thresholds we derived two distinct models, both of which show a percentage of good classification of about 80%. Notably, the predictive power of our models was confirmed by the analysis of a large external dataset of compounds with reported activity on the central nervous system (CNS) or lack thereof. The calculation of straightforward physicochemical descriptors is the only requirement for the prediction of the logBB of novel compounds through our models, which can be conveniently applied in conjunction with drug design and virtual screenings. Published by Elsevier Inc.

  12. Recursive construction of (J,L (J,L QC LDPC codes with girth 6

    Directory of Open Access Journals (Sweden)

    Mohammad Gholami

    2016-06-01

    Full Text Available ‎In this paper‎, ‎a recursive algorithm is presented to generate some exponent matrices which correspond to Tanner graphs with girth at least 6‎. ‎For a J×L J×L exponent matrix E E‎, ‎the lower bound Q(E Q(E is obtained explicitly such that (J,L (J,L QC LDPC codes with girth at least 6 exist for any circulant permutation matrix (CPM size m≥Q(E m≥Q(E‎. ‎The results show that the exponent matrices constructed with our recursive algorithm have smaller lower-bound than the ones proposed recently with girth 6‎

  13. The Lehmer Matrix and Its Recursive Analogue

    Science.gov (United States)

    2010-01-01

    LU factorization of matrix A by considering det A = det U = ∏n i=1 2i−1 i2 . The nth Catalan number is given in terms of binomial coefficients by Cn...for failing to comply with a collection of information if it does not display a currently valid OMB control number . 1. REPORT DATE 2010 2. REPORT...TYPE 3. DATES COVERED 00-00-2010 to 00-00-2010 4. TITLE AND SUBTITLE The Lehmer matrix and its recursive analogue 5a. CONTRACT NUMBER 5b

  14. Becoming with Data: Developing Self-Assessing Recursive Pedagogies in Schools and Using Second-Order Cybernetics as a Thinking Tool

    Science.gov (United States)

    Reinertsen, Anne Beate

    2014-01-01

    This article is about developing school-based self-assessing recursive pedagogies and case/action research practices and/or approaches in schools, and teachers, teacher researchers and researchers simultaneously producing and theorising their own practices using second-order cybernetics as a thinking tool. It is a move towards pragmatic…

  15. Derivation of Mayer Series from Canonical Ensemble

    International Nuclear Information System (INIS)

    Wang Xian-Zhi

    2016-01-01

    Mayer derived the Mayer series from both the canonical ensemble and the grand canonical ensemble by use of the cluster expansion method. In 2002, we conjectured a recursion formula of the canonical partition function of a fluid (X.Z. Wang, Phys. Rev. E 66 (2002) 056102). In this paper we give a proof for this formula by developing an appropriate expansion of the integrand of the canonical partition function. We further derive the Mayer series solely from the canonical ensemble by use of this recursion formula. (paper)

  16. Derivation of Mayer Series from Canonical Ensemble

    Science.gov (United States)

    Wang, Xian-Zhi

    2016-02-01

    Mayer derived the Mayer series from both the canonical ensemble and the grand canonical ensemble by use of the cluster expansion method. In 2002, we conjectured a recursion formula of the canonical partition function of a fluid (X.Z. Wang, Phys. Rev. E 66 (2002) 056102). In this paper we give a proof for this formula by developing an appropriate expansion of the integrand of the canonical partition function. We further derive the Mayer series solely from the canonical ensemble by use of this recursion formula.

  17. Experiments and Recommendations for Partitioning Systems of Equations

    Directory of Open Access Journals (Sweden)

    Mafteiu-Scai Liviu Octavian

    2014-06-01

    Full Text Available Partitioning the systems of equations is a very important process when solving it on a parallel computer. This paper presents some criteria which leads to more efficient parallelization, that must be taken into consideration. New criteria added to preconditioning process by reducing average bandwidth are pro- posed in this paper. These new criteria lead to a combination between preconditioning and partitioning of systems equations, so no need two distinct algorithms/processes. In our proposed methods - where the preconditioning is done by reducing the average bandwidth- two directions were followed in terms of partitioning: for a given preconditioned system determining the best partitioning (or one as close and the second consist in achieving an adequate preconditioning, depending on a given/desired partitioning. A mixed method it is also proposed. Experimental results, conclusions and recommendations, obtained after parallel implementation of conjugate gradient on IBM BlueGene /P supercomputer- based on a synchronous model of parallelization- are also presented in this paper.

  18. Symmetries and recursion operators of variable coefficient Korteweg-de Vries equations

    International Nuclear Information System (INIS)

    Baby, B.V.

    1987-01-01

    The infinitely many symmetries and recursion operators are constructed for two recently introduced variable coefficient Korteweg-de Vries equations, u t +αt n uu x +βt 2n+1 u xxx =0 and v t +βt 2n+1 (v 3 -6vv x )+(n+1)/t(xv x +2v)=0. The recursion operators are developed from Lax-pairs and this method is extended to nonisospectral problems. Olver's method of finding the existence of infinitely many symmetries for an evolution equation is found to be true for the nonisospectral case. It is found that the minimum number of different infinite sets of symmetries is the same as the number of independent similarity transformation groups associated with the given evolution equation. The relation between Painleve property and symmetries is also discussed in this paper. (author). 29 refs

  19. Phylogenetic relationships in Asarum: Effect of data partitioning and a revised classification.

    Science.gov (United States)

    Sinn, Brandon T; Kelly, Lawrence M; Freudenstein, John V

    2015-05-01

    Generic boundaries and infrageneric relationships among the charismatic temperate magnoliid Asarum sensu lato (Aristolochiaceae) have long been uncertain. Previous molecular phylogenetic analyses used either plastid or nuclear loci alone and varied greatly in their taxonomic implications for the genus. We analyzed additional molecular markers from the nuclear and plastid genomes, reevaluated the possibility of a derived loss of autonomous self-pollination, and investigated the topological effects of matrix-partitioning-scheme choice. We sequenced seven plastid regions and the nuclear ITS1-ITS2 region of 58 individuals representing all previously recognized Asarum s.l. segregate genera and the monotypic genus Saruma. Matrices were partitioned using common a priori partitioning schemes and PartitionFinder. Topologies that were recovered using a priori partitioning of matrices differed from those recovered using a PartitionFinder-selected scheme, and by analysis method. We recovered six monophyletic groups that we circumscribed into three subgenera and six sections. Putative fungal mimic characters served as synapomorphies only for subgenus Heterotropa. Subgenus Geotaenium, a new subgenus, was recovered as sister to the remainder of Asarum by ML analyses of highly partitioned datasets. Section Longistylis, also newly named, is sister to section Hexastylis. Our analyses do not unambiguously support a single origin for all fungal-mimicry characters. Topologies recovered through the analysis of PartitionFinder-optimized matrices can differ drastically from those inferred from a priori partitioned matrices, and by analytical method. We recommend that investigators evaluate the topological effects of matrix partitioning using multiple methods of phylogenetic reconstruction. © 2015 Botanical Society of America, Inc.

  20. Transfer functions for solid solution partitioning of cadmium for Australian soils

    NARCIS (Netherlands)

    Vries, de W.; Mc Laughlin, M.J.; Groenenberg, J.E.

    2011-01-01

    To assess transport and ecotoxicological risks of metals, such as cadmium (Cd) in soils, models are needed for partitioning and speciation. We derived regression-basedpartition-relations” based on adsorption and desorption experiments for main Australian soil types. First, batch adsorption

  1. Parallelizing flow-accumulation calculations on graphics processing units—From iterative DEM preprocessing algorithm to recursive multiple-flow-direction algorithm

    Science.gov (United States)

    Qin, Cheng-Zhi; Zhan, Lijun

    2012-06-01

    As one of the important tasks in digital terrain analysis, the calculation of flow accumulations from gridded digital elevation models (DEMs) usually involves two steps in a real application: (1) using an iterative DEM preprocessing algorithm to remove the depressions and flat areas commonly contained in real DEMs, and (2) using a recursive flow-direction algorithm to calculate the flow accumulation for every cell in the DEM. Because both algorithms are computationally intensive, quick calculation of the flow accumulations from a DEM (especially for a large area) presents a practical challenge to personal computer (PC) users. In recent years, rapid increases in hardware capacity of the graphics processing units (GPUs) provided in modern PCs have made it possible to meet this challenge in a PC environment. Parallel computing on GPUs using a compute-unified-device-architecture (CUDA) programming model has been explored to speed up the execution of the single-flow-direction algorithm (SFD). However, the parallel implementation on a GPU of the multiple-flow-direction (MFD) algorithm, which generally performs better than the SFD algorithm, has not been reported. Moreover, GPU-based parallelization of the DEM preprocessing step in the flow-accumulation calculations has not been addressed. This paper proposes a parallel approach to calculate flow accumulations (including both iterative DEM preprocessing and a recursive MFD algorithm) on a CUDA-compatible GPU. For the parallelization of an MFD algorithm (MFD-md), two different parallelization strategies using a GPU are explored. The first parallelization strategy, which has been used in the existing parallel SFD algorithm on GPU, has the problem of computing redundancy. Therefore, we designed a parallelization strategy based on graph theory. The application results show that the proposed parallel approach to calculate flow accumulations on a GPU performs much faster than either sequential algorithms or other parallel GPU-based

  2. Region-based Image Segmentation by Watershed Partition and DCT Energy Compaction

    Directory of Open Access Journals (Sweden)

    Chi-Man Pun

    2012-02-01

    Full Text Available An image segmentation approach by improved watershed partition and DCT energy compaction has been proposed in this paper. The proposed energy compaction, which expresses the local texture of an image area, is derived by exploiting the discrete cosine transform. The algorithm is a hybrid segmentation technique which is composed of three stages. First, the watershed transform is utilized by preprocessing techniques: edge detection and marker in order to partition the image in to several small disjoint patches, while the region size, mean and variance features are used to calculate region cost for combination. Then in the second merging stage the DCT transform is used for energy compaction which is a criterion for texture comparison and region merging. Finally the image can be segmented into several partitions. The experimental results show that the proposed approach achieved very good segmentation robustness and efficiency, when compared to other state of the art image segmentation algorithms and human segmentation results.

  3. A Decidable Recursive Logic for Weighted Transition Systems

    DEFF Research Database (Denmark)

    Xue, Bingtian; Larsen, Kim Guldstrand; Mardare, Radu Iulian

    2014-01-01

    In this paper we develop and study the Recursive Weighted Logic (RWL), a multi-modal logic that expresses qualitative and quantitative properties of labelled weighted transition systems (LWSs). LWSs are transition systems labelled with actions and real-valued quantities representing the costs of ...... extends previous results that we have demonstrated for a similar but much more restrictive logic that can only use one variable for each type of resource to encode logical properties....

  4. A novel recursive Fourier transform for nonuniform sampled signals: application to heart rate variability spectrum estimation.

    Science.gov (United States)

    Holland, Alexander; Aboy, Mateo

    2009-07-01

    We present a novel method to iteratively calculate discrete Fourier transforms for discrete time signals with sample time intervals that may be widely nonuniform. The proposed recursive Fourier transform (RFT) does not require interpolation of the samples to uniform time intervals, and each iterative transform update of N frequencies has computational order N. Because of the inherent non-uniformity in the time between successive heart beats, an application particularly well suited for this transform is power spectral density (PSD) estimation for heart rate variability. We compare RFT based spectrum estimation with Lomb-Scargle Transform (LST) based estimation. PSD estimation based on the LST also does not require uniform time samples, but the LST has a computational order greater than Nlog(N). We conducted an assessment study involving the analysis of quasi-stationary signals with various levels of randomly missing heart beats. Our results indicate that the RFT leads to comparable estimation performance to the LST with significantly less computational overhead and complexity for applications requiring iterative spectrum estimations.

  5. Hashing for Statistics over K-Partitions

    DEFF Research Database (Denmark)

    Dahlgaard, Soren; Knudsen, Mathias Baek Tejs; Rotenberg, Eva

    2015-01-01

    In this paper we analyze a hash function for k-partitioning a set into bins, obtaining strong concentration bounds for standard algorithms combining statistics from each bin. This generic method was originally introduced by Flajolet and Martin [FOCS'83] in order to save a factor Ω(k) of time per...... concentration bounds on the most popular applications of k-partitioning similar to those we would get using a truly random hash function. The analysis is very involved and implies several new results of independent interest for both simple and double tabulation, e.g. A simple and efficient construction...

  6. Using metrics for proof rules for recursively defined delay-insensitive specifications

    NARCIS (Netherlands)

    Mallon, WC; Udding, JT

    1997-01-01

    An advantage of algebraic specifications of delay insensitive asynchronous processes over most other formalisms is that it allows the recursive definition of processes, and correctness proofs of an implementation through fixpoint induction. On the other hand, proofs by fixpoint induction are

  7. Collaborative multi-agent reinforcement learning based on a novel coordination tree frame with dynamic partition

    NARCIS (Netherlands)

    Fang, M.; Groen, F.C.A.; Li, H.; Zhang, J.

    2014-01-01

    In the research of team Markov games, computing the coordinate team dynamically and determining the joint action policy are the main problems. To deal with the first problem, a dynamic team partitioning method is proposed based on a novel coordinate tree frame. We build a coordinate tree with

  8. Safety-Critical Partitioned Software Architecture: A Partitioned Software Architecture for Robotic

    Science.gov (United States)

    Horvath, Greg; Chung, Seung H.; Cilloniz-Bicchi, Ferner

    2011-01-01

    The flight software on virtually every mission currently managed by JPL has several major flaws that make it vulnerable to potentially fatal software defects. Many of these problems can be addressed by recently developed partitioned operating systems (OS). JPL has avoided adopting a partitioned operating system on its flight missions, primarily because doing so would require significant changes in flight software design, and the risks associated with changes of that magnitude cannot be accepted by an active flight project. The choice of a partitioned OS can have a dramatic effect on the overall system and software architecture, allowing for realization of benefits far beyond the concerns typically associated with the choice of OS. Specifically, we believe that a partitioned operating system, when coupled with an appropriate architecture, can provide a strong infrastructure for developing systems for which reusability, modifiability, testability, and reliability are essential qualities. By adopting a partitioned OS, projects can gain benefits throughout the entire development lifecycle, from requirements and design, all the way to implementation, testing, and operations.

  9. The partitioning of uranium and neptunium onto hydrothermally altered concrete

    International Nuclear Information System (INIS)

    Zhao, P.; Allen, P.G.; Sylwester, E.R.; Viani, B.E.

    2000-01-01

    Partition coefficients (K d ) of U(VI) and Np(V) on untreated and hydrothermally altered concrete were measured in 0.01 M NaCl and 0.01 M NaHCO 3 solutions as functions of concentration of the radionuclides, pH, and time. The partition coefficients for both U(VI) and Np(V) on hydrothermally altered concrete are significantly lower than those on untreated concrete. The partition of both U(VI) and Np(V) are pH dependent, although the pH dependence does not appear to reflect precipitation of U and Np-bearing phases. Both sorption and precipitation are likely processes controlling partitioning of U to concrete; sorption is the most likely process controlling the partitioning of Np to concrete. The presence of 0.01 M carbonate species in solution decreases K d of U(VI) for both hydrothermally altered and untreated concrete from ≥ 10 4 mL/g to ∝ 400 to 1000 mL/g indicating a significant impact on U(VI) sorption. In contrast, the presence of carbonate only reduced the K d of Np(V) by one order of magnitude or less. X-ray absorption spectroscopy analysis of U/concrete mixtures at different pHs and times indicate that uranyl ions are partitioned as monomeric species on untreated concrete, but oligomeric species on hydrothermally altered concrete. Similar analysis of Np/concrete mixtures shows that about half of the partitioned Np(V) is reduced to Np(IV) over a period of 6 months. (orig.)

  10. Chiodo formulas for the r-th roots and topological recursion

    NARCIS (Netherlands)

    Lewanski, D.; Popolitov, A.; Shadrin, S.; Zvonkine, D.

    We analyze Chiodo’s formulas for the Chern classes related to the r-th roots of the suitably twisted integer powers of the canonical class on the moduli space of curves. The intersection numbers of these classes with ψ-classes are reproduced via the Chekhov–Eynard–Orantin topological recursion. As

  11. The potential of cloud point system as a novel two-phase partitioning system for biotransformation.

    Science.gov (United States)

    Wang, Zhilong

    2007-05-01

    Although the extractive biotransformation in two-phase partitioning systems have been studied extensively, such as the water-organic solvent two-phase system, the aqueous two-phase system, the reverse micelle system, and the room temperature ionic liquid, etc., this has not yet resulted in a widespread industrial application. Based on the discussion of the main obstacles, an exploitation of a cloud point system, which has already been applied in a separation field known as a cloud point extraction, as a novel two-phase partitioning system for biotransformation, is reviewed by analysis of some topical examples. At the end of the review, the process control and downstream processing in the application of the novel two-phase partitioning system for biotransformation are also briefly discussed.

  12. Temperature-mortality relationship in dairy cattle in France based on an iso-hygro-thermal partition of the territory

    Science.gov (United States)

    Morignat, Eric; Gay, Emilie; Vinard, Jean-Luc; Calavas, Didier; Hénaux, Viviane

    2017-11-01

    The issue of global warming and more specifically its health impact on populations is increasingly concerning. The aim of our study was to evaluate the impact of temperature on dairy cattle mortality in France during the warm season (April-August). We therefore devised and implemented a spatial partitioning method to divide France into areas in which weather conditions were homogeneous, combining a multiple factor analysis with a clustering method using both weather and spatial data. We then used time-series regressions (2001-2008) to model the relationship between temperature humidity index (an index representing the temperature corrected by the relative humidity) and dairy cattle mortality within these areas. We found a significant effect of heat on dairy cattle mortality, but also an effect of cooler temperatures (to a lesser extent in some areas), which leads to a U-shaped relationship in the studied areas. Our partitioning approach based on weather criteria, associated with classic clustering methods, may contribute to better estimating temperature effects, a critical issue for animal health and welfare. Beyond the interest of its use in animal health, this approach can also be of interest in several situations in the frame of human health.

  13. The Optimization of In-Memory Space Partitioning Trees for Cache Utilization

    Science.gov (United States)

    Yeo, Myung Ho; Min, Young Soo; Bok, Kyoung Soo; Yoo, Jae Soo

    In this paper, a novel cache conscious indexing technique based on space partitioning trees is proposed. Many researchers investigated efficient cache conscious indexing techniques which improve retrieval performance of in-memory database management system recently. However, most studies considered data partitioning and targeted fast information retrieval. Existing data partitioning-based index structures significantly degrade performance due to the redundant accesses of overlapped spaces. Specially, R-tree-based index structures suffer from the propagation of MBR (Minimum Bounding Rectangle) information by updating data frequently. In this paper, we propose an in-memory space partitioning index structure for optimal cache utilization. The proposed index structure is compared with the existing index structures in terms of update performance, insertion performance and cache-utilization rate in a variety of environments. The results demonstrate that the proposed index structure offers better performance than existing index structures.

  14. Metric Structures on Fibered Manifolds Through Partitions of Unity

    Directory of Open Access Journals (Sweden)

    Hulya Kadioglu

    2016-05-01

    Full Text Available The notion of partitions of unity is extremely useful as it allows one to extend local constructions on Euclidean patches to global ones. It is widely used in many fields in mathematics. Therefore, prolongation of this useful tool to another manifold may help constructing many geometric structures. In this paper, we construct a partition of unity on a fiber bundle by using a given partition of unity on the base manifold. On the other hand we show that the converse is also possible if it is a vector bundle. As an application, we define a Riemannian metric on the fiber bundle by using induced partition of unity on the fiber bundle.

  15. Improved creep strength of nickel-base superalloys by optimized γ/γ′ partitioning behavior of solid solution strengthening elements

    International Nuclear Information System (INIS)

    Pröbstle, M.; Neumeier, S.; Feldner, P.; Rettig, R.; Helmer, H.E.; Singer, R.F.; Göken, M.

    2016-01-01

    Solid solution strengthening of the γ matrix is one key factor for improving the creep strength of single crystal nickel-base superalloys at high temperatures. Therefore a strong partitioning of solid solution hardening elements to the matrix is beneficial for high temperature creep strength. Different Rhenium-free alloys which are derived from CMSX-4 are investigated. The alloys have been characterized regarding microstructure, phase compositions as well as creep strength. It is found that increasing the Titanium (Ti) as well as the Tungsten (W) content causes a stronger partitioning of the solid solution strengtheners, in particular W, to the γ phase. As a result the creep resistance is significantly improved. Based on these ideas, a Rhenium-free alloy with an optimized chemistry regarding the partitioning behavior of W is developed and validated in the present study. It shows comparable creep strength to the Rhenium containing second generation alloy CMSX-4 in the high temperature / low stress creep regime and is less prone to the formation of deleterious topologically close packed (TCP) phases. This more effective usage of solid solution strengtheners can enhance the creep properties of nickel-base superalloys while reducing the content of strategic elements like Rhenium.

  16. Classification and Recursion Operators of Dark Burgers' Equation

    Science.gov (United States)

    Chen, Mei-Dan; Li, Biao

    2018-01-01

    With the help of symbolic computation, two types of complete scalar classification for dark Burgers' equations are derived by requiring the existence of higher order differential polynomial symmetries. There are some free parameters for every class of dark Burgers' systems; so some special equations including symmetry equation and dual symmetry equation are obtained by selecting the free parameter. Furthermore, two kinds of recursion operators for these dark Burgers' equations are constructed by two direct assumption methods.

  17. Structural damage diagnosis based on on-line recursive stochastic subspace identification

    International Nuclear Information System (INIS)

    Loh, Chin-Hsiung; Weng, Jian-Huang; Liu, Yi-Cheng; Lin, Pei-Yang; Huang, Shieh-Kung

    2011-01-01

    This paper presents a recursive stochastic subspace identification (RSSI) technique for on-line and almost real-time structural damage diagnosis using output-only measurements. Through RSSI the time-varying natural frequencies of a system can be identified. To reduce the computation time in conducting LQ decomposition in RSSI, the Givens rotation as well as the matrix operation appending a new data set are derived. The relationship between the size of the Hankel matrix and the data length in each shifting moving window is examined so as to extract the time-varying features of the system without loss of generality and to establish on-line and almost real-time system identification. The result from the RSSI technique can also be applied to structural damage diagnosis. Off-line data-driven stochastic subspace identification was used first to establish the system matrix from the measurements of an undamaged (reference) case. Then the RSSI technique incorporating a Kalman estimator is used to extract the dynamic characteristics of the system through continuous monitoring data. The predicted residual error is defined as a damage feature and through the outlier statistics provides an indicator of damage. Verification of the proposed identification algorithm by using the bridge scouring test data and white noise response data of a reinforced concrete frame structure is conducted

  18. (Non)local Hamiltonian and symplectic structures, recursions and hierarchies: a new approach and applications to the N = 1 supersymmetric KdV equation

    International Nuclear Information System (INIS)

    Kersten, P; Krasil'shchik, I; Verbovetsky, A

    2004-01-01

    Using methods of Kersten et al (2004 J. Geom. Phys. 50 273-302) and Krasil'shchik and Kersten (2000 Symmetries and Recursion Operators for Classical and Supersymmetric Differential Equations (Dordrecht: Kluwer)), we accomplish an extensive study of the N = 1 supersymmetric Korteweg-de Vries (KdV) equation. The results include a description of local and nonlocal Hamiltonian and symplectic structures, five hierarchies of symmetries, the corresponding hierarchies of conservation laws, recursion operators for symmetries and generating functions of conservation laws. We stress that the main point of the paper is not just the results on super-KdV equation itself, but merely exposition of the efficiency of the geometrical approach and of the computational algorithms based on it

  19. Polyacrylate–water partitioning of biocidal compounds: Enhancing the understanding of biocide partitioning between render and water

    DEFF Research Database (Denmark)

    Bollmann, Ulla E.; Ou, Yi; Mayer, Philipp

    2014-01-01

    -N-octylisothiazolinone). The correlation of the polyacrylate-water partition constants with the octanol-water partition constants is significant, but the polyacrylate-water partition constants were predominantly below octanol-water partition constants (Kow). The comparison with render-water distribution constants showed that estimating...

  20. New Recursive Representations for the Favard Constants with Application to Multiple Singular Integrals and Summation of Series

    Directory of Open Access Journals (Sweden)

    Snezhana Georgieva Gocheva-Ilieva

    2013-01-01

    Full Text Available There are obtained integral form and recurrence representations for some Fourier series and connected with them Favard constants. The method is based on preliminary integration of Fourier series which permits to establish general recursion formulas for Favard constants. This gives the opportunity for effective summation of infinite series and calculation of some classes of multiple singular integrals by the Favard constants.

  1. Sensitivity of break-flow-partition on the containment pressure and temperature

    International Nuclear Information System (INIS)

    Kwon, Young Min; Song, Jin Ho; Lee, Sang Yong

    1994-01-01

    For the case of RCS blowdown into the vapor region of a containment at low pressure, the blowdown mixture will start to boil at the containment pressure and liquid will separate from the flow near the break location. The flashed steam is added to the containment atmosphere and liquid is falled to the sump. Analytically, the break flow can be divided into steam and liquid in a number of ways. Discussed in this study is three partition models and Instantaneous Mixing(IM) Model employed in different containment analysis computer codes. IM model is employed in the CONTRANS code developed by ABB-CE for containment thermodynamic analysis. The various partition models were applied to the double ended discharge leg slot break (DEDLS) LOCA which is containment design base accident (CDBA) for Ulchin 3 and 4 PSAR. It was shown that IM model is the most conservative for containment design pressure analysis. Results of the CONTRANS analyses are compared with those of UCN PSAR for which CONTEMPT-LT code was used

  2. Partitioning of organochlorine pesticides from water to polyethylene passive samplers

    International Nuclear Information System (INIS)

    Hale, Sarah E.; Martin, Timothy J.; Goss, Kai-Uwe; Arp, Hans Peter H.; Werner, David

    2010-01-01

    The mass transfer rates and equilibrium partitioning behaviour of 14 diverse organochlorine pesticides (OCP) between water and polyethylene (PE) passive samplers, cut from custom made PE sheets and commercial polyethylene plastic bags, were quantified. Overall mass transfer coefficients, k O , estimated PE membrane diffusion coefficients, D PE , and PE-water partitioning coefficients, K PE-water, are reported. In addition, the partitioning of three polycyclic aromatic hydrocarbons (PAHs) from water to PE is quantified and compared with literature values. K PE-water values agreed mostly within a factor of two for both passive samplers and also with literature values for the reference PAHs. As PE is expected to exhibit similar sorption behaviour to long-chain alkanes, PE-water partitioning coefficients were compared to hexadecane-water partitioning coefficients estimated with the SPARC online calculator, COSMOtherm and a polyparameter linear free energy relationship based on the Abraham approach. The best correlation for all compounds tested was with COSMOtherm estimated hexadecane-water partitioning coefficients. - The partitioning of organochlorine pesticides between single phase polyethylene passive samplers and water is quantified.

  3. High Pressure/Temperature Metal Silicate Partitioning of Tungsten

    Science.gov (United States)

    Shofner, G. A.; Danielson, L.; Righter, K.; Campbell, A. J.

    2010-01-01

    The behavior of chemical elements during metal/silicate segregation and their resulting distribution in Earth's mantle and core provide insight into core formation processes. Experimental determination of partition coefficients allows calculations of element distributions that can be compared to accepted values of element abundances in the silicate (mantle) and metallic (core) portions of the Earth. Tungsten (W) is a moderately siderophile element and thus preferentially partitions into metal versus silicate under many planetary conditions. The partitioning behavior has been shown to vary with temperature, silicate composition, oxygen fugacity, and pressure. Most of the previous work on W partitioning has been conducted at 1-bar conditions or at relatively low pressures, i.e. pressure. Predictions based on extrapolation of existing data and parameterizations suggest an increased pressured dependence on metal/ silicate partitioning of W at higher pressures 5. However, the dependence on pressure is not as well constrained as T, fO2, and silicate composition. This poses a problem because proposed equilibration pressures for core formation range from 27 to 50 GPa, falling well outside the experimental range, therefore requiring exptrapolation of a parametereized model. Higher pressure data are needed to improve our understanding of W partitioning at these more extreme conditions.

  4. Efficient Partitioning of Large Databases without Query Statistics

    Directory of Open Access Journals (Sweden)

    Shahidul Islam KHAN

    2016-11-01

    Full Text Available An efficient way of improving the performance of a database management system is distributed processing. Distribution of data involves fragmentation or partitioning, replication, and allocation process. Previous research works provided partitioning based on empirical data about the type and frequency of the queries. These solutions are not suitable at the initial stage of a distributed database as query statistics are not available then. In this paper, I have presented a fragmentation technique, Matrix based Fragmentation (MMF, which can be applied at the initial stage as well as at later stages of distributed databases. Instead of using empirical data, I have developed a matrix, Modified Create, Read, Update and Delete (MCRUD, to partition a large database properly. Allocation of fragments is done simultaneously in my proposed technique. So using MMF, no additional complexity is added for allocating the fragments to the sites of a distributed database as fragmentation is synchronized with allocation. The performance of a DDBMS can be improved significantly by avoiding frequent remote access and high data transfer among the sites. Results show that proposed technique can solve the initial partitioning problem of large distributed databases.

  5. Recursions of Symmetry Orbits and Reduction without Reduction

    Directory of Open Access Journals (Sweden)

    Andrei A. Malykh

    2011-04-01

    Full Text Available We consider a four-dimensional PDE possessing partner symmetries mainly on the example of complex Monge-Ampère equation (CMA. We use simultaneously two pairs of symmetries related by a recursion relation, which are mutually complex conjugate for CMA. For both pairs of partner symmetries, using Lie equations, we introduce explicitly group parameters as additional variables, replacing symmetry characteristics and their complex conjugates by derivatives of the unknown with respect to group parameters. We study the resulting system of six equations in the eight-dimensional space, that includes CMA, four equations of the recursion between partner symmetries and one integrability condition of this system. We use point symmetries of this extended system for performing its symmetry reduction with respect to group parameters that facilitates solving the extended system. This procedure does not imply a reduction in the number of physical variables and hence we end up with orbits of non-invariant solutions of CMA, generated by one partner symmetry, not used in the reduction. These solutions are determined by six linear equations with constant coefficients in the five-dimensional space which are obtained by a three-dimensional Legendre transformation of the reduced extended system. We present algebraic and exponential examples of such solutions that govern Legendre-transformed Ricci-flat Kähler metrics with no Killing vectors. A similar procedure is briefly outlined for Husain equation.

  6. Anyonic partition functions and windings of planar Brownian motion

    International Nuclear Information System (INIS)

    Desbois, J.; Heinemann, C.; Ouvry, S.

    1995-01-01

    The computation of the N-cycle Brownian paths contribution F N (α) to the N-anyon partition function is addressed. A detailed numerical analysis based on a random walk on a lattice indicates that F N 0 (α)=product k=1 N-1 [1-(N/k)α]. In the paramount three-anyon case, one can show that F 3 (α) is built by linear states belonging to the bosonic, fermionic, and mixed representations of S 3

  7. Constructing ordinal partition transition networks from multivariate time series.

    Science.gov (United States)

    Zhang, Jiayang; Zhou, Jie; Tang, Ming; Guo, Heng; Small, Michael; Zou, Yong

    2017-08-10

    A growing number of algorithms have been proposed to map a scalar time series into ordinal partition transition networks. However, most observable phenomena in the empirical sciences are of a multivariate nature. We construct ordinal partition transition networks for multivariate time series. This approach yields weighted directed networks representing the pattern transition properties of time series in velocity space, which hence provides dynamic insights of the underling system. Furthermore, we propose a measure of entropy to characterize ordinal partition transition dynamics, which is sensitive to capturing the possible local geometric changes of phase space trajectories. We demonstrate the applicability of pattern transition networks to capture phase coherence to non-coherence transitions, and to characterize paths to phase synchronizations. Therefore, we conclude that the ordinal partition transition network approach provides complementary insight to the traditional symbolic analysis of nonlinear multivariate time series.

  8. Actinide partitioning-transmutation program final report. VII. Long-term risk analysis of the geologic repository

    International Nuclear Information System (INIS)

    Logan, S.E.; Conarty, R.L.; Ng, H.S.; Rahal, L.J.; Shirley, C.G.

    1980-09-01

    This report supports the overall assessment by Oak Ridge National Laboratory of actinide partitioning and transmutation by providing an analysis of the long-term risks associated with the terminal storage of wastes from a fuel cycle which incorporates partitioning and transmutation (P-T) and wastes from a cycle which does not. The system model and associated computer code, called AMRAW (Assessment Method for Radioactive Waste), are used for the analysis and are applied to the Los Medanos area in southeastern New Mexico. Because a conservative approach is used throughout, calculated results are believed to be consistently higher than reasonable expectations from actual disruptive incidents at the site and therefore are not directly suited for comparison with other analyses of the particular geologic location. The assessment is made with (1) the probabilistic, or risk, mode that uses combinations of reasonable possible release incidents with their probability of occurrence distributed and applied throughout the assessment period, and (2) the consequence mode that forces discrete release events to occur at specific times. An assessment period of 1 million years is used. The principal results are: (1) In all but the expulsive modes, 99 Tc and 129 I completely dominate cumulative effects based on their transport to man through leaching and movement with groundwater, effecting about 33,000 health effects (deaths) over the 1 million years; (2) P-T has only limited effectiveness in reducing long-term risk from a radionuclide waste repository under the conditions studied, and such effectiveness is essentially confined to the extremely unlikely (probability of occurrence 10 -12 /year) expulsive events; (3) Removal or immobilization of 99 Tc and 129 I might provide benefits sufficiently tangible to warrant special consideration

  9. Cross-validation and Peeling Strategies for Survival Bump Hunting using Recursive Peeling Methods

    Science.gov (United States)

    Dazard, Jean-Eudes; Choe, Michael; LeBlanc, Michael; Rao, J. Sunil

    2015-01-01

    We introduce a framework to build a survival/risk bump hunting model with a censored time-to-event response. Our Survival Bump Hunting (SBH) method is based on a recursive peeling procedure that uses a specific survival peeling criterion derived from non/semi-parametric statistics such as the hazards-ratio, the log-rank test or the Nelson--Aalen estimator. To optimize the tuning parameter of the model and validate it, we introduce an objective function based on survival or prediction-error statistics, such as the log-rank test and the concordance error rate. We also describe two alternative cross-validation techniques adapted to the joint task of decision-rule making by recursive peeling and survival estimation. Numerical analyses show the importance of replicated cross-validation and the differences between criteria and techniques in both low and high-dimensional settings. Although several non-parametric survival models exist, none addresses the problem of directly identifying local extrema. We show how SBH efficiently estimates extreme survival/risk subgroups unlike other models. This provides an insight into the behavior of commonly used models and suggests alternatives to be adopted in practice. Finally, our SBH framework was applied to a clinical dataset. In it, we identified subsets of patients characterized by clinical and demographic covariates with a distinct extreme survival outcome, for which tailored medical interventions could be made. An R package PRIMsrc (Patient Rule Induction Method in Survival, Regression and Classification settings) is available on CRAN (Comprehensive R Archive Network) and GitHub. PMID:27034730

  10. The French partitioning-transmutation programme, assets and prospects

    International Nuclear Information System (INIS)

    Viala, M.; Salvatores, M.; Mouney, H.

    1997-01-01

    Partitioning-transmutation studies are covered by the 1991 French law concerning radioactive waste management. The programme is progressing with a dual approach: - What can be done in partitioning-transmutation? At what cost? In what timescale? - How can long-term gains and short-term disadvantages be qualified and quantified? The first approach concerns technical know-how. The studies based on today's technologies are continuing (reactors, fuels and targets, separation of radionuclides by solvents). The second approach involves an assessment activity, based firstly on studies of scenarios. Pertinent assessment criteria must be brought out. (authors)

  11. Exact partition functions for deformed N=2 theories with N{sub f}=4 flavours

    Energy Technology Data Exchange (ETDEWEB)

    Beccaria, Matteo; Fachechi, Alberto; Macorini, Guido; Martina, Luigi [Dipartimento di Matematica e Fisica Ennio De Giorgi, Università del Salento,Via Arnesano, 73100 Lecce (Italy); INFN, Via Arnesano, 73100 Lecce (Italy)

    2016-12-07

    We consider the Ω-deformed N=2SU(2) gauge theory in four dimensions with N{sub f}=4 massive fundamental hypermultiplets. The low energy effective action depends on the deformation parameters ε{sub 1},ε{sub 2}, the scalar field expectation value a, and the hypermultiplet masses m=(m{sub 1},m{sub 2},m{sub 3},m{sub 4}). Motivated by recent findings in the N=2{sup ∗} theory, we explore the theories that are characterized by special fixed ratios ε{sub 2}/ε{sub 1} and m/ε{sub 1} and propose a simple condition on the structure of the multi-instanton contributions to the prepotential determining the effective action. This condition determines a finite set Π{sub N} of special points such that the prepotential has N poles at fixed positions independent on the instanton number. In analogy with what happens in the N=2{sup ∗} gauge theory, the full prepotential of the Π{sub N} theories may be given in closed form as an explicit function of a and the modular parameter q appearing in special combinations of Eisenstein series and Jacobi theta functions with well defined modular properties. The resulting finite pole partition functions are related by AGT correspondence to special 4-point spherical conformal blocks of the Virasoro algebra. We examine in full details special cases where the closed expression of the block is known and confirms our Ansatz. We systematically study the special features of Zamolodchikov’s recursion for the Π{sub N} conformal blocks. As a result, we provide a novel effective recursion relation that can be exactly solved and allows to prove the conjectured closed expressions analytically in the case of the Π{sub 1} and Π{sub 2} conformal blocks.

  12. WKB solutions of difference equations and reconstruction by the topological recursion

    Science.gov (United States)

    Marchal, Olivier

    2018-01-01

    The purpose of this article is to analyze the connection between Eynard-Orantin topological recursion and formal WKB solutions of a \\hbar -difference equation: \\Psi(x+\\hbar)=≤ft(e\\hbar\\fracd{dx}\\right) \\Psi(x)=L(x;\\hbar)\\Psi(x) with L(x;\\hbar)\\in GL_2( ({C}(x))[\\hbar]) . In particular, we extend the notion of determinantal formulas and topological type property proposed for formal WKB solutions of \\hbar -differential systems to this setting. We apply our results to a specific \\hbar -difference system associated to the quantum curve of the Gromov-Witten invariants of {P}1 for which we are able to prove that the correlation functions are reconstructed from the Eynard-Orantin differentials computed from the topological recursion applied to the spectral curve y=\\cosh-1\\frac{x}{2} . Finally, identifying the large x expansion of the correlation functions, proves a recent conjecture made by Dubrovin and Yang regarding a new generating series for Gromov-Witten invariants of {P}1 .

  13. Nonlinear Principal Component Analysis Using Strong Tracking Filter

    Institute of Scientific and Technical Information of China (English)

    2007-01-01

    The paper analyzes the problem of blind source separation (BSS) based on the nonlinear principal component analysis (NPCA) criterion. An adaptive strong tracking filter (STF) based algorithm was developed, which is immune to system model mismatches. Simulations demonstrate that the algorithm converges quickly and has satisfactory steady-state accuracy. The Kalman filtering algorithm and the recursive leastsquares type algorithm are shown to be special cases of the STF algorithm. Since the forgetting factor is adaptively updated by adjustment of the Kalman gain, the STF scheme provides more powerful tracking capability than the Kalman filtering algorithm and recursive least-squares algorithm.

  14. Temperature dependence of the particle/gas partition coefficient: An application to predict indoor gas-phase concentrations of semi-volatile organic compounds

    Energy Technology Data Exchange (ETDEWEB)

    Wei, Wenjuan, E-mail: Wenjuan.Wei@cstb.fr [University of Paris-Est, Scientific and Technical Center for Building (CSTB), Health and Comfort Department, French Indoor Air Quality Observatory (OQAI), 84 Avenue Jean Jaurès, Champs sur Marne, 77447 Marne la Vallée Cedex 2 (France); Mandin, Corinne [University of Paris-Est, Scientific and Technical Center for Building (CSTB), Health and Comfort Department, French Indoor Air Quality Observatory (OQAI), 84 Avenue Jean Jaurès, Champs sur Marne, 77447 Marne la Vallée Cedex 2 (France); INSERM-U1085, Irset-Research Institute for Environmental and Occupational Health, Rennes (France); LERES-Environment and Health Research Laboratory (Irset and EHESP Technologic Platform), Rennes (France); Blanchard, Olivier [EHESP-School of Public Health, Sorbonne Paris Cité, Rennes (France); INSERM-U1085, Irset-Research Institute for Environmental and Occupational Health, Rennes (France); Mercier, Fabien [EHESP-School of Public Health, Sorbonne Paris Cité, Rennes (France); LERES-Environment and Health Research Laboratory (Irset and EHESP Technologic Platform), Rennes (France); INSERM-U1085, Irset-Research Institute for Environmental and Occupational Health, Rennes (France); Pelletier, Maud [EHESP-School of Public Health, Sorbonne Paris Cité, Rennes (France); INSERM-U1085, Irset-Research Institute for Environmental and Occupational Health, Rennes (France); Le Bot, Barbara [EHESP-School of Public Health, Sorbonne Paris Cité, Rennes (France); LERES-Environment and Health Research Laboratory (Irset and EHESP Technologic Platform), Rennes (France); INSERM-U1085, Irset-Research Institute for Environmental and Occupational Health, Rennes (France); and others

    2016-09-01

    The indoor gas-phase concentrations of semi-volatile organic compounds (SVOCs) can be predicted from their respective concentrations in airborne particles by applying the particle/gas partitioning equilibrium. The temperature used for partitioning is often set to 25 °C. However, indoor temperatures frequently differ from this reference value. This assumption may result in errors in the predicted equilibrium gas-phase SVOC concentrations. To improve the prediction model, the temperature dependence of the particle/gas partition coefficient must be addressed. In this paper, a theoretical relationship between the particle/gas partition coefficient and temperature was developed based on the SVOC absorptive mechanism. The SVOC particle/gas partition coefficients predicted by employing the derived theoretical relationship agree well with the experimental data retrieved from the literature (R > 0.93). The influence of temperature on the equilibrium gas-phase SVOC concentration was quantified by a dimensionless analysis of the derived relationship between the SVOC particle/gas partition coefficient and temperature. The predicted equilibrium gas-phase SVOC concentration decreased by between 31% and 53% when the temperature was lowered by 6 °C, while it increased by up to 750% when the indoor temperature increased from 15 °C to 30 °C. - Highlights: • A theoretical relationship between K{sub p} and temperature was developed. • The relationship was based on the SVOC absorptive mechanism. • The temperature impact was quantified by a dimensionless analysis.

  15. Real time damage detection using recursive principal components and time varying auto-regressive modeling

    Science.gov (United States)

    Krishnan, M.; Bhowmik, B.; Hazra, B.; Pakrashi, V.

    2018-02-01

    In this paper, a novel baseline free approach for continuous online damage detection of multi degree of freedom vibrating structures using Recursive Principal Component Analysis (RPCA) in conjunction with Time Varying Auto-Regressive Modeling (TVAR) is proposed. In this method, the acceleration data is used to obtain recursive proper orthogonal components online using rank-one perturbation method, followed by TVAR modeling of the first transformed response, to detect the change in the dynamic behavior of the vibrating system from its pristine state to contiguous linear/non-linear-states that indicate damage. Most of the works available in the literature deal with algorithms that require windowing of the gathered data owing to their data-driven nature which renders them ineffective for online implementation. Algorithms focussed on mathematically consistent recursive techniques in a rigorous theoretical framework of structural damage detection is missing, which motivates the development of the present framework that is amenable for online implementation which could be utilized along with suite experimental and numerical investigations. The RPCA algorithm iterates the eigenvector and eigenvalue estimates for sample covariance matrices and new data point at each successive time instants, using the rank-one perturbation method. TVAR modeling on the principal component explaining maximum variance is utilized and the damage is identified by tracking the TVAR coefficients. This eliminates the need for offline post processing and facilitates online damage detection especially when applied to streaming data without requiring any baseline data. Numerical simulations performed on a 5-dof nonlinear system under white noise excitation and El Centro (also known as 1940 Imperial Valley earthquake) excitation, for different damage scenarios, demonstrate the robustness of the proposed algorithm. The method is further validated on results obtained from case studies involving

  16. Using Recursive Regression to Explore Nonlinear Relationships and Interactions: A Tutorial Applied to a Multicultural Education Study

    Directory of Open Access Journals (Sweden)

    Kenneth David Strang

    2009-03-01

    Full Text Available This paper discusses how a seldom-used statistical procedure, recursive regression (RR, can numerically and graphically illustrate data-driven nonlinear relationships and interaction of variables. This routine falls into the family of exploratory techniques, yet a few interesting features make it a valuable compliment to factor analysis and multiple linear regression for method triangulation. By comparison, nonlinear cluster analysis also generates graphical dendrograms to visually depict relationships, but RR (as implemented here uses multiple combinations of nominal and interval predictors regressed on a categorical or ratio dependent variable. In similar fashion, multidimensional scaling, multiple discriminant analysis and conjoint analysis are constrained at best to predicting an ordinal dependent variable (as currently implemented in popular software. A flexible capability of RR (again as implemented here is the transformation of factor data (for substituting codes. One powerful RR feature is the ability to treat missing data as a theoretically important predictor value (useful for survey questions that respondents do not wish to answer. For practitioners, the paper summarizes how this technique fits within the generally-accepted statistical methods. Popular software such as SPSS, SAS or LISREL can be used, while sample data can be imported in common formats including ASCII text, comma delimited, Excel XLS, and SPSS SAV. A tutorial approach is applied here using RR in LISREL. The tutorial leverages a partial sample from a study that used recursive regression to predict grades from international student learning styles. Some tutorial portions are technical, to improve the ambiguous RR literature.

  17. COMPUTING VERTICES OF INTEGER PARTITION POLYTOPES

    Directory of Open Access Journals (Sweden)

    A. S. Vroublevski

    2015-01-01

    Full Text Available The paper describes a method of generating vertices of the polytopes of integer partitions that was used by the authors to calculate all vertices and support vertices of the partition polytopes for all n ≤ 105 and all knapsack partitions of n ≤ 165. The method avoids generating all partitions of n. The vertices are determined with the help of sufficient and necessary conditions; in the hard cases, the well-known program Polymake is used. Some computational aspects are exposed in more detail. These are the algorithm for checking the criterion that characterizes partitions that are convex combinations of two other partitions; the way of using two combinatorial operations that transform the known vertices to the new ones; and employing the Polymake to recognize a limited number (for small n of partitions that need three or more other partitions for being convexly expressed. We discuss the computational results on the numbers of vertices and support vertices of the partition polytopes and some appealing problems these results give rise to.

  18. Source localization using recursively applied and projected (RAP) MUSIC

    Energy Technology Data Exchange (ETDEWEB)

    Mosher, J.C. [Los Alamos National Lab., NM (United States); Leahy, R.M. [Univ. of Southern California, Los Angeles, CA (United States). Signal and Image Processing Inst.

    1998-03-01

    A new method for source localization is described that is based on a modification of the well known multiple signal classification (MUSIC) algorithm. In classical MUSIC, the array manifold vector is projected onto an estimate of the signal subspace, but errors in the estimate can make location of multiple sources difficult. Recursively applied and projected (RAP) MUSIC uses each successively located source to form an intermediate array gain matrix, and projects both the array manifold and the signal subspace estimate into its orthogonal complement. The MUSIC projection is then performed in this reduced subspace. Using the metric of principal angles, the authors describe a general form of the RAP-MUSIC algorithm for the case of diversely polarized sources. Through a uniform linear array simulation, the authors demonstrate the improved Monte Carlo performance of RAP-MUSIC relative to MUSIC and two other sequential subspace methods, S and IES-MUSIC.

  19. Recursion relations for the overlap of a Morse continuum state with a Lanczos basis state

    International Nuclear Information System (INIS)

    Lutrus, C.K.; Suck Salk, S.H.

    1988-01-01

    In the resonant reactive scattering theory of Mundel, Berman, and Domcke [Phys. Rev. A 32, 181 (1985)], the overlap of a Morse continuum state and a Lanczos basis state appears in the expression of transition amplitude. In their study, recursion relations for Green's functions in the Lanczos basis were used for computational efficiency. In this paper we derive new recursion relations specifically for the evaluation of overlap between the Morse continuum wave and Lanczos basis state that appears in the transition amplitude of resonant scattering. They are found to be simple to use with great accuracy

  20. Managing Network Partitions in Structured P2P Networks

    Science.gov (United States)

    Shafaat, Tallat M.; Ghodsi, Ali; Haridi, Seif

    Structured overlay networks form a major class of peer-to-peer systems, which are touted for their abilities to scale, tolerate failures, and self-manage. Any long-lived Internet-scale distributed system is destined to face network partitions. Consequently, the problem of network partitions and mergers is highly related to fault-tolerance and self-management in large-scale systems. This makes it a crucial requirement for building any structured peer-to-peer systems to be resilient to network partitions. Although the problem of network partitions and mergers is highly related to fault-tolerance and self-management in large-scale systems, it has hardly been studied in the context of structured peer-to-peer systems. Structured overlays have mainly been studied under churn (frequent joins/failures), which as a side effect solves the problem of network partitions, as it is similar to massive node failures. Yet, the crucial aspect of network mergers has been ignored. In fact, it has been claimed that ring-based structured overlay networks, which constitute the majority of the structured overlays, are intrinsically ill-suited for merging rings. In this chapter, we motivate the problem of network partitions and mergers in structured overlays. We discuss how a structured overlay can automatically detect a network partition and merger. We present an algorithm for merging multiple similar ring-based overlays when the underlying network merges. We examine the solution in dynamic conditions, showing how our solution is resilient to churn during the merger, something widely believed to be difficult or impossible. We evaluate the algorithm for various scenarios and show that even when falsely detecting a merger, the algorithm quickly terminates and does not clutter the network with many messages. The algorithm is flexible as the tradeoff between message complexity and time complexity can be adjusted by a parameter.

  1. Evaluation of the performance and limitations of empirical partition-relations and process based multisurface models to predict trace element solubility in soils

    Energy Technology Data Exchange (ETDEWEB)

    Groenenberg, J.E.; Bonten, L.T.C. [Alterra, Wageningen UR, P.O. Box 47, 6700 AA Wageningen (Netherlands); Dijkstra, J.J. [Energy research Centre of the Netherlands ECN, P.O. Box 1, 1755 ZG Petten (Netherlands); De Vries, W. [Department of Environmental Systems Analysis, Wageningen University, Wageningen UR, P.O. Box 47, 6700 AA Wageningen (Netherlands); Comans, R.N.J. [Department of Soil Quality, Wageningen University, Wageningen UR, P.O. Box 47, 6700 AA Wageningen (Netherlands)

    2012-07-15

    Here we evaluate the performance and limitations of two frequently used model-types to predict trace element solubility in soils: regression based 'partition-relations' and thermodynamically based 'multisurface models', for a large set of elements. For this purpose partition-relations were derived for As, Ba, Cd, Co, Cr, Cu, Mo, Ni, Pb, Sb, Se, V, Zn. The multi-surface model included aqueous speciation, mineral equilibria, sorption to organic matter, Fe/Al-(hydr)oxides and clay. Both approaches were evaluated by their application to independent data for a wide variety of conditions. We conclude that Freundlich-based partition-relations are robust predictors for most cations and can be used for independent soils, but within the environmental conditions of the data used for their derivation. The multisurface model is shown to be able to successfully predict solution concentrations over a wide range of conditions. Predicted trends for oxy-anions agree well for both approaches but with larger (random) deviations than for cations.

  2. Uncertain Henry's law constants compromise equilibrium partitioning calculations of atmospheric oxidation products

    Directory of Open Access Journals (Sweden)

    C. Wang

    2017-06-01

    Full Text Available Gas–particle partitioning governs the distribution, removal, and transport of organic compounds in the atmosphere and the formation of secondary organic aerosol (SOA. The large variety of atmospheric species and their wide range of properties make predicting this partitioning equilibrium challenging. Here we expand on earlier work and predict gas–organic and gas–aqueous phase partitioning coefficients for 3414 atmospherically relevant molecules using COSMOtherm, SPARC Performs Automated Reasoning in Chemistry (SPARC, and poly-parameter linear free-energy relationships. The Master Chemical Mechanism generated the structures by oxidizing primary emitted volatile organic compounds. Predictions for gas–organic phase partitioning coefficients (KWIOM/G by different methods are on average within 1 order of magnitude of each other, irrespective of the numbers of functional groups, except for predictions by COSMOtherm and SPARC for compounds with more than three functional groups, which have a slightly higher discrepancy. Discrepancies between predictions of gas–aqueous partitioning (KW/G are much larger and increase with the number of functional groups in the molecule. In particular, COSMOtherm often predicts much lower KW/G for highly functionalized compounds than the other methods. While the quantum-chemistry-based COSMOtherm accounts for the influence of intra-molecular interactions on conformation, highly functionalized molecules likely fall outside of the applicability domain of the other techniques, which at least in part rely on empirical data for calibration. Further analysis suggests that atmospheric phase distribution calculations are sensitive to the partitioning coefficient estimation method, in particular to the estimated value of KW/G. The large uncertainty in KW/G predictions for highly functionalized organic compounds needs to be resolved to improve the quantitative treatment of SOA formation.

  3. A New Power System Restoration Technique based on WAMS Partitioning

    Directory of Open Access Journals (Sweden)

    N. V. Phanendra Babu

    2017-08-01

    Full Text Available An important feature of a Wide-Area Measurement System (WAMS is the ability to recover data during a communication failure. This paper presents a novel scheme of partitioning a PMU installed power network into a number of WAMS regions in order to make the power system restoration process simpler. This algorithm also proposes the optimal placement of Phasor Data Concentrators (PDCs in each region to record the data from PMUs. This paper considers the restoration constraints like transformer equivalent bus, generation-load balance and the observability of region for the partitioning of power system. The proposed scheme is demonstrated with an IEEE-30 bus system. It is then applied on IEEE-39, IEEE-118 bus systems and on a Northern Regional Grid of the Indian Power Grid.

  4. Recursive estimation of the parts production process quality indicator

    Directory of Open Access Journals (Sweden)

    Filipovich Oleg

    2017-01-01

    Full Text Available Consideration is given to a mathematical representation for manufacturing of batch parts on a metal-cutting machine tool. Linear dimensions of machined parts are assumed to be the major quality indicator, deviation from these dimensions is determined by size setting of machine tool and ensemble of random factors. It is allowed to have absolutely precise pre-setting of machine tool, effects from setup level offsetting due to deformation in process equipment on the specified indicator are disregarded. Consideration is given to factors which affect the tool wear, with two definitions of tool wear being provided. Reasons for development of random error in processing, dependence of measurement results on error as well as distribution laws and some parameters of random values are provided. To evaluate deviation of size setting value in each cycle, it is proposed to apply a recursive algorithm in description of investigated dynamic discrete process in the space state. Kalman filter equations are used in description of process model by means of first-order difference equations. The algorithm of recursive estimation is implemented in the mathematical software Maple. Simulation results which prove effectiveness of algorithm application to investigate the given dynamic system are provided. Variants of algorithm application and opportunities of further research are proposed.

  5. Multiple Attribute Group Decision-Making Methods Based on Trapezoidal Fuzzy Two-Dimensional Linguistic Partitioned Bonferroni Mean Aggregation Operators.

    Science.gov (United States)

    Yin, Kedong; Yang, Benshuo; Li, Xuemei

    2018-01-24

    In this paper, we investigate multiple attribute group decision making (MAGDM) problems where decision makers represent their evaluation of alternatives by trapezoidal fuzzy two-dimensional uncertain linguistic variable. To begin with, we introduce the definition, properties, expectation, operational laws of trapezoidal fuzzy two-dimensional linguistic information. Then, to improve the accuracy of decision making in some case where there are a sort of interrelationship among the attributes, we analyze partition Bonferroni mean (PBM) operator in trapezoidal fuzzy two-dimensional variable environment and develop two operators: trapezoidal fuzzy two-dimensional linguistic partitioned Bonferroni mean (TF2DLPBM) aggregation operator and trapezoidal fuzzy two-dimensional linguistic weighted partitioned Bonferroni mean (TF2DLWPBM) aggregation operator. Furthermore, we develop a novel method to solve MAGDM problems based on TF2DLWPBM aggregation operator. Finally, a practical example is presented to illustrate the effectiveness of this method and analyses the impact of different parameters on the results of decision-making.

  6. Ionization constants by curve fitting: determination of partition and distribution coefficients of acids and bases and their ions.

    Science.gov (United States)

    Clarke, F H; Cahoon, N M

    1987-08-01

    A convenient procedure has been developed for the determination of partition and distribution coefficients. The method involves the potentiometric titration of the compound, first in water and then in a rapidly stirred mixture of water and octanol. An automatic titrator is used, and the data is collected and analyzed by curve fitting on a microcomputer with 64 K of memory. The method is rapid and accurate for compounds with pKa values between 4 and 10. Partition coefficients can be measured for monoprotic and diprotic acids and bases. The partition coefficients of the neutral compound and its ion(s) can be determined by varying the ratio of octanol to water. Distribution coefficients calculated over a wide range of pH values are presented graphically as "distribution profiles". It is shown that subtraction of the titration curve of solvent alone from that of the compound in the solvent offers advantages for pKa determination by curve fitting for compounds of low aqueous solubility.

  7. Major depressive disorder subtypes to predict long-term course

    Science.gov (United States)

    van Loo, Hanna M.; Cai, Tianxi; Gruber, Michael J.; Li, Junlong; de Jonge, Peter; Petukhova, Maria; Rose, Sherri; Sampson, Nancy A.; Schoevers, Robert A.; Wardenaar, Klaas J.; Wilcox, Marsha A.; Al-Hamzawi, Ali Obaid; Andrade, Laura Helena; Bromet, Evelyn J.; Bunting, Brendan; Fayyad, John; Florescu, Silvia E.; Gureje, Oye; Hu, Chiyi; Huang, Yueqin; Levinson, Daphna; Medina-Mora, Maria Elena; Nakane, Yoshibumi; Posada-Villa, Jose; Scott, Kate M.; Xavier, Miguel; Zarkov, Zahari; Kessler, Ronald C.

    2016-01-01

    Background Variation in course of major depressive disorder (MDD) is not strongly predicted by existing subtype distinctions. A new subtyping approach is considered here. Methods Two data mining techniques, ensemble recursive partitioning and Lasso generalized linear models (GLMs) followed by k-means cluster analysis, are used to search for subtypes based on index episode symptoms predicting subsequent MDD course in the World Mental Health (WMH) Surveys. The WMH surveys are community surveys in 16 countries. Lifetime DSM-IV MDD was reported by 8,261 respondents. Retrospectively reported outcomes included measures of persistence (number of years with an episode; number of with an episode lasting most of the year) and severity (hospitalization for MDD; disability due to MDD). Results Recursive partitioning found significant clusters defined by the conjunctions of early onset, suicidality, and anxiety (irritability, panic, nervousness-worry-anxiety) during the index episode. GLMs found additional associations involving a number of individual symptoms. Predicted values of the four outcomes were strongly correlated. Cluster analysis of these predicted values found three clusters having consistently high, intermediate, or low predicted scores across all outcomes. The high-risk cluster (30.0% of respondents) accounted for 52.9-69.7% of high persistence and severity and was most strongly predicted by index episode severe dysphoria, suicidality, anxiety, and early onset. A total symptom count, in comparison, was not a significant predictor. Conclusions Despite being based on retrospective reports, results suggest that useful MDD subtyping distinctions can be made using data mining methods. Further studies are needed to test and expand these results with prospective data. PMID:24425049

  8. Application of CalME incremental-recursive method to the evaluation of the structural condition as asphalt pavements

    International Nuclear Information System (INIS)

    Mateos Moreno, A.; Perez Ayuso, J.; Cadavid Jauregui, B.; Marron Fernandez, J. O.

    2011-01-01

    CalME procedure represents one of the most advanced tools for the design, of flexible pavements world-wide. IT is an incremental-recursive method, which means that pavements service life must be divided into many time intervals where both structural integrity and environmental conditions can be regarded as constants. It also means that the damage calculated at the end of each interval must be considered as initial condition for the next one. The goal of this type of models is the prediction of the evolution of the different distress mechanisms. The advantages of incremental-recursive procedures versus classical analytical design are shown in this paper. Advantages are shown not only in terms of design, but also as a tool in order to support structural evaluation. In particular, the potential of asphalt fatigue model incorporated in CalME is presented. this model is initially calibrated in the laboratory, and it is then re-calibrated based on the actual performance observed from field deflection testing. The model provides a reliable prediction of the future evolution of the damage of the asphalt mixture. Fatigue model validation has been conducted based on the performance from several flexible sections evaluated in CEDEX full-scale pavements test track. (Author) 14 refs.

  9. Recognition of building group patterns in topographic maps based on graph partitioning and random forest

    Science.gov (United States)

    He, Xianjin; Zhang, Xinchang; Xin, Qinchuan

    2018-02-01

    Recognition of building group patterns (i.e., the arrangement and form exhibited by a collection of buildings at a given mapping scale) is important to the understanding and modeling of geographic space and is hence essential to a wide range of downstream applications such as map generalization. Most of the existing methods develop rigid rules based on the topographic relationships between building pairs to identify building group patterns and thus their applications are often limited. This study proposes a method to identify a variety of building group patterns that allow for map generalization. The method first identifies building group patterns from potential building clusters based on a machine-learning algorithm and further partitions the building clusters with no recognized patterns based on the graph partitioning method. The proposed method is applied to the datasets of three cities that are representative of the complex urban environment in Southern China. Assessment of the results based on the reference data suggests that the proposed method is able to recognize both regular (e.g., the collinear, curvilinear, and rectangular patterns) and irregular (e.g., the L-shaped, H-shaped, and high-density patterns) building group patterns well, given that the correctness values are consistently nearly 90% and the completeness values are all above 91% for three study areas. The proposed method shows promises in automated recognition of building group patterns that allows for map generalization.

  10. Grouped fuzzy SVM with EM-based partition of sample space for clustered microcalcification detection.

    Science.gov (United States)

    Wang, Huiya; Feng, Jun; Wang, Hongyu

    2017-07-20

    Detection of clustered microcalcification (MC) from mammograms plays essential roles in computer-aided diagnosis for early stage breast cancer. To tackle problems associated with the diversity of data structures of MC lesions and the variability of normal breast tissues, multi-pattern sample space learning is required. In this paper, a novel grouped fuzzy Support Vector Machine (SVM) algorithm with sample space partition based on Expectation-Maximization (EM) (called G-FSVM) is proposed for clustered MC detection. The diversified pattern of training data is partitioned into several groups based on EM algorithm. Then a series of fuzzy SVM are integrated for classification with each group of samples from the MC lesions and normal breast tissues. From DDSM database, a total of 1,064 suspicious regions are selected from 239 mammography, and the measurement of Accuracy, True Positive Rate (TPR), False Positive Rate (FPR) and EVL = TPR* 1-FPR are 0.82, 0.78, 0.14 and 0.72, respectively. The proposed method incorporates the merits of fuzzy SVM and multi-pattern sample space learning, decomposing the MC detection problem into serial simple two-class classification. Experimental results from synthetic data and DDSM database demonstrate that our integrated classification framework reduces the false positive rate significantly while maintaining the true positive rate.

  11. The prediction of blood-tissue partitions, water-skin partitions and skin permeation for agrochemicals.

    Science.gov (United States)

    Abraham, Michael H; Gola, Joelle M R; Ibrahim, Adam; Acree, William E; Liu, Xiangli

    2014-07-01

    There is considerable interest in the blood-tissue distribution of agrochemicals, and a number of researchers have developed experimental methods for in vitro distribution. These methods involve the determination of saline-blood and saline-tissue partitions; not only are they indirect, but they do not yield the required in vivo distribution. The authors set out equations for gas-tissue and blood-tissue distribution, for partition from water into skin and for permeation from water through human skin. Together with Abraham descriptors for the agrochemicals, these equations can be used to predict values for all of these processes. The present predictions compare favourably with experimental in vivo blood-tissue distribution where available. The predictions require no more than simple arithmetic. The present method represents a much easier and much more economic way of estimating blood-tissue partitions than the method that uses saline-blood and saline-tissue partitions. It has the added advantages of yielding the required in vivo partitions and being easily extended to the prediction of partition of agrochemicals from water into skin and permeation from water through skin. © 2013 Society of Chemical Industry.

  12. Partitioning and transmutation. Annual Report 1997

    Energy Technology Data Exchange (ETDEWEB)

    Enarsson, Aa; Landgren, A; Liljenzin, J O; Skaalberg, M; Spjuth, L [Chalmers Univ. of Technology, Goeteborg (Sweden). Dept. of Nuclear Chemistry

    1997-12-01

    The current research project on partitioning and transmutation at the Dept. of Nuclear Chemistry, CTH, has the primary objective to investigate separation processes useful in connection with transmutation of long-lived radionuclides in high level nuclear waste. Partitioning is necessary in order to recover and purify the elements before and after each irradiation in a P and T treatment. In order to achieve a high transmutation efficiency the chemical separation process used must have small losses to various waste streams. At present, only aqueous based separation processes are known to be able to achieve the high recovery and separation efficiencies necessary for a useful P and T process. Refs, figs, tabs.

  13. Achieving numerical accuracy and high performance using recursive tile LU factorization with partial pivoting

    KAUST Repository

    Dongarra, Jack

    2013-09-18

    The LU factorization is an important numerical algorithm for solving systems of linear equations in science and engineering and is a characteristic of many dense linear algebra computations. For example, it has become the de facto numerical algorithm implemented within the LINPACK benchmark to rank the most powerful supercomputers in the world, collected by the TOP500 website. Multicore processors continue to present challenges to the development of fast and robust numerical software due to the increasing levels of hardware parallelism and widening gap between core and memory speeds. In this context, the difficulty in developing new algorithms for the scientific community resides in the combination of two goals: achieving high performance while maintaining the accuracy of the numerical algorithm. This paper proposes a new approach for computing the LU factorization in parallel on multicore architectures, which not only improves the overall performance but also sustains the numerical quality of the standard LU factorization algorithm with partial pivoting. While the update of the trailing submatrix is computationally intensive and highly parallel, the inherently problematic portion of the LU factorization is the panel factorization due to its memory-bound characteristic as well as the atomicity of selecting the appropriate pivots. Our approach uses a parallel fine-grained recursive formulation of the panel factorization step and implements the update of the trailing submatrix with the tile algorithm. Based on conflict-free partitioning of the data and lockless synchronization mechanisms, our implementation lets the overall computation flow naturally without contention. The dynamic runtime system called QUARK is then able to schedule tasks with heterogeneous granularities and to transparently introduce algorithmic lookahead. The performance results of our implementation are competitive compared to the currently available software packages and libraries. For example

  14. Achieving numerical accuracy and high performance using recursive tile LU factorization with partial pivoting

    KAUST Repository

    Dongarra, Jack; Faverge, Mathieu; Ltaief, Hatem; Luszczek, Piotr R.

    2013-01-01

    The LU factorization is an important numerical algorithm for solving systems of linear equations in science and engineering and is a characteristic of many dense linear algebra computations. For example, it has become the de facto numerical algorithm implemented within the LINPACK benchmark to rank the most powerful supercomputers in the world, collected by the TOP500 website. Multicore processors continue to present challenges to the development of fast and robust numerical software due to the increasing levels of hardware parallelism and widening gap between core and memory speeds. In this context, the difficulty in developing new algorithms for the scientific community resides in the combination of two goals: achieving high performance while maintaining the accuracy of the numerical algorithm. This paper proposes a new approach for computing the LU factorization in parallel on multicore architectures, which not only improves the overall performance but also sustains the numerical quality of the standard LU factorization algorithm with partial pivoting. While the update of the trailing submatrix is computationally intensive and highly parallel, the inherently problematic portion of the LU factorization is the panel factorization due to its memory-bound characteristic as well as the atomicity of selecting the appropriate pivots. Our approach uses a parallel fine-grained recursive formulation of the panel factorization step and implements the update of the trailing submatrix with the tile algorithm. Based on conflict-free partitioning of the data and lockless synchronization mechanisms, our implementation lets the overall computation flow naturally without contention. The dynamic runtime system called QUARK is then able to schedule tasks with heterogeneous granularities and to transparently introduce algorithmic lookahead. The performance results of our implementation are competitive compared to the currently available software packages and libraries. For example

  15. Functional community analysis of brain: a new approach for EEG-based investigation of the brain pathology.

    Science.gov (United States)

    Ahmadlou, Mehran; Adeli, Hojjat

    2011-09-15

    Analysis of structure of the brain functional connectivity (SBFC) is a fundamental issue for understanding of the brain cognition as well as the pathology of brain disorders. Analysis of communities among sub-parts of a system is increasingly used for social, ecological, and other networks. This paper presents a new methodology for investigation of the SBFC and understanding of the brain based on graph theory and community pattern analysis of functional connectivity graph of the brain obtained from encephalograms (EEGs). The methodology consists of three main parts: fuzzy synchronization likelihood (FSL), community partitioning, and decisions based on partitions. As an example application, the methodology is applied to analysis of brain of patients with attention deficit/hyperactivity disorder (ADHD) and the problem of discrimination of ADHD EEGs from healthy (non-ADHD) EEGs. Copyright © 2011. Published by Elsevier Inc.

  16. Pathway-based Analysis of the Hidden Genetic Heterogeneities in Cancers

    Directory of Open Access Journals (Sweden)

    Xiaolei Zhao

    2014-02-01

    Full Text Available Many cancers apparently showing similar phenotypes are actually distinct at the molecular level, leading to very different responses to the same treatment. It has been recently demonstrated that pathway-based approaches are robust and reliable for genetic analysis of cancers. Nevertheless, it remains unclear whether such function-based approaches are useful in deciphering molecular heterogeneities in cancers. Therefore, we aimed to test this possibility in the present study. First, we used a NCI60 dataset to validate the ability of pathways to correctly partition samples. Next, we applied the proposed method to identify the hidden subtypes in diffuse large B-cell lymphoma (DLBCL. Finally, the clinical significance of the identified subtypes was verified using survival analysis. For the NCI60 dataset, we achieved highly accurate partitions that best fit the clinical cancer phenotypes. Subsequently, for a DLBCL dataset, we identified three hidden subtypes that showed very different 10-year overall survival rates (90%, 46% and 20% and were highly significantly (P = 0.008 correlated with the clinical survival rate. This study demonstrated that the pathway-based approach is promising for unveiling genetic heterogeneities in complex human diseases.

  17. Partitioning tracers for measuring residual NAPL: Field-scale test results

    International Nuclear Information System (INIS)

    Annable, M.D.; Rao, P.S.C.; Hatfield, K.; Graham, W.D.; Wood, A.L.; Enfield, C.G.

    1998-01-01

    The difficult task of locating and quantifying nonaqueous phase liquids (NAPLs) present in the vadose and saturated zones has prompted the development of innovative, nondestructive characterization techniques. The use of the interwell partitioning tracer's (IWPT) test, in which tracers that partition into the NAPL phase are displaced through the aquifer, is an attractive alternative to traditional coring and analysis. The first field test of IWPT was conducted in a hydraulically isolated test cell to quantify the total amount of a complex NAPL (a mixture of JP-4 jet fuel and chlorinated solvents) trapped within a 1.5-m smear zone in a shallow, unconfined sand and gravel aquifer at Hill Air Force Base (AFB), Utah. Tracer breakthrough curves (BTCs) were measured in three extraction wells (EWs) following a tracer pulse introduction through four injection wells (IWs). The measured retardation of the partitioning tracer (2,2-dimethyl-3-pentanol) relative to the nonreactive tracer (bromide) was used to quantify the NAPL present. The EW data were used to estimate an average NAPL saturation of 4.6--5.4% within the test cell. NAPL saturations estimated by using measured concentrations in soil cores of two significant compounds present in the NAPL were 3.0 and 4.6%

  18. Item-focussed Trees for the Identification of Items in Differential Item Functioning.

    Science.gov (United States)

    Tutz, Gerhard; Berger, Moritz

    2016-09-01

    A novel method for the identification of differential item functioning (DIF) by means of recursive partitioning techniques is proposed. We assume an extension of the Rasch model that allows for DIF being induced by an arbitrary number of covariates for each item. Recursive partitioning on the item level results in one tree for each item and leads to simultaneous selection of items and variables that induce DIF. For each item, it is possible to detect groups of subjects with different item difficulties, defined by combinations of characteristics that are not pre-specified. The way a DIF item is determined by covariates is visualized in a small tree and therefore easily accessible. An algorithm is proposed that is based on permutation tests. Various simulation studies, including the comparison with traditional approaches to identify items with DIF, show the applicability and the competitive performance of the method. Two applications illustrate the usefulness and the advantages of the new method.

  19. Stability of recursive out-of-sequence measurement filters: an open problem

    Science.gov (United States)

    Chen, Lingji; Moshtagh, Nima; Mehra, Raman K.

    2011-06-01

    In many applications where communication delays are present, measurements with earlier time stamps can arrive out-of-sequence, i.e., after state estimates have been obtained for the current time instant. To incorporate such an Out-Of-Sequence Measurement (OOSM), many algorithms have been proposed in the literature to obtain or approximate the optimal estimate that would have been obtained if the OOSM had arrived in-sequence. When OOSM occurs repeatedly, approximate estimations as a result of incorporating one OOSM have to serve as the basis for incorporating yet another OOSM. The question of whether the "approximation of approximation" is well behaved, i.e., whether approximation errors accumulate in a recursive setting, has not been adequately addressed in the literature. This paper draws attention to the stability question of recursive OOSM processing filters, formulates the problem in a specific setting, and presents some simulation results that suggest that such filters are indeed well-behaved. Our hope is that more research will be conducted in the future to rigorously establish stability properties of these filters.

  20. Partitioning in P-T concept

    International Nuclear Information System (INIS)

    Zhang Peilu; Qi Zhanshun; Zhu Zhixuan

    2000-01-01

    Comparison of dry- and water-method for partitioning fission products and minor actinides from the spent fuels, and description of advance of dry-method were done. Partitioning process, some typical concept and some results of dry-method were described. The problems fond in dry-method up to now were pointed out. The partitioning study program was suggested

  1. Subcellular partitioning kinetics, metallothionein response and oxidative damage in the marine mussel Mytilus galloprovincialis exposed to cadmium-based quantum dots

    Energy Technology Data Exchange (ETDEWEB)

    Rocha, Thiago Lopes [CIMA, Faculty of Science and Technology, University of Algarve, Campus de Gambelas, 8005-139 Faro (Portugal); Gomes, Tânia [CIMA, Faculty of Science and Technology, University of Algarve, Campus de Gambelas, 8005-139 Faro (Portugal); Norwegian Institute for Water Research (NIVA), Gaustadalléen 21, NO-0349 Oslo (Norway); Durigon, Emerson Giuliani [CIMA, Faculty of Science and Technology, University of Algarve, Campus de Gambelas, 8005-139 Faro (Portugal); Bebianno, Maria João, E-mail: mbebian@ualg.pt [CIMA, Faculty of Science and Technology, University of Algarve, Campus de Gambelas, 8005-139 Faro (Portugal)

    2016-06-01

    The environmental health impact of metal-based nanomaterials is of emerging concern, but their metabolism and detoxification pathways in marine bioindicator species remain unclear. This study investigated the role of subcellular partitioning kinetics, metallothioneins (MTs) response and oxidative damage (lipid peroxidation – LPO) in the marine mussel Mytilus galloprovincialis exposed to CdTe quantum dots (QDs) in comparison with its dissolved counterpart. Mussels were exposed to QDs and dissolved Cd for 21 days at 10 μg Cd L{sup −1} followed by a 50 days depuration. Higher Cd concentrations were detected in fractions containing mitochondria, nucleus and lysosomes, suggesting potential subcellular targets of QDs toxicity in mussel tissues. Tissue specific metabolism patterns were observed in mussels exposed to both Cd forms. Although MT levels were directly associated with Cd in both forms, QDs subcellular partitioning is linked to biologically active metal (BAM), but no increase in LPO occurred, while in the case of dissolved Cd levels are in the biologically detoxified metal (BDM) form, indicating nano-specific effects. Mussel gills showed lower detoxification capability of QDs, while the digestive gland is the major tissue for storage and detoxification of both Cd forms. Both mussel tissues were unable to completely eliminate the Cd accumulated in the QDs form (estimated half-life time > 50 days), highlighting the potential source of Cd and QDs toxicity for human and environmental health. Results indicate tissue specific metabolism patterns and nano-specific effects in marine mussel exposed to QDs. - Highlights: • Subcellular partitioning and MT response are Cd form, tissue and time dependent. • Tissue specific metabolism of Cd-based quantum dots (QDs) in marine mussels. • QDs are slower biologically detoxified when compared to dissolved Cd. • Subcellular partitioning and biomarker responses indicate nano-specific effects. • Subcellular

  2. Estimation of the blood velocity spectrum using a recursive lattice filter

    DEFF Research Database (Denmark)

    Jensen, Jørgen Arendt; Buelund, Claus; Jørgensen, Allan

    1996-01-01

    acquired for showing the blood velocity distribution are inherently non-stationary, due to the pulsatility of the flow. All current signal processing schemes assume that the signal is stationary within the window of analysis, although this is an approximation. In this paper a recursive least......-stationarity are incorporated through an exponential decay factor, that sets the exponential horizon of the filter. A factor close to 1 gives a long horizon with low variance estimates, but can not track a highly non-stationary flow. Setting the factor is therefore a compromise between estimate variance and the filter...... with the actual distributions that always will be smooth. Setting the exponential decay factor to 0.99 gives satisfactory results for in-vivo data from the carotid artery. The filter can easily be implemented using a standard fixed-point signal processing chip for real-time processing...

  3. Partition coefficients of methylated DNA bases obtained from free energy calculations with molecular electron density derived atomic charges.

    Science.gov (United States)

    Lara, A; Riquelme, M; Vöhringer-Martinez, E

    2018-05-11

    Partition coefficients serve in various areas as pharmacology and environmental sciences to predict the hydrophobicity of different substances. Recently, they have also been used to address the accuracy of force fields for various organic compounds and specifically the methylated DNA bases. In this study, atomic charges were derived by different partitioning methods (Hirshfeld and Minimal Basis Iterative Stockholder) directly from the electron density obtained by electronic structure calculations in a vacuum, with an implicit solvation model or with explicit solvation taking the dynamics of the solute and the solvent into account. To test the ability of these charges to describe electrostatic interactions in force fields for condensed phases, the original atomic charges of the AMBER99 force field were replaced with the new atomic charges and combined with different solvent models to obtain the hydration and chloroform solvation free energies by molecular dynamics simulations. Chloroform-water partition coefficients derived from the obtained free energies were compared to experimental and previously reported values obtained with the GAFF or the AMBER-99 force field. The results show that good agreement with experimental data is obtained when the polarization of the electron density by the solvent has been taken into account, and when the energy needed to polarize the electron density of the solute has been considered in the transfer free energy. These results were further confirmed by hydration free energies of polar and aromatic amino acid side chain analogs. Comparison of the two partitioning methods, Hirshfeld-I and Minimal Basis Iterative Stockholder (MBIS), revealed some deficiencies in the Hirshfeld-I method related to the unstable isolated anionic nitrogen pro-atom used in the method. Hydration free energies and partitioning coefficients obtained with atomic charges from the MBIS partitioning method accounting for polarization by the implicit solvation model

  4. Active control of sound transmission through a double panel partition

    Science.gov (United States)

    Sas, P.; Bao, C.; Augusztinovicz, F.; Desmet, W.

    1995-03-01

    The feasibility of improving the insertion loss of lightweight double panel partitions by using small loudspeakers as active noise control sources inside the air gap between both panels of the partition is investigated analytically, numerically and experimentally in this paper. A theoretical analysis of the mechanisms of the fluid-structure interaction of double panel structures is presented in order to gain insight into the physical phenomena underlying the behaviour of a coupled vibro-acoustic system controlled by active methods. The analysis, based on modal coupling theory, enables one to derive some qualitative predictions concerning the potentials and limitations of the proposed approach. The theoretical analysis is valid only for geometrically simple structures. For more complex geometries, numerical simulations are required. Therefore the potential use of active noise control inside double panel structures has been analyzed by using coupled finite element and boundary element methods. To verify the conclusions drawn from the theoretical analysis and the numerical calculation and, above all, to demonstrate the potential of the proposed approach, experiments have been conducted with a laboratory set-up. The performance of the proposed approach was evaluated in terms of relative insertion loss measurements. It is shown that a considerable improvement of the insertion loss has been achieved around the lightly damped resonances of the system for the frequency range investigated (60-220 Hz).

  5. Recursive thoughts on the simulation of the flexible multibody dynamics of slender offshore structures

    Science.gov (United States)

    Schilder, J.; Ellenbroek, M.; de Boer, A.

    2017-12-01

    In this work, the floating frame of reference formulation is used to create a flexible multibody model of slender offshore structures such as pipelines and risers. It is shown that due to the chain-like topology of the considered structures, the equation of motion can be expressed in terms of absolute interface coordinates. In the presented form, kinematic constraint equations are satisfied explicitly and the Lagrange multipliers are eliminated from the equations. Hence, the structures can be conveniently coupled to finite element or multibody models of for example seabed and vessel. The chain-like topology enables the efficient use of recursive solution procedures for both transient dynamic analysis and equilibrium analysis. For this, the transfer matrix method is used. In order to improve the convergence of the equilibrium analysis, the analytical solution of an ideal catenary is used as an initial configuration, reducing the number of required iterations.

  6. Dynamically heterogenous partitions and phylogenetic inference: an evaluation of analytical strategies with cytochrome b and ND6 gene sequences in cranes.

    Science.gov (United States)

    Krajewski, C; Fain, M G; Buckley, L; King, D G

    1999-11-01

    ki ctes over whether molecular sequence data should be partitioned for phylogenetic analysis often confound two types of heterogeneity among partitions. We distinguish historical heterogeneity (i.e., different partitions have different evolutionary relationships) from dynamic heterogeneity (i.e., different partitions show different patterns of sequence evolution) and explore the impact of the latter on phylogenetic accuracy and precision with a two-gene, mitochondrial data set for cranes. The well-established phylogeny of cranes allows us to contrast tree-based estimates of relevant parameter values with estimates based on pairwise comparisons and to ascertain the effects of incorporating different amounts of process information into phylogenetic estimates. We show that codon positions in the cytochrome b and NADH dehydrogenase subunit 6 genes are dynamically heterogenous under both Poisson and invariable-sites + gamma-rates versions of the F84 model and that heterogeneity includes variation in base composition and transition bias as well as substitution rate. Estimates of transition-bias and relative-rate parameters from pairwise sequence comparisons were comparable to those obtained as tree-based maximum likelihood estimates. Neither rate-category nor mixed-model partitioning strategies resulted in a loss of phylogenetic precision relative to unpartitioned analyses. We suggest that weighted-average distances provide a computationally feasible alternative to direct maximum likelihood estimates of phylogeny for mixed-model analyses of large, dynamically heterogenous data sets. Copyright 1999 Academic Press.

  7. Gas-particle partitioning of semi-volatile organics on organic aerosols using a predictive activity coefficient model: analysis of the effects of parameter choices on model performance

    Science.gov (United States)

    Chandramouli, Bharadwaj; Jang, Myoseon; Kamens, Richard M.

    The partitioning of a diverse set of semivolatile organic compounds (SOCs) on a variety of organic aerosols was studied using smog chamber experimental data. Existing data on the partitioning of SOCs on aerosols from wood combustion, diesel combustion, and the α-pinene-O 3 reaction was augmented by carrying out smog chamber partitioning experiments on aerosols from meat cooking, and catalyzed and uncatalyzed gasoline engine exhaust. Model compositions for aerosols from meat cooking and gasoline combustion emissions were used to calculate activity coefficients for the SOCs in the organic aerosols and the Pankow absorptive gas/particle partitioning model was used to calculate the partitioning coefficient Kp and quantitate the predictive improvements of using the activity coefficient. The slope of the log K p vs. log p L0 correlation for partitioning on aerosols from meat cooking improved from -0.81 to -0.94 after incorporation of activity coefficients iγ om. A stepwise regression analysis of the partitioning model revealed that for the data set used in this study, partitioning predictions on α-pinene-O 3 secondary aerosol and wood combustion aerosol showed statistically significant improvement after incorporation of iγ om, which can be attributed to their overall polarity. The partitioning model was sensitive to changes in aerosol composition when updated compositions for α-pinene-O 3 aerosol and wood combustion aerosol were used. The octanol-air partitioning coefficient's ( KOA) effectiveness as a partitioning correlator over a variety of aerosol types was evaluated. The slope of the log K p- log K OA correlation was not constant over the aerosol types and SOCs used in the study and the use of KOA for partitioning correlations can potentially lead to significant deviations, especially for polar aerosols.

  8. The recursive combination filter approach of pre-processing for the estimation of standard deviation of RR series.

    Science.gov (United States)

    Mishra, Alok; Swati, D

    2015-09-01

    Variation in the interval between the R-R peaks of the electrocardiogram represents the modulation of the cardiac oscillations by the autonomic nervous system. This variation is contaminated by anomalous signals called ectopic beats, artefacts or noise which mask the true behaviour of heart rate variability. In this paper, we have proposed a combination filter of recursive impulse rejection filter and recursive 20% filter, with recursive application and preference of replacement over removal of abnormal beats to improve the pre-processing of the inter-beat intervals. We have tested this novel recursive combinational method with median method replacement to estimate the standard deviation of normal to normal (SDNN) beat intervals of congestive heart failure (CHF) and normal sinus rhythm subjects. This work discusses the improvement in pre-processing over single use of impulse rejection filter and removal of abnormal beats for heart rate variability for the estimation of SDNN and Poncaré plot descriptors (SD1, SD2, and SD1/SD2) in detail. We have found the 22 ms value of SDNN and 36 ms value of SD2 descriptor of Poincaré plot as clinical indicators in discriminating the normal cases from CHF cases. The pre-processing is also useful in calculation of Lyapunov exponent which is a nonlinear index as Lyapunov exponents calculated after proposed pre-processing modified in a way that it start following the notion of less complex behaviour of diseased states.

  9. Towards Interactive Construction of Topical Hierarchy: A Recursive Tensor Decomposition Approach.

    Science.gov (United States)

    Wang, Chi; Liu, Xueqing; Song, Yanglei; Han, Jiawei

    2015-08-01

    Automatic construction of user-desired topical hierarchies over large volumes of text data is a highly desirable but challenging task. This study proposes to give users freedom to construct topical hierarchies via interactive operations such as expanding a branch and merging several branches. Existing hierarchical topic modeling techniques are inadequate for this purpose because (1) they cannot consistently preserve the topics when the hierarchy structure is modified; and (2) the slow inference prevents swift response to user requests. In this study, we propose a novel method, called STROD, that allows efficient and consistent modification of topic hierarchies, based on a recursive generative model and a scalable tensor decomposition inference algorithm with theoretical performance guarantee. Empirical evaluation shows that STROD reduces the runtime of construction by several orders of magnitude, while generating consistent and quality hierarchies.

  10. Guided wave tomography in anisotropic media using recursive extrapolation operators

    Science.gov (United States)

    Volker, Arno

    2018-04-01

    Guided wave tomography is an advanced technology for quantitative wall thickness mapping to image wall loss due to corrosion or erosion. An inversion approach is used to match the measured phase (time) at a specific frequency to a model. The accuracy of the model determines the sizing accuracy. Particularly for seam welded pipes there is a measurable amount of anisotropy. Moreover, for small defects a ray-tracing based modelling approach is no longer accurate. Both issues are solved by applying a recursive wave field extrapolation operator assuming vertical transverse anisotropy. The inversion scheme is extended by not only estimating the wall loss profile but also the anisotropy, local material changes and transducer ring alignment errors. This makes the approach more robust. The approach will be demonstrated experimentally on different defect sizes, and a comparison will be made between this new approach and an isotropic ray-tracing approach. An example is given in Fig. 1 for a 75 mm wide, 5 mm deep defect. The wave field extrapolation based tomography clearly provides superior results.

  11. Bounded queries in recursion theory

    CERN Document Server

    Gasarch, William I

    1999-01-01

    One of the major concerns of theoretical computer science is the classifi­ cation of problems in terms of how hard they are. The natural measure of difficulty of a function is the amount of time needed to compute it (as a function of the length of the input). Other resources, such as space, have also been considered. In recursion theory, by contrast, a function is considered to be easy to compute if there exists some algorithm that computes it. We wish to classify functions that are hard, i.e., not computable, in a quantitative way. We cannot use time or space, since the functions are not even computable. We cannot use Turing degree, since this notion is not quantitative. Hence we need a new notion of complexity-much like time or spac~that is quantitative and yet in some way captures the level of difficulty (such as the Turing degree) of a function.

  12. Impact of water use efficiency on eddy covariance flux partitioning using correlation structure analysis

    Science.gov (United States)

    Anderson, Ray; Skaggs, Todd; Alfieri, Joseph; Kustas, William; Wang, Dong; Ayars, James

    2016-04-01

    Partitioned land surfaces fluxes (e.g. evaporation, transpiration, photosynthesis, and ecosystem respiration) are needed as input, calibration, and validation data for numerous hydrological and land surface models. However, one of the most commonly used techniques for measuring land surface fluxes, Eddy Covariance (EC), can directly measure net, combined water and carbon fluxes (evapotranspiration and net ecosystem exchange/productivity). Analysis of the correlation structure of high frequency EC time series (hereafter flux partitioning or FP) has been proposed to directly partition net EC fluxes into their constituent components using leaf-level water use efficiency (WUE) data to separate stomatal and non-stomatal transport processes. FP has significant logistical and spatial representativeness advantages over other partitioning approaches (e.g. isotopic fluxes, sap flow, microlysimeters), but the performance of the FP algorithm is reliant on the accuracy of the intercellular CO2 (ci) concentration used to parameterize WUE for each flux averaging interval. In this study, we tested several parameterizations for ci as a function of atmospheric CO2 (ca), including (1) a constant ci/ca ratio for C3 and C4 photosynthetic pathway plants, (2) species-specific ci/ca-Vapor Pressure Deficit (VPD) relationships (quadratic and linear), and (3) generalized C3 and C4 photosynthetic pathway ci/ca-VPD relationships. We tested these ci parameterizations at three agricultural EC towers from 2011-present in C4 and C3 crops (sugarcane - Saccharum officinarum L. and peach - Prunus persica), and validated again sap-flow sensors installed at the peach site. The peach results show that the species-specific parameterizations driven FP algorithm came to convergence significantly more frequently (~20% more frequently) than the constant ci/ca ratio or generic C3-VPD relationship. The FP algorithm parameterizations with a generic VPD relationship also had slightly higher transpiration (5 Wm-2

  13. Prognostic classification index in Iranian colorectal cancer patients: Survival tree analysis

    Directory of Open Access Journals (Sweden)

    Amal Saki Malehi

    2016-01-01

    Full Text Available Aims: The aim of this study was to determine the prognostic index for separating homogenous subgroups in colorectal cancer (CRC patients based on clinicopathological characteristics using survival tree analysis. Methods: The current study was conducted at the Research Center of Gastroenterology and Liver Disease, Shahid Beheshti Medical University in Tehran, between January 2004 and January 2009. A total of 739 patients who already have been diagnosed with CRC based on pathologic report were enrolled. The data included demographic and clinical-pathological characteristic of patients. Tree-structured survival analysis based on a recursive partitioning algorithm was implemented to evaluate prognostic factors. The probability curves were calculated according to the Kaplan-Meier method, and the hazard ratio was estimated as an interest effect size. Result: There were 526 males (71.2% of these patients. The mean survival time (from diagnosis time was 42.46± (3.4. Survival tree identified three variables as main prognostic factors and based on their four prognostic subgroups was constructed. The log-rank test showed good separation of survival curves. Patients with Stage I-IIIA and treated with surgery as the first treatment showed low risk (median = 34 months whereas patients with stage IIIB, IV, and more than 68 years have the worse survival outcome (median = 9.5 months. Conclusion: Constructing the prognostic classification index via survival tree can aid the researchers to assess interaction between clinical variables and determining the cumulative effect of these variables on survival outcome.

  14. Hurwitz numbers, moduli of curves, topological recursion, Givental's theory and their relations

    NARCIS (Netherlands)

    Spitz, L.

    2014-01-01

    The study of curves is an important area of research in algebraic geometry and mathematical physics. In my thesis I study so-called moduli spaces of curves; these are spaces that parametrize all curves with some specified properties. In particular, I study maps from curves to other spaces, recursive

  15. Partitioning planning studies: Preliminary evaluation of metal and radionuclide partitioning the high-temperature thermal treatment systems

    International Nuclear Information System (INIS)

    Liekhus, K.; Grandy, J.; Chambers, A.

    1997-03-01

    A preliminary study of toxic metals and radionuclide partitioning during high-temperature processing of mixed waste has been conducted during Fiscal Year 1996 within the Environmental Management Technology Evaluation Project. The study included: (a) identification of relevant partitioning mechanisms that cause feed material to be distributed between the solid, molten, and gas phases within a thermal treatment system; (b) evaluations of existing test data from applicable demonstration test programs as a means to identify and understand elemental and species partitioning; and, (c) evaluation of theoretical or empirical partitioning models for use in predicting elemental or species partitioning in a thermal treatment system. This preliminary study was conducted to identify the need for and the viability of developing the tools capable of describing and predicting toxic metals and radionuclide partitioning in the most applicable mixed waste thermal treatment processes. This document presents the results and recommendations resulting from this study that may serve as an impetus for developing and implementing these predictive tools

  16. Partitioning planning studies: Preliminary evaluation of metal and radionuclide partitioning the high-temperature thermal treatment systems

    Energy Technology Data Exchange (ETDEWEB)

    Liekhus, K.; Grandy, J.; Chambers, A. [and others

    1997-03-01

    A preliminary study of toxic metals and radionuclide partitioning during high-temperature processing of mixed waste has been conducted during Fiscal Year 1996 within the Environmental Management Technology Evaluation Project. The study included: (a) identification of relevant partitioning mechanisms that cause feed material to be distributed between the solid, molten, and gas phases within a thermal treatment system; (b) evaluations of existing test data from applicable demonstration test programs as a means to identify and understand elemental and species partitioning; and, (c) evaluation of theoretical or empirical partitioning models for use in predicting elemental or species partitioning in a thermal treatment system. This preliminary study was conducted to identify the need for and the viability of developing the tools capable of describing and predicting toxic metals and radionuclide partitioning in the most applicable mixed waste thermal treatment processes. This document presents the results and recommendations resulting from this study that may serve as an impetus for developing and implementing these predictive tools.

  17. Atmospheric concentrations and phase partitioning of polycyclic aromatic hydrocarbons in Izmir, Turkey

    Energy Technology Data Exchange (ETDEWEB)

    Demircioglu, Eylem; Odabasi, Mustafa [Faculty of Engineering, Department of Environmental Engineering, Dokuz Eylul University, Izmir (Turkey); Sofuoglu, Aysun [Faculty of Engineering, Department of Chemical Engineering, Izmir Institute of Technology, Gulbahce-Urla (Turkey)

    2011-04-15

    Ambient air polycyclic aromatic hydrocarbon (PAH) samples were collected at a suburban (n = 63) and at an urban site (n = 14) in Izmir, Turkey. Average gas-phase total PAH (sum {sub 14}PAH) concentrations were 23.5 ng m{sup -3} for suburban and 109.7 ng m{sup -3} for urban sites while average particle-phase total PAH concentrations were 12.3 and 34.5 ng m{sup -3} for suburban and urban sites, respectively. Higher ambient PAH concentrations were measured in the gas-phase and sum {sub 14}PAH concentrations were dominated by lower molecular weight PAHs. Multiple linear regression analysis indicated that the meteorological parameters were effective on ambient PAH concentrations. Emission sources of particle-phase PAHs were investigated using a diagnostic plot of fluorene (FLN)/(fluorine + pyrene; PY) versus indeno[1,2,3-cd]PY/(indeno[1,2,3-cd]PY + benzo[g,h,i]perylene) and several diagnostic ratios. These approaches have indicated that traffic emissions (petroleum combustion) were the dominant PAH sources at both sites for summer and winter seasons. Experimental gas-particle partition coefficients (K{sub P}) were compared to the predictions of octanol-air (K{sub OA}) and soot-air (K{sub SA}) partition coefficient models. The correlations between experimental and modeled K{sub P} values were significant (r{sup 2} = 0.79 and 0.94 for suburban and urban sites, respectively, p < 0.01). Octanol-based absorptive partitioning model predicted lower partition coefficients especially for relatively volatile PAHs. However, overall there was a relatively good agreement between the measured K{sub P} and soot-based model predictions. (Copyright copyright 2011 WILEY-VCH Verlag GmbH and Co. KGaA, Weinheim)

  18. The Euler–Riemann gases, and partition identities

    International Nuclear Information System (INIS)

    Chair, Noureddine

    2013-01-01

    The Euler theorem in partition theory and its generalization are derived from a non-interacting quantum field theory in which each bosonic mode with a given frequency is equivalent to a sum of bosonic mode whose frequency is twice (s-times) as much, and a fermionic (parafermionic) mode with the same frequency. Explicit formulas for the graded parafermionic partition functions are obtained, and the inverse of the graded partition function (IGPPF), turns out to be bosonic (fermionic) partition function depending on the parity of the order s of the parafermions. It is also shown that these partition functions are generating functions of partitions of integers with restrictions, the Euler generating function is identified with the inverse of the graded parafermionic partition function of order 2. As a result we obtain new sequences of partitions of integers with given restrictions. If the parity of the order s is even, then mixing a system of parafermions with a system whose partition function is (IGPPF), results in a system of fermions and bosons. On the other hand, if the parity of s is odd, then, the system we obtain is still a mixture of fermions and bosons but the corresponding Fock space of states is truncated. It turns out that these partition functions are given in terms of the Jacobi theta function θ 4 , and generate sequences in partition theory. Our partition functions coincide with the overpartitions of Corteel and Lovejoy, and jagged partitions in conformal field theory. Also, the partition functions obtained are related to the Ramond characters of the superconformal minimal models, and in the counting of the Moore–Read edge spectra that appear in the fractional quantum Hall effect. The different partition functions for the Riemann gas that are the counter parts of the Euler gas are obtained by a simple change of variables. In particular the counter part of the Jacobi theta function is (ζ(2t))/(ζ(t) 2 ) . Finally, we propose two formulas which brings

  19. Hawk: A Runtime System for Partitioned Objects

    NARCIS (Netherlands)

    Ben Hassen, S.; Bal, H.E.; Tanenbaum, A.S.

    1997-01-01

    Hawk is a language-independent runtime system for writing data-parallel programs using partitioned objects. A partitioned object is a multidimensional array of elements that can be partitioned and distributed by the programmer. The Hawk runtime system uses the user-defined partitioning of objects

  20. Pseudocode Interpreter (Pseudocode Integrated Development Environment with Lexical Analyzer and Syntax Analyzer using Recursive Descent Parsing Algorithm

    Directory of Open Access Journals (Sweden)

    Christian Lester D. Gimeno

    2017-11-01

    Full Text Available –This research study focused on the development of a software that helps students design, write, validate and run their pseudocode in a semi Integrated Development Environment (IDE instead of manually writing it on a piece of paper.Specifically, the study aimed to develop lexical analyzer or lexer, syntax analyzer or parser using recursive descent parsing algorithm and an interpreter. The lexical analyzer reads pseudocodesource in a sequence of symbols or characters as lexemes.The lexemes are then analyzed by the lexer that matches a pattern for valid tokens and passes to the syntax analyzer or parser. The syntax analyzer or parser takes those valid tokens and builds meaningful commands using recursive descent parsing algorithm in a form of an abstract syntax tree. The generation of an abstract syntax tree is based on the specified grammar rule created by the researcher expressed in Extended Backus-Naur Form. The Interpreter takes the generated abstract syntax tree and starts the evaluation or interpretation to produce pseudocode output. The software was evaluated using white-box testing by several ICT professionals and black-box testing by several computer science students based on the International Organization for Standardization (ISO 9126 software quality standards. The overall results of the evaluation both for white-box and black-box were described as “Excellent in terms of functionality, reliability, usability, efficiency, maintainability and portability”.