Search from the Journals, Articles, and Headings
Advanced Search (Beta)
Loading...
Loading...
Loading...
Loading...
Loading...
Loading...

ڈاکٹر ضیاء الدین ڈیسائی

ڈاکٹر ضیاء الدین ڈیسائی مرحوم
(ڈاکٹر محمد الیاس الاعظمیٰ)
۲۴؍ مارچ ۲۰۰۲؁ء کو آثارِ قدیمہ و علمِ کتبات کے ماہر اور مرکزی حکومت کے ادارے برائے کتبہ شناسی ناگ پور کے سابق ڈائریکٹر ڈاکٹر ضیا الدین ڈیسائی نے ۷۷ سال کی عمر میں احمد آباد میں داعیِ اجل کو لبیک کہا، اناﷲ وانا الیہ راجعون۔
وہ کئی ماہ سے علیل اور احمد آباد کے ایک اسپتال میں داخل تھے، ان کی وفات کی اطلاع اس لیے تاخیر سے ملی کہ ان دنوں احمد آباد بلکہ گجرات میں آگ اور خون کی ہولی کھیلی جاری تھی جس میں ہزاروں انسان زندہ جلادئے گئے اور لاکھوں بے خانماں اور برباد ہو کر اپنے ہی وطن میں بے وطن ہوکر رہ گئے۔ خود ڈیسائی صاحب مرحوم کے صاحبزادے کی دوا کی دکان بھی شرپسندوں نے جلادی تھی، چنانچہ اس ہولناک قتل عام کی وجہ سے اور خبریں دب گئیں اور ڈاکٹر ضیاء الدین ڈیسائی کے حادثہ انتقال کی خبر بھی نہ لگ سکی اور وہ کرفیو کے دوران سپرد خاک کردئے گئے۔
ڈاکٹر ضیاء الدین ڈیسائی مرحوم احمد آباد کے رہنے والے تھے۔ ۱۸؍ مئی ۱۹۲۵؁ء میں پیدا ہوئے۔ ان کی تعلیم بمبئی میں ہوئی تحصیلِ علم کے بعد وہ درس و تدریس سے وابستہ ہوگئے کچھ دنوں تک اسمٰعیل یوسف کالج بمبئی اور دھرمندر سنگھ کالج راج کوٹ سے بطور لکچرر وابستہ رہے۔ ۱۹۵۳؁ء میں آرکیالوجیکل سوسائٹی آف انڈیا ناگ پور کے اسسٹنٹ سپرنٹنڈنٹ برائے کتبات مقرر ہوئے پھر سپرنٹنڈنٹ ہوئے اور آخر میں ترقی کر کے ڈائریکٹر برائے کتبات کے عہدہ پر فائز ہوئے اور اسی عہدہ سے ۱۹۸۰؁ء میں سبکدوش بھی ہوئے۔
ڈاکٹر ضیاء الدین ڈیسائی مرحوم ملک کے ممتاز عالم و محقق تھے۔ تاریخ و آثار اور کتبات ان کا خاص موضوع تھا، ہندوستان کے عہد و سطیٰ کی تاریخ پر گہری نظر رکھتے تھے۔...

Awareness and Utilisation of Primary Healthcare to Reduce Emergency Department Overcrowding in Saudi Arabia

Background Patients seeking emergency department (ED) care for non-acute conditions are a major contributor to ED overcrowding, which results in longer wait times. Method This was a cross-sectional study, conducted using an online survey among the Saudi population to assess their awareness about primary healthcare clinics (PHCCs) and urgent care clinics (UCCs), their role, and their scope of practice. Results A total of 565 participants were included in this study. Most of the respondents (81.1%) reported lengthy waiting times in the ED. Moreover, most (81.6%) stated that they had never visited a family doctor, yet they (92.6%) favoured having one for follow-up care. Close to half of the participants (50.3%) reported attending PHCCs without an appointment, and the majority of them (69.2%) said that PHCCs were overcrowded. Finally, most participants (92.4%) had not heard aboutUCCs. Conclusion ED overcrowding and prolonged waiting times remain a public concern. PHCCs and UCCs are underutilised, and this is attributed to the lack of awareness about their scope and their services.  

Scalable Distributed Hash Table Based Routing With Distributed Partition Detection and Mergig I Mobile Ad Hoc Network

Distributed Hash Table (DHT)-based routing in Mobile Ad Hoc Networks (MANETs) completely eliminates flooding at the control plane as well as at the data plane, thus makes the network scalable. In DHT-based MANETs, a logical structured network is built over the ad hoc physical topology in a fully distributed manner and routing is performed using logical identifiers (i.e. transient addresses) rather using IP addresses. This thesis investigates the DHT-based routing paradigm in MANETs and points out that existing state-of-the-art DHT routing protocols assume ideal network environments and, ignore the adversarial environment offered by MANETs. Limited radio range, mobility, lack of infrastructure and decentralized nature introduce frequent and unpredictable changes to network topology in MANETs (i.e. connectivity/dis-connectivity, node(s)/link(s) failure, network partition, frequent merging). The network dynamics severely damage the logical structured network (i.e. the logical space (LS) distributed among the nodes) and completely halt communication. Specifically, existing work fails to address issues such as node(s)/link(s) failure and its impact (i.e. anchor node failure and lookups), network partitioning, lost LS recovery and reusing (i.e. disrupted LS) and merging considerations. Curtailing the information loss due to the network dynamics is imperative for the successful communication in DHT networks. Similarly, the key factor that defines overall routing performance in DHT networks is the successful resolution of lookup requests with minimum possible delay. However, we found that existing DHT protocols suffer from longer delay and, fail to ensure the successful resolution of the lookup requests. Therefore, effective distributed solutions under the scalability constraints are needed to tolerate the faults in the logical network and to provide end-to-end connectivity in such an adversarial environment. It is worthy to mention that the targeted problems are completely unexplored and had never been addressed by the research community. For the first time, we are exploring the problems and providing solutions under the constraints. The first part of our work explores the impact of network dynamics on the intrinsics of DHT routing (i.e. lookup requests and successful resolution with minimum delay). A novel address publication mechanism, also called Anchor Request, is proposed. The mechanisms exploit k-hop topological information to detect critical regions in the network and replicate the index information (stored on the anchor node) across those regions. The considered prefailure measures (i.e critical regions detection and replication) are found to have good side effects on the resolution of lookup requests and delay, despite the failures. Simulation results endorse the significant gains in terms of lookup delay and success ratio. The second part targets the problems of distributed partition detection, unavailability of the anchor node due to partition, lost logical space (LS) recovery and reusing, and merging in DHT networks. We are using the philosophies of detection, replication and recovery to solve the identified problems. The proposed solutions ensure access to the index information despite the network partition. Similarly, prior to the network partition event, LS recovery and reusing is performed, this contributes an evenly distributed and connected logical network. The LS recovery process maintains evenly distributed LSs in each instance of the network after partition. Also, this sets grounds for smooth merging of the disjoint instances. Simulation results confirm the effectiveness of the proposed solutions.
Asian Research Index Whatsapp Chanel
Asian Research Index Whatsapp Chanel

Join our Whatsapp Channel to get regular updates.