Transplanckian Dispersion Relation and Entanglement Entropy of Blackhole

The quantum correction to the entanglement entropy of the event horizon is plagued by the UV divergence due to the infinitely blue-shifted near horizon modes. The resolution of this UV divergence provides an excellent window to a better understanding and control of the quantum gravity effects. We claim that the key to resolve this UV puzzle is the transplanckian dispersion relation. We calculate the entanglement entropy using a very general type of transplanckian dispersion relation such that high energy modes above a certain scale are cutoff, and show that the entropy is rendered UV finite. We argue that modified dispersion relation is a generic feature of string theory, and this boundedness nature of the dispersion relation is a general consequence of the existence of a minimal distance in string theory.Comment: 7 pages. To appear in the proceedings of 36th International Symposium Ahrenshoop on the theory of Elementary Particles: Recent Developments in String/M Theory and Field Theory, Berlin, Germany, 26-30 Aug 200

Effect of non-lattice oxygen on ZrO2-based resistive switching memory

ZrO2-based resistive switching memory has attracted much attention according to its possible application in the next-generation nonvolatile memory. The Al/ZrO2/Pt resistive switching memory with bipolar resistive switching behavior is revealed in this work. The thickness of the ZrO2 film is only 20 nm. The device yield improved by the non-lattice oxygen existing in the ZrO2 film deposited at room temperature is firstly proposed. The stable resistive switching behavior and the long retention time with a large current ratio are also observed. Furthermore, it is demonstrated that the resistive switching mechanism agrees with the formation and rupture of a conductive filament in the ZrO2 film. In addition, the Al/ZrO2/Pt resistive switching memory is also possible for application in flexible electronic equipment because it can be fully fabricated at room temperature

Paxillin facilitates timely neurite initiation on soft-substrate environments by interacting with the endocytic machinery.

Neurite initiation is the first step in neuronal development and occurs spontaneously in soft tissue environments. Although the mechanisms regulating the morphology of migratory cells on rigid substrates in cell culture are widely known, how soft environments modulate neurite initiation remains elusive. Using hydrogel cultures, pharmacologic inhibition, and genetic approaches, we reveal that paxillin-linked endocytosis and adhesion are components of a bistable switch controlling neurite initiation in a substrate modulus-dependent manner. On soft substrates, most paxillin binds to endocytic factors and facilitates vesicle invagination, elevating neuritogenic Rac1 activity and expression of genes encoding the endocytic machinery. By contrast, on rigid substrates, cells develop extensive adhesions, increase RhoA activity and sequester paxillin from the endocytic machinery, thereby delaying neurite initiation. Our results highlight paxillin as a core molecule in substrate modulus-controlled morphogenesis and define a mechanism whereby neuronal cells respond to environments exhibiting varying mechanical properties

Transplanckian Entanglement Entropy

The entanglement entropy of the event horizon is known to be plagued by the UV divergence due to the infinitely blue-shifted near horizon modes. In this paper we calculate the entanglement entropy using the transplanckian dispersion relation, which has been proposed to model the quantum gravity effects. We show that, very generally, the entropy is rendered UV finite due to the suppression of high energy modes effected by the transplanckian dispersion relation.Comment: 5 pages, revtex4;v2, presentation improve

A method for computing Lucas sequences

AbstractMost of public-key cryptosystems rely on one-way functions, which can be used to encrypt and sign messages. Their encryption and signature operations are based on the computation of exponentiation. Recently, some public-key cryptosystems are proposed and based on Lucas functions, and the Lucas sequences are performed as S = V(d)modN. In this paper, we will transform the concept of addition chains for computing the exponentiation evaluations to the Lucas chains for computing the Lucas sequences. Theoretically, the shorter Lucas chain for d is generated, the less computation time for evaluating the value V(d) is required. Therefore, we proposed a heuristic algorithm for evaluating a shorter Lucas chain and then use it to compute the Lucas sequence with less modular multiplications