Search or add a thesis

Advanced Search (Beta)
Home > اردو زبان کے مرکب افعال کی فرہنگ

اردو زبان کے مرکب افعال کی فرہنگ

Thesis Info

Author

ذوالفقار علی

Supervisor

محمد جلال الدین نعمانی

Program

Mphil

Institute

Riphah International University

Institute Type

Private

Campus Location

Faisalabad Campus

City

Faisalabad

Province

Punjab

Country

Pakistan

Thesis Completing Year

2016

Thesis Completion Status

Completed

Page

iii, 277 . : ill. ; 30 cm.

Subject

Urdu Literature

Language

Urdu

Other

Submitted in fulfillment of the requirements for the degree of Master of Philosophy in Urdu.; Includes bibliographical references; Thesis (M.Phil)--Riphah International University, 2016; Urdu; Call No: 891.43 ZUL

Added

2021-02-17 19:49:13

Modified

2023-02-19 12:33:56

ARI ID

1676712180225

Similar


Loading...
Loading...

Similar Books

Loading...

Similar Chapters

Loading...

Similar News

Loading...

Similar Articles

Loading...

Similar Article Headings

Loading...

بیوقوف بلی تے سیانے چوہے

بیوقوف بلی تے سیانے چوہے

پرانے زمانے دی گل اے کہ اک گھر وچ بلی رہندی سی۔ اوس دے تن بچے وی سن۔ بلی انتہائی بدمزاج تے لڑاکی سی۔ چھوٹی چھوٹی گل تے لڑنا اوس دی عادت سی۔ جس پاروں اوس نوں کوئی وی پسند نئیں سی کردا تے نا ای دوستی۔ جے کر اوہدے کولوں کوئی چیز منگن آندا تاں بلی اوس دی بے عزتی کردیندی۔ انتہائی کنجوس بلی ہر ویلے اپنے کول اک تھیلا رکھدی سی۔ اوس تھیلے وچ اوہنے اپنے بچیاں لئی کھان دا سامان رکھیا ہوندا۔ جے کر کوئی اوس کول کھان لئی کوئی شے منگدا تاں بلی اوس نوں نئیں سی دیندی۔ تھیلے وچ کیہ کجھ اے ایس بارے صرف بلی ای جاندی سی کہ ایس نے تھیلے وچ کوئی قیمتی شے لکائی ہوئی اے۔ ایس لئی اوس محلے دے سارے جانور خاص طور تے چوہے ایس ٹوہ وچ رہندے کہ ویکھیا جاوے کہ تھیلے وچ بلی نے کیہ کجھ لکویا اے ایس بارے صرف بلی ای جاندی سی۔ باقی دے جانوراں نوں ایہو پتہ سی کہ بلی نے ایس تھیلے وچ کوئی قیمتی شے لکائی ہوئی اے۔ پر بلی تھیلا ویکھن دا کوئی وی موقع کسے نوں نہ دتا۔

اک دن محلے دے سارے چوہے اکٹھے ہوئے تے پروگرام بنایا کہ بلی نوں اپنے بچیاں نال بہت پیار اے۔ جدوں رات نوں بلی سوں جاوے گی تاں اسیں اوس دے بچیاں دے کپڑے پاء کے آرام نال تھیلے دی تلاشی لے لواں گے۔ ایس دران جے بلی دی اکھ کھل وی گئی تاں اوہ اپنے بچے سمجھ کے ساہنوں کجھ وی نئیں آکھے گی۔

پروگرام دے مطابق جدوں ادھی رات نوں بلی تے اوہدے بچے گہری نیند سوں گئے تاں کجھ چوہے بلی دے کمرے وچ داخل ہوئے پہلاں اوہناں بلی دے...

Nexus of Gold Price-Exchange Rate-Interest Rate-Oil Price: Lessons for Monetary Policy in Pakistan

This study aims to evaluate the links among gold price, oil price, exchange rate and interest rate in Pakistan. All these channels are interconnected and have impact on monetary policy of the country. Monthly data ranging from 1995-01 to 2016-12 is used for the analysis based on VAR Model. Exchange rate depreciations are responded by tight monetary policy actions, which seem to have a significant effect on exchange rate stabilization process and raise gold price. Changes in oil prices at global level strongly affect the nexus in Pakistan. Monetary policy managers are suggested to take changes in gold prices as indicators of short-run fluctuations in Pakistan economy. The study contributes in two ways. Firstly, as a case study of Pakistan, it analyzes the role of gold market in response to changes in exchange rate and world oil prices. Secondly, the study links up monetary policy decisions to the nexus of gold price-oil price-exchange rate. Findings of the study may be useful for monetary policy makers, academia, and gold industry alike.

Receiver Driven Scheduling for Data Centers

Datacenters are a critical part of the Internet infrastructure as key enablers of cloud computing and web services like search, social networking, and advertising. Quick response to users is essential as a mere hundred milliseconds may lead to substantial revenue losses and drop in customer traffic. However, bursty traffic with high fan-in, oversubscribed links and constrained switch buffers make this a challenging problem. Current approaches to minimize response times range from arbiter based approaches where senders collectively obey global scheduling decisions, to self-adjusting end-host based approaches where senders independently adjust transmission rate based on network congestion. The former incurs greater overhead compared to the latter, which trades off complexityforsuboptimality. Ourworkseeksamiddleground-optimalityofarbiterbased approaches with the simplicity of self-adjusting end-host based approaches. Our thesis is that rather than having a centralized arbiter schedule flows or the senders making independent scheduling decisions, the receiver can coordinate the various flows destined for it to achieve quick response times. We observe that since the receiver has complete knowledge of the flows destined for it, it can coordinate between theses flows without incurring flow switching costs and the overhead of accessing an arbiter. We demonstrate the advantage of receiver driven flow scheduling by addressing two important problems in datacenter networks. First, we address TCP incast, which is the throughputcollapseassociatedwithseveralparallelflowsoverwhelmingtheswitchbuffers. State-of-the-artsolutionsworkwhenuserrequestsareservedbyrack-localmachines. Nowadays, inter-rack communication is also important. We propose RecFlow, which works in both scenarios. A RecFlow receiver spaces ACKs in order to maintain levels of inflight traffic which prevent switch buffer overflows. It calculates its share of the capacity based on the bottleneck information received using OpenFlow. Using packet level simulations, we show that compared to state-of-the-art, RecFlow achieves up to 6x and 1.5x goodput improvement in the inter-rack and the intra-rack scenario respectively. Next, we seek to minimize the number of missed deadlines. Preemptive Earliest DeadlineFirst(EDF)schedulingisconsideredsuitabletoachievethisobjective. However,stateof-the-art approaches that emulate preemptive EDF rely on global flow scheduling which requires customized hardware or a separate control plane. We propose WARDS, a receiver side scheduler which implements preemptive EDF among its flows, through the use of switch priority queues. By using apriori workload information, we probabilistically promote a small number of nearest deadline flows to the top switch queue, thereby reducing the level of multiplexing between nearest deadline flows and those with deadlines further away. Using packet level simulations, we show that WARDS is able to achieve up to 5x performance improvement over state-of-the-art end-host based solutions.