بندھن کا بوجھ
ثمینہ سید(لاہور.پاکستان)
"اس سے پہلے کہ آپ ہمیں کہیں سیر کےلیے لے جاتے,یا ہمارے ساتھ باہر کی دنیا میں سانس لیتے.کچھ یادگار وقت بتاتے.یہ دن آگئے.اور اب........آپ بھی اس قید کے ہاتھوں بے بس ہیں.بہت شوق تھا اکیلے صبح سے شام بلکہ رات گئے تک مٹرگشتی کا. اب کیجئے جناب."
شفق نے مسکراتے ہوئے گہرا طنز کیا.تو حبیب احمد اسے گھور کررہ گئے.جزبز ہوتے اٹھے اور غصے سے بولے
"بچوں کے سامنے میری بےعزتی کرنے سے فرصت ملے تو ایک کپ چائے لاؤنج میں پہنچا دینا..اور ہاں ملازمہ کے ہاتھ بھیجنا."
"جی اچھا" شفق نے شانے اچکائے.ان رویوں نے اسے بھی لاپرواہ بنا دیا تھا.وہ اس خوش فہمی سے نکل آئی تھی کہ بیوی نہ چاہتے ہوئے بھی" ملازمہ "بنی رہے تو دل میں جگہ بنا ہی لے گی..کچھ دیر بیٹھی رہی بچوں کی کھلی کتابوں میں دلچسپی کی کوئی چیز ,کچھ نیا ڈھونڈنے کی کوشش کرتی رہی.کیونکہ پچھلے ایک سال سے یہی سب کچھ ہورہا تھا.وبا کے ہاتھوں قیدوبند کی صعوبتیں,آن لائن کلاسز,کھانے پکانے,ایکدوسرے کی ہی شکلیں دیکھنا, بےوقت چائے اور طنزیہ بک بک.
کبھی کبھار سکول والوں کے پرزور اصرار پر شفق اور حبیب احمد کو سلیقے سے تیار ہوکر کمپیوٹر کے آگے بھی بیٹھنا پڑتا.والدین کی حیثیت سے بہت سی چیزیں سمجھنا پڑتیں اور کئی طرح کے سوالوں کے جواب دینا پڑتے. وہ خود بہت ذہین فطین طالبہ تھی.ہمیشہ پہلی پوزیشن پہ اسی کی اجارہ داری رہتی تھی .یونیورسٹی میں بھی گولڈ میڈل سے نوازا گیا تھا.اس کی بڑی وجہ یہ تھی کہ اسکے ابا اس کی پسند اور دل چسپی کو ترجیح دیتے تھے . اسی کی منتخب کردہ سمت میں اسے چلنے دیا جاتا تھا .ناصرف اس کا ساتھ دیتے پیسہ...
Technically, Naskh refers to the abrogation of a religious ruling through another religious ruling involving commands and prohibitions, and, the abrogation being either through a Qur’anic statement, Hadith, or consensus of the Ummah. There can be, and has not been, abrogation of a spiritual matter, moral, historical, exhorting statements, doctrinal, or Allah's attributes. Allah said We do not abrogate a verse, or cause it to be forgotten, but substitute with one better than it or similar to it. Do you not know that Allah has power over everything?” (Al Baqarah: 106). Naskh involves two elements: naasikh (the abrogating one), and mansukh (the abrogated one). This is an important discipline for those who attempt deeper understanding of the Qur’an. There were several points of wisdom behind abrogation in early Islam. For centuries, human societies lived a certain kind of life: closer to beastly than human. Their situation could only be changed gradually. That required allowing certain things in the early stages of change and development, to be disallowed later.
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.