Log in

Relevant bibliographies by topics / Varianty montáže / Journal articles

To see the other types of publications on this topic, follow the link: Varianty montáže.

Journal articles on the topic 'Varianty montáže'

Author: Grafiati

Published: 4 June 2021

Last updated: 5 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Varianty montáže.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Felix, C. "Logistische Modellierung von Montagesystemen*/Logistic-based modeling of assembly systems." wt Werkstattstechnik online 108, no. 04 (2018): 263–66. http://dx.doi.org/10.37544/1436-4980-2018-04-69.

Full text

Abstract:

Die wirtschaftliche Bedeutung der Montage steigt durch die fortschreitende Kundenorientierung stetig an. Individuelle Kundenwünsche führen zu einem Anstieg der Produktvarianten. Die Variantenbildung findet meist im letzten Produktionsschritt statt – in Form der Montage. Um den Montagevorgang bestmöglich auszuführen, stehen verschiedenste Organisationsformen zur Auswahl. Dieser Beitrag beschreibt logistikrelevante Differenzierungskriterien zur Charakterisierung von Montagesystemtypen.   The economic importance of assembly is steadily increasing due to the ongoing customer orientation. Individual customer requests lead to an increase in product variants. The variant formation usually takes place in the last production step – in the form of assembly. In order to carry out the assembly process in the best possible way, a variety of organizational forms is available. This article describes in terms of logistics relevant criteria for the characterization of assembly systems.

APA, Harvard, Vancouver, ISO, and other styles

2

Morrow, Jarrett D., and Brandon W. Higgs. "CallSim: Evaluation of Base Calls Using Sequencing Simulation." ISRN Bioinformatics 2012 (December 12, 2012): 1–10. http://dx.doi.org/10.5402/2012/371718.

Full text

Abstract:

Accurate base calls generated from sequencing data are required for downstream biological interpretation, particularly in the case of rare variants. CallSim is a software application that provides evidence for the validity of base calls believed to be sequencing errors and it is applicable to Ion Torrent and 454 data. The algorithm processes a single read using a Monte Carlo approach to sequencing simulation, not dependent upon information from any other read in the data set. Three examples from general read correction, as well as from error-or-variant classification, demonstrate its effectiveness for a robust low-volume read processing base corrector. Specifically, correction of errors in Ion Torrent reads from a study involving mutations in multidrug resistant Staphylococcus aureus illustrates an ability to classify an erroneous homopolymer call. In addition, support for a rare variant in 454 data for a mixed viral population demonstrates “base rescue” capabilities. CallSim provides evidence regarding the validity of base calls in sequences produced by 454 or Ion Torrent systems and is intended for hands-on downstream processing analysis. These downstream efforts, although time consuming, are necessary steps for accurate identification of rare variants.

APA, Harvard, Vancouver, ISO, and other styles

3

Schmid, Martin, Neil Burch, Marc Lanctot, Matej Moravcik, Rudolf Kadlec, and Michael Bowling. "Variance Reduction in Monte Carlo Counterfactual Regret Minimization (VR-MCCFR) for Extensive Form Games Using Baselines." Proceedings of the AAAI Conference on Artificial Intelligence 33 (July 17, 2019): 2157–64. http://dx.doi.org/10.1609/aaai.v33i01.33012157.

Full text

Abstract:

Learning strategies for imperfect information games from samples of interaction is a challenging problem. A common method for this setting, Monte Carlo Counterfactual Regret Minimization (MCCFR), can have slow long-term convergence rates due to high variance. In this paper, we introduce a variance reduction technique (VR-MCCFR) that applies to any sampling variant of MCCFR. Using this technique, periteration estimated values and updates are reformulated as a function of sampled values and state-action baselines, similar to their use in policy gradient reinforcement learning. The new formulation allows estimates to be bootstrapped from other estimates within the same episode, propagating the benefits of baselines along the sampled trajectory; the estimates remain unbiased even when bootstrapping from other estimates. Finally, we show that given a perfect baseline, the variance of the value estimates can be reduced to zero. Experimental evaluation shows that VR-MCCFR brings an order of magnitude speedup, while the empirical variance decreases by three orders of magnitude. The decreased variance allows for the first time CFR+ to be used with sampling, increasing the speedup to two orders of magnitude.

APA, Harvard, Vancouver, ISO, and other styles

4

Frampton, Matthew, Elena R. Schiff, Nikolas Pontikos, Anthony W. Segal, and Adam P. Levine. "Seqfam: A python package for analysis of Next Generation Sequencing DNA data in families." F1000Research 7 (March 6, 2018): 281. http://dx.doi.org/10.12688/f1000research.13930.1.

Full text

Abstract:

This article introduces seqfam, a python package which is primarily designed for analysing next generation sequencing (NGS) DNA data from families with known pedigree information in order to identify rare variants that are potentially causal of a disease/trait of interest. It uses the popular and versatile Pandas library, and can be straightforwardly integrated into existing analysis code/pipelines. Seqfam can be used to verify pedigree information, to perform Monte Carlo gene dropping, to undertake regression-based gene burden testing, and to identify variants which segregate by affection status in families via user-defined pattern of occurrence rules. Additionally, it can generate scripts for running analyses in a “MapReduce pattern” on a computer cluster, something which is usually desirable in NGS data analysis and indeed “big data” analysis in general. This article summarises how seqfam’s main user functions work and motivates their use. It also provides explanatory context for example scripts and data included in the package which demonstrate use cases. With respect to verifying pedigree information, software exists for efficiently calculating kinship coefficients, so seqfam performs the necessary extra steps of mapping pedigrees and kinship coefficients to expected and observed degrees of relationship respectively. Gene dropping and the application of variant pattern of occurrence rules in families can provide evidence for a variant being causal. The authors are unaware of other software which performs these tasks in familial cohorts, so seqfam fulfils this need. Gene burden rather than single marker tests are often used to detect rare causal variants due to greater power. Seqfam may be an attractive alternative to existing gene burden testing software due to its flexibility, particularly in grouping and aggregating variants.

APA, Harvard, Vancouver, ISO, and other styles

5

PORTER, K. A., C. L. BURCH, C. POOLE, J. J. JULIANO, S. R. COLE, and S. R. MESHNICK. "Uncertain outcomes: adjusting for misclassification in antimalarial efficacy studies." Epidemiology and Infection 139, no. 4 (July 12, 2010): 544–51. http://dx.doi.org/10.1017/s0950268810001652.

Full text

Abstract:

SUMMARYEvaluation of antimalarial efficacy is difficult because recurrent parasitaemia can be due to recrudescence or re-infection. PCR is used to differentiate between recrudescences and re-infections by comparing parasite allelic variants before and after treatment. However, PCR-corrected results are susceptible to misclassification: false positives, due to re-infection by the same variant present in the patient before treatment; and false negatives, due to variants that are present but too infrequent to be detected in the pre-treatment PCR, but are then detectable post-treatment. This paper aimed to explore factors affecting the probability of false positives and proposes a Monte Carlo uncertainty analysis to account for both types of misclassification. Higher levels of transmission intensity, increased multiplicity of infection, and limited allelic variation resulted in more false recrudescences. The uncertainty analysis exploits characteristics of study data to minimize bias in the estimate of efficacy and can be applied to areas of different transmission intensity.

APA, Harvard, Vancouver, ISO, and other styles

6

Ontañón, Santiago. "Combinatorial Multi-armed Bandits for Real-Time Strategy Games." Journal of Artificial Intelligence Research 58 (March 29, 2017): 665–702. http://dx.doi.org/10.1613/jair.5398.

Full text

Abstract:

Games with large branching factors pose a significant challenge for game tree search algorithms. In this paper, we address this problem with a sampling strategy for Monte Carlo Tree Search (MCTS) algorithms called "naive sampling", based on a variant of the Multi-armed Bandit problem called "Combinatorial Multi-armed Bandits" (CMAB). We analyze the theoretical properties of several variants of naive sampling, and empirically compare it against the other existing strategies in the literature for CMABs. We then evaluate these strategies in the context of real-time strategy (RTS) games, a genre of computer games characterized by their very large branching factors. Our results show that as the branching factor grows, naive sampling outperforms the other sampling strategies.

APA, Harvard, Vancouver, ISO, and other styles

7

Belomestny, D. V., L. S. Iosipoi, and N. K. Zhivotovskiy. "Variance Reduction in Monte Carlo Estimators via Empirical Variance Minimization." Doklady Mathematics 98, no. 2 (September 2018): 494–97. http://dx.doi.org/10.1134/s1064562418060261.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

de los Campos, Gustavo, Torsten Pook, Agustin Gonzalez-Reymundez, Henner Simianer, George Mias, and Ana I. Vazquez. "ANOVA-HD: Analysis of variance when both input and output layers are high-dimensional." PLOS ONE 15, no. 12 (December 14, 2020): e0243251. http://dx.doi.org/10.1371/journal.pone.0243251.

Full text

Abstract:

Modern genomic data sets often involve multiple data-layers (e.g., DNA-sequence, gene expression), each of which itself can be high-dimensional. The biological processes underlying these data-layers can lead to intricate multivariate association patterns. We propose and evaluate two methods to determine the proportion of variance of an output data set that can be explained by an input data set when both data panels are high dimensional. Our approach uses random-effects models to estimate the proportion of variance of vectors in the linear span of the output set that can be explained by regression on the input set. We consider a method based on an orthogonal basis (Eigen-ANOVA) and one that uses random vectors (Monte Carlo ANOVA, MC-ANOVA) in the linear span of the output set. Using simulations, we show that the MC-ANOVA method gave nearly unbiased estimates. Estimates produced by Eigen-ANOVA were also nearly unbiased, except when the shared variance was very high (e.g., >0.9). We demonstrate the potential insight that can be obtained from the use of MC-ANOVA and Eigen-ANOVA by applying these two methods to the study of multi-locus linkage disequilibrium in chicken (Gallus gallus) genomes and to the assessment of inter-dependencies between gene expression, methylation, and copy-number-variants in data from breast cancer tumors from humans (Homo sapiens). Our analyses reveal that in chicken breeding populations ~50,000 evenly-spaced SNPs are enough to fully capture the span of whole-genome-sequencing genomes. In the study of multi-omic breast cancer data, we found that the span of copy-number-variants can be fully explained using either methylation or gene expression data and that roughly 74% of the variance in gene expression can be predicted from methylation data.

APA, Harvard, Vancouver, ISO, and other styles

9

Belomestny, D., L. Iosipoi, and N. Zhivotovskiy. "Variance Reduction for Monte Carlo Methods." Доклады академии наук 482, no. 6 (October 2018): 627–30. http://dx.doi.org/10.31857/s086956520002903-6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Pilleboue, Adrien, Gurprit Singh, David Coeurjolly, Michael Kazhdan, and Victor Ostromoukhov. "Variance analysis for Monte Carlo integration." ACM Transactions on Graphics 34, no. 4 (July 27, 2015): 1–14. http://dx.doi.org/10.1145/2766930.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Douc, R., A. Guillin, J. M. Marin, and C. P. Robert. "Minimum variance importance samplingviaPopulation Monte Carlo." ESAIM: Probability and Statistics 11 (August 2007): 427–47. http://dx.doi.org/10.1051/ps:2007028.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Hoogenboom, J. Eduard. "Zero-Variance Monte Carlo Schemes Revisited." Nuclear Science and Engineering 160, no. 1 (September 2008): 1–22. http://dx.doi.org/10.13182/nse160-01.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Homolle, Thomas M. M., and Nicolas G. Hadjiconstantinou. "Low-variance deviational simulation Monte Carlo." Physics of Fluids 19, no. 4 (April 2007): 041701. http://dx.doi.org/10.1063/1.2717721.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Kok, Schalk, and Carl Sandrock. "Locating and Characterizing the Stationary Points of the Extended Rosenbrock Function." Evolutionary Computation 17, no. 3 (September 2009): 437–53. http://dx.doi.org/10.1162/evco.2009.17.3.437.

Full text

Abstract:

Two variants of the extended Rosenbrock function are analyzed in order to find the stationary points. The first variant is shown to possess a single stationary point, the global minimum. The second variant has numerous stationary points for high dimensionality. A previously proposed method is shown to be numerically intractable, requiring arbitrary precision computation in many cases to enumerate candidate solutions. Instead, a standard Newtonian method with multi-start is applied to locate stationary points. The relative magnitude of the negative and positive eigenvalues of the Hessian is also computed, in order to characterize the saddle points. For dimensions up to 100, only two local minimizers are found, but many saddle points exist. Two saddle points with a single negative eigenvalue exist for high dimensionality, which may appear as “near” local minima. The remaining saddle points we found have a predictable form, and a method is proposed to estimate their number. Monte Carlo simulation indicates that it is unlikely to escape these saddle points using uniform random search. A standard particle swarm algorithm also struggles to improve upon a saddle point contained within the initial population.

APA, Harvard, Vancouver, ISO, and other styles

15

Bortnowski, Piotr, Lech Gładysiewicz, Robert Król, and Maksymilian Ozdoba. "Energy Efficiency Analysis of Copper Ore Ball Mill Drive Systems." Energies 14, no. 6 (March 23, 2021): 1786. http://dx.doi.org/10.3390/en14061786.

Full text

Abstract:

Milling is among the most energy-consuming technological stages of copper ore processing. It is performed in mills, which are machines of high rotational masses. The start of a mill filled to capacity requires appropriate solutions that mitigate the overloading. One method for increasing the energy efficiency of ball mills is to optimize their drive systems. This article looks at two variants of drive systems with efficiencies higher than the already existing solutions. The first variant is a low-speed synchronous motor with permanent magnets without a gearbox, and the second variant is an asynchronous high-efficiency motor with a gearbox and a fluid coupling. The energy performance analysis of the three solutions was based on the average energy consumption indicator per mass unit of the milled material and on the energy consumption per hour. The investigations required models of the drive systems and analyses with the use of the Monte Carlo methods. The highest energy efficiency is observed in the case of the solution based on the permanent magnet motor. However, the drive system with the high-speed motor offers a gentle start-up possibility owing to the fluid coupling.

APA, Harvard, Vancouver, ISO, and other styles

16

Florian, Maria C., Kalpana J. Nattamai, Hartmut Geiger, and Medhanie A. Mulaw. "Clonality and Mixed Mutational Signature in Aged Hematopoietic Stem Cells Via Single Cell Variant Analysis." Blood 128, no. 22 (December 2, 2016): 570. http://dx.doi.org/10.1182/blood.v128.22.570.570.

Full text

Abstract:

Abstract Genomic stability and integrity in Hematopoietic Stem Cells (HSCs) is maintained via DNA damage checkpoints, DNA proofreading and DNA repair (Moehrle et al., 2015; Cell Rep). Despite these mechanisms, recurring and non-recurring mutations accumulate in HSCs upon aging, which correlate with an elevated incidence of myeloproliferative diseases (Rossi, Bryder, and Weissman, Exp. Gerontol. 2007) as well as changes in clonality (Akunuru and Geiger, 2016; Trends in Mol. Med.). The rate at which such mutations accumulate in individual HSCs and the selection advantage/disadvantage that they provide is unclear and is an active area of investigation. Evolutionary theory supports a strong influence of the aged niche on the selection of HSCs clones upon aging (Rozhok, Salstrom, and DeGregori, 2014; Aging). We hypothesized that variant profiling of single HSCs based on RNA transcripts will reveal mutational signatures adapted to the selection pressure of the aging microenvironment. We performed Single cell RNA-seq of daughter cell pairs from young and aged murine HSCs (LSK, CD34-, flk2-). The Genome Analysis Toolkit (GATK; Broad Institute) RNA-seq variant/mutation calling algorithm pipeline was applied with some modifications. Only variants that were observed in both daughter cells of a given pair were selected, which significantly decreased our false discovery rate (tested by a Monte Carlo simulation). First and most interestingly, we observed no significant difference in the overall number of variants/mutations between young and aged HSCs, further supporting our recently published observations on the frequency of DNA mutations in HSCs upon aging (Moehrle et al., 2015; Cell Rep). We then used an approach that takes into account the 3' and 5' bases flanking a variant to generate motifs whose frequencies can be mathematically analyzed to deduce characteristic mutational patterns, termed as mutational signatures (Nik-Zainal et al., 2012; Cell). We employed a non-negative matrix factorization (nmf) and principal component analysis (pca) algorithms to generate 10 mutational signatures that explained > 95% of the variance in the dataset. We then analyzed the signatures in a pairwise fashion and selected two signatures with the highest discrimination score between young and aged HSC. Based on this, cells fell into two major groups: group 1 predominantly contained aged single cells (~90% of the cells in this group) whereas, interestingly, group 2 contained a mix of young and aged HSCs. The segregation of young and aged single HSCs counts between groups 1 and 2 was tested using Fisher's exact test and was statistically significant (p-value 0.0029). These data indicate that while the overall mutational load is not elevated, majority of aged HSCs acquire a mutational signature distinct from young HSCs, while a proportion of aged HSCs present with a young-like HSC signature. Furthermore, our results show that even those cells that have acquired an aging signature aren't homogeneous and show sub-clustering tendencies, providing the first hint that they may potentially evolve further into more distinct clones. In conclusion, our results show that individual HSCs reflect a mixed mutational profile reminiscent of a non-uniform accumulation of variants. As such signatures are a reflection of underlying mechanisms by which the mutations accumulate (Nik-Zainal et al., 2012; Cell), the proportion of aged HSCs sharing similar mutational signatures but distinct from the young HSCs reveal an aging signature that indicates specific mutational factors and selection pressure of the aging microenvironment. Disclosures Mulaw: NuGEN: Honoraria.

APA, Harvard, Vancouver, ISO, and other styles

17

Xie, Tiantian, and Marc Olano. "Real-time Subsurface Control Variates." Proceedings of the ACM on Computer Graphics and Interactive Techniques 4, no. 1 (April 26, 2021): 1–18. http://dx.doi.org/10.1145/3451265.

Full text

Abstract:

Real-time adaptive sampling is a new technique recently proposed for efficient importance sampling in realtime Monte Carlo sampling in subsurface scattering. It adaptively places samples based on variance tracking to help escape the uncanny valley of subsurface rendering. However, the occasional performance drop due to temporal lighting dynamics (e.g., guns or lights turning on and off) could hinder adoption in games or other applications where smooth high frame rate is preferred. In this paper we propose a novel usage of Control Variates (CV) in the sample domain instead of shading domain to maintain a consistent low pass time. Our algorithm seamlessly reduces to diffuse with zero scattering samples for sub-pixel scattering. We propose a novel joint-optimization algorithm for sample count and CV coefficient estimation. The main enabler is our novel time-variant covariance updating method that helps remove the effect of recent temporal dynamics from variance tracking. Since bandwidth is critical in real-time rendering, a solution without adding any extra textures is also provided.

APA, Harvard, Vancouver, ISO, and other styles

18

Wang, Jr-Yan. "Variance Reduction for Multivariate Monte Carlo Simulation." Journal of Derivatives 16, no. 1 (August 31, 2008): 7–28. http://dx.doi.org/10.3905/jod.2008.710895.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Booth, Thomas E. "Ex Post Facto Monte Carlo Variance Reduction." Nuclear Science and Engineering 148, no. 3 (November 2004): 391–402. http://dx.doi.org/10.13182/nse04-a2465.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Booth, Thomas E. "Zero-Variance Solutions for Linear Monte Carlo." Nuclear Science and Engineering 102, no. 4 (August 1989): 332–40. http://dx.doi.org/10.13182/nse89-a23646.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Fishman, G. S., and V. G. Kulkarni. "Improving Monte Carlo Efficiency by Increasing Variance." Management Science 38, no. 10 (October 1992): 1432–44. http://dx.doi.org/10.1287/mnsc.38.10.1432.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Owen, Art B. "Monte Carlo Variance of Scrambled Net Quadrature." SIAM Journal on Numerical Analysis 34, no. 5 (October 1997): 1884–910. http://dx.doi.org/10.1137/s0036142994277468.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Assaraf, Roland, and Michel Caffarel. "Zero-Variance Principle for Monte Carlo Algorithms." Physical Review Letters 83, no. 23 (December 6, 1999): 4682–85. http://dx.doi.org/10.1103/physrevlett.83.4682.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Fishman, George S., and David S. Rubin. "Bounding the variance in Monte Carlo experiments." Operations Research Letters 11, no. 4 (May 1992): 243–48. http://dx.doi.org/10.1016/0167-6377(92)90031-w.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Jaehrling, Karen, and Thorsten Kalina. "‘Grey zones’ within dependent employment: formal and informal forms of on-call work in Germany." Transfer: European Review of Labour and Research 26, no. 4 (July 24, 2020): 447–63. http://dx.doi.org/10.1177/1024258920937960.

Full text

Abstract:

This article aims to take stock of the various manifestations of on-call work in Germany. It is shown that formal on-call work is, by international standards, relatively strictly regulated in Germany, not least as the result of a 2019 reform of the law. Similar to other countries, however, other informal variants are used that lie outside the scope of the re-regulation or ‘normalisation’ of formal on-call work. Differentiated analyses based on survey data show that both formal and informal variants of on-call work are associated with disproportionately high levels of short part-time work, low pay and consequently with considerable risks of poverty. As a consequence, the ongoing debate on the erosion of the status of employee should not be too narrowly restricted to self-employed workers in the gig economy (Deliveroo, Uber) but should be extended to include the ‘grey zones’ in the area of dependent employment. Cet article vise à faire le point sur les différentes manifestations du travail à la demande en Allemagne. Il montre que le travail à la demande formel est, selon les normes internationales, réglementé assez strictement en Allemagne, grâce notamment à la réforme de la loi en 2019. Toutefois, comme dans d’autres pays, d’autres variantes informelles sont présentes et échappent au champ d’application de la re-réglementation ou de la “normalisation” du travail à la demande formel. Des analyses différenciées, basées sur des données d’enquête, montrent que les variantes formelles et informelles du travail à la demande sont associées à des niveaux proportionnellement trop importants de travail à temps partiel de courte durée, de faibles rémunérations et, par conséquent, à des risques considérables de pauvreté. Dès lors, le débat en cours sur l’érosion du statut de salarié ne devrait pas être strictement limité aux travailleurs indépendants de la gig economy - ou économie des petits boulots (Deliveroo, Uber), mais devrait être étendu aux “zones grises” présentes dans le domaine de l’emploi dépendant. Der vorliegende Artikel zielt auf eine Bestandsaufnahme der verschiedenen Erscheinungsformen von Abrufarbeit in Deutschland und zeigt, dass die formale Variante von Abrufarbeit hier im internationalen Vergleich relativ strikt reguliert ist, nicht zuletzt durch eine Gesetzesreform, die 2019 in Kraft trat. Ähnlich wie in anderen Ländern kommen jedoch andere informelle Varianten zum Einsatz, die außerhalb des Geltungsbereichs der Re-Regulierung oder ‘‘Normalisierung’’ der formellen Abrufarbeit liegen. Differenzierte Analysen auf der Grundlage von Umfragedaten zeigen, dass sowohl formelle als auch informelle Varianten von Abrufarbeit mit einem unverhältnismäßig hohen Anteil an kurzer Teilzeit, Niedriglöhnen und damit einem hohen Armutsrisiko assoziiert sind. Die gegenwärtige Debatte über die Erosion des Arbeitnehmerstatus sollte sich deshalb nicht zu eng auf die Solo-Selbständigen in der Gig-Ökonomie beschränken (Deliveroo, Uber), sondern auch die ‘‘Grauzonen’’ im Bereich der abhängigen Beschäftigung in den Blick nehmen.

APA, Harvard, Vancouver, ISO, and other styles

26

Jitariu, Sebastian, Ionel Staretu, and Catalin Moldovan. "Robotized Montage Unit which Uses an Anthropomorphic Gripper with Five Fingers: CAD Modelling and Simulation." Applied Mechanics and Materials 656 (October 2014): 146–53. http://dx.doi.org/10.4028/www.scientific.net/amm.656.146.

Full text

Abstract:

This paper presents an original integrated solution of montage robotization of assemblies of small and medium complexity. The robotic station (the robotized cell) proposed contains a joint industrial robot equipped with an anthropomorphic gripper with five fingers, two feeders, a montage table and a storage terminal. CAD modelling of the whole system and functional simulation are performed, which certifies the validity of its correct operation. The gripper used is anthropomorphic with five fingers and five degrees of freedom with a relatively simple structure but high functionality. The gripper, adapted by a popular variant is realized as prototype at low cost, through rapid prototyping, and tested. The gripper control is possible through the advanced method of human hand gestures capture with a Motion Leap device and their transmission through a virtual interface to the real gripper. In perspective, it is considered mounting the gripper in an improved variant, on a real robot and testing the operation of the proposed montage scenario.

APA, Harvard, Vancouver, ISO, and other styles

27

Borovkov, K. A. "On a New Variant of the Monte Carlo Method." Theory of Probability & Its Applications 36, no. 2 (January 1992): 355–60. http://dx.doi.org/10.1137/1136038.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Guo, Gang, Arne Bittig, and Adelinde Uhrmacher. "Lattice Monte Carlo simulation of Galilei variant anomalous diffusion." Journal of Computational Physics 288 (May 2015): 167–80. http://dx.doi.org/10.1016/j.jcp.2015.02.017.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Ogundijo, Oyetunji E., and Xiaodong Wang. "Characterization of tumor heterogeneity by latent haplotypes: a sequential Monte Carlo approach." PeerJ 6 (May 30, 2018): e4838. http://dx.doi.org/10.7717/peerj.4838.

Full text

Abstract:

Tumor samples obtained from a single cancer patient spatially or temporally often consist of varying cell populations, each harboring distinct mutations that uniquely characterize its genome. Thus, in any given samples of a tumor having more than two haplotypes, defined as a scaffold of single nucleotide variants (SNVs) on the same homologous genome, is evidence of heterogeneity because humans are diploid and we would therefore only observe up to two haplotypes if all cells in a tumor sample were genetically homogeneous. We characterize tumor heterogeneity by latent haplotypes and present state-space formulation of the feature allocation model for estimating the haplotypes and their proportions in the tumor samples. We develop an efficient sequential Monte Carlo (SMC) algorithm that estimates the states and the parameters of our proposed state-space model, which are equivalently the haplotypes and their proportions in the tumor samples. The sequential algorithm produces more accurate estimates of the model parameters when compared with existing methods. Also, because our algorithm processes the variant allele frequency (VAF) of a locus as the observation at a single time-step, VAF from newly sequenced candidate SNVs from next-generation sequencing (NGS) can be analyzed to improve existing estimates without re-analyzing the previous datasets, a feature that existing solutions do not possess.

APA, Harvard, Vancouver, ISO, and other styles

30

Erfanian, Hamid Reza, Seyed Jaliledin Ghaznavi Bidgoli, and Parvin Shakibaei. "The pricing of spread option using simulation." International Journal of Applied Mathematical Research 6, no. 4 (October 19, 2017): 121. http://dx.doi.org/10.14419/ijamr.v6i4.7914.

Full text

Abstract:

Monte Carlo simulation is one of the most common and popular method of options pricing. The advantages of this method are being easy to use, suitable for all kinds of standard and exotic options and also are suitable for higher dimensional problems. But on the other hand Monte Carlo variance convergence rate is which due to that it will have relatively slow convergence rate to answer the problems, as to achieve accuracy when it has been d-dimensions, complexity is . For this purpose, several methods are provided in quasi Monte Carlo simulation to increase variance convergence rate as variance reduction techniques, so far. One of the latest presented methods is multilevel Monte Carlo that is introduced by Giles in 2008. This method not only reduces the complexity of computing amount in use of Euler discretization scheme and the amount in use of Milstein discretization scheme, but also has the ability to combine with other variance reduction techniques. In this paper, using Multilevel Monte Carlo method by taking Milstein discretization scheme, pricing spread option and compared complexity of computing with standard Monte Carlo method. The results of Multilevel Monte Carlo method in pricing spread options are better than standard Monte Carlo simulation.

APA, Harvard, Vancouver, ISO, and other styles

31

Mancusi, Davide, and Andrea Zoia. "TOWARDS ZERO-VARIANCE SCHEMES FOR KINETIC MONTE-CARLO SIMULATIONS." EPJ Web of Conferences 247 (2021): 04010. http://dx.doi.org/10.1051/epjconf/202124704010.

Full text

Abstract:

The solution of the time-dependent transport problem for neutrons and precursors in a nuclear reactor is hard to treat in a naive Monte-Carlo framework because of the largely different time scales associated to the prompt-fission chains and to the decay of precursors. The increasing computer power and the development of variance-reduction techniques specific for reactor kinetics have recently unlocked the possibility to calculate reference solutions to the time-dependent transport problem. However, the application of time-dependent Monte Carlo to large systems (i.e., a full reactor core) is still stifled by the enormous computational requirements. In this paper, we formulate the construction of an optimal Monte-Carlo strategy (in the sense that it results in a zero-variance estimator) for a specific observable in time-dependent transport, in analogy with the existing schemes for stationary problems. As far as we are aware, zero-variance Monte-Carlo schemes for neutron-precursor kinetics have never been proposed before. We verify our construction with numerical calculations for a benchmark transport problem.

APA, Harvard, Vancouver, ISO, and other styles

32

Palazzo, Bruno, Paolo Castaldo, and Alessio Mariniello. "Time-Variant Reliability of RC Structures." Applied Mechanics and Materials 847 (July 2016): 407–14. http://dx.doi.org/10.4028/www.scientific.net/amm.847.407.

Full text

Abstract:

Reinforced concrete structures are generally affected by degradation phenomena, which results in a time variability in strength and stiffness beyond the baseline conditions which are assumed in structural design, in particular when the concrete is exposed to an aggressive environment. Therefore, structural safety should realistically be considered time-variant. This paper provides a probabilistic approach to predict the time-evolution of the mechanical and geometrical properties of a reinforced concrete structural element (i.e., bridge pier) subjected to corrosion-induced deterioration, due to diffusive attack of chlorides, in order to evaluate its service life. The proposed model is based on Monte Carlo simulations in order to evaluate time variant axial force-bending moment resistance domains, with the aim to estimate the time-variant reliability index. Finally, an application to estimate the expected lifetime of a deteriorating reinforced concrete bridge pile is proposed.

APA, Harvard, Vancouver, ISO, and other styles

33

Bilodid, Yurii, and Jaakko Leppänen. "EFFECT OF THE UNIFORM FISSION SOURCE METHOD ON LOCAL POWER VARIANCE IN FULL CORE SERPENT CALCULATION." EPJ Web of Conferences 247 (2021): 04024. http://dx.doi.org/10.1051/epjconf/202124704024.

Full text

Abstract:

One of challenges of the Monte Carlo full core simulations is to obtain acceptable statistical variance of local parameters throughout the whole reactor core at a reasonable computation cost. The statistical variance tends to be larger in low-power regions. To tackle this problem, the Uniform-Fission-Site method was implemented in Monte Carlo code MC21 and its effectiveness was demonstrated on NEA Monte Carlo performance benchmark. The very similar method is also implemented in Monte Carlo code Serpent under the name Uniform Fission Source (UFS) method. In this work the effect of UFS method implemented in Serpent is studied on the BEAVRS benchmark which is based on a real PWR core with relatively flat radial power distribution and also on 3x3 PWR mini-core simulated with thermo-hydraulic and thermo-mechanic feedbacks. It is shown that the application of the Uniform Fission Source method has no significant effect on radial power variance but equalizes axial distribution of variance of local power.

APA, Harvard, Vancouver, ISO, and other styles

34

Wang, Jian, Xiang Gao, and Zhili Sun. "A Multilevel Simulation Method for Time-Variant Reliability Analysis." Sustainability 13, no. 7 (March 25, 2021): 3646. http://dx.doi.org/10.3390/su13073646.

Full text

Abstract:

Crude Monte Carlo simulation (MCS) is the most robust and easily implemented method for performing time-variant reliability analysis (TRA). However, it is inefficient, especially for high reliability problems. This paper aims to present a random simulation method called the multilevel Monte Carlo (MLMC) method for TRA to enhance the computational efficiency of crude MCS while maintaining its accuracy and robustness. The proposed method first discretizes the time interval of interest using a geometric sequence of different timesteps. The cumulative probability of failure associated with the finest level can then be estimated by computing corrections using all levels. To assess the cumulative probability of failure in a way that minimizes the overall computational complexity, the number of random samples at each level is optimized. Moreover, the correction associated with each level is independently computed using crude MCS. Thereby, the proposed method can achieve the accuracy associated with the finest level at a much lower computational cost than that of crude MCS, and retains the robustness of crude MCS with respect to nonlinearity and dimensions. The effectiveness of the proposed method is validated by numerical examples.

APA, Harvard, Vancouver, ISO, and other styles

35

Berman, Leonard. "Accelerating Monte Carlo: quasirandom sequences and variance reduction." Journal of Computational Finance 1, no. 2 (1997): 79–95. http://dx.doi.org/10.21314/jcf.1997.007.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Haghighat, Alireza, and John C. Wagner. "Monte Carlo variance reduction with deterministic importance functions." Progress in Nuclear Energy 42, no. 1 (January 2003): 25–53. http://dx.doi.org/10.1016/s0149-1970(02)00002-1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Arouna, Bouhari. "Adaptative Monte Carlo Method, A Variance Reduction Technique." Monte Carlo Methods and Applications 10, no. 1 (January 1, 2004): 1–24. http://dx.doi.org/10.1515/156939604323091180.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Zhi-Jie Pan and Ya-Chuan Tai. "Variance importance of system components by Monte Carlo." IEEE Transactions on Reliability 37, no. 4 (1988): 421–23. http://dx.doi.org/10.1109/24.9851.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Booth, T. E., K. C. Kelley, and S. S. McCready. "Monte Carlo Variance Reduction Using Nested Dxtran Spheres." Nuclear Technology 168, no. 3 (December 2009): 765–67. http://dx.doi.org/10.13182/nt09-a9303.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Wang, Xiaoqun. "Variance reduction techniques and quasi-Monte Carlo methods." Journal of Computational and Applied Mathematics 132, no. 2 (July 2001): 309–18. http://dx.doi.org/10.1016/s0377-0427(00)00331-9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Johnstone, Iain M., and Paul F. Velleman. "Efficient Scores, Variance Decompositions, and Monte Carlo Swindles." Journal of the American Statistical Association 80, no. 392 (December 1985): 851–62. http://dx.doi.org/10.1080/01621459.1985.10478194.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Aissing, Gerrard. "Monte Carlo variance minimization for the Dirac equation." Physical Review A 44, no. 5 (September 1, 1991): R2765—R2768. http://dx.doi.org/10.1103/physreva.44.r2765.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Huang, Lu-Jing, Yin-Ting Liao, Ting-Li Chen, and Chii-Ruey Hwang. "Optimal Variance Reduction for Markov Chain Monte Carlo." SIAM Journal on Control and Optimization 56, no. 4 (January 2018): 2977–96. http://dx.doi.org/10.1137/17m1144301.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Jin, Lei, Kaushik Banerjee, Steven P. Hamilton, and Gregory G. Davidson. "Improving variance estimation in Monte Carlo eigenvalue simulations." Annals of Nuclear Energy 110 (December 2017): 692–708. http://dx.doi.org/10.1016/j.anucene.2017.07.016.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Legrady, David, Mate Halasz, Jozsef Kophazi, Balazs Molnar, and Gabor Tolnai. "Population-based variance reduction for dynamic Monte Carlo." Annals of Nuclear Energy 149 (December 2020): 107752. http://dx.doi.org/10.1016/j.anucene.2020.107752.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Sobol', I. M., and A. V. Tutunnikov. "A variance reducing multiplier for Monte Carlo integrations." Mathematical and Computer Modelling 23, no. 8-9 (April 1996): 87–96. http://dx.doi.org/10.1016/0895-7177(96)00042-8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Marcu, Mihail, and Jürgen Müller. "Variance reduction technique for quantum Monte Carlo simulations." Physics Letters A 119, no. 3 (December 1986): 130–32. http://dx.doi.org/10.1016/0375-9601(86)90430-5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Janekova, J., J. Fabianova, and J. Kadarova. "Selection of Optimal Investment Variant Based on Monte Carlo Simulations." International Journal of Simulation Modelling 20, no. 2 (June 15, 2021): 279–90. http://dx.doi.org/10.2507/ijsimm20-2-557.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Chen, Zigui, Rob DeSalle, Mark Schiffman, Rolando Herrero, and Robert D. Burk. "Evolutionary Dynamics of Variant Genomes of Human Papillomavirus Types 18, 45, and 97." Journal of Virology 83, no. 3 (November 26, 2008): 1443–55. http://dx.doi.org/10.1128/jvi.02068-08.

Full text

Abstract:

ABSTRACT Human papillomavirus type 18 (HPV18) and HPV45 account for approximately 20% of all cervix cancers. We show that HPV18, HPV45, and the recently discovered HPV97 comprise a clade sharing a most recent common ancestor within HPV α7 species. Variant lineages of these HPV types were classified by sequence analysis of the upstream regulatory region/E6 region among cervical samples from a population-based study in Costa Rica, and 27 representative genomes from each major variant lineage were sequenced. Nucleotide variation within HPV18 and HPV45 was 3.82% and 2.39%, respectively, and amino acid variation was 4.73% and 2.87%, respectively. Only 18 nucleotide variations, of which 10 were nonsynonymous, were identified among three HPV97 genomes. Full-genome comparisons revealed maximal diversity between HPV18 African and non-African variants (2.6% dissimilarity), whereas HPV18 Asian-American [E1 (AA)] and European (E2) variants were closely related (less than 0.5% dissimilarity); HPV45 genomes had a maximal difference of 1.6% nucleotides. Using a Bayesian Markov chain Monte Carlo (MCMC) method, the divergence times of HPV18, -45, and -97 from their most recent common ancestors indicated that HPV18 diverged approximately 7.7 million years (Myr) ago, whereas HPV45 and HPV97 split off around 5.7 Myr ago, in a period encompassing the divergence of the great ape species. Variants within the HPV18/45/97 lineages were estimated to have diverged from their common ancestors in the genus Homo within the last 1 Myr (<0.7 Myr). To investigate the molecular basis of HPV18, HPV45, and HPV97 evolution, regression models of codon substitution were used to identify lineages and amino acid sites under selective pressure. The E5 open reading frame (ORF) of HPV18 and the E4 ORFs of HPV18, HPV45, and HPV18/45/97 had nonsynonymous/synonymous substitution rate ratios (dN /dS ) over 1 indicative of positive Darwinian selection. The L1 ORF of HPV18 genomes had an increased proportion of nonsynonymous substitutions (4.93%; average dN /dS ratio [M3] = 0.3356) compared to HPV45 (1.86%; M3 = 0.1268) and HPV16 (2.26%; M3 = 0.1330) L1 ORFs. In contrast, HPV18 and HPV16 genomes had similar amino acid substitution rates within the E1 ORF (2.89% and 3.24%, respectively), while HPV45 E1 was highly conserved (amino acid substitution rate was 0.77%). These data provide an evolutionary history of this medically important clade of HPVs and identify an unexpected divergence of the L1 gene of HPV18 that may have clinical implications for the long-term use of an L1-virus-like particle-based prophylactic vaccine.

APA, Harvard, Vancouver, ISO, and other styles

50

Guo, Bin, and Baolin Wu. "Integrate multiple traits to detect novel trait–gene association using GWAS summary data with an adaptive test approach." Bioinformatics 35, no. 13 (November 23, 2018): 2251–57. http://dx.doi.org/10.1093/bioinformatics/bty961.

Full text

Abstract:

Abstract Motivation Genetics hold great promise to precision medicine by tailoring treatment to the individual patient based on their genetic profiles. Toward this goal, many large-scale genome-wide association studies (GWAS) have been performed in the last decade to identify genetic variants associated with various traits and diseases. They have successfully identified tens of thousands of disease-related variants. However they have explained only a small proportion of the overall trait heritability for most traits and are of very limited clinical use. This is partly owing to the small effect sizes of most genetic variants, and the common practice of testing association between one trait and one genetic variant at a time in most GWAS, even when multiple related traits are often measured for each individual. Increasing evidence suggests that many genetic variants can influence multiple traits simultaneously, and we can gain more power by testing association of multiple traits simultaneously. It is appealing to develop novel multi-trait association test methods that need only GWAS summary data, since it is generally very hard to access the individual-level GWAS phenotype and genotype data. Results Many existing GWAS summary data-based association test methods have relied on ad hoc approach or crude Monte Carlo approximation. In this article, we develop rigorous statistical methods for efficient and powerful multi-trait association test. We develop robust and efficient methods to accurately estimate the marginal trait correlation matrix using only GWAS summary data. We construct the principal component (PC)-based association test from the summary statistics. PC-based test has optimal power when the underlying multi-trait signal can be captured by the first PC, and otherwise it will have suboptimal performance. We develop an adaptive test by optimally weighting the PC-based test and the omnibus chi-square test to achieve robust performance under various scenarios. We develop efficient numerical algorithms to compute the analytical P-values for all the proposed tests without the need of Monte Carlo sampling. We illustrate the utility of proposed methods through application to the GWAS meta-analysis summary data for multiple lipids and glycemic traits. We identify multiple novel loci that were missed by individual trait-based association test. Availability and implementation All the proposed methods are implemented in an R package available at http://www.github.com/baolinwu/MTAR. The developed R programs are extremely efficient: it takes less than 2 min to compute the list of genome-wide significant single nucleotide polymorphisms (SNPs) for all proposed multi-trait tests for the lipids GWAS summary data with 2.5 million SNPs on a single Linux desktop. Supplementary information Supplementary data are available at Bioinformatics online.

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!