6,294 research outputs found

    Implementation of Particle Flow Algorithm and Muon Identification

    Full text link
    We present the implementation of the Particle Flow Algorithm and the result of the muon identification developed at the University of Iowa. We use Monte Carlo samples generated for the benchmark LOI process with the Silicon Detector design at the International Linear Collider. With the muon identification, an improved jet energy resolution, good muon efficiency and purity are achieved.Comment: 4 pages, 2 figures, lcws08 at Chicag

    Pion parameters in nuclear medium from chiral perturbation theory and virial expansion

    Full text link
    We consider two methods to find the effective parameters of the pion traversing a nuclear medium. One is the first order chiral perturbation theoretic evaluation of the pion pole contribution to the two-point function of the axial-vector current. The other is the exact, first order virial expansion of the pion self-energy. We find that, although the results of chiral perturbation theory are not valid at normal nuclear density, those from the virial expansion may be reliable at such density. The latter predicts both the mass-shift and the in-medium decay width of the pion to be small, of about a few MeV.Comment: 9 Pages RevTex, 3 eps figure

    Magnetic anisotropy, first-order-like metamagnetic transitions and large negative magnetoresistance in the single crystal of Gd2_{2}PdSi3_3

    Get PDF
    Electrical resistivity (ρ\rho), magnetoresistance (MR), magnetization, thermopower and Hall effect measurements on the single crystal Gd2_{2}PdSi3_3, crystallizing in an AlB2_2-derived hexagonal structure are reported. The well-defined minimum in ρ\rho at a temperature above N\'eel temperature (TN_N= 21 K) and large negative MR below \sim 3TN_N, reported earlier for the polycrystals, are reproducible even in single crystals. Such features are generally uncharacteristic of Gd alloys. In addition, we also found interesting features in other data, e.g., two-step first-order-like metamagnetic transitions for the magnetic field along [0001] direction. The alloy exhibits anisotropy in all these properties, though Gd is a S-state ion.Comment: RevTeX, 5 pages, 6 encapsulated postscript figures; scheduled to be published in Phy. Rev. B (01 November 1999, B1

    Spectral representation and QCD sum rules for nucleon at finite temperature

    Full text link
    We examine the problem of constructing spectral representations for two point correlation functions, needed to write down the QCD sum rules in the medium. We suggest constructing them from the Feynman diagrams for the correlation functions. As an example we use this procedure to write the QCD sum rules for the nucleon current at finite temperature

    Generating Complex Potentials with Real Eigenvalues in Supersymmetric Quantum Mechanics

    Get PDF
    In the framework of SUSYQM extended to deal with non-Hermitian Hamiltonians, we analyze three sets of complex potentials with real spectra, recently derived by a potential algebraic approach based upon the complex Lie algebra sl(2, C). This extends to the complex domain the well-known relationship between SUSYQM and potential algebras for Hermitian Hamiltonians, resulting from their common link with the factorization method and Darboux transformations. In the same framework, we also generate for the first time a pair of elliptic partner potentials of Weierstrass \wp type, one of them being real and the other imaginary and PT symmetric. The latter turns out to be quasiexactly solvable with one known eigenvalue corresponding to a bound state. When the Weierstrass function degenerates to a hyperbolic one, the imaginary potential becomes PT non-symmetric and its known eigenvalue corresponds to an unbound state.Comment: 20 pages, Latex 2e + amssym + graphics, 2 figures, accepted in Int. J. Mod. Phys.

    Fast Symbolic Algorithms for Omega-Regular Games under Strong Transition Fairness

    Get PDF
    We consider fixpoint algorithms for two-player games on graphs with ω\omega-regular winning conditions, where the environment is constrained by a strong transition fairness assumption. Strong transition fairness is a widely occurring special case of strong fairness, which requires that any execution is strongly fair with respect to a specified set of live edges: whenever the source vertex of a live edge is visited infinitely often along a play, the edge itself is traversed infinitely often along the play as well. We show that, surprisingly, strong transition fairness retains the algorithmic characteristics of the fixpoint algorithms for ω\omega-regular games -- the new algorithms can be obtained simply by replacing certain occurrences of the controllable predecessor by a new almost sure predecessor operator. For Rabin games with kk pairs, the complexity of the new algorithm is O(nk+2k!)O(n^{k+2}k!) symbolic steps, which is independent of the number of live edges in the strong transition fairness assumption. Further, we show that GR(1) specifications with strong transition fairness assumptions can be solved with a 3-nested fixpoint algorithm, same as the usual algorithm. In contrast, strong fairness necessarily requires increasing the alternation depth depending on the number of fairness assumptions. We get symbolic algorithms for (generalized) Rabin, parity and GR(1) objectives under strong transition fairness assumptions as well as a direct symbolic algorithm for qualitative winning in stochastic ω\omega-regular games that runs in O(nk+2k!)O(n^{k+2}k!) symbolic steps, improving the state of the art. Finally, we have implemented a BDD-based synthesis engine based on our algorithm. We show on a set of synthetic and real benchmarks that our algorithm is scalable, parallelizable, and outperforms previous algorithms by orders of magnitude

    A Direct Symbolic Algorithm for Solving Stochastic Rabin Games

    Get PDF

    A review of advancements in synthesis, manufacturing and properties of environment friendly biobased Polyfurfuryl Alcohol Resin and its Composites

    Get PDF
    The quest for environmentally friendly and sustainable materials in the production of fibre reinforced composite materials has led to the use of biobased materials, which are easily accessible and renewable. Biomass-derived chemicals, their derivatives, and their applications have become increasingly prevalent in various industries and processes, greatly contributing to the goal of ecological sustainability. The biobased Polyfurfuryl Alcohol (PFA) resin is one of such polymeric materials that is gaining attention for composite applications due to its endearing Fire Smoke and Toxicity properties. Derived from agricultural by products such as sugar cane bagasse, it has been known for applications within the foundry, coating, and wood industries. However, there has been a growing interest in its use for fibre reinforced composite applications. For this reason, this work intends to provide a comprehensive review of the PFA resin in relationship to fibre reinforced composites applications. The work provides an in-depth discussion on the synthesis, curing process, manufacturing, and properties of the PFA resin as well as its composites
    corecore