The objective of the current study was to determine the effect of the dietary inclusion of liquid-fermented potato hash with or without exogenous enzyme on fermentation characteristics and carcass characteristics of pigs. Forty-two crossbred, male pigs (Large White × Landrace) aged 55 d with an average body weight of 25.5 ± 3 kg (mean ± standard deviation) were selected. Six pigs were randomly allocated to seven experimental dietary treatments. The dietary treatments included dry standard feed; liquid-fermented standard feed; liquid-fermented potato hash, 200 g/kg (as fed), with and without exogenous enzymes; and liquid-fermented potato hash, 400 g/kg (as fed), with and without exogenous enzymes. The back-slopping fermentation approach was followed to prepare experimental diets. Diets were formulated to provide 14 MJ/kg digestible energy (DE), 180 g crude protein (CP)/kg and 11.6 g lysine /kg. Lactic acid bacteria (LAB), Enterobacteriaceae, yeast, moulds, and Escherichia coli in the liquid-fermented diet with or without potato hash were influenced by the addition of enzymes. An effect of diet and enzymes was observed on lactic acid and water-soluble carbohydrates. The low and high liquid-fermented potato hash diets without enzymes had a higher pH than the low and high liquid-fermented potato hash diets with enzymes after 8 and 24 hr. Fermented potato hash with or without enzymes led to high drip loss and lean percentage. Carcass traits improved in pigs fed less liquid-fermented potato hash with or without enzymes.

RESUMEN La seguridad de imágenes médicas está incrementando su importancia para preservar la integridad y la confidencialidad de la información (datos médicos), frente a usuarios malintencionados dada su importancia en el diagnóstico oportuno y acertado. En este contexto, se han desarrollado varias técnicas para proteger las imágenes médicas, como el cifrado, la ocultación de datos, el etiquetado de imágenes, la aplicación de algoritmos Hash, etc. Este trabajo propone una técnica para cifrar imágenes médicas añadiendo los metadatos dentro de una imagen de cubierta, basada en la criptografía visual extendida, así como la inclusión de una función tipo Hash para comprobar la integridad de la imagen y los metadatos una vez estos sean recuperados. El método propuesto en este trabajo se implementa utilizando imágenes médicas con una resolución en escala de grises de [0,4095] es decir una profundidad de 12 bits/ píxel e imágenes en color con 24 bits/píxel de profundidad. Los resultados experimentales demuestran la eficacia del método propuesto en la tarea de transmisión segura de imágenes médicas permitiendo una mayor capacidad de ocultamiento, una menor distorsión en la calidad visual de la imagen con los datos médicos ocultos, así como un medio para comprobar la integridad de los datos enviados, en comparación con los artículos publicados.

ABSTRACT Medical image security is acquiring its importance to preserve the integrity and confidentiality of information (medical data) from malicious users given its importance in timely and successful diagnosis. In this context, several techniques have been developed to protect medical images, such as encryption, data hiding, image tagging, application of Hash algorithms, etc. This paper proposes a technique to cipher medical images by adding the metadata inside a cover image, based on extended visual cryptography as well as the inclusion of a Hash-like function to verify the integrity of the image and the metadata once they are recovered. The method proposed in this work is implemented using medical images with a grayscale resolution of [0,4095] that is a depth of 12 bits/pixel and color images with 24 bits/pixel depth. Experimental results prove the effectiveness of the proposed method in the task of secure exchange of medical images by allowing higher hiding capability, lower distortion in the visual quality of the image with the hidden medical data, as well as a means to verify the integrity of the sent data, compared to state-of-the-art.

Resumen Se propone un método basado en la distancia de Hellinger y la función de densidad de probabilidad de señales (Photo Response Non-Uniformity [PRNU]) para identificar el dispositivo de captura de imágenes digitales. El método asocia una imagen digital no modificada (imagen en disputa) con uno de un conjunto de dispositivos de captura candidatos, al comparar la huella digital insertada en la imagen en disputa contra la base de datos creada con las huellas digitales de los dispositivos de captura. El método propuesto se implementó en MatlabTM para demostrar su funcionamiento, luego se comparó en un caso de estudio controlado contra dos métodos diferentes: uno propuesto por Goljan et al. (2009) con un porcentaje de similitud promedio del 100% y el otro por Quintanar-Reséndiz et al. (2021) con el 99.35%, y para el método propuesto resultó ser de 97.68%.

Abstract A method based on Hellinger distance and Photo Response Non-Uniformity (PRNU) signal probability density function is proposed to identify the digital image capture device. The method is applied to an unmanipulated digital image (disputed image) and allows to associate it with one of a set of candidates capture devices. This association is performed through the fingerprint imprinted by the capturing device on the disputed image, then this imprinted fingerprint is compared with the fingerprint of each capturing device. The proposed method was implemented in MatlabTM to show its performance and compared against two different methods. The first method, proposed by Goljan et al. (2009), reached a mean similarity percentage of 100%, and the second method, proposed by Quintanar-Reséndiz et al. (2021), reached 99.35%; and the method proposed here reached a mean similarity percentage of 97.68%.

Abstract: The article analyzes the authenticity of Whatsapp messages as evidence in the judicial process of divorce cases and their impact on the protection of the principle of due process in Colombia. The study is based on a socio-legal approach and information collection techniques such as document review, focus group, interview with experts and non-participant observation are used. The results show that the ease of modifying Whatsapp messages, even without the greatest technical knowledge through free applications, generates the need to thoroughly review the authenticity of the messages, to avoid disregarding the principle of due process; being the hash code a factor that contributes to guaranteeing the authenticity of the digital proof and therefore, it must be implemented in divorce cases.

Resumen: El artículo analiza la autenticidad de los mensajes de Whatsapp como prueba en el proceso judicial en los casos de divorcio y su incidencia en la protección del principio del debido proceso en Colombia. El estudio se sustenta en un enfoque sociojurídico y utiliza técnicas de recolección de información como la revisión documental, el grupo focal, la entrevista a expertos y la observación no participante. En los resultados se evidencia que la facilidad para modificar mensajes de Whatsapp, aun sin los mayores conocimientos técnicos, por medio de aplicaciones gratuitas, genera la necesidad de revisar la autenticidad de los mensajes, para evitar desconocer el principio del debido proceso. El código hash sería un factor que contribuye a garantizar la autenticidad de la prueba digital y, por lo tanto, debe ser implementado en los casos de divorcios.

The usefulness of a uniform resource locator (URL) on the World Wide Web is reliant on the resource being hosted at the same URL in perpetuity. When URLs are altered or removed, this results in the resource, such as an image or document, being inaccessible. While web-archiving projects seek to prevent such a loss of online resources, providing complete backups of the web remains a formidable challenge. This article outlines the initial development and testing of a decentralised application (DApp), provisionally named Repudiation Chain, as a potential tool to help address these challenges presented by shifting URLs and uncertain web-archiving. Repudiation Chain seeks to make use of a blockchain smart contract mechanism in order to allow individual users to contribute to web-archiving. Repudiation Chain aims to offer unalterable assurance that a specific file and its URL existed at a given point in time-by generating a compact, non-reversible representation of the file at the time of its non-repudiation. If widely adopted, such a tool could contribute to decentralisation and democratisation of web-archiving.

Abstract Security warranties of the RSA-type digital signatures are based on two main hypothesis: First, in the assumption that factoring gigantic integer numbers is a computationally unfeasible problem. Second, in the assumption that hash functions produce a unique digest for any digital document. With these two hypothesis in mind, in the last decades in México, and also in other countries, legislation has been enacted to legalize digital signatures. In México, the combination of the RSA algorithm and the SHA-1 hash function can be used to legally validate digital contracts. This selection of algorithms is known as the RSA-SHA-1 digital signature. However, recently the SHA-1 hash function has suffered a falsification attack in which, given an arbitrary document for which the SHA-1 digest was produced, it is possible to generate a second document with the same digest. In other words, this attack permits to find arbitrary pairs of documents that share the same digest. This situation has provoked that the RSA-SHA-1 algorithm used to sign legal contracts is on risk to be broken. In this article, some of the repercussions in the information security of the legal documents signed with this protocol are discussed. We also discuss some countermeasures that can mitigate this vulnerability.

Resumen Las garantías de seguridad de las firmas digitales tipo RSA están basadas en dos hipótesis principales: La primera, en el supuesto de que la factorización de números enteros gigantescos es un problema computacionalmente difícil; La segunda, en el supuesto de que las funciones picadillo producen un digesto único para cualquier documento digital a firmar. Bajo estas hipótesis en las últimas décadas en México y en otros países, se han promulgado leyes que estipulan el uso de firmas digitales conformadas por la combinación del algoritmo RSA y la función picadillo SHA-1. Esta selección de algoritmos es conocida como la firma digital RSA-SHA-1. Dichas firmas digitales pueden utilizarse para validar contratos digitales de manera legal. Sin embargo, recientemente, la función picadillo SHA-1 ha sufrido un ataque de falsificación en el que dado un documento arbitrario y su digesto SHA-1, es posible generar un segundo documento con el mismo digesto. En otras palabras, el ataque permite encontrar parejas arbitrarias de documentos que comparten el mismo digesto. Esta situación ha provocado que el protocolo RSA-SHA-1, este en riesgo. En este artículo, discutimos algunas de las repercusiones en la seguridad de la información de los documentos legales firmados mediante este esquema. También se presentan algunas contramedidas para mitigar esta vulnerabilidad.

Abstract In this work we have developed a digital signature protocol using hash functions that once implemented on mobile devices have demonstrated to be secure and efficient. It has been incorporated a model for a Certification Authority to exchange public keys between users. This work constitutes an experimental research, which bears a certain resemblance to theoretical research, but is not intended to propose a new theory, but to establish the behavior of a system to know its characteristics, in order to improve its knowledge and/or its performance.The hash signature system was tested on mobile communication devices. The experimental results show that the hash signature improves the efficiency to generate the cryptographic keys and the signing and verification processes when compared to ECC. Likewise, when generating 2048 keys, the hash signature is faster than RSA. In addition, the larger RSA keys consume a significative time, while the hash does not require to increase the size of the keys. Although we have not included here a formal analysis about the protocol, we highlight some points that improve the security of the proposed protocol. Finally, this work constitutes a new approach to public key cryptography based on hash functions that could be used to make digital signatures in electronic commerce. This method is suitable for mobile network devices due to the high speed and low hardware requirements of the hash functions. The method described here, which is compatible with hash functions, belongs to the field of post-quantum cryptography. The security of the method is based on the security of the hash cryptography, which is widely known and discussed.

Resumen En este trabajo se ha desarrollado un protocolo de firma digital utilizando funciones hash que demuestra que es seguro, eficiente y adecuado para operar en dispositivos móviles. Además, se desarrolló el modelo de una Autoridad Certificadora para el intercambio seguro y eficiente de llaves públicas. El método que se utilizó fue la investigación experimental, que tiene cierta semejanza con la investigación teórica, pero no tiene por objeto plantear una teoría nueva, sino establecer el comportamiento de un sistema para conocer sus características, a fin de mejorar su conocimiento y su rendimiento. El sistema de firma hash fue implementado en dispositivos móviles. Los resultados experimentales demuestran que la firma hash mejora la eficiencia para generar las claves y los procesos de firma y verificación cuando se compara a ECC. Asimismo, al generar 2048 claves la firma hash es más rápida que RSA. Además, las claves RSA más grandes consumen mucho tiempo, mientras que el sistema hash no requiere aumentar el tamaño de las claves. Aunque no se ha incluido un análisis formal sobre la seguridad del protocolo, se destacan algunos puntos que mejoran la seguridad del protocolo propuesto. Finalmente, este trabajo constituye un nuevo enfoque para la criptografía de llave pública basada en funciones hash que podrían aprovecharse para realizar firmas digitales en comercio electrónico. Este método es adecuado para dispositivos de red móvil debido a la velocidad y los requisitos de hardware de las funciones hash. El método descrito aquí, el cual es compatible con las funciones hash, pertenece al campo de la criptografía post-cuántica. La seguridad del método se basa en la seguridad de la criptografía hash, la cual es ampliamente conocida y discutida.

Resumen: El presente artículo se propone analizar la dinámica comunicacional de generación, circulación y reproducción del pensamiento social en una red social digital, en el marco del fenómeno de ocupación de las escuelas del estado de Río de Janeiro por parte de los estudiantes de secundaria, ocurrido en el primer semestre de 2016. Fueron seleccionadas, según criterios de interacción digital, 250 publicaciones provenientes de las páginas de Facebook de 35 escuelas ocupadas. Dichas publicaciones fueron sometidas a un análisis de contenido categorial que tuvo en cuenta tanto la tipología del formato del mensaje emitido (post simple, artículo periodístico, fotografía, video editado, video espontáneo, póster y gif), como su fuente empírica de producción (escrita, hablada o imagénica). A partir de la descripción de la intención comunicativa de los formatos y de la comparación global de las unidades de registro por categoría fue posible establecer tres vectores de análisis que permitieron a) inferir la prevalencia del pensamiento social sobre el pensamiento científico-racional; b) evidenciar la forma como las condiciones de producción del pensamiento social (formalismo espontáneo, dualismo causal, primacía de la conclusión y creación de analogía) inciden en la construcción colaborativa de las narrativas digitales; y c) considerar la posible existencia de una representación social de la ocupación asociada a etiquetas movilizadoras con un alto contenido afectivo como lucha, resistencia y conquista.

Abstract: This paper aims to explain the communication dynamics of generation, circulation and reproduction of social thought in a digital social network, in the context of the phenomenon of occupation of schools by high school students in Rio de Janeiro, which took place in the first semester of 2016. According to digital interaction criteria, 250 posts were chosen from the Facebook pages of 35 occupied schools, which were studied by means of a content analysis that took into account both the format of the emitted message (textual post, journalistic article, photography, edited video, phone cell video, poster and gif), as well as its empirical production source (written, spoken or image). From the description of the communicative intention of the formats and the global comparison of the registration units, it was possible to a) infer the prevalence of social thought instead of the rational-scientific thinking; b) demonstrate the way in which the conditions of production of social thought (spontaneous formalism, causal dualism, primacy of the conclusion and creation of analogy) affect the collaborative construction of digital narratives; and c) take into account the possible existence of a social representation of occupation associated to mobilizing hash tags with a high affective content such as struggle, resistance and conquest.

Resumo: O presente artigo visa analisar a dinâmica comunicacional de geração, circulação e reprodução do pensamento social em uma rede social digital, no quadro do fenômeno de ocupação das escolas estaduais do Rio de Janeiro por parte dos estudantes secundaristas, acontecidas no primeiro semestre de 2016. Foram selecionadas, segundo critérios de interação digital, 250 postagens das páginas do Facebook de 35 escolas ocupadas. As postagens foram submetidas a uma análise de conteúdo levando em consideração tanto a tipologia da mensagem emitida (post, artigo jornalístico, fotografia, vídeo editado, vídeo espontâneo, cartaz e gif) quanto a sua fonte empírica de produção (escrita, falada e imagética). A partir da descrição da intenção comunicativa dos formatos e da comparação global das unidades de registro por categoria, foi possível definir três vetores de análise que permitiram a) inferir a prevalência do pensamento social sobre o pensamento científico-racional; b) evidenciar a forma como as condições de produção do pensamento social (formalismo espontâneo, dualismo causal, primazia da conclusão e criação de analogia) incidem na construção colaborativa das narrativas digitais; e c) considerar a possível existência de uma representação social da ocupação associada a rótulos mobilizadores com um alto conteúdo afetivo como luta, resistência e conquista.

Abstract: In 2005 the Mexican National tributary system (SAT) started an ambitious public key infrastructure project with the aim of providing to each Mexican citizen a public/private key pair along with a digital certificate that was issued by SAT itself. As of March 2016, approximately a total of 17 million certificates have been issued. This e-government system permits Mexican citizens to exercise a series of digital on-line services such as: tax declaration, official receipt issuing/verification, contract signing, etc. In particular, all Mexican official invoices became digital by January 2016, effectively going paperless for this service. In this paper, we carefully analyze the Mexican PKI system showing that it has several weak points that can be attacked by malicious adversaries. We report experimental evidence showing that one can launch a simple dictionary attack on SAT's password-based authentication system. We also argue that due to the fact that the hash function SHA-1 has been recently completely broken, an attacker can produce the same signature for two different documents that will verify correctly when using any old FIEL certificate that has the RSA-1204/SHA-1 signature suite.

ABSTRACT Hash functions are a fundamental part of computer security applications such as authentication systems and digital signatures. Many of these applications require a high processing rate; therefore, it is important to explore alternatives that contribute to reduce the computation time of these functions. This paper presents a two-stage pipelined architecture for SHA3-256 hash function that supports single and multi-message processing. Each pipeline stage executes two rounds of the algorithm in one clock cycle. The proposed pipelined architecture has been implemented in Xilinx Virtex-5 and achieves a throughput 27,98 Gbps. This implementation allowed to obtain an improvement in the overall performance of the two-stage pipelined KECCAK function regarding implementations of iterative round and even other implementations multi-stage pipelined.

RESUMEN Las funciones hash son parte fundamental en aplicaciones relacionadas con seguridad informática, como los sistemas de autenticación y las firmas digitales. Muchas de estas aplicaciones requieren una alta velocidad de procesamiento, por lo que es necesario estudiar alternativas que disminuyan el tiempo de cálculo de estas funciones. Este trabajo presenta una arquitectura segmentada de dos etapas para la función hash SHA3-256 que soporta el procesamiento de uno o varios mensajes. Cada etapa ejecuta dos rondas del algoritmo en un ciclo de reloj, permitiendo un rendimiento de 27,98 Gbps en una FPGA de la familia Virtex-5 de Xilinx. Esta implementación permitió obtener una mejora en el rendimiento general de la función KeccaK pipeline de dos etapas con respecto a implementaciones de ronda iterativa e incluso de otras implementaciones pipeline multietapa.

This research investigates the Electromagnetic (EM) side channel leakage of a Raspberry Pi 2 B+. An evaluation is performed on the EM leakage as the device executes the AES-128 cryptographic algorithm contained in the libcryptoH-+ library in a threaded environment. Four multi-threaded implementations are evaluated. These implementations are Portable Operating System Interface Threads, CH-+11 threads, Threading Building Blocks, and OpenMP threads. It is demonstrated that the various thread techniques have distinct variations in frequency and shape as EM emanations are leaked from the Raspberry Pi. It is demonstrated that the AES-128 cryptographic implementation within the libcryptoH-H library on a Raspberry Pi is vulnerable to Side Channel Analysis (SCA) attacks. The cryptographic process was seen visibly within the EM spectrum and the data for this process was extracted where digital filtering techniques was applied to the signal. The resultant data was utilised in the Differential Electromagnetic Analysis (DEMA) attack and the results revealed 16 sub-keys that are required to recover the full AES-128 secret key. Based on this discovery, this research introduced a multi-threading approach with the utilisation of Secure Hash Algorithm (SHA) to serve as a software based countermeasure to mitigate SCA attacks. The proposed countermeasure known as the FRIES noise generator executed as a Daemon and generated EM noise that was able to hide the cryptographic implementations and prevent the DEMA attack and other statistical analysis.

The study was conducted to evaluate the effects of adding a fibrolytic enzyme in combination with bacterial inoculants on the fermentation, chemical composition and aerobic stability of ensiled potato hash (PH). Potato hash silage (PHS) was produced by mixing 800 g PH/kg and 200g wheat bran (WB)/kg. The mixture was ensiled with either no additive or enzyme Celluclast (low or high dose) or bacterial inoculants (Emsilage and Silosolve). These treatment combinations were produced: i) no additive (control); ii) Celluclast low dose (CLD); iii) Celluclast high dose (CHD); iv) Emsilage (EMS); v) CLD + EMS; vi) CHD + EMS; vii) Silosolve (SLS); viii) CLD + SLS; and ix) CHD + SLS. These treatments were ensiled in 81 x 1 L anaerobic jars for 90 days with nine replicates per treatment. Three samples per treatment were collected before ensiling and after 90 days' ensiling, were analysed for fermentation characteristics and chemical composition. In addition, samples of day 90 were subjected to an aerobic stability test, where they were exposed for five days. Enzyme addition reduced fibre, thus making more sugar available for fermentation. The combination of CHD and EMS reduced silage pH, thus preserving the silage compared with other treatment combinations. Enzyme addition (used at low and high dose), and bacterial inoculants improved fermentation. Enzyme addition improved the chemical composition, but impaired the aerobic stability of PHS. Further work to test these findings on animal performance is warranted.

The response of Windsnyer pigs to diets containing varying levels of potato hash silage in nutritionally related blood biochemistry, carcass traits and primal pork was estimated. Thirty-six growing clinically healthy male Windsnyer pigs with an initial weight of 36 kg ± 4.89 (mean ± standard deviation (SD)) were randomly assigned to six experimental diets containing 0, 80, 160, 240, 320, and 400 potato hash silage g/kg dry matter (DM). Experimental diets were derived from mixing a summit diet containing no potato hash silage and a dilution diet containing 400 g potato hash silage/kg in various proportions. Pigs were allowed ad libitum access to diets and water. There was no relationship between inclusion levels of potato hash silage and albumin: globulin ratio, total protein, and uric acid. As inclusion levels of potato hash silage varied, there was a positive linear relationship between silage and albumin concentration. Globulin concentration had a positive quadratic relationship with the inclusion of potato hash silage. Inclusion levels of potato hash silage resulted in a positive quadratic relationship in alkaline phosphatase. There was a negative linear response in warm carcass weight and cold carcass weight to inclusion levels of silage. A negative linear response was observed in dressing percentage. Different inclusion levels of potato hash silage caused a positive quadratic relationship in cooler shrink. There were negative linear relationships between inclusion of potato hash silage with shoulder fat, carcass length and backfat thickness. There was a negative linear relationship between eye muscle area and inclusion level of ensiled potato hash. There was a positive quadratic relationship between hindquarter length (HQL) and inclusion levels of silage. The observed linear relationship between hindquarter circumference (HQC) and inclusion levels of potato hash silage was negative. There is a need to predict the optimum inclusion level of potato hash silage without compromising the healthiness and carcass yield of pigs.

Resumen En este trabajo se propone una función que permite calcular un código resumen a partir de los parámetros de una señal de voz. Esta función está basada en el ordenamiento de los coeficientes espectrales en un proceso de imitación entre el espectro de la señal de voz y el espectro de una señal de ruido gaussiano generada localmente. El método de función resumen está orientado a la verificación de integridad forense en señales de voz, con un enfoque perceptual, que implica que la función resumen no cambia si la señal sufre modificaciones que no alteran el contenido (como re-cuantización), pero que si cambia ante modificaciones como recorte y adición de ruido. Se realizaron diversas pruebas para verificar el enfoque perceptual del método resumen propuesto y se compararon los resultados frente a modificaciones utilizando métodos tradicionales.

Abstract In this work we propose a function that allows to calculate a summary code from the parameters of a voice signal. This function is based on ordering of spectral coefficients obtained by means of the application of the Fast Fourier Transform (FFT), using a locally generated reference function (Gaussian random noise). The proposed method is oriented to the verification of integrity in forensic voice signals. The proposed methodology has a perceptual approach, which implies that the resulting code is maintained, even when modifications are made, particularly those that do not affect the sensitive content of the signal, such as re-quantization processes.

The article discusses the treatment of zero equivalence in an English-Slovene dictionary (ESD). The absence of equivalents in the TL is marked by two symbols: 0 (a complete absence of any equivalent) and # (equivalence at the level of the entire message rather than at word level). Sixty-five lemmata in the ESD contain a slashed zero, a hash or both, but one and the same entry can contain more than one symbol. Detailed results are presented by parts of speech of the lemmata, starting with a numerical analysis, which is followed by analysis of the content of illustrative examples. Then follows a detailed discussion of lemmata expressing pragmatic meaning in the SL, lemmata with lexico-grammatical, grammatical and lexical differences between the SL and the TL as well as lemmata with a number of SL senses included under one sense in the ESD. In the ESD, the problem of zero equivalence is mostly solved by the inclusion of translated examples of use. Another method employed in the ESD is the use of short descriptions of the function of the lemma or one of its senses. In this way, a more successful and thorough retrieval of information can be achieved with every look-up.

Die hantering van zero-ekwivalensie in 'n Engels-Sloveense woordeboek (ESD) word in hierdie artikel bespreek. Die afwesigheid van ekwivalente in die doeltaal (DT) word aangedui deur twee simbole: 0 ('n totale afwesigheid van enige ekwivalent) en # (ekwivalensie op die vlak van die volle boodskap eerder as op die vlak van 'n woord). Vyf-en-sestig lemmas in die ESD bevat 'n nul met 'n skuinsstreep daardeur, 'n hutsmerker of albei, maar een inskrywing kan meer as een simbool bevat. Die resultate word uitvoerig voorgehou volgens die woordsoort van die lemmas, en begin met 'n syferkundige ontleding, gevolg deur 'n ontleding van die inhoud van die toeligtende voorbeelde. Daarna volg 'n gedetailleerde bespreking van lemmas wat 'n pragmatiese betekenis uitdruk in die BT, lemmas met leksiko-grammatikale, grammatikale en leksikale verskille tussen die BT en die DT, sowel as lemmas met 'n aantal BT-betekenisse gegroepeer onder een betekenisonderskeiding in die ESD. Die probleem van zero-ekwivalensie word meestal in die ESD opgelos deur die insluiting van vertaalde gebruiksvoorbeelde. 'n Ander metode wat in die ESD gebruik word, is die gebruik van kort beskrywings van die lemma se funksie of van een van sy betekenisse. Op hierdie manier kan 'n meer suksesvolle en deeglike onttrekking van inligting gedoen word tydens elke opsoeksessie.