Storage of classical information in quantum spins

Digital magnetic recording is based on the storage of a bit of information in the orientation of a magnetic system with two stable ground states. Here we address two fundamental problems that arise when this is done on a quantized spin: quantum spin tunneling and backaction of the readout process. We show that fundamental differences exist between integer and semi-integer spins when it comes to both reading and recording classical information in a quantized spin. Our findings imply fundamental limits to the miniaturization of magnetic bits and are relevant to recent experiments where a spin-polarized scanning tunneling microscope reads and records a classical bit in the spin orientation of a single magnetic atom.

An algorithm to hide information in binary images

The objective of this paper is to develop a method to hide information inside a binary image. An algorithm to embed data in scanned text or figures is proposed, based on the detection of suitable pixels, which verify some conditions in order to be not detected. In broad terms, the algorithm locates those pixels placed at the contours of the figures or in those areas where some scattering of the two colors can be found. The hidden information is independent from the values of the pixels where this information is embedded. Notice that, depending on the sequence of bits to be hidden, around half of the used pixels to keep bits of data will not be modified. The other basic characteristic of the proposed scheme is that it is necessary to take into consideration the bits that are modified, in order to perform the recovering process of the information, which consists on recovering the sequence of bits placed in the proper positions. An application to banking sector is proposed for hidding some information in signatures.

A Model to Visualize Information in a Complex Streets’ Network

his paper discusses a process to graphically view and analyze information obtained from a network of urban streets, using an algorithm that establishes a ranking of importance of the nodes of the network itself. The basis of this process is to quantify the network information obtained by assigning numerical values to each node, representing numerically the information. These values are used to construct a data matrix that allows us to apply a classification algorithm of nodes in a network in order of importance. From this numerical ranking of the nodes, the process finish with the graphical visualization of the network. An example is shown to illustrate the whole process.

Practical Activities. Subject: Ecology. Undergraduate Studies in Biology and Marine Sciences. Ecology Department

Notebook of practical activities in Ecology during the 2on course of Biology career.