How Leadership Affects Organizational Change Process

Leadership seems to be the chief factor which aligns and coordinates with the organizational processes. Leadership of the organization is linked with the functioning and performance of the organization and it reflect how effective they are in achieving their desirable outcomes, (Lewis, Packard, and Lewis, 2007). Leadership styles, traits, approaches and strategies are the starting point of the change process. It goes to the large extent in affecting the management capacity by designing different systems in the organization Keywords: ,change process, leadership, Pakistani public sectors

Numerical study of flow and heat transfer in circular t-shaped junction of different cross-sections

This study investigates fluid flow and convective heat transfer within a smooth, two-dimensional T-shaped junction using a numerical approach. Simulations were conducted by varying the volumetric flow rate ratio r (0.25, 0.5, 0.75, and 1), the Reynolds number Re (500 to 2500), the Prandtl number Pr (1), and the cross-sectional width ratio w (0.5 to 2.5) of the outlet. The fluid dynamics were solved using the vorticity-stream function formulation with a compact upwind finite difference scheme and the Implicit-Explicit (IMEX) method, implemented in MATLAB. Flow behavior was analyzed through streamline and isotherm contours, while local and average Nusselt numbers were computed along the junction walls. The results show that lower r values lead to stronger vortex formation and asymmetry in the flow and temperature fields, while r = 1 yields symmetric and stable patterns. Increasing Re enhances heat transfer and transitions the flow toward unsteady regimes. Similarly, wider outlet configurations (higher w) promote recirculation and thermal mixing. This study provides valuable insights into how inlet flow, outlet shape, and fluid characteristics interact to influence heat transfer and flow behavior in a smooth T-shaped junction. It also provides insights that can help improve the design of heat exchangers, microfluidic systems, and industrial piping

Bacteriological Spectrum of Pediatric Urinary Tract Infection and Its Drug Sensitivity and Resistance Pattern

Introduction: - Urinary tract infection (UTI) is common infection in children. It has high morbidity and long term sequelae. Objective: To determine the frequency of bacteriological organism of Pediatric UTI and its drug sensitivity and resistance pattern and to improve the treatment of UTI according to culture sensitivity, hence to minimize the resistance pattern and disease burden. Material and methods: It was a descriptive cross sectional study conducted during 2018 over a period of 6 months. Total 225 children with UTI were enrolled. Urine culture and sensitivity reports were evaluated and an isolated microorganism along with their sensitivities to the mentioned drugs was entered through designed Performa. Results: - The average age of the children was 7±.18 years. Common bacteriological agents leading to UTI was E.Coli (59.1%), followed by  Pseudomonas aeruginosa (14.2%),  klebsiella (13.8%) , stapylococcus aureus (8.9%) and enterococcus (4%). Most common organism isolated was E.coli ( 133 cultures). It was fully resistant with amoxicillin clavulanate and ofloxacin (100%), while resistant pattern with other antibiotics, ceftriaxone (88.7%), imipenam (88.7%), ciprofloxacin (75.9%). the most effective antibiotic for E.coli was amikacin (81.2%). klebisella was isolated in 31 cultures. Conclusion: Most common organism that cause UTI was E.coli followed by Pseudomonas Aeroginosa and Klebsiella. These isolates were highly resistant to commonly used antibiotics. Therefore new antibiotics policy should be adopted to treat these infections

Bacteriological Spectrum of Pediatric Urinary Tract Infection and Its Drug Sensitivity and Resistance Pattern

Introduction: - Urinary tract infection (UTI) is common infection in children. It has high morbidity and long term sequelae. Objective: To determine the frequency of bacteriological organism of Pediatric UTI and its drug sensitivity and resistance pattern and to improve the treatment of UTI according to culture sensitivity, hence to minimize the resistance pattern and disease burden. Material and methods: It was a descriptive cross sectional study conducted during 2018 over a period of 6 months. Total 225 children with UTI were enrolled. Urine culture and sensitivity reports were evaluated and an isolated microorganism along with their sensitivities to the mentioned drugs was entered through designed Performa. Results: - The average age of the children was 7±.18 years. Common bacteriological agents leading to UTI was E.Coli (59.1%), followed by  Pseudomonas aeruginosa (14.2%),  klebsiella (13.8%) , stapylococcus aureus (8.9%) and enterococcus (4%). Most common organism isolated was E.coli ( 133 cultures). It was fully resistant with amoxicillin clavulanate and ofloxacin (100%), while resistant pattern with other antibiotics, ceftriaxone (88.7%), imipenam (88.7%), ciprofloxacin (75.9%). the most effective antibiotic for E.coli was amikacin (81.2%). klebisella was isolated in 31 cultures. Conclusion: Most common organism that cause UTI was E.coli followed by Pseudomonas Aeroginosa and Klebsiella. These isolates were highly resistant to commonly used antibiotics. Therefore new antibiotics policy should be adopted to treat these infections

SYNTHESIS OF NANO - HYDROXYAPATITE AND NANO - FLUOROAPATITE PARTICLES BY SOL-GEL METHOD

Background: Hydroxyapatite is a material which resembles the composition and crystal structure of hard tissues in human body. It is being used in dentistry as a bioactive material in dental implants and is a major constituent in the bone regenerative materials. Fluoroapatite is also a bioactive material and is more stable than Hydroxyapatite. The fluoride content is anti - bacterial and is working very efficiently as a component of dental restorative materials. Objective: The objective is to synthesize the nano Hydroxyapatite and nanoFluoroapatite powder via sol-gel method, and compare the FTIR and Raman Spectrums of synthesized material with the FTIR and Raman of nano Hydroxyapatite and Fluoroapatite. Methods: The materials were synthesized by sol - gel method and then evaluated by the FTIR and Raman spectroscopy to confirm the chemical structure of both the materials. Results: FTIR and Raman Spectroscopy of the synthesized Hydroxyapatite and Fluoroapatite are then evaluated and compared with market grade materials, which confirm the presence of hydroxyl, phosphate and carbonate group in the obtained samples. Conclusion: Sol - gel is proved to be a reliable and simple method for the synthesis of nano Hydroxyapatite and Fluoroapatite particles. The obtained samples then compared with the available materials to confirm that the material synthesized is pure and chemically identical

Developing System MathNat for Automatic Formalization of Mathematical texts

Le langage mathématique courant et les langages mathématiques formelssont très éloignés. Par > nousentendons la prose que le mathématicien utilise tous les jours dansses articles et ses livres. C'est une langue naturelle avec desexpressions symboliques et des notations spécifiques. Cette langue està la fois flexible et structurée mais reste sémantiquementintelligible par tous les mathématiciens.Cependant, il est très difficile de formaliser automatiquement cettelangue. Les raisons principales sont: la complexité et l'ambiguïté deslangues naturelles en général, le mélange inhabituel entre languenaturelle et notations symboliques tout aussi ambiguë et les sautsdans le raisonnement qui sont pour l'instant bien au-delà descapacités des prouveurs de théorèmes automatiques ou interactifs.Pour contourner ce problème, les assistants de preuves actuelsutilisent des langages formels précis dans un système logique biendéterminé, imposant ainsi de fortes restrictions par rapport auxlangues naturelles. En général ces langages ressemblent à des langagesde programmation avec un nombre limité de constructions possibles etune absence d'ambiguïté.Ainsi, le monde des mathématiques est séparé en deux, la vastemajorité qui utilise la langue naturelle et un petit nombre utilisantaussi des méthodes formelles. Cette seconde communauté est elle-mêmesubdivisée en autant de groupes qu'il y a d'assistants de preuves. Onperd alors l'intelligibilité des preuves pour tous les mathématiciens.Pour résoudre ce problème, on peut se demander:est-il possible d'écrire un programme qui comprend la langue naturellemathématique et qui la traduit vers un langage formel afin depermettre sa validation?Ce problème se subdivise naturellement en deux sous-problèmes tous lesdeux très difficiles:1. l'analyse grammaticale des textes mathématiques et leur traductiondans un langage formel,2. la validation des preuves écrites dans ce langage formel.Le but du projet MathNat (Mathematics in controlled Natural languages)est de faire un premier pas pour répondre à cette question trèsdifficile, en se concentrant essentiellement sur la première question.Pour cela, nous développons CLM (Controlled Language for Mathematics)qui est un sous-ensemble de l'anglais avec une grammaire et un lexiquerestreint, mais qui inclut tout de même quelques ingrédientsimportants des langues naturelles comme les pronoms anaphoriques, lesréférences, la possibilité d'écrire la même chose de plusieursmanières, des adjectifs distributifs ou non, ...Le second composant de MathNath est MathAbs (Mathematical Abstractlanguage). C'est un langage formel, indépendant du choix d'un systèmelogique permettant de représenter la sémantique des textes enpréservant leur structure et le fil du raisonnement. MathAbs est conçucomme un langage intermédiaire entre CLM et un système logique formelpermettant la vérification des preuves.Nous proposons un système qui permet de traduire CLM vers MathAbsdonnant ainsi une sémantique précise à CLM. Nous considèrons que cetravail est déjà un progrès notable, même si pour l'instant on estloin de pouvoir vérifier formellement toutes les preuves en MathAbsainsi générées.Pour le second problème, nous avons réalisé une petite expérience entraduisant MathAbs vers une liste de formules en logique du premierordre dont la validité garantit la correction de la preuve. Nous avonsensuite essayé de vérifier ces formules avec des prouveurs dethéorèmes automatiques validant ainsi quelques exemples.There is a wide gap between the language of mathematics and itsformalized versions. The term "language of mathematics" or"mathematical language" refers to prose that the mathematician uses inauthoring textbooks and publications. It mainly consists of naturallanguage, symbolic expressions and notations. It is flexible,structured and semantically well-understood by mathematicians.However, it is very difficult to formalize it automatically. Some ofthe main reasons are: complex and rich linguistic features of naturallanguage and its inherent ambiguity; intermixing of natural languagewith symbolic mathematics causing problems which are unique of itskind, and therefore, posing more ambiguity; and the possibility ofcontaining reasoning gaps, which are hard to fill using the currentstate of art theorem provers (both automated and interactive).One way to work around this problem is to abandon the use of thelanguage of mathematics. Therefore in current state of art of theoremproving, mathematics is formalized manually in very precise, specificand well-defined logical systems. The languages supported by thesesystems impose strong restrictions. For instance, these languages havenon-ambiguous syntax with a limited number of possible syntacticconstructions.This enterprise divides the world of mathematics in two groups. Thefirst group consists of a vast majority of mathematicians whose relyon the language of mathematics only. In contrast, the second groupconsists of a minority of mathematicians. They use formal systems suchas theorem provers (interactive ones mostly) in addition to thelanguage of mathematics.To bridge the gap between the language of mathematics and itsformalized versions, we may ask the following gigantic question:Can we build a program that understands the language of mathematicsused by mathematicians and can we mechanically verify its correctness?This problem can naturally be divided in two sub-problems, both very hard:1. Parsing mathematical texts (mainly proofs) and translating thoseparse trees to a formal language after resolving linguistic issues.2. Verification of this formal version of mathematics.The project MathNat (Mathematics in controlled Natural language) aimsat being the first step towards solving this problem, focusing mainlyon the first question.First, we develop a Controlled Language for Mathematics (CLM) which isa precisely defined subset of English with restricted grammar anddictionary. To make CLM natural and expressive, we support some richlinguistic features such as anaphoric pronouns and references,rephrasing of a sentence in multiple ways and the proper handling ofdistributive and collective readings.Second, we automatically translate CLM to a system independent formaldescription language (MathAbs), with a hope to make MathNat accessibleto any proof checking system. Currently, we translate MathAbs intoequivalent first order formulas for verification