http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Performance Evaluation of Finite Queue Switching Under Two-Dimensional M/G/1(m) Traffic
( Md. Syeful Islam ),( Md Rezaur Rahman ),( Anupam Roy ),( Md Imdadul Islam ),( M. R. Amin ) 한국정보처리학회 2011 Journal of information processing systems Vol.7 No.4
In this paper we consider a local area network (LAN) of dual mode service where one is a token bus and the other is a carrier sense multiple access with a collision detection (CSMA/CD) bus. The objective of the paper is to find the overall cell/packet dropping probability of a dual mode LAN for finite length queue M/G/1(m) traffic. Here, the offered traffic of the LAN is taken to be the equivalent carried traffic of a one-millisecond delay. The concept of a tabular solution for two-dimensional Poisson`s traffic of circuit switching is adapted here to find the cell dropping probability of the dual mode packet service. Although the work is done for the traffic of similar bandwidth, it can be extended for the case of a dissimilar bandwidth of a circuit switched network.
Performance Evaluation of Finite Queue Switching Under Two-Dimensional M/G/1(m) Traffic
Islam, Md. Syeful,Rahman, Md. Rezaur,Roy, Anupam,Islam, Md. Imdadul,Amin, M.R. Korea Information Processing Society 2011 Journal of information processing systems Vol.7 No.4
In this paper we consider a local area network (LAN) of dual mode service where one is a token bus and the other is a carrier sense multiple access with a collision detection (CSMA/CD) bus. The objective of the paper is to find the overall cell/packet dropping probability of a dual mode LAN for finite length queue M/G/1(m) traffic. Here, the offered traffic of the LAN is taken to be the equivalent carried traffic of a one-millisecond delay. The concept of a tabular solution for two-dimensional Poisson's traffic of circuit switching is adapted here to find the cell dropping probability of the dual mode packet service. Although the work is done for the traffic of similar bandwidth, it can be extended for the case of a dissimilar bandwidth of a circuit switched network.
Fingerprint Detection Using Canny Filter and DWT, a New Approach
( Md. Imdadul Islam ),( Nasima Begum ),( Mahbubul Alam ),( M. R. Amin ) 한국정보처리학회 2010 Journal of information processing systems Vol.6 No.4
This paper proposes two new methods to detect the fingerprints of different persons based on one-dimensional and two-dimensional discrete wavelet transformations (DWTs). Recent literature shows that fingerprint detection based on DWT requires less memory space compared to pattern recognition and moment-based image recognition techniques. In this study four statistical parameters - cross correlation co-efficient, skewness, kurtosis and convolution of the approximate coefficient of one-dimensional DWTs are used to evaluate the two methods involving fingerprints of the same person and those of different persons. Within the contexts of all statistical parameters in detection of fingerprints, our second method shows better results than that of the first method.
Fingerprint Detection Using Canny Filter and DWT, a New Approach
Islam, Md. Imdadul,Begum, Nasima,Alam, Mahbubul,Amin, M.R. Korea Information Processing Society 2010 Journal of information processing systems Vol.6 No.4
This paper proposes two new methods to detect the fingerprints of different persons based on one-dimensional and two-dimensional discrete wavelet transformations (DWTs). Recent literature shows that fingerprint detection based on DWT requires less memory space compared to pattern recognition and moment-based image recognition techniques. In this study four statistical parameters - cross correlation co-efficient, skewness, kurtosis and convolution of the approximate coefficient of one-dimensional DWTs are used to evaluate the two methods involving fingerprints of the same person and those of different persons. Within the contexts of all statistical parameters in detection of fingerprints, our second method shows better results than that of the first method.
( Jesmin Akhter ),( Md. Imdadul Islam ),( M. R. Amin ) 한국정보처리학회 2014 Journal of information processing systems Vol.10 No.4
To enhance the utilization of the traffic channels of a network (instead of allocating radio channel to an individual user), a channel or a group of channels are allocated to a user group. The idea behind this is the statistical distribution of traffic arrival rates and the service time for an individual user or a group of users. In this paper, we derive the blocking probability and throughput of a subscriber station of Worldwide Interoperability for Microwave Access (WiMAX) by considering both the connection level and packet-level traffic under a complete partition scheme. The main contribution of the paper is to incorporate the traffic shaping scheme onto the incoming turbulent traffic. Hence, we have also analyzed the impact of the drain rate of the buffer on the blocking probability and throughput.
( Tonmoy Saha ),( Md. Abu Shufean ),( Mahbubul Alam ),( Imdadul Islam ) 한국정보처리학회 2011 Journal of information processing systems Vol.7 No.4
WiMAX is intended for fourth generation wireless mobile communications where a group of users are provided with a connection and a fixed length queue. In present literature traffic of such network is analyzed based on the generator matrix of the Markov Arrival Process (MAP). In this paper a simple analytical technique of the two dimensional Markov chain is used to obtain the trajectory of the congestion of the network as a function of a traffic parameter. Finally, a two state phase dependent arrival process is considered to evaluate probability states. The entire analysis is kept independent of modulation and coding schemes.
Selection of the Best Two-Hop AF Wireless Link under Multiple Antenna Schemes over a Fading Channel
( Abu Sayed Md Mostafizur Rahaman ),( Md Imdadul Islam ),( M R Amin ) 한국정보처리학회 2015 Journal of information processing systems Vol.11 No.1
In evaluating the performance of a dual-hop wireless link, the effects of large and small scale fading has to be considered. To overcome this fading effect, several schemes, such as multiple-input multiple-output (MIMO) with orthogonal space time block codes (OSTBC), different combining schemes at the relay and receiving end, and orthogonal frequency division multiplexing (OFDM) are used in both the transmitting and the relay links. In this paper, we first make compare the performance of a two-hop wireless link under a different combination of space diversity in the first and second hop of the amplify-and-forward (AF) case. Our second task in this paper is to incorporate the weak signal of a direct link and then by applying the channel model of two random variables (one for a direct link and another for a relayed link) we get very impressive result at a low signal-to-noise ratio (SNR) that is comparable with other models at a higher SNR. Our third task is to bring other three schemes under a two-hop wireless link: use of transmit antenna selection (TAS) on both link with weak direct link, distributed Alamouti scheme in two-hop link and single relay antenna with OFDM subcarrier. Finally, all of the schemes mentioned above are compared to select the best possible model. The main finding of the paper is as follows: the use of MIMO on both hops but application TAS on both links with weak direct link and the full rate OFDM with the sub-carrier for an individual link provide a better result as compared to other models.
Performance Evaluation of the VoIP Services of the Cognitive Radio System, Based on DTMC
Habiba, Ummy,Islam, Md. Imdadul,Amin, M.R. Korea Information Processing Society 2014 Journal of information processing systems Vol.10 No.1
In recent literature on traffic scheduling, the combination of the two-dimensional discrete-time Markov chain (DTMC) and the Markov modulated Poisson process (MMPP) is used to analyze the capacity of VoIP traffic in the cognitive radio system. The performance of the cognitive radio system solely depends on the accuracy of spectrum sensing techniques, the minimization of false alarms, and the scheduling of traffic channels. In this paper, we only emphasize the scheduling of traffic channels (i.e., traffic handling techniques for the primary user [PU] and the secondary user [SU]). We consider the following three different traffic models: the cross-layer analytical model, M/G/1(m) traffic, and the IEEE 802.16e/m scheduling approach to evaluate the performance of the VoIP services of the cognitive radio system from the context of blocking probability and throughput.
Basak, Sarnali,Islam, Md. Imdadul,Amin, M.R. Korea Information Processing Society 2012 Journal of information processing systems Vol.8 No.3
Different types of fingerprint detection algorithms that are based on extraction of minutiae points are prevalent in recent literature. In this paper, we propose a new algorithm to locate the virtual core point/centroid of an image. The Euclidean distance between the virtual core point and the minutiae points is taken as a random variable. The mean, variance, skewness, and kurtosis of the random variable are taken as the statistical parameters of the image to observe the similarities or dissimilarities among fingerprints from the same or different persons. Finally, we verified our observations with a moment parameter-based analysis of some previous works.
Akhter, Jesmin,Islam, Md. Imdadul,Amin, M.R. Korea Information Processing Society 2014 Journal of information processing systems Vol.10 No.4
To enhance the utilization of the traffic channels of a network (instead of allocating radio channel to an individual user), a channel or a group of channels are allocated to a user group. The idea behind this is the statistical distribution of traffic arrival rates and the service time for an individual user or a group of users. In this paper, we derive the blocking probability and throughput of a subscriber station of Worldwide Interoperability for Microwave Access (WiMAX) by considering both the connection level and packet-level traffic under a complete partition scheme. The main contribution of the paper is to incorporate the traffic shaping scheme onto the incoming turbulent traffic. Hence, we have also analyzed the impact of the drain rate of the buffer on the blocking probability and throughput.