Simulation of Inventory System

April 17, 2008

A company that sells a single product would like to decide how many items it should have in inventory for each of the next n months (n is a fixed input parameter). The times between demands are IID exponential random variables with a mean of 0.1 month. The sizes of the demands,D, are IID random variables ……….

Read the rest of this entry »

M/M/1 Queue Alternative Stopping Rule

April 17, 2008

M/M/1 queue using C programming with the probability of the simulation’s terminating after exactly 480 minutes.

Read the rest of this entry »

M/M/1 Queue Simulation

April 17, 2008

M/M/1 Queue Simulation using C programming. The simulation was terminated when the number of customer delayed became equal to 1000.

Read the rest of this entry »

Job-Shop Model

April 15, 2008

Simlib to simulate a model of manufacturing system. This simulation illustrates how simulation can be used to identify bottlenecks in a production process. A manufacturing system consists of five work stations, and at present stations 1,2,…,5 consist of 3,2,4,3, and 1 identical machine(s), respectively. In effect, the system is a network of five multiserver queues. …………………………………………………

Read the rest of this entry »

Multiteller Bank With Jockeying

April 15, 2008

Simlib to simulate a multiteller bank where the customers are allowed to jockey (move) from one queue to another if it seems to be to their advantage. A bank with five tellers opens its doors at 9 A.M. and closes its doors at 5 P.M., but operates until all customers in the bank by 5 P.M. have been served. Assume that the interarrival times of customers are IID exponential random variables with mean 1 minutes and that service times of customers are IID exponential random variables with mean 4.5 minutes…………….
Read the rest of this entry »

Time-Shared Computer Model

April 15, 2008

Simlib to simulate a model of a time-shared computer facility considered by Adiri and Avi-Itzhak. A company has a computer system consisting of a single central processing unit (CPU) and n terminals. The operator of each terminal ‘thinks’ for an amount of time that is an exponential random variable with mean 25 seconds, and then sends to the CPU a job having service time distributed exponentially with mean 0.8 second. ………………………..
Read the rest of this entry »

Single-Server Queueing with simlib

April 15, 2008

Simulate the single -server queueing system using simlib with 1000-delay stopping rule
Read the rest of this entry »

Syllabus Cryptography and Network Security

February 25, 2008

Instructor : Dr. Albert Jeng

Syllabus :

  1. Introduction
    – What is cryptology : (cryptography + cryptanalysis )
    – overview of crytology : How cryptography works ?, how to break a cryptographic system ?,
    classical conventional encryption, modern conventional encryption, public key encryption,
    Hashing algorithm.
    – mathematical background : review probability theory, information theory, complexity theory,
    number theory, abstract algebra, finite field,etc and their relationship cryptology.
  2. Symmetric-Key Cryptography (including DES, Triple-DES, AES, and design of Symmetric Key Cryptosystems)
  3. Hasing function and message authentiaction code (MAC) (including MD5, SHA-1, HMAC and comparative Analysis)
    Read the rest of this entry »

Matrix Multiplication Client/Server

January 21, 2008

Write a client/server program whereby the server accepts commands from the client and does the computation as requested.
Specifically, the client will send to the server two integers along with one of the following operations: +, -, *, and /.
The server will response with the result and the client will print the result on client’s screen. In the meantime, the server will also print the same result on its screen.
You can use either TCP or UDP to exchange the messages. Of course your client program should prompt the user for entering the two operands, an operator, and the IP address of the server.
Available programming languages and operating systems: C, C++ or Java language over Windows OS or Linux/UNIX OS.
Read the rest of this entry »

Multihop Cellular Networks

December 30, 2007


Multihop cellular network can potentially enhance coverage, data rate, QoS performance in terms of call blocking probability, bit error rate.
This article aims to present an overview of resource allocation framework for out-of-band relaying and the throughput enhancement.
The conventional approach to increase network capacity is to install more base stations (BSs) to exploit spatial reuse. This solution is not very efficient because the cost of the BS transceiver is quite high.
An alternative approach is to employ relay stations (RSs) as intermediate nodes to establish multihop communication paths between mobile hosts (MHs) and their corresponding BSs.
Read the rest of this entry »