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.
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
To accommodate future demands in air traffic management, this article qualitatively elaborates the multi-aircraft conflict resolution relying on the concept of an airborne ecosystem, as a set of autonomously operating aircraft whose trajectories are causally involved in a tactically detected conflict. The methodology provides two types of solutions: Air Traffic Control-based resolution that is considered as one from a set of compulsory avoidance maneuvers at a certain time instance, and the multi-agent simulated resolution as a product of the aircraft negotiation interactions and agreement on the avoidance maneuvers for the conflict state removal. The article further analyses a flight efficiency of the ecosystem resolution, in both distance and time, by comparing the compulsory against the negotiated solutions. From the total amount of tested trajectories and identified conflict patterns, three ecosystem scenarios have been randomly selected and efficiently quantified. Finally, the results have shown the significant savings in favor of the multi-agent solution approach.
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.