Poets and Poetry of Modern Iran.

The accompanying thesis embodies a critical account of the poets and poetry of modern Iran. In the wake of the Constitutional movement in Iran, Persian poetry suffered a considerable change. If the classical poetry is theoretical in meaning and expression, the modern poetry is eminently practical: a new consciousness and a new outlook characterize it. In order to gather first-hand knowledge, I paid visits to Iran in 1930 and 1934. During eight months which I spent in the country, I visited important cities and centres of learning, and had long talks with the poets and poetesses. On returning to India, I published the materials collected in Iran in the form of an anthology entitled "Sukhanvaran-i Iran dar 'Asr-i Hazir" in two volumes, both of which were sympathetically reviewed in Great Britain, France, Germany, America, Iran and India, In 1934, I had the privilege of meeting Prof. V. Minorsky at the celebrations of Firdausi Millenary held at Tehran and Tus. Owing to his encouragement and supervision I have been able to present this thesis. The thesis comprises nine chapters. In its first part it deals with the preparatory period of modern Persian poetry and then introduces the poets chronologically, with their individual characteristics. In the second part the general problems are studied, such as the development in the language, metre and the contents of poetry. The changes are considered in their double aspect, that is both as an independent indigenous development and as a result of external influences. The sources from which I have derived my information are indicated in the body of the thesis or in the foot-notes. I wish to stress the fact that much of the material utilized in my thesis is inaccessible in the West and that the task of collecting them has been long and not devoid of the element of adventure

An improved optimization technique for estimation of solar photovoltaic parameters

The nonlinear current vs voltage (I-V) characteristics of solar PV make its modelling difficult. Optimization techniques are the best tool for identifying the parameters of nonlinear models. Even though, there are different optimization techniques used for parameter estimation of solar PV, still the best optimized results are not achieved to date. In this paper, Wind Driven Optimization (WDO) technique is proposed as the new method for identifying the parameters of solar PV. The accuracy and convergence time of the proposed method is compared with results of Pattern Search (PS), Genetic Algorithm (GA), and Simulated Annealing (SA) for single diode and double diode models of solar PV. Furthermore, for performance validation, the parameters obtained through WDO are compared with hybrid Bee Pollinator Flower Pollination Algorithm (BPFPA), Flower Pollination Algorithm (FPA), Generalized Oppositional Teaching Learning Based Optimization (GOTLBO), Artificial Bee Swarm Optimization (ABSO), and Harmony Search (HS). The obtained results clearly reveal that WDO algorithm can provide accurate optimized values with less number of iterations at different environmental conditions. Therefore, the WDO can be recommended as the best optimization algorithm for parameter estimation of solar PV

Antibiotic Resistance Bacteria in Tertiary Hospitals in Chittagong, Bangladesh

Nosocomial infections (HAI) are major cause for mortality and morbidity worldwide. In low income countries, data suggests 6.5% - 33% of patients have HAI with pneumonia being the most frequent..Antibiotic resistance is highly prevalent in developing countries due to self medication, easy availability and poor regulatory controls. Clinicians have been left with limited antibiotic drug options for the treatment of bacterial infections due to escalated rates of resistance. This comparative study aimed to identify microorganisms from hospital surfaces in two major tertiary care hospitals in Chittagong, Bangladesh. It also identifies antibiotic susceptibility of the samples to antibiotics commonly used in Bangladesh. Samples were collected by swabbing different environmental surface around patients in both hospitals. Identification of bacteria was done by culturing in nutrient media and various common biochemical techniques. Antibiotic sensitivity was determined by disk diffusion method. During the study, 27 samples were collected from different surfaces in different wards of the hospitals. The predominating organisms were Streptococcus, Staphylococcus, Bacillus, Pseudomonas and Serratia. The isolates of organisms showed high level of resistance to commonly used antibiotics especially a fourth generation cephalosporin, cefepime. In addition, antibiotic sensitivity tests showed small colonies or film of growth within zone of inhibition of some of the samples known as “satellite colonies”. The study identified bacterial isolates responsible for HAI in tertiary hospitals and their susceptibility to antibiotics. Further research is currently being conducted on understanding the satellite colonies some of the isolates from hospital surface swabs have exhibited

Organo-functionalized metal–oxide clusters: synthesis and characterization of the reduced cationic species [NaV IV 6 O 6 {(OCH 2 CH 2 ) 2 NH} 6 ] +

A new heteropolyoxovanadium compound, [NaV6O6{(OCH2CH2)2NH}6]·(OH)0.5Cl0.5·3(H2O), was synthesized and characterized by single-crystal X-ray diffraction analysis, cyclic voltammetry, FTIR and UV-vis spectroscopy, and TGA. [NaV6O6{(OCH2CH2)2NH}6]·(OH)0.5Cl0.5·3(H2O) contains the diethanolamine functionalized oxovanadium cationic cluster, [NaV(IV)6O6{(OCH2CH2)2NH}6](+). The cluster cation is composed of a fully reduced cyclic {NaV6N6O18} framework which adopts an Anderson-like structure and is comprised of a ring of six edge-sharing {VO5N} octahedra linked to a central {NaO6} unit. Two (OCH2CH2-) arms of each of the six diethanolamine ligands are incorporated into the oxometalate core. FTIR spectra are consistent with the presence of expected V=Ot stretching modes and functionalization with diethanolamine. Electrochemical and UV-vis absorption properties are consistent with two distinct MLCT processes: the characteristic V=Ot dπ-pπ interaction, and a second process occurring through the hydrogen-terminated nitrogen atoms (V-N-H) of the octahedra forming the cyclic {NaV6N6O18} core

Shooting permanent rays among disjoint polygons in the plane

We present a data structure for ray shooting-and-insertion in the free space among disjoint polygonal obstacles with a total of $n$ vertices in the plane, where each ray starts at the boundary of some obstacle. The portion of each query ray between the starting point and the first obstacle hit is inserted permanently as a new obstacle. Our data structure uses O(n log n) space and preprocessing time, and it supports m successive ray shooting-and-insertion queries in O(n log2 n + m log m) total time. We present two applications for our data structure: (1) Our data structure supports efficient implementation of auto-partitions in the plane i.e. binary space partitions where each partition is done along the supporting line of an input segment. If n input line segments are fragmented into m pieces by an auto-partition, then it can now be implemented in O(n log2n+m log m) time. This improves the expected runtime of Patersen and Yao's classical randomized auto-partition algorithm for n disjoint line segments to O(n log2 n). (2) If we are given disjoint polygonal obstacles with a total of n vertices in the plane, a permutation of the reflex vertices, and a half-line at each reflex vertex that partitions the reflex angle into two convex angles, then the folklore convex partitioning algorithm draws a ray emanating from each reflex vertex in the prescribed order in the given direction until it hits another obstacle, a previous ray, or infinity. The previously best implementation (with a semi-dynamic ray shooting data structure) requires O(n3/2-e/2) time using O(n1+e) space. Our data structure improves the runtime to O(n log2 n)

Relative Convex Hull Determination from Convex Hulls in the Plane

A new algorithm for the determination of the relative convex hull in the plane of a simple polygon A with respect to another simple polygon B which contains A, is proposed. The relative convex hull is also known as geodesic convex hull, and the problem of its determination in the plane is equivalent to find the shortest curve among all Jordan curves lying in the difference set of B and A and encircling A. Algorithms solving this problem known from Computational Geometry are based on the triangulation or similar decomposition of that difference set. The algorithm presented here does not use such decomposition, but it supposes that A and B are given as ordered sequences of vertices. The algorithm is based on convex hull calculations of A and B and of smaller polygons and polylines, it produces the output list of vertices of the relative convex hull from the sequence of vertices of the convex hull of A.Comment: 15 pages, 4 figures, Conference paper published. We corrected two typing errors in Definition 2: $I_S$ has to be defined based on $O_S$, and $I_E$ has to be defined based on $O_E$ (not just using $O$). These errors appeared in the text of the original conference paper, which also contained the pseudocode of an algorithm where $I_S$ and $I_E$ appeared as correctly define

Recurrence of A. Com – ACA Complex Cerebral Aneurysms after Coiling

Objective: To assess the recurrence of A.com-ACA complex cerebral aneurysms after coiling.Materials and Methods: This study was conducted from July 2010 to December 2013 at the department of Neuroradiology, PGMI, Lahore General Hospital, Lahore. A total of 50 patients with cerebral aneurysms at the level of A. Com – ACA complex were included in this study of both gender (male and female) and in the age range of 45 – 65 years.Results: Out of 50 patients, there were 20(40%) males and 30 (60%) female patients. Their age ranged from 45 - 65 years. The maximum numbers of patients were in their fifth and sixth decade of life. In our study successful coiling was done in all patients with minimal recurrence/recanalization of cerebral aneurysms at A.com-ACA complex.Conclusion: Coiling is minimally invasive endovascular procedure routinely performed to treat cerebral aneurysms with an aim to highlight the significance of recognizing the large sized aneurysms recurrence / recanalization by regular follow up and early intervention to decrease morbidity and mortality of the patients