We study new formulae based on Lyapunov exponents for entropy, mutual information, and capacity of finite state discrete time Markov channels. We also develop a method for directly computing mutual information and entropy using continuous state space Markov chains. Our methods allow for arbitrary input processes and channel dynamics, provided both have finite memory. We show that the entropy ra...

Department of Industrial Engineering, Iran University of Science and Technology, Tehran, Iran Michael Smurfit Graduate School of Business, University College Dublin, Dublin, Ireland Department of Industrial Engineering, Faculty of Engineering, University of Tehran, Tehran, Iran Department of Financial Engineering and Engineering Management, School of Science and Engineering, Reykjavik Universit...

In this paper we study a queueing model of assembly-like manufacturing operations. This study was motivated by an examination of a circuit pack testing procedure in an AT&T factory. However, the model may be representative of many manufacturing assembly operations. We assume that customers from n classes arrive according to independent Poisson processes with the same arrival rate into a singles...

Reverse auctions offer the prospect of more efficiently matching suppliers and producers in the face of changing market conditions. Prior research has generally ignored the temporal and finite capacity constraints under which reverse auctioneers typically operate. In this paper, we consider the problem faced by a manufacturer (or service provider) that needs to fulfill a number of customer orde...

Reverse auctions offer the prospect of more efficiently matching suppliers and producers in the face of changing market conditions. Prior research has ignored the temporal and finite capacity constraints under which reverse auctioneers typically operate. In this paper, we consider the problem faced by a manufacturer that can procure multiple key components from a number of possible suppliers th...

We consider the discrete time problem of optimally dispatching a single, nite capacity shuttle in a two terminal system under incomplete state observations. Passengers arrive to each terminal and must be moved to the other terminal. The durations of successive shuttle trips follow a general distribution, but have a lower bound D 1 . There is an information delay of I time units between the two ...

We consider the optimal scheduling of a nite capacity shuttle in a two node network with imperfect information. When shuttle trips do not depend on the number of passengers carried, we prove optimality and monotonicity of threshold policies. We derive conditions for dispatching which reduce the computational eeort required to compute an optimal threshold policy. We provide a counterexample to t...

The geometric optimization of orthopedic screws can considerably increase their orthopedic efficiency. Due to the high geometric parameters of orthopedic screws, a finite element simulation is an effective tool for analyzing and forecasting the effect of the parameters on the load-bearing capacity of different types of screws and bones. Thus, in the present study, the tensile strength of a typi...

This paper studies a generic model for cooperative cognitive radio networks where the secondary user is equipped with a finite length relaying queue as well as a finite length battery queue. Our prime objective is to characterize the stable throughput region. Nevertheless, the complete characterization of stable throughput region is notoriously difficult, since the computation of the steady sta...

In this study, dynamic bearing capacity of adjacent shallow strip foundations located on sandy soil was examined using a numerical finite difference modeling, FLAC. The behavioral interference of shallow strip foundations under different conditions was investigated. The effect of soil strength parameters, geometric characteristics of shallow foundations and cyclic loads at different distance ra...