Suchergebnisse

Venezuela is experiencing a tragedy, which did not begin as many believe in 1999. It started earlier, in 1993 when the justice system was used to settle political debts. The bars that will read do not go that far back. They begin on the occasion of the victory of the opposition in parliamentary elections against the government in December 2015. These were written at the time and reflect to my eyes, the situation of the Venezuelan country at that time to date; in my opinion it is worse. Let each one make his own! ; Venezuela vive una tragedia, que no se inició como muchos creen en 1999. Empezó antes, en 1993 cuando se utilizó el sistema de justicia para saldar deudas políticas. Las barras que leerán no van tan atrás. Se inician con ocasión a la victoria de la oposición en las elecciones parlamentarias frente al gobierno en diciembre de 2015. Estas fueron escritas en su momento y reflejan a mis ojos, la situación del país venezolano en esa oportunidad que a la fecha; a mi juicio es peor. ¡Que cada quien haga el suyo!

Trabajo de Investigación ; El trabajo analiza las causas y consecuencias de la decisión de la oposición venezolana de abstenerse de participar en la elección parlamentaria del año 2005. Se revisa la conducta venezolana en elecciones similares desde 1958 hasta el 2005. Se concluye en el carácter meramente testimonial de dicha decisión y se proponen alternativas para superar esa condición. ; Introducción Capítulo 1. Marco metodológico y el Estado del Arte Capítulo 2. Marco Conceptual Capítulo 3. La Abstención como Concepto Capítulo 4. La Abstención Electoral en la Elección Parlamentaria Venezolana de 2005 por parte de la oposición política Capítulo 5. Los Casos del Poder Legislativo, Poder Judicial, Poder Electoral y Poder Ciudadano Conclusión y Propuesta Bibliografía Webgrafía Anexos ; Maestría ; Magister en Ciencia Política

Lempel-Ziv (LZ77 or, briefly, LZ) is one of the most effective and widely-used compressors for repetitive texts. However, the existing efficient methods computing the exact LZ parsing have to use linear or close to linear space to index the input text during the construction of the parsing, which is prohibitive for long inputs. An alternative is Relative Lempel-Ziv (RLZ), which indexes only a fixed reference sequence, whose size can be controlled. Deriving the reference sequence by sampling the text yields reasonable compression ratios for RLZ, but performance is not always competitive with that of LZ and depends heavily on the similarity of the reference to the text. In this paper we introduce ReLZ, a technique that uses RLZ as a preprocessor to approximate the LZ parsing using little memory. RLZ is first used to produce a sequence of phrases, and these are regarded as metasymbols that are input to LZ for a second-level parsing on a (most often) drastically shorter sequence. This parsing is finally translated into one on the original sequence. We analyze the new scheme and prove that, like LZ, it achieves the kth order empirical entropy compression nHk+o(nlog sigma) with k=o(log sigma n) where n is the input length and sigma is the alphabet size. In fact, we prove this entropy bound not only for ReLZ but for a wide class of LZ-like encodings. Then, we establish a lower bound on ReLZ approximation ratio showing that the number of phrases in it can be omega(logn) times larger than the number of phrases in LZ. Our experiments show that ReLZ is faster than existing alternatives to compute the (exact or approximate) LZ parsing, at the reasonable price of an approximation factor below 2.0 in all tested scenarios, and sometimes below 1.05, to the size of LZ. ; European Union (EU) 690941

19 April 2022 A Correction to this paper has been published: https://doi.org/10.1007/s42979-022-01141-w ; [Abstract] Computing the product of the (binary) adjacency matrix of a large graph with a real-valued vector is an important operation that lies at the heart of various graph analysis tasks, such as computing PageRank. In this paper, we show that some well-known webgraph and social graph compression formats are computation-friendly, in the sense that they allow boosting the computation. We focus on the compressed representations of (a) Boldi and Vigna and (b) Hernández and Navarro, and show that the product computation can be conducted in time proportional to the compressed graph size. Our experimental results show speedups of at least 2 on graphs that were compressed at least 5 times with respect to the original. ; We thank Cecilia Hernández for providing us with her software extracting the bicliques, and a helpful description in how to run it. This research has received funding from the European Union's Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie [grant agreement No 690941], namely while the first author was visiting the University of Chile, and while the second author was affiliated with the University of Helsinki and visiting the University of A Coruña. The first author was funded by Fundação para a Ciência e a Tecnologia (FCT) [grant number UIDB/50021/2020 and PTDC/CCI-BIO/29676/2017]; the second author was funded by the Academy of Finland [Grant number 268324], Fondecyt [Grant number 1171058] and NSERC [Grant number RGPIN-07185-2020]; the third author was funded by JSPS KAKENHI [grant numbers JP21K17701 and JP21H05847]; the fourth author was funded by AEI and Ministerio de Ciencia e Innovación (PGE and FEDER) [grant number PID2019-105221RB-C41] and Xunta de Galicia (co-funded with FEDER) [Grant numbers ED431C 2021/53 and ED431G 2019/01]; and the fifth author was funded by ANID – Millennium Science Initiative Program – Code ICN17_002 ; Xunta de Galicia; ED431C 2021/53 ...

Segunda parte de las cartas apologeticas contra los que desacreditan las virtudes de algunos principales filosofos, 160, [8] p., con port. y sign. propias. ; Mode of access: Internet. ; Letras capitales ornadas. ; Texto con apostillas marginales. ; Port. con orla tip. ; Sign.: [Calderón]8, A-S8, T4, A-K8, L4.