51,473 research outputs found

    The structure and magnetism of graphone

    Full text link
    Graphone is a half-hydrogenated graphene. The structure of graphone is illustrated as trigonal adsorption of hydrogen atoms on graphene at first. However, we found the trigonal adsorption is unstable. We present an illustration in detail to explain how a trigonal adsorption geometry evolves into a rectangular adsorption geometry. We check the change of magnetism during the evolution of geometry by evaluating the spin polarization of the intermediate geometries. We prove and clarify that the rectangular adsorption of hydrogen atoms on graphene is the most stable geometry of graphone and graphone is actually antiferromagnetic.Comment: 11 pages, 4 figure

    An identity of hitting times and its application to the valuation of guaranteed minimum withdrawal benefit

    Full text link
    In this paper we explore an identity in distribution of hitting times of a finite variation process (Yor's process) and a diffusion process (geometric Brownian motion with affine drift), which arise from various applications in financial mathematics. As a result, we provide analytical solutions to the fair charge of variable annuity guaranteed minimum withdrawal benefit (GMWB) from a policyholder's point of view, which was only previously obtained in the literature by numerical methods. We also use complex inversion methods to derive analytical solutions to the fair charge of the GMWB from an insurer's point of view, which is used in the market practice, however, based on Monte Carlo simulations. Despite of their seemingly different formulations, we can prove under certain assumptions the two pricing approaches are equivalent.Comment: 25 pages, 2 figure

    On the explicit finite element formulation of the dynamic contact problem of hyperelastic membranes

    Get PDF
    Contact-impact problems involving finite deformation axisymmetric membranes are solved by the finite element method with explicit time integration. The formulation of the membrane element and the contact constraint conditions are discussed. The hyperelastic, compressible Blatz and Ko material is used to model the material properties of the membrane. Two example problems are presented

    Heuristic algorithms for the min-max edge 2-coloring problem

    Full text link
    In multi-channel Wireless Mesh Networks (WMN), each node is able to use multiple non-overlapping frequency channels. Raniwala et al. (MC2R 2004, INFOCOM 2005) propose and study several such architectures in which a computer can have multiple network interface cards. These architectures are modeled as a graph problem named \emph{maximum edge qq-coloring} and studied in several papers by Feng et. al (TAMC 2007), Adamaszek and Popa (ISAAC 2010, JDA 2016). Later on Larjomaa and Popa (IWOCA 2014, JGAA 2015) define and study an alternative variant, named the \emph{min-max edge qq-coloring}. The above mentioned graph problems, namely the maximum edge qq-coloring and the min-max edge qq-coloring are studied mainly from the theoretical perspective. In this paper, we study the min-max edge 2-coloring problem from a practical perspective. More precisely, we introduce, implement and test four heuristic approximation algorithms for the min-max edge 22-coloring problem. These algorithms are based on a \emph{Breadth First Search} (BFS)-based heuristic and on \emph{local search} methods like basic \emph{hill climbing}, \emph{simulated annealing} and \emph{tabu search} techniques, respectively. Although several algorithms for particular graph classes were proposed by Larjomaa and Popa (e.g., trees, planar graphs, cliques, bi-cliques, hypergraphs), we design the first algorithms for general graphs. We study and compare the running data for all algorithms on Unit Disk Graphs, as well as some graphs from the DIMACS vertex coloring benchmark dataset.Comment: This is a post-peer-review, pre-copyedit version of an article published in International Computing and Combinatorics Conference (COCOON'18). The final authenticated version is available online at: http://www.doi.org/10.1007/978-3-319-94776-1_5