WorldWideScience

Sample records for group recursive partitioning

  1. 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

  2. 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

  3. 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.

  4. 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

  5. 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

  6. Recursive partitioning for monotone missing at random longitudinal markers.

    Science.gov (United States)

    Stock, Shannon; DeGruttola, Victor

    2013-03-15

    The development of HIV resistance mutations reduces the efficacy of specific antiretroviral drugs used to treat HIV infection and cross-resistance within classes of drugs is common. Recursive partitioning has been extensively used to identify resistance mutations associated with a reduced virologic response measured at a single time point; here we describe a statistical method that accommodates a large set of genetic or other covariates and a longitudinal response. This recursive partitioning approach for continuous longitudinal data uses the kernel of a U-statistic as the splitting criterion and avoids the need for parametric assumptions regarding the relationship between observed response trajectories and covariates. We propose an extension of this approach that allows longitudinal measurements to be monotone missing at random by making use of inverse probability weights. We assess the performance of our method using extensive simulation studies and apply them to data collected by the Forum for Collaborative HIV Research as part of an investigation of the viral genetic mutations associated with reduced clinical efficacy of the drug abacavir. Copyright © 2012 John Wiley & Sons, Ltd.

  7. 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.

  8. Aggressive periodontitis defined by recursive partitioning analysis of immunologic factors

    NARCIS (Netherlands)

    Papantonopoulos, G.H.; Takahashi, K.; Bountis, T.; Loos, B.G.

    2013-01-01

    Background: The present study aims to extend recent findings of a non-linear model of the progression of periodontitis supporting the notion that aggressive periodontitis (AgP) and chronic periodontitis (CP) are distinct clinical entities. This approach is based on the implementation of recursive

  9. 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

    study the MRC National Survey of Health and Development. RESULTS: Positive mental well-being, personal mastery, identifying the spouse as the closest confidant, being extrovert and informal social contact were the most important correlates of lower loneliness levels. Participation in organised groups...... 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...... combinations of experiences and circumstances characterise high-risk groups. Poor mental wellbeing and sparse social contact emerged as especially important and classical demographic factors as insufficient in identifying high loneliness levels among older adults....

  10. Failure patterns by prognostic group as determined by recursive partitioning analysis (RPA) of 1547 on four radiation therapy oncology group studies in operable non-small cell lung cancer (NSCLC)

    International Nuclear Information System (INIS)

    Komaki, Ritsuko; Scott, Charles B.; Byhardt, Roger W.; Emami, Bahman; Asbell, Sucha O.; Russell, Anthony H.; Roach, Mack; Urtasun, Raul C.; Gaspar, Laurie E.

    1997-01-01

    Purpose: To identify groups of patients who might benefit from more aggressive systemic or local treatment based on failure patterns when unresectable NSCLC was treated by radiation therapy alone. Methods: 1547 patients from 4 RTOG trials treated by RT alone were analyzed for the patterns of first failure by PRA class which was defined by prognostic factors, e.g., stage, KPS, weight loss, pleural effusion, age. All patients were AJCC stage II, IIIA or IIIB with KPS of at least 50 and n previous radiotherapy or chemotherapy for their NSCLC. Progressions in the primary (within irradiated fields), thorax (outside irradiated area), brain and distant metastasis other than brain were compared (two-sided) for each failure category by RPA. Results: The RPA classes are four distinct subgroups that had significantly different median survivals of 12.6, 8.3, 6.2 and 3.3 months for classes I, II, III and IV respectively (all groups p=0.0002). Pair comparison showed that RPA I vs IV p<0.0001, I vs III p=0.006, II vs IV p<0.0001, and III vs IV p=0.06. Conclusions: These results suggest the burden of disease and physiologic compromise in class IV patients are sufficient to cause death before specific sites of failure can be discerned. Site specific treatment strategies (intensive local therapy, combination chemotherapy, prophylactic cranial irradiation) may lead to improved outcome in class I and II, but are unlikely to alter outcome in class III and IV

  11. Diverse Pathways to Positive and Negative Affect in Adulthood and Later Life: An Integrative Approach Using Recursive Partitioning

    Science.gov (United States)

    Gruenewald, Tara L.; Mroczek, Daniel K.; Ryff, Carol D.; Singer, Burton H.

    2008-01-01

    Recursive partitioning is an analytic technique that is useful for identifying complex combinations of conditions that predict particular outcomes as well as for delineating multiple subgroup differences in how such factors work together. As such, the methodology is well suited to multidisciplinary, life course inquiry in which the goal is to…

  12. 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…

  13. 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

  14. Predicting depression outcome in mental health treatment: a recursive partitioning analysis.

    Science.gov (United States)

    Berman, Margit I; Hegel, Mark T

    2014-01-01

    Recursive partitioning was applied to a longitudinal dataset of outpatient mental health clinic patients to identify empirically factors and interactions among factors that best predicted clinical improvement and deterioration in symptoms of depression across treatment. Sixty-two variables drawn from an initial patient survey and from chart review were included as covariates in the analysis, representing nearly all of the demographic, treatment, symptom, diagnostic, and social history information obtained from patients at their initial evaluations. Trees estimated the probability of participants' having depression at their last assessment, improving to a clinically significant degree during treatment, or developing a new onset of significant depressive symptoms during treatment. Initial pain, the presence of anxiety, and a history of multiple types of abuse were risk factors for poorer outcome, even among patients who did not initially have significant depressive symptoms. By examining multiple-related outcomes, we were able to create a series of overlapping models that revealed important predictors across trees. Limitations of the study included the lack of cross-validation of the trees and the exploratory nature of the analysis.

  15. 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.

  16. What contributes to perceived stress in later life? A recursive partitioning approach

    Science.gov (United States)

    Scott, Stacey B.; Jackson, Brenda R.; Bergeman, C. S.

    2011-01-01

    One possible explanation for the individual differences in outcomes of stress is the diversity of inputs that produce perceptions of being stressed. The current study examines how combinations of contextual features (e.g., social isolation, neighborhood quality, health problems, age discrimination, financial concerns, and recent life events) of later life contribute to overall feelings of stress. Recursive partitioning techniques (regression trees and random forests) were used to examine unique interrelations between predictors of perceived stress in a sample of 282 community-dwelling adults. Trees provided possible examples of equifinality (i.e., subsets of people with similar levels of perceived stress but different predictors) as well as for the identification both of contextual combinations that separated participants with very high and very low perceived stress. Random forest analyses aggregated across many trees based on permuted versions of the data and predictors; loneliness, financial strain, neighborhood strain, ageism, and to some extent life events emerged as important predictors. Interviews with a subsample of participants provided both thick description of the complex relationships identified in the trees, as well as additional risks not appearing in the survey results. Together, the analyses highlight what may be missed when stress is used as a simple unidimensional construct and can guide differential intervention efforts. PMID:21604885

  17. 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|info:eu-repo/dai/nl/413970957; 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

  18. 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.

  19. 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

  20. 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.

  1. Description of exposure profiles for seven environmental chemicals in a US population using recursive partition mixture modeling (RPMM).

    Science.gov (United States)

    Przybyla, Jennifer; Kile, Molly; Smit, Ellen

    2017-12-21

    Biomonitoring studies have shown that humans are exposed to numerous environmental chemicals. Previous work provides limited insights into the dynamic relationship between different chemicals within a population. The objective of this study is to develop an analytical method identifying exposure profiles of seven common environmental chemicals and determine how exposure profiles differ by sociodemographic groups and National Health and Nutrition Examination Survey (NHANES) 2003-2012 cycle year. We used recursive partition mixture modeling (RPMM) to define classes of the population with similar exposure profiles of lead, cadmium, 2,4-dichlorophenol, 2,5-dichlorophenol, bisphenol A (BPA), triclosan, and benzophenone-3 in individuals aged ≥6 years. Additionally, quasibinomial logistic regression was used to examine the association between each class and selected demographic characteristics. Eight exposure profiles were identified. Individuals who clustered together and had the highest chemical exposures were more likely to be older, to be Non-Hispanic Black (NHB) or Other Hispanic (OH), more likely to live below the poverty line, more likely to be male, and more likely to have participated in the earlier NHANES cycle (2003-2004). The developed method described the dynamic relationship between chemicals and shows that this relationship is different for subpopulations based on their sociodemographic characteristics.

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

    Science.gov (United States)

    Blankers, Matthijs; Frijns, Tom; Belackova, Vendula; Rossi, Carla; Svensson, Bengt; Trautmann, Franz; van Laar, Margriet

    2014-01-01

    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. The identified

  3. 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

  4. Clinical elements that predict outcome after traumatic brain injury: a prospective multicenter recursive partitioning (decision-tree) analysis.

    Science.gov (United States)

    Brown, Allen W; Malec, James F; McClelland, Robyn L; Diehl, Nancy N; Englander, Jeffrey; Cifu, David X

    2005-10-01

    Traumatic brain injury (TBI) often presents clinicians with a complex combination of clinical elements that can confound treatment and make outcome prediction challenging. Predictive models have commonly used acute physiological variables and gross clinical measures to predict mortality and basic outcome endpoints. The primary goal of this study was to consider all clinical elements available concerning a survivor of TBI admitted for inpatient rehabilitation, and identify those factors that predict disability, need for supervision, and productive activity one year after injury. The Traumatic Brain Injury Model Systems (TBIMS) database was used for decision tree analysis using recursive partitioning (n = 3463). Outcome measures included the Functional Independence Measure(), the Disability Rating Scale, the Supervision Rating Scale, and a measure of productive activity. Predictor variables included all physical examination elements, measures of injury severity (initial Glasgow Coma Scale score, duration of post-traumatic amnesia [PTA], length of coma, CT scan pathology), gender, age, and years of education. The duration of PTA, age, and most elements of the physical examination were predictive of early disability. The duration of PTA alone was selected to predict late disability and independent living. The duration of PTA, age, sitting balance, and limb strength were selected to predict productive activity at 1 year. The duration of PTA was the best predictor of outcome selected in this model for all endpoints and elements of the physical examination provided additional predictive value. Valid and reliable measures of PTA and physical impairment after TBI are important for accurate outcome prediction.

  5. Predicting Cannabis Abuse Screening Test (CAST) Scores : A recursive partitioning analysis using survey data from Czech Republic, Italy, the Netherlands and Sweden

    OpenAIRE

    Blankers, Matthijs; Frijns, Tom; Belackova, Vendula; Rossi, Carla; Svensson, Bengt; Trautmann, Franz; Van Laar, Margriet

    2014-01-01

    Introduction: 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...

  6. 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.

  7. 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.

  8. 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...... of the initial data over all homotopy classes of successive excisions of embedded pair of pants. We provide sufficient conditions to guarantee these infinite sums converge and as a result, we can generate mapping class group invariant vectors Ω∑ which we call amplitudes. The initial data encode the amplitude...... for pair of pants and tori with one boundary, as well as the "recursion kernels" used for glueing. We give this construction the name of "geometric recursion", abbreviated GR. As an illustration, we show how to apply our formalism to various spaces of continuous functions over Teichmueller spaces, as well...

  9. 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

  10. Partition network into communities based on group action on sets

    Science.gov (United States)

    Lin, Shu-Cheng; Tuan, Han-Wen; Tung, Cheng-Tan; Julian, Peterson

    2018-02-01

    In this paper an improved algorithm is provided to detect communities within a network based on group action on sets (GAS). Modularity has been used as the criterion to revise the results of three previous papers, deriving a better method of partition for the network of Karate club. We developed a new method to replace the complicated GAS to achieve the same effect as GAS. Through four examples, we demonstrated that our revised approach reduced the computation amount of modularity values. Based on a branch marked example, a detailed example is provided by us to illustrate that there is too many cores in the initial stage of GAS approach to induce too many communities in the final partition. The findings shown here, will allow scholars to understand using GAS algorithm to partition a network into communities is an unreliable method.

  11. Novel recursive partitioning analysis classification for newly diagnosed glioblastoma: A multi-institutional study highlighting the MGMT promoter methylation and IDH1 gene mutation status.

    Science.gov (United States)

    Wee, Chan Woo; Kim, Eunji; Kim, Nalee; Kim, In Ah; Kim, Tae Min; Kim, Yu Jung; Park, Chul-Kee; Kim, Jin Wook; Kim, Chae-Yong; Choi, Seung Hong; Kim, Jae Hyoung; Park, Sung-Hye; Choe, Gheeyoung; Lee, Soon-Tae; Chang, Jong Hee; Kim, Se Hoon; Suh, Chang-Ok; Kim, Il Han

    2017-04-01

    To refine the recursive partitioning analysis (RPA) classification for glioblastoma incorporating the MGMT methylation and IDH1 mutation status. Three-hundred forty patients were treated with radiotherapy plus concurrent and adjuvant temozolomide in three tertiary-referral hospitals. MGMT methylation and IDH1 mutation status were available in all patients. Methylation of the MGMT (MGMTmeth) and mutation of IDH1 (IDH1mut) were observed in 42.4% and 6.2% of the patients, respectively. The median follow-up for survivors and all patients was 33.2 and 20.5months, respectively. The median survival (MS) was 23.6months. RPA was performed on behalf of the results of the Cox proportional hazards model. MGMT methylation generated the initial partition (MGMTmeth vs. MGMTunmeth) in the RPA. Three final RPA classes were identified; class I=MGMTmeth/IDH1mut or MGMTmeth/IDH1wt/GTR/KPS≥90 (MS, 67.2months); class II=MGMTmeth/IDH1wt/GTR/KPS<90, MGMTmeth/IDH1wt/residual disease, MGMTunmeth/age<50, or MGMTunmeth/age≥50/GTR (MS, 24.0months); class III=MGMTunmeth/age≥50/residual disease (MS, 15.2months). A novel RPA classification for glioblastoma was formulated highlighting the impact of MGMTmeth and IDH1mut in the temozolomide era. This model integrating pertinent molecular information can be used effectively for the patient stratification in future clinical trials. An external validation is ongoing. Copyright © 2017 Elsevier B.V. All rights reserved.

  12. 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.

  13. 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

  14. Partitions

    Directory of Open Access Journals (Sweden)

    Renata Biadacz

    2015-04-01

    Full Text Available The aim of the article is to present scientific and didactic achievements of Polish accounting at the turn of the 19th century. The first part of the study addresses key issues in the development of accounting science and practice on Polish territory during the Partitions period. In the second part, attention is focused on scientific achievements of J. Walicki, B. Wilmowski and P. Ciompa. The third part discusses the question of Polish accounting handbooks at the turn of the 19th century, as well as the state of accounting practice at that time and problems in the development of professional periodicals on Polish territory during the Partitions. The last part focuses on various perspectives on the nature of accounting in handbooks from the late 19th and early 20th century. The research method applied is literature study based on selected textbooks and scientific papers published in Polish language in the late 19th and early 20th centuries. The article provides a synthetic overview of the state of accounting knowledge and professional accounting periodicals on Polish soil during the Partitions, which had an impact on further development of accounting in Poland.

  15. Splittings of free groups, normal forms and partitions of ends

    Indian Academy of Sciences (India)

    These can be represented in a normal form due to Hatcher. In this paper, we determine the normal form in terms of crossings of partitions of ends corresponding to normal spheres, using a graph of trees representation for normal forms. In particular, we give a constructive proof of a criterion determining when a conjugacy ...

  16. 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.

  17. 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.

  18. Concept of grouping in partitioning of HLW for self-consistent fuel cycle

    International Nuclear Information System (INIS)

    Kitamoto, A.; Mulyanto

    1993-01-01

    A concept of grouping for partitioning of HLW has been developed in order to examine the possibility of a self-consistent fuel recycle. The concept of grouping of radionuclides is proposed herein, such as Group MA1 (MA below Cm), Group MA2 (Cm and higher MA), Group A ( 99 Tc and I), Group B (Cs and Sr) and Group R (the partitioned remain of HLW). Group B is difficult to be transmuted by neutron reaction, so a radiation application in an industrial scale should be developed in the future. Group A and Group MA1 can be burned by a thermal reactor, on the other hand Group MA2 should be burned by a fast reactor. P-T treatment can be optimized for the in-core and out-core system, respectively

  19. Toward General Analysis of Recursive Probability Models

    OpenAIRE

    Pless, Daniel; Luger, George

    2013-01-01

    There is increasing interest within the research community in the design and use of recursive probability models. Although there still remains concern about computational complexity costs and the fact that computing exact solutions can be intractable for many nonrecursive models and impossible in the general case for recursive problems, several research groups are actively developing computational techniques for recursive stochastic languages. We have developed an extension to the traditional...

  20. Recursive Markov Process

    OpenAIRE

    Hidaka, Shohei

    2015-01-01

    A Markov process, which is constructed recursively, arises in stochastic games with Markov strategies. In this study, we defined a special class of random processes called the recursive Markov process, which has infinitely many states but can be expressed in a closed form. We derive the characteristic equation which the marginal stationary distribution of an arbitrary recursive Markov process needs to satisfy.

  1. Recursive Lexicographical Search

    DEFF Research Database (Denmark)

    Iskhakov, Fedor; Rust, John; Schjerning, Bertel

    2016-01-01

    which state recursion finds at least one MPE of the overall DDG and introduce a recursive lexicographic search (RLS) algorithm that systematically and efficiently uses state recursion to find all MPE of the overall game in a finite number of steps. We apply RLS to find all MPE of a dynamic model...

  2. The ABCD of topological recursion

    DEFF Research Database (Denmark)

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

    an interesting problem which we study here. We provide some elementary, Lie-algebraic tools to address this problem, and give some elements of classification for dim V = 2. We also describe four more interesting classes of quantum Airy structures, coming from respectively Frobenius algebras (here we retrieve...... 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....

  3. 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....

  4. Recursive solutions for multi-group neutron kinetics diffusion equations in homogeneous three-dimensional rectangular domains with time dependent perturbations

    Energy Technology Data Exchange (ETDEWEB)

    Petersen, Claudio Z. [Universidade Federal de Pelotas, Capao do Leao (Brazil). Programa de Pos Graduacao em Modelagem Matematica; Bodmann, Bardo E.J.; Vilhena, Marco T. [Universidade Federal do Rio Grande do Sul, Porto Alegre, RS (Brazil). Programa de Pos-graduacao em Engenharia Mecanica; Barros, Ricardo C. [Universidade do Estado do Rio de Janeiro, Nova Friburgo, RJ (Brazil). Inst. Politecnico

    2014-12-15

    In the present work we solve in analytical representation the three dimensional neutron kinetic diffusion problem in rectangular Cartesian geometry for homogeneous and bounded domains for any number of energy groups and precursor concentrations. The solution in analytical representation is constructed using a hierarchical procedure, i.e. the original problem is reduced to a problem previously solved by the authors making use of a combination of the spectral method and a recursive decomposition approach. Time dependent absorption cross sections of the thermal energy group are considered with step, ramp and Chebyshev polynomial variations. For these three cases, we present numerical results and discuss convergence properties and compare our results to those available in the literature.

  5. Recursive and Fast Recursive Capon Spectral Estimators

    Directory of Open Access Journals (Sweden)

    Chen Jingdong

    2007-01-01

    Full Text Available The Capon algorithm, which was originally proposed for wavenumber estimation in array signal processing, has become a powerful tool for spectral analysis. Over several decades, a significant amount of research attention has been devoted to the estimation of the Capon spectrum. Most of the developed algorithms thus far, however, rely on the direct computation of the inverse of the input correlation (or covariance matrix, which can be computationally very expensive particularly when the dimension of the matrix is large. This paper deals with fast and efficient algorithms in computing the Capon spectrum. Inspired from the recursive idea established in adaptive signal processing theory, we first derive a recursive Capon algorithm. This new algorithm does not require an explicit matrix inversion, and hence it is more efficient to implement than the direct-inverse approach. We then develop a fast version of the recursive algorithm based on techniques used in fast recursive least-squares adaptive algorithms. This new fast algorithm can further reduce the complexity of the recursive Capon algorithm by an order of magnitude. Although our focus is on the Capon spectral estimation, the ideas shown in this paper can also be generalized and applied to other applications. To illustrate this, we will show how to apply the recursive idea to the estimation of the magnitude squared coherence function, which plays an important role for problems like time-delay estimation, signal-to-noise ratio estimation, and doubletalk detection in echo cancellation.

  6. Recursive Compressed Sensing

    OpenAIRE

    Freris, Nikolaos M.; Öçal, Orhan; Vetterli, Martin

    2013-01-01

    We introduce a recursive algorithm for performing compressed sensing on streaming data. The approach consists of a) recursive encoding, where we sample the input stream via overlapping windowing and make use of the previous measurement in obtaining the next one, and b) recursive decoding, where the signal estimate from the previous window is utilized in order to achieve faster convergence in an iterative optimization scheme applied to decode the new one. To remove estimation bias, a two-step ...

  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. 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.

  9. 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.

  10. A demonstration test of 4-group partitioning process with real high-level liquid waste

    Energy Technology Data Exchange (ETDEWEB)

    Morita, Y.; Yamaguchi, I.; Fujiwara, T.; Koizumi, H.; Tachimori, S. [Japan Atomic Energy Research Institute, Tokai-Mura, Ibaraki-Ken (Japan)

    2000-07-01

    The demonstration test of 4-Group Partitioning Process with concentrated real high-level liquid waste (HLLW) was carried out in the Partitioning Test Facility installed in a hot cell. More than 99.998% of Am and Cm were extracted from the HLLW with the organic solvent containing 0.5 M DIDPA - 0.1 M TBP, and more than 99.98% of Am and Cm were back-extracted with 4 M nitric acid. Np and Pu were extracted simultaneously, and more than 99.93% of Np and more than 99.98% of Pu were back-extracted with oxalic acid. In the denitration step for the separation of Tc and platinum group metals, more than 90% of Rh and more than 97% of Pd were precipitated. About half of Ru were remained in the de-nitrated solution, but the remaining Ru were quantitatively precipitated by neutralization of the de-nitrated solution to pH 6.7. In the adsorption step, both Sr and Cs were separated effectively. Decontamination factors for Cs and Sr were more than 10{sup 6} and 10{sup 4} respectively in all effluent samples. (authors)

  11. Empirical constraints on partitioning of platinum group elements between Cr-spinel and primitive terrestrial magmas

    Science.gov (United States)

    Park, Jung-Woo; Kamenetsky, Vadim; Campbell, Ian; Park, Gyuseung; Hanski, Eero; Pushkarev, Evgeny

    2017-11-01

    Recent experimental studies and in situ LA-ICP-MS analysis on natural Cr-spinel have shown that Rh and IPGEs (Ir-group platinum group elements: Ru, Ir, Os) are enriched in the lattice of Cr-spinel. However, the factors controlling the partitioning behaviour of these elements are not well constrained. In this study, we report the Rh, IPGE, and trace element contents in primitive Cr-spinel, measured by LA-ICP-MS, from nine volcanic suites covering various tectonic settings including island arc picrites, boninites, large igneous province picrites and mid-ocean ridge basalts. The aim is to understand the factors controlling the enrichment of Rh and IPGEs in Cr-spinels, to estimate empirical partition coefficients between Cr-spinel and silicate melts, and to investigate the role of Cr-spinel fractional crystallization on the PGE geochemistry of primitive magmas during the early stages of fractional crystallization. There are systematic differences in trace elements, Rh and IPGEs in Cr-spinels from arc-related magmas (Arc Group Cr-spinel), intraplate magmas (Intraplate Group Cr-spinel), and mid-ocean ridge magmas (MORB Group Cr-spinel). Arc Group Cr-spinels are systematically enriched in Sc, Co and Mn and depleted in Ni compared to the MORB Group Cr-spinels. Intraplate Group Cr-spinels are distinguished from the Arc Group Cr-spinels by their high Ni contents. Both the Arc and Intraplate Group Cr-spinels have total Rh and IPGE contents of 22-689 ppb whereas the MORB Group Cr-spinels are depleted in Rh and IPGE (total controlled by a combination of the Rh and IPGE contents in parental melts and the magnetite component of the spinel. Empirical partition coefficients (D) for Rh and IPGEs between Cr-spinels and silicate melts were calculated using the Rh and IPGE contents of the Cr-spinel and their host volcanic rocks after subtracting the accumulation effect of Cr-spinel. The D values for the Intraplate and MORB Group Cr-spinels increase with increasing magnetite component

  12. String partition functions, Hilbert schemes and affine Lie algebra representations on homology groups

    International Nuclear Information System (INIS)

    Bonora, Loriano; Bytsenko, Andrey; Elizalde, Emilio

    2012-01-01

    This review paper contains a concise introduction to highest weight representations of infinite-dimensional Lie algebras, vertex operator algebras and Hilbert schemes of points, together with their physical applications to elliptic genera of superconformal quantum mechanics and superstring models. The common link of all these concepts and of the many examples considered in this paper is to be found in a very important feature of the theory of infinite-dimensional Lie algebras: the modular properties of the characters (generating functions) of certain representations. The characters of the highest weight modules represent the holomorphic parts of the partition functions on the torus for the corresponding conformal field theories. We discuss the role of the unimodular (and modular) groups and the (Selberg-type) Ruelle spectral functions of hyperbolic geometry in the calculation of elliptic genera and associated q-series. For mathematicians, elliptic genera are commonly associated with new mathematical invariants for spaces, while for physicists elliptic genera are one-loop string partition function. (Therefore, they are applicable, for instance, to topological Casimir effect calculations.) We show that elliptic genera can be conveniently transformed into product expressions, which can then inherit the homology properties of appropriate polygraded Lie algebras. This article is part of a special issue of Journal of Physics A: Mathematical and Theoretical in honour of Stuart Dowker’s 75th birthday devoted to ‘Applications of zeta functions and other spectral functions in mathematics and physics’. (review)

  13. Text string detection from natural scenes by structure-based partition and grouping.

    Science.gov (United States)

    Yi, Chucai; Tian, YingLi

    2011-09-01

    Text information in natural scene images serves as important clues for many image-based applications such as scene understanding, content-based image retrieval, assistive navigation, and automatic geocoding. However, locating text from a complex background with multiple colors is a challenging task. In this paper, we explore a new framework to detect text strings with arbitrary orientations in complex natural scene images. Our proposed framework of text string detection consists of two steps: 1) image partition to find text character candidates based on local gradient features and color uniformity of character components and 2) character candidate grouping to detect text strings based on joint structural features of text characters in each text string such as character size differences, distances between neighboring characters, and character alignment. By assuming that a text string has at least three characters, we propose two algorithms of text string detection: 1) adjacent character grouping method and 2) text line grouping method. The adjacent character grouping method calculates the sibling groups of each character candidate as string segments and then merges the intersecting sibling groups into text string. The text line grouping method performs Hough transform to fit text line among the centroids of text candidates. Each fitted text line describes the orientation of a potential text string. The detected text string is presented by a rectangle region covering all characters whose centroids are cascaded in its text line. To improve efficiency and accuracy, our algorithms are carried out in multi-scales. The proposed methods outperform the state-of-the-art results on the public Robust Reading Dataset, which contains text only in horizontal orientation. Furthermore, the effectiveness of our methods to detect text strings with arbitrary orientations is evaluated on the Oriented Scene Text Dataset collected by ourselves containing text strings in nonhorizontal

  14. Recursive heuristic classification

    Science.gov (United States)

    Wilkins, David C.

    1994-01-01

    The author will describe a new problem-solving approach called recursive heuristic classification, whereby a subproblem of heuristic classification is itself formulated and solved by heuristic classification. This allows the construction of more knowledge-intensive classification programs in a way that yields a clean organization. Further, standard knowledge acquisition and learning techniques for heuristic classification can be used to create, refine, and maintain the knowledge base associated with the recursively called classification expert system. The method of recursive heuristic classification was used in the Minerva blackboard shell for heuristic classification. Minerva recursively calls itself every problem-solving cycle to solve the important blackboard scheduler task, which involves assigning a desirability rating to alternative problem-solving actions. Knowing these ratings is critical to the use of an expert system as a component of a critiquing or apprenticeship tutoring system. One innovation of this research is a method called dynamic heuristic classification, which allows selection among dynamically generated classification categories instead of requiring them to be prenumerated.

  15. Recursion, Computers and Art

    Science.gov (United States)

    Kemp, Andy

    2007-01-01

    "Geomlab" is a functional programming language used to describe pictures that are made up of tiles. The beauty of "Geomlab" is that it introduces students to recursion, a very powerful mathematical concept, through a very simple and enticing graphical environment. Alongside the software is a series of eight worksheets which lead into producing…

  16. 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...

  17. Typing polymorphic recursion

    OpenAIRE

    Figueiredo, Lucília Camarão de; Camarão, Carlos

    2001-01-01

    This paper discusses some advantages of supporting polymorphic recursión in programming languages and describes a decidable type inference algorithm for typing polymorphic and possibly mutually recursive definitions, using Haskell to provide an executable high level specification of the algorithm.

  18. 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

  19. Partitioning taxonomic diversity of aquatic insect assemblages and functional feeding groups in Neotropical Savanna headwater streams

    Science.gov (United States)

    Biological diversity can be divided into: alpha (α, local), beta (β, difference in assemblage composition among locals), and gamma (γ, total diversity). We assessed the partitioning of taxonomic diversity of Ephemeroptera, Plecoptera and Trichoptera (EPT) and of functional feedin...

  20. Partitioning taxonomic diversity of aquatic insect assemblages and functional feeding groups in Neotropical Savanna headwater streams

    Science.gov (United States)

    Biological diversity can be divided into: alpha (α, local), beta (β, difference in assemblage composition among locals), and gamma (γ, total diversity). We assessed the partitioning of taxonomic diversity of Ephemeroptera, Plecoptera and Trichoptera (EPT) and of ...

  1. 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.

  2. 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. science direct.com/ science /article/pii/S0168007215001293

  3. Recursive Rational Choice.

    Science.gov (United States)

    1981-11-01

    402. Putnam , Hilary , [1973], "Recursive Functions and Hierarchies", American Mathematical Monthly, Vol.80, pp.6 8-8 6 . Rice, H.G., [1954...point the reader is also referred to Putnam [19731. The following are useful facts (cf. Kleene [1950]) that we will make reference to subsequently. The...Hierarchy (Cf. Putnam [19731, pp.77-80 and Hermes [1965] pp.192-202). The classification is made in terms of the structure of the definitions that

  4. 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

  5. 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.

  6. Recursive Advice for Coordination

    DEFF Research Database (Denmark)

    Terepeta, Michal Tomasz; Nielson, Hanne Riis; Nielson, Flemming

    2012-01-01

    Aspect-oriented programming is a programming paradigm that is often praised for the ability to create modular software and separate cross-cutting concerns. Recently aspects have been also considered in the context of coordination languages, offering similar advantages. However, introducing aspect...... systems. Even though primarily used for analysis of recursive programs, we are able to adapt them to fit this new context.......Aspect-oriented programming is a programming paradigm that is often praised for the ability to create modular software and separate cross-cutting concerns. Recently aspects have been also considered in the context of coordination languages, offering similar advantages. However, introducing aspects...

  7. Voltage equalization of an ultracapacitor module by cell grouping using number partitioning algorithm

    Science.gov (United States)

    Oyarbide, E.; Bernal, C.; Molina, P.; Jiménez, L. A.; Gálvez, R.; Martínez, A.

    2016-01-01

    Ultracapacitors are low voltage devices and therefore, for practical applications, they need to be used in modules of series-connected cells. Because of the inherent manufacturing tolerance of the capacitance parameter of each cell, and as the maximum voltage value cannot be exceeded, the module requires inter-cell voltage equalization. If the intended application suffers repeated fast charging/discharging cycles, active equalization circuits must be rated to full power, and thus the module becomes expensive. Previous work shows that a series connection of several sets of paralleled ultracapacitors minimizes the dispersion of equivalent capacitance values, and also the voltage differences between capacitors. Thus the overall life expectancy is improved. This paper proposes a method to distribute ultracapacitors with a number partitioning-based strategy to reduce the dispersion between equivalent submodule capacitances. Thereafter, the total amount of stored energy and/or the life expectancy of the device can be considerably improved.

  8. 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.

  9. Recursion relations from soft theorems

    Energy Technology Data Exchange (ETDEWEB)

    Luo, Hui [II. Institut für Theoretische Physik, Universität Hamburg, Luruper Chaussee 149, Hamburg, D-22761 (Germany); Wen, Congkao [I.N.F.N. Sezione di Roma “Tor Vergata”,Via della Ricerca Scientifica, Roma, 00133 (Italy)

    2016-03-14

    We establish a set of new on-shell recursion relations for amplitudes satisfying soft theorems. The recursion relations can apply to those amplitudes whose additional physical inputs from soft theorems are enough to overcome the bad large-z behaviour. This work is a generalization of the recursion relations recently obtained by Cheung et al. for amplitudes in scalar effective field theories with enhanced vanishing soft behaviours, which can be regarded as a special case of those with non-vanishing soft limits. We apply the recursion relations to tree-level amplitudes in various theories, including amplitudes in the Akulov-Volkov theory and amplitudes containing dilatons of spontaneously-broken conformal symmetry.

  10. 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.

  11. Recursive Ultrasound Imaging

    DEFF Research Database (Denmark)

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

    1999-01-01

    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......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...... 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...

  12. Diabatic initialization using recursive filters

    Science.gov (United States)

    Lynch, Peter; Huang, Xiang-Yu

    1994-10-01

    Several initialization schemes based on recursive filters are formulated and tested with a numerical weather prediction model, HIRLAM. These have an advantage over schemes which use non-recursive filters in that they derive the initialized values from a diabatic trajectory passing through the original analysis. The changes to the analysed fields are comparable in size to typical observational errors. A non-recursive implementation of the recursive filters makes the new initialization schemes as easy to use as the original non-recursive filter schemes. It also allows use of higher-order filters without added cost. An initialization method using a 6th order filter is compared to a scheme based on an non-recursive optimal filter, and is found to produce similar results for less than half the computational cost. If the sole aim is noise suppression, a filter whose output validates later than the initial time may be used. The advantage of this is that computation time is further reduced and phase error completely eliminated.

  13. Partitioning and transmutation. Current developments - 2007. A report from the Swedish reference group on P-T-research

    Energy Technology Data Exchange (ETDEWEB)

    Ahlstroem, Per-Eric (ed.) [Swedish Nuclear Fuel and Waste Management Co., Stockholm (Sweden); Blomgren, Jan [Uppsala Univ. (Sweden). Dept. of Neutron Research; Ekberg, Christian; Englund, Sofie; Fermvik, Anna; Liljenzin, Jan-Olov; Retegan, Teodora; Skarnemark, Gunnar [Chalmers Univ. of Technology, Goeteborg (Sweden); Eriksson, Marcus; Seltborg, Per; Wallenius, Jan; Westlen, Daniel [Royal Inst. of Technology, Stockholm (Sweden)

    2007-06-15

    This report is written on behalf of the Swedish reference group for research on partitioning and transmutation. The reference group has been assembled by SKB and its members represent the teams that are active in this field at Swedish universities. The present report summarises the progress in the field through the years 2004-2006. A prerequisite for transmutation by irradiation with neutrons is that the nuclides to be transmuted are separated (partitioned) from the other nuclides in the spent fuel. In particular the remaining uranium must be taken away unless you want to produce more plutonium and other transuranium elements. Separation of the various elements can at least in principle be achieved by mechanical and chemical processes. Currently there exist some large scale facilities for separation of uranium and plutonium from the spent fuel-reprocessing plants. These can, however, not separate the minor actinides - neptunium, americium and curium - from the high level waste that goes to a repository. Plutonium constitutes about 90% of the transuranium elements in fuel from light water reactors. The objective of current research on partitioning is to find and develop processes suitable for separation of the heavier actinides (and possibly some long-lived fission products) on an industrial scale. The objective of current research on transmutation is to define, investigate and develop facilities that may be suitable for transmutation of the aforementioned long-lived radionuclides. The research on partitioning has made important progress in recent years. In some cases one has succeeded to separate americium and curium. Many challenges remain however. Within hydrochemistry one has achieved sufficiently good distribution and separation factors. The focus turns now towards development of an operating process. The search for ligands that give sufficiently good extraction and separation will continue but with less intensity. The emphasis will rather be on improving

  14. Partitioning and transmutation. Current developments - 2007. A report from the Swedish reference group on P-T-research

    International Nuclear Information System (INIS)

    Ahlstroem, Per-Eric; Blomgren, Jan; Eriksson, Marcus; Seltborg, Per; Wallenius, Jan; Westlen, Daniel

    2007-06-01

    This report is written on behalf of the Swedish reference group for research on partitioning and transmutation. The reference group has been assembled by SKB and its members represent the teams that are active in this field at Swedish universities. The present report summarises the progress in the field through the years 2004-2006. A prerequisite for transmutation by irradiation with neutrons is that the nuclides to be transmuted are separated (partitioned) from the other nuclides in the spent fuel. In particular the remaining uranium must be taken away unless you want to produce more plutonium and other transuranium elements. Separation of the various elements can at least in principle be achieved by mechanical and chemical processes. Currently there exist some large scale facilities for separation of uranium and plutonium from the spent fuel-reprocessing plants. These can, however, not separate the minor actinides - neptunium, americium and curium - from the high level waste that goes to a repository. Plutonium constitutes about 90% of the transuranium elements in fuel from light water reactors. The objective of current research on partitioning is to find and develop processes suitable for separation of the heavier actinides (and possibly some long-lived fission products) on an industrial scale. The objective of current research on transmutation is to define, investigate and develop facilities that may be suitable for transmutation of the aforementioned long-lived radionuclides. The research on partitioning has made important progress in recent years. In some cases one has succeeded to separate americium and curium. Many challenges remain however. Within hydrochemistry one has achieved sufficiently good distribution and separation factors. The focus turns now towards development of an operating process. The search for ligands that give sufficiently good extraction and separation will continue but with less intensity. The emphasis will rather be on improving

  15. 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.

  16. 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.

  17. Fair partitions of polygons: An elementary introduction

    Indian Academy of Sciences (India)

    above proposition implies: the augmented recursion achieves a convex fair partition of any convex polygon into 4 pieces. Let the boundary of a convex polygon be parametrized by the length s measured from any boundary point. For every value of s, there is a point P on the boundary and a unique point P antipodal to P (i.e. ...

  18. 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…

  19. 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

  20. Recursive Ping-Pong Protocols

    DEFF Research Database (Denmark)

    Huttel, Hans; Srba, Jiri

    2004-01-01

    This paper introduces a process calculus with recursion which allows us to express an unbounded number of runs of the ping-pong protocols introduced by Dolev and Yao. We study the decidability issues associated with two common approaches to checking security properties, namely reachability analysis...

  1. 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...

  2. Vertical partitioning of phosphate uptake among picoplankton groups in the low Pi Mediterranean Sea

    KAUST Repository

    Talarmin, Agathe Anne Gaelle

    2015-02-26

    Microbial transformations are key processes in marine phosphorus cycling. In this study, we investigated the contribution of phototrophic and heterotrophic groups to phosphate (Pi) uptake fluxes in the euphotic zone of the low-Pi Mediterranean Sea and estimated Pi uptake kinetic characteristics. Surface soluble reactive phosphorus (SRP) concentrations were in the range of 6-80 nmol Lg\\'1 across the transect, and the community Pi turnover times, assessed using radiolabeled orthophosphate incubations, were longer in the western basin, where the highest bulk and cellular rates were measured. Using live cell sorting, four vertical profiles of Pi uptake rates were established for heterotrophic prokaryotes (Hprok), phototrophic picoeukaryotes (Pic) and Prochlorococcus (Proc) and Synechococcus (Syn) cyanobacteria. Hprok cells contributed up to 82% of total Pi uptake fluxes in the superficial euphotic zone, through constantly high abundances (2.7-10.2 × 105 cells mLg\\'1) but variable cellular rates (6.6 ± 9.3 amol P cellg\\'1 hg\\'1). Cyanobacteria achieved most of the Pi uptake (up to 62%) around the deep chlorophyll maximum depth, through high abundances (up to 1.4 × 105 Proc cells mLg\\'1) and high cellular uptake rates (up to 40 and 402 amol P cellg\\'1 hg\\'1, respectively for Proc and Syn cells). At saturating concentrations, maximum cellular rates up to 132 amol P cellg\\'1 hg\\'1 were measured for Syn at station (St.) C, which was 5 and 60 times higher than Proc and Hprok, respectively. Pi uptake capabilities of the different groups likely contribute to their vertical distribution in the low Pi Mediterranean Sea, possibly along with other energy limitations.

  3. Vegetative compatibility groups partition variation in the virulence of Verticillium dahliae on strawberry.

    Science.gov (United States)

    Fan, Rong; Cockerton, Helen M; Armitage, Andrew D; Bates, Helen; Cascant-Lopez, Emma; Antanaviciute, Laima; Xu, Xiangming; Hu, Xiaoping; Harrison, Richard J

    2018-01-01

    Verticillium dahliae infection of strawberry (Fragaria x ananassa) is a major cause of disease-induced wilting in soil-grown strawberries across the world. To understand what components of the pathogen are affecting disease expression, the presence of the known effector VdAve1 was screened in a sample of Verticillium dahliae isolates. Isolates from strawberry were found to contain VdAve1 and were divided into two major clades, based upon their vegetative compatibility groups (VCG); no UK strawberry isolates contained VdAve1. VC clade was strongly related to their virulence levels. VdAve1-containing isolates pathogenic on strawberry were found in both clades, in contrast to some recently published findings. On strawberry, VdAve1-containing isolates had significantly higher virulence during early infection, which diminished in significance as the infection progressed. Transformation of a virulent non-VdAve1 containing isolate, with VdAve1 was found neither to increase nor decrease virulence when inoculated on a susceptible strawberry cultivar. There are therefore virulence factors that are epistatic to VdAve1 and potentially multiple independent routes to high virulence on strawberry in V. dahliae lineages. Genome sequencing a subset of isolates across the two VCGs revealed that isolates were differentiated at the whole genome level and contained multiple changes in putative effector content, indicating that different clonal VCGs may have evolved different strategies for infecting strawberry, leading to different virulence levels in pathogenicity tests. It is therefore important to consider both clonal lineage and effector complement as the adaptive potential of each lineage will differ, even if they contain the same race determining effector.

  4. 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...

  5. Partitioning and transmutation. Current developments - 2010. A report from the Swedish reference group for PT-research

    International Nuclear Information System (INIS)

    Blomgren, Jan; Karlsson, Fred; Pomp, Stephan; Aneheim, Emma; Ekberg, Christian; Fermvik, Anna; Skarnemark, Gunnar; Wallenius, Janne; Zakova, Jitka; Grenthe, Ingemar; Szabo, Zoltan

    2010-01-01

    The research and development on methods for partitioning and transmutation (P and T) of long-lived radionuclides in spent nuclear fuel has attracted considerable interest during the last decade. The main objective of P and T is to eliminate or at least substantially reduce the amount of such long-lived radionuclides that has to go to a deep geological repository for final disposal. The objective of current research on partitioning is to find and develop processes suitable for separation of the heavier actinides (and possibly some long-lived fission products) on an industrial scale. The objective of current research on transmutation is to define, investigate and develop facilities that may be suitable for transmutation of the long-lived radionuclides. The research on partitioning has made important progress in recent years. In some cases one has succeeded to separate americium and curium. Many challenges remain however. Within hydrochemistry one has achieved sufficiently good distribution and separation factors. The focus turns now towards development of an operating process. The search for ligands that give sufficiently good extraction and separation will continue but with less intensity. The emphasis will rather be on improving stability against hydrolysis and radiolysis. This may be achieved either by additives to the solvent or by selection of a proper solvent. The development of processes and equipment must be intensified. Pyrochemical research is looking into methods for recovery of uranium and for separating fission products with large neutron cross sections. The objective is to avoid separation of plutonium from other transuranium elements and thus simplify the proliferation issue. The future work is focused on improved selectivity and on technical development. Design of processes and equipment is difficult due to the aggressive properties of the melts and the relatively high temperatures required. The fabrication of fuel for transmutation and the

  6. Partitioning and transmutation. Current developments - 2010. A report from the Swedish reference group for PT-research

    Energy Technology Data Exchange (ETDEWEB)

    Blomgren, Jan (ed.) (Swedish Centre for Nuclear Technology, SKC, Stockholm (Sweden)); Karlsson, Fred (Swedish Nuclear Fuel and Waste Management Co., Stockholm (Sweden)); Pomp, Stephan (Uppsala Univ., Uppsala, Dept. of Physics and Astronomy, Div. of Applied Nuclear Physics (Sweden)); Aneheim, Emma; Ekberg, Christian; Fermvik, Anna; Skarnemark, Gunnar (Nuclear Chemistry, Dept. of Chemical and Biological Engineering, Chalmers Univ. of Technology, Goeteborg (Sweden)); Wallenius, Janne; Zakova, Jitka (Reactor Physics Div., Physics Dept., Royal Inst. of Technology, Stockholm (Sweden)); Grenthe, Ingemar; Szabo, Zoltan (School of Chemical Science and Engineering, Royal Inst. of Technology, Stockholm (Sweden))

    2010-01-15

    The research and development on methods for partitioning and transmutation (P and T) of long-lived radionuclides in spent nuclear fuel has attracted considerable interest during the last decade. The main objective of P and T is to eliminate or at least substantially reduce the amount of such long-lived radionuclides that has to go to a deep geological repository for final disposal. The objective of current research on partitioning is to find and develop processes suitable for separation of the heavier actinides (and possibly some long-lived fission products) on an industrial scale. The objective of current research on transmutation is to define, investigate and develop facilities that may be suitable for transmutation of the long-lived radionuclides. The research on partitioning has made important progress in recent years. In some cases one has succeeded to separate americium and curium. Many challenges remain however. Within hydrochemistry one has achieved sufficiently good distribution and separation factors. The focus turns now towards development of an operating process. The search for ligands that give sufficiently good extraction and separation will continue but with less intensity. The emphasis will rather be on improving stability against hydrolysis and radiolysis. This may be achieved either by additives to the solvent or by selection of a proper solvent. The development of processes and equipment must be intensified. Pyrochemical research is looking into methods for recovery of uranium and for separating fission products with large neutron cross sections. The objective is to avoid separation of plutonium from other transuranium elements and thus simplify the proliferation issue. The future work is focused on improved selectivity and on technical development. Design of processes and equipment is difficult due to the aggressive properties of the melts and the relatively high temperatures required. The fabrication of fuel for transmutation and the

  7. 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

  8. Core Recursive Hierarchical Image Segmentation

    Science.gov (United States)

    Tilton, James

    2011-01-01

    The Recursive Hierarchical Image Segmentation (RHSEG) software has been repackaged to provide a version of the RHSEG software that is not subject to patent restrictions and that can be released to the general public through NASA GSFC's Open Source release process. Like the Core HSEG Software Package, this Core RHSEG Software Package also includes a visualization program called HSEGViewer along with a utility program HSEGReader. It also includes an additional utility program called HSEGExtract. The unique feature of the Core RHSEG package is that it is a repackaging of the RHSEG technology designed to specifically avoid the inclusion of the certain software technology. Unlike the Core HSEG package, it includes the recursive portions of the technology, but does not include processing window artifact elimination technology.

  9. Modeling relationships between calving traits: a comparison between standard and recursive mixed models.

    Science.gov (United States)

    de Maturana, Evangelina López; de los Campos, Gustavo; Wu, Xiao-Lin; Gianola, Daniel; Weigel, Kent A; Rosa, Guilherme J M

    2010-01-25

    The use of structural equation models for the analysis of recursive and simultaneous relationships between phenotypes has become more popular recently. The aim of this paper is to illustrate how these models can be applied in animal breeding to achieve parameterizations of different levels of complexity and, more specifically, to model phenotypic recursion between three calving traits: gestation length (GL), calving difficulty (CD) and stillbirth (SB). All recursive models considered here postulate heterogeneous recursive relationships between GL and liabilities to CD and SB, and between liability to CD and liability to SB, depending on categories of GL phenotype. Four models were compared in terms of goodness of fit and predictive ability: 1) standard mixed model (SMM), a model with unstructured (co)variance matrices; 2) recursive mixed model 1 (RMM1), assuming that residual correlations are due to the recursive relationships between phenotypes; 3) RMM2, assuming that correlations between residuals and contemporary groups are due to recursive relationships between phenotypes; and 4) RMM3, postulating that the correlations between genetic effects, contemporary groups and residuals are due to recursive relationships between phenotypes. For all the RMM considered, the estimates of the structural coefficients were similar. Results revealed a nonlinear relationship between GL and the liabilities both to CD and to SB, and a linear relationship between the liabilities to CD and SB.Differences in terms of goodness of fit and predictive ability of the models considered were negligible, suggesting that RMM3 is plausible. The applications examined in this study suggest the plausibility of a nonlinear recursive effect from GL onto CD and SB. Also, the fact that the most restrictive model RMM3, which assumes that the only cause of correlation is phenotypic recursion, performs as well as the others indicates that the phenotypic recursion may be an important cause of the

  10. The UNIFAC-NRF activity coefficient model based on group contribution for partitioning of proteins in aqueous two phase (polymer + salt) systems

    Energy Technology Data Exchange (ETDEWEB)

    Haghtalab, Ali [Department of Chemical Engineering, Tarbiat Modarres University, P.O. Box: 14115-175, Tehran (Iran, Islamic Republic of)]. E-mail: haghtala@modares.ac.ir; Mokhtarani, Babak [Department of Chemical Engineering, Tarbiat Modarres University, P.O. Box: 14115-175, Tehran (Iran, Islamic Republic of)

    2005-03-01

    The group contribution model, UNIFAC-NRF, was applied for correlation of partition coefficient of proteins. This model was already developed for aqueous two phase of (polymer + salt) systems. The protein molecules were divided into some patches assumed to have interaction with the other species in aqueous (polymer + salt) systems. The binary interaction parameters were used for prediction of protein partitioning in aqueous two phase systems. These parameters were obtained by correlating the binary electrolyte solution and ternary aqueous two phase systems. The results of UNIFAC-NRF model are in a very good agreement with the experimental data for partitioning of lysozyme in both (PEG + K{sub 2}HPO{sub 4} + water) and (PEG + Na{sub 2}SO{sub 4} + water) systems at different pHs. The comparison of the results, which were obtained by both UNIFAC-NRF and the VERS models, shows that the present group contribution model can correlate the partitioning of protein in ATPS better than the VERS model.

  11. 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.

  12. 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....

  13. Recursion Removal as an Instructional Method to Enhance the Understanding of Recursion Tracing

    Science.gov (United States)

    Velázquez-Iturbide, J. Ángel; Castellanos, M. Eugenia; Hijón-Neira, Raquel

    2016-01-01

    Recursion is one of the most difficult programming topics for students. In this paper, an instructional method is proposed to enhance students' understanding of recursion tracing. The proposal is based on the use of rules to translate linear recursion algorithms into equivalent, iterative ones. The paper has two main contributions: the…

  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. 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

  16. Command Algebras, Recursion and Program Transformation

    NARCIS (Netherlands)

    Hesselink, Wim H.

    1990-01-01

    Dijkstra's language of guarded commands is extended with recursion and transformed into algebra. The semantics is expressed in terms of weakest preconditions and weakest liberal preconditions. Extreme fixed points are used to deal with recursion. Unbounded nondeterminacy is allowed. The algebraic

  17. 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.

  18. 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.

  19. 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...... of LWSs. It is endowed with simultaneous recursive equations, which specify the weakest properties satisfied by the recursive variables. We demonstrate that RWL is sufficiently expressive to characterize weighted-bisimilarity of LWSs. In addition, we prove that the logic is decidable, i...

  20. 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.

  1. 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.

  2. 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.

  3. 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

  4. Partitioning and transmutation. Current developments - 2004. A report from the Swedish reference group on P and T-research

    International Nuclear Information System (INIS)

    Ahlstroem, Per-Eric; Andersson, Sofie; Ekberg, Christian; Liljenzin, Jan-Olov; Nilsson, Mikael; Skarnemark, Gunnar; Blomgren, Jan

    2004-05-01

    This report summarises the work reported in the years 1998-2003 and tries to assess the prospects for future development of partitioning and transmutation (P-T) as seen from a Swedish perspective. The R and D efforts on P-T have increased somewhat during the period 1998-2003. Research on P-T has taken a prominent role internationally in the R and D on future nuclear power and nuclear fuel cycle systems. Despite the fact that partitioning and transmutation have been on the agenda for quite a few years there are still a number of issues that must be settled before the research and development can be given a clearly focused direction. Studies propose research programmes for about six years at the cost of a couple of hundred million Euros. The construction of a small ADS experimental plant is a necessary step to develop and demonstrate the concept. This experimental plant should then be followed by a demonstration plant in almost full scale. Such a plant can at the earliest be ready in the mid-2030s. A number of circumstances have, however, contributed to slower speed, less intensity and lower funding than proposed in the studies. There is no unanimous view on the objectives for partitioning and transmutation. Many see it as a way to achieve broad acceptance for nuclear power at large. Others promote it as a way to get out of the impasse for a deep repository in several countries. Others again put a strong emphasise on the proliferation aspects. There is no unanimous view on the need to develop ADS or for the role of ADS in a P-T-system. Some advocate that ADS should be used for burning of all transuranium nuclides from the present enriched uranium fuelled light water reactors. Others see the ADS as a supplement particularly suitable for burning minor actinides (americium, curium and neptunium), whereas the major part of the plutonium should be burned in light water reactors (or in fast reactors) There is no consensus among experts on which technical route to follow

  5. Partitioning and transmutation. Current developments - 2004. A report from the Swedish reference group on P and T-research

    Energy Technology Data Exchange (ETDEWEB)

    Ahlstroem, Per-Eric (ed.) [Swedish Nuclear Fuel and Waste Management Co., Stockholm (Sweden); Andersson, Sofie; Ekberg, Christian; Liljenzin, Jan-Olov; Nilsson, Mikael; Skarnemark, Gunnar [Chalmers Univ. of Technology, Goeteborg (Sweden); Blomgren, Jan [Uppsala Univ. (Sweden). Dept. of Neutron Research; Eriksson, Marcus; Gudowski, Waclaw; Seltborg, Per; Wallenius, Jan; Sehgal, Bal Raj [Royal Inst. of Technology, Stockholm (Sweden)

    2004-05-01

    This report summarises the work reported in the years 1998-2003 and tries to assess the prospects for future development of partitioning and transmutation (P-T) as seen from a Swedish perspective. The R and D efforts on P-T have increased somewhat during the period 1998-2003. Research on P-T has taken a prominent role internationally in the R and D on future nuclear power and nuclear fuel cycle systems. Despite the fact that partitioning and transmutation have been on the agenda for quite a few years there are still a number of issues that must be settled before the research and development can be given a clearly focused direction. Studies propose research programmes for about six years at the cost of a couple of hundred million Euros. The construction of a small ADS experimental plant is a necessary step to develop and demonstrate the concept. This experimental plant should then be followed by a demonstration plant in almost full scale. Such a plant can at the earliest be ready in the mid-2030s. A number of circumstances have, however, contributed to slower speed, less intensity and lower funding than proposed in the studies. There is no unanimous view on the objectives for partitioning and transmutation. Many see it as a way to achieve broad acceptance for nuclear power at large. Others promote it as a way to get out of the impasse for a deep repository in several countries. Others again put a strong emphasise on the proliferation aspects. There is no unanimous view on the need to develop ADS or for the role of ADS in a P-T-system. Some advocate that ADS should be used for burning of all transuranium nuclides from the present enriched uranium fuelled light water reactors. Others see the ADS as a supplement particularly suitable for burning minor actinides (americium, curium and neptunium), whereas the major part of the plutonium should be burned in light water reactors (or in fast reactors) There is no consensus among experts on which technical route to follow

  6. 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

  7. 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.

  8. On semantics and applications of guarded recursion

    DEFF Research Database (Denmark)

    Bizjak, Aleš

    2016-01-01

    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...... chapter we study a simply typed calculus with additional "later" and "constant" modalities and a guarded fixed-point combinator. These are used for encoding and working with guarded recursive and coinductive types in a modular way. We develop a normalising operational semantics, provide an adequate...... 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...

  9. 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...

  10. Recursive technique for inverting the lidar equation

    Science.gov (United States)

    Gonzalez, Raul

    1988-07-01

    A method for extracting the extinction coefficient from lidar signals is presented. The method assumes the backscatter and extinction coefficient to be related by a power law and consists of approximating the integral in the lidar equation by a Riemann sum of the extinction coefficients. This approximation allows the development of two recursion formulas for extracting the extinction coefficient as a function of range. One formula is a forward recursion, and the other is a backward recursion in the sense that solutions are generated for r greater than or equal to r(0) and for r less than or equal to r(m), respectively, where r(0) is a near-end range and r(m) is a far-end reference range.

  11. 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.

  12. Denotational semantics of recursive types in synthetic guarded domain theory

    DEFF Research Database (Denmark)

    Møgelberg, Rasmus Ejlers; Paviotti, Marco

    2016-01-01

    -determinism and concurrency. Guarded recursion also offers a way of adding recursion to type theory while maintaining logical consistency. In previous work we initiated a programme of denotational semantics in type theory using guarded recursion, by constructing a computationally adequate model of the language PCF (simply...... 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...... semantics in type theory with guarded recursion. More precisely, we give a computationally adequate denotational semantics to the language FPC (simply typed lambda calculus extended with recursive types), modelling recursive types using guarded recursive types. The model is intensional in the same way...

  13. 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

  14. Rapid calculation of partition functions and free energies of fluids.

    Science.gov (United States)

    Do, Hainam; Hirst, Jonathan D; Wheatley, Richard J

    2011-11-07

    The partition function (Q) is a central quantity in statistical mechanics. All the thermodynamic properties can be derived from it. Here we show how the partition function of fluids can be calculated directly from simulations; this allows us to obtain the Helmholtz free energy (F) via F = -k(B)T ln Q. In our approach, we divide the density of states, assigning half of the configurations found in a simulation to a high-energy partition and half to a low-energy partition. By recursively dividing the low-energy partition into halves, we map out the complete density of states for a continuous system. The result allows free energy to be calculated directly as a function of temperature. We illustrate our method in the context of the free energy of water.

  15. 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

  16. Image coding using adaptive recursive interpolative DPCM.

    Science.gov (United States)

    Gifford, E A; Hunt, B R; Marcellin, M W

    1995-01-01

    A predictive image coder having minimal decoder complexity is presented. The image coder utilizes recursive interpolative DPCM in conjunction with adaptive classification, entropy-constrained trellis coded quantization, and optimal rate allocation to obtain signal-to-noise ratios (SNRs) in the range of those provided by the most advanced transform coders.

  17. Recursive Delay Calculation Unit for Parametric Beamformer

    DEFF Research Database (Denmark)

    Nikolov, Svetoslav; Jensen, Jørgen Arendt; Tomov, Borislav Gueorguiev

    2006-01-01

    This paper presents a recursive approach for parametric delay calculations for a beamformer. The suggested calculation procedure is capable of calculating the delays for any image line defined by an origin and arbitrary direction. It involves only add and shift operations making it suitable...

  18. Stochastic gradient versus recursive least squares learning

    Czech Academy of Sciences Publication Activity Database

    Slobodyan, Sergey; Bogomolova, Anna; Kolyuzhnov, Dmitri

    -, č. 309 (2006), s. 1-21 ISSN 1211-3298 Institutional research plan: CEZ:AV0Z70850503 Keywords : constant gain adaptive learning * stochastic gradient learning * recursive least squares Subject RIV: AH - Economics http://www.cerge-ei.cz/pdf/wp/Wp309.pdf

  19. Recursive harmonic analysis for computing Hansen coefficients

    Science.gov (United States)

    Adel Sharaf, Mohamed; Hassan Selim, Hadia

    2010-12-01

    We report on a simple pure numerical method developed for computing Hansen coefficients by using a recursive harmonic analysis technique. The precision criteria of the computations are very satisfactory and provide materials for computing Hansen's and Hansen's like expansions, and also to check the accuracy of some existing algorithms.

  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. 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. 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.

  3. 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.

  4. Poly(ethylene glycol or Poly(ethylene oxide?: Magnitude of end-group Contribution to the Partitioning of Ethylene Oxide Oligomers and Polymers between Water and Organic Phases

    Directory of Open Access Journals (Sweden)

    Spitzer Marcos

    2002-01-01

    Full Text Available PEO partitioning from water to CH2Cl2 and CHCl3 increases with its molar mass, leveling off at ca. 3 000 g mol-1. Such a behaviour is related to PEO end-group contributions, suggesting a polyglycol to polyether transition at ca. 3 000 g mol-1.

  5. Trace-element composition and zoning in clinopyroxene- and amphibole-group minerals: Implications for element partitioning and evolution of carbonatites

    Science.gov (United States)

    Reguir, Ekaterina P.; Chakhmouradian, Anton R.; Pisiak, Laura; Halden, Norman M.; Yang, Panseok; Xu, Cheng; Kynický, Jindřich; Couëslan, Chris G.

    2012-01-01

    The present work is a first comprehensive study of the trace-element composition and zoning in clinopyroxene- and amphibole-group minerals from carbonatites, incorporating samples from 14 localities worldwide (Afrikanda, Aley, Alnö, Blue River, Eden Lake, Huayangchuan, Murun, Oka, Ozernaya Varaka, Ozernyi, Paint Lake, Pinghe, Prairie Lake, Turiy Mys). The new electron-microprobe data presented here significantly extend the known compositional range of clinopyroxenes and amphiboles from carbonatites. These data confirm that calcic and sodic clinopyroxenes from carbonatites are not separated by a compositional gap, instead forming an arcuate trend from nearly pure diopside through intermediate aegirine-augite compositions confined to a limited range of CaFeSi 2O 6 contents (15-45 mol%) to aegirine with magnesio-ferrikatophorite, richterite, magnesioriebeckite, ferri-nyböite and (potassic-)magnesio-arfvedsonite. In comparison with the clinopyroxenes, the amphiboles contain similar levels of tetravalent high-field-strength elements (Ti, Zr and Hf) and compatible transition elements (Cr, Co and Ni), but are capable of incorporating much higher concentrations of Sc and incompatible elements (up to 500 ppm Sc, 43 ppm Rb, 1470 ppm Sr, 1230 ppm Ba, 80 ppm Pb, 1070 ppm REE, 140 ppm Y, and 180 ppm Nb). In some carbonatites, amphiboles contribute as much as 25% of the Zr + Hf, 15% of the Sr and 35% of the Rb + Ba whole-rock budget. Both clinopyroxenes and amphiboles may also host a significant share (~ 10%) of the bulk heavy-REE content. Our trace-element data show that the partitioning of REE between clinopyroxene (and, in some samples, amphibole) and the melt is clearly bimodal and requires a revision of the existing models assuming single-site REE partitioning. Clinopyroxenes and amphiboles from carbonatites exhibit a diversity of zoning patterns that cannot be explained exclusively on the basis of crystal chemistry and relative compatibility of different trace-element in

  6. 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.)

  7. BCFW recursion for TMD parton scattering

    Energy Technology Data Exchange (ETDEWEB)

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

    2015-07-03

    We investigate the application of the BCFW recursion relation to scattering amplitudes with one off-shell particle in a Yang-Mills theory with fermions. We provide a set of conditions of applicability of the BCFW recursion, stressing some important differences with respect to the pure on-shell case. We show how the formulas for Maximally-Helicity-Violating (MHV) configurations with any number of partons, which are well known in the fully on-shell case, are generalized to this kinematic regime. We also derive analytic expressions for all the helicity configurations of the 5-point color-stripped tree-level amplitudes for any of the partons being off the mass shell.

  8. Extended Beta Regression in R: Shaken, Stirred, Mixed, and Partitioned

    OpenAIRE

    Bettina Grün; Ioannis Kosmidis; Achim Zeileis

    2011-01-01

    Beta regression - an increasingly popular approach for modeling rates and proportions - is extended in various directions: (a) bias correction/reduction of the maximum likelihood estimator, (b) beta regression tree models by means of recursive partitioning, (c) latent class beta regression by means of finite mixture models. All three extensions may be of importance for enhancing the beta regression toolbox in practice to provide more reliable inference and capture both observed and unobserved...

  9. Recursively indexed differential pulse code modulation

    Science.gov (United States)

    Sayood, Khalid; Na, Sangsin

    1992-01-01

    The performance of a differential pulse code modulation (DPCM) system with a recursively indexed quantizer (RIQ) under various conditions, with first order Gauss-Markov and Laplace-Markov sources as inputs, is studied. When the predictor is matched to the input, the proposed system performs at or close to the optimum entropy constrained DPCM system. If one is willing to accept a 5 percent increase in the rate, the system is very forgiving of predictor mismatch.

  10. 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...

  11. Methods for assessing movement path recursion with application to African buffalo in South Africa

    Science.gov (United States)

    Bar-David, S.; Bar-David, I.; Cross, P.C.; Ryan, S.J.; Knechtel, C.U.; Getz, W.M.

    2009-01-01

    Recent developments of automated methods for monitoring animal movement, e.g., global positioning systems (GPS) technology, yield high-resolution spatiotemporal data. To gain insights into the processes creating movement patterns, we present two new techniques for extracting information from these data on repeated visits to a particular site or patch ("recursions"). Identification of such patches and quantification of recursion pathways, when combined with patch-related ecological data, should contribute to our understanding of the habitat requirements of large herbivores, of factors governing their space-use patterns, and their interactions with the ecosystem. We begin by presenting output from a simple spatial model that simulates movements of large-herbivore groups based on minimal parameters: resource availability and rates of resource recovery after a local depletion. We then present the details of our new techniques of analyses (recursion analysis and circle analysis) and apply them to data generated by our model, as well as two sets of empirical data on movements of African buffalo (Syncerus coffer): the first collected in Klaserie Private Nature Reserve and the second in Kruger National Park, South Africa. Our recursion analyses of model outputs provide us with a basis for inferring aspects of the processes governing the production of buffalo recursion patterns, particularly the potential influence of resource recovery rate. Although the focus of our simulations was a comparison of movement patterns produced by different resource recovery rates, we conclude our paper with a comprehensive discussion of how recursion analyses can be used when appropriate ecological data are available to elucidate various factors influencing movement. Inter alia, these include the various limiting and preferred resources, parasites, and topographical and landscape factors. ?? 2009 by the Ecological Society of America.

  12. 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.

  13. Stability analysis of two-dimensional digital recursive filters

    Science.gov (United States)

    Alexander, W. E.; Pruess, S. A.

    1980-01-01

    A new approach to the stability problem for the two-dimensional digital recursive filter is presented. The bivariate difference equation representation of the two-dimensional recursive digital filter is converted to a multiinput-multioutput (MIMO) system similar to the state-space representation of the one-dimensional digital recursive filter. In this paper, a pseudo-state representation is used and three coefficient matrices are obtained. A general theorem for stability of two-dimensional digital recursive filters is derived and a very useful theorem is presented which expresses sufficient requirements for instability in terms of the spectral radii of these matrices.

  14. 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...... of fixed points of cellular automata on an infinite lattice....

  15. 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

  16. Recursive formula to compute Zernike radial polynomials.

    Science.gov (United States)

    Honarvar Shakibaei, Barmak; Paramesran, Raveendran

    2013-07-15

    In optics, Zernike polynomials are widely used in testing, wavefront sensing, and aberration theory. This unique set of radial polynomials is orthogonal over the unit circle and finite on its boundary. This Letter presents a recursive formula to compute Zernike radial polynomials using a relationship between radial polynomials and Chebyshev polynomials of the second kind. Unlike the previous algorithms, the derived recurrence relation depends neither on the degree nor on the azimuthal order of the radial polynomials. This leads to a reduction in the computational complexity.

  17. Recursion equations in gauge field theories

    International Nuclear Information System (INIS)

    Migdal, A.A.

    1975-01-01

    An approximate recursive equation describing scale transformation of the effective action of a gauging field has been formulated. The equation becomes exact in the two-dimensional space-time. In the four-dimensional theory it reproduces the asymptotic freedom with an accuracy of 30% in β-function coefficients. In the region of strong coupling β-function remains negative, that leads to an asymptotic ''prison'' in the infrared range. Some possible generalizations and appendices to the colour quark-gluon gauging theory are being discussed

  18. Recursive support vector machines for dimensionality reduction.

    Science.gov (United States)

    Tao, Qing; Chu, Dejun; Wang, Jue

    2008-01-01

    The usual dimensionality reduction technique in supervised learning is mainly based on linear discriminant analysis (LDA), but it suffers from singularity or undersampled problems. On the other hand, a regular support vector machine (SVM) separates the data only in terms of one single direction of maximum margin, and the classification accuracy may be not good enough. In this letter, a recursive SVM (RSVM) is presented, in which several orthogonal directions that best separate the data with the maximum margin are obtained. Theoretical analysis shows that a completely orthogonal basis can be derived in feature subspace spanned by the training samples and the margin is decreasing along the recursive components in linearly separable cases. As a result, a new dimensionality reduction technique based on multilevel maximum margin components and then a classifier with high accuracy are achieved. Experiments in synthetic and several real data sets show that RSVM using multilevel maximum margin features can do efficient dimensionality reduction and outperform regular SVM in binary classification problems.

  19. 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.

  20. Average weighted receiving time in recursive weighted Koch networks

    Indian Academy of Sciences (India)

    https://www.ias.ac.in/article/fulltext/pram/086/06/1173-1182. Keywords. Weighted Koch network; recursive division method; average weighted receiving time. Abstract. Motivated by the empirical observation in airport networks and metabolic networks, we introduce the model of the recursive weighted Koch networks created ...

  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 recursive approach to mortality-linked derivative pricing

    NARCIS (Netherlands)

    Shang, Z.; Goovaerts, M.; Dhaene, J.

    2011-01-01

    In this paper, we develop a recursive method to derive an exact numerical and nearly analytical representation of the Laplace transform of the transition density function with respect to the time variable for time-homogeneous diffusion processes. We further apply this recursion algorithm to the

  3. 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,…

  4. RECURSIVE LEAST SQUARES WITH REAL TIME STOCHASTIC MODELING: APPLICATION TO GPS RELATIVE POSITIONING

    Directory of Open Access Journals (Sweden)

    F. Zangeneh-Nejad

    2017-09-01

    Full Text Available Geodetic data processing is usually performed by the least squares (LS adjustment method. There are two different forms for the LS adjustment, namely the batch form and recursive form. The former is not an appropriate method for real time applications in which new observations are added to the system over time. For such cases, the recursive solution is more suitable than the batch form. The LS method is also implemented in GPS data processing via two different forms. The mathematical model including both functional and stochastic models should be properly defined for both forms of the LS method. Proper choice of the stochastic model plays an important role to achieve high-precision GPS positioning. The noise characteristics of the GPS observables have been already investigated using the least squares variance component estimation (LS-VCE in a batch form by the authors. In this contribution, we introduce a recursive procedure that provides a proper stochastic modeling for the GPS observables using the LS-VCE. It is referred to as the recursive LS-VCE (RLS-VCE method, which is applied to the geometry-based observation model (GBOM. In this method, the (covariances parameters can be estimated recursively when the new group of observations is added. Therefore, it can easily be implemented in real time GPS data processing. The efficacy of the method is evaluated using a real GPS data set collected by the Trimble R7 receiver over a zero baseline. The results show that the proposed method has an appropriate performance so that the estimated (covariance parameters of the GPS observables are consistent with the batch estimates. However, using the RLS-VCE method, one can estimate the (covariance parameters of the GPS observables when a new observation group is added. This method can thus be introduced as a reliable method for application to the real time GPS data processing.

  5. 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

  6. The types and categories of Old English recursive compounding

    Directory of Open Access Journals (Sweden)

    Carmen Novo Urraca

    2017-07-01

    Full Text Available This article deals with the recursive compounding of Old English nouns, adjectives, verbs and adverbs. It addresses the question of the textual occurrences of the compounds of Old English by means of a corpus analysis based on the Dictionary of Old English Corpus. The data of qualitative analysis have been retrieved from the lexical database of Old English Nerthus. The analysis shows that the nominal, adjectival and adverbial compounds of Old English can be recursive. Nominal compounding allows double recursivity, whereas adjectival and adverbial compounding do not. The conclusion is reached that both the type and token frequencies of recursive compounds are very low; and recursive compounds from the adjectival class are more exocentric as regards categorisation.

  7. 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...

  8. Recursive fuzzy c-means clustering for recursive fuzzy identification of time-varying processes.

    Science.gov (United States)

    Dovžan, Dejan; Skrjanc, Igor

    2011-04-01

    In this paper we propose a new approach to on-line Takagi-Sugeno fuzzy model identification. It combines a recursive fuzzy c-means algorithm and recursive least squares. First the method is derived and than it is tested and compared on a benchmark problem of the Mackey-Glass time series with other established on-line identification methods. We showed that the developed algorithm gives a comparable degree of accuracy to other algorithms. The proposed algorithm can be used in a number of fields, including adaptive nonlinear control, model predictive control, fault detection, diagnostics and robotics. An example of identification based on a real data of the waste-water treatment process is also presented. Copyright © 2011 ISA. Published by Elsevier Ltd. All rights reserved.

  9. Direct Waveform Inversion: a New Recursive Scheme

    Science.gov (United States)

    Zheng, Y.

    2015-12-01

    The goal of the full-waveform inversion (FWI) is to find an Earth's model such that the synthetic waveforms computed using the model fit the observed ones. In practice, such a model is found in the context of the perturbation approach in an iterative fashion. Specifically, to find such a model, one starts from an initial global velocity model and perform model updating iteratively based on the Frechet derivative or single scattering by adjoint methods to minimize some cost function. However, this process often leads to local minima for the nonlinear cost function in the optimization and slow or no convergence when the starting model is far from the true model. To solve for the initial-model dependence and the convergence issue, we show a new direct waveform inversion (DWI) idea to directly invert the waveform data recursively by explicitly enforcing the causality principle. The DWI offers the advantage of assuming no global initial model and no iteration is needed for the model updating. Starting from the source-receiver region, the DWI builds the model outward recursively by fitting the earliest part of the reflection waveforms and the DWI process is always convergent. The DWI combines seismic imaging and velocity model building into one single process and this is in contrast to many industrial applications where seismic imaging/migration and velocity modeling building are done alternatively. The DWI idea is applicable to one-, two-, and three-dimensional spaces. We show numerical examples to support our idea using full waveform data including both free-surface and inter-bed multiples. Using reflection seismic data, we show that the DWI can invert for both velocity and density, separately.

  10. Goldbach Partitions and Sequences

    Indian Academy of Sciences (India)

    IAS Admin

    Properties of Goldbach partitions of numbers, as sums of primes, are presented and their potential applications to cryptography are described. The sequence of the number of partitions has excel- lent randomness properties. Goldbach partitions can be used to create ellipses and circles on the number line and they can also ...

  11. Automatic anatomy partitioning of the torso region on CT images by using multiple organ localizations with a group-wise calibration technique

    Science.gov (United States)

    Zhou, Xiangrong; Morita, Syoichi; Zhou, Xinxin; Chen, Huayue; Hara, Takeshi; Yokoyama, Ryujiro; Kanematsu, Masayuki; Hoshi, Hiroaki; Fujita, Hiroshi

    2015-03-01

    This paper describes an automatic approach for anatomy partitioning on three-dimensional (3D) computedtomography (CT) images that divide the human torso into several volume-of-interesting (VOI) images based on anatomical definition. The proposed approach combines several individual detections of organ-location with a groupwise organ-location calibration and correction to achieve an automatic and robust multiple-organ localization task. The essence of the proposed method is to jointly detect the 3D minimum bounding box for each type of organ shown on CT images based on intra-organ-image-textures and inter-organ-spatial-relationship in the anatomy. Machine-learning-based template matching and generalized Hough transform-based point-distribution estimation are used in the detection and calibration processes. We apply this approach to the automatic partitioning of a torso region on CT images, which are divided into 35 VOIs presenting major organ regions and tissues required by routine diagnosis in clinical medicine. A database containing 4,300 patient cases of high-resolution 3D torso CT images is used for training and performance evaluations. We confirmed that the proposed method was successful in target organ localization on more than 95% of CT cases. Only two organs (gallbladder and pancreas) showed a lower success rate: 71 and 78% respectively. In addition, we applied this approach to another database that included 287 patient cases of whole-body CT images scanned for positron emission tomography (PET) studies and used for additional performance evaluation. The experimental results showed that no significant difference between the anatomy partitioning results from those two databases except regarding the spleen. All experimental results showed that the proposed approach was efficient and useful in accomplishing localization tasks for major organs and tissues on CT images scanned using different protocols.

  12. 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.

  13. Topological recursion for chord diagrams, RNA complexes, and cells in moduli spaces

    DEFF Research Database (Denmark)

    Andersen, Jørgen Goul; chekhov, Leonid; Penner, Robert

    2013-01-01

    We introduce and study the Hermitian matrix model with potential V(x)=x^2/2-stx/(1-tx), which enumerates the number of linear chord diagrams of fixed genus with specified numbers of backbones generated by s and chords generated by t. For the one-cut solution, the partition function, correlators a...... topology as well as the number of cells in Riemann's moduli spaces for bordered surfaces. The free energies are computed here in principle for all genera and explicitly for genera less than four....... and free energies are convergent for small t and all s as a perturbation of the Gaussian potential, which arises for st=0. This perturbation is computed using the formalism of the topological recursion. The corresponding enumeration of chord diagrams gives at once the number of RNA complexes of a given...

  14. 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.

  15. On Measuring Non-Recursive Trade-Offs

    Directory of Open Access Journals (Sweden)

    Hermann Gruber

    2009-07-01

    Full Text Available We investigate the phenomenon of non-recursive trade-offs between descriptional systems in an abstract fashion. We aim at categorizing non-recursive trade-offs by bounds on their growth rate, and show how to deduce such bounds in general. We also identify criteria which, in the spirit of abstract language theory, allow us to deduce non-recursive tradeoffs from effective closure properties of language families on the one hand, and differences in the decidability status of basic decision problems on the other. We develop a qualitative classification of non-recursive trade-offs in order to obtain a better understanding of this very fundamental behaviour of descriptional systems.

  16. A Recursive Receding Horizon Planning for Unmanned Vehicles

    Data.gov (United States)

    National Aeronautics and Space Administration — This paper proposes a recursive receding horizon path planning algorithm for unmanned vehicles in nonuniform environments. In the proposed algorithm, the map is...

  17. 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.

  18. Mutual Information between Discrete Variables with Many Categories using Recursive Adaptive Partitioning.

    Science.gov (United States)

    Seok, Junhee; Seon Kang, Yeong

    2015-06-05

    Mutual information, a general measure of the relatedness between two random variables, has been actively used in the analysis of biomedical data. The mutual information between two discrete variables is conventionally calculated by their joint probabilities estimated from the frequency of observed samples in each combination of variable categories. However, this conventional approach is no longer efficient for discrete variables with many categories, which can be easily found in large-scale biomedical data such as diagnosis codes, drug compounds, and genotypes. Here, we propose a method to provide stable estimations for the mutual information between discrete variables with many categories. Simulation studies showed that the proposed method reduced the estimation errors by 45 folds and improved the correlation coefficients with true values by 99 folds, compared with the conventional calculation of mutual information. The proposed method was also demonstrated through a case study for diagnostic data in electronic health records. This method is expected to be useful in the analysis of various biomedical data with discrete variables.

  19. Predicting forest attributes from climate data using a recursive partitioning and regression tree algorithm

    Science.gov (United States)

    Greg C. Liknes; Christopher W. Woodall; Charles H. Perry

    2009-01-01

    Climate information frequently is included in geospatial modeling efforts to improve the predictive capability of other data sources. The selection of an appropriate climate data source requires consideration given the number of choices available. With regard to climate data, there are a variety of parameters (e.g., temperature, humidity, precipitation), time intervals...

  20. 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.

  1. 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.

  2. 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

  3. Potts model partition functions on two families of fractal lattices

    Science.gov (United States)

    Gong, Helin; Jin, Xian'an

    2014-11-01

    The partition function of q-state Potts model, or equivalently the Tutte polynomial, is computationally intractable for regular lattices. The purpose of this paper is to compute partition functions of q-state Potts model on two families of fractal lattices. Based on their self-similar structures and by applying the subgraph-decomposition method, we divide their Tutte polynomials into two summands, and for each summand we obtain a recursive formula involving the other summand. As a result, the number of spanning trees and their asymptotic growth constants, and a lower bound of the number of connected spanning subgraphs or acyclic root-connected orientations for each of such two lattices are obtained.

  4. 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

  5. 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.

  6. 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.

  7. A Decidable Recursive Logic for Weighted Transition Systems

    DEFF Research Database (Denmark)

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

    2014-01-01

    of transitions with respect to various resources. RWL uses first-order variables to measure local costs. The main syntactic operators are similar to the ones of timed logics for real-time systems. In addition, our logic is endowed, with simultaneous recursive equations, which specify the weakest properties......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...... satisfied by the recursive variables. We prove that unlike in the case of the timed logics, the satisfiability problem for RWL is decidable. The proof uses a variant of the region construction technique used in literature with timed automata, which we adapt to the specific settings of RWL. This paper...

  8. Parameter Uncertainty for Aircraft Aerodynamic Modeling using Recursive Least Squares

    Science.gov (United States)

    Grauer, Jared A.; Morelli, Eugene A.

    2016-01-01

    A real-time method was demonstrated for determining accurate uncertainty levels of stability and control derivatives estimated using recursive least squares and time-domain data. The method uses a recursive formulation of the residual autocorrelation to account for colored residuals, which are routinely encountered in aircraft parameter estimation and change the predicted uncertainties. Simulation data and flight test data for a subscale jet transport aircraft were used to demonstrate the approach. Results showed that the corrected uncertainties matched the observed scatter in the parameter estimates, and did so more accurately than conventional uncertainty estimates that assume white residuals. Only small differences were observed between batch estimates and recursive estimates at the end of the maneuver. It was also demonstrated that the autocorrelation could be reduced to a small number of lags to minimize computation and memory storage requirements without significantly degrading the accuracy of predicted uncertainty levels.

  9. Combinatorics of set partitions

    CERN Document Server

    Mansour, Toufik

    2012-01-01

    Focusing on a very active area of mathematical research in the last decade, Combinatorics of Set Partitions presents methods used in the combinatorics of pattern avoidance and pattern enumeration in set partitions. Designed for students and researchers in discrete mathematics, the book is a one-stop reference on the results and research activities of set partitions from 1500 A.D. to today. Each chapter gives historical perspectives and contrasts different approaches, including generating functions, kernel method, block decomposition method, generating tree, and Wilf equivalences. Methods and d

  10. Extended Beta Regression in R: Shaken, Stirred, Mixed, and Partitioned

    Directory of Open Access Journals (Sweden)

    Bettina Grün

    2012-05-01

    Full Text Available Beta regression – an increasingly popular approach for modeling rates and proportions – is extended in various directions: (a bias correction/reduction of the maximum likelihood estimator, (b beta regression tree models by means of recursive partitioning, (c latent class beta regression by means of finite mixture models. All three extensions may be of importance for enhancing the beta regression toolbox in practice to provide more reliable inference and capture both observed and unobserved/latent heterogeneity in the data. Using the analogy of Smithson and Verkuilen (2006, these extensions make beta regression not only “a better lemon squeezer” (compared to classical least squares regression but a full-fledged modern juicer offering lemon-based drinks: shaken and stirred (bias correction and reduction, mixed (finite mixture model, or partitioned (tree model. All three extensions are provided in the R package betareg (at least 2.4-0, building on generic algorithms and implementations for bias correction/reduction, model-based recursive partioning, and finite mixture models, respectively. Specifically, the new functions betatree( and betamix( reuse the object-oriented flexible implementation from the R packages party and flexmix, respectively.

  11. Recursive Secret Sharing for Distributed Storage and Information Hiding

    OpenAIRE

    Parakh, Abhishek; Kak, Subhash

    2010-01-01

    This paper presents a recursive computational multi-secret sharing technique that hides k-2 secrets of size b each into n shares of a single secret S of size b, such that any k of the n shares suffice to recreate the secret S as well as all the hidden secrets. This may act as a steganographic channel to transmit hidden information or used for authentication and verification of shares and the secret itself. Further, such a recursive technique may be used as a computational secret sharing techn...

  12. 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.

  13. 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...... into incremental and optimized tests specialized for given update patterns. These tests may involve the introduction of new views, but for relevant cases of recursion, simplified integrity constraints are obtained that can be checked more efficiently than the original ones and without auxiliary views. Notably...

  14. 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.

  15. 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)

  16. 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

  17. Accurate estimates of solutions of second order recursions

    NARCIS (Netherlands)

    Mattheij, R.M.M.

    1975-01-01

    Two important types of two dimensional matrix-vector and second order scalar recursions are studied. Both types possess two kinds of solutions (to be called forward and backward dominant solutions). For the directions of these solutions sharp estimates are derived, from which the solutions

  18. Gromov-Witten theory and spectral curve topological recursion

    NARCIS (Netherlands)

    Dunin-Barkovskiy, P.

    2015-01-01

    Gromov-Witten theory and spectral curve topological recursion are important parts of modern algebraic geometry and mathematical physics. In my thesis I study relations between these theories and some important new aspects and applications of them. In particular, a construction for a local spectral

  19. 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

  20. 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

  1. A nested recursive logit model for route choice analysis

    DEFF Research Database (Denmark)

    Mai, Tien; Frejinger, Emma; Fosgerau, Mogens

    2015-01-01

    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 lin...

  2. 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...

  3. Learning the Structure of Recursive Programs in Boxer.

    Science.gov (United States)

    Leonard, Michael

    1991-01-01

    This study explored how one eighth grade girl learned about the structure of recursive programs in BOXER programing language. The method of impasse resolution was presented in detail and used both to understand how she constructed her understanding and as an empirical method to analyze her learning. (MDH)

  4. 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

  5. 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...

  6. 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...

  7. Recursions for characteristic numbers of genus one plane curves

    OpenAIRE

    Vakil, Ravi

    2001-01-01

    Characteristic numbers of families of maps of nodal curves to P2 are defined as intersection of natural divisor classes. (This definition agrees with the usual definition for families of plane curves.) Simple recursions for characteristic numbers of genus one plane curves of all degrees are computed.

  8. A heuristic reference recursive recipe for adaptively tuning the ...

    Indian Academy of Sciences (India)

    In part-1 of this paper an adaptive filtering based on a reference recursive recipe (RRR) was developed and tested on a simulated dynamics of a spring, mass and damper with a weak nonlinear spring. In this paper the above recipe is applied to a more involved case of three sets of airplane data that have a larger number of ...

  9. Recursive 4SID algorithms using gradient type subspace tracking

    NARCIS (Netherlands)

    Oku, H.; Kimura, Hidenori

    2002-01-01

    Sometimes we obtain some prior information about a system to be identified, e.g., the order, model structure etc. In this paper, we consider the case where the order of a MIMO system to be identified is a priori known. Recursive subspace state-space system identification algorithms presented here

  10. A heuristic reference recursive recipe for adaptively tuning the ...

    Indian Academy of Sciences (India)

    M Shyam Mohan

    Abstract. In part-1 of this paper an adaptive filtering based on a reference recursive recipe (RRR) was developed and tested on a simulated dynamics of a spring, mass and damper with a weak nonlinear spring. In this paper the above recipe is applied to a more involved case of three sets of airplane data that have a larger.

  11. 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 ...

  12. Recursive confidence band construction for an unknown distribution function.

    Science.gov (United States)

    Kiatsupaibul, Seksan; Hayter, Anthony J

    2015-01-01

    Given a sample X1,...,Xn of independent observations from an unknown continuous distribution function F, the problem of constructing a confidence band for F is considered, which is a fundamental problem in statistical inference. This confidence band provides simultaneous inferences on all quantiles and also on all of the cumulative probabilities of the distribution, and so they are among the most important inference procedures that address the issue of multiplicity. A fully nonparametric approach is taken where no assumptions are made about the distribution function F. Historical approaches to this problem, such as Kolmogorov's famous () procedure, represent some of the earliest inference methodologies that address the issue of multiplicity. This is because a confidence band at a given confidence level 1-α allows inferences on all of the quantiles of the distribution, and also on all of the cumulative probabilities, at that specified confidence level. In this paper it is shown how recursive methodologies can be employed to construct both one-sided and two-sided confidence bands of various types. The first approach operates by putting bounds on the cumulative probabilities at the data points, and a recursive integration approach is described. The second approach operates by providing bounds on certain specified quantiles of the distribution, and its implementation using recursive summations of multinomial probabilities is described. These recursive methodologies are illustrated with examples, and R code is available for their implementation. © 2014 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

  13. Recursive Vocal Pattern Learning and Generalization in Starlings

    Science.gov (United States)

    Bloomfield, Tiffany Corinna

    2012-01-01

    Among known communication systems, human language alone exhibits open-ended productivity of meaning. Interest in the psychological mechanisms supporting this ability, and their evolutionary origins, has resurged following the suggestion that the only uniquely human ability underlying language is a mechanism of recursion. This "Unique…

  14. Recursive Harmonic Analysis for Computational of Hansen Coefficients

    OpenAIRE

    Sharaf, Mohamed Adel; Selim, Hadia Hassan

    2010-01-01

    This paper reports on a simple pure numerical method developed for computing Hansen coefficients by using recursive harmonic analysis technique. The precision criteria of the computations are very satisfactory and provide materials for computing Hansen's and Hansen's like expansions, also to check the accuracy of some existing algorithms.

  15. 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....

  16. 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…

  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. 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. Asymmetric partitioning of metals among cluster anions and cations generated via laser ablation of mixed aluminum/Group 6 transition metal targets.

    Science.gov (United States)

    Waller, Sarah E; Mann, Jennifer E; Jarrold, Caroline Chick

    2013-02-28

    While high-power laser ablation of metal alloys indiscriminately produces gas-phase atomic ions in proportion to the abundance of the various metals in the alloy, gas-phase ions produced by moderate-power laser ablation sources coupled with molecular beams are formed by more complicated mechanisms. A mass spectrometric study that directly compares the mass distributions of cluster anions and cations generated from laser ablation of pure aluminum, an aluminum/molybdenum mixed target, and an aluminum/tungsten mixed target is detailed. Mass spectra of anionic species generated from the mixed targets showed that both tungsten and molybdenum were in higher abundance in the negatively charged species than in the target material. Mass spectra of the cationic species showed primarily Al(+) and aluminum oxide and hydroxide cluster cations. No molybdenum- or tungsten-containing cluster cations were definitively assigned. The asymmetric distribution of aluminum and Group 6 transition metals in cation and anion cluster composition is attributed to the low ionization energy of atomic aluminum and aluminum suboxide clusters. In addition, the propensity of both molybdenum and tungsten to form metal oxide cluster anions under the same conditions that favor metallic aluminum cluster anions is attributed to differences in the optical properties of the surface oxide that is present in the metal powders used to prepare the ablation targets. Mechanisms of mixed metal oxide clusters are considered.

  20. Matrix string partition function

    CERN Document Server

    Kostov, Ivan K; Kostov, Ivan K.; Vanhove, Pierre

    1998-01-01

    We evaluate quasiclassically the Ramond partition function of Euclidean D=10 U(N) super Yang-Mills theory reduced to a two-dimensional torus. The result can be interpreted in terms of free strings wrapping the space-time torus, as expected from the point of view of Matrix string theory. We demonstrate that, when extrapolated to the ultraviolet limit (small area of the torus), the quasiclassical expressions reproduce exactly the recently obtained expression for the partition of the completely reduced SYM theory, including the overall numerical factor. This is an evidence that our quasiclassical calculation might be exact.

  1. Plane partition vesicles

    International Nuclear Information System (INIS)

    Rensburg, E J Janse van; Ma, J

    2006-01-01

    We examine partitions and their natural three-dimensional generalizations, plane partitions, as models of vesicles undergoing an inflation-deflation transition. The phase diagrams of these models include a critical point corresponding to an inflation-deflation transition, and exhibits multicritical scaling in the vicinity of a multicritical point located elsewhere on the critical curve. We determine the locations of the multicritical points by analysing the generating functions using analytic and numerical means. In addition, we determine the numerical values of the multicritical scaling exponents associated with the multicritical scaling regimes in these models

  2. 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

  3. Recursive expectation-maximization clustering: A method for identifying buffering mechanisms composed of phenomic modules

    Science.gov (United States)

    Guo, Jingyu; Tian, Dehua; McKinney, Brett A.; Hartman, John L.

    2010-06-01

    Interactions between genetic and/or environmental factors are ubiquitous, affecting the phenotypes of organisms in complex ways. Knowledge about such interactions is becoming rate-limiting for our understanding of human disease and other biological phenomena. Phenomics refers to the integrative analysis of how all genes contribute to phenotype variation, entailing genome and organism level information. A systems biology view of gene interactions is critical for phenomics. Unfortunately the problem is intractable in humans; however, it can be addressed in simpler genetic model systems. Our research group has focused on the concept of genetic buffering of phenotypic variation, in studies employing the single-cell eukaryotic organism, S. cerevisiae. We have developed a methodology, quantitative high throughput cellular phenotyping (Q-HTCP), for high-resolution measurements of gene-gene and gene-environment interactions on a genome-wide scale. Q-HTCP is being applied to the complete set of S. cerevisiae gene deletion strains, a unique resource for systematically mapping gene interactions. Genetic buffering is the idea that comprehensive and quantitative knowledge about how genes interact with respect to phenotypes will lead to an appreciation of how genes and pathways are functionally connected at a systems level to maintain homeostasis. However, extracting biologically useful information from Q-HTCP data is challenging, due to the multidimensional and nonlinear nature of gene interactions, together with a relative lack of prior biological information. Here we describe a new approach for mining quantitative genetic interaction data called recursive expectation-maximization clustering (REMc). We developed REMc to help discover phenomic modules, defined as sets of genes with similar patterns of interaction across a series of genetic or environmental perturbations. Such modules are reflective of buffering mechanisms, i.e., genes that play a related role in the maintenance

  4. Gluing Nekrasov Partition Functions

    Science.gov (United States)

    Qiu, Jian; Tizzano, Luigi; Winding, Jacob; Zabzine, Maxim

    2015-07-01

    In this paper we summarise the localisation calculation of 5D super Yang-Mills on simply connected toric Sasaki-Einstein (SE) manifolds. We show how various aspects of the computation, including the equivariant index, the asymptotic behaviour and the factorisation property are governed by the combinatorial data of the toric geometry. We prove that the perturbative partition function on a simply connected SE manifold corresponding to an n-gon toric diagram factorises to n copies of perturbative part (zero instanton sector) of the Nekrasov partition function. This leads us to conjecture a prescription for the computation of the complete partition function, by gluing n copies of the full Nekrasov partition functions. This work is a generalisation of some earlier computation carried out on Y p, q manifolds, whose moment map cone has a quadrangle base and our result is valid for manifolds whose moment map cones have pentagon base, hexagon base, etc. The algorithm we used for dealing with general cones may also be of independent interest.

  5. Goldbach Partitions and Sequences

    Indian Academy of Sciences (India)

    Home; Journals; Resonance – Journal of Science Education; Volume 19; Issue 11. Goldbach Partitions and Sequences. Subhash Kak. General Article Volume 19 Issue 11 November 2014 pp 1028-1037. Fulltext. Click here to view fulltext PDF. Permanent link: http://www.ias.ac.in/article/fulltext/reso/019/11/1028-1037 ...

  6. 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.

  7. 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.

  8. 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)

  9. Amplitudes, recursion relations and unitarity in the Abelian Higgs model

    Science.gov (United States)

    Kleiss, Ronald; Luna, Oscar Boher

    2017-12-01

    The Abelian Higgs model forms an essential part of the electroweak standard model: it is the sector containing only Z0 and Higgs bosons. We present a diagram-based proof of the tree-level unitarity of this model inside the unitary gauge, where only physical degrees of freedom occur. We derive combinatorial recursion relations for off-shell amplitudes in the massless approximation, which allows us to prove the cancellation of the first two orders in energy of unitarity-violating high-energy behaviour for any tree-level amplitude in this model. We describe a deformation of the amplitudes by extending the physical phase space to at least 7 spacetime dimensions, which leads to on-shell recursion relations à la BCFW. These lead to a simple proof that all on-shell tree amplitudes obey partial-wave unitarity.

  10. 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.

  11. 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.

  12. 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.

  13. Chebyshev recursion methods: Kernel polynomials and maximum entropy

    Energy Technology Data Exchange (ETDEWEB)

    Silver, R.N.; Roeder, H.; Voter, A.F.; Kress, J.D. [Los Alamos National Lab., NM (United States). Theoretical Div.

    1995-10-01

    The authors describe two Chebyshev recursion methods for calculations with very large sparse Hamiltonians, the kernel polynomial method (KPM) and the maximum entropy method (MEM). They are especially applicable to physical properties involving large numbers of eigenstates, which include densities of states, spectral functions, thermodynamics, total energies, as well as forces for molecular dynamics and Monte Carlo simulations. The authors apply Chebyshev methods to the electronic structure of Si, the thermodynamics of Heisenberg antiferromagnets, and a polaron problem.

  14. 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.

  15. Recursive Autoconvolution for Unsupervised Learning of Convolutional Neural Networks

    OpenAIRE

    Knyazev, Boris; Barth, Erhardt; Martinetz, Thomas

    2016-01-01

    In visual recognition tasks, such as image classification, unsupervised learning exploits cheap unlabeled data and can help to solve these tasks more efficiently. We show that the recursive autoconvolution operator, adopted from physics, boosts existing unsupervised methods by learning more discriminative filters. We take well established convolutional neural networks and train their filters layer-wise. In addition, based on previous works we design a network which extracts more than 600k fea...

  16. 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.

  17. 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.

  18. 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.

  19. Recursive linearization of multibody dynamics equations of motion

    Science.gov (United States)

    Lin, Tsung-Chieh; Yae, K. Harold

    1989-01-01

    The equations of motion of a multibody system are nonlinear in nature, and thus pose a difficult problem in linear control design. One approach is to have a first-order approximation through the numerical perturbations at a given configuration, and to design a control law based on the linearized model. Here, a linearized model is generated analytically by following the footsteps of the recursive derivation of the equations of motion. The equations of motion are first written in a Newton-Euler form, which is systematic and easy to construct; then, they are transformed into a relative coordinate representation, which is more efficient in computation. A new computational method for linearization is obtained by applying a series of first-order analytical approximations to the recursive kinematic relationships. The method has proved to be computationally more efficient because of its recursive nature. It has also turned out to be more accurate because of the fact that analytical perturbation circumvents numerical differentiation and other associated numerical operations that may accumulate computational error, thus requiring only analytical operations of matrices and vectors. The power of the proposed linearization algorithm is demonstrated, in comparison to a numerical perturbation method, with a two-link manipulator and a seven degrees of freedom robotic manipulator. Its application to control design is also demonstrated.

  20. 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.

  1. 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.

  2. 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

    Frame and anti-frame rules have been proposed as proof rules for modular reasoning about programs. Frame rules allow one to hide irrelevant parts of the state during verification, whereas the anti-frame rule allows one to hide local state from the context. We give the first sound model for Chargu......´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...... the model to account for Pottier’s generalized frame and anti-frame rules, where invariants are generalized to families of invariants indexed over pre-orders. This generalization enables reasoning about some well-bracketed as well as (locally) monotonic uses of local state....

  3. Recursive organizer (ROR): an analytic framework for sequence-based association analysis.

    Science.gov (United States)

    Zhao, Lue Ping; Huang, Xin

    2013-07-01

    The advent of next-generation sequencing technologies affords the ability to sequence thousands of subjects cost-effectively, and is revolutionizing the landscape of genetic research. With the evolving genotyping/sequencing technologies, it is not unrealistic to expect that we will soon obtain a pair of diploidic fully phased genome sequences from each subject in the near future. Here, in light of this potential, we propose an analytic framework called, recursive organizer (ROR), which recursively groups sequence variants based upon sequence similarities and their empirical disease associations, into fewer and potentially more interpretable super sequence variants (SSV). As an illustration, we applied ROR to assess an association between HLA-DRB1 and type 1 diabetes (T1D), discovering SSVs of HLA-DRB1 with sequence data from the Wellcome Trust Case Control Consortium. Specifically, ROR reduces 36 observed unique HLA-DRB1 sequences into 8 SSVs that empirically associate with T1D, a fourfold reduction of sequence complexity. Using HLA-DRB1 data from Type 1 Diabetes Genetics Consortium as cases and data from Fred Hutchinson Cancer Research Center as controls, we are able to validate associations of these SSVs with T1D. Further, SSVs consist of nine nucleotides, and each associates with its corresponding amino acids. Detailed examination of these selected amino acids reveals their potential functional roles in protein structures and possible implication to the mechanism of T1D.

  4. Manifold Partition Discriminant Analysis.

    Science.gov (United States)

    Yang Zhou; Shiliang Sun

    2017-04-01

    We propose a novel algorithm for supervised dimensionality reduction named manifold partition discriminant analysis (MPDA). It aims to find a linear embedding space where the within-class similarity is achieved along the direction that is consistent with the local variation of the data manifold, while nearby data belonging to different classes are well separated. By partitioning the data manifold into a number of linear subspaces and utilizing the first-order Taylor expansion, MPDA explicitly parameterizes the connections of tangent spaces and represents the data manifold in a piecewise manner. While graph Laplacian methods capture only the pairwise interaction between data points, our method captures both pairwise and higher order interactions (using regional consistency) between data points. This manifold representation can help to improve the measure of within-class similarity, which further leads to improved performance of dimensionality reduction. Experimental results on multiple real-world data sets demonstrate the effectiveness of the proposed method.

  5. Generalised twisted partition functions

    CERN Document Server

    Petkova, V B

    2001-01-01

    We consider the set of partition functions that result from the insertion of twist operators compatible with conformal invariance in a given 2D Conformal Field Theory (CFT). A consistency equation, which gives a classification of twists, is written and solved in particular cases. This generalises old results on twisted torus boundary conditions, gives a physical interpretation of Ocneanu's algebraic construction, and might offer a new route to the study of properties of CFT.

  6. BKP plane partitions

    International Nuclear Information System (INIS)

    Foda, Omar; Wheeler, Michael

    2007-01-01

    Using BKP neutral fermions, we derive a product expression for the generating function of volume-weighted plane partitions that satisfy two conditions. If we call a set of adjacent equal height-h columns, h > 0, an h-path, then 1. Every h-path can assume one of two possible colours. 2. There is a unique way to move along an h-path from any column to another

  7. BKP plane partitions

    Energy Technology Data Exchange (ETDEWEB)

    Foda, Omar; Wheeler, Michael [Department of Mathematics and Statistics, University of Melbourne, Parkville, Victoria 3010 (Australia)

    2007-01-15

    Using BKP neutral fermions, we derive a product expression for the generating function of volume-weighted plane partitions that satisfy two conditions. If we call a set of adjacent equal height-h columns, h > 0, an h-path, then 1. Every h-path can assume one of two possible colours. 2. There is a unique way to move along an h-path from any column to another.

  8. 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

  9. Intensional type theory with guarded recursive types qua fixed points on universes

    DEFF Research Database (Denmark)

    Møgelberg, Rasmus Ejlers; Birkedal, Lars

    2013-01-01

    and types. When applied to the groupoid model of intensional type theory with the universe of small discrete groupoids, the construction gives a model of guarded recursion for which there is a one-to-one correspondence between fixed points of functions on the universe of types and fixed points of (suitable......Guarded recursive functions and types are useful for giving semantics to advanced programming languages and for higher-order programming with infinite data types, such as streams, e.g., for modeling reactive systems. We propose an extension of intensional type theory with rules for forming fixed...... points of guarded recursive functions. Guarded recursive types can be formed simply by taking fixed points of guarded recursive functions on the universe of types. Moreover, we present a general model construction for constructing models of the intensional type theory with guarded recursive functions...

  10. 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.

  11. 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 ...... as the other, even in the presence of accumulators. As a result, we can directly extract a variety of recursive and iterative functional programs of the kind usually written or optimized by hand....

  12. 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)

  13. Asymptotic normality of recursive algorithms via martingale difference arrays

    Directory of Open Access Journals (Sweden)

    Werner Schachinger

    2001-12-01

    Full Text Available We propose martingale central limit theorems as an tool to prove asymptotic normality of the costs of certain recursive algorithms which are subjected to random input data. The recursive algorithms that we have in mind are such that if input data of size N produce random costs L N, then L N = D L n + L N-n +R N for N ≥ n 0 ≥2, where n follows a certain distribution P N on the integers {0, … ,N} and L k = D L k for k≥0. L n, L N-n and R N are independent, conditional on n, and R N are random variables, which may also depend on n, corresponding to the cost of splitting the input data of size N (into subsets of size n and N-n and combining the results of the recursive calls to yield the overall result. We construct a martingale difference array with rows converging to Z N:= [L N- EL N ] / [√ Var L N ]. Under certain compatibility assumptions on the sequence (P N N≥0 we show that a pair of sufficient conditions (of Lyapunov type for Z N → D N(0,1 can be restated as a pair of conditions regarding asymptotic relations between three sequences. All these sequences satisfy the same type of linear equation, that is also the defining equation for the sequence (EL N N≥0 and thus very likely a well studied object. In the case that the P N are binomial distributions with the same parameter p, and for deterministic R N, we demonstrate the power of this approach. We derive very general sufficient conditions in terms of the sequence (R N N≥0 (and for the scale R N =N α a characterization of those α leading to asymptotic normality of Z N.

  14. 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...... of complicated language features, as we demonstrate in our semantics of Chargu´eraud and Pottier’s type-and-capability system for an ML-like higher-order language. Moreover, the method provides a high-level understanding of the essence of recent approaches based on step indexing....

  15. 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.

  16. Recursive inter-generational utility in global climate risk modeling

    Energy Technology Data Exchange (ETDEWEB)

    Minh, Ha-Duong [Centre International de Recherche sur l' Environnement et le Developpement (CIRED-CNRS), 75 - Paris (France); Treich, N. [Institut National de Recherches Agronomiques (INRA-LEERNA), 31 - Toulouse (France)

    2003-07-01

    This paper distinguishes relative risk aversion and resistance to inter-temporal substitution in climate risk modeling. Stochastic recursive preferences are introduced in a stylized numeric climate-economy model using preliminary IPCC 1998 scenarios. It shows that higher risk aversion increases the optimal carbon tax. Higher resistance to inter-temporal substitution alone has the same effect as increasing the discount rate, provided that the risk is not too large. We discuss implications of these findings for the debate upon discounting and sustainability under uncertainty. (author)

  17. A model of guarded recursion with clock synchronisation

    DEFF Research Database (Denmark)

    Bizjak, Aleš; Møgelberg, Rasmus Ejlers

    2015-01-01

    productivity to be captured in types. The calculus uses clocks representing time streams and clock quantifiers which allow limited and controlled elimination of modalities. The calculus has since been extended to dependent types by Møgelberg. Both works give denotational semantics but no rewrite semantics....... In previous versions of this calculus, different clocks represented separate time streams and clock synchronisation was prohibited. In this paper we show that allowing clock synchronisation is safe by constructing a new model of guarded recursion and clocks. This result will greatly simplify the type theory...

  18. Optimally eating a stochastic cake. A recursive utility approach

    International Nuclear Information System (INIS)

    Epaulard, Anne; Pommeret, Aude

    2003-01-01

    In this short paper, uncertainties on resource stock and on technical progress are introduced into an intertemporal equilibrium model of optimal extraction of a non-renewable resource. The representative consumer maximizes a recursive utility function which disentangles between intertemporal elasticity of substitution and risk aversion. A closed-form solution is derived for both the optimal extraction and price paths. The value of the intertemporal elasticity of substitution relative to unity is then crucial in understanding extraction. Moreover, this model leads to a non-renewable resource price following a geometric Brownian motion

  19. Recursive Model Identification for the Evaluation of Baroreflex Sensitivity.

    Science.gov (United States)

    Le Rolle, Virginie; Beuchée, Alain; Praud, Jean-Paul; Samson, Nathalie; Pladys, Patrick; Hernández, Alfredo I

    2016-12-01

    A method for the recursive identification of physiological models of the cardiovascular baroreflex is proposed and applied to the time-varying analysis of vagal and sympathetic activities. The proposed method was evaluated with data from five newborn lambs, which were acquired during injection of vasodilator and vasoconstrictors and the results show a close match between experimental and simulated signals. The model-based estimation of vagal and sympathetic contributions were consistent with physiological knowledge and the obtained estimators of vagal and sympathetic activities were compared to traditional markers associated with baroreflex sensitivity. High correlations were observed between traditional markers and model-based indices.

  20. Parsimonious extreme learning machine using recursive orthogonal least squares.

    Science.gov (United States)

    Wang, Ning; Er, Meng Joo; Han, Min

    2014-10-01

    Novel constructive and destructive parsimonious extreme learning machines (CP- and DP-ELM) are proposed in this paper. By virtue of the proposed ELMs, parsimonious structure and excellent generalization of multiinput-multioutput single hidden-layer feedforward networks (SLFNs) are obtained. The proposed ELMs are developed by innovative decomposition of the recursive orthogonal least squares procedure into sequential partial orthogonalization (SPO). The salient features of the proposed approaches are as follows: 1) Initial hidden nodes are randomly generated by the ELM methodology and recursively orthogonalized into an upper triangular matrix with dramatic reduction in matrix size; 2) the constructive SPO in the CP-ELM focuses on the partial matrix with the subcolumn of the selected regressor including nonzeros as the first column while the destructive SPO in the DP-ELM operates on the partial matrix including elements determined by the removed regressor; 3) termination criteria for CP- and DP-ELM are simplified by the additional residual error reduction method; and 4) the output weights of the SLFN need not be solved in the model selection procedure and is derived from the final upper triangular equation by backward substitution. Both single- and multi-output real-world regression data sets are used to verify the effectiveness and superiority of the CP- and DP-ELM in terms of parsimonious architecture and generalization accuracy. Innovative applications to nonlinear time-series modeling demonstrate superior identification results.

  1. Recursive cosmopolitization: Argentina and the global Human Rights Regime.

    Science.gov (United States)

    Levy, Daniel

    2010-09-01

    This paper illustrates how varieties of cosmopolitanism are shaped through a mutually constitutive set of cultural dispositions and institutional practices that emerge at the interstices of global human right norms and local legal practices. Converging pressures of 'cosmopolitan imperatives' and the multiplicity of particularized manifestations are co-evolving in the context of intercrossings during which distinctive cosmopolitanisms are established. This complex relationship of global normative expectations and their local appropriations is elucidated through the dynamic of recursive cosmopolitization. Suggesting that, local problems are resolved with recourse to global prescriptions while local solutions are inscribed in international institutions consolidating the global Human Rights Regime. The Argentinean case carries conceptual and empirical weight as it underscores the recursivity of cosmopolitization by calibrating the tensions of universalism and particularism at the intersection of global, national and regional scales. Argentina is a paradigmatic instantiation for how cosmopolitanism can emanate in the periphery as local problems are globalized. This, in turn, has resulted in the institutionalization of a global Human Rights Regime which exercises normative and political-legal pressures on how states legitimately deal with human rights abuses. It is this cosmopolitan balance, rather than presuppositions of universalistic exogenous pressures or particularistic national exceptions, which is shaping the cultural and political relevance of human rights norms. © London School of Economics and Political Science 2010.

  2. 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.

  3. 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

  4. 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.

  5. Cognitive representation of "musical fractals": Processing hierarchy and recursion in the auditory domain.

    Science.gov (United States)

    Martins, Mauricio Dias; Gingras, Bruno; Puig-Waldmueller, Estela; Fitch, W Tecumseh

    2017-04-01

    The human ability to process hierarchical structures has been a longstanding research topic. However, the nature of the cognitive machinery underlying this faculty remains controversial. Recursion, the ability to embed structures within structures of the same kind, has been proposed as a key component of our ability to parse and generate complex hierarchies. Here, we investigated the cognitive representation of both recursive and iterative processes in the auditory domain. The experiment used a two-alternative forced-choice paradigm: participants were exposed to three-step processes in which pure-tone sequences were built either through recursive or iterative processes, and had to choose the correct completion. Foils were constructed according to generative processes that did not match the previous steps. Both musicians and non-musicians were able to represent recursion in the auditory domain, although musicians performed better. We also observed that general 'musical' aptitudes played a role in both recursion and iteration, although the influence of musical training was somehow independent from melodic memory. Moreover, unlike iteration, recursion in audition was well correlated with its non-auditory (recursive) analogues in the visual and action sequencing domains. These results suggest that the cognitive machinery involved in establishing recursive representations is domain-general, even though this machinery requires access to information resulting from domain-specific processes. Copyright © 2017 The Authors. Published by Elsevier B.V. All rights reserved.

  6. 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 (...

  7. 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…

  8. Direct proof of the tree-level scattering amplitude recursion relation in Yang-mills theory.

    Science.gov (United States)

    Britto, Ruth; Cachazo, Freddy; Feng, Bo; Witten, Edward

    2005-05-13

    Recently, by using the known structure of one-loop scattering amplitudes for gluons in Yang-Mills theory, a recursion relation for tree-level scattering amplitudes has been deduced. Here, we give a short and direct proof of this recursion relation based on properties of tree-level amplitudes only.

  9. 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...

  10. 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…

  11. 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

    aromatic hydrocarbons (PAHs), and organochlorine pesticides (OCPs) by equilibrating 13 silicones, including polydimethylsiloxane (PDMS) and low-density polyethylene (LDPE) in methanol-water solutions. Methanol as cosolvent ensured that all polymers reached equilibrium while its effect on the polymers...... larger deviations from unity were indicated within the group of silicones and between silicones and LDPE. Uncertainty in polymer volume due to imprecise coating thickness or the presence of fillers was identified as the source of error for partition coefficients. New polymer-based (LDPE-lipid, PDMS-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...

  12. Structural Group-based Auditing of Missing Hierarchical Relationships in UMLS

    Science.gov (United States)

    Chen, Yan; Gu, Huanying(Helen); Perl, Yehoshua; Geller, James

    2009-01-01

    The Metathesaurus of the UMLS was created by integrating various source terminologies. The inter-concept relationships were either integrated into the UMLS from the source terminologies or specially generated. Due to the extensive size and inherent complexity of the Metathesaurus, the accidental omission of some hierarchical relationships was inevitable. We present a recursive procedure which allows a human expert, with the support of an algorithm, to locate missing hierarchical relationships. The procedure starts with a group of concepts with exactly the same (correct) semantic type assignments. It then partitions the concepts, based on child-of hierarchical relationships, into smaller, singly rooted, hierarchically connected subgroups. The auditor only needs to focus on the subgroups with very few concepts and their concepts with semantic type reassignments. The procedure was evaluated by comparing it with a comprehensive manual audit and it exhibits a perfect error recall. PMID:18824248

  13. Gentile statistics and restricted partitions

    Indian Academy of Sciences (India)

    The partition function of Gentile statistics also has the property that it nicely interpolates between the ... We now construct the partition function for such a system which also incorporates the property of interpolation ... As in [4], we however keep s arbitrary even though for s > 2 there are no quadratic. Hamiltonian systems.

  14. Gentile statistics and restricted partitions

    Indian Academy of Sciences (India)

    We generalise these results to obtain an asymptotic formula for the restricted or coloured partitions p k s ( n ) , which is the number of partitions of an integer into the summand of th powers of integers such that each power of a given integer may occur utmost times. While the method is not rigorous, it reproduces the ...

  15. Toward An Ontology of Mutual Recursion: Models, Mind and Media

    Directory of Open Access Journals (Sweden)

    Mat Wall-Smith

    2008-01-01

    Full Text Available In Parables for the Virtual Massumi describes 'The Autonomy of Affect' in our ecology of thought (Massumi 2002 : 35. The object of Stiegler's Technics and Time is 'technics apprehended as the horizon of all possibility to come and all possibility of a future' (Stiegler 1998 : ix. The ecological dynamic described by the recursion between this 'affective autonomy' and a 'technical horizon of possibility' describes a metamodel of the relation between body and world, between perception and expression. I argue that this metamodel allows for the technical architectures that enshrine media processes and models as both the manifestation and modulation of the 'industry' or vitality of mind. I argue that these technical architectures are crucial to the creation and maintenance of dynamic ecologies of living.

  16. Radar Target Classification using Recursive Knowledge-Based Methods

    DEFF Research Database (Denmark)

    Jochumsen, Lars Wurtz

    The topic of this thesis is target classification of radar tracks from a 2D mechanically scanning coastal surveillance radar. The measurements provided by the radar are position data and therefore the classification is mainly based on kinematic data, which is deduced from the position. The target...... been terminated. Therefore, an update of the classification results must be made for each measurement of the target. The data for this work are collected throughout the PhD and are both collected from radars and other sensors such as GPS....... classes used in this work are classes, which are normal for coastal surveillance e.g.~ships, helicopters, birds etc. The classifier must be recursive as all data of a track is not present at any given moment. If all data were available, it would be too late to classify the track, as the track would have...

  17. 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.

  18. Applying recursive numerical integration techniques for solving high dimensional integrals

    Energy Technology Data Exchange (ETDEWEB)

    Ammon, Andreas [IVU Traffic Technologies AG, Berlin (Germany); Genz, Alan [Washington State Univ., Pullman, WA (United States). Dept. of Mathematics; Hartung, Tobias [King' s College, London (United Kingdom). Dept. of Mathematics; Jansen, Karl; Volmer, Julia [Deutsches Elektronen-Synchrotron (DESY), Zeuthen (Germany). John von Neumann-Inst. fuer Computing NIC; Leoevey, Hernan [Humboldt Univ. Berlin (Germany). Inst. fuer Mathematik

    2016-11-15

    The error scaling for Markov-Chain Monte Carlo techniques (MCMC) with N samples behaves like 1/√(N). This scaling makes it often very time intensive to reduce the error of computed observables, in particular for applications in lattice QCD. It is therefore highly desirable to have alternative methods at hand which show an improved error scaling. One candidate for such an alternative integration technique is the method of recursive numerical integration (RNI). The basic idea of this method is to use an efficient low-dimensional quadrature rule (usually of Gaussian type) and apply it iteratively to integrate over high-dimensional observables and Boltzmann weights. We present the application of such an algorithm to the topological rotor and the anharmonic oscillator and compare the error scaling to MCMC results. In particular, we demonstrate that the RNI technique shows an error scaling in the number of integration points m that is at least exponential.

  19. A Frequency Multiplier Based on Time Recursive Processing

    Directory of Open Access Journals (Sweden)

    D. M. Perisic

    2017-12-01

    Full Text Available This paper describes a digital frequency multiplier for a pulse rate. The multiplier is based on the recursive processing of the input and output periods and their time differences. Special emphasis is devoted to the techniques which provide the development of multipliers based on this principle. The circuit is defined by two system parameters. One is the ratio of two clock frequencies and the other is a division factor of a binary counter. The realization of the circuit is described. The region of the system parameters for the stable circuit is presented. The different aspects of applications and limitations in realization of the circuit are considered. All mathematical analyses are made using a Z transform approach. It is shown that the circuit can be also used in tracking and prediction applications. Computer simulations are performed to prove the correctness of the math and the whole approach.

  20. Fractal and transfractal recursive scale-free nets

    International Nuclear Information System (INIS)

    Rozenfeld, Hernan D; Havlin, Shlomo; Ben-Avraham, Daniel

    2007-01-01

    We explore the concepts of self-similarity, dimensionality, and (multi)scaling in a new family of recursive scale-free nets that yield themselves to exact analysis through renormalization techniques. All nets in this family are self-similar and some are fractals-possessing a finite fractal dimension-while others are small-world (their diameter grows logarithmically with their size) and are infinite-dimensional. We show how a useful measure of transfinite dimension may be defined and applied to the small-world nets. Concerning multiscaling, we show how first-passage time for diffusion and resistance between hubs (the most connected nodes) scale differently than for other nodes. Despite the different scalings, the Einstein relation between diffusion and conductivity holds separately for hubs and nodes. The transfinite exponents of small-world nets obey Einstein relations analogous to those in fractal nets

  1. 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.

  2. 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.

  3. Applying recursive numerical integration techniques for solving high dimensional integrals

    International Nuclear Information System (INIS)

    Ammon, Andreas; Genz, Alan; Hartung, Tobias; Jansen, Karl; Volmer, Julia; Leoevey, Hernan

    2016-11-01

    The error scaling for Markov-Chain Monte Carlo techniques (MCMC) with N samples behaves like 1/√(N). This scaling makes it often very time intensive to reduce the error of computed observables, in particular for applications in lattice QCD. It is therefore highly desirable to have alternative methods at hand which show an improved error scaling. One candidate for such an alternative integration technique is the method of recursive numerical integration (RNI). The basic idea of this method is to use an efficient low-dimensional quadrature rule (usually of Gaussian type) and apply it iteratively to integrate over high-dimensional observables and Boltzmann weights. We present the application of such an algorithm to the topological rotor and the anharmonic oscillator and compare the error scaling to MCMC results. In particular, we demonstrate that the RNI technique shows an error scaling in the number of integration points m that is at least exponential.

  4. Learning to play Go using recursive neural networks.

    Science.gov (United States)

    Wu, Lin; Baldi, Pierre

    2008-11-01

    Go is an ancient board game that poses unique opportunities and challenges for artificial intelligence. Currently, there are no computer Go programs that can play at the level of a good human player. However, the emergence of large repositories of games is opening the door for new machine learning approaches to address this challenge. Here we develop a machine learning approach to Go, and related board games, focusing primarily on the problem of learning a good evaluation function in a scalable way. Scalability is essential at multiple levels, from the library of local tactical patterns, to the integration of patterns across the board, to the size of the board itself. The system we propose is capable of automatically learning the propensity of local patterns from a library of games. Propensity and other local tactical information are fed into recursive neural networks, derived from a probabilistic Bayesian network architecture. The recursive neural networks in turn integrate local information across the board in all four cardinal directions and produce local outputs that represent local territory ownership probabilities. The aggregation of these probabilities provides an effective strategic evaluation function that is an estimate of the expected area at the end, or at various other stages, of the game. Local area targets for training can be derived from datasets of games played by human players. In this approach, while requiring a learning time proportional to N(4), skills learned on a board of size N(2) can easily be transferred to boards of other sizes. A system trained using only 9 x 9 amateur game data performs surprisingly well on a test set derived from 19 x 19 professional game data. Possible directions for further improvements are briefly discussed.

  5. Partitioning of platinum-group elements (PGE) and chalcogens (Se, Te, As, Sb, Bi) between monosulfide-solid solution (MSS), intermediate solid solution (ISS) and sulfide liquid at controlled fO2-fS2 conditions

    Science.gov (United States)

    Liu, Yanan; Brenan, James

    2015-06-01

    In order to better understand the behavior of highly siderophile elements (HSEs: Os, Ir, Ru, Rh, Pt, Pd, Au, Re), Ag, Pb and chalcogens (As, Se, Sb, Te and Bi) during the solidification of sulfide magmas, we have conducted a series of experiments to measure partition coefficients (D values) between monosulfide solid solution (MSS) and sulfide melt, as well as MSS and intermediate solid solution (ISS), at 0.1 MPa and 860-926 °C, log fS2 -3.0 to -2.2 (similar to the Pt-PtS buffer), with fO2 controlled at the fayalite-magnetite-quartz (FMQ) buffer. The IPGEs (Os, Ir, Ru), Rh and Re are found to be compatible in MSS relative to sulfide melt with D values ranging from ∼20 to ∼5, and DRe/DOs of ∼0.5. Pd, Pt, Au, Ag, Pb, as well as the chalcogens, are incompatible in MSS, with D values ranging from ∼0.1 to ∼1 × 10-3. For the same metal/sulfur ratio, D values for the IPGEs, Rh and Re are systematically larger than most past studies, correlating with higher oxygen content in the sulfide liquid, reflecting the significant effect of oxygen on increasing the activity coefficients for these elements in the melt phase. MSS/ISS partitioning experiments reveal that Ru, Os, Ir, Rh and Re are partitioned into MSS by a factor of >50, whereas Pd, Pt, Ag, Au and the chalcogens partition from weakly (Se, As) to strongly (Ag, Au) into ISS. Uniformly low MSS- and ISS- melt partition coefficients for the chalcogens, Pt, Pd, Ag and Au will lead to enrichment in the residual sulfide liquid, but D values are generally too large to reach early saturation in Pt-Pd-chalcogen-rich accessory minerals, based on current solubility estimates. Instead, these phases likely precipitate at the last dregs of crystallization. Modeled evolution curves for the PGEs and chalcogens are in reasonably good agreement with whole-rock sulfide compositions for the McCreedy East deposit (Sudbury, Ontario), consistent with an origin by crystallization of MSS, then MSS + ISS from sulfide magma.

  6. Calculation of the number of partitions with constraints on the fragment size

    International Nuclear Information System (INIS)

    Desesquelles, P.

    2001-01-01

    In this article, we have provided formulae for the calculation of the number of partitions with conditions on the maximum fragment size, with conditions on the minimum fragment size and with conditions on both the minimum and the maximum fragment size. To demonstrate these formulae, the notion of complementary partitions was introduced. The constrained partition numbers are notably useful in the analysis of nuclear multifragmentation. Moretto and collaborators have introduced an elegant combinatorial procedure to isolate rare events corresponding to the fragmentation of the atomic nucleus in a number of nearly equal size IMF (fragments with charge greater or equal to Z min ) supplemented by light fragments (fragments with charge less than or equal to Z min - 1). This procedure requires the evaluation of the number of partitions corresponding to a given sum (Z imf ) of the charges of a given number (M) of IMF. This number of partitions is given as Z min N(Z imf ,M) Z min -1 N(Z tot - Z imf ). The total number of partitions can be evaluated by the following convolution N(S) = Σ s s min N(s) s min -1 N(S-s). In a forthcoming article we will show how the Moretto charge correlation can be calculated explicitly in the frame of the minimal information model. More generally these formulae are useful in domains where the fragment classes (infinite fragments, evaporation residues, light particles, intermediate mass fragments, liquid and gaseous phases... ) are defined with respect to their sizes. This article introduces recursive relations allowing the calculation of the number of partitions with constraints on the minimum and/or on the maximum fragment size. (author)

  7. 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

  8. Modular invariant partition functions for toroidally compactified bosonic string

    International Nuclear Information System (INIS)

    Ardalan, F.; Arfaei, H.

    1988-06-01

    We systematically find all the modular invariant partition functions for the toroidally compactified closed bosonic string defined on a subset of a simply laced simple Lie algebra lattice, or equivalently for the closed bosonic string moving on a group manifold with the WZW coefficient k=1. We examine the relation between modular invariance of partition function and the possibility of describing it by an even Lorentzian self dual lattice in our context. (author). 23 refs

  9. Stochastic Graph Partition: Generalizing the Swendsen-Wang Method

    OpenAIRE

    Barbu, Adrian; Zhu, Song-Chun

    2003-01-01

    Vision tasks, such as segmentation, grouping, recognition, and learning, have a "what-goes-with-what" component. It can be formulated as partitioning an adjacent graph into a number of subgraphs, each being a "coherent" visual pattern in the sense of optimizing a Bayesian posterior probability or minimizing an energy functional. In this paper, we generalize Swendsen-Wang (1987)- a well celebrated algorithm in statistical mechanics-for general graph partition. Our objective is to design revers...

  10. 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

  11. A recursive centered T-matrix algorithm to solve the multiple scattering equation: numerical validation

    CERN Document Server

    Auger, J C

    2003-01-01

    The multiple scattering problem can be solved using various analytical techniques. One of these techniques, the T-matrix formalism, is at the present time generally solved using iterative algorithms, because the initially proposed recursive algorithms appeared to be numerically unstable. We present here a new set of recursive relations to solve the multiple scattering equation, and discuss their range of application. In order to validate this new formalism, we compare numerical results for various complex systems with the Generalized Multi-particle Mie solution. We show that the results obtained with the recursive method are in very good agreement with those given by iterative techniques.

  12. [Clinical observation of herb-partition moxibustion at navel for constipation with excess syndrome].

    Science.gov (United States)

    Li, Yujie; Chen, Aiwen; Li, Zhaofeng; Zhang, Xiaoning; Yu, Yanpu; Ma, Yuxia

    To observe the effect differences between herb-partition moxibustion and starch-partition moxibustion at navel for constipation with excess syndrome. Sixty patients were randomly assigned into an herb-partition moxibustion at navel group (herbal group) and a starch-partition moxibustion at navel group (starch group), 30 cases in each one. The acupoint was Shenque (CV 8) in the two groups. The treatment was given once a week and 4 times totally. Scores for constipation degree and quality of life (PAC-QOL) were observed before and after treatment and at follow-up; clinical effects were compared between the two groups as well. After treatment, the scores of constipation degree and QOL were lower than those before treatment in the herbal group ( P 0.05), but superior to ones of the starch group ( P navel achieves better short-term and long-term effects than starch-partition for constipation with excess syndrome.

  13. Recursive least squares background prediction of univariate syndromic surveillance data

    Directory of Open Access Journals (Sweden)

    Burkom Howard

    2009-01-01

    Full Text Available Abstract Background Surveillance of univariate syndromic data as a means of potential indicator of developing public health conditions has been used extensively. This paper aims to improve the performance of detecting outbreaks by using a background forecasting algorithm based on the adaptive recursive least squares method combined with a novel treatment of the Day of the Week effect. Methods Previous work by the first author has suggested that univariate recursive least squares analysis of syndromic data can be used to characterize the background upon which a prediction and detection component of a biosurvellance system may be built. An adaptive implementation is used to deal with data non-stationarity. In this paper we develop and implement the RLS method for background estimation of univariate data. The distinctly dissimilar distribution of data for different days of the week, however, can affect filter implementations adversely, and so a novel procedure based on linear transformations of the sorted values of the daily counts is introduced. Seven-days ahead daily predicted counts are used as background estimates. A signal injection procedure is used to examine the integrated algorithm's ability to detect synthetic anomalies in real syndromic time series. We compare the method to a baseline CDC forecasting algorithm known as the W2 method. Results We present detection results in the form of Receiver Operating Characteristic curve values for four different injected signal to noise ratios using 16 sets of syndromic data. We find improvements in the false alarm probabilities when compared to the baseline W2 background forecasts. Conclusion The current paper introduces a prediction approach for city-level biosurveillance data streams such as time series of outpatient clinic visits and sales of over-the-counter remedies. This approach uses RLS filters modified by a correction for the weekly patterns often seen in these data series, and a threshold

  14. 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

  15. 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.

  16. Nonlinear dynamics for charges particle beams with a curved axis in the matrix - recursive model

    Energy Technology Data Exchange (ETDEWEB)

    Dymnikov, A.D. [University of St Petersburg, (Russian Federation). Institute of Computational Mathematics and Control Process

    1993-12-31

    In this paper a new matrix and recursive approach has been outlined for treating nonlinear optics of charged particle beams. This approach is a new analytical and computational tool for designers of optimal beam control systems. 9 refs.

  17. Hierarchical image segmentation via recursive superpixel with adaptive regularity

    Science.gov (United States)

    Nakamura, Kensuke; Hong, Byung-Woo

    2017-11-01

    A fast and accurate segmentation algorithm in a hierarchical way based on a recursive superpixel technique is presented. We propose a superpixel energy formulation in which the trade-off between data fidelity and regularization is dynamically determined based on the local residual in the energy optimization procedure. We also present an energy optimization algorithm that allows a pixel to be shared by multiple regions to improve the accuracy and appropriate the number of segments. The qualitative and quantitative evaluations demonstrate that our algorithm, combining the proposed energy and optimization, outperforms the conventional k-means algorithm by up to 29.10% in F-measure. We also perform comparative analysis with state-of-the-art algorithms in the hierarchical segmentation. Our algorithm yields smooth regions throughout the hierarchy as opposed to the others that include insignificant details. Our algorithm overtakes the other algorithms in terms of balance between accuracy and computational time. Specifically, our method runs 36.48% faster than the region-merging approach, which is the fastest of the comparing algorithms, while achieving a comparable accuracy.

  18. Implicit Learning of Recursive Context-Free Grammars

    Science.gov (United States)

    Rohrmeier, Martin; Fu, Qiufang; Dienes, Zoltan

    2012-01-01

    Context-free grammars are fundamental for the description of linguistic syntax. However, most artificial grammar learning experiments have explored learning of simpler finite-state grammars, while studies exploring context-free grammars have not assessed awareness and implicitness. This paper explores the implicit learning of context-free grammars employing features of hierarchical organization, recursive embedding and long-distance dependencies. The grammars also featured the distinction between left- and right-branching structures, as well as between centre- and tail-embedding, both distinctions found in natural languages. People acquired unconscious knowledge of relations between grammatical classes even for dependencies over long distances, in ways that went beyond learning simpler relations (e.g. n-grams) between individual words. The structural distinctions drawn from linguistics also proved important as performance was greater for tail-embedding than centre-embedding structures. The results suggest the plausibility of implicit learning of complex context-free structures, which model some features of natural languages. They support the relevance of artificial grammar learning for probing mechanisms of language learning and challenge existing theories and computational models of implicit learning. PMID:23094021

  19. Decision-Directed Recursive Least Squares MIMO Channels Tracking

    Directory of Open Access Journals (Sweden)

    2006-01-01

    Full Text Available A new approach for joint data estimation and channel tracking for multiple-input multiple-output (MIMO channels is proposed based on the decision-directed recursive least squares (DD-RLS algorithm. RLS algorithm is commonly used for equalization and its application in channel estimation is a novel idea. In this paper, after defining the weighted least squares cost function it is minimized and eventually the RLS MIMO channel estimation algorithm is derived. The proposed algorithm combined with the decision-directed algorithm (DDA is then extended for the blind mode operation. From the computational complexity point of view being O3 versus the number of transmitter and receiver antennas, the proposed algorithm is very efficient. Through various simulations, the mean square error (MSE of the tracking of the proposed algorithm for different joint detection algorithms is compared with Kalman filtering approach which is one of the most well-known channel tracking algorithms. It is shown that the performance of the proposed algorithm is very close to Kalman estimator and that in the blind mode operation it presents a better performance with much lower complexity irrespective of the need to know the channel model.

  20. Implicit learning of recursive context-free grammars.

    Science.gov (United States)

    Rohrmeier, Martin; Fu, Qiufang; Dienes, Zoltan

    2012-01-01

    Context-free grammars are fundamental for the description of linguistic syntax. However, most artificial grammar learning experiments have explored learning of simpler finite-state grammars, while studies exploring context-free grammars have not assessed awareness and implicitness. This paper explores the implicit learning of context-free grammars employing features of hierarchical organization, recursive embedding and long-distance dependencies. The grammars also featured the distinction between left- and right-branching structures, as well as between centre- and tail-embedding, both distinctions found in natural languages. People acquired unconscious knowledge of relations between grammatical classes even for dependencies over long distances, in ways that went beyond learning simpler relations (e.g. n-grams) between individual words. The structural distinctions drawn from linguistics also proved important as performance was greater for tail-embedding than centre-embedding structures. The results suggest the plausibility of implicit learning of complex context-free structures, which model some features of natural languages. They support the relevance of artificial grammar learning for probing mechanisms of language learning and challenge existing theories and computational models of implicit learning.

  1. Implicit learning of recursive context-free grammars.

    Directory of Open Access Journals (Sweden)

    Martin Rohrmeier

    Full Text Available Context-free grammars are fundamental for the description of linguistic syntax. However, most artificial grammar learning experiments have explored learning of simpler finite-state grammars, while studies exploring context-free grammars have not assessed awareness and implicitness. This paper explores the implicit learning of context-free grammars employing features of hierarchical organization, recursive embedding and long-distance dependencies. The grammars also featured the distinction between left- and right-branching structures, as well as between centre- and tail-embedding, both distinctions found in natural languages. People acquired unconscious knowledge of relations between grammatical classes even for dependencies over long distances, in ways that went beyond learning simpler relations (e.g. n-grams between individual words. The structural distinctions drawn from linguistics also proved important as performance was greater for tail-embedding than centre-embedding structures. The results suggest the plausibility of implicit learning of complex context-free structures, which model some features of natural languages. They support the relevance of artificial grammar learning for probing mechanisms of language learning and challenge existing theories and computational models of implicit learning.

  2. Recursive recovery of Markov transition probabilities from boundary value data

    Energy Technology Data Exchange (ETDEWEB)

    Patch, Sarah Kathyrn [Univ. of California, Berkeley, CA (United States)

    1994-04-01

    In an effort to mathematically describe the anisotropic diffusion of infrared radiation in biological tissue Gruenbaum posed an anisotropic diffusion boundary value problem in 1989. In order to accommodate anisotropy, he discretized the temporal as well as the spatial domain. The probabilistic interpretation of the diffusion equation is retained; radiation is assumed to travel according to a random walk (of sorts). In this random walk the probabilities with which photons change direction depend upon their previous as well as present location. The forward problem gives boundary value data as a function of the Markov transition probabilities. The inverse problem requires finding the transition probabilities from boundary value data. Problems in the plane are studied carefully in this thesis. Consistency conditions amongst the data are derived. These conditions have two effects: they prohibit inversion of the forward map but permit smoothing of noisy data. Next, a recursive algorithm which yields a family of solutions to the inverse problem is detailed. This algorithm takes advantage of all independent data and generates a system of highly nonlinear algebraic equations. Pluecker-Grassmann relations are instrumental in simplifying the equations. The algorithm is used to solve the 4 x 4 problem. Finally, the smallest nontrivial problem in three dimensions, the 2 x 2 x 2 problem, is solved.

  3. Recursive Monte Carlo method for deep-penetration problems

    International Nuclear Information System (INIS)

    Goldstein, M.; Greenspan, E.

    1980-01-01

    The Recursive Monte Carlo (RMC) method developed for estimating importance function distributions in deep-penetration problems is described. Unique features of the method, including the ability to infer the importance function distribution pertaining to many detectors from, essentially, a single M.C. run and the ability to use the history tape created for a representative region to calculate the importance function in identical regions, are illustrated. The RMC method is applied to the solution of two realistic deep-penetration problems - a concrete shield problem and a Tokamak major penetration problem. It is found that the RMC method can provide the importance function distributions, required for importance sampling, with accuracy that is suitable for an efficient solution of the deep-penetration problems considered. The use of the RMC method improved, by one to three orders of magnitude, the solution efficiency of the two deep-penetration problems considered: a concrete shield problem and a Tokamak major penetration problem. 8 figures, 4 tables

  4. 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.

  5. Partitioning and Transmutation - Physics, Technology and Politics

    International Nuclear Information System (INIS)

    Gudowski, W.

    2002-01-01

    Nuclear reactions can be effectively used to destroy radio toxic isotopes through transmutation processes transforming those isotopes into less radio toxic or stable ones Spent nuclear fuel, a mixture of many isotopes with some of them being highly radio toxic for many hundred thousands of years, may be effectively transmuted through nuclear reactions with neutrons. In a dedicated, well designed transmutation system one can, in principle, reduce the radiotoxicity of the spent nuclear fuel to a level, which will require isolation from the biosphere for the period of time for which engineered barriers can be constructed and licensed (not more than 1-2 thousands of years). En effective transmutation process can not be achieved without a suitable partitioning. Only partitioning of the spent nuclear fuel into predetermined groups of elements makes possible an effective use of neutrons to transmute long-lived radioactive isotopes into short-lived or stable one. However, most of the chemical separation/partitioning processes are element- not isotope-specific, therefore the transmutation of the elements with an existing isotope composition is a typical alternative for transmutation processes. Isotope-specific separation is possible but still very expensive and technologically not matured

  6. 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....

  7. 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 .....

  8. From Seed AI to Technological Singularity via Recursively Self-Improving Software

    OpenAIRE

    Yampolskiy, Roman V.

    2015-01-01

    Software capable of improving itself has been a dream of computer scientists since the inception of the field. In this work we provide definitions for Recursively Self-Improving software, survey different types of self-improving software, review the relevant literature, analyze limits on computation restricting recursive self-improvement and introduce RSI Convergence Theory which aims to predict general behavior of RSI systems. Finally, we address security implications from self-improving int...

  9. 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.

  10. Multi-Layer and Recursive Neural Networks for Metagenomic Classification.

    Science.gov (United States)

    Ditzler, Gregory; Polikar, Robi; Rosen, Gail

    2015-09-01

    Recent advances in machine learning, specifically in deep learning with neural networks, has made a profound impact on fields such as natural language processing, image classification, and language modeling; however, feasibility and potential benefits of the approaches to metagenomic data analysis has been largely under-explored. Deep learning exploits many layers of learning nonlinear feature representations, typically in an unsupervised fashion, and recent results have shown outstanding generalization performance on previously unseen data. Furthermore, some deep learning methods can also represent the structure in a data set. Consequently, deep learning and neural networks may prove to be an appropriate approach for metagenomic data. To determine whether such approaches are indeed appropriate for metagenomics, we experiment with two deep learning methods: i) a deep belief network, and ii) a recursive neural network, the latter of which provides a tree representing the structure of the data. We compare these approaches to the standard multi-layer perceptron, which has been well-established in the machine learning community as a powerful prediction algorithm, though its presence is largely missing in metagenomics literature. We find that traditional neural networks can be quite powerful classifiers on metagenomic data compared to baseline methods, such as random forests. On the other hand, while the deep learning approaches did not result in improvements to the classification accuracy, they do provide the ability to learn hierarchical representations of a data set that standard classification methods do not allow. Our goal in this effort is not to determine the best algorithm in terms accuracy-as that depends on the specific application-but rather to highlight the benefits and drawbacks of each of the approach we discuss and provide insight on how they can be improved for predictive metagenomic analysis.

  11. 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 ...

  12. Rectilinear partitioning of irregular data parallel computations

    Science.gov (United States)

    Nicol, David M.

    1991-01-01

    New mapping algorithms for domain oriented data-parallel computations, where the workload is distributed irregularly throughout the domain, but exhibits localized communication patterns are described. Researchers consider the problem of partitioning the domain for parallel processing in such a way that the workload on the most heavily loaded processor is minimized, subject to the constraint that the partition be perfectly rectilinear. Rectilinear partitions are useful on architectures that have a fast local mesh network. Discussed here is an improved algorithm for finding the optimal partitioning in one dimension, new algorithms for partitioning in two dimensions, and optimal partitioning in three dimensions. The application of these algorithms to real problems are discussed.

  13. Gentile statistics and restricted partitions

    Indian Academy of Sciences (India)

    In a recent paper (Tran et al, Ann. Phys. 311, 204 (2004)), some asymptotic number theoretical results on the partitioning of an integer were derived exploiting its connection to the quantum density of states of a many-particle system. We generalise these results to obtain an asymptotic formula for the restricted or coloured ...

  14. Partitioning of a DRM receiver

    NARCIS (Netherlands)

    Wolkotte, P.T.; Smit, Gerardus Johannes Maria; Smit, L.T.

    In this article we present the results of partitioning the OFDM baseband processing of a DRM receiver into smaller independent processes. Furthermore, we give a short introduction into the relevant parts of the DRM standard. Based on the number of multiplications and additions we can map individual

  15. Development of partitioning method

    International Nuclear Information System (INIS)

    Kubota, Kazuo; Dojiri, Shigeru; Kubota, Masumitsu

    1988-10-01

    The literature survey was carried out on the amount of natural resources, behaviors in reprocessing process and in separation and recovery methods of the platinum group elements and technetium which are contained in spent fuel. The essential results are described below. (1) The platinum group elements, which are contained in spent fuel, are quantitatively limited, compared with total demand for them in Japan. And estimated separation and recovery cost is rather high. In spite of that, development of these techniques is considered to be very important because the supply of these elements is almost from foreign resources in Japan. (2) For recovery of these elements, studies of recovery from undisolved residue and from high level liquid waste (HLLW) also seem to be required. (3) As separation and recovery methods, following techniques are considered to be effective; lead extraction, liquid metal extraction, solvent extraction, ion-exchange, adsorption, precipitation, distillation, electrolysis or their combination. (4) But each of these methods has both advantages and disadvantages. So development of such processes largely depends on future works. (author) 94 refs

  16. The Language Faculty that Wasn't: A Usage-Based Account of Natural Language Recursion

    Directory of Open Access Journals (Sweden)

    Morten H Christiansen

    2015-08-01

    Full Text Available In the generative tradition, the language faculty has been shrinking—perhaps to include only the mechanism of recursion. This paper argues that even this view of the language faculty is too expansive. We first argue that a language faculty is difficult to reconcile with evolutionary considerations. We then focus on recursion as a detailed case study, arguing that our ability to process recursive structure does not rely on recursion as a property of the grammar, but instead emerge gradually by piggybacking on domain-general sequence learning abilities. Evidence from genetics, comparative work on non-human primates, and cognitive neuroscience suggests that humans have evolved complex sequence learning skills, which were subsequently pressed into service to accommodate language. Constraints on sequence learning therefore have played an important role in shaping the cultural evolution of linguistic structure, including our limited abilities for processing recursive structure. Finally, we re-evaluate some of the key considerations that have often been taken to require the postulation of a language faculty.

  17. 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

  18. Some trees with partition dimension three

    Science.gov (United States)

    Fredlina, Ketut Queena; Baskoro, Edy Tri

    2016-02-01

    The concept of partition dimension of a graph was introduced by Chartrand, E. Salehi and P. Zhang (1998) [2]. Let G(V, E) be a connected graph. For S ⊆ V (G) and v ∈ V (G), define the distance d(v, S) from v to S is min{d(v, x)|x ∈ S}. Let Π be an ordered partition of V (G) and Π = {S1, S2, ..., Sk }. The representation r(v|Π) of vertex v with respect to Π is (d(v, S1), d(v, S2), ..., d(v, Sk)). If the representations of all vertices are distinct, then the partition Π is called a resolving partition of G. The partition dimension of G is the minimum k such that G has a resolving partition with k partition classes. In this paper, we characterize some classes of trees with partition dimension three, namely olive trees, weeds, and centipedes.

  19. 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

  20. Fair partitions of polygons: An elementary introduction

    Indian Academy of Sciences (India)

    different numbers of sides etc. and could be arbitrarily positioned within P. Unlike area, we do not know upfront how much perimeter each piece ought to have – its common value has to emerge from the partition. Following [7], we define a fair partition of a polygon as a partition of it into finite number of pieces such that every ...

  1. 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.

  2. Puzzles in modern biology. II. Language, cancer and the recursive processes of evolutionary innovation.

    Science.gov (United States)

    Frank, Steven A

    2016-01-01

    Human language emerged abruptly. Diverse body forms evolved suddenly. Seed-bearing plants spread rapidly. How do complex evolutionary innovations arise so quickly? Resolving alternative claims remains difficult. The great events of the past happened a long time ago. Cancer provides a model to study evolutionary innovation. A tumor must evolve many novel traits to become an aggressive cancer. I use what we know or could study about cancer to describe the key processes of innovation. In general, evolutionary systems form a hierarchy of recursive processes. Those recursive processes determine the rates at which innovations are generated, spread and transmitted. I relate the recursive processes to abrupt evolutionary innovation.

  3. 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

  4. 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.

  5. 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.

  6. Programmable partitioning for high-performance coherence domains in a multiprocessor system

    Science.gov (United States)

    Blumrich, Matthias A [Ridgefield, CT; Salapura, Valentina [Chappaqua, NY

    2011-01-25

    A multiprocessor computing system and a method of logically partitioning a multiprocessor computing system are disclosed. The multiprocessor computing system comprises a multitude of processing units, and a multitude of snoop units. Each of the processing units includes a local cache, and the snoop units are provided for supporting cache coherency in the multiprocessor system. Each of the snoop units is connected to a respective one of the processing units and to all of the other snoop units. The multiprocessor computing system further includes a partitioning system for using the snoop units to partition the multitude of processing units into a plurality of independent, memory-consistent, adjustable-size processing groups. Preferably, when the processor units are partitioned into these processing groups, the partitioning system also configures the snoop units to maintain cache coherency within each of said groups.

  7. Partitions, Identities and Intercultural Education: An Exploration of Some Key Issues

    Science.gov (United States)

    Bash, Leslie

    2011-01-01

    This article attempts an initial exploration of the ramifications of geopolitical partition for identity in the context of children and their education. While not an exhaustive definition, partitions may be observed to follow armed conflict between human collectivities (nation-states, putative nations, ethnic groups, etc.) and are the outcome of…

  8. Human Rights and Peace Audit on Partition in South Asia - Phase II ...

    International Development Research Centre (IDRC) Digital Library (Canada)

    3 févr. 2009 ... Human Rights and Peace Audit on Partition in South Asia - Phase II. In South Asia, people's social, political and cultural aspirations often get articulated as movements for territorially defined political change. Very often, these movements find resolution in partition or in an ethnic group/nationality getting ...

  9. The optimal graph partitioning problem

    DEFF Research Database (Denmark)

    Sørensen, Michael Malmros; Holm, Søren

    1993-01-01

    In this paper we consider the problem of partitioning the set of nodes in a graph in at most p classes, such that the sum of node weights in any class is not greater than the class capacity b, and such that the sum of edge weights, for edges connecting nodes in the same class, is maximal. This pr......In this paper we consider the problem of partitioning the set of nodes in a graph in at most p classes, such that the sum of node weights in any class is not greater than the class capacity b, and such that the sum of edge weights, for edges connecting nodes in the same class, is maximal...

  10. 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)

  11. On the Hosoya index of a family of deterministic recursive trees

    Science.gov (United States)

    Chen, Xufeng; Zhang, Jingyuan; Sun, Weigang

    2017-01-01

    In this paper, we calculate the Hosoya index in a family of deterministic recursive trees with a special feature that includes new nodes which are connected to existing nodes with a certain rule. We then obtain a recursive solution of the Hosoya index based on the operations of a determinant. The computational complexity of our proposed algorithm is O(log2 n) with n being the network size, which is lower than that of the existing numerical methods. Finally, we give a weighted tree shrinking method as a graphical interpretation of the recurrence formula for the Hosoya index.

  12. Filtering Based Recursive Least Squares Algorithm for Multi-Input Multioutput Hammerstein Models

    Directory of Open Access Journals (Sweden)

    Ziyun Wang

    2014-01-01

    Full Text Available This paper considers the parameter estimation problem for Hammerstein multi-input multioutput finite impulse response (FIR-MA systems. Filtered by the noise transfer function, the FIR-MA model is transformed into a controlled autoregressive model. The key-term variable separation principle is used to derive a data filtering based recursive least squares algorithm. The numerical examples confirm that the proposed algorithm can estimate parameters more accurately and has a higher computational efficiency compared with the recursive least squares algorithm.

  13. Parameter Estimation of Permanent Magnet Synchronous Motor Using Orthogonal Projection and Recursive Least Squares Combinatorial Algorithm

    Directory of Open Access Journals (Sweden)

    Iman Yousefi

    2015-01-01

    Full Text Available This paper presents parameter estimation of Permanent Magnet Synchronous Motor (PMSM using a combinatorial algorithm. Nonlinear fourth-order space state model of PMSM is selected. This model is rewritten to the linear regression form without linearization. Noise is imposed to the system in order to provide a real condition, and then combinatorial Orthogonal Projection Algorithm and Recursive Least Squares (OPA&RLS method is applied in the linear regression form to the system. Results of this method are compared to the Orthogonal Projection Algorithm (OPA and Recursive Least Squares (RLS methods to validate the feasibility of the proposed method. Simulation results validate the efficacy of the proposed algorithm.

  14. 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.

  15. 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.

  16. 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.

  17. Gentile statistics and restricted partitions

    Indian Academy of Sciences (India)

    bosons confined in a harmonic trap at a given energy E, in the N → ∞ limit, is the same as the number of ways of ... with a power-law energy spectrum, is analogous to ps(n), that is, the number of ways of partitioning an integer n as a sum of sth ..... [11] for the nuclear level density. We further note that the k → ∞, or the ...

  18. Partitioning sparse rectangular matrices for parallel processing

    Energy Technology Data Exchange (ETDEWEB)

    Kolda, T.G.

    1998-05-01

    The authors are interested in partitioning sparse rectangular matrices for parallel processing. The partitioning problem has been well-studied in the square symmetric case, but the rectangular problem has received very little attention. They will formalize the rectangular matrix partitioning problem and discuss several methods for solving it. They will extend the spectral partitioning method for symmetric matrices to the rectangular case and compare this method to three new methods -- the alternating partitioning method and two hybrid methods. The hybrid methods will be shown to be best.

  19. Gene ordering in partitive clustering using microarray expressions

    Indian Academy of Sciences (India)

    PRAKASH KUMAR

    fibroblast data and showed that our approach improves the result quality of partitive clustering solution, by identifying subclusters within big clusters, grouping functionally correlated genes within clusters, minimization of summation of gene expression distances, and the maximization of biological gene ordering using MIPS ...

  20. A layer model of ethanol partitioning into lipid membranes.

    Science.gov (United States)

    Nizza, David T; Gawrisch, Klaus

    2009-06-01

    The effect of membrane composition on ethanol partitioning into lipid bilayers was assessed by headspace gas chromatography. A series of model membranes with different compositions have been investigated. Membranes were exposed to a physiological ethanol concentration of 20 mmol/l. The concentration of membranes was 20 wt% which roughly corresponds to values found in tissue. Partitioning depended on the chemical nature of polar groups at the lipid/water interface. Compared to phosphatidylcholine, lipids with headgroups containing phosphatidylglycerol, phosphatidylserine, and sphingomyelin showed enhanced partitioning while headgroups containing phosphatidylethanolamine resulted in a lower partition coefficient. The molar partition coefficient was independent of a membrane's hydrophobic volume. This observation is in agreement with our previously published NMR results which showed that ethanol resides almost exclusively within the membrane/water interface. At an ethanol concentration of 20 mmol/l in water, ethanol concentrations at the lipid/water interface are in the range from 30-15 mmol/l, corresponding to one ethanol molecule per 100-200 lipids.

  1. Spectral partitioning in equitable graphs.

    Science.gov (United States)

    Barucca, Paolo

    2017-06-01

    Graph partitioning problems emerge in a wide variety of complex systems, ranging from biology to finance, but can be rigorously analyzed and solved only for a few graph ensembles. Here, an ensemble of equitable graphs, i.e., random graphs with a block-regular structure, is studied, for which analytical results can be obtained. In particular, the spectral density of this ensemble is computed exactly for a modular and bipartite structure. Kesten-McKay's law for random regular graphs is found analytically to apply also for modular and bipartite structures when blocks are homogeneous. An exact solution to graph partitioning for two equal-sized communities is proposed and verified numerically, and a conjecture on the absence of an efficient recovery detectability transition in equitable graphs is suggested. A final discussion summarizes results and outlines their relevance for the solution of graph partitioning problems in other graph ensembles, in particular for the study of detectability thresholds and resolution limits in stochastic block models.

  2. Wakefield Band Partitioning in LINAC Structures

    International Nuclear Information System (INIS)

    Jones, Roger M

    2003-01-01

    In the NLC project multiple bunches of electrons and positrons will be accelerated initially to a centre of mass of 500 GeV and later to 1 TeV or more. In the process of accelerating 192 bunches within a pulse train, wakefields are excited which kick the trailing bunches off axis and can cause luminosity dilution and BBU (Beam Break Up). Several structures to damp the wakefield have been designed and tested at SLAC and KEK and these have been found to successfully damp the wakefield [1]. However, these 2π/3 structures suffered from electrical breakdown and this has prompted us to explore lower group velocity structures operating at higher fundamental mode phase advances. The wakefield partitioning amongst the bands has been found to change markedly with increased phase advance. Here we report on general trends in the kick factor and associated wakefield band partitioning in dipole bands as a function of phase advance of the synchronous mode in linacs. These results are applicable to both TW (travelling wave) and SW (standing wave) structures

  3. Transform analysis and asset pricing for diffusion processes: a recursive approach

    NARCIS (Netherlands)

    Goovaerts, M.J.; Laeven, R.J.A.; Shang, Z.

    2012-01-01

    Diffusion processes play a major role in continuous-time modeling in economics, particularly in continuous-time finance. In most cases, however, the transition density function of a diffusion process is not available in closed form. Using Feynman-Kac integration, we construct a recursive scheme for

  4. 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

  5. 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

  6. Monotonic Set-Extended Prefix Rewriting and Verification of Recursive Ping-Pong Protocols

    DEFF Research Database (Denmark)

    Delzanno, Giorgio; Esparza, Javier; Srba, Jiri

    2006-01-01

    Ping-pong protocols with recursive definitions of agents, but without any active intruder, are a Turing powerful model. We show that under the environment sensitive semantics (i.e. by adding an active intruder capable of storing all exchanged messages including full analysis and synthesis...

  7. 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...

  8. 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...

  9. Recursive calculation of matrix elements for the generalized seniority shell model

    International Nuclear Information System (INIS)

    Luo, F.Q.; Caprio, M.A.

    2011-01-01

    A recursive calculational scheme is developed for matrix elements in the generalized seniority scheme for the nuclear shell model. Recurrence relations are derived which permit straightforward and efficient computation of matrix elements of one-body and two-body operators and basis state overlaps.

  10. Deformation and recursion for the $N = 2 \\; \\alpha = 1$ supersymmetric KdV hierarchy

    NARCIS (Netherlands)

    Sorin, A.S.; Kersten, P.H.M.

    2002-01-01

    A detailed description is given for the construction of the deformation of the $N=2$ supersymmetric $\\alpha=1$ KdV-equation, leading to the recursion operator for symmetries and the zero-th Hamiltonian structure; the solution to a longstanding problem.

  11. Split-remerge method for eliminating processing window artifacts in recursive hierarchical segmentation

    Science.gov (United States)

    Tilton, James C. (Inventor)

    2010-01-01

    A method, computer readable storage, and apparatus for implementing recursive segmentation of data with spatial characteristics into regions including splitting-remerging of pixels with contagious region designations and a user controlled parameter for providing a preference for merging adjacent regions to eliminate window artifacts.

  12. The Monge-Ampère equation: Hamiltonian and symplectic structures, recursions, and hierarchies

    NARCIS (Netherlands)

    Kersten, P.H.M.; Krasil'shchik, I.; Verbovetsky, A.V.

    2004-01-01

    Using methods of geometry and cohomology developed recently, we study the Monge-Ampère equation, arising as the first nontrivial equation in the associativity equations, or WDVV equations. We describe Hamiltonian and symplectic structures as well as recursion operators for this equation in its

  13. Bistable traveling wave solutions in a competitive recursion system with Ricker nonlinearity

    Directory of Open Access Journals (Sweden)

    Shuxia Pan

    2014-03-01

    Full Text Available Using an abstract scheme of monotone semiflows, the existence of bistable traveling wave solutions of a competitive recursion system is established. From the viewpoint of population dynamics, the bistable traveling wave solutions describe the strong inter-specific actions between two competitive species.

  14. The calculation of deep levels in semiconductors by using a recursion method for super-cells

    International Nuclear Information System (INIS)

    Wong Yongliang.

    1987-01-01

    The paper presents the theory of deep levels in semiconductors, the super-cell approach to the theory of deep level impurities, the calculation of band structure by using the tight-binding method and the recursion method used to study the defects in the presence of lattice relaxation and extended defect complexes. 47 refs

  15. 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.

  16. Improving the Network Scale-Up Estimator: Incorporating Means of Sums, Recursive Back Estimation, and Sampling Weights.

    Directory of Open Access Journals (Sweden)

    Patrick Habecker

    Full Text Available Researchers interested in studying populations that are difficult to reach through traditional survey methods can now draw on a range of methods to access these populations. Yet many of these methods are more expensive and difficult to implement than studies using conventional sampling frames and trusted sampling methods. The network scale-up method (NSUM provides a middle ground for researchers who wish to estimate the size of a hidden population, but lack the resources to conduct a more specialized hidden population study. Through this method it is possible to generate population estimates for a wide variety of groups that are perhaps unwilling to self-identify as such (for example, users of illegal drugs or other stigmatized populations via traditional survey tools such as telephone or mail surveys--by asking a representative sample to estimate the number of people they know who are members of such a "hidden" subpopulation. The original estimator is formulated to minimize the weight a single scaling variable can exert upon the estimates. We argue that this introduces hidden and difficult to predict biases, and instead propose a series of methodological advances on the traditional scale-up estimation procedure, including a new estimator. Additionally, we formalize the incorporation of sample weights into the network scale-up estimation process, and propose a recursive process of back estimation "trimming" to identify and remove poorly performing predictors from the estimation process. To demonstrate these suggestions we use data from a network scale-up mail survey conducted in Nebraska during 2014. We find that using the new estimator and recursive trimming process provides more accurate estimates, especially when used in conjunction with sampling weights.

  17. Schmidt games and Markov partitions

    Science.gov (United States)

    Tseng, Jimmy

    2009-03-01

    Let T be a C2-expanding self-map of a compact, connected, C∞, Riemannian manifold M. We correct a minor gap in the proof of a theorem from the literature: the set of points whose forward orbits are nondense has full Hausdorff dimension. Our correction allows us to strengthen the theorem. Combining the correction with Schmidt games, we generalize the theorem in dimension one: given a point x0 ∈ M, the set of points whose forward orbit closures miss x0 is a winning set. Finally, our key lemma, the no matching lemma, may be of independent interest in the theory of symbolic dynamics or the theory of Markov partitions.

  18. On some trees having partition dimension four

    Science.gov (United States)

    Ida Bagus Kade Puja Arimbawa, K.; Baskoro, Edy Tri

    2016-02-01

    In 1998, G. Chartrand, E. Salehi and P. Zhang introduced the notion of partition dimension of a graph. Since then, the study of this graph parameter has received much attention. A number of results have been obtained to know the values of partition dimensions of various classes of graphs. However, for some particular classes of graphs, finding of their partition dimensions is still not completely solved, for instances a class of general tree. In this paper, we study the properties of trees having partition dimension 4. In particular, we show that, for olive trees O(n), its partition dimension is equal to 4 if and only if 8 ≤ n ≤ 17. We also characterize all centipede trees having partition dimension 4.

  19. Scheduling Driven Partitioning of Heterogeneous Embedded Systems

    DEFF Research Database (Denmark)

    Pop, Paul; Eles, Petru; Peng, Zebo

    1998-01-01

    In this paper we present an algorithm for system level hardware/software partitioning of heterogeneous embedded systems. The system is represented as an abstract graph which captures both data-flow and the flow of control. Given an architecture consisting of several processors, ASICs and shared...... busses, our partitioning algorithm finds the partitioning with the smallest hardware cost and is able to predict and guarantee the performance of the system in terms of worst case delay....

  20. Lift of dilogarithm to partition identities

    International Nuclear Information System (INIS)

    Terhoeven, M.

    1992-11-01

    For the whole set of dilogarithm identities found recently using the thermodynamic Bethe-Ansatz for the ADET series of purely elastic scattering theories we give partition identities which involve characters of those conformal field theories which correspond to the UV-limits of the scattering theories. These partition identities in turn allow to derive the dilogarithm identities using modular invariance and a saddle point approximation. We conjecture on possible generalizations of this correspondance, namely, a lift from dilogarithm to partition identities. (orig.)

  1. Partitioning of selected antioxidants in mayonnaise

    DEFF Research Database (Denmark)

    Jacobsen, Charlotte; Schwarz, K.; Stockmann, H.

    1999-01-01

    This study examined partitioning of alpha-, beta-, and gamma- tocopherol and six polar antioxidants (Trolox, ferulic acid, caffeic acid, propyl gallate, gallic acid, and catechin) in mayonnaise. Partitioning of antioxidants between different phases was determined after separation of mayonnaise...... by either (a) centrifugation + ultracentrifugation or (b) centrifugation + dialysis. Antioxidants partitioned in accordance with their chemical structure and polarity: Tocopherols were concentrated in the oil phase (93-96%), while the proportion of polar antioxidants in the oil phase ranged from 0% (gallic...

  2. The stringy instanton partition function

    Energy Technology Data Exchange (ETDEWEB)

    Bonelli, Giulio [International School of Advanced Studies (SISSA),via Bonomea 265, 34136 Trieste (Italy); INFN, Sezione di Trieste,Trieste (Italy); I.C.T.P.,Strada Costiera 11, 34014 Trieste (Italy); Sciarappa, Antonio; Tanzini, Alessandro; Vasko, Petr [International School of Advanced Studies (SISSA),via Bonomea 265, 34136 Trieste (Italy); INFN, Sezione di Trieste,Trieste (Italy)

    2014-01-09

    We perform an exact computation of the gauged linear sigma model associated to a D1-D5 brane system on a resolved A{sub 1} singularity. This is accomplished via supersymmetric localization on the blown-up two-sphere. We show that in the blow-down limit ℂ{sup 2}/ℤ{sub 2} the partition function reduces to the Nekrasov partition function evaluating the equivariant volume of the instanton moduli space. For finite radius we obtain a tower of world-sheet instanton corrections, that we identify with the equivariant Gromov-Witten invariants of the ADHM moduli space. We show that these corrections can be encoded in a deformation of the Seiberg-Witten prepotential. From the mathematical viewpoint, the D1-D5 system under study displays a twofold nature: the D1-branes viewpoint captures the equivariant quantum cohomology of the ADHM instanton moduli space in the Givental formalism, and the D5-branes viewpoint is related to higher rank equivariant Donaldson-Thomas invariants of ℙ{sup 1}×ℂ{sup 2}.

  3. New Weighted Partition Theorems with the Emphasis on the Smallest Part of Partitions

    OpenAIRE

    Berkovich, Alexander; Uncu, Ali Kemal

    2016-01-01

    We use the $q$-binomial theorem, the $q$-Gauss sum, and the ${}_2\\phi_1 \\rightarrow {}_2\\phi_2$ transformation of Jackson to discover and prove many new weighted partition identities. These identities involve unrestricted partitions, overpartitions, and partitions with distinct even parts. Smallest part of the partitions plays an important role in our analysis. This work was motivated in part by the research of Krishna Alladi.

  4. On the analytical evaluation of the partition function for unit hypercubes in four dimensions

    International Nuclear Information System (INIS)

    Hari Dass, N.D.

    1984-10-01

    The group integrations required for the analytic evaluation of the partition function for unit hypercubes in four dimensions are carried out. Modifications of the graphical rules for SU 2 group integrations cited in the literature are developed for this purpose. A complete classification of all surfaces that can be embedded in the unit hypercube is given and their individual contribution to the partition function worked out. Applications are discussed briefly. (orig.)

  5. Gas-particle partitioning of alcohol vapors on organic aerosols.

    Science.gov (United States)

    Chan, Lap P; Lee, Alex K Y; Chan, Chak K

    2010-01-01

    Single particle levitation using an electrodynamic balance (EDB) has been found to give accurate and direct hygroscopic measurements (gas-particle partitioning of water) for a number of inorganic and organic aerosol systems. In this paper, we extend the use of an EDB to examine the gas-particle partitioning of volatile to semivolatile alcohols, including methanol, n-butanol, n-octanol, and n-decanol, on levitated oleic acid particles. The measured K(p) agreed with Pankow's absorptive partitioning model. At high n-butanol vapor concentrations (10(3) ppm), the uptake of n-butanol reduced the average molecular-weight of the oleic acid particle appreciably and hence increased the K(p) according to Pankow's equation. Moreover, the hygroscopicity of mixed oleic acid/n-butanol particles was higher than the predictions given by the UNIFAC model (molecular group contribution method) and the ZSR equation (additive rule), presumably due to molecular interactions between the chemical species in the mixed particles. Despite the high vapor concentrations used, these findings warrant further research on the partitioning of atmospheric organic vapors (K(p)) near sources and how collectively they affect the hygroscopic properties of organic aerosols.

  6. Schmidt games and Markov partitions

    International Nuclear Information System (INIS)

    Tseng, Jimmy

    2009-01-01

    Let T be a C 2 -expanding self-map of a compact, connected, C ∞ , Riemannian manifold M. We correct a minor gap in the proof of a theorem from the literature: the set of points whose forward orbits are nondense has full Hausdorff dimension. Our correction allows us to strengthen the theorem. Combining the correction with Schmidt games, we generalize the theorem in dimension one: given a point x 0 in M, the set of points whose forward orbit closures miss x 0 is a winning set. Finally, our key lemma, the no matching lemma, may be of independent interest in the theory of symbolic dynamics or the theory of Markov partitions

  7. Graph Partitioning Models for Parallel Computing

    Energy Technology Data Exchange (ETDEWEB)

    Hendrickson, B.; Kolda, T.G.

    1999-03-02

    Calculations can naturally be described as graphs in which vertices represent computation and edges reflect data dependencies. By partitioning the vertices of a graph, the calculation can be divided among processors of a parallel computer. However, the standard methodology for graph partitioning minimizes the wrong metric and lacks expressibility. We survey several recently proposed alternatives and discuss their relative merits.

  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. Compactified webs and domain wall partition functions

    Energy Technology Data Exchange (ETDEWEB)

    Shabbir, Khurram [Government College University, Department of Mathematics, Lahore (Pakistan)

    2017-04-15

    In this paper we use the topological vertex formalism to calculate a generalization of the ''domain wall'' partition function of M-strings. This generalization allows calculation of partition function of certain compactified webs using a simple gluing algorithm similar to M-strings case. (orig.)

  10. Partitions of sets and the Riemann integral

    OpenAIRE

    Ungar, Š.

    2006-01-01

    We will discuss the definition of the Riemann integral using general partitions and give an elementary explication, without resorting to nets, generalized sequences and such, of what is meant by saying that "the Riemann integral is the limit of Darboux sums when the mesh of the partition approaches zero".

  11. Topological string partition functions as polynomials

    International Nuclear Information System (INIS)

    Yamaguchi, Satoshi; Yau Shingtung

    2004-01-01

    We investigate the structure of the higher genus topological string amplitudes on the quintic hypersurface. It is shown that the partition functions of the higher genus than one can be expressed as polynomials of five generators. We also compute the explicit polynomial forms of the partition functions for genus 2, 3, and 4. Moreover, some coefficients are written down for all genus. (author)

  12. Stirling numbers and integer partitions | Merca | Quaestiones ...

    African Journals Online (AJOL)

    In this paper, we prove that the Stirling numbers of both kinds can be written as sums over integer partitions. As corollaries, we rewrite some identities with Stirling numbers of both kinds without Stirling numbers. Keywords: Integer partitions, symmetric functions, Stirling numbers ...

  13. Partition functions for supersymmetric black holes

    NARCIS (Netherlands)

    Manschot, J.

    2008-01-01

    This thesis presents a number of results on partition functions for four-dimensional supersymmetric black holes. These partition functions are important tools to explain the entropy of black holes from a microscopic point of view. Such a microscopic explanation was desired after the association of a

  14. Partitioning of resveratrol between pentane and DMSO

    DEFF Research Database (Denmark)

    Shen, Chen; Stein, Paul C.; Klösgen-Buchkremer, Beate Maria

    2015-01-01

    Partitioning of trans-3,5,4′-trihydroxy-stilbene (resveratrol) between n-pentane and DMSO was investigated as a contribution to understand the interaction between resveratrol and biomembranes. In order to determine the partition coefficient P* of resveratrol between pentane and DMSO, resveratrol ...

  15. Data Partitioning Technique for Improved Video Prioritization

    Directory of Open Access Journals (Sweden)

    Ismail Amin Ali

    2017-07-01

    Full Text Available A compressed video bitstream can be partitioned according to the coding priority of the data, allowing prioritized wireless communication or selective dropping in a congested channel. Known as data partitioning in the H.264/Advanced Video Coding (AVC codec, this paper introduces a further sub-partition of one of the H.264/AVC codec’s three data-partitions. Results show a 5 dB improvement in Peak Signal-to-Noise Ratio (PSNR through this innovation. In particular, the data partition containing intra-coded residuals is sub-divided into data from: those macroblocks (MBs naturally intra-coded, and those MBs forcibly inserted for non-periodic intra-refresh. Interactive user-to-user video streaming can benefit, as then HTTP adaptive streaming is inappropriate and the High Efficiency Video Coding (HEVC codec is too energy demanding.

  16. 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.

  17. Generating Milton Babbitt's all-partition arrays

    DEFF Research Database (Denmark)

    Bemman, Brian; Meredith, David

    2016-01-01

    In most of Milton Babbitt's (1916–2011) works written since the early 1960s, both the pitch and rhythmic content is organized according to a highly constrained structure known as the all-partition array. The all-partition array provides a framework that ensures that as many different forms...... backtracking algorithm for generating a particular type of all-partition array found in Babbitt’s works, known as a Smalley array. Constructing such an array is a difficult task, and we present two heuristics for helping to generate this type of structure. We provide the parameter values required...... by this algorithm to generate the specific all-partition arrays used in three of Babbitt’s works. Finally, we evaluate the algorithm and the heuristics in terms of how well they predict the sequences of integer partitions used in two of Babbitt’s works. We also explore the effect of the heuristics...

  18. A recursive vesicle-based model protocell with a primitive model cell cycle.

    Science.gov (United States)

    Kurihara, Kensuke; Okura, Yusaku; Matsuo, Muneyuki; Toyota, Taro; Suzuki, Kentaro; Sugawara, Tadashi

    2015-09-29

    Self-organized lipid structures (protocells) have been proposed as an intermediate between nonliving material and cellular life. Synthetic production of model protocells can demonstrate the potential processes by which living cells first arose. While we have previously described a giant vesicle (GV)-based model protocell in which amplification of DNA was linked to self-reproduction, the ability of a protocell to recursively self-proliferate for multiple generations has not been demonstrated. Here we show that newborn daughter GVs can be restored to the status of their parental GVs by pH-induced vesicular fusion of daughter GVs with conveyer GVs filled with depleted substrates. We describe a primitive model cell cycle comprising four discrete phases (ingestion, replication, maturity and division), each of which is selectively activated by a specific external stimulus. The production of recursive self-proliferating model protocells represents a step towards eventual production of model protocells that are able to mimic evolution.

  19. A recursive vesicle-based model protocell with a primitive model cell cycle

    Science.gov (United States)

    Kurihara, Kensuke; Okura, Yusaku; Matsuo, Muneyuki; Toyota, Taro; Suzuki, Kentaro; Sugawara, Tadashi

    2015-09-01

    Self-organized lipid structures (protocells) have been proposed as an intermediate between nonliving material and cellular life. Synthetic production of model protocells can demonstrate the potential processes by which living cells first arose. While we have previously described a giant vesicle (GV)-based model protocell in which amplification of DNA was linked to self-reproduction, the ability of a protocell to recursively self-proliferate for multiple generations has not been demonstrated. Here we show that newborn daughter GVs can be restored to the status of their parental GVs by pH-induced vesicular fusion of daughter GVs with conveyer GVs filled with depleted substrates. We describe a primitive model cell cycle comprising four discrete phases (ingestion, replication, maturity and division), each of which is selectively activated by a specific external stimulus. The production of recursive self-proliferating model protocells represents a step towards eventual production of model protocells that are able to mimic evolution.

  20. 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...

  1. Efficient Computation of Hartree-Fock Exchange Using Recursive Subspace Bisection.

    Science.gov (United States)

    Gygi, François; Duchemin, Ivan

    2013-01-08

    We use a recursive subspace bisection approach introduced in Phys. Rev. Lett.2009, 102, 166406 to accelerate the computation of the Hartree-Fock exchange operator in plane-wave pseudopotential electronic structure calculations. Recursive subspace bisection allows for an unbiased localization of orbitals in domains of varying size and a truncation of orbitals that preserves accuracy in a controlled manner. This representation is used to accelerate the computation of the Hartree-Fock exchange operator, which in turn makes first-principles molecular dynamics simulations based on hybrid density functionals feasible for larger systems than previously possible. We describe a parallel implementation of the method and a load balancing algorithm. The efficiency and accuracy of this approach are demonstrated in electronic structure calculations of a chloride ion solvated in liquid water and calculations of the vacancy formation energy in a 512-atom silicon crystal using the PBE0 hybrid exchange-correlation functional.

  2. Recursive jigsaw reconstruction: HEP event analysis in the presence of kinematic and combinatoric ambiguities

    Science.gov (United States)

    Jackson, Paul; Rogan, Christopher

    2017-12-01

    We introduce recursive jigsaw reconstruction, a technique for analyzing reconstructed particle interactions in the presence of kinematic and combinatoric unknowns associated with unmeasured and indistinguishable particles, respectively. By factorizing missing information according to decays and rest frames of intermediate particles, an interchangeable and configurable set of jigsaw rules, algorithms for resolving these unknowns, are applied to approximately reconstruct decays with arbitrarily many particles, in their entirety. That the recursive jigsaw reconstruction approach can be used to analyze any event topology of interest, with any number of ambiguities, is demonstrated through twelve different simulated LHC physics examples. These include the production and decay of W , Z , Higgs bosons, and supersymmetric particles including gluinos, stop quarks, charginos, and neutralinos.

  3. Recursive Approach for Evaluation of Time Intervals between Transactions in Polling Procedure

    Directory of Open Access Journals (Sweden)

    Larkin Eugene

    2016-01-01

    Full Text Available An ergodic semi-Markov process with the structure represented by the full graph with loops, which simulates a digital control algorithm that generated transactions onto an object, is investigated. Elementary simplifications for reduction of semi-Markov processes are defined. Recursive procedure for reduction of initial semi-Markov process structure till the model, which includes selected states with its links only, is proposed. Formulae for recalculation of probabilities, weighted densities and expectations of time of switching to linked states are obtained. It is shown that recursive procedure may be used also for calculation of time expectation of return the process to one of selected states that simplified the task of evaluation of time intervals between transactions in polling procedure.

  4. 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.

  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. 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.

  7. Real-time performance evaluation of flooding & recursive time synchronization protocols over Arduino & XBee

    Science.gov (United States)

    Sattar, Danish

    Time synchronization plays an important role in distributed systems. Distributed wireless sensor networks (WSNs) often require accurate time synchronization for coordination and data reliability. The wireless sensor networks have three ma- jor goals: time synchronization, low bandwidth operation, and energy eciency. Dierent time synchronization algorithms aim to achieve these objectives using various methods. In this thesis, performance evaluation of two state-of-the-art time synchronization protocols is presented, namely; Flooding Time Synchronization Protocol and Recursive Time Synchronization Protocol. To achieve time synchronization in WSNs, these two protocols make use of dierent mechanisms: broadcast mechanism is used by Flooding Time Synchronization while peer-to-peer communication is used by Recursive Time Synchronization Protocol. As this is a performance evaluation, three performance parameters were set: the synchronization message count per cycle, the bandwidth and convergence time. Both have been veried using Arduino and XBee using various topologies including bus, grid, mesh, and tree. Each protocol performs dierently based on the topology.

  8. 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.

  9. 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.

  10. Improved recursive Green's function formalism for quasi one-dimensional systems with realistic defects

    Science.gov (United States)

    Teichert, Fabian; Zienert, Andreas; Schuster, Jörg; Schreiber, Michael

    2017-04-01

    We derive an improved version of the recursive Green's function formalism (RGF), which is a standard tool in the quantum transport theory. We consider the case of disordered quasi one-dimensional materials where the disorder is applied in form of randomly distributed realistic defects, leading to partly periodic Hamiltonian matrices. The algorithm accelerates the common RGF in the recursive decimation scheme, using the iteration steps of the renormalization decimation algorithm. This leads to a smaller effective system, which is treated using the common forward iteration scheme. The computational complexity scales linearly with the number of defects, instead of linearly with the total system length for the conventional approach. We show that the scaling of the calculation time of the Green's function depends on the defect density of a random test system. Furthermore, we discuss the calculation time and the memory requirement of the whole transport formalism applied to defective carbon nanotubes.

  11. Probabilistic forecasting of the solar irradiance with recursive ARMA and GARCH models

    DEFF Research Database (Denmark)

    David, M.; Ramahatana, F.; Trombe, Pierre-Julien

    2016-01-01

    sky index show some similarities with that of financial time series. The aim of this paper is to assess the performances of a commonly used combination of two linear models (ARMA and GARCH) in econometrics in order to provide probabilistic forecasts of solar irradiance. In addition, a recursive...... estimation of the parameters of the models has been set up in order to provide a framework that can be applied easily in an operational context. A comprehensive testing procedure has been used to assess both point forecasts and probabilistic forecasts. Using only the past records of the solar irradiance......, the proposed model is able to perform point forecasts as accurately as other methods based on machine learning techniques. Moreover, the recursive ARMA-GARCH model is easier to set-up and it gives additional information about the uncertainty of the forecasts. Even if some strong assumption has been made...

  12. Recursive Block-by-Block Integral Equation Solution for Transient Dynamic Analysis With Memory-Type Elements

    National Research Council Canada - National Science Library

    Jarque, Al

    2001-01-01

    .... Using a recursive block-by-block convolution (RBBIEF) solution to the governing nonlinear Volterra integral equation, structural base motion acting through an arbitrary number of nonlinear base isolators can be computed quickly and accurately...

  13. The Foundations of Mathematics as a Study of Life ---An Effective but Non-Recursive Function---

    Science.gov (United States)

    Atten, M. V.

    The Dutch mathematician and philosopher L. E. J. Brouwer (1881--1966)developed a foundation for mathematics called `intuitionism'. Intuitionism considers mathematics to consist in acts of mental construction based on internal time awareness. According to Brouwer, that awareness provides the fundamental structure to all exact thinking. In this note, it will be shown how this strand of thought leads to an intuitionistic function that is effectively computable yet non-recursive.

  14. Filtering Based Recursive Least Squares Algorithm for Multi-Input Multioutput Hammerstein Models

    OpenAIRE

    Wang, Ziyun; Wang, Yan; Ji, Zhicheng

    2014-01-01

    This paper considers the parameter estimation problem for Hammerstein multi-input multioutput finite impulse response (FIR-MA) systems. Filtered by the noise transfer function, the FIR-MA model is transformed into a controlled autoregressive model. The key-term variable separation principle is used to derive a data filtering based recursive least squares algorithm. The numerical examples confirm that the proposed algorithm can estimate parameters more accurately and has a higher computational...

  15. 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

  16. Estimation of flow components by recursive filters: case study of Paracatu River Basin (SF-7), Brazil

    OpenAIRE

    Renato Moreira Hadad; Paulo Pereira Martins Junior; Vitor Vieira Vasconcelos

    2013-01-01

    The quantification of flow components is important for water resource management. The base, interflow, and runoff flows of nested basins of the Paracatu River (SF-7) were estimated with recursive signal filters in this study. At first, stationary analysis and multivariate gap filling were applied to the flow data. A methodology is presented, proposing filter calibration with the runoff influence and inflection of the recession curve for dry season. Filters are improved with a logic constraint...

  17. Accounting Fundamentals and Variations of Stock Price: Methodological Refinement with Recursive Simultaneous Model

    OpenAIRE

    Sumiyana, Sumiyana; Baridwan, Zaki

    2013-01-01

    This study investigates association between accounting fundamentals and variations of stock prices using recursive simultaneous equation model. The accounting fundamentalsconsist of earnings yield, book value, profitability, growth opportunities and discount rate. The prior single relationships model has been investigated by Chen and Zhang (2007),Sumiyana (2011) and Sumiyana et al. (2010). They assume that all accounting fundamentals associate direct-linearly to the stock returns. This study ...

  18. ACCOUNTING FUNDAMENTALS AND VARIATIONS OF STOCK PRICE: METHODOLOGICAL REFINEMENT WITH RECURSIVE SIMULTANEOUS MODEL

    OpenAIRE

    Sumiyana, Sumiyana; Baridwan, Zaki

    2015-01-01

    This study investigates association between accounting fundamentals and variations of stock prices using recursive simultaneous equation model. The accounting fundamentalsconsist of earnings yield, book value, profitability, growth opportunities and discount rate. The prior single relationships model has been investigated by Chen and Zhang (2007),Sumiyana (2011) and Sumiyana et al. (2010). They assume that all accounting fundamentals associate direct-linearly to the stock returns. This study ...

  19. Online Estimation of Clutch Drag Torque in Wet Dual Clutch Transmission Based on Recursive Least Squares

    OpenAIRE

    Hongkui Li; Tongli Lu; Jianwu Zhang

    2016-01-01

    This paper focuses on developing an estimation method of clutch drag torque in wet DCT. The modelling of clutch drag torque is investigated. As the main factor affecting the clutch drag torque, dynamic viscosity of oil is discussed. The paper proposes an estimation method of clutch drag torque based on recursive least squares by utilizing the dynamic equations of gear shifting synchronization process. The results demonstrate that the estimation method has good accuracy and efficiency.

  20. INVESTIGATION OF TRACKING OF VOLTAGE SIGNAL CONTAINING HARMONICS AND SPIKE BY USING RECURSIVE LEAST SQUARES METHOD

    Directory of Open Access Journals (Sweden)

    H. Hüseyin SAYAN

    2009-01-01

    Full Text Available In this study, recursive least squares method (RLSM that is one of the adaptable classical methods was used. Firstly forgetting factor was adapted to RLSM. Phase information of voltage signal belonging to an electric power network that contains harmonics and spike was obtained by developed approach. Then responses of the algorithm were investigated for voltage collapse, phase shift and spike. Simulation was implemented by using MATLAB® code. Results of simulation were examined and efficiency of method was presented.

  1. Recursive Alterations of the Relationship between Simple Membrane Geometry and Insertion of Amphiphilic Motifs

    DEFF Research Database (Denmark)

    Madsen, Kenneth Lindegaard; Herlo, Rasmus

    2017-01-01

    The shape and composition of a membrane directly regulate the localization, activity, and signaling properties of membrane associated proteins. Proteins that both sense and generate membrane curvature, e.g., through amphiphilic insertion motifs, potentially engage in recursive binding dynamics......, where the recruitment of the protein itself changes the properties of the membrane substrate. Simple geometric models of membrane curvature interactions already provide prediction tools for experimental observations, however these models are treating curvature sensing and generation as separated...

  2. Recursive Estimation of the Stein Center of SPD Matrices & its Applications.

    Science.gov (United States)

    Salehian, Hesamoddin; Cheng, Guang; Vemuri, Baba C; Ho, Jeffrey

    2013-12-01

    Symmetric positive-definite (SPD) matrices are ubiquitous in Computer Vision, Machine Learning and Medical Image Analysis. Finding the center/average of a population of such matrices is a common theme in many algorithms such as clustering, segmentation, principal geodesic analysis, etc. The center of a population of such matrices can be defined using a variety of distance/divergence measures as the minimizer of the sum of squared distances/divergences from the unknown center to the members of the population. It is well known that the computation of the Karcher mean for the space of SPD matrices which is a negatively-curved Riemannian manifold is computationally expensive. Recently, the LogDet divergence-based center was shown to be a computationally attractive alternative. However, the LogDet-based mean of more than two matrices can not be computed in closed form, which makes it computationally less attractive for large populations. In this paper we present a novel recursive estimator for center based on the Stein distance - which is the square root of the LogDet divergence - that is significantly faster than the batch mode computation of this center. The key theoretical contribution is a closed-form solution for the weighted Stein center of two SPD matrices, which is used in the recursive computation of the Stein center for a population of SPD matrices. Additionally, we show experimental evidence of the convergence of our recursive Stein center estimator to the batch mode Stein center. We present applications of our recursive estimator to K-means clustering and image indexing depicting significant time gains over corresponding algorithms that use the batch mode computations. For the latter application, we develop novel hashing functions using the Stein distance and apply it to publicly available data sets, and experimental results have shown favorable comparisons to other competing methods.

  3. Extensions of Kalman recursive estimation theory to retrospective updating and interpolation with applications to instrument calibration

    International Nuclear Information System (INIS)

    Glassey, C.R.; Choy, Y.C.

    1977-09-01

    The problem of estimation of a physical quantity from a set of measurements is considered. We extend Kalman recursive estimation procedure in two ways. First, we explore how to use the latest observation to retrospectively update estimates of past system states. Second, we show how to apply the retrospective update idea to get interpolation estimates between the epochs of observations. We also show application of these ideas for instrument calibration in nuclear accountability systems

  4. Recursive estimation of high-order Markov chains: Approximation by finite mixtures

    Czech Academy of Sciences Publication Activity Database

    Kárný, Miroslav

    2016-01-01

    Roč. 326, č. 1 (2016), s. 188-201 ISSN 0020-0255 R&D Projects: GA ČR GA13-13502S Institutional support: RVO:67985556 Keywords : Markov chain * Approximate parameter estimation * Bayesian recursive estimation * Adaptive systems * Kullback–Leibler divergence * Forgetting Subject RIV: BC - Control Systems Theory Impact factor: 4.832, year: 2016 http://library.utia.cas.cz/separaty/2015/AS/karny-0447119.pdf

  5. Robust control using recursive design method for flexible joint robot manipulators

    Energy Technology Data Exchange (ETDEWEB)

    Yeon, Je Sung; Yim, Jong Guk; Park, Jong Hyeon [Hanyang University, Seoul (Korea, Republic of)

    2011-12-15

    A flexible joint robot manipulator can be regarded as a cascade of two subsystems: link dynamics and the motor dynamics. Using this structural characteristic, we propose a robust nonlinear recursive control method for flexible manipulators. The recursive design is done in two steps. First, a fictitious robust control for the link dynamics is designed as if it has a direct control input. As the fictitious control, a nonlinear H{sub {infinity}} -control using energy dissipation is designed in the sense of L{sub 2}-gain attenuation from the disturbance caused by uncertainties to performance. In the process, Hamilton-Jacobi (HJ) inequality is solved by a more tractable nonlinear matrix inequality (NLMI) method. In the second step, the other fictitious and the actual robust control are designed recursively by using the Lyapunov's second method. The proposed robust control is applied to a two-link robot manipulator with flexible joints in computer simulations. The simulation results show that the proposed robust control has robustness to the model uncertainty caused by changes in the link inertia and the joint stiffness.

  6. Lambda-Dropping: Transforming Recursive Equations into Programs with Block Structure

    DEFF Research Database (Denmark)

    Danvy, Olivier; Schultz, Ulrik Pagh

    1999-01-01

    Lambda-lifting a functional program transforms it into a set of recursive equations. We present the symmetric transformation: lambda-dropping. Lambda-dropping a set of recursive equations restores block structure and lexical scope.For lack of scope, recursive equations must carry around all...... the parameters that any of their callees might possibly need. Both lambda-lifting and lambda-dropping thus require one to compute a transitive closure over the call graph:• for lambda-lifting: to establish the Def/Use path of each free variable (these free variables are then added as parameters to each...... of the functions in the call path);• for lambda-dropping: to establish the Def/Use path of each parameter (parameters whose use occurs in the same scope as their definition do not need to be passed along in the call path).Without free variables, a program is scope-insensitive. Its blocks are then free...

  7. Lambda-Dropping: Transforming Recursive Equations into Programs with Block Structure

    DEFF Research Database (Denmark)

    Danvy, Olivier; Schultz, Ulrik Pagh

    1998-01-01

    Lambda-lifting a functional program transforms it into a set of recursive equations. We present the symmetric transformation: lambda-dropping. Lambda-dropping a set of recursive equations restores block structure and lexical scope.For lack of scope, recursive equations must carry around all...... the parameters that any of their callees might possibly need. Both lambda-lifting and lambda-dropping thus require one to compute a transitive closure over the call graph:• for lambda-lifting: to establish the Def/Use path of each free variable (these free variables are then added as parameters to each...... of the functions in the call path);• for lambda-dropping: to establish the Def/Use path of each parameter (parameters whose use occurs in the same scope as their definition do not need to be passed along in the call path).Without free variables, a program is scope-insensitive. Its blocks are then free...

  8. Lambda-Dropping: Transforming Recursive Equations into Programs with Block Structure

    DEFF Research Database (Denmark)

    Danvy, Olivier; Schultz, Ulrik Pagh

    1997-01-01

    Lambda-lifting a functional program transforms it into a set of recursive equations. We present the symmetric transformation: lambda-dropping. Lambda-dropping a set of recursive equations restores block structure and lexical scope.For lack of scope, recursive equations must carry around all...... the parameters that any of their callees might possibly need. Both lambda-lifting and lambda-dropping thus require one to compute a transitive closure over the call graph:• for lambda-lifting: to establish the Def/Use path of each free variable (these free variables are then added as parameters to each...... of the functions in the call path);• for lambda-dropping: to establish the Def/Use path of each parameter (parameters whose use occurs in the same scope as their definition do not need to be passed along in the call path).Without free variables, a program is scope-insensitive. Its blocks are then free...

  9. Searching for recursive causal structures in multivariate quantitative genetics mixed models.

    Science.gov (United States)

    Valente, Bruno D; Rosa, Guilherme J M; de Los Campos, Gustavo; Gianola, Daniel; Silva, Martinho A

    2010-06-01

    Biology is characterized by complex interactions between phenotypes, such as recursive and simultaneous relationships between substrates and enzymes in biochemical systems. Structural equation models (SEMs) can be used to study such relationships in multivariate analyses, e.g., with multiple traits in a quantitative genetics context. Nonetheless, the number of different recursive causal structures that can be used for fitting a SEM to multivariate data can be huge, even when only a few traits are considered. In recent applications of SEMs in mixed-model quantitative genetics settings, causal structures were preselected on the basis of prior biological knowledge alone. Therefore, the wide range of possible causal structures has not been properly explored. Alternatively, causal structure spaces can be explored using algorithms that, using data-driven evidence, can search for structures that are compatible with the joint distribution of the variables under study. However, the search cannot be performed directly on the joint distribution of the phenotypes as it is possibly confounded by genetic covariance among traits. In this article we propose to search for recursive causal structures among phenotypes using the inductive causation (IC) algorithm after adjusting the data for genetic effects. A standard multiple-trait model is fitted using Bayesian methods to obtain a posterior covariance matrix of phenotypes conditional to unobservable additive genetic effects, which is then used as input for the IC algorithm. As an illustrative example, the proposed methodology was applied to simulated data related to multiple traits measured on a set of inbred lines.

  10. 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.

  11. Many-body formalism for fermions: The partition function

    Science.gov (United States)

    Watson, D. K.

    2017-09-01

    The partition function, a fundamental tenet in statistical thermodynamics, contains in principle all thermodynamic information about a system. It encapsulates both microscopic information through the quantum energy levels and statistical information from the partitioning of the particles among the available energy levels. For identical particles, this statistical accounting is complicated by the symmetry requirements of the allowed quantum states. In particular, for Fermi systems, the enforcement of the Pauli principle is typically a numerically demanding task, responsible for much of the cost of the calculations. The interplay of these three elements—the structure of the many-body spectrum, the statistical partitioning of the N particles among the available levels, and the enforcement of the Pauli principle—drives the behavior of mesoscopic and macroscopic Fermi systems. In this paper, we develop an approach for the determination of the partition function, a numerically difficult task, for systems of strongly interacting identical fermions and apply it to a model system of harmonically confined, harmonically interacting fermions. This approach uses a recently introduced many-body method that is an extension of the symmetry-invariant perturbation method (SPT) originally developed for bosons. It uses group theory and graphical techniques to avoid the heavy computational demands of conventional many-body methods which typically scale exponentially with the number of particles. The SPT application of the Pauli principle is trivial to implement since it is done "on paper" by imposing restrictions on the normal-mode quantum numbers at first order in the perturbation. The method is applied through first order and represents an extension of the SPT method to excited states. Our method of determining the partition function and various thermodynamic quantities is accurate and efficient and has the potential to yield interesting insight into the role played by the Pauli

  12. Multilevel Algorithms for Multi-Constraint Hypergraph Partitioning

    National Research Council Canada - National Science Library

    Karypis, George

    1999-01-01

    Traditional hypergraph partitioning algorithms compute a bisection of a graph such that the number of hyperedges that are cut by the partitioning is minimized and each partition has an equal number of vertices...

  13. Splittings of free groups, normal forms and partitions of ends

    Indian Academy of Sciences (India)

    -ball in M. DEFINITION 2.2. A system of 2-spheres in M is defined to be a finite collection of disjointly embedded smooth essential 2-spheres Si ⊂ M such that no two spheres in this collection are isotopic. Let. = ∪j j be a maximal system of ...

  14. Splittings of free groups, normal forms and partitions of ends

    Indian Academy of Sciences (India)

    The space ˜M is the union of the spaces Kτ , with τ a finite subtree of T . Henceforth, whenever we consider such a subtree τ of T , K = Kτ , Wi, Ni are as defined above. 2.5 Ends of ˜M. We recall the notion of ends of a topological space. An end of a topological space is a point of the so called Freudenthal compactification of ...

  15. The partition dimension of cycle books graph

    Science.gov (United States)

    Santoso, Jaya; Darmaji

    2018-03-01

    Let G be a nontrivial and connected graph with vertex set V(G), edge set E(G) and S ⊆ V(G) with v ∈ V(G), the distance between v and S is d(v,S) = min{d(v,x)|x ∈ S}. For an ordered partition ∏ = {S 1, S 2, S 3,…, Sk } of V(G), the representation of v with respect to ∏ is defined by r(v|∏) = (d(v, S 1), d(v, S 2),…, d(v, Sk )). The partition ∏ is called a resolving partition of G if all representations of vertices are distinct. The partition dimension pd(G) is the smallest integer k such that G has a resolving partition set with k members. In this research, we will determine the partition dimension of Cycle Books {B}{Cr,m}. Cycle books graph {B}{Cr,m} is a graph consisting of m copies cycle Cr with the common path P 2. It is shown that the partition dimension of cycle books graph, pd({B}{C3,m}) is 3 for m = 2, 3, and m for m ≥ 4. pd({B}{C4,m}) is 3 + 2k for m = 3k + 2, 4 + 2(k ‑ 1) for m = 3k + 1, and 3 + 2(k ‑ 1) for m = 3k. pd({B}{C5,m}) is m + 1.

  16. [Partial stomach partitioning gastrojejunostomy in the treatment of the malignant gastric outlet obstruction].

    Science.gov (United States)

    Abdel-lah-Fernández, Omar; Parreño-Manchado, Felipe Carlos; García-Plaza, Asunción; Álvarez-Delgado, Alberto

    2015-01-01

    In patients with unresectable gastric cancer and outlet obstruction syndrome, gastric partitioning gastrojejunostomy is an alternative, which could avoid the drawbacks of the standard techniques. Comparison of antroduodenal stent, conventional gastrojejunostomy and gastric partitioning gastrojejunostomy. A retrospective, cross-sectional study was conducted on patients with unresectable distal gastric cancer and gastric outlet obstruction, treated with the three different techniques over the last 12 years, comparing results based on oral tolerance and complications. An analysis was performed on the results using the Student-t test for independent variables. The 22 patients were divided in 3 groups: group I (6 cases) stent, group II (9 cases) conventional gastrojejunostomy, and group III (7 cases) gastric partitioning gastrojejunostomy, respectively. The stent allows a shorter "postoperative" stay and early onset of oral tolerance (Pgastric partitioning gastrojejunostomy achieve normal diet at 15th day (Pgastric partitioning gastrojejunostomy, achieving an overall survival of 6.5 months. The gastric partitioning gastrojejunostomy for treatment of gastric outlet obstruction in unresectable advanced gastric cancer is a safe technique, allowing a more complete diet with lower morbidity and improved survival. Copyright © 2015 Academia Mexicana de Cirugía A.C. Published by Masson Doyma México S.A. All rights reserved.

  17. Recursive Principal Components Analysis Using Eigenvector Matrix Perturbation

    Directory of Open Access Journals (Sweden)

    Deniz Erdogmus

    2004-10-01

    Full Text Available Principal components analysis is an important and well-studied subject in statistics and signal processing. The literature has an abundance of algorithms for solving this problem, where most of these algorithms could be grouped into one of the following three approaches: adaptation based on Hebbian updates and deflation, optimization of a second-order statistical criterion (like reconstruction error or output variance, and fixed point update rules with deflation. In this paper, we take a completely different approach that avoids deflation and the optimization of a cost function using gradients. The proposed method updates the eigenvector and eigenvalue matrices simultaneously with every new sample such that the estimates approximately track their true values as would be calculated from the current sample estimate of the data covariance matrix. The performance of this algorithm is compared with that of traditional methods like Sanger's rule and APEX, as well as a structurally similar matrix perturbation-based method.

  18. REE Partitioning in Lunar Minerals

    Science.gov (United States)

    Rapp, J. F.; Lapen, T. J.; Draper, D. S.

    2015-01-01

    Rare earth elements (REE) are an extremely useful tool in modeling lunar magmatic processes. Here we present the first experimentally derived plagioclase/melt partition coefficients in lunar compositions covering the entire suite of REE. Positive europium anomalies are ubiquitous in the plagioclase-rich rocks of the lunar highlands, and complementary negative Eu anomalies are found in most lunar basalts. These features are taken as evidence of a large-scale differentiation event, with crystallization of a global-scale lunar magma ocean (LMO) resulting in a plagioclase flotation crust and a mafic lunar interior from which mare basalts were subsequently derived. However, the extent of the Eu anomaly in lunar rocks is variable. Fagan and Neal [1] reported highly anorthitic plagioclase grains in lunar impact melt rock 60635,19 that displayed negative Eu anomalies as well as the more usual positive anomalies. Indeed some grains in the sample are reported to display both positive and negative anomalies. Judging from cathodoluminescence images, these anomalies do not appear to be associated with crystal overgrowths or zones.

  19. Convex Regression with Interpretable Sharp Partitions.

    Science.gov (United States)

    Petersen, Ashley; Simon, Noah; Witten, Daniela

    2016-06-01

    We consider the problem of predicting an outcome variable on the basis of a small number of covariates, using an interpretable yet non-additive model. We propose convex regression with interpretable sharp partitions (CRISP) for this task. CRISP partitions the covariate space into blocks in a data-adaptive way, and fits a mean model within each block. Unlike other partitioning methods, CRISP is fit using a non-greedy approach by solving a convex optimization problem, resulting in low-variance fits. We explore the properties of CRISP, and evaluate its performance in a simulation study and on a housing price data set.

  20. 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.

  1. Plasmid and chromosome partitioning: surprises from phylogeny

    DEFF Research Database (Denmark)

    Gerdes, Kenn; Møller-Jensen, Jakob; Bugge Jensen, Rasmus

    2000-01-01

    Plasmids encode partitioning genes (par) that are required for faithful plasmid segregation at cell division. Initially, par loci were identified on plasmids, but more recently they were also found on bacterial chromosomes. We present here a phylogenetic analysis of par loci from plasmids...... and chromosomes from prokaryotic organisms. All known plasmid-encoded par loci specify three components: a cis-acting centromere-like site and two trans-acting proteins that form a nucleoprotein complex at the centromere (i.e. the partition complex). The proteins are encoded by two genes in an operon...... that is autoregulated by the par-encoded proteins. In all cases, the upstream gene encodes an ATPase that is essential for partitioning. Recent cytological analyses indicate that the ATPases function as adaptors between a host-encoded component and the partition complex and thereby tether plasmids and chromosomal...

  2. Thermal tolerance and resource partitioning in aphids

    Czech Academy of Sciences Publication Activity Database

    Dixon, Anthony F. G.

    XCII, - (2009), s. 171-173 ISSN 0370-4327 Institutional research plan: CEZ:AV0Z60870520 Keywords : aphids * coexistence * food quality * resource partitioning * thermal tolerance Subject RIV: EG - Zoology

  3. Cell Partition in Two Polymer Aqueous Phases

    Science.gov (United States)

    Harris, J. M.

    1985-01-01

    Partition of biological cells in two phase aqueous polymer systems is recognized as a powerful separation technique which is limited by gravity. The synthesis of new, selective polymer ligand conjugates to be used in affinity partition separations is of interest. The two most commonly used polymers in two phase partitioning are dextran and polyethylene glycol. A thorough review of the chemistry of these polymers was begun, particularly in the area of protein attachment. Preliminary studies indicate the importance in affinity partitioning of minimizing gravity induced randomizing forces in the phase separation process. The PEG-protein conjugates that were prepared appear to be ideally suited for achieving high quality purifications in a microgravity environment. An interesting spin-off of this synthetic work was the observation of catalytic activity for certain of our polymer derivatives.

  4. OPTIMAL PARTITIONS OF DATA IN HIGHER DIMENSIONS

    Data.gov (United States)

    National Aeronautics and Space Administration — OPTIMAL PARTITIONS OF DATA IN HIGHER DIMENSIONS BRADLEY W. JACKSON*, JEFFREY D. SCARGLE, AND CHRIS CUSANZA, DAVID BARNES, DENNIS KANYGIN, RUSSELL SARMIENTO, SOWMYA...

  5. 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.

  6. Multimedia environmental chemical partitioning from molecular information

    International Nuclear Information System (INIS)

    Martinez, Izacar; Grifoll, Jordi; Giralt, Francesc; Rallo, Robert

    2010-01-01

    physicochemical and transport properties, and degradation rates. - Research Highlights: →Support vector regression-based QSFRs can be as useful as Multimedia Models →Multimedia chemical partitioning can be predicted directly from molecular information. →Molecular group counts are better input information than molecular descriptors. →Distribution of chemicals is best predicted when considering chemical families

  7. Partitioning taxonomic diversity of aquatic insect assemblages ...

    Science.gov (United States)

    Biological diversity can be divided into: alpha (α, local), beta (β, difference in assemblage composition among locals), and gamma (γ, total diversity). We assessed the partitioning of taxonomic diversity of Ephemeroptera, Plecoptera and Trichoptera (EPT) and of functional feeding groups (FFG) in Neotropical Savanna (southeastern Brazilian Cerrado) streams. To do so, we considered three diversity components: stream site (α), among stream sites (β1), and among hydrologic units (β2). We also evaluated the association of EPT genera composition with heterogeneity in land use, instream physical habitat structure, and instream water quality variables. The percent of EPT taxonomic α diversity (20.7%) was lower than the β1 and β2 diversities (53.1% and 26.2%, respectively). The EPT FFG α diversity (26.5%) was lower than the β1 diversity (55.8%) and higher than the β2 (17.7%) diversity. The collector-gatherer FFG was predominant and had the greatest β diversity among stream sites (β1, 55.8%). Our findings support the need for implementing regional scale conservation strategies in the Cerrado biome, which has been degraded by anthropogenic activities. Using adaptations of the US EPA’s National Aquatic Resource Survey (NARS) designs and methods, Ferreira and colleagues examined the distribution of taxonomic and functional diversity of aquatic insects among basins, stream sites within basins, and within stream sample reaches. They sampled 160 low-order stre

  8. Deriving the Hirshfeld partitioning using distance metrics

    Science.gov (United States)

    Heidar-Zadeh, Farnaz; Ayers, Paul W.; Bultinck, Patrick

    2014-09-01

    The atoms in molecules associated with the Hirshfeld partitioning minimize the generalized Hellinger-Bhattacharya distance to the reference pro-atom densities. Moreover, the reference pro-atoms can be chosen by minimizing the distance between the pro-molecule density and the true molecular density. This provides an alternative to both the heuristic "stockholder" and the mathematical information-theoretic interpretations of the Hirshfeld partitioning. These results extend to any member of the family of f-divergences.

  9. Actinide and fission product partitioning and transmutation

    International Nuclear Information System (INIS)

    1997-01-01

    The fourth international information exchange meeting on actinide and fission product partitioning and transmutation, took place in Mito City in Japan, on 111-13 September 1996. The proceedings are presented in six sessions: the major programmes and international cooperation, the partitioning and transmutation programs, feasibility studies, particular separation processes, the accelerator driven transmutation, and the chemistry of the fuel cycle. (A.L.B.)

  10. Deriving the Hirshfeld partitioning using distance metrics

    International Nuclear Information System (INIS)

    Heidar-Zadeh, Farnaz; Ayers, Paul W.; Bultinck, Patrick

    2014-01-01

    The atoms in molecules associated with the Hirshfeld partitioning minimize the generalized Hellinger-Bhattacharya distance to the reference pro-atom densities. Moreover, the reference pro-atoms can be chosen by minimizing the distance between the pro-molecule density and the true molecular density. This provides an alternative to both the heuristic “stockholder” and the mathematical information-theoretic interpretations of the Hirshfeld partitioning. These results extend to any member of the family of f-divergences

  11. Actinide and fission product partitioning and transmutation

    Energy Technology Data Exchange (ETDEWEB)

    NONE

    1997-07-01

    The fourth international information exchange meeting on actinide and fission product partitioning and transmutation, took place in Mito City in Japan, on 111-13 September 1996. The proceedings are presented in six sessions: the major programmes and international cooperation, the partitioning and transmutation programs, feasibility studies, particular separation processes, the accelerator driven transmutation, and the chemistry of the fuel cycle. (A.L.B.)

  12. The utilization of abelian point group symmetry in the graphical unitary group approach to the calculation of correlated electronic wavefunctions

    Science.gov (United States)

    Shavitt, I.

    1979-01-01

    A procedure is described for the utilization of abelian point group symmetry in the graphical unitary group approach (GUGA) to calculations of correlated electronic wavefunctions. The procedure is based on a recursively computed set of symmetry dependent counting indices, and results in the separate numbering, without gaps, of the Gelfand states (configuration functions) belonging to each symmetry species

  13. Refined Partition Functions for Open Superstrings with 4, 8 and 16 Supercharges

    CERN Document Server

    Lust, Dieter; Schlotterer, Oliver; Thomson, Andrew

    2013-01-01

    We analyse the perturbative massive open string spectrum of even dimensional superstring compactifications with four, eight and sixteen supercharges. In each of such cases, we focus on universal states that exist independently on the internal geometry and other compatification details. We analytically compute refined partition functions that count these states at each mass level. Such refined partition functions are written in a super-Poincare covariant form, providing information on how supermultiplets transform under the little group and the R symmetry. Various asymptotic limits of the partition functions and their associated quantities, such as the leading and subleading Regge trajectories, are studied empirically and analytically. In the phenomenologically relevant case of four supercharges, the partition function can be cast into the most compact form and the asymptotic formula in the large spin limit is derived explicitly.

  14. Optimization of Time-Partitions for Mixed-Criticality Real-Time Distributed Embedded Systems

    DEFF Research Database (Denmark)

    Tamas-Selicean, Domitian; Pop, Paul

    2011-01-01

    In this paper we are interested in mixed-criticality embedded real-time applications mapped on distributed heterogeneous architectures. The architecture provides both spatial and temporal partitioning, thus enforcing enough separation for the critical applications. With temporal partitioning, each...... application is allowed to run only within predefined time slots, allocated on each processor. The sequence of time slots for all the applications on a processor are grouped within a Major Frame, which is repeated periodically. We assume that the safety-critical applications (on all criticality levels......) are scheduled using static-cyclic scheduling and the noncritical applications are scheduled using fixed-priority preemptive scheduling. We consider that each application runs in a separate partition, and each partition is allocated several time slots on the processors where the application is mapped. We...

  15. Task Mapping and Partition Allocation for Mixed-Criticality Real-Time Systems

    DEFF Research Database (Denmark)

    Tamas-Selicean, Domitian; Pop, Paul

    2012-01-01

    In this paper we address the mapping of mixedcriticality hard real-time applications on distributed embedded architectures. We assume that the architecture provides both spatial and temporal partitioning, thus enforcing enough separation between applications. With temporal partitioning, each...... application runs in a separate partition, and each partition is allocated several time slots on the processors where the application is mapped. The sequence of time slots for all the applications on a processor are grouped within a Major Frame, which is repeated periodically. We assume that the applications...... are scheduled using static-cyclic scheduling. We are interested to determine the task mapping to processors, and the sequence and size of the time slots within the Major Frame on each processor, such that the applications are schedulable. We have proposed a Tabu Search-based approach to solve this optimization...

  16. Categorical Semantics for Functional Reactive Programming with Temporal Recursion and Corecursion

    Directory of Open Access Journals (Sweden)

    Wolfgang Jeltsch

    2014-06-01

    Full Text Available Functional reactive programming (FRP makes it possible to express temporal aspects of computations in a declarative way. Recently we developed two kinds of categorical models of FRP: abstract process categories (APCs and concrete process categories (CPCs. Furthermore we showed that APCs generalize CPCs. In this paper, we extend APCs with additional structure. This structure models recursion and corecursion operators that are related to time. We show that the resulting categorical models generalize those CPCs that impose an additional constraint on time scales. This constraint boils down to ruling out ω-supertasks, which are closely related to Zeno's paradox of Achilles and the tortoise.

  17. Generation and importance of linked and irreducible moment diagrams in the recursive residue generation method

    International Nuclear Information System (INIS)

    Schek, I.; Wyatt, R.E.

    1986-01-01

    Molecular multiphoton processes are treated in the Recursive Residue Generation Method (A. Nauts and R.E. Wyatt, Phys. Rev. Lett 51, 2238 (1983)) by converting the molecular-field Hamiltonian matrix into tridiagonal form, using the Lanczos equations. In this study, the self-energies (diagonal) and linking (off-diagaonal) terms in the tridiagonal matrix are obtained by comparing linked moment diagrams in both representations. The dynamics of the source state is introduced and computed in terms of the linked and the irreducible moments

  18. Speed control of induction motor using fuzzy recursive least squares technique

    OpenAIRE

    Santiago Sánchez; Eduardo Giraldo

    2008-01-01

    A simple adaptive controller design is presented in this paper, the control system uses the adaptive fuzzy logic, sliding modes and is trained with the recursive least squares technique. The problem of parameter variation is solved with the adaptive controller; the use of an internal PI regulator produces that the speed control of the induction motor be achieved by the stator currents instead the input voltage. The rotor-flux oriented coordinated system model is used to develop and test the c...

  19. Speed control of induction motor using fuzzy recursive least squares technique

    Directory of Open Access Journals (Sweden)

    Santiago Sánchez

    2008-12-01

    Full Text Available A simple adaptive controller design is presented in this paper, the control system uses the adaptive fuzzy logic, sliding modes and is trained with the recursive least squares technique. The problem of parameter variation is solved with the adaptive controller; the use of an internal PI regulator produces that the speed control of the induction motor be achieved by the stator currents instead the input voltage. The rotor-flux oriented coordinated system model is used to develop and test the control system.

  20. On the sensitivity of the recursive filter with arbitrary order predictor in DPCM system

    Directory of Open Access Journals (Sweden)

    Danković Nikola

    2014-01-01

    Full Text Available Sensitivity analysis of the recursive filter in a DPCM system, with arbitrary order predictor, is presented in this paper. Relations for sensitivity, related to predictor coefficients, are derived both in cases of stable and unstable systems. In this way, we presented new information which can improve design of the system in the sense of better performances via parameters (coefficient adjustment. Given relations were verified for the case of real system in three different configurations: with the second, third and fifth order predictors.

  1. Recursion Formulae for Obtaining Surfaces with Constant Mean Curvature in R2,1

    International Nuclear Information System (INIS)

    Tian Yongbo; Nan Zhijie; Tian Chou

    2007-01-01

    Though the Baecklund transformation on time-like surfaces with constant mean curvature surfaces in R 2,1 has been obtained, it is not easy to obtain corresponding surfaces because the procedure of solving the related integrable system cannot be avoided when the Baecklund transformation is used. For sake of this, in this article, some special work is done to reform the Baecklund transformation to a recursion formula, by which we can construct time-like surfaces with constant mean curvature form known ones just by quadrature procedure.

  2. Recursiveness in learning processes: An analogy to help software development for ABA intervention for autistic kids

    Science.gov (United States)

    Presti, Giovambattista; Premarini, Claudio; Leuzzi, Martina; Di Blasi, Melina; Squatrito, Valeria

    2017-11-01

    The operant was conceptualized by Skinner as a class of behaviors which have common effect on the environment and that, as a class can be shown to vary lawfully in their relations to the other environmental variables, namely antecedents and consequences. And Skinner himself underlined the fact that "operant field is the very field purpose of behavior". The operant offers interesting basic and applied characteristic to conceptualize complex behavior as a recursive process of learning. In this paper we will discuss how the operant concept can be applied in the implementation of software oriented to increase cognitive skills in autistic children and provide an example.

  3. Generalized Recursion Relations for Correlators in the Gauge-Gravity Correspondence

    Science.gov (United States)

    Raju, Suvrat

    2011-03-01

    We show that a generalization of the Britto-Cachazo-Feng-Witten recursion relations gives a new and efficient method of computing correlation functions of the stress tensor or conserved currents in conformal field theories with an (d+1)-dimensional anti-de Sitter space dual, for d≥4, in the limit where the bulk theory is approximated by tree-level Yang-Mills theory or gravity. In supersymmetric theories, additional correlators of operators that live in the same multiplet as a conserved current or stress tensor can be computed by these means.

  4. Generalized recursion relations for correlators in the gauge-gravity correspondence.

    Science.gov (United States)

    Raju, Suvrat

    2011-03-04

    We show that a generalization of the Britto-Cachazo-Feng-Witten recursion relations gives a new and efficient method of computing correlation functions of the stress tensor or conserved currents in conformal field theories with an (d+1)-dimensional anti-de Sitter space dual, for d≥4, in the limit where the bulk theory is approximated by tree-level Yang-Mills theory or gravity. In supersymmetric theories, additional correlators of operators that live in the same multiplet as a conserved current or stress tensor can be computed by these means.

  5. 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

  6. Recursive differentiation method to study the nature of carbon nanobeams: A numerical approach

    Science.gov (United States)

    Nagar, Priyanka; Tiwari, Parul

    2017-10-01

    This paper is concerned with the application of non-local elasticity theory to analyze the nature of carbon nanotubes/nanobeams embedded in an elastic medium. Winkler-type foundation is used as an elastic medium. The governing equations are investigated by finding the critical buckling load with aid of Recursive Differentiation Method. This method requires less computation time and thus the convergence is fast. The effects of small scale parameter and elastic foundation on buckling load are observed and outputs are plotted graphically. In addition, the accuracy of the present method is verified with the results available in literature.

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

    NARCIS (Netherlands)

    Blankers, Matthijs; Frijns, Tom; Belackova, Vendula; Rossi, Carla; Svensson, Bengt; Trautmann, Franz; van Laar, Margriet

    2014-01-01

    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

  8. Predicting Cannabis Abuse Screening Test (CAST) Scores : A recursive partitioning analysis using survey data from Czech Republic, Italy, the Netherlands and Sweden

    NARCIS (Netherlands)

    Blankers, Matthijs; Frijns, Tom; Belackova, Vendula; Rossi, Carla; Svensson, Bengt; Trautmann, Franz; Van Laar, Margriet

    2014-01-01

    Introduction: 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

  9. Utility Independent Privacy Preserving Data Mining - Horizontally Partitioned Data

    Directory of Open Access Journals (Sweden)

    E Poovammal

    2010-06-01

    Full Text Available Micro data is a valuable source of information for research. However, publishing data about individuals for research purposes, without revealing sensitive information, is an important problem. The main objective of privacy preserving data mining algorithms is to obtain accurate results/rules by analyzing the maximum possible amount of data without unintended information disclosure. Data sets for analysis may be in a centralized server or in a distributed environment. In a distributed environment, the data may be horizontally or vertically partitioned. We have developed a simple technique by which horizontally partitioned data can be used for any type of mining task without information loss. The partitioned sensitive data at 'm' different sites are transformed using a mapping table or graded grouping technique, depending on the data type. This transformed data set is given to a third party for analysis. This may not be a trusted party, but it is still allowed to perform mining operations on the data set and to release the results to all the 'm' parties. The results are interpreted among the 'm' parties involved in the data sharing. The experiments conducted on real data sets prove that our proposed simple transformation procedure preserves one hundred percent of the performance of any data mining algorithm as compared to the original data set while preserving privacy.

  10. [Preformulation studies of potential drug XIX M: partition coefficient].

    Science.gov (United States)

    Capková, Z; Vitková, Z; Tilandyová, J; Cizmárik, J

    2005-03-01

    The factors which markedly influence availability of the drug from the dosage form include also auxiliary substances, which are an inevitable component in the formulation of the drug. In the selection of auxiliary substances for a newly formulated drug, it is necessary to know that the drug is never a simple mixture of mutually independent ingredients, but a dynamic system in which various physical and chemical processes take place. The present paper aims to study the effect of auxiliary substances from the group of humectants with graded concentrations and the effect of the preservative on the partition coefficient of potential drug XIX M. Partition coefficient (P') was estimated in the system n-octanol/aqueous solution with graded concentrations of polyols. In these estimations, n-octanol simulated the horny layer, and the aqueous solution the base of the topical preparation. The auxiliary substances employed were polyols - glycerol, propylene glycol, and sorbitol in 5, 10, 15, and 20% concentrations and an antimicrobially effective solution of Ajatin (Solution benzododecinii bromati) in two concentrations of 0.01 and 0.1 wt %. It follows from the obtained results that the values of partition coefficient of potential drug XIX M are greatly influenced by auxiliary substances. The value of this parameter, and therefore also biological availability, depend not only on the sort of the polyol used and its concentration, but also on the concentration of the preservative employed, in this case Ajatin.

  11. Ecological partitioning and diversity in tropical planktonic foraminifera

    Directory of Open Access Journals (Sweden)

    Seears Heidi A

    2012-04-01

    Full Text Available Abstract Background Ecological processes are increasingly being viewed as an important mode of diversification in the marine environment, where the high dispersal potential of pelagic organisms, and a lack of absolute barriers to gene flow may limit the occurrence of allopatric speciation through vicariance. Here we focus on the potential role of ecological partitioning in the diversification of a widely distributed group of marine protists, the planktonic foraminifera. Sampling was conducted in the tropical Arabian Sea, during the southwest (summer monsoon, when pronounced environmental conditions result in a strong disparity in temperature, salinity and productivity between distinct northern and southern water masses. Results We uncovered extensive genetic diversity within the Arabian Sea planktonic foraminifera, identifying 13 morphospecies, represented by 20 distinct SSU rRNA genetic types. Several morphospecies/genetic types displayed non-random biogeographical distributions, partitioning between the northern and southern water masses, giving a strong indication of independent ecological adaptations. Conclusions We propose sea-surface primary productivity as the main factor driving the geographical segregation of Arabian Sea planktonic foraminifera, during the SW monsoon, with variations in symbiotic associations possibly playing a role in the specific ecological adaptations observed. Our findings suggest that ecological partitioning could be contributing to the high levels of 'cryptic' genetic diversity observed within the planktonic foraminifera, and support the view that ecological processes may play a key role in the diversification of marine pelagic organisms.

  12. Recursive Fitness

    National Research Council Canada - National Science Library

    Cook, James

    1998-01-01

    ...; all the other voyagers are tried and true initiates. His brotherhood lives under arcane rules -- one may not eat beans, for instance -- and dedicates itself to discovering mathematical regularity in nature...

  13. Recursive Averaging

    Science.gov (United States)

    Smith, Scott G.

    2015-01-01

    In this article, Scott Smith presents an innocent problem (Problem 12 of the May 2001 Calendar from "Mathematics Teacher" ("MT" May 2001, vol. 94, no. 5, p. 384) that was transformed by several timely "what if?" questions into a rewarding investigation of some interesting mathematics. These investigations led to two…

  14. Multicanonical recursions

    International Nuclear Information System (INIS)

    Berg, B.A.

    1996-01-01

    Recently multicanonical Monte Carlo (MC) sampling and closely related methods have received much attention. Considerable gains have been achieved in situations with open-quotes supercriticalclose quotes slowing down, such as first-order transition, and systems with conflicting constrains, for instance, spin glasses or proteins. In the multicanonical ensemble one samples configurations such that exact reconstruction of canonical expectation values becomes feasible for a desired temperature range. This requires a broad energy distribution, and leaves innovative freedom concerning the optimal shape. Considerable practical experience exists only for the uniform energy distribution

  15. Predicting solute partitioning in lipid bilayers: Free energies and partition coefficients from molecular dynamics simulations and COSMOmic

    Science.gov (United States)

    Jakobtorweihen, S.; Zuniga, A. Chaides; Ingram, T.; Gerlach, T.; Keil, F. J.; Smirnova, I.

    2014-07-01

    Quantitative predictions of biomembrane/water partition coefficients are important, as they are a key property in pharmaceutical applications and toxicological studies. Molecular dynamics (MD) simulations are used to calculate free energy profiles for different solutes in lipid bilayers. How to calculate partition coefficients from these profiles is discussed in detail and different definitions of partition coefficients are compared. Importantly, it is shown that the calculated coefficients are in quantitative agreement with experimental results. Furthermore, we compare free energy profiles from MD simulations to profiles obtained by the recent method COSMOmic, which is an extension of the conductor-like screening model for realistic solvation to micelles and biomembranes. The free energy profiles from these molecular methods are in good agreement. Additionally, solute orientations calculated with MD and COSMOmic are compared and again a good agreement is found. Four different solutes are investigated in detail: 4-ethylphenol, propanol, 5-phenylvaleric acid, and dibenz[a,h]anthracene, whereby the latter belongs to the class of polycyclic aromatic hydrocarbons. The convergence of the free energy profiles from biased MD simulations is discussed and the results are shown to be comparable to equilibrium MD simulations. For 5-phenylvaleric acid the influence of the carboxyl group dihedral angle on free energy profiles is analyzed with MD simulations.

  16. Predicting solute partitioning in lipid bilayers: Free energies and partition coefficients from molecular dynamics simulations and COSMOmic

    International Nuclear Information System (INIS)

    Jakobtorweihen, S.; Ingram, T.; Gerlach, T.; Smirnova, I.; Zuniga, A. Chaides; Keil, F. J.

    2014-01-01

    Quantitative predictions of biomembrane/water partition coefficients are important, as they are a key property in pharmaceutical applications and toxicological studies. Molecular dynamics (MD) simulations are used to calculate free energy profiles for different solutes in lipid bilayers. How to calculate partition coefficients from these profiles is discussed in detail and different definitions of partition coefficients are compared. Importantly, it is shown that the calculated coefficients are in quantitative agreement with experimental results. Furthermore, we compare free energy profiles from MD simulations to profiles obtained by the recent method COSMOmic, which is an extension of the conductor-like screening model for realistic solvation to micelles and biomembranes. The free energy profiles from these molecular methods are in good agreement. Additionally, solute orientations calculated with MD and COSMOmic are compared and again a good agreement is found. Four different solutes are investigated in detail: 4-ethylphenol, propanol, 5-phenylvaleric acid, and dibenz[a,h]anthracene, whereby the latter belongs to the class of polycyclic aromatic hydrocarbons. The convergence of the free energy profiles from biased MD simulations is discussed and the results are shown to be comparable to equilibrium MD simulations. For 5-phenylvaleric acid the influence of the carboxyl group dihedral angle on free energy profiles is analyzed with MD simulations

  17. Assessment of Partitioning Processes for Transmutation of Actinides

    International Nuclear Information System (INIS)

    2010-04-01

    To obtain public acceptance of future nuclear fuel cycle technology, new and innovative concepts must overcome the present concerns with respect to both environmental compliance and proliferation of fissile materials. Both these concerns can be addressed through the multiple recycling of all transuranic elements (TRUs) in fast neutron reactor. This is only possible through a process known as partitioning and transmutation scheme (P and T) as this scheme is expected to reduce the long term radio-toxicity as well as the radiogenic heat production of the nuclear waste. Proliferation resistance of separated plutonium could further be enhanced by mixing with self-generated minor actinides. In addition, P and T scheme is expected to extend the nuclear fuel resources on earth about 100 times because of the recycle and reuse of fissile actinides. Several Member States are actively pursuing the research in the field of P and T and consequently several IAEA publications have addressed this topic. The present coordinated research project (CRP) focuses on the potentials in minimizing the residual TRU inventories of the discharged nuclear waste and in enhancing the proliferation resistance of the future civil nuclear fuel cycle. Partitioning approaches can be grouped into aqueous- (hydrometallurgical) and pyroprocesses. Several aqueous processes based on sequential separation of actinides from spent nuclear fuel have been developed and tested at pilot plant scale. In view of the proliferation resistance of the intermediate and final products of a P and T scheme, a group separation of all actinides together is preferable. The present CRP has gathered experts from different organisations and institutes actively involved in developing P and T scheme as mentioned in the list of contributors and also taken into consideration the studies underway in France and the UK. The scientific objectives of the CRP are: To minimize the environmental impact of actinides in the waste stream; To

  18. 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)

  19. 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.

  20. Screening of pesticides for environmental partitioning tendency.

    Science.gov (United States)

    Gramatica, Paola; Di Guardo, Antonio

    2002-06-01

    The partitioning tendency of chemicals, in this study pesticides in particular, into different environmental compartments depends mainly on the concurrent relevance of the physico-chemical properties of the chemical itself. To rank the pesticides according to their distribution tendencies in the different environmental compartments we propose a multivariate approach: the combination, by principal component analysis, of those physico-chemical properties like organic carbon partition coefficient (Koc), n-octanol/water partition coefficient (Kow), water solubility (Sw), vapour pressure and Henry's law constant (H) that are more relevant to the determination of environmental partitioning. The resultant macrovariables, the PC1 and PC2 scores here named leaching index (LIN) and volatality index (VIN), are proposed as preliminary environmental partitioning indexes in different media. These two indexes are modeled by theoretical molecular descriptors with satisfactory predictive power. Such an approach allows a rapid pre-determination and screening of the environmental distribution of pesticides starting only from the molecular structure of the pesticide, without any a priori knowledge of the physico-chemical properties.

  1. 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.

  2. Working Memory: A Cognitive Limit to Non-Human Primate Recursive Thinking Prior to Hominid Evolution

    Directory of Open Access Journals (Sweden)

    Dwight W. Read

    2008-10-01

    Full Text Available In this paper I explore the possibility that recursion is not part of the cognitive repertoire of non-human primates such as chimpanzees due to limited working memory capacity. Multiple lines of data, from nut cracking to the velocity and duration of cognitive development, imply that chimpanzees have a short-term memory size that limits working memory to dealing with two, or at most three, concepts at a time. If so, as a species they lack the cognitive capacity for recursive thinking to be integrated into systems of social organization and communication. If this limited working memory capacity is projected back to a common ancestor for Pan and Homo, it follows that early hominid ancestors would have had limited working memory capacity. Hence we should find evidence for expansion of working memory capacity during hominid evolution reflected in changes in the products of conceptually framed activities such as stone tool production. Data on the artifacts made by our hominid ancestors support this expansion hypothesis for hominid working memory, thereby leading to qualitative differences between Pan and Homo.

  3. Exploring biological relationships between calving traits in primiparous cattle with a Bayesian recursive model.

    Science.gov (United States)

    de Maturana, Evangelina López; Wu, Xiao-Lin; Gianola, Daniel; Weigel, Kent A; Rosa, Guilherme J M

    2009-01-01

    Structural equation models (SEMs) of a recursive type with heterogeneous structural coefficients were used to explore biological relationships between gestation length (GL), calving difficulty (CD), and perinatal mortality, also known as stillbirth (SB), in cattle, with the last two traits having categorical expression. An acyclic model was assumed, where recursive effects existed from the GL phenotype to the liabilities (latent variables) to CD and SB and from the liability to CD to that of SB considering four periods regarding GL. The data contained GL, CD, and SB records from 90,393 primiparous cows, sired by 1122 bulls, distributed over 935 herd-calving year classes. Low genetic correlations between GL and the other calving traits were found, whereas the liabilities to CD and SB were high and positively correlated, genetically. The model indicated that gestations of approximately 274 days of length (3 days shorter than the average) would lead to the lowest CD and SB and confirmed the existence of an intermediate optimum of GL with respect to these traits.

  4. On Extended RLS Lattice Adaptive Variants: Error-Feedback, Normalized, and Array-Based Recursions

    Directory of Open Access Journals (Sweden)

    Ricardo Merched

    2005-05-01

    Full Text Available Error-feedback, normalized, and array-based recursions represent equivalent RLS lattice adaptive filters which are known to offer better numerical properties under finite-precision implementations. This is the case when the underlying data structure arises from a tapped-delay-line model for the input signal. On the other hand, in the context of a more general orthonormality-based input model, these variants have not yet been derived and their behavior under finite precision is unknown. This paper develops several lattice structures for the exponentially weighted RLS problem under orthonormality-based data structures, including error-feedback, normalized, and array-based forms. As a result, besides nonminimality of the new recursions, they present unstable modes as well as hyperbolic rotations, so that the well-known good numerical properties observed in the case of FIR models no longer exist. We verify via simulations that, compared to the standard extended lattice equations, these variants do not improve the robustness to quantization, unlike what is normally expected for FIR models.

  5. 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

  6. Recursive directional ligation by plasmid reconstruction allows rapid and seamless cloning of oligomeric genes.

    Science.gov (United States)

    McDaniel, Jonathan R; Mackay, J Andrew; Quiroz, Felipe García; Chilkoti, Ashutosh

    2010-04-12

    This paper reports a new strategy, recursive directional ligation by plasmid reconstruction (PRe-RDL), to rapidly clone highly repetitive polypeptides of any sequence and specified length over a large range of molecular weights. In a single cycle of PRe-RDL, two halves of a parent plasmid, each containing a copy of an oligomer, are ligated together, thereby dimerizing the oligomer and reconstituting a functional plasmid. This process is carried out recursively to assemble an oligomeric gene with the desired number of repeats. PRe-RDL has several unique features that stem from the use of type IIs restriction endonucleases: first, PRe-RDL is a seamless cloning method that leaves no extraneous nucleotides at the ligation junction. Because it uses type IIs endonucleases to ligate the two halves of the plasmid, PRe-RDL also addresses the major limitation of RDL in that it abolishes any restriction on the gene sequence that can be oligomerized. The reconstitution of a functional plasmid only upon successful ligation in PRe-RDL also addresses two other limitations of RDL: the significant background from self-ligation of the vector observed in RDL, and the decreased efficiency of ligation due to nonproductive circularization of the insert. PRe-RDL can also be used to assemble genes that encode different sequences in a predetermined order to encode block copolymers or append leader and trailer peptide sequences to the oligomerized gene.

  7. 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.

  8. Phase Response Design of Recursive All-Pass Digital Filters Using a Modified PSO Algorithm.

    Science.gov (United States)

    Chang, Wei-Der

    2015-01-01

    This paper develops a new design scheme for the phase response of an all-pass recursive digital filter. A variant of particle swarm optimization (PSO) algorithm will be utilized for solving this kind of filter design problem. It is here called the modified PSO (MPSO) algorithm in which another adjusting factor is more introduced in the velocity updating formula of the algorithm in order to improve the searching ability. In the proposed method, all of the designed filter coefficients are firstly collected to be a parameter vector and this vector is regarded as a particle of the algorithm. The MPSO with a modified velocity formula will force all particles into moving toward the optimal or near optimal solution by minimizing some defined objective function of the optimization problem. To show the effectiveness of the proposed method, two different kinds of linear phase response design examples are illustrated and the general PSO algorithm is compared as well. The obtained results show that the MPSO is superior to the general PSO for the phase response design of digital recursive all-pass filter.

  9. 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)

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

    DEFF Research Database (Denmark)

    Vikner, Sten

    2017-01-01

    This paper will give an overview of the verb second (V2) phenomenon, as found in both main and embedded clauses in Germanic, and it will also explore a particular derivation of (embedded) V2, in terms of a cP/CP-distinction. All the Germanic languages except modern English (but including e. g. Old......, 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...

  11. 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.

  12. The understanding of the students about the nature of light in recursive curriculum

    Directory of Open Access Journals (Sweden)

    Geide Rosa Coelho

    2010-01-01

    Full Text Available We report an inquiry on the development of students' understanding about the nature of light. The study happened in a learning environment with a recursive and spiral Physics syllabus. We investigated the change in students' understanding about the nature of light during their 3rd year in High School, and the level of understanding about this subject achieved by students at the end of this year. To assess the students' understanding, we developed an open questionnaire form and a set of hierarchical categories, consisting of five different models about the nature of light. The questionnaire was used to access the students´ understanding at the beginning and at the end of the third level of the recursive curriculum. The results showed that students have a high level of prior knowledge, and also that the Physics learning they experienced had enhanced their understanding, despite the effects are not verified in all the Physics classes. By the end of the third year, most of the students explain the nature of light using or a corpuscular electromagnetic model or a dual electromagnetic model, but some students use these models with inconsistencies in their explanations.

  13. 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.

  14. 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.

  15. Hierarchical Recursive Organization and the Free Energy Principle: From Biological Self-Organization to the Psychoanalytic Mind

    Science.gov (United States)

    Connolly, Patrick; van Deventer, Vasi

    2017-01-01

    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 underscores the

  16. Partitioning of selected antioxidants in mayonnaise

    DEFF Research Database (Denmark)

    Jacobsen, Charlotte; Schwarz, K.; Stockmann, H.

    1999-01-01

    This study examined partitioning of alpha-, beta-, and gamma- tocopherol and six polar antioxidants (Trolox, ferulic acid, caffeic acid, propyl gallate, gallic acid, and catechin) in mayonnaise. Partitioning of antioxidants between different phases was determined after separation of mayonnaise...... acid and catechin) to 83% (Trolox). Accordingly, proportions of 6% (Trolox) to 80% (gallic acid and catechin) were found in the aqueous phase. Similar trends were observed after dialysis. After ultracentrifugation, large proportions of polar antioxidants were found in the "emulsion phase...... by either (a) centrifugation + ultracentrifugation or (b) centrifugation + dialysis. Antioxidants partitioned in accordance with their chemical structure and polarity: Tocopherols were concentrated in the oil phase (93-96%), while the proportion of polar antioxidants in the oil phase ranged from 0% (gallic...

  17. 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.

  18. 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.

  19. Consistent Estimation of Partition Markov Models

    Directory of Open Access Journals (Sweden)

    Jesús E. García

    2017-04-01

    Full Text Available The Partition Markov Model characterizes the process by a partition L of the state space, where the elements in each part of L share the same transition probability to an arbitrary element in the alphabet. This model aims to answer the following questions: what is the minimal number of parameters needed to specify a Markov chain and how to estimate these parameters. In order to answer these questions, we build a consistent strategy for model selection which consist of: giving a size n realization of the process, finding a model within the Partition Markov class, with a minimal number of parts to represent the process law. From the strategy, we derive a measure that establishes a metric in the state space. In addition, we show that if the law of the process is Markovian, then, eventually, when n goes to infinity, L will be retrieved. We show an application to model internet navigation patterns.

  20. Shift versus Extension in Refined Partition Functions

    CERN Document Server

    Krefl, Daniel

    2010-01-01

    We have recently shown that the global behavior of the partition function of N=2 gauge theory in the general Omega-background is captured by special geometry in the guise of the (extended) holomorphic anomaly equation. We here analyze the fate of our results under the shift of the mass parameters of the gauge theory. The preferred value of the shift, noted previously in other contexts, restores the Z_2 symmetry of the instanton partition function under inversion of the Omega-background, and removes the extension. We comment on various connections.

  1. Partition functions for supersymmetric black holes

    CERN Document Server

    Manschot, Jan

    2008-01-01

    This dissertation presents recent discoveries on partition functions for four-dimensional supersymmetric black holes. These partition functions are important tools to explain the entropy of black holes from a microscopic point of view within string theory and M-theory. The results are applied to two central research topics in modern theoretical physics, namely (1) the correspondence between the physics (including gravity) within an Anti-de Sitter space and conformal field theory, and (2) the relation between black holes and topological strings.

  2. Metaheuristic ILS with path relinking for the number partitioning problem

    Directory of Open Access Journals (Sweden)

    Cesar Augusto Souza de Oliveira

    2017-07-01

    Full Text Available This study brings an implementation of a metaheuristic procedure to solve the Number Partitioning Problem (NPP, which is a classic NP-hard combinatorial optimization problem. The presented problem has applications in different areas, such as: logistics, production and operations management, besides important relationships with other combinatorial problems. This paper aims to perform a comparative analysis between the proposed algorithm with others metaheuristics using a group of instances available on the literature. Implementations of constructive heuristics, local search and metaheuristics ILS with path relinking as mechanism of intensification and diversification were made in order to improve solutions, surpassing the others algorithms.

  3. Reconstructive surgery after jejunoileal bypass or gastric partition operations.

    Science.gov (United States)

    Bingham, H G

    1982-05-01

    Twenty-five morbidly obese patients had plastic operations to remove redundant tissue after either jejunoileal bypass or gastric partition. The average weight loss in this group of patients was 79.9 kg (176 lb) and the average age was 32 years. Abdominoplasty was the most common operation, and, although there was no mortality, postoperative complications were common and usually related to wound healing. The average hospital stay was ten days. Most of these patients were pleased with their results and lived happier and more productive lives.

  4. Finding Risk Groups by Optimizing Artificial Neural Networks on the Area under the Survival Curve Using Genetic Algorithms.

    Directory of Open Access Journals (Sweden)

    Jonas Kalderstam

    Full Text Available We investigate a new method to place patients into risk groups in censored survival data. Properties such as median survival time, and end survival rate, are implicitly improved by optimizing the area under the survival curve. Artificial neural networks (ANN are trained to either maximize or minimize this area using a genetic algorithm, and combined into an ensemble to predict one of low, intermediate, or high risk groups. Estimated patient risk can influence treatment choices, and is important for study stratification. A common approach is to sort the patients according to a prognostic index and then group them along the quartile limits. The Cox proportional hazards model (Cox is one example of this approach. Another method of doing risk grouping is recursive partitioning (Rpart, which constructs a decision tree where each branch point maximizes the statistical separation between the groups. ANN, Cox, and Rpart are compared on five publicly available data sets with varying properties. Cross-validation, as well as separate test sets, are used to validate the models. Results on the test sets show comparable performance, except for the smallest data set where Rpart's predicted risk groups turn out to be inverted, an example of crossing survival curves. Cross-validation shows that all three models exhibit crossing of some survival curves on this small data set but that the ANN model manages the best separation of groups in terms of median survival time before such crossings. The conclusion is that optimizing the area under the survival curve is a viable approach to identify risk groups. Training ANNs to optimize this area combines two key strengths from both prognostic indices and Rpart. First, a desired minimum group size can be specified, as for a prognostic index. Second, the ability to utilize non-linear effects among the covariates, which Rpart is also able to do.

  5. 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

  6. [Herb-partitioned moxibustion on navel for anovulatory infertility:a randomized controlled trial].

    Science.gov (United States)

    Li, Zhaofeng; Wang, Hui; Hao, Mingyao; Wang, Xuan; Yu, Yanpu; Ma, Yuxia

    2017-08-12

    To observe the efficacy differences between herb-partitioned moxibustion on navel and clomiphene for anovulatory infertility. With double-blind double-dummy randomized control method, a total of 40 patients with anovulatory infertility were randomly divided into a moxibustion group and a clomiphene group, 20 cases in each one. Blinding was conducted on both patients and doctors. The patients in the moxibustion group were treated with herb-partitioned moxibustion on navel and oral administration of clomiphene placebo, while the patients in the clomiphene group were treated with placebo-partitioned moxibustion on navel and oral administration of clomiphene. The herb-partitioned moxibustion and placebo-partitioned moxibustion were given at the end of menstruation, 1.5 hours per treatment, once a week, and no treatment was given during menstruation. The oral administration of clomiphene and clomiphene placebo were given from 5 days into menstruation, 50 mg, once a day, for consecutive 5 days. One menstrual cycle was taken as one treatment course, and 3 treatment courses were conducted. After 3 treatment courses, the endometrial thickness (ET), maximum follicular diameter (MFD), ovulation rate (OR) and effective rate (ER) were evaluated between the two groups. (1) Compared before treatment, ET was significantly increased after treatment in the two groups (both P 0.05); the MFD in the moxibustion group was higher than that in the clomiphene group ( P 0.05). (4) The total ER in the moxibustion group was 95.0% (19/20), which was superior to 70.0% (14/20) in the clomiphene group ( P navel on anovulatory infertility was superior to that of clomiphene, but their effects on OR was similar.

  7. Analysis of polyethoxylated surfactants in microemulsion-oil-water systems III. Fractionation and partitioning of polyethoxylated alcohol surfactants

    International Nuclear Information System (INIS)

    Marquez, N.; Bravo, B.; Ysambertt, F.; Chavez, G.; Subero, N.; Salager, J.L.

    2002-01-01

    Oligomer distribution of polyethoxylated alcohol and polyethoxylated nonylphenol surfactants is studied by normal and reverse-phase high performance liquid chromatography (HPLC). A RP8 column is able to efficiently separate these surfactants according to their alkyl chain (lipophilic) group, while silica and amino columns separate them according to their polyether chain length (hydrophilic group). Polyethoxylated alcohol and polyethoxylated nonylphenol oligomers selectively partition between the microemulsion-oil-water phases of a Winsor III system. Partitioning of these oligomers was analyzed by HPLC with RI detection. The logarithm of the partition coefficient between the water and oil linearly increases with the number of ethylene oxide groups per molecule of oligomer. For a same ethoxylation degree, the partition coefficient of a polyethoxylated tridecanol is found to be higher than the one of the corresponding nonylphenol specie. On the other hand, a polyethoxylated nonylphenol exhibits a higher solubilization than the matching polyethoxylated alcohol

  8. Protium, an infrastructure for partitioned applications

    NARCIS (Netherlands)

    Mullender, Sape J.; Young, C.; Szymanski, T.; Reppy, J.; Presotto, D.; Pike, R.; Narlikar, G.

    Remote access feels different from local access. The major issues are consistency (machines vary in GUIs, applications, and devices) and responsiveness (the user must wait for network and server delays). Protium attacks these by partitioning programs into local viewers that connect to remote

  9. Integral complete r-partite graphs

    NARCIS (Netherlands)

    Wang, Ligong; Li, Xueliang; Hoede, C.

    2004-01-01

    A graph is called integral if all the eigenvalues of its adjacency matrix are integers. In this paper, we give a useful sufficient and necessary condition for complete r-partite graphs to be integral, from which we can construct infinite many new classes of such integral graphs. It is proved that

  10. Zr partitioning and kinetics and mechanism

    Science.gov (United States)

    Taylor, L. A.

    1973-01-01

    The results of investigations concerning the cooling histories of lunar rocks are reported. Publications resulting from this research are listed. Studies discussed include the partitioning of Zr between FeTi03 and Fe2Ti04 in the presence of Fe + Zr02, and ulvospinel reduction.

  11. Actinide and fission product partitioning and transmutation

    Energy Technology Data Exchange (ETDEWEB)

    NONE

    1995-07-01

    The third international information exchange meeting on actinide and fission product partitioning and transmutation, took place in Cadarache France, on 12-14 December 1994. The proceedings are presented in six sessions : an introduction session, the major programmes and international cooperation, the systems studies, the reactors fuels and targets, the chemistry and a last discussions session. (A.L.B.)

  12. A review of approaches for evapotranspiration partitioning

    Science.gov (United States)

    Partitioning of evapotranspiration (ET) into evaporation from the soil surface (E) and transpiration (T) is challenging but important in order to assess biomass production and the allocation of increasingly scarce water resources. Generally T is the desired component with the water being used to enh...

  13. Thirring model partition functions and harmonic differentials

    Science.gov (United States)

    Freedman, D. Z.; Pilch, K.

    1988-10-01

    The partition function of the Thirring model on a Riemann surface is calculated using the representation of the model as a fermion interacting with an auxiliary vector potential. The Hodge decomposition of the potential is used and the integral over the harmonic forms is shown to reproduce exactly the soliton sum in the bosonic version of the theory.

  14. Domain wall partition functions and KP

    International Nuclear Information System (INIS)

    Foda, O; Wheeler, M; Zuparic, M

    2009-01-01

    We observe that the partition function of the six-vertex model on a finite square lattice with domain wall boundary conditions is (a restriction of) a KP τ function and express it as an expectation value of charged free fermions (up to an overall normalization)

  15. Actinide and fission product partitioning and transmutation

    International Nuclear Information System (INIS)

    1995-01-01

    The third international information exchange meeting on actinide and fission product partitioning and transmutation, took place in Cadarache France, on 12-14 December 1994. The proceedings are presented in six sessions : an introduction session, the major programmes and international cooperation, the systems studies, the reactors fuels and targets, the chemistry and a last discussions session. (A.L.B.)

  16. Canonical Partitions in the Restricted Linear Model

    NARCIS (Netherlands)

    van der Genugten, B.B.

    1997-01-01

    In the linear model y = X + " under the restriction C = 0 a canonical partition C = [C0;C1] of the rows of C admits a simple representation of linear subspaces of values = X . Its use is shown for the identification, estimating and testing of linear combinations DB. Results are derived without

  17. Minimum convex partitions and maximum empty polytopes

    Directory of Open Access Journals (Sweden)

    Adrian Dumitrescu

    2014-05-01

    Full Text Available Let S be a set of n points in Rd. A Steiner convex partition is a tiling of conv(S with empty convex bodies. For every integer d, we show that S admits a Steiner convex partition with at most ⌈(n-1/d⌉ tiles. This bound is the best possible for points in general position in the plane, and it is the best possible apart from constant factors in every fixed dimension d≥3. We also give the first constant-factor approximation algorithm for computing a minimum Steiner convex partition of a planar point set in general position.Establishing a tight lower bound for the maximum volume of a tile in a Steiner convex partition of any n points in the unit cube is equivalent to a famous problem of Danzer and Rogers. It is conjectured that the volume of the largest tile is ω(1/n. Here we give a (1-\\epsilon-approximation algorithm for computing the maximum volume of an empty convex body amidst n given points in the d-dimensional unit box [0,1]d.

  18. Empirical Bayes Approaches to Multivariate Fuzzy Partitions.

    Science.gov (United States)

    Woodbury, Max A.; Manton, Kenneth G.

    1991-01-01

    An empirical Bayes-maximum likelihood estimation procedure is presented for the application of fuzzy partition models in describing high dimensional discrete response data. The model describes individuals in terms of partial membership in multiple latent categories that represent bounded discrete spaces. (SLD)

  19. Set Partitions and the Multiplication Principle

    Science.gov (United States)

    Lockwood, Elise; Caughman, John S., IV

    2016-01-01

    To further understand student thinking in the context of combinatorial enumeration, we examine student work on a problem involving set partitions. In this context, we note some key features of the multiplication principle that were often not attended to by students. We also share a productive way of thinking that emerged for several students who…

  20. Solute partitioning and filtration by extracellular matrices

    Science.gov (United States)

    Hofmann, Christina L.; Ferrell, Nicholas; Schnell, Lisa; Dubnisheva, Anna; Zydney, Andrew L.; Yurchenco, Peter D.; Roy, Shuvo

    2009-01-01

    The physiology of glomerular filtration remains mechanistically obscure despite its importance in disease. The correspondence between proteinuria and foot process effacement suggests podocytes as the locus of the filtration barrier. If so, retained macromolecules ought to accumulate at the filtration barrier, an effect called concentration polarization. Literature data indicate macromolecule concentrations decrease from subendothelial to subepithelial glomerular basement membrane (GBM), as would be expected if the GBM were itself the filter. The objective of this study was to obtain insights into the possible role of the GBM in protein retention by performing fundamental experimental and theoretical studies on the properties of three model gels. Solute partitioning and filtration through thin gels of a commercially available laminin-rich extracellular matrix, Matrigel, were measured using a polydisperse polysaccharide tracer molecule, Ficoll 70. Solute partitioning into laminin gels and lens basement membrane (LBM) were measured using Ficoll 70. A novel model of a laminin gel was numerically simulated, as well as a mixed structure-random-fiber model for LBM. Experimental partitioning was predicted by numerical simulations. Sieving coefficients through thin gels of Matrigel were size dependent and strongly flux dependent. The observed flux dependence arose from compression of the gel in response to the applied pressure. Gel compression may alter solute partitioning into extracellular matrix at physiologic pressures present in the glomerular capillary. This suggests a physical mechanism coupling podocyte structure to permeability characteristics of the GBM. PMID:19587146

  1. Depth-recursive tomography of the Bohemian Massif at the CEL09 transect—Part B: Interpretation

    Czech Academy of Sciences Publication Activity Database

    Novotný, Miroslav

    2012-01-01

    Roč. 33, č. 2 (2012), s. 243-273 ISSN 0169-3298 R&D Projects: GA MŠk LA08036 Institutional research plan: CEZ:AV0Z30120515 Keywords : depth-recursive refraction tomography * Bohemian Massif * CEL09 profile Subject RIV: DC - Siesmology, Volcanology, Earth Structure Impact factor: 4.125, year: 2012

  2. New Modified Adomian Decomposition Recursion Schemes for Solving Certain Types of Nonlinear Fractional Two-Point Boundary Value Problems

    Directory of Open Access Journals (Sweden)

    Sekson Sirisubtawee

    2017-01-01

    Full Text Available We apply new modified recursion schemes obtained by the Adomian decomposition method (ADM to analytically solve specific types of two-point boundary value problems for nonlinear fractional order ordinary and partial differential equations. The new modified recursion schemes, which sometimes utilize the technique of Duan’s convergence parameter, are derived using the Duan-Rach modified ADM. The Duan-Rach modified ADM employs all of the given boundary conditions to compute the remaining unknown constants of integration, which are then embedded in the integral solution form before constructing recursion schemes for the solution components. New modified recursion schemes obtained by the method are generated in order to analytically solve nonlinear fractional order boundary value problems with a variety of two-point boundary conditions such as Robin and separated boundary conditions. Some numerical examples of such problems are demonstrated graphically. In addition, the maximal errors (MEn or the error remainder functions (ERn(x of each problem are calculated.

  3. Use of a Recursive-Rule eXtraction algorithm with J48graft to achieve highly accurate and concise rule extraction from a large breast cancer dataset

    Directory of Open Access Journals (Sweden)

    Yoichi Hayashi

    Full Text Available To assist physicians in the diagnosis of breast cancer and thereby improve survival, a highly accurate computer-aided diagnostic system is necessary. Although various machine learning and data mining approaches have been devised to increase diagnostic accuracy, most current methods are inadequate. The recently developed Recursive-Rule eXtraction (Re-RX algorithm provides a hierarchical, recursive consideration of discrete variables prior to analysis of continuous data, and can generate classification rules that have been trained on the basis of both discrete and continuous attributes. The objective of this study was to extract highly accurate, concise, and interpretable classification rules for diagnosis using the Re-RX algorithm with J48graft, a class for generating a grafted C4.5 decision tree. We used the Wisconsin Breast Cancer Dataset (WBCD. Nine research groups provided 10 kinds of highly accurate concrete classification rules for the WBCD. We compared the accuracy and characteristics of the rule set for the WBCD generated using the Re-RX algorithm with J48graft with five rule sets obtained using 10-fold cross validation (CV. We trained the WBCD using the Re-RX algorithm with J48graft and the average classification accuracies of 10 runs of 10-fold CV for the training and test datasets, the number of extracted rules, and the average number of antecedents for the WBCD. Compared with other rule extraction algorithms, the Re-RX algorithm with J48graft resulted in a lower average number of rules for diagnosing breast cancer, which is a substantial advantage. It also provided the lowest average number of antecedents per rule. These features are expected to greatly aid physicians in making accurate and concise diagnoses for patients with breast cancer. Keywords: Breast cancer diagnosis, Rule extraction, Re-RX algorithm, J48graft, C4.5

  4. European Europart integrated project on actinide partitioning

    International Nuclear Information System (INIS)

    Madic, C.; Hudson, M.J.

    2005-01-01

    This poster presents the objectives of EUROPART, a scientific integrated project between 24 European partners, mostly funded by the European Community within the FP6. EUROPART aims at developing chemical partitioning processes for the so-called minor actinides (MA) contained in nuclear wastes, i.e. from Am to Cf. In the case of dedicated spent fuels or targets, the actinides to be separated also include U, Pu and Np. The techniques considered for the separation of these radionuclides belong to the fields of hydrometallurgy and pyrometallurgy, as in the previous FP5 programs named PARTNEW and PYROREP. The two main axes of research within EUROPART will be: The partitioning of MA (from Am to Cf) from high burn-up UO x fuels and multi-recycled MOx fuels; the partitioning of the whole actinide family for recycling, as an option for advanced dedicated fuel cycles (and in connection with the studies to be performed in the EUROTRANS integrated project). In hydrometallurgy, the research is organised into five Work Packages (WP). Four WP are dedicated to the study of partitioning methods mainly based on the use of solvent extraction methods, one WP is dedicated to the development of actinide co-conversion methods for fuel or target preparation. The research in pyrometallurgy is organized into four WP, listed hereafter: development of actinide partitioning methods, study of the basic chemistry of trans-curium elements in molten salts, study of the conditioning of the wastes, some system studies. Moreover, a strong management team will be concerned not only with the technical and financial issues arising from EUROPART, but also with information, communication and benefits for Europe. Training and education of young researchers will also pertain to the project. EUROPART has also established collaboration with US DOE and Japanese CRIEPI. (authors)

  5. Two dimensional recursive digital filters for near real time image processing

    Science.gov (United States)

    Olson, D.; Sherrod, E.

    1980-01-01

    A program was designed toward the demonstration of the feasibility of using two dimensional recursive digital filters for subjective image processing applications that require rapid turn around. The concept of the use of a dedicated minicomputer for the processor for this application was demonstrated. The minicomputer used was the HP1000 series E with a RTE 2 disc operating system and 32K words of memory. A Grinnel 256 x 512 x 8 bit display system was used to display the images. Sample images were provided by NASA Goddard on a 800 BPI, 9 track tape. Four 512 x 512 images representing 4 spectral regions of the same scene were provided. These images were filtered with enhancement filters developed during this effort.

  6. Design of 2-D Recursive Filters Using Self-adaptive Mutation Differential Evolution Algorithm

    Directory of Open Access Journals (Sweden)

    Lianghong Wu

    2011-08-01

    Full Text Available This paper investigates a novel approach to the design of two-dimensional recursive digital filters using differential evolution (DE algorithm. The design task is reformulated as a constrained minimization problem and is solved by an Self-adaptive Mutation DE algorithm (SAMDE, which adopts an adaptive mutation operator that combines with the advantages of the DE/rand/1/bin strategy and the DE/best/2/bin strategy. As a result, its convergence performance is improved greatly. Numerical experiment results confirm the conclusion. The proposedSAMDE approach is effectively applied to test a numerical example and is compared with previous design methods. The computational experiments show that the SAMDE approach can obtain better results than previous design methods.

  7. Laplacian spectrum of a family of recursive trees and its applications in network coherence

    Science.gov (United States)

    Sun, Weigang; Xuan, Tengfei; Qin, Sen

    2016-06-01

    Many of the topological and dynamical properties of a network are related to its Laplacian spectrum; these properties include network diameter, Kirchhoff index, and mean first-passage time. This paper investigates consensus dynamics in a linear dynamical system with additive stochastic disturbances, which is characterized as network coherence by the Laplacian spectrum. We choose a family of uniform recursive trees as our model, and propose a method to calculate the first- and second-order network coherence. Using the tree structures, we identify a relationship between the Laplacian matrix and Laplacian eigenvalues. We then derive the exact solutions for the reciprocals and square reciprocals of all nonzero Laplacian eigenvalues. We also obtain the scalings of network coherence with network size. The scalings of network coherence of the studied trees are smaller than those of Vicsek fractals and are not related to its fractal dimension.

  8. Filtering Reordering Table Using a Novel Recursive Autoencoder Model for Statistical Machine Translation

    Directory of Open Access Journals (Sweden)

    Jinying Kong

    2017-01-01

    Full Text Available In phrase-based machine translation (PBMT systems, the reordering table and phrase table are very large and redundant. Unlike most previous works which aim to filter phrase table, this paper proposes a novel deep neural network model to prune reordering table. We cast the task as a deep learning problem where we jointly train two models: a generative model to implement rule embedding and a discriminative model to classify rules. The main contribution of this paper is that we optimize the reordering model in PBMT by filtering reordering table using a recursive autoencoder model. To evaluate the performance of the proposed model, we performed it on public corpus to measure its reordering ability. The experimental results show that our approach obtains high improvement in BLEU score with less scale of reordering table on two language pairs: English-Chinese (+0.28 and Uyghur-Chinese (+0.33 MT.

  9. RecRWR: A Recursive Random Walk Method for Improved Identification of Diseases

    Directory of Open Access Journals (Sweden)

    Joel Perdiz Arrais

    2015-01-01

    Full Text Available High-throughput methods such as next-generation sequencing or DNA microarrays lack precision, as they return hundreds of genes for a single disease profile. Several computational methods applied to physical interaction of protein networks have been successfully used in identification of the best disease candidates for each expression profile. An open problem for these methods is the ability to combine and take advantage of the wealth of biomedical data publicly available. We propose an enhanced method to improve selection of the best disease targets for a multilayer biomedical network that integrates PPI data annotated with stable knowledge from OMIM diseases and GO biological processes. We present a comprehensive validation that demonstrates the advantage of the proposed approach, Recursive Random Walk with Restarts (RecRWR. The obtained results outline the superiority of the proposed approach, RecRWR, in identifying disease candidates, especially with high levels of biological noise and benefiting from all data available.

  10. Selecting radial basis function network centers with recursive orthogonal least squares training.

    Science.gov (United States)

    Gomm, J B; Yu, D L

    2000-01-01

    Recursive orthogonal least squares (ROLS) is a numerically robust method for solving for the output layer weights of a radial basis function (RBF) network, and requires less computer memory than the batch alternative. In this paper, the use of ROLS is extended to selecting the centers of an RBF network. It is shown that the information available in an ROLS algorithm after network training can be used to sequentially select centers to minimize the network output error. This provides efficient methods for network reduction to achieve smaller architectures with acceptable accuracy and without retraining. Two selection methods are developed, forward and backward. The methods are illustrated in applications of RBF networks to modeling a nonlinear time series and a real multiinput-multioutput chemical process. The final network models obtained achieve acceptable accuracy with significant reductions in the number of required centers.

  11. Deixis and multiple blends: the role of recursion in meaning construction

    Directory of Open Access Journals (Sweden)

    Lilian Ferrari

    2016-04-01

    Full Text Available Current paper draws on Mental Spaces Theory to analyze first and second person singular pronouns (1PS and 2PS, respectively in British English and Brazilian Portuguese. The analysis is based on attested data obtained from electronic corpora (the British National Corpus for British English and the Portuguese Corpus for Brazilian Portuguese. The main claim is that 1PS and 2PS pronouns are cognitively complex and prompt for elaborate meaning construction. First, it is argued that 1PS and 2PS pronouns conventional meanings (i.e., reference to the speaker and hearer is emergent from simplex conceptual integration networks. Secondly, evidence is brought to the fact that these pronouns also show non-conventional meanings which may rise recursively through multiple blending.

  12. The PLSI Method of Stabilizing Two-Dimensional Nonsymmetric Half-Plane Recursive Digital Filters

    Directory of Open Access Journals (Sweden)

    Gangatharan N

    2003-01-01

    Full Text Available Two-dimensional (2D recursive digital filters find applications in image processing as in medical X-ray processing. Nonsymmetric half-plane (NSHP filters have definitely positive magnitude characteristics as opposed to quarter-plane (QP filters. In this paper, we provide methods for stabilizing the given 2D NSHP polynomial by the planar least squares inverse (PLSI method. We have proved in this paper that if the given 2D unstable NSHP polynomial and its PLSI are of the same degree, the PLSI polynomial is always stable, irrespective of whether the coefficients of the given polynomial have relationship among its coefficients or not. Examples are given for 2D first-order and second-order cases to prove our results. The generalization is done for the th order polynomial.

  13. Packet loss replacement in voip using a recursive low-order autoregressive modelbased speech

    International Nuclear Information System (INIS)

    Miralavi, Seyed Reza; Ghorshi, Seyed; Mortazavi, Mohammad; Choupan, Jeiran

    2011-01-01

    In real-time packet-based communication systems one major problem is misrouted or delayed packets which results in degraded perceived voice quality. When some speech packets are not available on time, the packet is known as lost packet in real-time communication systems. The easiest task of a network terminal receiver is to replace silence for the duration of lost speech segments. In a high quality communication system in order to avoid quality reduction due to packet loss a suitable method and/or algorithm is needed to replace the missing segments of speech. In this paper, we introduce a recursive low order autoregressive (AR) model for replacement of lost speech segment. The evaluation results show that this method has a lower mean square error (MSE) and low complexity compared to the other efficient methods like high-order AR model without any substantial degradation in perceived voice quality.

  14. TouchGrid: Touchpad pointing by recursively mapping taps to smaller display regions

    DEFF Research Database (Denmark)

    Hertzum, Morten; Hornbæk, Kasper

    2005-01-01

    Touchpad devices are widely used but lacking in pointing efficiency. The TouchGrid, an instance of what we term cell cursors, replaces moving the cursor through dragging the finger on a touchpad with tapping in different regions of the touchpad. The touchpad regions are recursively mapped...... to smaller display regions and thereby enable high-precision pointing without requiring high tapping precision. In an experiment, six subjects used the TouchGrid and a standard touchpad across different numbers of targets, distances to targets, and target widths. Whereas standard touchpad operation follows...... Fitts’ law, target selection time with the TouchGrid is a linear function of the required number of taps. The TouchGrid was significantly faster for small targets and for tasks requiring one tap, and marginally faster for two-tap tasks. Error rates tended to be higher with the TouchGrid than...

  15. 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

    In medical ultrasound the blood velocity distribution in a vessel can be found by emitting a pulsed field into the patient. The field is then scattered by the tissues and the red blood cells, and a single complex sample set is acquired at the depth of interest for each pulse emitted. The signals...... 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......-squares lattice filter is used for finding a parametric model for the velocity distribution. A new set of complex coefficients is calculated for each point in time, and it is thus possible to track the non-stationary properties of the stochastic velocity signal. The dynamic characteristics of the non...

  16. Real-Time Blood Flow Estimation Using a Recursive Least-Squares Lattice Filter

    DEFF Research Database (Denmark)

    Stetson, Paul F.; Jensen, Jørgen Arendt

    1997-01-01

    Ultrasonic flow estimation involves Fourier-transforming data from successive pulses. The standard periodogram spectral estimate does not reflect the true velocity distribution in the blood and assumes quasi-stationarity in the data. Last year (see J.A. Jensen et al., IEEE Ultrasonics Symposium...... Proceedings, p. 1221-4, 1996), the authors demonstrated that a recursive lattice filter can yield results much closer to the correct velocity distribution. They have now implemented it in real time on a system with sixteen ADSP-21060 processors, interfaced to a commercial scanner. The system can perform real......-time processing for both the periodogram and lattice-filter approaches and displays both results on a PC for comparison. Results are shown for phantom data and for demodulated data from the aorta and hepatic vein of a healthy subject. This demonstrates under clinical conditions that the lattice filter gives...

  17. Recursive N-way partial least squares for brain-computer interface.

    Directory of Open Access Journals (Sweden)

    Andrey Eliseyev

    Full Text Available In the article tensor-input/tensor-output blockwise Recursive N-way Partial Least Squares (RNPLS regression is considered. It combines the multi-way tensors decomposition with a consecutive calculation scheme and allows blockwise treatment of tensor data arrays with huge dimensions, as well as the adaptive modeling of time-dependent processes with tensor variables. In the article the numerical study of the algorithm is undertaken. The RNPLS algorithm demonstrates fast and stable convergence of regression coefficients. Applied to Brain Computer Interface system calibration, the algorithm provides an efficient adjustment of the decoding model. Combining the online adaptation with easy interpretation of results, the method can be effectively applied in a variety of multi-modal neural activity flow modeling tasks.

  18. A self-consistent TB-LMTO-augmented space recursion method for disordered binary alloys

    Science.gov (United States)

    Chakrabarti, A.; Mookerjee, A.

    2005-03-01

    We developed a complete self-consistent TB-LMTO-Augmented space recursion (ASR) method for calculating configurational average properties of substitutionally disordered binary alloys. We applied our method to fcc based Cu-Ni, Ag-Pd for different concentrations of constituent elements and body-centered cubic based ferromagnetic Fe-V (50-50) alloy. For this systems we investigated the convergence of total energy and l-dependent potential parameters, charges, magnetic moment, energy moments of density of states with the number of iterations. Our results show good agreement with the existing calculations and also with the experimental results where it is available. The Madelung energy correction due to the charge transfer has also been included by the method developed by Ruban et al.

  19. Variable forgetting factor mechanisms for diffusion recursive least squares algorithm in sensor networks

    Science.gov (United States)

    Zhang, Ling; Cai, Yunlong; Li, Chunguang; de Lamare, Rodrigo C.

    2017-12-01

    In this work, we present low-complexity variable forgetting factor (VFF) techniques for diffusion recursive least squares (DRLS) algorithms. Particularly, we propose low-complexity VFF-DRLS algorithms for distributed parameter and spectrum estimation in sensor networks. For the proposed algorithms, they can adjust the forgetting factor automatically according to the posteriori error signal. We develop detailed analyses in terms of mean and mean square performance for the proposed algorithms and derive mathematical expressions for the mean square deviation (MSD) and the excess mean square error (EMSE). The simulation results show that the proposed low-complexity VFF-DRLS algorithms achieve superior performance to the existing DRLS algorithm with fixed forgetting factor when applied to scenarios of distributed parameter and spectrum estimation. Besides, the simulation results also demonstrate a good match for our proposed analytical expressions.

  20. A Comparison of Evolutionary Algorithms for Tracking Time-Varying Recursive Systems

    Directory of Open Access Journals (Sweden)

    White Michael S

    2003-01-01

    Full Text Available A comparison is made of the behaviour of some evolutionary algorithms in time-varying adaptive recursive filter systems. Simulations show that an algorithm including random immigrants outperforms a more conventional algorithm using the breeder genetic algorithm as the mutation operator when the time variation is discontinuous, but neither algorithm performs well when the time variation is rapid but smooth. To meet this deficit, a new hybrid algorithm which uses a hill climber as an additional genetic operator, applied for several steps at each generation, is introduced. A comparison is made of the effect of applying the hill climbing operator a few times to all members of the population or a larger number of times solely to the best individual; it is found that applying to the whole population yields the better results, substantially improved compared with those obtained using earlier methods.