This paper discusses the problem of decoding codeword in Reed- Muller Codes. We will use the Hadamard matrices as a method to decode codeword in Reed- Muller codes.In addition Reed- Muller Codes are defined and encoding matrices are discussed. Finally, a method of decoding is explained and an example is given to clarify this method, as well as, this method is compared with the classical method which is called Hamming distance.
Association of Electrocardiographic Left Ventricular Strain Pattern with Coronary Artery Disease and Cerebrovascular Accident in Hypertensive Patients
Background: Patients diagnosed with hypertension and left ventricular hypertrophy could presented with electrocardiographic changes including criteria of left ventricular hypertrophy, and left ventricular strain pattern( fixed ST depression and T inversion in leads I, avL, V5&6)
Objective: To study the impact of electrocardiographic left ventricular strain pattern in hypertensive patient as predictor for coronary artery disease and cerebrovascular accident development.
Material and method: a cro
... Show More
The aim of this research is to identify the Andalusia poet Abu Izac Al-Zauali , whose most of his poetry and biography had been lost, as well as many Andalusia poets. So this research is hoped to be the first step to shed the light on the poet’s life and poetry and to document his poetry as other writers do. It is also hoped that this research would pave the way , God willing , to the steps of finding more references about this poet .
Key Words: (Al-Zauali, Cordoba, Al-Ruaini choices, Andalusia Poetry , Almuahdi Era).
Molar conductivity of ascorbic acid (AA) with some α–amino acids (glycine (Gly), methionine (Met), cysteine (Cys) and tryptophan (Trp)) in aqueous solution was measured at range temperatures from 298 K to 313 K. Λo. The limiting molar conductivity, KA, the association constant was calculated using the Shedlovsky method, and R, the association distance calculated by Stokes–Einstein equation. The thermodynamic parameters (The heat of association ΔHo, the change in Gibbs free energy ΔGo, the change of entropy ΔSo), and (ΔES), the activation e
... Show MoreBackground: The microhardness of a composite resin is a vital parameter that is used to determine its clinical behavior. Measuring the microhardness of a composite resin has been used as an indirect method to assess its degree of conversion and extent of polymerization. The purpose of this in vitro study was to evaluate the effect of three curing distances (0, 2, and 4 mm) on the microhardness of the top and bottom surfaces of three types of flowable bulk-fill composite resins (smart dentin replacement, Opus bulk fill flow, and Tetric N). Material and method: Sixty-three specimens from the three types of composite resins (n=21) were fabricated using Teflon mold with a 4mm depth and a 5 mm internal diameter and cured for 20 seconds. For e
... Show MoreThe authors introduced and addressed several new subclasses of the family of meromorphically multivalent -star-like functions in the punctured unit disk in this study, which makes use of several higher order -derivatives. Many fascinating properties and characteristics are extracted systematically for each of these newly identified function classes. Distortion theorems and radius problems are among these characteristics and functions. A number of coefficient inequalities for functions belonging to the subclasses are studied, and discussed, as well as a suitable condition for them is set. The numerous results are presented in this study and the previous works on this
... Show MoreData-driven models perform poorly on part-of-speech tagging problems with the square Hmong language, a low-resource corpus. This paper designs a weight evaluation function to reduce the influence of unknown words. It proposes an improved harmony search algorithm utilizing the roulette and local evaluation strategies for handling the square Hmong part-of-speech tagging problem. The experiment shows that the average accuracy of the proposed model is 6%, 8% more than HMM and BiLSTM-CRF models, respectively. Meanwhile, the average F1 of the proposed model is also 6%, 3% more than HMM and BiLSTM-CRF models, respectively.
In this paper we will investigate some Heuristic methods to solve travelling salesman problem. The discussed methods are Minimizing Distance Method (MDM), Branch and Bound Method (BABM), Tree Type Heuristic Method (TTHM) and Greedy Method (GRM).
The weak points of MDM are manipulated in this paper. The Improved MDM (IMDM) gives better results than classical MDM, and other discussed methods, while the GRM gives best time for 5≤ n ≤500, where n is the number of visited cities.
The paper aims at initiating and exploring the concept of extended metric known as the Strong Altering JS-metric, a stronger version of the Altering JS-metric. The interrelation of Strong Altering JS-metric with the b-metric and dislocated metric has been analyzed and some examples have been provided. Certain theorems on fixed points for expansive self-mappings in the setting of complete Strong Altering JS-metric space have also been discussed.
Abstract
All of us are indispensable for this rule (the most important and important) individuals, whether we were groups of leaders or followers of peoples or countries because the rule provides adequate guarantees for the correct positions and drawing the plan for successful decision-makers matching with the balances of Sharia without incompatibility between religious or worldly interests or legal positions and therefore in the framework of the most important appointment And distinguish it from the important from the interests or the appointment of the most important and distinguish from the important from the evils and through this rule we learn about the scientific and practical solutions t
... Show MoreThis paper investigates some exact and local search methods to solve the traveling salesman problem. The Branch and Bound technique (BABT) is proposed, as an exact method, with two models. In addition, the classical Genetic Algorithm (GA) and Simulated Annealing (SA) are discussed and applied as local search methods. To improve the performance of GA we propose two kinds of improvements for GA; the first is called improved GA (IGA) and the second is Hybrid GA (HGA).
The IGA gives best results than GA and SA, while the HGA is the best local search method for all within a reasonable time for 5 ≤ n ≤ 2000, where n is the number of visited cities. An effective method of reducing the size of the TSP matrix was proposed with
... Show More