1 January 2004 in IEE Proceedings - Communications
14 August 2015 in EURASIP Journal on Wireless Communications and Networking
Long-Term Evolution (LTE) was implemented to fulfill and satisfy users’ needs as well as their demands for an improvised, fast and efficient Quality of service (QoS). A minimal aggregate of waiting time in return would give users a better Quality of experience (QoE). Real-time service packet scheduling is an important process in allocating resources to users. An efficient packet scheduling scheme will be able to cater fairly and efficiently to its users in the LTE network. Hence, studies are performed focusing on real-time traffic which includes video as well as Voice over Internet Protocol (VoIP) transmissions. In this work, the existing exponential rule (EXP rule) is utilized to benchmark our proposed packet scheduling techniques so that we are able to further evaluate the scheduling performance. In response to the increasing likelihood of losing packets in the EXP rule’s algorithm and maximizing the throughput rate, several schemes have been experimented with. The proposed schemes include 1) simplified EXP rule (sEXP Rule), 2) modified EXP rule (mEXP Rule), 3) EXP rule with maximum throughput (MT) (EXP_MT Rule), and 4) enhanced EXP rule with MT (E2M). By adding MT as a weight to the EXP rule, the throughput is maximized, thus providing higher throughput rates for real-time and non-real-time traffic. The simulation results show that the sEXP rule has a better performance in throughput, packet loss rate (PLR), and spectral efficiency for video traffic. Aside from this, our proposed E2M rule performs better than the benchmark EXP rule and outperforms the other proposed schemes, as well. It is observed that the E2M rule has better QoS support for real-time transmission in terms of delay, packet loss, throughput and spectral efficiency, within the LTE network. Hence, our proposed E2M rule is an enhancement of the benchmark EXP rule, which is commonly used in LTE packet scheduling.
1 December 2007 in Malaysian Journal of Computer Science
The development of software has always been characterized by parameters that possess certain level of fuzziness. This requires that some degree of uncertainty be introduced in the models, in order to make the models realistic. Fuzzy logic fares well in this area. Many of the problems of the existing effort estimation models can be solved by incorporating fuzzy logic. Besides, fuzzy logic had been combined with algorithmic, non-algorithmic effort estimation models as well as a combination of them to deal with the inherent uncertainty issues. This paper also described an enhanced fuzzy logic model for the estimation of software development effort. The model (FLECE) possesses similar capabilities as the previous fuzzy logic model. In addition to that, the enhancements done in FLECE improved the empirical accuracy of the previous model in terms of MMRE (Mean Magnitude of Relative Error) and threshold-oriented prediction measure or prediction quality (pred).
24 January 2014 in Journal of Information Science
Current research and development of structured retrieval systems allow search communities to tap into structured resources over the web. These resources have advantages compared with the normal web resources as they have additional annotations that can be utilized when composing a search request. However, structured query languages used by these retrieval systems are not meant for normal searchers. This article addresses this problem by automating the construction of a structured query from a keywords query that is more familiar to the web search user. As a result, a query transformation framework is proposed. Different from the existing framework, which is a one-time solution, our proposed framework has greater flexibility in accommodating new structured query languages and different collection types. A novel intermediate query representation is designed to handle transformation to multiple types of query languages, whereas a context-based probabilistic model is designed to capture the structural features of both homogeneous and heterogeneous collections. Experimental results show that the structured queries generated from our framework give promising results compared with their source queries. This finding suggests that the framework can potentially be used in search applications to improve their search features.