956 resultados para Exhaustive Enumeration
Resumo:
This work addresses the question of whether it is possible to define simple pairwise interaction terms to approximate free energies of proteins or polymers. Rather than ask how reliable a potential of mean force is, one can ask how reliable it could possibly be. In a two-dimensional, infinite lattice model system one can calculate exact free energies by exhaustive enumeration. A series of approximations were fitted to exact results to assess the feasibility and utility of pairwise free energy terms. Approximating the true free energy with pairwise interactions gives a poor fit with little transferability between systems of different size. Adding extra artificial terms to the approximation yields better fits, but does not improve the ability to generalize from one system size to another. Furthermore, one cannot distinguish folding from nonfolding sequences via the approximated free energies. Most usefully, the methodology shows how one can assess the utility of various terms in lattice protein/polymer models. (C) 2001 American Institute of Physics.
Resumo:
This thesis presents the ideas underlying a computer program that takes as input a schematic of a mechanical or hydraulic power transmission system, plus specifications and a utility function, and returns catalog numbers from predefined catalogs for the optimal selection of components implementing the design. Unlike programs for designing single components or systems, the program provides the designer with a high level "language" in which to compose new designs. It then performs some of the detailed design process. The process of "compilation" is based on a formalization of quantitative inferences about hierarchically organized sets of artifacts and operating conditions. This allows the design compilation without the exhaustive enumeration of alternatives.
Resumo:
I introduce the new mgof command to compute distributional tests for discrete (categorical, multinomial) variables. The command supports largesample tests for complex survey designs and exact tests for small samples as well as classic large-sample x2-approximation tests based on Pearson’s X2, the likelihood ratio, or any other statistic from the power-divergence family (Cressie and Read, 1984, Journal of the Royal Statistical Society, Series B (Methodological) 46: 440–464). The complex survey correction is based on the approach by Rao and Scott (1981, Journal of the American Statistical Association 76: 221–230) and parallels the survey design correction used for independence tests in svy: tabulate. mgof computes the exact tests by using Monte Carlo methods or exhaustive enumeration. mgof also provides an exact one-sample Kolmogorov–Smirnov test for discrete data.
Resumo:
mgof computes goodness-of-fit tests for the distribution of a discrete (categorical, multinomial) variable. The default is to perform classical large sample chi-squared approximation tests based on Pearson's X2 statistic and the log likelihood ratio (G2) statistic or a statistic from the Cressie-Read family. Alternatively, mgof computes exact tests using Monte Carlo methods or exhaustive enumeration. A Kolmogorov-Smirnov test for discrete data is also provided. The moremata package, also available from SSC, is required.
Resumo:
A new Stata command called -mgof- is introduced. The command is used to compute distributional tests for discrete (categorical, multinomial) variables. Apart from classic large sample $\chi^2$-approximation tests based on Pearson's $X^2$, the likelihood ratio, or any other statistic from the power-divergence family (Cressie and Read 1984), large sample tests for complex survey designs and exact tests for small samples are supported. The complex survey correction is based on the approach by Rao and Scott (1981) and parallels the survey design correction used for independence tests in -svy:tabulate-. The exact tests are computed using Monte Carlo methods or exhaustive enumeration. An exact Kolmogorov-Smirnov test for discrete data is also provided.
Resumo:
ACM Computing Classification System (1998): G.2, G.4.
Resumo:
The aim of this study was to evaluate the effect of oat bran supplementation on time to exhaustion, glycogen stores and cytokines in rats submitted to training. The animals were divided into 3 groups: sedentary control group (C), an exercise group that received a control chow (EX) and an exercise group that received a chow supplemented with oat bran (EX-O). Exercised groups were submitted to an eight weeks swimming training protocol. In the last training session, the animals performed exercise to exhaustion, (e.g. incapable to continue the exercise). After the euthanasia of the animals, blood, muscle and hepatic tissue were collected. Plasma cytokines and corticosterone were evaluated. Glycogen concentrations was measured in the soleus and gastrocnemius muscles, and liver. Glycogen synthetase-alpha gene expression was evaluated in the soleus muscle. Statistical analysis was performed using a factorial ANOVA. Time to exhaustion of the EX-O group was 20% higher (515 +/- 3 minutes) when compared with EX group (425 +/- 3 minutes) (p = 0.034). For hepatic glycogen, the EX-O group had a 67% higher concentrations when compared with EX (p = 0.022). In the soleus muscle, EX-O group presented a 59.4% higher glycogen concentrations when compared with EX group (p = 0.021). TNF-alpha was decreased, IL-6, IL-10 and corticosterone increased after exercise, and EX-O presented lower levels of IL-6, IL-10 and corticosterone levels in comparison with EX group. It was concluded that the chow rich in oat bran increase muscle and hepatic glycogen concentrations. The higher glycogen storage may improve endurance performance during training and competitions, and a lower post-exercise inflammatory response can accelerate recovery.
Resumo:
We simplify the known formula for the asymptotic estimate of the number of deterministic and accessible automata with n states over a k-letter alphabet. The proof relies on the theory of Lagrange inversion applied in the context of generalized binomial series.
Resumo:
The objective of this study was to propose an alternative method (MAOD(ALT)) to estimate the maximal accumulated oxygen deficit (MAOD) using only one supramaximal exhaustive test. Nine participants performed the following tests: (a) a maximal incremental exercise test, (b) six submaximal constant workload tests, and (c) a supramaximal constant workload test. Traditional MAOD was determined by calculating the difference between predicted O(2) demand and accumulated O(2) uptake during the supramaximal test. MAOD(ALT) was established by summing the fast component of excess post-exercise oxygen consumption and the O(2) equivalent for energy provided by blood lactate accumulation, both of which were measured during the supramaximal test. There was no significant difference between MAOD (2.82 +/- 0.45 L) and MAOD(ALT) (2.77 +/- 0.37 L) (p = 0.60). The correlation between MAOD and MAOD(ALT) was also high (r = 0.78; p = 0.014). These data indicate that the MAOD(ALT) can be used to estimate the MAOD.
Resumo:
Objective. - The aim of this study was to propose a new method that allows for the estimation of critical power (CP) from non-exhaustive tests using ratings of perceived exertion (RPE). Methods. - Twenty-two subjects underwent two practice trials for ergometer and Borg 15-point scale familiarization, and adaptation to severe exhaustive exercise. After then, four exercise bouts were performed on different days for the estimation of CP and anaerobic work capacity (AWC) by linear work-time equation, and CP(15), CP(17), AWC(15) and AWC(17) were estimated using the work and time to attainment of RPE15 and RPE17 based on the Borg 15-point scale. Results. - The CP, CP(15) and CP(17) (170-177W) were not significantly different (P>0.05). However, AWC, AWC(15) and AWC(17) were all different from each other. The correlations between CP(15) and CP(17), with CP were strong (R=0.871 and 0.911, respectively), but the AWC(15) and AWC(17) were not significantly correlated with AWC. Conclusion. - Sub-maximal. RPE responses can be used for the estimation of CP from non-exhaustive exercise protocols. (C) 2009 Elsevier Masson SAS. All rights reserved.
Resumo:
The study compared the growth capability of probiotic (Lactobacillus acidophilus La05, Lactobacillus casei Lc01 and Bifidobacterium animalis Bb12) and non-probiotic (Lactobacillus delbrueckii subsp bulgaricus and Streptococcus thermophilus) cultures on twenty-one culture media grouped according to selectivity: nonselective agars, selective agars without antibiotics and MRS agars containing different combinations of lithium chloride, cystein, bile salts and antibiotics. Four of these media were selected for quantitative enumeration of L acidophilus La05, L casei Lc01, and B. animalis Bb12. The best culture media and incubation conditions for enumeration of the probiotic cultures were: B. animalis: MRS agar with dicloxacillin, 37 degrees C or 42 degrees C, anaerobiosis; L acidophilus: MRS agar with bile salts, 37 degrees C or 42 degrees C, aerobiosis; L casei: MRS agar with lithium chloride and sodium propionate, 37 degrees C or 42 degrees C, aerobiosis or anaerobiosis. Plating on MRS with glucose replaced by maltose, 37 degrees C or 42 degrees C, anaerobiosis, will distinguish probiotic from non-probiotic cultures. For enumeration of each probiotic in a mixed culture, the following media and incubation conditions were recommended: B. animalis: 4ABC-MRS, 42 degrees C, anaerobiosis, L acidophilus: LC medium, 42 degrees C, aerobiosis or anaerobiosis and L casei: LP-MRS, 42 degrees C, aerobiosis or anaerobiosis. In all experiments, differences in counts using pour plating or surface plating were not significant (P <= 0.05). (C) 2008 Swiss Society of Food Science and Technology. Published by Elsevier Ltd. All rights reserved.
Resumo:
Coset enumeration is a most important procedure for investigating finitely presented groups. We present a practical parallel procedure for coset enumeration on shared memory processors. The shared memory architecture is particularly interesting because such parallel computation is both faster and cheaper. The lower cost comes when the program requires large amounts of memory, and additional CPU's. allow us to lower the time that the expensive memory is being used. Rather than report on a suite of test cases, we take a single, typical case, and analyze the performance factors in-depth. The parallelization is achieved through a master-slave architecture. This results in an interesting phenomenon, whereby the CPU time is divided into a sequential and a parallel portion, and the parallel part demonstrates a speedup that is linear in the number of processors. We describe an early version for which only 40% of the program was parallelized, and we describe how this was modified to achieve 90% parallelization while using 15 slave processors and a master. In the latter case, a sequential time of 158 seconds was reduced to 29 seconds using 15 slaves.
Resumo:
This study aimed to compare Petrifilm Aerobic Count (AC) plates and the conventional pour plate methodology using the de Man-Rogosa-Sharpe (MRS) agar for the enumeration of lactic acid bacteria (LAB) in fermented milks (FMs), with different starter cultures added. FM samples (n = 66) were collected and plated on both methodologies, with incubation under anaerobic conditions at 35C for 48 h. The count results were compared by analysis of variance (P <= 0.05) and regression analysis. No differences between the mean counts obtained by both methodologies were observed, even when distinct FMs were compared. Considering all samples, a high correlation level was obtained between Petrifilm AC and MRS agar (r = 0.92), but these indexes were lower in FMs with Streptococcus thermophilus and Lactobacillus delbrueckii subsp. bulgaricus (r = 0.90) and Lactobacillus fortis (r = 0.81). Despite some slight interferences, Petrifilm AC has proven to be a convenient methodology on enumerating LAB in FM.
Resumo:
The Closest Vector Problem (CVP) and the Shortest Vector Problem (SVP) are prime problems in lattice-based cryptanalysis, since they underpin the security of many lattice-based cryptosystems. Despite the importance of these problems, there are only a few CVP-solvers publicly available, and their scalability was never studied. This paper presents a scalable implementation of an enumeration-based CVP-solver for multi-cores, which can be easily adapted to solve the SVP. In particular, it achieves super-linear speedups in some instances on up to 8 cores and almost linear speedups on 16 cores when solving the CVP on a 50-dimensional lattice. Our results show that enumeration-based CVP-solvers can be parallelized as effectively as enumeration-based solvers for the SVP, based on a comparison with a state of the art SVP-solver. In addition, we show that we can optimize the SVP variant of our solver in such a way that it becomes 35%-60% faster than the fastest enumeration-based SVP-solver to date.