Comedias de Don Antonio de Zamora...

Contiene: Todo lo vence el amor (pp. 1-47) ; Mazariegos y Monsalves (pp. 48-98) ; El hechizado por fuerza (pp. 99-144) ; El custodio de la Ungría San Juan Capistrano (pp. 145-194) ; La Poncella de Orleans (pp. 195-242) ; Áspides ay basiliscos (Zarzuela) (pp. 243-276) ; Judas Iscariote (pp. 277-327) ; Por oir Missa y dar cebada, nunca se perdió jornada (pp. 328-379) ; Siempre ay que embidiar amando (pp. 380-439)

Comedias de Don Antonio de Zamora...

Contiene: Amar es saber vencer, y el arte contra el poder (pp. 1-56) ; Viento es la dicha de amor (Zarzuela música) (pp. 57-94) ; Duendes son alcahuetes, y el espíritu Foleto (pp. 95-152) ; Duendes son alcahuetes, alias el Foleto (Segunda parte) (pp. 153-207) ; El luzero de Madrid, y divino labrador, san Isidro Labrador (pp. 208-266) ; No ay deuda que no se pague, y combidado de piedra (pp. 267-322) ; Cada uno es linage aparte, y los Mazas de Aragón (pp. 323-[377]) ; Ser fino y no parecerlo (pp. [378-430])

Comedias escojidas [sic] de Don Antonio de Zamora.

Mode of access: Internet.

Socialismo y literatura en la Argentina

La campaña ideológica de la Editorial Claridad se encuadra dentro del movimiento socialista que se desarrolló en la Argentina en el panorama de las primeras décadas del siglo XX. Este estudio está centrado en Los Pensadores (Primera Epoca 1922-1924), y en la revista del mismo nombre, cuyo subtítulo era Revista de selección ilustrada, arte, crítica y literatura. Suplemento de Editorial Claridad (Segunda Epoca 1924-1926). Los tres ejes sobre los cuales se articula el proyecto editorial son la literatura, el escritor y el público, en el marco de la tradición de lecturas. Se trataba de una publicación dedicada a la literatura, artes plásticas, filosofía, ideas, historia, política, sindicalismo y comentarios sociales, con artículos originales y traducciones especiales. El hecho de elegir una revista como tema de investigación, responde a nuestro propósito de vincular la actividad política con un aspecto de la vida cultural argentina en el siglo XX. Esta publicación ofreció a escritores argentinos y americanos la oportunidad de expresar sus ideas en forma de comentarios, noticias y críticas, o bien en cuentos, poemas y ensayos.

Claridad y la construcción de una izquierda americana

Fil: Ferreira de Cassone, Florencia. Universidad Nacional de Cuyo. Facultad de Ciencias Políticas y Sociales

An hybrid parallel algorithm for solving tridiagonal linear systems versus the Wang’s method in a Cray T3D BSP computer

In this paper we describe an hybrid algorithm for an even number of processors based on an algorithm for two processors and the Overlapping Partition Method for tridiagonal systems. Moreover, we compare this hybrid method with the Partition Wang’s method in a BSP computer. Finally, we compare the theoretical computation cost of both methods for a Cray T3D computer, using the cost model that BSP model provides.

Sequential and parallel synchronous alternating iterative methods

The so-called parallel multisplitting nonstationary iterative Model A was introduced by Bru, Elsner, and Neumann [Linear Algebra and its Applications 103:175-192 (1988)] for solving a nonsingular linear system Ax = b using a weak nonnegative multisplitting of the first type. In this paper new results are introduced when A is a monotone matrix using a weak nonnegative multisplitting of the second type and when A is a symmetric positive definite matrix using a P -regular multisplitting. Also, nonstationary alternating iterative methods are studied. Finally, combining Model A and alternating iterative methods, two new models of parallel multisplitting nonstationary iterations are introduced. When matrix A is monotone and the multisplittings are weak nonnegative of the first or of the second type, both models lead to convergent schemes. Also, when matrix A is symmetric positive definite and the multisplittings are P -regular, the schemes are also convergent.

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.

An integral security kernel

As the user base of the Internet has grown tremendously, the need for secure services has increased accordingly. Most secure protocols, in digital business and other fields, use a combination of symmetric and asymmetric cryptography, random generators and hash functions in order to achieve confidentiality, integrity, and authentication. Our proposal is an integral security kernel based on a powerful mathematical scheme from which all of these cryptographic facilities can be derived. The kernel requires very little resources and has the flexibility of being able to trade off speed, memory or security; therefore, it can be efficiently implemented in a wide spectrum of platforms and applications, either software, hardware or low cost devices. Additionally, the primitives are comparable in security and speed to well known standards.

A system to communicate hidden information using color images

The objective of this paper is to present a system to communicate hidden information among different users by means of images. The tasks that the system is able to carry on can be divided in two different groups of utilities, implemented in java. The first group of utilities are related with the possibility to hide information in color images, using a steganographic function based on the least significant bit (LSB) methods. The second group of utilities allows us to communicate with other users with the aim to send or receive images, where some information have been previously embedded. Thus, this is the most significant characteristic of the implementation, we have built an environment where we join the email capabilities to send and receive text and images as attached files, with the main objective of hiding information.

An exercises editor for an e-learning environment

One of the most important tenets of e-learning is that it bridges work and learning. A great e-learning experience brings learning into the work environment. This is a key point, the capacity to construct a work environment when the student can develop proper tasks to complete the learning process. This paper describes a work environment based on the development of two tools, an exercises editor and an exercises viewer. Both tools are able to manage color images where, because of the implementation of basic steganographic techniques, it is possible to add information, exercises, questions, and so on. The exercises editor allows to decide which information must be visible or remain hidden to the user, when the image is loaded in the exercises viewer. Therefore, it is possible to hide the solutions of the proposed tasks; this is very useful to complete a self-evaluation learning process. These tools constitute a learning architecture with the final objective that learners can apply and practice new concepts or skills.

A public key cryptosystem based on block upper triangular matrices

We propose a public key cryptosystem based on block upper triangular matrices. This system is a variant of the Discrete Logarithm Problem with elements in a finite group, capable of increasing the difficulty of the problem while maintaining the key size. We also propose a key exchange protocol that guarantees that both parties share a secret element of this group and a digital signature scheme that provides data authenticity and integrity.

A viability analysis of a secure VoIP and instant messaging system on a Pocket PC platform

We propose a secure full-duplex VoIP and instant messaging system on a Pocket PC platform, allowing for session key transport using a public-key protocol and encrypted text or voice communication using a private-key algorithm. The full-duplex VoIP scheme presents good performance for long duration communication over LAN networks.

Lightweight peer-to-peer secure multi-party VoIP protocol

Multi-party voice-over-IP (MVoIP) services provide economical and convenient group communication mechanisms for many emerging applications such as distance collaboration systems, on-line meetings and Internet gaming. In this paper, we present a light peer-to-peer (P2P) protocol to provide MVoIP services on small platforms like mobile phones and PDAs. Unlike other proposals, our solution is fully distributed and self-organizing without requiring specialized servers or IP multicast support.

Fast pseudorandom generator based on packed matrices

Pseudorandom generators are a basic foundation of many cryptographic services and information security protocols. We propose a modification of a previously published matricial pseudorandom generator that significantly improves performance and security. The resulting generator is successfully compared to world class standards.