Measuring the Decorrelation Times of Fourier Modes in Simulations

We describe a method to study the rate at which modes decorrelate in numerical simulations. We study the XY model updated with the Metropolis and Wolff dynamics respectively and compute the rate at which each eigenvector of the dynamics decorrelates. Our method allows us to identify the decorrelation time for each mode separately. We find that the autocorrelation function of the various modes is markedly different for the `local' Metropolis compared to the `non-local' Wolff dynamics. Equipped with this new insight, it may be possible to devise highly efficient algorithms.Comment: 16 pp (LaTeX), PUPT-1378 , IASSNS-HEP-93/

The Methods to Improve Quality of Service by Accounting Secure Parameters

A solution to the problem of ensuring quality of service, providing a greater number of services with higher efficiency taking into account network security is proposed. In this paper, experiments were conducted to analyze the effect of self-similarity and attacks on the quality of service parameters. Method of buffering and control of channel capacity and calculating of routing cost method in the network, which take into account the parameters of traffic multifractality and the probability of detecting attacks in telecommunications networks were proposed. The both proposed methods accounting the given restrictions on the delay time and the number of lost packets for every type quality of service traffic. During simulation the parameters of transmitted traffic (self-similarity, intensity) and the parameters of network (current channel load, node buffer size) were changed and the maximum allowable load of network was determined. The results of analysis show that occurrence of overload when transmitting traffic over a switched channel associated with multifractal traffic characteristics and presence of attack. It was shown that proposed methods can reduce the lost data and improve the efficiency of network resources.Comment: 10 pages, 1 figure, 1 equation, 1 table. arXiv admin note: text overlap with arXiv:1904.0520

Block Spin Effective Action for 4d SU(2) Finite Temperature Lattice Gauge Theory

The Svetitsky-Yaffe conjecture for finite temperature 4d SU(2) lattice gauge theory is confirmed by observing matching of block spin effective actions of the gauge model with those of the 3d Ising model. The effective action for the gauge model is defined by blocking the signs of the Polyakov loops with the majority rule. To compute it numerically, we apply a variant of the IMCRG method of Gupta and Cordery.Comment: LaTeX2e, 22 pages, 8 Figure

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

Multigrid Monte Carlo Algorithms for SU(2) Lattice Gauge Theory: Two versus Four Dimensions

We study a multigrid method for nonabelian lattice gauge theory, the time slice blocking, in two and four dimensions. For SU(2) gauge fields in two dimensions, critical slowing down is almost completely eliminated by this method. This result is in accordance with theoretical arguments based on the analysis of the scale dependence of acceptance rates for nonlocal Metropolis updates. The generalization of the time slice blocking to SU(2) in four dimensions is investigated analytically and by numerical simulations. Compared to two dimensions, the local disorder in the four dimensional gauge field leads to kinematical problems.Comment: 24 pages, PostScript file (compressed and uuencoded), preprint MS-TPI-94-

Efficient assembly of very short oligonucleotides using T4 DNA Ligase

<p>Abstract</p> <p>Background</p> <p>In principle, a pre-constructed library of all possible short oligonucleotides could be used to construct many distinct gene sequences. In order to assess the feasibility of such an approach, we characterized T4 DNA Ligase activity on short oligonucleotide substrates and defined conditions suitable for assembly of a plurality of oligonucleotides.</p> <p>Findings</p> <p>Ligation by T4 DNA Ligase was found to be dependent on the formation of a double stranded DNA duplex of at least five base pairs surrounding the site of ligation. However, ligations could be performed effectively with overhangs smaller than five base pairs and oligonucleotides as small as octamers, in the presence of a second, complementary oligonucleotide. We demonstrate the feasibility of simultaneous oligonucleotide phosphorylation and ligation and, as a proof of principle for DNA synthesis through the assembly of short oligonucleotides, we performed a hierarchical ligation procedure whereby octamers were combined to construct a target 128-bp segment of the beta-actin gene.</p> <p>Conclusions</p> <p>Oligonucleotides as short as 8 nucleotides can be efficiently assembled using T4 DNA Ligase. Thus, the construction of synthetic genes, without the need for custom oligonucleotide synthesis, appears feasible.</p

Learning Moore Machines from Input-Output Traces

The problem of learning automata from example traces (but no equivalence or membership queries) is fundamental in automata learning theory and practice. In this paper we study this problem for finite state machines with inputs and outputs, and in particular for Moore machines. We develop three algorithms for solving this problem: (1) the PTAP algorithm, which transforms a set of input-output traces into an incomplete Moore machine and then completes the machine with self-loops; (2) the PRPNI algorithm, which uses the well-known RPNI algorithm for automata learning to learn a product of automata encoding a Moore machine; and (3) the MooreMI algorithm, which directly learns a Moore machine using PTAP extended with state merging. We prove that MooreMI has the fundamental identification in the limit property. We also compare the algorithms experimentally in terms of the size of the learned machine and several notions of accuracy, introduced in this paper. Finally, we compare with OSTIA, an algorithm that learns a more general class of transducers, and find that OSTIA generally does not learn a Moore machine, even when fed with a characteristic sample

Pure-glue hidden valleys through the Higgs portal

We consider the possibility that the Higgs boson can act as a link to a hidden sector in the context of pure-glue hidden valley models. In these models the standard model is weakly coupled, through loops of heavy messengers fields, to a hidden sector whose low energy dynamics is described by a pure-Yang-Mills theory. Such a hidden sector contains several metastable hidden glueballs. In this work we shall extend earlier results on hidden valleys to include couplings of the messengers to the standard model Higgs sector. The effective interactions at one-loop couple the hidden gluons to the standard model particles through the Higgs sector. These couplings in turn induce hidden glueball decays to fermion pairs, or cascade decays with multiple Higgs emission. The presence of effective operators of different mass dimensions, often competing with each other, together with a great diversity of states, leads to a great variability in the lifetimes and decay modes of the hidden glueballs. We find that most of the operators considered in this paper are not heavily constrained by precision electroweak physics, therefore leaving plenty of room in the parameter space to be explored by the future experiments at the LHC.Comment: 44 pages, 16 figures. Major revision for JHEP, corrected an error in Eq. 5.1, comments adde

Library 2.0: the effectiveness of social media as a marketing tool for libraries in educational institutions

In an attempt to market their services and connect with potential users, and particularly young people, many libraries are opening accounts on social media platforms. Research suggests a contradiction between the advice relating to marketing and that regarding the use of social media in libraries, with the former emphasising the importance of the user at the centre of all considerations and the latter placing library staff as central to decisions. In this work we attempt to re-address this imbalance by surveying the current state of library activity on Twitter and, by means of questionnaires, investigate the experiences and motivations of librarians (n=58) in using social media and whether students (n=498) are willing to engage with the library in this manner and why. Our findings confirm that libraries in the sector are indeed struggling to foster interest in their social media activities and go some way to understanding why this is so, leading to a number of conclusions and recommendations for practitioners