Academic literature on the topic 'Asymmetric Algorithm'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Asymmetric Algorithm.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Asymmetric Algorithm"

1

Maxrizal, Maxrizal, and Baiq Desy Aniska Prayanti. "Application Of Rectangular Matrices: Affine Cipher Using Asymmetric Keys." CAUCHY 5, no. 4 (2019): 181. http://dx.doi.org/10.18860/ca.v5i4.4408.

Full text
Abstract:
<p class="Abstract">In cryptography, we know the symmetric key algorithms and asymmetric key algorithms. We know that the asymmetric key algorithm is more secure than the symmetric key algorithm. Affine Cipher uses a symmetric key algorithm. In this paper, we introduce the Affine Cipher using asymmetric keys. Asymmetrical keys are formed from rectangular matrices.</p>
APA, Harvard, Vancouver, ISO, and other styles
2

DM, Kuryazov. "Optimal Asymmetric Data Encryption Algorithm." International Journal of Science and Research (IJSR) 10, no. 1 (2021): 744–48. https://doi.org/10.21275/sr21107160459.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Karunarathne, J. R. M. D. B., Tharindu Wijethilake, and C. Keppitiyagama. "An Evaluation of Multipath TCP with Highly Asymmetric Subflows." International Journal on Advances in ICT for Emerging Regions (ICTer) 17, no. 1 (2024): 56–65. http://dx.doi.org/10.4038/icter.v17i1.7278.

Full text
Abstract:
Multipath TCP (MPTCP) is an extension of the Transmission Control Protocol (TCP) that allows the simultaneous use of multiple available network interfaces to transmit and receive data. MPTCP can improve the throughput, lower the latency, and provide higher resilience to network failures. MPTCP creates a number of network connections (subflows) between the destination and presents a single endpoint to the application. MPTCP schedulers multiplexe data over subflows based on their end-to-end path metrics. In this study, we found that the presence of asymmetric links within an MPTCP connection can lead to suboptimal performance. We explored the architecture of the Linux implementation of MPTCP and identified the design choices that lead MPTCP to underperform in the presence of highly asymmetric links. To test the behaviour of MPTCP an emulation testbed was built using the Mininet emulator. We conducted comprehensive experiments in this controlled environment to analyze MPTCP behavior under asymmetric subflows in terms of bandwidth and latency. We designed a novel scheduling algorithm tailored to mitigate the impact of asymmetric subflows and implemented it in the Linux kernel. Building a scheduling algorithm for MPTCP in the Linux kernel is not a straightforward task. Several iterations of the algorithm had to be investigated in order to develop a practically deployable algorithm. The proposed algorithms were implemented in the Linux Kernel and were tested in the testbed. These algorithms were tested for their suitability to be used over highly asymmetric links under several test scenarios. Finally, we proposed the “Extended Dynamic Scheduler Algorithm” which observes the MPTCP connection and adjusts its subflows to limit the effect of asymmetric subflows in the MPTCP connection. The algorithm also has its own kickback policy where the throughput of the connection starts to improve when the asymmetry of the subflows decreases.
APA, Harvard, Vancouver, ISO, and other styles
4

Narasimha Nayak, V., M. Ravi Kumar, K. Anusha, and Ch Kranthi Kiran. "FPGA based asymmetric crypto system design." International Journal of Engineering & Technology 7, no. 1.1 (2017): 612. http://dx.doi.org/10.14419/ijet.v7i1.1.10788.

Full text
Abstract:
In the network security system cryptography plays a vital role for the secure transmission of information. Cryptography is a process of integrating and transferring the data to the genuine users against any attacks. There are two types of Cryptographic algorithm: Symmetric and Asymmetric algorithms. In the symmetric type cryptography, single key is used for both encryption and decryption. Symmetric algorithms are fast and simple. Asymmetric cryptographic algorithm uses different keys such as public key to encrypt the message at sender and private key which is known only to receiver for decrypting the encrypted message. Asymmetric algorithms are more secure and difficult, to decrypt the message unless hacker acquires the knowledge of private key. A new Asymmetric algorithm with Error Detection and Correction mechanism is proposed that can reduce hardware, and improves decryption time and security. Proposed Asymmetric algorithm uses the few properties of: RSA, Diffie-Hellman and ElGamal Algorithms. Performance of asymmetric algorithms is compared with proposed algorithm, which is designed using Verilog HDL. Algorithms are synthesized, simulated, implemented using Vivado and targeted for Artix-7 XC7A100T-1CSG324Carchitecture.Chipscope Pro logic analyzer-Virtual Input Output core is binded to design for hardware debugging, to monitor and capture the output signals at selected specified state by applying random input stimuli at runtime in Nexys4 DDR FPGA Board.
APA, Harvard, Vancouver, ISO, and other styles
5

Kulkarni, P., and D. Dutta. "An Investigation of Techniques for Asymmetry Rectification." Journal of Mechanical Design 117, no. 4 (1995): 620–26. http://dx.doi.org/10.1115/1.2826730.

Full text
Abstract:
This paper is concerned with symmetry and asymmetry in objects. Earlier studies on the subject have dealt with the detection of symmetry. We study the problem of asymmetry rectification, i.e., given an asymmetric profile, suggest geometric changes to make it symmetric. We have investigated two techniques for asymmetry rectification. This paper reports on the techniques and the results. First, we analyze the problem using skeleton representations and propose a simple algorithm for rectifying asymmetric convex profiles. Next, we outline an optimization scheme for the rectification of convex and nonconvex profiles, in 2D and 3D. Implemented examples are presented for both algorithms.
APA, Harvard, Vancouver, ISO, and other styles
6

Zafarani, Mohammad M., Amir M. Halabian, and Saeed Behbahani. "Optimal coupled and uncoupled fuzzy logic control for magneto-rheological damper-equipped plan-asymmetric structural systems considering structural nonlinearities." Journal of Vibration and Control 24, no. 7 (2016): 1364–90. http://dx.doi.org/10.1177/1077546316660030.

Full text
Abstract:
The main motivation of this paper is to examine the effect of structural nonlinearities on the engineering demand parameters (EDPs) of seismically excited controlled plan-asymmetric buildings equipped with magneto-rheological dampers. The development of a robust control algorithm for asymmetric buildings due to the randomness of ground excitations and their torsional response has always been a significantly challenging task in the vibrations control of structures. While the control algorithm in a simple approach could be designed ignoring the dependency of stiff and flexible edges of EDPs, the present research aimed also to develop a control strategy that mitigates simultaneously asymmetric edge responses of the structure using the multi-input multi-output ability of fuzzy logic control algorithms. In order to alleviate all difficulties to design an admissible control algorithm and attain the desired level of performance, the nondominated sorting genetic algorithm-II is applied. The effectiveness of the proposed controller on the inelastic seismic behavior of a controlled plan-asymmetric one-story structure is evaluated through a parametric study in which asymmetry is considered in the form of unidirectional mass eccentricity. To take the inelastic behavior of a controlled asymmetric building’s members into account, fiber elements modeling is employed. The model was subjected to a uniaxial lateral disturbance, including ordinary and strong ground motions exciting both lateral and torsional motions.
APA, Harvard, Vancouver, ISO, and other styles
7

Liu, Fei, Changqin Gao, and Lisha Liu. "SK-PSO: A Particle Swarm Optimization Framework with SOM and K-Means for Inverse Kinematics of Manipulators." Symmetry 16, no. 12 (2024): 1667. https://doi.org/10.3390/sym16121667.

Full text
Abstract:
In this paper, a particle swarm optimizer that integrates self-organizing maps and k-means clustering (SK-PSO) is proposed. This optimizer generates an asymmetric Cartesian space from random joint configurations when addressing the inverse kinematics of manipulators, followed by K-means clustering applied to the Cartesian space. The resulting clusters are used to reduce the dimensionality of the corresponding joint space using Self-Organizing Maps (SOM). During the solving process, the target point’s clustering region is determined first, and then the joint space point closest to the target point is selected as the initial population for the particle swarm algorithm. The simulation results demonstrate the effectiveness of the SK-PSO algorithm. Given the inherent asymmetry among different algorithms in handling the problem, SK-PSO achieves an average fitness value that is 0.02–0.62 times better than five other algorithms, with an asymmetric solving time that is only 0.03–0.34 times that of the other algorithms. Therefore, compared to the other algorithms, the SK-PSO algorithm offers high accuracy, speed, and precision.
APA, Harvard, Vancouver, ISO, and other styles
8

MA Abualkas, Yaser, and Arshed Raad Raheem. "Asymmetric New Cryptography Algorithm Based on ASCII Code." International Journal of Science and Research (IJSR) 10, no. 6 (2021): 1–4. https://doi.org/10.21275/sr21528214956.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

NIELSEN, THOMAS D., and FINN V. JENSEN. "REPRESENTING AND SOLVING ASYMMETRIC DECISION PROBLEMS." International Journal of Information Technology & Decision Making 02, no. 02 (2003): 217–63. http://dx.doi.org/10.1142/s0219622003000604.

Full text
Abstract:
This paper deals with the representation and solution of asymmetric Bayesian decision problems. We present a formal framework, termed asymmetric influence diagrams. The framework is based on the syntax and semantics of the traditional influence diagram, and allows an efficient representation of asymmetric decision problems. As opposed to existing frameworks, the asymmetric influence diagram primarily encodes asymmetry at the qualitative level and it can therefore be read directly from the model. We give an algorithm for solving asymmetric influence diagrams. The algorithm initially decomposes the asymmetric decision problem into a structure of symmetric subproblems organized as a tree. A solution to the decision problem can then be found by propagating from the leaves towards the root using existing evaluation methods to solve the subproblems.
APA, Harvard, Vancouver, ISO, and other styles
10

Hao, Jiakai, Ming Jin, Yuting Li, and Yuxin Yang. "Neural network-based symmetric encryption algorithm with encrypted traffic protocol identification." PeerJ Computer Science 11 (April 4, 2025): e2750. https://doi.org/10.7717/peerj-cs.2750.

Full text
Abstract:
Cryptography is a cornerstone of power grid security, with the symmetry and asymmetry of cryptographic algorithms directly influencing the resilience of power systems against cyberattacks. Cryptographic algorithm identification, a critical component of cryptanalysis, is pivotal to assessing algorithm security and hinges on the core characteristics of symmetric and asymmetric encryption methods. A key challenge lies in discerning subtle spatial distribution patterns within ciphertext data to infer the underlying cryptographic algorithms, which is essential for ensuring the communication security of power systems. In this study, we first introduce a plaintext guessing model (SCGM model) based on symmetric encryption algorithms, leveraging the strengths of convolutional neural networks to evaluate the plaintext guessing capabilities of four symmetric encryption algorithms. This model is assessed for its learning efficacy and practical applicability. We investigate protocol identification for encrypted traffic data, proposing a novel scheme that integrates temporal and spatial features. Special emphasis is placed on the performance of algorithms within both symmetric and asymmetric frameworks. Experimental results demonstrate the effectiveness of our proposed scheme, highlighting its potential for enhancing power grid security.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Asymmetric Algorithm"

1

Kwa, William. "Asymmetric collimation : dosimetric characteristics, treatment planning algorithm, and clinical applications." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1998. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp05/nq27182.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Raya, Lilysuriazna Binti. "A metaheuristic ant colony optimization algorithm for symmetric and asymmetric traveling salesman problems." Thesis, Brunel University, 2018. http://bura.brunel.ac.uk/handle/2438/17617.

Full text
Abstract:
This research addresses solving two types of Travelling Salesman Problems (TSP) which are the symmetric TSP (STSP) and the asymmetric TSP (ATSP). The TSP is a problem of finding a minimal length closed tour that visits each city once. If the distances between each pair of cities are the same in both directions, the problem is a STSP, otherwise, it is an ATSP. In this thesis, a new metaheuristic algorithm which is based on Ant Colony Optimization (ACO) is proposed to solve these problems. The key idea is to enhance the ability of exploration and exploitation by incorporating a metaheuristic approach with an exact method. A new strategy for creating 'Intelligent Ants' is introduced to construct the solution tours. This strategy aims at reducing the computational time by heuristically fixing part of the solution tour and improving the accuracy of the solutions through the usage of a solver, specifically for large size instances. Moreover, this proposed algorithm employs new ways of depositing and evaporating pheromone. A different approach of global updating of pheromone is proposed in which the pheromone is deposited only on the edges belonging to the colony-best ant and evaporated only on the edges belonging to the colony-worst ant that are not in the colony-best ant. Additionally, the parameters of the proposed algorithm which include the number of colonies, the number of ants in each colony, the relative influence of the pheromone trail α and the pheromone evaporation rate ρ are expressed as a function of the problem size. Comparisons with other sets of parameter values suggested in the literature have been investigated which illustrate the advantages of the choice of the proposed parameter settings. Further, in order to evaluate the performance of the proposed algorithm, a set of standard benchmark problems from the TSPLIB with up to 442 cities were solved and the results obtained were compared with other approaches from the literature. The proposed algorithm has proven to be competitive and shows better performance in 63% of the 16 algorithms in terms of solution quality and obtained the optimum solutions in 70% of the 33 instances, proving that it is a good alternative approach to solve these hard combinatorial optimisation problems.
APA, Harvard, Vancouver, ISO, and other styles
3

Yin, Emmy, and Klas Wijk. "Bayesian Parameter Tuning of the Ant Colony Optimization Algorithm : Applied to the Asymmetric Traveling Salesman Problem." Thesis, KTH, Skolan för elektroteknik och datavetenskap (EECS), 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-302801.

Full text
Abstract:
The parameter settings are vital for meta-heuristics to be able to approximate the problems they are applied to. Good parameter settings are difficult to find as there are no general rules for finding them. Hence, they are often manually selected, which is seldom feasible and can give results far from optimal. This study investigated the potential of tuning meta-heuristics using a hyper- parameter tuning algorithm from the field of machine learning, where parameter tuning is a common and well-explored area. We used Bayesian Optimization, a state-of-the-art black-box optimization method, to tune the Ant Colony Optimization meta-heuristic. Bayesian Optimization using the three different acquisition functions Expected Improvement, Probability of Improvement and Lower Confidence Bound, as well as the three functions combined using softmax, were evaluated and compared to using Random Search as an optimization method. The Ant Colony Optimization algorithm with its parameters tuned by the different methods was applied to four Asymmetric Traveling Salesman problem instances. The results showed that Bayesian Optimization both leads to better solutions and does so in significantly fewer iterations than Random Search. This suggests that Bayesian Optimization is preferred to Random Search as an optimization method for the Ant Colony Optimization metaheuristic, opening for further research in tuning meta-heuristics with Bayesian Optimization.<br>Bra val av parametrar är avgörande för hur väl meta-heuristiker lyckas approximera problemen de tillämpas på. Detta kan emellertid vara svårt eftersom det inte finns några generella riktlinjer för hur de ska väljas. Det gör att parametrar ofta ställs in manuellt, vilket inte alltid är genomförbart och dessutom kan leda till resultat långt från det optimala. Att ställa in hyperparametrar är dock ett välutforskat problem inom maskininlärning. Denna studie undersöker därför möjligheten att använda algoritmer från maskininlärningsområdet för att ställa in parametrarna på meta-heurstiker. Vi använde Bayesiansk optimering, en modern optimeringsmetod för optimering av okända underliggande funktioner, på meta-heuristiken myrkolonioptimering. Bayesiansk optimering med förvärvsfunktionerna förväntad förbättring, sannolikhet för förbättring och undre förtroendegräns, samt alla tre kombinerade med softmax, utvärderades och jämfördes med slumpmässig sökning som en optimeringsmetod. Myrkolonioptimering vars parametrar ställts in med de olika metoderna tillämpades på fyra instanser av det asymmetriska handlesresandeproblemet. Resultaten visade på att Bayesiansk optimering leder till bättre approximeringar, som kräver signifikant färre iterationer att hitta jämfört med slumpmässig sökning. Detta indikerar att Bayesiansk optimering är att föredra framför slumpmässig sökning, och öppnar för fortsatt forskning av Bayesiansk optimering av metaheuristiker.
APA, Harvard, Vancouver, ISO, and other styles
4

Haman, John T. "The energy goodness-of-fit test and E-M type estimator forasymmetric Laplace distributions." Bowling Green State University / OhioLINK, 2018. http://rave.ohiolink.edu/etdc/view?acc_num=bgsu1524756256837676.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Ferreira, Clécio da Silva. "Inferência e diagnósticos em modelos assimétricos." Universidade de São Paulo, 2008. http://www.teses.usp.br/teses/disponiveis/45/45133/tde-28042008-113150/.

Full text
Abstract:
Este trabalho apresenta um estudo de inferência e diagnósticos em modelos assimétricos. A análise de influência é baseada na metodologia para modelos com dados incompletos, que é relacionada ao algoritmo EM (Zhu e Lee, 2001). Além dos modelos de regressão Normal Assimétrico (Azzalini, 1999) e t-Normal Assimétrico (Gómez, Venegas e Bolfarine, 2007) existentes, são desenvolvidas duas novas classes de modelos, denominados modelos de misturas de escala normal assimétricos (englobando as distribuições Normal, t-Normal, Slash, Normal-Contaminada e Exponencial-potência Assimétricas) e modelos lineares mistos robustos assimétricos, utilizando distribuições de misturas de escalas normais assimétricas para o efeito aleatório e distribuições de misturas de escalas para o erro aleatório. Para o modelo misto, a matriz de informação de Fisher observada é calculada utilizando a aproximação de Louis (1982) para dados incompletos. Para todos os modelos, algoritmos tipo EM são desenvolvidos de forma a fornecer uma solução numérica para os parâmetros dos modelos de regressão. Para cada modelo de regressão, medidas de bondade de ajuste são realizadas via inspeção visual do gráfico de envelope simulado. Para os modelos de misturas de escalas normais assimétricos, um estudo de robustez do algoritmo EM proposto é desenvolvido, determinando a eficácia dos estimadores apresentados. Aplicações dos modelos estudados são realizadas para os conjuntos de dados do Australian Institute of Sports (AIS), para o conjunto de dados sobre qualidade de vida de pacientes (mulheres) com câncer de mama, em um estudo realizado pelo Centro de Atenção Integral à Saúde da Mulher (CAISM) em conjunto com a Faculdade de Ciências Médicas, da Universidade Estadual de Campinas e para o conjunto de dados de colesterol de Framingham.<br>This work presents a study of inference and diagnostic in asymmetric models. The influence analysis is based in the methodology for models with incomplete data, that is related to the algorithm EM (Zhu and Lee, 2001). Beyond of the existing asymmetric normal (Azzalini, 1999) and t-Normal asymmetric (Gómez, Venegas and Bolfarine, 2007) regression models, are developed two new classes of models, namely asymmetric normal scale mixture models (embodying the asymmetric Normal, t-Normal, Slash, Contaminated-Normal and Power-Exponential distributions) and asymmetric robust linear mixed models, utilizing asymmetric normal scale mixture distributions for the random effect and normal scale mixture distributions for the random error. For the mixed model, the observed Fisher information matrix is calculated using the Louis\' (1982) approach for incomplete data. For all models, EM algorithms are developed, that provide a numeric solution for the parameters of the regression models. For each regression model, measures of goodness of fit are realized through visual inspection of the graphic of simulated envelope. For the asymmetric normal scale mixture models, a study of robustness of the proposed EM algorithm is developed to determine the efficacy of the presented estimators. Applications of the studied models are made for the data set of the Australian Institute of Sports (AIS), for the data set about quality of life of patients (women) with breast cancer, in a study made by Centro de Atenção Integral à Saúde da Mulher (CAISM) in conjoint with the Medical Sciences Faculty, of the Campinas State\'s University and for the data set of Framingham\'s cholesterol study.
APA, Harvard, Vancouver, ISO, and other styles
6

Souza, Filho Nelson Lima de. "Modelagem bayesiana flexível em regressão com erros nas variáveis." Universidade Federal do Amazonas, 2012. http://tede.ufam.edu.br/handle/tede/3669.

Full text
Abstract:
Made available in DSpace on 2015-04-22T22:16:04Z (GMT). No. of bitstreams: 1 Nelson Lima de Souza Filho.pdf: 1556771 bytes, checksum: 33a38464a9de0ec3dca0da75c9c6b64e (MD5) Previous issue date: 2012-12-06<br>CAPES - Coordenação de Aperfeiçoamento de Pessoal de Nível Superior<br>In regression models, the classical normal assumption for the distribution of the measurement errors is often violated, masking some important features of the variability of the data. Some practical actions to overcome this problem, like transformations of the data, sometimes are not effective. In this work we propose a methodology to overcome this problem, in the context of multivariate linear regression with measurement errors. In these models, the covariate is unobservable and the researcher observes a surrogate variable. These measurements are made with an additive error. We extend the classical normal model, by modeling jointly the covariate and the measurement errors by a finite mixture of densities which are in a general family, accommodating skewness, heavy tails and multi-modality at the same time, allowing a degree of flexibility that can not be met by the normal model. We proceed Bayesian inference through a Gibbs-type algorithm. Some proposed models are compared with existing symmetrical models, using a modified DIC criterion, through the analysis of simulated and real data.<br>Em modelos de regressão, o pressuposto clássico de normalidade para a distribuição dos erros aleatórios é muitas vezes violado, mascarando algumas características importantes da variabilidade dos dados. Algumas ações práticas para resolver esse problema, como transformações nos dados, revelam-se muitas vezes ineficazes. Neste trabalho apresentamos uma proposta para lidar com esta questão no contexto do modelo de regressão multivariada linear simples, quando a variável resposta e a variável regressora são observadas com erro aditivo o chamado modelo de regressão linear com erros nas variáveis. Em tais modelos, o pesquisador observa uma variável substituta em vez da covariável de interesse. Nós estendemos o modelo clássico normal, modelando a distribuição conjunta da covariável e dos erros aleatórios por uma mistura finita de densidades pertencentes a uma família de distribuições bem geral, acomodando ao mesmo tempo assimetria, caudas pesadas e multimodalidade, permitindo um grau de flexibilidade que não pode ser atingido pelo modelo normal. Para a parte de estimação desenvolvemos um algoritmo do tipo Gibbs para proceder estimação Bayesiana. Alguns modelos propostos foram comparados com modelos simétricos já existentes na literatura, utilizando um critério DIC modificado, através da análise de dados simulados e reais.
APA, Harvard, Vancouver, ISO, and other styles
7

Романюк, О. О., та М. П. Смаглюк. "Програмна реалізація алгоритму шифрування RSA". Thesis, Сумський державний університет, 2017. http://essuir.sumdu.edu.ua/handle/123456789/64443.

Full text
Abstract:
Криптографічні системи з відкритим ключем в даний час широко застосовуються в різних мережевих протоколах. Асиметричне шифрування на основі відкритого ключа RSA (розшифровується, як Rivest, Shamir and Aldeman - творці алгоритму) використовує більшість продуктів на ринку інформаційної безпеки. Його криптостійкість грунтується на складності розкладання великих чисел на множники.
APA, Harvard, Vancouver, ISO, and other styles
8

Шишлєвський, Д. О. "Системи гомоморфного шифрування". Master's thesis, Сумський державний університет, 2019. http://essuir.sumdu.edu.ua/handle/123456789/75672.

Full text
Abstract:
У даній роботі були досліджені переваги та недоліки частково гомоморфних алгоритмів. Була створена програма для шифрування та розшифрування тексту та для аналізу роботи обраних алгоритмів за системою оцінок від 1 до 5.
APA, Harvard, Vancouver, ISO, and other styles
9

Mattsson, Per. "The Asymmetric Traveling Salesman Problem." Thesis, Uppsala universitet, Matematiska institutionen, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-132624.

Full text
Abstract:
This thesis is a survey on the approximability of the asymmetric traveling salesmanproblem with triangle inequality (ATSP).In the ATSP we are given a set of cities and a function that gives the cost of travelingbetween any pair of cities. The cost function must satisfy the triangle inequality, i.e.the cost of traveling from city A to city B cannot be larger than the cost of travelingfrom A to some other city C and then to B. However, we allow the cost function tobe asymmetric, i.e. the cost of traveling from city A to city B may not equal the costof traveling from B to A. The problem is then to find the cheapest tour that visit eachcity exactly once. This problem is NP-hard, and thus we are mainly interested in approximationalgorithms. We study the repeated cycle cover heuristic by Frieze et al. We alsostudy the Held-Karp heuristic, including the recent result by Asadpour et al. that givesa new upper bound on the integrality gap. Finally we present the result ofPapadimitriou and Vempala which shows that it is NP-hard to approximate the ATSP with a ratio better than 117/116.
APA, Harvard, Vancouver, ISO, and other styles
10

Palbom, Anna. "On Approximating Asymmetric TSP and Related Problems." Licentiate thesis, Stockholm : School of Computer Science and Communication, Kungl Tekniska högskolan, (KTH), 2006. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-3932.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Asymmetric Algorithm"

1

Benkler, Yochai, Robert Faris, and Hal Roberts. Epistemic Crisis. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780190923624.003.0001.

Full text
Abstract:
This chapter describes the contours of the epistemic crisis in media and politics that threatens the integrity of democratic processes, erodes trust in public institutions, and exacerbates social divisions. It lays out the centrality of partisanship, asymmetric polarization, and political radicalization in understanding the current maladies of political media. It investigates the main actors who used the asymmetric media ecosystem to influence the formation of beliefs and the propagation of disinformation in the American public sphere, and to manipulate political coverage during the election and the first year of the Trump presidency, , including “fake news” entrepreneurs/political clickbait fabricators; Russian hackers, bots, and sockpuppets; the Facebook algorithm and online echo chambers; and Cambridge Analytica. The chapter also provides definitions of propaganda and related concepts, as well as a brief intellectual history of the study of propaganda.
APA, Harvard, Vancouver, ISO, and other styles
2

Starke, Michal. Complex Left Branches, Spellout, and Prefixes. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780190876746.003.0009.

Full text
Abstract:
Higher-function words such as complementizers, negation, functional prepositions, definiteness particles, comparative markers, and so forth, occurring to the left of their lexical category, are argued to be base-generated as complex left branches, rather than spelling out the main functional sequence. This is generalized to all (base-generated) pre-asymmetries and post-asymmetries and derived from the structure of the lexical entries of the function words, dispensing with idiosyncratic notational devices equivalent to [+ suffix] or [+ needs-to-move]. These complex left branches require a merge-XP operation, and the place of this operation in the algorithm of spellout-driven movement is discussed.
APA, Harvard, Vancouver, ISO, and other styles
3

Benkler, Yochai, Robert Farris, and Hal Roberts. Network Propaganda. Oxford University Press, 2018. http://dx.doi.org/10.1093/oso/9780190923624.001.0001.

Full text
Abstract:
This book examines the shape, composition, and practices of the United States political media landscape. It explores the roots of the current epistemic crisis in political communication with a focus on the remarkable 2016 U.S. president election culminating in the victory of Donald Trump and the first year of his presidency. The authors present a detailed map of the American political media landscape based on the analysis of millions of stories and social media posts, revealing a highly polarized and asymmetric media ecosystem. Detailed case studies track the emergence and propagation of disinformation in the American public sphere that took advantage of structural weaknesses in the media institutions across the political spectrum. This book describes how the conservative faction led by Steve Bannon and funded by Robert Mercer was able to inject opposition research into the mainstream media agenda that left an unsubstantiated but indelible stain of corruption on the Clinton campaign. The authors also document how Fox News deflects negative coverage of President Trump and has promoted a series of exaggerated and fabricated counter narratives to defend the president against the damaging news coming out of the Mueller investigation. Based on an analysis of the actors that sought to influence political public discourse, this book argues that the current problems of media and democracy are not the result of Russian interference, behavioral microtargeting and algorithms on social media, political clickbait, hackers, sockpuppets, or trolls, but of asymmetric media structures decades in the making. The crisis is political, not technological.
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Asymmetric Algorithm"

1

Olszewski, Dominik. "Asymmetric k-Means Algorithm." In Adaptive and Natural Computing Algorithms. Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-20267-4_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Glover, Fred, Gregory Gutin, Anders Yeo, and Alexey Zverovich. "Construction Heuristics and Domination Analysis for the Asymmetric TSP." In Algorithm Engineering. Springer Berlin Heidelberg, 1999. http://dx.doi.org/10.1007/3-540-48318-7_9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Cirasella, Jill, David S. Johnson, Lyle A. McGeoch, and Weixiong Zhang. "The Asymmetric Traveling Salesman Problem: Algorithms, Instance Generators, and Tests." In Algorithm Engineering and Experimentation. Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-44808-x_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Upadhyaya, Sujatha R., and David Toth. "An Experiment with Asymmetric Algorithm: CPU Vs. GPU." In Database Systems for Advanced Applications. Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-29035-0_21.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Bistarelli, Stefano, Francesco Santini, and Anna Vaccarelli. "An Asymmetric Fingerprint Matching Algorithm for Java CardTM." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2005. http://dx.doi.org/10.1007/11527923_29.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Olsson, Björn. "A host-parasite genetic algorithm for asymmetric tasks." In Machine Learning: ECML-98. Springer Berlin Heidelberg, 1998. http://dx.doi.org/10.1007/bfb0026705.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Suh, Jeong-Jun, Shan Guo Quan, Jeong Doo Park, Jong Hyuk Park, and Young Yong Kim. "Asymmetric Link Dynamic Routing Algorithm for Ubiquitous Multimedia Services." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/978-3-540-69429-8_56.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Gutin, Gregory, Daniel Karapetyan, and Natalio Krasnogor. "Memetic Algorithm for the Generalized Asymmetric Traveling Salesman Problem." In Nature Inspired Cooperative Strategies for Optimization (NICSO 2007). Springer Berlin Heidelberg, 2008. http://dx.doi.org/10.1007/978-3-540-78987-1_19.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Hou, Bo, Zhenzhen Pang, Suogang Gao, and Wen Liu. "Improved Approximation Algorithm for the Asymmetric Prize-Collecting TSP." In Algorithmic Aspects in Information and Management. Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-16081-3_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Sharma, Puneet, Deepak Arora, and Anil Kumar. "Binary Tree-Based Asymmetric Moderate Algorithm for Secured DNS." In Proceedings of International Conference on Recent Trends in Computing. Springer Singapore, 2022. http://dx.doi.org/10.1007/978-981-16-7118-0_38.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Asymmetric Algorithm"

1

Chen, Shuai, Zeqiang Zhang, Junqi Liu, Dan Ji, and Yu Zhang. "Unidirectional loop layout problems based on asymmetric flow and facility location." In 4th International Conference on Automation Control. Algorithm and Intelligent Bionics, edited by Jing Na and Shuping He. SPIE, 2024. http://dx.doi.org/10.1117/12.3040279.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Dasgupta, Anubhab, Vedant Zope, and Asrul Harun Ismail. "Implementation of the Bees Algorithm for UAV Mission Plan." In 14th International Seminar on Industrial Engineering and Management. Trans Tech Publications Ltd, 2025. https://doi.org/10.4028/p-nad6qa.

Full text
Abstract:
The increasing use of Unmanned Aerial Vehicles (UAVs) in various applications, such as military operations and civilian tasks, has created a demand for efficient algorithms to plan their mission. This study explores the use of the Bees Algorithm (BA), a nature-inspired optimisation method, to solve two main problems in UAV mission planning: the UAV collision avoidance problem (UCAP) and the Asymmetric TSP (ATSP). Results of comparison between the proposed algorithm and other metaheuristic algorithms indicate that BA can produce competitive solutions. However, the study also found that the BA had a deviation of 10% on ATSP instances, whereas it was able to achieve similar deviation when solving symmetrical TSP of 200 dimensions. This highlights the need for further improvement of the neighbour search mechanism in the BA for better accuracy on the problems.
APA, Harvard, Vancouver, ISO, and other styles
3

Li, Zhuoran, Wenjun Wang, and Wenjiang Liang. "Asymmetric Development of Fetal Calcarine Sulcus in the Second Trimester and Third Trimester." In 2024 2nd International Conference on Algorithm, Image Processing and Machine Vision (AIPMV). IEEE, 2024. http://dx.doi.org/10.1109/aipmv62663.2024.10692153.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Fan, Lingchong, Yude Wang, and Ya Zhang. "Object Action Recognition Algorithm Based on Asymmetric Fast and Slow Channel Feature Extraction." In 2024 2nd International Conference on Signal Processing and Intelligent Computing (SPIC). IEEE, 2024. http://dx.doi.org/10.1109/spic62469.2024.10691533.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Jakubik, Tomas, and Jiri Jenicek. "Asymmetric low-power FHSS algorithm." In 2017 IEEE International Workshop of Electronics, Control, Measurement, Signals and their Application to Mechatronics (ECMSM). IEEE, 2017. http://dx.doi.org/10.1109/ecmsm.2017.7945892.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Li, Yu-Sian, Cao Minh Trang, Xin Huang, Cheng-Hsin Hsu, and Po-Ching Lin. "CacheQuery: A practical asymmetric communication algorithm." In GLOBECOM 2012 - 2012 IEEE Global Communications Conference. IEEE, 2012. http://dx.doi.org/10.1109/glocom.2012.6503632.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Jdanov, Vladimir, and Tatiana Sestacova. "Microprocessor Protection Relay Based on Amplitude-Phase Measurements of Signals." In 12th International Conference on Electronics, Communications and Computing. Technical University of Moldova, 2022. http://dx.doi.org/10.52326/ic-ecco.2022/el.05.

Full text
Abstract:
Microprocessor-based relay protection devices enable efficient operation of the electrical infrastructure of high voltage power lines and substations under emergency conditions. This is achieved by using high-speed fault detection algorithms and advanced electronic components. The paper deals with the elaboration of a such algorithm which novelty lies in the fact that it is based on amplitude-phase measurements of asymmetrical components of current and voltage signals, which detects accidents with symmetrical and asymmetric overloads significantly faster. The algorithm is implemented in microprocessor protection in the LIRA device.
APA, Harvard, Vancouver, ISO, and other styles
8

Wang, Rong, Aiwang Cheng, Wei Du, and Zupeng Li. "An Improved Asymmetric Link Bandwidth Measurement Algorithm." In 2009 International Joint Conference on Bioinformatics, Systems Biology and Intelligent Computing. IEEE, 2009. http://dx.doi.org/10.1109/ijcbs.2009.17.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Chaudhary, Ankur, Khaleel Ahmad, and M. A. Rizvi. "E-Commerce Security through Asymmetric Key Algorithm." In 2014 International Conference on Communication Systems and Network Technologies (CSNT). IEEE, 2014. http://dx.doi.org/10.1109/csnt.2014.163.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Yun-peng, Zhang, Lin Xia, and Wang Qiang. "Asymmetric cryptography algorithm with Chinese remainder theorem." In 2011 IEEE 3rd International Conference on Communication Software and Networks (ICCSN). IEEE, 2011. http://dx.doi.org/10.1109/iccsn.2011.6014606.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Asymmetric Algorithm"

1

Allende López, Marcos, Diego López, Sergio Cerón, et al. Quantum-Resistance in Blockchain Networks. Inter-American Development Bank, 2021. http://dx.doi.org/10.18235/0003313.

Full text
Abstract:
This paper describes the work carried out by the Inter-American Development Bank, the IDB Lab, LACChain, Cambridge Quantum Computing (CQC), and Tecnológico de Monterrey to identify and eliminate quantum threats in blockchain networks. The advent of quantum computing threatens internet protocols and blockchain networks because they utilize non-quantum resistant cryptographic algorithms. When quantum computers become robust enough to run Shor's algorithm on a large scale, the most used asymmetric algorithms, utilized for digital signatures and message encryption, such as RSA, (EC)DSA, and (EC)DH, will be no longer secure. Quantum computers will be able to break them within a short period of time. Similarly, Grover's algorithm concedes a quadratic advantage for mining blocks in certain consensus protocols such as proof of work. Today, there are hundreds of billions of dollars denominated in cryptocurrencies that rely on blockchain ledgers as well as the thousands of blockchain-based applications storing value in blockchain networks. Cryptocurrencies and blockchain-based applications require solutions that guarantee quantum resistance in order to preserve the integrity of data and assets in their public and immutable ledgers. We have designed and developed a layer-two solution to secure the exchange of information between blockchain nodes over the internet and introduced a second signature in transactions using post-quantum keys. Our versatile solution can be applied to any blockchain network. In our implementation, quantum entropy was provided via the IronBridge Platform from CQC and we used LACChain Besu as the blockchain network.
APA, Harvard, Vancouver, ISO, and other styles
2

Turner, S. Algorithms for Asymmetric Key Package Content Type. RFC Editor, 2010. http://dx.doi.org/10.17487/rfc5959.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Bixby, Eric R. An Analysis of the Computer Security Ramifications of Weakened Asymmetric Cryptographic Algorithms. Defense Technical Information Center, 2012. http://dx.doi.org/10.21236/ada562021.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Turner, S. Elliptic Curve Algorithms for Cryptographic Message Syntax (CMS) Asymmetric Key Package Content Type. RFC Editor, 2011. http://dx.doi.org/10.17487/rfc6162.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Bornholdt, S., and D. Graudenz. General asymmetric neutral networks and structure design by genetic algorithms: A learning rule for temporal patterns. Office of Scientific and Technical Information (OSTI), 1993. http://dx.doi.org/10.2172/10186812.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Martinez-Carrasco, José, Otavio Conceição, and Ana Lúcia Dezolt. More Information, Lower Price? Access Market-based Reference Prices and Gains in Public Procurement Efficiency. Inter-American Development Bank, 2023. http://dx.doi.org/10.18235/0004794.

Full text
Abstract:
The paper examines the impact of providing market-based reference prices on public procurement efficiency in Brazil. Specifically, the study focuses on the State Secretariat of Health (SES) in Rio Grande do Sul and the algorithm developed by the local tax administration to calculate representative reference prices for pharmaceutical products. Unlike previous studies, reference prices are calculated based on the universe of local business-to-business transactions. The study finds that SES procurement officers access to this information caused a significant reduction in purchase unit prices, particularly for products characterized by a higher ex-ante unit price, a smaller number of suppliers, and purchased by a smaller number of public institutions. The gains in efficiency are attributed to the use of up-to-date market information, which is particularly useful for products where information asymmetry is more likely to exist between procurement officers and private providers.
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography