Main Page
About us
About the deanship
Vision
Mision
Quality policy
Deanship booklet
Research strategic construction
Employee list
Deanship consultants
Deanship agencies
Vice deanship for research groups
Vice deanship for research
Vice deanship of scientific research female
Research groups
Internal research programs
External research programs
Research groups prorgams
About research group programs
Active research groups
Guidelines for creating a new research group
Researcher services
Scientific instrument facilitating the publication
Abhathi portal
Plagiarism detection programs
Scientific journals
Research program forms
Researchers' inquiries
Research & scientific outcome
Digital media
Instruction guidelines
Research production for institutional finance
Activities & awards
Knowledge excellence awards
Knowledge excellence awards
Knowledge excellence awards winners
Excellence reward
Scientific research week
The fourteenth scientific research week
عربي
عربي
English
About
Admission
Academic
Research and Innovations
University Life
E-Services
Search
Deanship of Scientific Research
Document Details
Document Type
:
Project
Document Title
:
Simplify and consolidate the Markov model near the coupling with application to multi-computer programs.
تبسيط وتجميع نموذج ماركوف القريب من التقارن مع تطبيقه على حاسب آلي متعدد البرامج.
Document Language
:
Arabic
Abstract
:
This research examines simplify and consolidate the type of Markov chains known for Markov chains near the coupling. For this kind of strings are many engineering applications such as networks Alantdhar used in its model of computer networks and telecommunications networks and other applications. In this research, was reached following results: - 1 - provided a mathematical formula by which transformative public can simplify models of large and Almalolh mathematical models to small and mathematically unsound and has found that the mathematical formulas known far are only a special case of sporting Siding presented in this research. 2 - is a mathematical formula derived from the mathematical formula the general said in the first paragraph simplifies and reduces the calculations necessary to find a form the mini-series Markov has used this formula in the work of the algorithm calculates the probability distribution of stable, which is used in the study of performance of the networks wait. 3 - applied how simplistic and repetitive on a computer algorithm to multi-program 6-terminals as the main and secondary memory to accommodate the 3 programs at once. This algorithm is also compared with three well-known iterative algorithms in this area, the comparison has shown that this algorithm need to be a smaller number of repetitions to reach the correct value.
Publishing Year
:
1410 AH
1990 AD
Sponsor Name
:
kau
Sponsorship Year
:
1410 AH
1990 AD
Added Date
:
Wednesday, April 30, 2008
Researchers
Researcher Name (Arabic)
Researcher Name (English)
Researcher Type
Dr Grade
Email
رباح واصل الظاهري
alzahri, rbah wasel
Investigator
Doctorate
Files
File Name
Type
Description
30657.docx
docx
Back To Researches Page