Et galleri af opdaterede og stilfulde LaTeX skabeloner, eksempler som kan hjælpe dig med at lære LaTeX, og artikler og præsentationer udgivet af vores fællesskab. Søg eller gennemse nedenfor.
A sample template to submit papers to MarXiv: the free research repository for the ocean and marine-climate sciences. Documentation for MarXiv is available at https://www.marxiv.org. The repository is located at https://osf.io/preprints/marxiv.
This template is based on the engrXiv template, accessible at https://www.overleaf.com/latex/templates/engrxiv-template/ttrnvgdkgcgy.
This document is based in the "basic article" template offered by Overleaf. It's a translation and adaptation to catalan language. can be used as initial template for documents written in catala.
(Catalan description): Aquest document és una traducció i adaptació al català del document que ofereix "Overleaf" com exemple de document bàsic. Presenta l'estructura d'un document complet i conté les comandes principals amb alguns exemples.
Maximization of muffler performance is important, but there is always space volume constraints.
Shape optimization of multi-segments Muffler coupled with the GA searching technique.
Outline:
Problem Statement
Derivation of Four Pole Matrices and an expression for STL
Introduction to GA and it's Implementation
A numerical case of noise elimination on pure tone
Results and Discussion
Computer algorithms that are written with the intent to keep data private are used in every day cryptography. These algorithms may exhibit execution time behaviour which is dependant on secret information that is not known to an outsider. When carefully analysed, this dependency may leak information that can be used to gain unintended access to private data, effectively nullifying the use of such algorithms. This threat poses a vital risk to the field of computer cryptography, and analysis should be done in attempt to eradicate this potential threat from any algorithms in modern day use.
In this paper, attacks are orchestrated against several algorithms that have previously been used in cryptography, resulting in the successful retrieval of secret data within a manageable time-scale.