Computational Study of Amino Acids, Order to Simulation of Membrane Protein Channels Using by Theoretical Methods

The importance of ionic channels is due to the passage of ions across the cell membrane which is based on electrochemical gradients. The structure of ionic channels often includes one or several central cores which makes up the pore. The direct electron transfer between the enzyme and unmodified electrode is usually prohibited due to shielding of the redox active sites by the protein shells. In this paper, we have studies the stability of C60-amino acids clusters using by semi-empirical method and investigation of vi-brational frequencies and electrical properties. When you are citing the document, use the following link http://essuir.sumdu.edu.ua/handle/123456789/3542

Estimation of Vibrational Energy Levels of Diatomic Molecules (CN, CO and CS) Using Numerov Algorithm and Comparison with the Empirical Values

Abstract: A general potential function which is suitable for all bound electronic states of all diatomic molecules has not been yet found, and in CN, CO andCS molecules as well. By comparisons with the experimental values, the potential function that more accurately describe the vibrations of these molecules is found. This work investigates the best-estimated vibrational energy levels of diatomic molecules observed in comets, which is in the best agreement with the empirical vibrational energies. Through this comparison, the best empirical potential function is offered which could be helpful in numerical and computer-based estimations. Empirical potential functions are listed and used to solve nuclear Schrodinger equation for some diatomic molecules namely CN, CO and CS, such as Morse, Rydberg, Lippincott, Frost-Musulin, Linnett, Poschl-Teller, Varshni and Hulburt-Hirshfelder are chosen to find the vibrational energy levels. Numerov algorithm has been employed for carrying out the calculations. The test is set, according to the ground state of the prementioned molecules. The ground state of CN is X 2 å + , and for CO and CS is X 1 L229\f"Symbol"\s10 + . A detailed study of the performance of the empirical potential energy functions has been carried out by comparing them with the Rydberg-Klein-Rees potential energy curves for a ground electronic state of various diatomic molecules. Further, by employing the above potential energy functions, the Schrodinger nuclear equation has been solved for the vibrational energy levels, G(v), and the vibrational wave functions, ψ v . By comparisons with the experimental values, the potential function that more accurately describe the vibrations of CN, CO and CS molecules are found. Through the studies of this paper, which is mentioned as the estimation of the dissociation energies (D e ), the employed D e for CN is 7.788 eV, and for CO and CS are 11.064 and 7.354 eV respectively; those are in good agreement with the literature values. Through Numerov -based estimations, it could be concluded that the five parameter HulbertHirschfelder (H-H) empirical potential function is the best way to describe the vibrational energy levels of CN, CO and CS molecules

Classification of All tt-Resilient Boolean Functions with t+4t+4 Variables

We apply Siegenthaler\u27s construction, along with several techniques, to classify all $(n-4)$-resilient Boolean functions with $n$ variables, for all values of $n \geq 4$, up to extended variable-permutation equivalence. We show that, up to this equivalence, there are only 761 functions for any $n$ larger than or equal to 10, and for smaller values of $n$, i.e., for $n$ increasing from 4 to 9, there are 58, 256, 578, 720, 754, and 760 functions, respectively. Furthermore, we classify all 1-resilient 6-variable Boolean functions and show that there are 1035596784 such functions up to extended variable-permutation equivalence

Classification of All t-Resilient Boolean Functions with t + 4 Variables

We apply Siegenthaler’s construction, along with several techniques, to classify all (n−4)-resilient Boolean functions with n variables, for all values of n ≥ 4, up to the extended variable-permutation equivalence. We show that, up to this equivalence, there are only 761 functions for any n larger than or equal to 10, and for smaller values of n, i.e., for n increasing from 4 to 9, there are 58, 256, 578, 720, 754, and 760 functions, respectively. Furthermore, we classify all 1-resilient 6-variable Boolean functions and show that there are 1 035 596 784 such functions up to the extended variable-permutation equivalence

Cryptanalysis of PRINCE with Minimal Data

We investigate two attacks on the PRINCE block cipher in the most realistic scenario, when the attacker only has a minimal amount of known plaintext available. The first attack is called Accelerated Exhaustive Search, and is able to recover the key for up to the full 12-round PRINCE with a complexity slightly lower than the security claim given by the designers. The second attack is a meet-in-the-middle attack, where we show how to successfully attack 8- and 10-round PRINCE with only two known plaintext/ciphertext pairs. Both attacks take advantage of the fact that the two middle rounds in PRINCE are unkeyed, so guessing the state before the first middle round gives the state after the second round practically for free. These attacks are the fastest until now in the known plaintext scenario for the 8 and 10 reduced-round versions and the full 12-round of PRINCE

An Overview of Prescription in the Nursing

Introduction: The role which nurses are playing in medication management is seriously changing over time. Nurses are authorized to prescribe medications in an ever-increasing number of countries. The main objective of the present review study is to introduce nurse prescribing as well as different types of prescriptions and their corresponding advantages, disadvantages, and barriers in the leading countries of nursing. Methods: The present study was performed by searching over the articles in information databases such as “PubMed”, “Google Scholar”, “Embase” , “Proquest”, “Ovid”, “Web of Science” and “Science Direct” using the English keywords such as “independent prescribing”, “supplementary nurse prescribing” and “prescribing”. As a result, 250 relevant papers were collected, out of which 38 ones were used in the present study. Results: The results of searching the sources and articles related to nurse prescribing were presented as the definition of nurse prescribing as well as different types of prescribing and their advantages and obstacles in the leading countries in nurse medication prescribing. Conclusions: Although there are many advantages for nurse prescribing such as cost-effectiveness of this method, the official prescribing by nurses is not authorized in many Asian countries such as Iran. Considering the positive role of nurse prescribing in the nursing professional improvement and the patient's satisfaction, it is also hoped to be applied in all countries

Improved Multi-Dimensional Meet-in-the-Middle Cryptanalysis of KATAN

We study multidimensional meet-in-the-middle attacks on the KATAN block cipher family. Several improvements to the basic attacks are introduced and explained. The most noteworthy of these is the technique of guessing only non-linearly involved key bits, which reduces the search space by a significant factor. The optimizations decreases the complexity of multidimensional meet-in-the-middle attacks, allowing more rounds of KATAN to be efficiently attacked than previously reported

Differential Cryptanalysis of 18-Round PRIDE

The rapid growth of the Internet of Things together with the increasing popularity of connected objects have created a need for secure, efficient and lightweight ciphers. Among the multitude of candidates, the block cipher PRIDE is, to this day, one of the most efficient solutions for 8-bit micro-controllers. In this paper, we provide new insights and a better understanding of differential attacks of PRIDE. First, we show that two previous attacks are incorrect, and describe (new and old) properties of the cipher that make such attacks intricate. Based on this understanding, we show how to properly mount a differential attack. Our proposal is the first single key differential attack that reaches 18 rounds out of 20. It requires $2^{61}$ chosen plaintexts and recovers the 128-bit key with a final time complexity of $2^{63.3}$ encryptions, while requiring a memory of about $2^{35}$ blocks of 64 bits

Faster Key Recovery Attack on Round-Reduced PRINCE

We introduce a new technique for doing the key recovery part of an integral or higher order differential attack. This technique speeds up the key recovery phase significantly and can be applied to any block cipher with S-boxes. We show several properties of this technique, then apply it to PRINCE and report on the improvements in complexity from earlier integral and higher order differential attacks on this cipher. Our attacks on 4 and 6 rounds were the fastest and the winner of PRINCE Challenge\u27s last round in the category of chosen plaintext attack

Cryptanalysis of 6-round PRINCE using 2 Known Plaintexts

In this paper we focus on the PRINCE block cipher reduced to 6 rounds, with two known plaintext/ciphertext pairs. We develop two attacks on 6-round PRINCE based on accelerated exhaustive search, one with negligible memory usage and one having moderate memory requirements. The time complexities for the two attacks are $2^{96.78}$ and $2^{88.85}$, respectively. The memory consumption of the second attack is less than 200MB and so is not a restricting factor in a real-world setting