nyuuzyou/kompy huggingface dataset:
Izоh - Tayyorlash va ularning malakasini oshirishni tashkil etish bosh ilmiy metodik markazi toshkent axborot texnologiyalari...

Tayyorlash va ularning malakasini oshirishni tashkil etish bosh ilmiy metodik markazi toshkent axborot texnologiyalari universiteti
Linux OT
|
Bosh sahifa
Aloqalar Bosh sahifa Tayyorlash va ularning malakasini oshirishni tashkil etish bosh ilmiy metodik markazi toshkent axborot texnologiyalari universiteti
|
O‘rama, ldpc va Turbo kodlar - bet 11

|
O‘rama, ldpc va Turbo kodlar
|
bet | 11/13 | Sana | 23.05.2024 | Hajmi | 1,42 Mb. | | #251640 |
Bog'liq 10-mavzu O‘rama, LDPC va Turbo kodlar. Kodlash usulini kodli kombinasiyalarni qismlarga bo‘lish orqali amalga oshiramiz. PKning yuklama o‘lchovi kodli kombinasiyaning uzunligiga bog‘liq bo‘lgan xolda kodlash uchun zarur bo‘lgan vaqt va tekshiriladigan razryadlar soni 1 jadvalda keltirilgan. Jadvalda keltirilgan ma’lumotlardan ko‘rinib turibdiki, matritsali usul mashina vaqtining katta sarfini talab qilmaydi. Lekin kodning uzunligi ortishi bilan jadval uchun kerakli xotira xam oshib boradi. Jadvalda keltirilgan ma’lumotlardan ko‘rinib turibdiki, matritsali usul mashina vaqtining katta sarfini talab qilmaydi. Lekin kodning uzunligi ortishi bilan jadval uchun kerakli xotira xam oshib boradi. Jadval usulining a’malga oshirilishida PK xotirasiga 0 dan 2k gacha tekshiriluvchi razryadlarga tegishli natural sonlar o‘sib borish tartibida joylashadi va ma’lumotlar kombinasiyalarining mumkin bo‘lgan qiymatlaridan tuzilgan matritsa yoziladi. Tekshirilayotgan razryadlar oldindan berilgan kodni kodlash qoidasi bo‘yicha xisoblanadi. Buning uchun kodli kombinasiya qiymatini ko‘rsatuvchi jadval satrining tartibini bilish kifoya. Bundan maqsad kodlangan so‘zni aniqlashdir. Jadval usuli uchun xioblangan xotira xajmi kodning uzunligiga bog‘liq va unga asosan vaqt va yuklama xaqida ma’lumot 4 jadvalda keltirilgan. Jadvaldagi ma’lumotdan ko‘rinib turibdiki, kodlashning bu usuli xotira yuklamalari va kodning qisqa uzunlik xolatida mashina vaqtining kam sarfini talab qilar ekan. Kod uzunligi oshgan sari esa jadval uchun xotira xajmi xam oshib boradi. Jadvaldagi ma’lumotdan ko‘rinib turibdiki, kodlashning bu usuli xotira yuklamalari va kodning qisqa uzunlik xolatida mashina vaqtining kam sarfini talab qilar ekan. Kod uzunligi oshgan sari esa jadval uchun xotira xajmi xam oshib boradi. Yuqoridagi jadvalni taxlil qilish natijasi shuni qo‘rsatadiki, katta bo‘lmagan uzunlikdagi kodlarda amalga oshirish qiyinligi tomondan eng qulay xisoblanadi. Chunki bu usul PKdan kam yuklamani va ancha katta bo‘lmagan kodlash vaqtini talab qilar ekan. Shuningdek kattalik o‘zgarish yo‘li bilan qismlarga bo‘lish usuli kam yuklama va vaqt tomondan yaxshi natijalarga ega. Biroq katta uzunlikdagi kodlarda ushbu ikkinchi usuldan foydalanish samarasiz bo‘lib qoladi. Chunki bunda PKdan sezilarli xotira sarfini talab qilmaydigan to‘g‘ridan-to‘g‘ri bo‘lish usuli eng yaxshi xisoblanadi.
|
| |
O‘rama, ldpc va Turbo kodlar - bet 10

|
O‘rama, ldpc va Turbo kodlar
|
bet | 10/13 | Sana | 23.05.2024 | Hajmi | 1,42 Mb. | | #251640 |
Bog'liq 10-mavzu O‘rama, LDPC va Turbo kodlar.Birinchi usul tizim kodini xosil qiladi. Bunda informasion belgilar, r- ning qolgan o‘rinlariga tekshirilgan, k-ning birinchi o‘rnida joylashadi. Ikkinchi usulda tizimlashmagan kod xosil bo‘ladi. Bunda tekshirilgan belgilar va ma’lumotlar aniq ko‘rinishda bo‘lmaydi. Shunga qaramasdan shovqinbardosh kodlarda tizimli va tizimlashmagan kodlar tengdir. Kodli ko‘plik o‘zgarmaydi, faqat xar bir so‘zli ma’lumot uchun kodli so‘zga mos xolda tartibi o‘zgaradi. Bunday tasdiqning to‘g‘riligini birinchi va ikkinchi usuldan foydalangan xolda tuzilgan 1 tasvir asosida ko‘rishimiz mumkin. Ruxsat etilgan birinchi kodli kombinasiya usulda avtomatizasiyani qurishda u yoki bu dasturlash algoritmi usullaridan ma’lumotlarni siklik kodlash jarayonlarida foydalaniladi: - Kodli xabarlarni qismlarga bo‘lish orqali;
- Kodli axborotni to‘g‘ridan -to‘g‘ri bo‘lish orqali;
- Matritsa usulida;
d) jadval usulida. 1-rasm. Turli xil usullarda olingan kodli kombinasiyalarning o‘zaro bog‘liqligi. 1-rasm. Turli xil usullarda olingan kodli kombinasiyalarning o‘zaro bog‘liqligi. Mavjud kodlash algoritmlariga asoslangan xolda dasturning murakkabligini baxolashni a’malga oshiramiz. Buning uchun xotira xajmi va kodlash uchun talab qilinadigan vaqtni yuklamani xisoblashimiz zarur. Kodli kombinasiyaga ishlov berish jarayonida operasiyalar miqdori: Mavjud kodlash algoritmlariga asoslangan xolda dasturning murakkabligini baxolashni a’malga oshiramiz. Buning uchun xotira xajmi va kodlash uchun talab qilinadigan vaqtni yuklamani xisoblashimiz zarur. Kodli kombinasiyaga ishlov berish jarayonida operasiyalar miqdori: A0=An+AsK (3) shu formula orqali aniqlanadi. Bu erda: A0 – kodlash uchun zarur bo‘lgan umumiy jarayonlar miqdori; An – bir marta bajariladigan operasiyalar miqdori; As – siklda bajariladigan operasiyalar miqdori ; K – kodlashning uslubiga bog‘liq bo‘lmagan xolda o‘zgaruvchi sikllar miqdori.
|
| |
Nazorat uchun savollar - 2 amaliyot ishi

|
2 amaliyot ishi
|
bet | 3/3 | Sana | 24.11.2023 | Hajmi | 66,22 Kb. | | #104561 |
Bog'liq 2-амалий иш
GSM standartining asosiy texnik xarakteristikalari.
GSM standartining tuzilish sxemasi.
MSC mobil aloqani kommutatsiya qilish markazi tomonidan bajariladigan vazifalar va funksiyalarni tushuntiring.
HLR va VLR registralarida saqlanadigan uzoq muddatli ma’lumotlar tarkibini sanab bering.
Abonent aslligi tarmoq bilan tekshirish protsedurasi qanday amalga oshiriladi?
IWF tarmoqlararo funksional tutashuvi va ES aks-sado bosuvchining vazifasini tushuntiring.
OMS ekpluatatsiya qilish va texnik xizmat ko‘rsatish markazi tomonidan bajariladigan funksiyalar.
«Ustuvor foydalana olish» atamasini tushuntiring. Qaysi blok ushbu protsedurani amalga oshiradi?
Tayanch stansiya BSS uskunasining tarkibi va uning vazifasini tushuntiring.
TSE transkoderning vazifasi.
Raqamli harakatdagi stansiyaning tuzilish sxemasini tushuntiring.
HLR va VLR da saqlanadigan uzoq muddatli ma’lumotlar tarkibini tushintiring.
|
| |
8-laboratoriya ishi bajardi: Qurbonov Temur Tekshirdi: Berdimuradov Mirzohid Toshkent 2023

|
8-laboratoriya ishi bajardi: Qurbonov Temur Tekshirdi: Berdimuradov Mirzohid Toshkent 2023
|
Sana | 20.11.2023 | Hajmi | 0,6 Mb. | | #101949 |
Bog'liq 8-laboratoriya
MUHAMMAD AL-XORAZMIY NOMIDAGI TOSHKENT AXBOROT TEXNOLOGIYALARI UNIVERSITETI
TELEKOMMUNIKATSIYA TEXNOLOGIYALARI
Fakulteti 417-20 guruh talabasi Qurbonov Temurning
Tarmoqni dasturlash asoslari fanidan
8-LABORATORIYA ISHI
Bajardi: Qurbonov Temur
Tekshirdi: Berdimuradov Mirzohid
Toshkent 2023
8-LABORATORIYA ISHI
Mavzu: AJAX asosida tarmoq dasturini yaratish
Ishning maqsadi:
Talabalarda Java dasturlash tilida XMLHttpRequest obyektidan foydalanib AJAX asosida tarmoq dasturini yaratish bo‘yicha amaliy ko‘nikmalar hosil qilish.
Nazariy qism:
AJAX (Asinxron JavaScript va XML) bu ko‘plab veb-texnologiyalardan foydalangan holda kliyent tomonida asinxron veb-ilovalarni yaratuvchi vositalar to‘plami. Ajax yordamida veb-ilovalar sahifasining ko‘rinishi va ishiga xalaqit bermasdan ma’lumotni serverdan (fonda) asinxron ravishda yuborishi va qabul qilishi mumkin. Ajax veb-sahifalar tarkibini dinamik ravishda butun sahifani qayta yuklamasdan o‘zgartirishga imkon beradi.
AJAX imkoniyatlari:
- Sahifani qayta yuklamasdan veb-sahifani yangilash;
- Sahifa yuklangandan so‘ng serverdan ma’lumotlarni so‘rash;
- Sahifa yuklangandan so‘ng serverdan ma’lumotlarni qabul qilish;
- Serverga ma’lumotlarni orqa fonda yuborish.
XMLHttpRequest obyekti. Barcha zamonaviy brauzerlar XMLHttpRequest obyektini qo‘llabquvvatlaydi.
Fonda veb-server bilan ma’lumot almashish uchun XMLHttpRequest obyektidan foydalanish mumkin. Bu shuni anglatadiki, butun sahifani qayta yuklamasdan, veb-sahifaning qismlarini yangilash mumkin.
Server javobi:
function loadDoc() {
var xhttp = new XMLHttpRequest();
xhttp.onreadystatechange = function()
{ if (this.readyState == 4 && this.status == 200)
{ document.getElementById("demo").innerHTML = this.responseText;
} };
xhttp.open("GET", "ajax_info.txt", true); xhttp.send(); }
Topshiriq:
Talaba laboratoriya ishi uchun shaxsiy topshiriq oladi. Bu topshiriq bo‘yicha talaba AJAX asosida tarmoq dasturini yaratadi.
Xulosa:
Men ushbu laboratoriya ishida Java dasturlash tilida XMLHttpRequest obyektidan foydalanib AJAX asosida tarmoq dasturini yaratish bo‘yicha amaliy ko‘nikmalar hosil qildim.
|
| |
PSIXOMOTOR QOBILIYATLAR - Oliy ta’lim, fan va innovatsiyalar vazirligi

|
Oliy ta’lim, fan va innovatsiyalar vazirligi
|
bet | 3/4 | Sana | 20.12.2023 | Hajmi | 7,5 Mb. | | #125092 |
Bog'liq Umarov Abrorbek BMIPSIXOMOTOR QOBILIYATLAR - harakatlar va harakatlar tizimini amalga oshirish va boshqarishning psixologik va motor (harakat) asoslari. Ularga quyidagilar kiradi: statistik kuch; dinamik kuch; keskin harakatlardagi kuch; umumiy moslashuvchanlik qobiliyati; epchillik; umumiy chidamlilik; maxsus faoliyatga chidamlilik; muvozanatni tuta olish. - PSIXOMOTOR QOBILIYATLAR - harakatlar va harakatlar tizimini amalga oshirish va boshqarishning psixologik va motor (harakat) asoslari. Ularga quyidagilar kiradi: statistik kuch; dinamik kuch; keskin harakatlardagi kuch; umumiy moslashuvchanlik qobiliyati; epchillik; umumiy chidamlilik; maxsus faoliyatga chidamlilik; muvozanatni tuta olish.
- Shaxsning individual - psixik xususiyatlari turli-tumandir. Masalan: kamtarlik, mag`rurlik, xudbinlik, samimiylik, rostgo`ylik, bahillik, g`amho`rlik, tortinchoqlik, quvnoqlik va x.k. Shunday ekan xarakterni tashkil qiluvchi xususiyatlar xarakter xislatlari deyiladi. Xarakter xislatlari 2 ta katta gruppaga bo`linadi:
- Xarakter xususiyatlari jumlasiga quydagilar kiradi:
- Chuqurlik darajasi.
- Xarakter kuchi.
- Barqarorlik-o`zgaruvchanlik darajasi.
- Plastikligi. Shaxsning markaziy, asosiy munosabatlari bilan belgilanadigan xususiyatlarini biz xarakterning bir muncha chuqurroq xususiyatlari deb aytamiz. Shuning uchun ular boshqa xususiyatlarning juda keng sistemasi bilan bog`langan bo`ladi.
- Ijtimoiy muhit
- Tarbiya
- Oila
- O’z - o`zini tarbiyalash
- Maktab jamoasi.
- Bizga ma’lumki shaxs munosabatlari ijtimoiy munosabatlar bilan belgilanadi. Bunda butun bir ijtimoiy tuzumni xarakterlovchi keng ijtimoiy munosabatlar katta ahamiyatga ega. Moddiy muhtojlik yoki ta’minlanganlik, ishsizlik yoki kelajakka ishonch, ijtimoiy tenglik – bularning xammasi faqat shaxsning ijtimoiy tipik xususiyatlarigina emas, balki, xarakter individual xususiyatlarining tarkib topshiga xam ta’sir ko`rsatadi.
- Shaxsning xarakterri bir qancha sharoitlarda namoyon bo`ladi, bular quyidagilardir:
- Xarakterning faoliyatida namoyon bo`lishi.
- Xarakterning nutqda namoyon bo`lishi
- Xarakterning odamning tashqi ko`rinishida namoyon bo`lishi.
- Xarakterning turli vaziyatlarida namoyon bo`lishi. Xarakter odamning aktiv faoliyati jarayonida uning ish – xarakatlariga
- bog`liq ravishda sodir bo`ladi.
|
| |
INTELLEKT - Oliy ta’lim, fan va innovatsiyalar vazirligi

|
Oliy ta’lim, fan va innovatsiyalar vazirligi
|
bet | 2/4 | Sana | 20.12.2023 | Hajmi | 7,5 Mb. | | #125092 |
Bog'liq Umarov Abrorbek BMIINTELLEKT. Yuqorida ko`rsatib o`tganimizdek odamning aqliy rivojlanish darajasini o`rganishga intilish "intellekt" tushunchasini va nazariyasininng yaratilishiga olib keldi. Ko`rsatib o`tganimizdek intellektini o`lchash va baholash uchun turli testlar qo`llaniladi. Ularning barchasi intellekt testlari degan umumiy nom bilan ataladilar. Biz yuqorida intellektini baholashda ko`p qo`llaniladigan testning mohiyatiga qisqa to`xtalib o`tgan edik. Shuni ta`kidlab o`tish lozimki, ulardagi formulalar bolalar intellektini o`lchashda qo`llaniladi. Katta yoshli kishilar intellektini baholash uchun boshqa mezon, individual natijani biror meyor (ko`pchilikni o`rganish natijasida tajriba yo`li bilan topilgan) bilan taqqoslanadi. - INTELLEKT. Yuqorida ko`rsatib o`tganimizdek odamning aqliy rivojlanish darajasini o`rganishga intilish "intellekt" tushunchasini va nazariyasininng yaratilishiga olib keldi. Ko`rsatib o`tganimizdek intellektini o`lchash va baholash uchun turli testlar qo`llaniladi. Ularning barchasi intellekt testlari degan umumiy nom bilan ataladilar. Biz yuqorida intellektini baholashda ko`p qo`llaniladigan testning mohiyatiga qisqa to`xtalib o`tgan edik. Shuni ta`kidlab o`tish lozimki, ulardagi formulalar bolalar intellektini o`lchashda qo`llaniladi. Katta yoshli kishilar intellektini baholash uchun boshqa mezon, individual natijani biror meyor (ko`pchilikni o`rganish natijasida tajriba yo`li bilan topilgan) bilan taqqoslanadi.
KREATIVLIK (ijodiy qobiliyatlar). Ko`rsatib o`tganimizdek birgina IQ (intellekt koeffitsienti) asosida kishini ishga qabul qilish, uning imkoniyatlarini baholash noto`g`ri bular edi. Shu sababli 50 yillardan boshlab aqliy rivojlanishni o`rganish bilan bir qatorda kishining ijodiy qobiliyatlarini ham o`rganish va o`lchashga katta e`tibor berib boshlandi. Bu borada maxsus testlar yaratildi. - KREATIVLIK (ijodiy qobiliyatlar). Ko`rsatib o`tganimizdek birgina IQ (intellekt koeffitsienti) asosida kishini ishga qabul qilish, uning imkoniyatlarini baholash noto`g`ri bular edi. Shu sababli 50 yillardan boshlab aqliy rivojlanishni o`rganish bilan bir qatorda kishining ijodiy qobiliyatlarini ham o`rganish va o`lchashga katta e`tibor berib boshlandi. Bu borada maxsus testlar yaratildi.
|
| |
TAKLIF VA TAVSIYALAR - Oliy ta’lim, fan va innovatsiyalar vazirligi

|
Oliy ta’lim, fan va innovatsiyalar vazirligi
|
bet | 4/4 | Sana | 20.12.2023 | Hajmi | 7,5 Mb. | | #125092 |
Bog'liq Umarov Abrorbek BMITAKLIF VA TAVSIYALAR - Rivojlantiruvchi va psixokorreksion ishlar psixolog tomonidan har xil shakllarda, vaziyatlarda va holatlarda individual tarzda tashkil qilinadi:
- a) amaliy psixologning maxsus ishi, mashg‘uloti ayrim, o‘quvchilar bilan alohida o‘tkazilishi rejalashtiriladi;
- b) psixologlarning boshqa bir faoliyati maxsus ravishda amalga oshirilib, o‘quvchilar guruhlariga tarbiyaviy ta’sir o‘tkazishga yo‘naltirilgan bo‘ladi;
- v) ota-onalar, pedagogik jamoa ishtirokida tarbiyaviy tadbirlar tarzida mashg‘ulotlar, tushuntirish ishlari olib borish nazarda tutiladi.
- Individual yondashuvning vazifasi – rivojlanishning individual usullarini, o’spirinning imkoniyatlarini aniqlab, har bir shaxsning faolligini ta’minlashdan iborat. Bu nuqtai nazardan olganda, individual yondashuv faqatgina «tarbiyasi qiyin» o’spirinlarga emas, barcha o‘quvchilarga ham zarurligi tushunarli bo‘ladi. Kasb-hunar maktabi psixologlari bu usulni u yoki bu shaklda qo‘llaydilar, chunki bu ko‘zga tashlanib turgan qiyinchiliklar bilan birgalikda, bola shaxsiy taraqqiyotining ba’zi yashirin nuqsonlarini ham topishga yordam beradi.
- 1. Arlayg M. Psixologiya Moskva 1990y
- 2. Nemov R.S. Psixologiya Moskva 1998y
- 3.Shoumarov G’.B. Psixologiya o’quv qo’llanma Toshkent 2000y
- E’TIBORINGIZ UCHUN RAXMAT!!!
|
| |
Figure 11 – Win2K single disk random IOs per second

|
Figure 11 – Win2K single disk random IOs per second
|
bet | 20/47 | Sana | 30.03.2021 | Hajmi | 1,33 Mb. | | #13789 |
Figure 11 – Win2K single disk random IOs per second. The Quantum Atlas 10K drives showed good unbuffered random IO performance. When FS buffering is used, there is a significant 66% improvement in the read IO/s rate (compared to the one-deep rate), but the write IO/s suffers from the additional read. Win2K sorts requests to optimize disk arm movement. These measurements were all taken with WCE.
Figure 12 shows that processor cost per MB for 8KB buffered random requests is about 20ms for reads and 35ms for writes. For random writes, the additional cost of the additional read for each write is reflected by the write overhead being almost double that of the read overhead.
Unbuffered random requests cost much less than their buffered counterparts. Unbuffered requests averaged slightly over 9ms per MB on both writes and reads. This cost is similar for 2, 3, and 4 disk configurations.
|
|
Figure 12 – Buffered and unbuffered random IO overhead. Random IO overhead for unbuffered requests remains low for random unbuffered requests. Buffered random requests are more than twice as expensive than unbuffered requests for reads, and over four times as expensive for writes. The additional read that each buffered random write generates causes the cost of doing random buffered writes.
|
|
| |
Dars jarayonida kompyuter grafikasidan foydalanishning ahamiyati - bet 3

American Journal of
Social and Humanitarian Research
,
3
(1), 373-377.
21.
To’raqulovich J. U., Muxitdinovna A. Z. Features of Speech
Development in Children of
Middle Preschool Age.
22.
Ashurova Z. Scientific prodress: Muammoli ta'lim
texnologiyalari, ularning o'ziga xos
xususiyatlari //Buxoro davlat universitetining Pedagogika instituti jurnali. – 2021. – Т. 1. – №. 1.
23.
Boymurodova G., Tosheva N. Boshlang ‘ich ta’limda bilish faoliyatini
rivojlantiruvchi o
‘quv vaziyatlarini tashkillashtirishda hamkorlikda o ‘qitishning o ‘ziga
xos xususiyatlari
//Образование и инновационные исследования международный научно-методический журнал. –
2020. – №. 1.
24.
Boymurodova G. T. Particular Characteristics of Scientific Research Methods to Continuous
Rising Qualification //Eastern European Scientific Journal. – 2017. – №. 5. – С. 29-34.
Figure 20 – 8KB random IOs per second vs. request depth

|
Figure 20 – 8KB random IOs per second vs. request depth
|
bet | 30/47 | Sana | 30.03.2021 | Hajmi | 1,33 Mb. | | #13789 |
Figure 20 – 8KB random IOs per second vs. request depth. Random IO performance is dependent upon the disk RPM. Compared with a 10K RPM Atlas 10K SCSI drive, the 5400 RPM Fireball IDE drive has 46% fewer RPM, a decrease similar to the decrease in IOs we measured across the two drives. The Atlas 10K however, costs more than two-and-a-half times the cost of a single IDE drive. In terms of IOs per second on a single disk, SCSI is better, but for IOs per dollar, multiple IDE drives have 57% more IOs than a single SCSI drive for the same amount of money.
Buffered random IO for IDE is similar to that of SCSI. Reads cost 22ms per MB on average, while writes cost 35ms per MB. The higher overhead for writes is again due to the cost of the extra read associated with each write request.
Unbuffered random requests cost half to a two-thirds less than their buffered counterparts. Unbuffered requests averaged slightly over 10ms per MB on both writes and reads. This cost is similar for 2, 3, and 4 disk configurations.
|
| Figure 21 – 8KB random buffered and unbuffered overhead. Buffered random writes are expensive – the overhead per MB was 270ms compared to 20ms per MB buffered reads. Reads and writes show similar unbuffered overheads at 12ms per MB. |
Multiple IDE drives provided near linear gains with each additional drive. With four disks at a request depth of one per disk, we were able to achieve over 262 IO/s for reads and 358 IO/s on writes. We measured the peak number of IOs per second possible in the system by sending random requests to each of the disks.
|
| |
Windows 2000 Unbuffered Sequential SCSI Throughput

|
Windows 2000 Unbuffered Sequential SCSI Throughput
|
bet | 24/47 | Sana | 30.03.2021 | Hajmi | 1,33 Mb. | | #13789 |
Windows 2000 Unbuffered Sequential SCSI Throughput
Figure 15 shows the almost identical performance between basic and dynamic volumes with WCE on one-deep unbuffered sequential requests. As synchronous requests are one deep from the standpoint of the disk, one-deep asynchronous and synchronous requests have the same results unless otherwise noted. We will show later in the paper that dynamic volumes have a slightly higher processor overhead than basic volumes. Despite this increased processor overhead, we did not see any effect on unbuffered throughputs on our test machine. This was due to the imbalance between the processor and the disks. On our unloaded machine, the processors are easily able to handle the increased workload of dynamic volumes. Regardless of whether basic or dynamic volumes are used, large requests with WCE combine to provide optimal performance.
A sizable 30% improvement is seen for 2KB reads on two-deep and greater read requests over one-deep requests. At one-deep read requests, the throughput is 17.7MBps, while at two-deep and above the throughput is just slightly under disk speed at 23MBps. This is due to additional pipelining: the amount of time that the disk sits idle is decreased. The computer works to try to ensure that one request is always ready for the disk. There was no improvement for increased write depth. The plateau on writes is an artifact of the disk drive and is explained later.
|
| |
Figure 9 – Windows 2000 unbuffered asynchronous reads

|
Figure 9 – Windows 2000 unbuffered asynchronous reads
|
bet | 18/47 | Sana | 30.03.2021 | Hajmi | 1,33 Mb. | | #13789 |
Figure 9 – Windows 2000 unbuffered asynchronous reads. Read request depth beyond a depth of one shows a significant performance hit of 66%. Writes show similar behavior. This is likely due to the drive firmware, and not Win2K. Our Win2K tests using different drives did not show a performance penalty. Unlike NT4SP3, at one deep requests, both reads and writes receive no performance hit.
wo different things are being shown in Figure 9. The first is, unlike NT4SP3, small 2KB and 4KB unbuffered asynchronous read requests in Windows 2000 no longer incur the 33% to 66% performance hit. WCE writes showed similar results. The second is the significant performance degradation seen with requests deeper than one-deep. This is likely an artifact of the drive or driver, rather than Windows 2000, as measurements taken with different drives on different SCSI adapters don’t show any such degradation in performance.
The new dynamic volumes, introduced with Win2K, have the same performance curves as basic volumes. Throughputs and overheads remain the same except for an 8% drop in throughput for 2KB unbuffered requests. Figure 10 shows CPU overhead for a dynamic volume is slightly higher than that of a basic volume due to dmio’s longer code path lengths. The fixed cost for basic volumes is 50s per read request and 56s per write request, while the marginal cost is .46s per KB read and .51s per KB written. The fixed cost for dynamic volumes is 58s per read request and 54s per write request, while the marginal cost is .43s per KB read and .50s per KB written.
|
| |
Figure 14 – Single disk buffered overhead

|
Figure 14 – Single disk buffered overhead
|
bet | 23/47 | Sana | 30.03.2021 | Hajmi | 1,33 Mb. | | #13789 |
Figure 14 – Single disk buffered overhead. Buffered overheads for both basic and dynamic volumes show little difference. 2KB writes show a significantly higher overhead than reads. This is due to the additional 4KB read and merge that takes place before each 2KB write, effectively more than doubling the request overhead incurred.
|
The right graph implies that for dynamic volumes, a single processor saturates at 200MBps, and two processors saturate at 400MBps given 5ms of processor time per MB with 64KB read requests. For writes, one and two processors saturate at 125MBps and 250MBps respectively given 8ms per MB written with 64KB requests.
|
| |
Windows 2000 Out-of-the-Box Sequential Buffered SCSI Throughput

|
Windows 2000 Out-of-the-Box Sequential Buffered SCSI Throughput
|
bet | 21/47 | Sana | 30.03.2021 | Hajmi | 1,33 Mb. | | #13789 |
Next we measure the performance of Windows 2000 when sequentially reading and writing SCSI disks. Riedel’s graph of NT4SP3, the left graph of Figure 13, is of measurements taken on a slower machine with slower disks. Compared with Riedel’s machine, the “new” test machine’s processors have more than seven times the number of available clock cycles between the two of them and the “new” drives are almost 2.5 times faster. We can learn much however from comparing Riedel’s graph to the current measurements since although the vertical scale has changed, the trend lines remain the same. NT4SP3 shows a much greater disparity between WCE writes and reads.
Basic and dynamic volumes are shown in the middle and right graphs of Figure 13. They have almost identical throughputs. Both buffered reads and writes show good performance for all request sizes. Particularly good performance was achieved at small request sizes as FS buffering coalesced the requests into 64KB blocks. This allowed the small requests to run at disk speed. The only exception to this rule was the case of 2KB writes where the throughput was slightly less than 11.5MBps with WCE and slightly less than 7MBps without WCE. This is since, for each 2KB write, Win2K reads a 4KB page off disk and then merges the 2KB write with it. The 4KB read before each 2KB write more than doubles the overhead for each request. Even with this additional overhead, buffered 2KB writes still offered a throughput advantage over unbuffered 2KB writes. Increasing the depth of buffered requests resulted in minimal performance gains.
|
| |
Figure 15 – Single disk unbuffered WCE throughputs for basic and dynamic volumes

Figure 15 – Single disk unbuffered WCE throughputs for basic and dynamic volumes. Basic and dynamic volumes have similar unbuffered WCE throughput. For clarity, three, four, and eight deep reads have been omitted from these graphs as their results were identical to that of two deep. Similarly, two, three, four, and eight deep writes and WCE writes have also been omitted, as they were identical to the one deep results. Dynamic volumes have up to 25% more overhead than basic volumes at small request sizes. At 2KB requests, basic volumes show a 10% higher throughput when compared to dynamic volumes. Throughput for reads deeper than one-deep show improved throughput due to increased parallelism. Unbuffered writes show no improvement from increased request depth. The write plateau is a property of the disk, as explained later.
Small requests (2KB and 4KB) are expensive: 2KB requests show an overall 40% utilization across both processors in Task Manager. Small reads on dynamic volumes have more CPU consumption than small requests on basic volumes, as the fixed overhead per request is higher. Figure 16 shows as request size is increased, the difference in overhead between basic and dynamic volumes decreases. This implies that dynamic volumes have a higher fixed cost per request than basic volumes, but the incremental costs per byte thereafter are similar. Our measurements support this theory, as the fixed cost for reads on a basic volume was 50s per request. There was a marginal cost of .48s per KB. For dynamic volumes, the fixed cost was 58s per request while the marginal cost was .43s per KB. Dynamic volumes have a higher overhead per request, but as the fixed request overhead gets amortized over more bytes, the overheads between dynamic and basic volumes become similar. Still, buffered IO has twenty times more processor consumption than unbuffered IO.
|
Dars jarayonida kompyuter grafikasidan foydalanishning ahamiyati

Dars jarayonida kompyuter grafikasidan foydalanishning ahamiyati
Download
0,65 Mb.
Matnni ko'rish
bet
1/3
Sana
01.06.2024
Hajmi
0,65 Mb.
#258825
Download
0,65 Mb.
Matnni ko'rish
Bosh sahifa
Aloqalar
Bosh sahifa
Dərs
Mühazirə
Qaydalar
Referat
Xülasə
Yazı
Dars jarayonida kompyuter grafikasidan foydalanishning ahamiyati
Download
0,65 Mb.
Matnni ko'rish
Foydalanilgan adabiyotlar - Dars jarayonida kompyuter grafikasidan foydalanishning ahamiyati

Journal of Innovation, Creativity and Art (ISSN: 2181-4287)
Respublika ilmiy-amaliy konferensiyasi
16
14.
Jurayevich J. K., Sayfullayevich A. S. THE UNIQUE OF BUKHARA JEWS IN THE DYE
INDUSTRY AND WEAVING CRAFT //Euro-Asia Conferences. – 2021. – Т. 1. – №. 1. – С. 48-53.
15.
Mamurova, F. I., Khodzhaeva, N. S., & Kadirova, E. V. (2023). Pedagogy of Technology
and its University. Innovative Science in Modern Research, 22-24.
16.
Pirnazarov, G. F., Mamurova, F. I., & Mamurova, D. I. (2022). Calculation of Flat Ram by
the Method of Displacement. EUROPEAN JOURNAL OF INNOVATION IN NONFORMAL
EDUCATION, 2(4), 35-39.
17.
Abdullayev S. S., Hamroyev J. B. Features of the Organization of Pedagogical Practice. –
2023.
18.
Avliyakulova N. M. Tasviriy San’at O ‘Qitish Metodikasi» Fanidan Topshiriqlarni Nazorat
Qilish Va Baholash //BARQARORLIK VA YETAKCHI TADQIQOTLAR ONLAYN ILMIY
JURNALI. – 2021. – Т. 1. – №. 5. – С. 270-276.
19.
Zubrilin K. M., Muzafarovna A. N. Improvement of the Methodology for the Development
of Professional Competence of Future Teachers of Fine Arts //Pioneer: Journal of Advanced Research
and Scientific Progress. – 2023. – Т. 2. – №. 2. – С. 82-85.
20.
Muxitdinovna, A. Z. (2022). Mantessori Preschool Organizations.
Windows Home Server 2011 - History of Microsoft Windows

Windows Home Server 2011
Main article: Windows Home Server 2011
Windows Home Server 2011 code named 'Vail'[22] was released on 6 April 2011.[23] Windows Home Server 2011 is built on the Windows Server 2008 R2 code base[24] It follows the release of Windows Home Server Power Pack 3 which added support for Windows 7 to Windows Home Server. Windows Home Server 2011 is considered a "major release".[22] (its predecessor having been built on Windows Server 2003) and only supports x86-64 hardware.
Windows Thin PC
Main article: Windows Thin PC
In 2011, Microsoft introduced Windows Thin PC or WinTPC, which is a feature- and size-reduced locked-down version of Windows 7 expressly designed to turn older PCs into thin clients. WinTPC is available for software assurance customers and relies on cloud computing in a business network. Wireless operation is supported since WinTPC has full wireless stack integration, but wireless operation may not be as good as the operation on a wired connection.[25][26]
Windows 8 and Windows Server 2012
Bootable Windows To Go USB flash drive, upcoming Windows 8 feature
Screenshot of the new Windows 8 Start Screen
Main articles: Windows 8 and Windows Server 2012
Windows 8 is the new version of Microsoft Windows. Windows RT, a special version of Windows 8, runs on system-on-a-chip devices with mobile ARM processors. Windows 8 features a redesigned user interface, designed to make it easier for touchscreen users to use Windows. The interface includes a full-screen Start screen to replace the Start menu, and a new full-screen application platform. The desktop interface is also present for running windowed applications, although Windows RT will not run any desktop applications not included in the system. On the Building Windows 8 blog, it was announced that a computer running Windows 8 can boot up much faster than Windows 7.[27] New features also include USB 3.0 support, the Windows Store, the ability to run from USB drives with Windows To Go, and others.
Windows 8 will ship with three editions and one edition called Windows RT will only be pre-installed on ARM tablets.
Windows 8
Windows 8 Pro
Windows RT (Only installed on ARM tablets)
Windows 8 Enterprise
The first public preview of Windows Server 2012 was also shown by Microsoft at the 2011 Microsoft Worldwide Partner Conference.[28]
Windows 8 Release Preview and Windows Server 2012 Release Candidate were both released on May 31, 2012.[29] Product development on Windows 8 was completed on August 1, 2012, and it was released to manufacturing the same day.[30] Windows Server 2012 went on sale to the public on September 4, 2012. Windows 8 went on sale October 26, 2012.
|
Windows Server 2008 - History of Microsoft Windows

Windows Server 2008
Main article: Windows Server 2008
Windows Server 2008, released on 27 February 2008, was originally known as Windows Server Codename "Longhorn". Windows Server 2008 builds on the technological and security advances first introduced with Windows Vista, and is significantly more modular than its predecessor, Windows Server 2003.
Windows Server 2008 ships in ten editions:
Windows Server 2008 Standard Edition (32-bit and 64-bit)
Windows Server 2008 Enterprise Edition (32-bit and 64-bit)
Windows Server 2008 Datacenter Edition (32-bit and 64-bit)
Windows HPC Server 2008
Windows Web Server 2008 (32-bit and 64-bit)
Windows Storage Server 2008 (32-bit and 64-bit)
Windows Small Business Server 2008 (64-bit only)
Windows Essential Business Server 2008 (32-bit and 64-bit)
Windows Server 2008 for Itanium-based Systems
Windows Server 2008 Foundation Server
Windows 7 and Windows Server 2008 R2
Main articles: Windows 7, Features new to Windows 7, and Windows Server 2008 R2
Windows 7 Desktop
Windows 7 is the current major release after Windows Vista and was released to manufacturing on 22 July 2009, and reached general retail availability on 22 October 2009.[18][19] It was previously known by the codenames Blackcomb and Vienna. Windows 7 has the version number NT 6.1.
Some features of Windows 7 are faster booting, Device Stage, Windows PowerShell, less obtrusive User Account Control, multi-touch, and improved window management.[20] Features included with Windows Vista and not in Windows 7 include the sidebar (although gadgets remain) and several programs that were removed in favor of downloading their Windows Live counterparts.
Windows 7 ships in six editions:[21]
Starter (available worldwide)
Home Basic
Home Premium
Professional
Enterprise (available to volume-license business customers only)
Ultimate (available to retail market with limited availability to OEMs)
In some countries (Austria, Belgium, Bulgaria, Croatia, Cyprus, Czech Republic, Denmark, Estonia, Finland, France, Germany, United Kingdom, Greece, Hungary, Iceland, Ireland, Italy, Latvia, Liechtenstein, Lithuania, Luxembourg, Malta, Netherlands, Norway, Poland, Portugal, Romania, Slovakia, Slovenia, Spain, Sweden, and Switzerland)[citation needed], there are other editions that lack some features such as Windows Media Player, Windows Media Center and Internet Explorer called names such as "Windows 7 N." Microsoft focuses on selling Windows 7 Home Premium and Professional. All editions, except the Starter edition, are available in both 32-bit and 64-bit versions. Unlike the corresponding Vista editions, the Professional and Enterprise editions are supersets of the Home Premium edition.
At the Professional Developers Conference (PDC) 2008, Microsoft also announced Windows Server 2008 R2, as the server variant of Windows 7. Windows Server 2008 R2 ships in 64-bit versions (x64 and Itanium) only.
|
INTERSECT operatori nimaga mo‘ljallangan 
*Ikkala tanlovda mavjud umumiy natijalarni 
chiqarish uchun 
158

5
qaytaradi;
164. Tranzitiv bog’lanish qanday bo’ladi?
Agar A,B,C atributlar berilgan bo’lsa va unda AàB bolsa Bà C bolsa, unda
CA dan tranzitiv boglangan boladi
165. First() funksiyasining vazifasi nima?
Natijaviy to’plam birinchi maydoni qiymatini qaytaradi
166. SQL tilini tarkibiy qismlariga kiradi: 1) ma’lumotlarni aniqlash tili; 2) ma’lumotlarni qayta
ishlash tillari; 3) ma’lumotlarni boshqarish tili; 4) dasturlash tillari
1, 2, 3
167. DML komandalarini ko`rsating
INSERT, DELETE, UPDATE, SELECT
168. DDL komandalarini ko`rsating
CREATE, ALTER , DROP
169. UPDATE operatorini qaysi kalit so’zi jadvalni aniq ustunlari tanlab olish imkonini beradi?
SET
170. Ma’lumot baza administratori bu-
Bir yoki bir necha ma’lumot baza bo’yicha to’la tasavvurga ega bo’lgan
loyihalash va nazorat qilish bilan shug’ullanadigan mutaxassis
171. Amaliyotda eng ko’p tarqalgan ma’lumotlar bazalari bu
Relyasion ma’lumotlar bazalari
172. MB da bir nechta jadvallarni birlashtirish mumkinmi?
Xa
173. Ikkita jadval birlashtirilganda ularning ma’limotlari qaysi maydon bo’yicha moslanadi
Kalit maydon bo’yicha
SELECT operatoridan FROM so‘zidan keying yozuv nimani bildiradi? 
*jadvalning nomini 
175

|
SELECT operatoridan FROM so‘zidan keying yozuv nimani bildiradi?
*jadvalning nomini
175
|
bet | 11/45 | Sana | 07.01.2024 | Hajmi | 109,51 Kb. | | #131376 |
Bog'liq Savollar Javoblar (2)174. SELECT operatoridan FROM so‘zidan keying yozuv nimani bildiradi?
*jadvalning nomini
175. Relyatsion MBda joylashgan fayllarning kengaytmasi qanday?
.db, dbf
176. SQL tilining оpetatorlarini tanlang?
CREATE , INSERT, SELECT, DELETE
177. Select lpad(uyinchi, 10, '*') from func. So`rov natijasini tanlang
****Suarez
178. select rpad(uyinchi, 10, '*') from func; So`rov natijasini tanlang
Suarez****
179. LONG toifasi xotiradan qancha joy egallaydi
Bitta jadval uchun Maksimal darajasi 4GB.
180. SELECT LEFT(`familiya`,3) FROM `xodimlar`; so`rov natijasini toping
Xodimlar familyalarining birinchi 3 ta harflarini
chiqaradi
181. Ko‘p foydalanuvchili MBBTda ishlashning murakkabligi nimada
* Loyihalashning, ekspluatasiyaning murakkabligi
182. select name, year from test where year>(select year from test where name'Jonny');
So`rovdagi qavs ichidagi so`rov qanday natija qaytaradi?
Jonnyning tug`ilgan yili
183. select * from join1 INNER join join2 ON join1.namejoin2.name; So`rovdagi "join2"
nima?
Jadval nomi
184. select name, famil, year from test1 union select name, famil from test2; So`rov qanday
natija qaytaradi?
Xatolik yuz beradi
185. select name, famil from test1 union all select name, famil from test2; So`rov "all" qanday
vazifa bajaradi?
Jadvallar birlashtirilayotganda ustunlardagi
ma`lumotlar bir xil bo`lsa ham birlashtiradi
186. select min(yosh), ism, familiya from test group by ism, familiya; So`rovni xatosini toping
To`g`ri
187. select * from test order by ism desc; So`rovdagi "desc" nima vazifa bajaradi?
Ism ustunini teskarisiga saralaydi
188. DISTINCT operatorining vazifasi nima?
ma'lumotlar orasida bir xil ma'lumot bo'lsa, bu
ma'lumotni bitta qilib chiqaradi
|
| |
MB ni konfiguratsiyalash va hujjatlashtirish quyidagilardan qaysi biriga tegishli 
* MB strukturasini boshqarish 
251

7
258. select name, famil from test1 union all select name, famil from test2; So`rov "all" qanday
vazifa bajaradi?
Jadvallar birlashtirilayotganda ustunlardagi
ma`lumotlar bir xil bo`lsa ham birlashtiradi
259. select min(yosh), ism, familiya from test group by ism, familiya; So`rovni xatosini toping
To`g`ri
260. select * from test order by ism desc; So`rovdagi "desc" nima vazifa bajaradi?
Ism ustunini teskarisiga saralaydi
261. Yoxud barcha, yoxud hech narsa bajarilmaydigan tranzaksiya xususiyati nima deb
nomlanadi
*Atomarlik
262. Qaysi buyruqlardan biri tranzaksiyani boshlanishini e’lon qilish uchun xizmat qiladi
*BEGIN TRANSACTION
263. Ma’lumotlarga ruxsat etish xavfsizligi qanday mexanizm bilan ta’minlanadi
*Foydalanuvchilar va rollar
264. Qaysi operatsiyalarda MB ga ruxsat sozlanadi
*O‘qish va o‘zgarishlarda
265. Tranzaksiya bu......?
* Ma’lumotlar bilan ishlashda o‘zining mantiqiy birligiga ega bo‘lgan ma’lumotlar bazasi
jarayonlarining ketma-ket bajarilish guruxi
Sharq mamlakatlari iqtisodiyoti, siyosati va turizm fakulteti

Sharq mamlakatlari iqtisodiyoti, siyosati va turizm fakulteti
Download
397,28 Kb.
Matnni ko'rish
bet
1/14
Sana
23.12.2023
Hajmi
397,28 Kb.
#127475
Download
397,28 Kb.
Matnni ko'rish
Bosh sahifa
Aloqalar
Bosh sahifa
Dərs
Mühazirə
Qaydalar
Referat
Xülasə
Yazı
Sharq mamlakatlari iqtisodiyoti, siyosati va turizm fakulteti
Download
397,28 Kb.
Matnni ko'rish
Iqtisodiyot va uning bosh masalasi

Shu muammolarni echish va o’z ehtiyojlarini qondirish maqsadida
kishilar turli
yo’nalishlarda, sohalarda faoliyat ko’rsatadilar. Demak, insonning turli faoliyatlari
ichida eng asosiysi, insoniyatning yashashi va uning kamol to’ishini ta’minlaydigani
moddiy va ma’naviy ne’matlar ishlab chiqarish va xizmatlar ko’rsatishdan
iborat
bo’lgan iqtisodiy faoliyatdir.
Iste’mol tovarlari va xizmat ko’rsatish sohalari turli tuman bo’lganligi uchun
iqtisodiy faoliyat ham turlichadir, ularning turi va soni juda ko’’dir.
Cheklangan iqtisodiy resurslardan unumli foydalanib,
kishilarning yashashi,
kamol to’ishi uchun zarur bo’lgan hayotiy vositalarni ishlab chiqarish va
iste’molchilarga etkazib berishga qaratilgan, bir-biri bilan bog’liqlikda amal
qiladigan turli-tuman faoliyatlar yaxlit qilib, bir so’z bilan,
iqtisodiy faoliyat deb
ataladi.
Qadimda iqtisodiy faoliyatning asosiy shakli uy xo’jaligi doirasida ro’y bergan.
Shuning uchun qadimgi grek olimlarining (Ksenofont, ‘laton, Aristotel) asarlarida
iqtisodiyot - uy xo’jaligi va uni yuritish qonunlari deb tushuntirilgan. Arab
leksikonida «iqtisod» tejamkorlik ma’nosida tushunilgan, chunki islom
diniga oid
adabiyotlarda tejamkorlikka alohida e’tibor berilgan. Masalan, Quroni Karimda
shunday oyat bor: «Englar, ichinglar,
hadya qilinglar, ammo isrof qilmanglar».
1
Lekin, hozirgi davrda iqtisodiyot keng ma’noni anglatib, faqatgina uy yoki
individual xo’jalik yuritish yoki tejamkorlik ma’nosini
anglatmaydi, balki
Iqtisodiy kategoriyalar - Sharq mamlakatlari iqtisodiyoti, siyosati va turizm fakulteti

iqtisodiy tizim ichida sodir bo’ladigan sabab va oqibatni anglash vositalaridir.
Yaxshi nazariyalar o’z navbatida kengroq tushunishga va to’g’ri baholashga yordam
beradi. Ular haridor va ishlab chiqaruvchi orasidagi munosabatlarga bog’liq
faktlarga tayanadi.
Ehtiyojlarning cheksizligi. Ehtiyojlarning yuksalib borish qonuni
Ishlab chiqarishning pirovard maqsadi iste’mol ya’ni ehtiyojni qondirish
hisoblanadi.
Insonning yashashi va kamol topishi, jamiyatning
rivojlanishi uchun kerak
bo‘lgan hayotiy vositalar va iqtisodiy resurslarga bo‘lgan zaruriyat «ehtiyoj» deb
ataladi.
Jamiyat ehtiyojlari kishilar ya’ni jamiyat a’zolari, korxonalar va davlat
ehtiyojlarining birligidan iborat. Ehtiyojlarning bu barcha turlari uchun umumiy
bo‘lgan xususiyat - ular cheksiz va chegarasizdir. Jamiyat ehtiyojlarida
kishilarning
ehtiyojlari asosiy va belgilovchi rol o‘ynaydi. Kishilarning barcha hayotiy
ehtiyojlari
(iqtisodiy, ijtimoiy, madaniy, ma’naviy, siyosiy ehtiyojlar)
orasida ijtimoiy-
iqtisodiy ehtiyojlar alohida o‘rin tutadi.
Bu ehtiyojlar kishilarning yashashi,
Ayirboshlash jarayoni - Sharq mamlakatlari iqtisodiyoti, siyosati va turizm fakulteti

1-chizma. Tovarlar, xizmatlar va resurslarning takror ishlab chiqarish
jarayonlaridagi harakati.
Iqtisodiyotning doimiy va bosh masalasi ehtiyojlarning cheksizligi va iqtisodiy
resurslarning cheklanganligidir.
Bu masalani to’g’ri tushunish uchun, eng avvalo, ehtiyoj nimaligini, uning
turlarini bilish zarurdir.
Yuqorida aytib o’tganimizdek, inson yashamog’i uchun, eng avvalo, oziq-
ovqat, kiyim-kechak, uy-joy, uy-ro’zg’or buyumlari, trans’ort hamda isitish va
yoritish vositalari zarurdir. Bundan tashqari, inson kamol to’mog’i uchun o’qib,
bilim olishi, kasb o’rganishi, malaka egallashi va davolanishi, dam olishi, turli
xizmatlardan foydalanishi va boshqa juda ko’’ hayotiy narsalarga ehtiyoj sezadi.
Insonning yashashi va kamol to’ishi, umuman insoniyatning rivojlanishi uchun
kerak bo’lgan hayotiy vositalarga bo’lgan zaruriyati iqtisodiyot nazariyasi fanida
ehtiyoj deb ataladi.
Barcha hayotiy ehtiyojlar (iqtisodiy, ijtimoiy, madaniy, ma’naviy, siyosiy
ehtiyojlar) ichida ijtimoiy-iqtisodiy ehtiyojlar alohida o’rin tutadi. Bu ehtiyojlar
kishilarning yashashi, mehnat qilishi va hayot kechirishi uchun zarur bo’lgan moddiy
ne’matlardan hamda xizmatlardan iborat bo’ladi. Shu jihatdan olganda ijtimoiy-
iqtisodiy ehtiyojlar moddiy va ma’naviy ehtiyojlarni o’z ichiga oladi.
Moddiy
«ekonomiks» - Sharq mamlakatlari iqtisodiyoti, siyosati va turizm fakulteti

bo’lgan talab va uning narxi o’rtasidagi bog’liqlik va o’zaro ta’sirini tahlil qilishda
keng qo’llanildi.
Iqtisodiyot nazariyasining yangi yo’nalishi
neoklassik, ya’ni yangi klassik deb
nom oldi. Bu nazariyaning yirik namoyondalaridan biri A.Marshall bo’lib, u
iqtisodiy jarayonning funkstional bog’lanishi va funkstional nisbatlarini ishlab
chiqishga harakat qildi, bozor muvozanatini va narxni aniqlovchi omillar talab va
taklifdan iborat deb qaradi. Bu nazariy yo’nalishning namoyondalaridan biri
Shveystariya iqtisodchisi Leon Valras bo’lib, u umumiy iqtisodiy muvozanat
modelining nusxasini ishlab chiqishga harakat qildi.
Avstriya iqtisodiy maktabining namoyondasi Y.Shum’eter 1912 yilda yozgan
“Iqtisodiy taraqqiyot nazariyasi” deb atalgan kitobida iqtisodiy tizimlar
o’zgarishining ichki kuchlarini, ularning ichki mazmunini va turtki beruvchi kuchini
ko’rsatishga harakat qildi va u iqtisodiyotni harakatga keltiruvchi asosiy kuch
tadbirkorlik degan xulosaga keladi.
1936 yilda ingliz iqtisodchisi Jon Meynard Keyns o’zining “Bandlik, foiz va
‘ulning umumiy nazariyasi” degan kitobida makroiqtisodiy ko’rsatkichlar: milliy
daromad, ka’ital xarajatlar, iste’mol va jamg’arishning o’zaro bog’liqligini tahlil
qilib, investistiya va iste’molning eng maqsadga muvofiq tarzda tashkil to’ishi
iqtisodiy taraqqiyotning muhim omili deb ko’rsatadi. Keyns ta’limoti, ya’ni
Sharq mamlakatlari iqtisodiyoti, siyosati va turizm fakulteti - bet 8

Amal qilish davrining davomiyligiga qarab iqtisodiy qonunlar quyidagi
guruhlarga ajratiladi:
1.Umumiqtisodiy
qonunlar-kishilik
jamiyati
rivojlanishining
barcha
bosqichlarida amal qiladi. Masalan, vaqtni tejash qonuni, ehtiyojlarning o‘sib borish
qonuni, takror ishlab chiqarish qonuni, unumdorlikning o‘sib borishi qonuni va
boshqalar;
2.
Xususiy
yoki
davriy
iqtisodiy
qonunlar-insoniyat
jamiyati
taraqqiyotining ma’lum bosqichlarida amal qiladi. Masalan, talab qonuni va taklif
qonuni, tovar-pul munosabatlari mavjud bo‘lgan davrlarda mavjud bo‘ladi.
3.
Maxsus o‘ziga xos iqtisodiy qonunlar – alohida olingan iqtisodiy tizim
sharoitida amal qiladi. Masalan, sof kapitalizm sharoitidagi qo‘shimcha qiymat
qonuni.
keynschilik maktabi - Sharq mamlakatlari iqtisodiyoti, siyosati va turizm fakulteti

ishlab chiqarish hajmining ‘asayib borish sharoitida inflyastiyaning vujudga
kelishidir. Ushbu holat stagflyastiya degan nom oldi. Monetarizm maktabining
asoschisi Milton Fridmen bo’lib, uning iqtisodiyot nazariyasiga qo’shgan hissasi ‘ul
nazariyasini yangi mazmun bilan boyitdi. Monetaristlar tovar ishlab chiqarish
jarayoniga ‘ulning qayta ta’sir etish mexanizmini, ‘ul dastaklari va monetar
siyosatning iqtisodiyotni rivojlanishiga ta’sirini chuqur tadqiq etishdi. Monetarizm
‘ul-kredit dastaklari yordamida iqtisodiyotni tartibga solishda o’ziga xos
yondoshuvni vujudga keltirgan nazariyadir.
Hozirgi ‘aytda marjinalizm, monetarizm, keynschilik va boshqa qator
yo’nalishdagi iqtisodiy nazariyalar yig’indisi “Ekonomiks” nomli kitobda
mujassamlashgan bo’lib, bu AQSh, Angliya, va boshqa qator mamlakatlarda darslik
sifatida o’tiladi. Rus tiliga tarjima qilinib, bizga ma’lum bo’lgan ‘.Samuelson,
R.Makkonnell va L.Bryularning kitoblari uning namunalaridir.
Hozirgi ‘aytda bu yo’nalishdagi fan mamlakatimiz va boshqa qator MD²
davlatlarida “Iqtisodiyot nazariyasi” deb atala boshladi.
“Iqtisodiyot nazariyasi” fan sifatida shakllanguncha bosib o’tgan yo’l va unda
vujudga kelgan g’oyalar, oqimlar juda murakkab, ko’’incha bir-biriga zid va
qarama-qarshidir. Shu bilan birga aytishimiz kerakki, hech qaysi iqtisodiy
maktabning nazariyalari mutloq va doimiy haqiqat kursisiga egalik qila olmaydi.
Har bir maktab ma’lum darajada muammolarga bir tomonlama yondoshganligini
yoki bo’lmasa ba’zi bir nazariy savollarni yoritishda anglashilmovchilikka yo’l
qo’yganligi bilan ajrab turadi, sababi barcha nazariy oqimlar qaysidir ijtimoiy guruh
manfaatlari nuqtai nazaridan va o’sha davr real holatidan kelib chiqqanlar.
Shunday
bo’lsada, ular bir-birini to’ldiradi, iqtisodiy jarayonlar va hodisalarning ichki
ziddiyatlarini, qonunlarini ma’lum darajada umumlashtirib ifodalaydi. Demak,
jamiyat alohida bir nazariya asiri bo’lib qolmasligi kerak, uning rivojlanishi
umummilliy manfaatlar bilan yo’naltirilishi zarur.
Windows 2000 Sequential Unbuffered IDE Throughput

|
Windows 2000 Sequential Unbuffered IDE Throughput
|
bet | 36/47 | Sana | 30.03.2021 | Hajmi | 1,33 Mb. | | #13789 |
Windows 2000 Sequential Unbuffered IDE Throughput
Figure 26 shows single disk unbuffered throughput across both a SCSI and an IDE disk. Like buffered throughput, unbuffered throughput on the Fireball IDE drive shows good sequential performance. At one deep requests, maximum disk throughput is attained at read requests of 16KB or more and write requests of 64KB or more. Optimal throughput is reached through two-deep reads and one-deep writes (except on the 3ware card which required two-deep writes) which both attain disk speed at 8KB requests. Increased depths showed no additional improvement in throughput.
Unlike the unbuffered SCSI throughput, IDE read throughput suffers at small 2KB request sizes. This is an artifact of the 3ware card and not of the Fireball drives. As Figure 26 shows, when the Fireball IDE drive is connected to the motherboard’s IDE channel using DMA, small requests show the same general trend lines as SCSI; 2KB read requests no longer have the dip seen with the 3ware card. The 3ware wasn’t handling as many IOs per second as the motherboard IDE channel.
|
| |