Amplatzer оклузија на паравалвуларен leak на механичка протеза по реоперација на дехисценција на митрална механичка протеза- Приказ на случај

Во трудот се опишува случајот на 46-годишна жена со парававуларното протекување или leak по второ заменување на митрална механичка протеза, кој е успешно третиран со Amplatzer оклузија на паравалвуларниот leak

Interventional Treatment of Pulmonary Valve Stenosis: A Single Center Experience

BACKGROUND: Percutaneous pulmonary valvuloplasty is well established treatment of choice in pulmonary valve stenosis.AIM: The aim of our study was to present our experience with the interventional technique, its immediate and mid-term effectiveness as well as its complication rate.MATERIAL AND METHODS: The study included 43 patients, where 33 (74%) of them were children between the age of 1 month and 15 years.RESULTS: The procedure was successful in 38 patients or 90%. Mean peak to peak transvalvular gradient was reduced from 91.2 mmHg (55-150 mmHg) to 39.1 mmHg (20-80 mmHg). Follow- up of patients was between 2 and 13 years and included echocardiographic evaluation of pulmonary valve gradient, right heart dimensions and function as well as assessment of pulmonary regurgitation. We experienced one major complication pericardial effusion in a 5 months old child that required pericardiocenthesis. Six patients (13.9%) required a second intervention. During the follow up period there was significant improvement of right heart function and echocardiography parameters. Mild pulmonary regurgitation was noted in 24 (55%) patients, and four (9%) patients developed moderate regurgitation, without affecting the function of the right ventricle.CONCLUSIONS: Percutaneous pulmonary valvuloplasty is an effective procedure in treatment of pulmonary stenosis with good short and mid-term results.Â

Transcatheter Closure of Patent Foramen Ovale: A Single Center Experience

BACKGROUND: Percutaneous transcatheter closure (PTC) of patent foramen ovale (PFO) is implicated in cryptogenic stroke, transitional ischemic attack (TIA) and treatment of a migraine.AIM: Our goal was to present our experience in the interventional treatment of PFO, as well as to evaluate the short and mid-term results in patients with closed PFO.MATERIAL AND METHODS: Transcatheter closure of PFO was performed in 52 patients (67.3% women, mean age 40.7 ± 11.7 years). Patients were interviewed for subjective grading of the intensity of headaches before and after the PFO closure.RESULTS: During 2 years of follow-up, there was no incidence of new stroke, TIA and/or syncope. Follow-up TCD performed in 35 patients showed complete PFO closure in 20 patients (57.1%). Out of 35 patients, 22 (62.9%) reported having a migraine before the procedure with an intensity of headaches at 8.1 ± 1.9 on a scale from 1 to 10. During 2 years of follow-up, symptoms of a migraine disappeared in 4 (18.2%) and the remaining 18 patients reported the significant decrease in intensity 4.8 ± 2.04 (p = 0.0001). In addition, following PFO closure the incidence of the headaches decreased significantly (p = 0.0001).CONCLUSIONS: Percutaneous transcatheter closure of PFO is a safe and effective procedure showing mid-term relief of neurological symptoms in patients as well as significant reduction of migraine symptoms

Analysis of Pattern Searching Algorithms and Their Application

Nowadays data is growing tremendously. Therefore, there is a great need to store and process data. The problem of Pattern Searching has different applications. When searching for text or words in computer application systems, Pattern searching is used to display the search results. The purpose of Pattern searching is to find text within another text. For example, searching for text in books will take a long time and is hard work. Using Pattern searching will save you time and effort. If similar words are found within the requested text, it will underline the word similar to what was requested, otherwise it does not display any matches if there are no similar words within a text.  This paper presents comparisons of the speed of different Pattern searching algorithms, precisely the Naive, KMP, Rabin-Karp, Finite Automata, Boyer-Moore, Aho-Corasick, Z Algorithm algorithms. We will test the time complexity of these algorithms in the three programming languages C#, Java and Python using three different CPUs. According to the results that appear in this comparison, we are able to perform the comparison between the programming languages and the comparison between the CPUs used in this research