The Aristarchus Proyect on line (www.aristarchus.it) : Electronic Tools for Classical Philology

El artículo está destinado a subrayar el proyecto ARISTARCUS, un conjunto de herramientas de trabajo para la investigación y la enseñanza en temas del área de mundo antiguo Griego y Latino y está disponible en el sitio web www.aristarchus.unige.it. Ha sido llevado a cabo por el grupo de investigación del Dipartimento di Archeologia e Filologia Classica (DARFICLET) de la Universidad de Génova, dirigido por el Profesor Franco Montanari. El sitio web incluye cinco ítems: 1) LGGA - Léxico de los Gramáticos Griegos Antiguos; 2) PAWAG - Palabras escasamente atestadas en Griego Antiguo; 3) CPhCl - Catalogus Philologorum Classicorum; 4) CIAPh - Centro Italiano de l'Année Philologique; 5) Mediaclassica, un conjunto de herramientas para la enseñanza de Griego y Latín.

Savitri y Orfeo : La argumentación en la lógica india y en la retórica clásica

Los mitos de Savitri (Mahabharata 3.293-299) y Orfeo (Ovidio. Metamorfosis 10.1-85), pertenecientes al ámbito cultural indoeur opeo, presentan algunos puntos en común: narran la historia del amante que rescata a su ser amado de la muerte, y combinan el encuentro con los dioses de la muerte y el discurso mediante el poder de la palabra. En esta propuesta, se analizan los discursos de los protagonistas a partir de las convenciones propias de cada contexto de enunciación. Para el caso indio, se sigue el modelo lógico de la escuela Nyaya; para el greco-latino, el de la retórica clásica. De este modo, sobre la base de la estructura argumentativa del silogismo aristotélico, se plantean dos variaciones, respectivamente, el silogismo hindú y el silogismo retórico. Se trata de dos aproximaciones argumentativas con métodos distintos pero con un mismo fin: (con)vencer al oponente

De la identidad a las intersubjetividades en la comunicación mundo : Elementos para el debate

El documento tiene como pretensión, en un primer momento, establecer líneas de diferenciación entre la ciencia clásica y la ciencia contemporánea, develando las lógicas convencionales de la razón positiva y sus dinámicas instrumentales, que no favorecen los espacios para la comprensión ni el reconocimiento de la misma comprensión (preocupada, ciertamente, por la hiperespecialización y la binarización de la cotidianidad).

Savitri y Orfeo : La argumentación en la lógica india y en la retórica clásica

Los mitos de Savitri (Mahabharata 3.293-299) y Orfeo (Ovidio. Metamorfosis 10.1-85), pertenecientes al ámbito cultural indoeur opeo, presentan algunos puntos en común: narran la historia del amante que rescata a su ser amado de la muerte, y combinan el encuentro con los dioses de la muerte y el discurso mediante el poder de la palabra. En esta propuesta, se analizan los discursos de los protagonistas a partir de las convenciones propias de cada contexto de enunciación. Para el caso indio, se sigue el modelo lógico de la escuela Nyaya; para el greco-latino, el de la retórica clásica. De este modo, sobre la base de la estructura argumentativa del silogismo aristotélico, se plantean dos variaciones, respectivamente, el silogismo hindú y el silogismo retórico. Se trata de dos aproximaciones argumentativas con métodos distintos pero con un mismo fin: (con)vencer al oponente

The Aristarchus Proyect on line (www.aristarchus.it) : Electronic Tools for Classical Philology

El artículo está destinado a subrayar el proyecto ARISTARCUS, un conjunto de herramientas de trabajo para la investigación y la enseñanza en temas del área de mundo antiguo Griego y Latino y está disponible en el sitio web www.aristarchus.unige.it. Ha sido llevado a cabo por el grupo de investigación del Dipartimento di Archeologia e Filologia Classica (DARFICLET) de la Universidad de Génova, dirigido por el Profesor Franco Montanari. El sitio web incluye cinco ítems: 1) LGGA - Léxico de los Gramáticos Griegos Antiguos; 2) PAWAG - Palabras escasamente atestadas en Griego Antiguo; 3) CPhCl - Catalogus Philologorum Classicorum; 4) CIAPh - Centro Italiano de l'Année Philologique; 5) Mediaclassica, un conjunto de herramientas para la enseñanza de Griego y Latín.

Offshore stereo measurements of gravity waves: classical epipolar and novel variational techniques

Stereo video techniques are effective for estimating the space-time wave dynamics over an area of the ocean. Indeed, a stereo camera view allows retrieval of both spatial and temporal data whose statistical content is richer than that of time series data retrieved from point wave probes. Classical epipolar techniques and modern variational methods are reviewed to reconstruct the sea surface from the stereo pairs sequentially in time. Current improvements of the variational methods are presented.

Exploring the logic of mobile search

After more than a decade of development work and hopes, the usage of mobile Internet has finally taken off. Now, we are witnessing the first signs of evidence of what might become the explosion of mobile content and applications that will be shaping the (mobile) Internet of the future. Similar to the wired Internet, search will become very relevant for the usage of mobile Internet. Current research on mobile search has applied a limited set of methodologies and has also generated a narrow outcome of meaningful results. This article covers new ground, exploring the use and visions of mobile search with a users' interview-based qualitative study. Its main conclusion builds upon the hypothesis that mobile search is sensitive to a mobile logic different than today's one. First, (advanced) users ask for accessing with their mobile devices the entire Internet, rather than subsections of it. Second, success is based on new added-value applications that exploit unique mobile functionalities. The authors interpret that such mobile logic involves fundamentally the use of personalised and context-based services.

A Precharge-Absorbed DPL Logic for Reducing Early Propagation Effects on FPGA Implementations

In this paper, a new countermeasure against power and electromagnetic (EM) Side Channel Attacks (SCA) on FPGA implemented cryptographic algorithms is proposed. This structure mainly focuses on a critical vulnerability, Early Evaluation, also known as Early Propagation Effect (EPE), which exists in most conventional SCA-hardened DPL (Dual-rail with Precharge Logic) solutions. The main merit of this proposal is that the EPE can be effectively prevented by using a synchronized non regular precharge network, which maintains identical routing between the original and mirror parts, where costs and design complexity compared with previous EPE-resistant countermeasures are reduced, while security level is not sacrificed. Another advantage for our Precharge Absorbed(PA) - DPL method is that its Dual-Core style (independent architecture for true and false parts) could be generated using partial reconfiguration. This helps to get a dynamic security protection with better energy planning. That means system only keeps the true part which fulfills the normal en/decryption task in low security level, and reconfigures the false parts once high security level is required. A relatively limited clock speed is a compromise, since signal propagation is restricted to a portion of the clock period. In this paper, we explain the principles of PA-DPL and provide the guidelines to design this structure. We experimentally validate our methods in a minimized AES co-processor on Xilinx Virtex-5 board using electromagnetic (EM) attacks.

Light and Logic

Publicación de la Sede del Consejo Consultor de Castilla y León en Zamora en la revista de arquitectura IA&B (Mumbai). El proyecto de Zamora se centra en el diálogo entre una pieza cristina de vidrio y el grueso muro de piedra perimetral. Estas dos fachadas entran en relación gracias a un patio perimetral que tensa el contacto entre entre el vidrio y la piedra. Se hace especial mención de la estricta precisión y racionalidad del proyecto. La publicación contiene textos, dibujos planimétricos, fotografías y materiales del proceso de investigación en el proyecto (croquis y fotografías de maquetas).

Automatic Inference of Determinacy and Mutual Exclusion for Logic Programs Using Mode and Type Analyses

We propose an analysis for detecting procedures and goals that are deterministic (i.e., that produce at most one solution at most once),or predicates whose clause tests are mutually exclusive (which implies that at most one of their clauses will succeed) even if they are not deterministic. The analysis takes advantage of the pruning operator in order to improve the detection of mutual exclusion and determinacy. It also supports arithmetic equations and disequations, as well as equations and disequations on terms,for which we give a complete satisfiability testing algorithm, w.r.t. available type information. Information about determinacy can be used for program debugging and optimization, resource consumption and granularity control, abstraction carrying code, etc. We have implemented the analysis and integrated it in the CiaoPP system, which also infers automatically the mode and type information that our analysis takes as input. Experiments performed on this implementation show that the analysis is fairly accurate and efficient.

Parallelizing irregular and pointer-based computations automatically: perspectives from logic and constraint programming

Irregular computations pose sorne of the most interesting and challenging problems in automatic parallelization. Irregularity appears in certain kinds of numerical problems and is pervasive in symbolic applications. Such computations often use dynamic data structures, which make heavy use of pointers. This complicates all the steps of a parallelizing compiler, from independence detection to task partitioning and placement. Starting in the mid 80s there has been significant progress in the development of parallelizing compilers for logic pro­gramming (and more recently, constraint programming) resulting in quite capable paralle­lizers. The typical applications of these paradigms frequently involve irregular computations, and make heavy use of dynamic data structures with pointers, since logical variables represent in practice a well-behaved form of pointers. This arguably makes the techniques used in these compilers potentially interesting. In this paper, we introduce in a tutoríal way, sorne of the problems faced by parallelizing compilers for logic and constraint programs and provide pointers to sorne of the significant progress made in the area. In particular, this work has resulted in a series of achievements in the areas of inter-procedural pointer aliasing analysis for independence detection, cost models and cost analysis, cactus-stack memory management, techniques for managing speculative and irregular computations through task granularity control and dynamic task allocation such as work-stealing schedulers), etc.

A methodology for granularity-based control of parallelism in logic programs

Several types of parallelism can be exploited in logic programs while preserving correctness and efficiency, i.e. ensuring that the parallel execution obtains the same results as the sequential one and the amount of work performed is not greater. However, such results do not take into account a number of overheads which appear in practice, such as process creation and scheduling, which can induce a slow-down, or, at least, limit speedup, if they are not controlled in some way. This paper describes a methodology whereby the granularity of parallel tasks, i.e. the work available under them, is efficiently estimated and used to limit parallelism so that the effect of such overheads is controlled. The run-time overhead associated with the approach is usually quite small, since as much work is done at compile time as possible. Also,a number of run-time optimizations are proposed. Moreover, a static analysis of the overhead associated with the granularity control process is performed in order to decide its convenience. The performance improvements resulting from the incorporation of grain size control are shown to be quite good, specially for systems with medium to large parallel execution overheads.