Cluster Algorithm for a Solid-On-Solid Model with Constraints

We adapt the VMR (valleys-to-mountains reflections) algorithm, originally devised by us for simulations of SOS models, to the BCSOS model. It is the first time that a cluster algorithm is used for a model with constraints. The performance of this new algorithm is studied in detail in both phases of the model, including a finite size scaling analysis of the autocorrelations.Comment: 10 pages, 3 figures appended as ps-file

A Swendsen-Wang update algorithm for the Symanzik improved sigma model

We study a generalization of Swendsen-Wang algorithm suited for Potts models with next-next-neighborhood interactions. Using the embedding technique proposed by Wolff we test it on the Symanzik improved bidimensional non-linear $\sigma$ model. For some long range observables we find a little slowing down exponent ($z \simeq 0.3$) that we interpret as an effect of the partial frustration of the induced spin model.Comment: Self extracting archive fil

Genetic Differentiation Among Three Species of \u3ci\u3eParadosa\u3c/i\u3e (Arachnida: Lycosidae)

Allozymic variation in nine protein producing loci was examined in three species of Pardosa using starch gel electrophoresis. Allozyme frequencies showed a high degree of geographic uniformity among conspecific populations. Estimated heterozygosities for the three species ranged from 0.05 to 0.15. Rogers\u27 coefficients of genetic similarity based on allozyme frequencies averaged over conspecific populations ranged from 0.16 to 0.37 fo rthe three species

Critical exponents of a three dimensional O(4) spin model

By Monte Carlo simulation we study the critical exponents governing the transition of the three-dimensional classical O(4) Heisenberg model, which is considered to be in the same universality class as the finite-temperature QCD with massless two flavors. We use the single cluster algorithm and the histogram reweighting technique to obtain observables at the critical temperature. After estimating an accurate value of the inverse critical temperature \Kc=0.9360(1), we make non-perturbative estimates for various critical exponents by finite-size scaling analysis. They are in excellent agreement with those obtained with the $4-\epsilon$ expansion method with errors reduced to about halves of them.Comment: 25 pages with 8 PS figures, LaTeX, UTHEP-28

Receptor tyrosine kinase and p16/CDKN2 expression in a case of tripe palms associated with non-small-cell lung cancer

Background: Tripe palms is a descriptive term for a cutaneous paraneoplastic keratoderma. Tripe palms are frequently associated with gastric and pulmonary carcinoma. The pathogenetic mechanism remains unknown. Objective: To determine the influence of receptor tyrosine kinases, which are both expressed in pulmonary carcinomas and in human skin, we performed expression studies on epidermal growth factor receptor (EGFR), HER2, HERS in a skin sample of tripe palms obtained from a patient with non-small-cell lung cancer with lymph node involvement. Two months after diagnosis, the patient had developed palmoplantar `tripe palms'. Additionally, the expression of SRC, c-myc and p16/CDKN2 were studied. Method: Conventional reverse-transcription polymerase chain reaction was performed on a tissue sample of tripe palms. Results: Weak expression of HER2 and of p16/CDKN2 was found. EGFR, HERS, c-myc and SRC were not expressed. Conclusion: Receptor tyrosine kinases of subclass I, the tyrosine kinase SRC and the oncogene c-myc play no major role in the pathogenesis of this case of tripe palms. Copyright (C) 2000 S. Karger AG. Basel

Theoretical Analysis of Acceptance Rates in Multigrid Monte Carlo

We analyze the kinematics of multigrid Monte Carlo algorithms by investigating acceptance rates for nonlocal Metropolis updates. With the help of a simple criterion we can decide whether or not a multigrid algorithm will have a chance to overcome critial slowing down for a given model. Our method is introduced in the context of spin models. A multigrid Monte Carlo procedure for nonabelian lattice gauge theory is described, and its kinematics is analyzed in detail.Comment: 7 pages, no figures, (talk at LATTICE 92 in Amsterdam

Kinematics of Multigrid Monte Carlo

We study the kinematics of multigrid Monte Carlo algorithms by means of acceptance rates for nonlocal Metropolis update proposals. An approximation formula for acceptance rates is derived. We present a comparison of different coarse-to-fine interpolation schemes in free field theory, where the formula is exact. The predictions of the approximation formula for several interacting models are well confirmed by Monte Carlo simulations. The following rule is found: For a critical model with fundamental Hamiltonian H(phi), absence of critical slowing down can only be expected if the expansion of in terms of the shift psi contains no relevant (mass) term. We also introduce a multigrid update procedure for nonabelian lattice gauge theory and study the acceptance rates for gauge group SU(2) in four dimensions.Comment: 28 pages, 8 ps-figures, DESY 92-09

Gradual Certified Programming in Coq

Expressive static typing disciplines are a powerful way to achieve high-quality software. However, the adoption cost of such techniques should not be under-estimated. Just like gradual typing allows for a smooth transition from dynamically-typed to statically-typed programs, it seems desirable to support a gradual path to certified programming. We explore gradual certified programming in Coq, providing the possibility to postpone the proofs of selected properties, and to check "at runtime" whether the properties actually hold. Casts can be integrated with the implicit coercion mechanism of Coq to support implicit cast insertion a la gradual typing. Additionally, when extracting Coq functions to mainstream languages, our encoding of casts supports lifting assumed properties into runtime checks. Much to our surprise, it is not necessary to extend Coq in any way to support gradual certified programming. A simple mix of type classes and axioms makes it possible to bring gradual certified programming to Coq in a straightforward manner.Comment: DLS'15 final version, Proceedings of the ACM Dynamic Languages Symposium (DLS 2015

Cluster algorithms

Cluster algorithms for classical and quantum spin systems are discussed. In particular, the cluster algorithm is applied to classical O(N) lattice actions containing interactions of more than two spins. The performance of the multi-cluster and single--cluster methods, and of the standard and improved estimators are compared. (Lecture given at the summer school on `Advances in Computer Simulations', Budapest, July 1996.)Comment: 17 pages, Late