مولانا محفوظ الرحمن نامی
افسوس ہے پچھلے دنوں مولانا محفوظ الرحمن صاحب نامی بھی وفات پاگئے۔مرحوم دیوبند کے تعلیم یا فتہ اور علماً وعملاً اس کی روایات کے حامل تھے۔ آزادی کے بعد اتر پردیش میں پارلیمنٹری سکریٹری بھی ہوگئے تھے اور اسی زمانہ میں راقم الحروف کواُن کے ساتھ قیام کرنے اور ان کی فیاضانہ مہربانی سے لطف اندوز ہونے کا متعددبار موقع ملاتھا۔مگریہ جامۂ تنگ ان کے قامت آزاد پر راس نہیں آیا۔اس لیے جلدہی استعفاء دے دامن جھاڑ کر کھڑے ہوگئے اوراب انھوں نے اپنی زندگی مسلمان بچّوں اور بچّیوں کوقرآن مجید کی تعلیم کے ساتھ ساتھ عربی زبان کی تعلیم کے لیے وقف کردی جومرحوم کے نزدیک ملک کے موجودہ حالات میں مسلمانوں کودین پرقائم رکھنے کے لیے بہت ضروری تھی۔چنانچہ اس سلسلہ میں ایک نئے طرز پرانھوں نے متعدد رسالے اور کتابیں لکھیں اوراُن کی اشاعت اورتبلیغ کے لیے دوردراز کے سفر کیے۔ کام ہمت اور طاقت سے بہت زیادہ تھا اس لیے اچانک فالج کاحملہ ہوا اور اس میں ایسے مبتلاہوئے کہ ایک مرتبہ جوپڑے توپھر اٹھنا نصیب نہیں ہوا ۔آخر پانچ چھ برس کی مسلسل معذوری اور بے بسی کے بعد گذشتہ ماہ داعی اجل کو لبیک کہہ گئے ۔رحمہ اﷲ رحمۃً واسعۃً۔ [دسمبر ۱۹۶۳ء]
The jurisprudence is the essence of Islamic teachings. It is the summary of Qurʼān and the soul of Messenger’s (on whom be peace and greetings) sunnah. In general, it represents the sharīaʻh and the path to follow for Islamic lifestyle. Therefore, the significance of its importance is clear in Islamic Studies. The scholars have been kept solving ummah problems through religious principles and will keep solving the problems till the day of judgement. Whenever there arises a new problem, the scholars provide the solution in the lights of Qurʼān and Hadith and set the rules till the day of judgement. Allama ʻAbdul Razzāq Bhutrālwī also presented the solutions to different problem using the same principle i.e. He interprets a Quranic verse in such a way that provide the implied solution for paying ransom to poor against fasting for traveler and patient. Allama ʻAbdul Razzāq Bhutrālwī discussed about the permission for women to visit graveyard by following the orders of Prophet (on whom be peace and greetings), when it was prohibited for everyone to go to graveyards but later on the permission was granted for the same act. In the same way Allama ʻAbdul Razzāq Bhutrālwī presented his argument about the burning or sinking into the water or burying the shabby pages the Holy Qurʼān based on an order of Hazrat Uthman Ghani to burn all the copies of the Holy Qurʼān except Qurat-e-Quraish to bring uniformity
Queueing Network Models (QNMs) with Finite Capacity provide powerful and realistic tools for the performance evaluation and prediction of discrete flow systems such as computer systems, communication networks and flexible manufacturing systems. Over recent years, there has been a great deal of progress towards the analysis and application of QNMs with finite capacity, and high quality research work has appeared in diverse scientific journals of learning and conference proceedings in the fields of Operations Research, Computer Science, Telecommunication Networks, Management and Industrial Engineering. However, there are still many important and interesting finite capacity queues and QNMs to be resolved, such as those involving multiple-job classes, bounds and theoretical properties, exact analysis, numerical solutions and approximate methods, as well as application studies to computer and distributed systems, high-speed networks and production systems. Finite capacity queueing network models (QNMs) also play an important role towards effective congestion control and quality of service (QoS) protection of modern discrete flow networks. Blocking in such networks arises because the traffic of jobs through one queue may be momentarily halted if the destination queue has reached its capacity. Exact closed-form solutions for QNMs with blocking are not generally attainable except for some special cases such as two-station cyclic ivqueues and ‘reversible’ queueing networks. As a consequence, numerical techniques and analytic approximations have been proposed for the study of arbitrary QNMs with non-Markovian (external) inter- arrival and service times under various types of blocking mechanisms. This research mainly focuses on: i) To develop and validate cost effective analytical models for arbitrary QNMs with blocking and multiple job classes. ii) To use the analytical models to evaluate the performance of QNMs under various blocking mechanisms applicable to flexible manufacturing systems and high speed telecommunication networks. iii) To develop approximate analytical algorithms for arbitrary QNMs consisting of G/G/1/N censored-type queues with arbitrary arrival and service processes, single server under Partial Buffer Sharing (PBS) and Complete Buffer Partitioning (CBP) schemes stipulating a sequence of buffer thresholds {N=N1,N2,...,NR,0< Ni ≤ Ni-1 , i=1,2,...,R} and buffer partitioning with FCFS service discipline. {chapter 4 and 5} iv) Validation of these algorithms (iii) using QNAP simulation package. v) Extension of the above algorithms for multiple servers and its validation using simulation. Determining a performance distribution via classical queueing theory may prove to be an infeasible task even for systems of queues with moderate complexity. Hence, the principle of entropy maximization may be applied to characterize useful information theoretic approximations of performance distributions of queueing systems and queueing network models (QNMs). vFocusing on an arbitrary open QNM, the ME solution for the joint state probability, subject to marginal mean value constraints, can be interpreted as a product-form approximation. Thus, the principle of ME implies a decomposition of a complex QNM into individual queues each of which can be analyzed separately with revised inter arrival and service times. Moreover, the marginal ME state probability of a single queue, in conjunction with suitable formulae for the first two moments of the effective flow, can play the role of a cost-effective analytic building block towards the computation of the performance metrics for the entire network.