Title
Author
Year
Volume
:
2024
Vol. 1
no. 1
Vol. 2
2023
Vol. 1
no. 1
no. 2
2022
Vol. 1
no. 1
2021
Vol. 1
no. 1
2019
Vol. 1
no. 1
no. 2
2013
Vol. 1
no. 1
Vol. 2
no. 1
2011
Vol. 1
no. 1
Vol. 2
no. 1
2010
Vol. 1
no. 1
no. 2
Vol. 2
Vol. 0
Vol. 1
Volume 1, Number 1, 2010
Collision Resistant Temporally Ordered Routing Algorithm
Pages
:
1-8
Vinay Thotakura, Mahalingam Ramkumar
A broad class of mobile ad hoc network (MANET) applications will require every mobile node in a connected subnet to establish persistent paths with a single sink or gateway or command-post. Temporally ordered routing algorithm (TORA) is the only MANET routing protocol which has been explicitly designed to facilitate such a requirement. However, TORA has several shortcomings like i) the need for an expensive lower layer, the Internet MANET Encapsulation protocol (IMEP); and ii) substantial overhead in scenarios involving subnet partitions. We propose a novel protocol, collision-resistant TORA (CR-TORA), which is also designed to meet the same goal as TORA, viz., to lower overhead for establishing persistent paths from all nodes to a destination. However, CR-TORA overcomes the shortcomings of TORA. Simulations show that for the intended application scenario CR-TORA demands lower number of total packets to be transmitted to realize higher data packet throughput, with lower latency.
Modelling Time Control in Evaluation Process of E - learning Platforms by Automata Formalism
Pages
:
9-15
Mirna El-Hajj-Barbar, Youssef Monsef, Kablan Barbar, Bilal Chebaro
This paper shows that automata formalism is applied as data structure and running system models to express time control in the evaluation process. Therefore, at the implementation level, new questionnaires description language and evaluation system architecture are introduced for time control over questionnaires, in translating the automata structure, respectively, in the XML and client-server environments. Moreover, the automata formalism is extended and enriched with the concept of attributes in order to evaluate time at each automata state (or test).
Spoken Arabic Digits Classifier via Sophisticated Wavelet Transform Features Extraction Method
Pages
:
16-25
Khaled Daqrouq, Mikhled Alfaouri
The essential problem of Arabic recognition systems is the several of Arabic language dialects, especially along with associated noise. Therefore, low recognition rate is encountered, as a result of such an environment. In this research paper, the authors presented dialect-independent via sophisticated wavelet transform-based Arabic digits classifiers (SWADC). The proposed classifier is divided into three main blocks: 1) Filtration and widowing. 2) Sophisticated Features Extraction Method by combining Continuous Wavelet Transform (CWT) with Linear Prediction Coefficient (LPC) and Mel Frequency Cepstral Coefficient (MFCC). 3) Classification by Root Mean Square Difference Similarity Measure (RDSM) and Feed Forward Back Propagation Neural Network Classification (FFBPNC). The proposed classifier provided a high Recognition Rate reaches up to 100%, in some cases, and an average cases up to 95.9%, for about 450 tested individual digits, based on speaker-independent system.
Nonlinear Control of PWM Multilevel Inverter-Fed Induction Motors
Pages
:
26-36
Lazhar Manai, Faouzi Ben Ammar
This paper presents a method to design a new control algorithm, using the nonlinear feedback transformation technique to deal with the control problem of multilevel inverter-induction motors system. To provide effective control, nonlinearities and flying capacities voltages variations in the model must be taken into account in the control design. Based on input-output linearization theory, a decoupled nonlinear control strategy is obtained for induction motor by assuring multilevel inverter capacities voltages stabilization. Simulation results demonstrate that the approach proposed in this paper is correct, and the control strategy designed is effective.
An Efficient ARQ Scheme for Reliable Video Broadcasting in Wireless LANs
Pages
:
37-44
Jun Peng
Video streaming has become a popular and important type of network?application. Meanwhile, wireless LANs have been gaining popularity?too. It has thus become important to address the reliability problem?for video streaming in wireless LANs and for video streaming from?the Internet to the users in wireless LANs. This paper proposes an?efficient Automatic Repeat Request (ARQ) scheme to address the?reliability problem for video broadcasting in such scenarios.?Based on a novel approach of virtual bitmaps, the proposed scheme?achieves high efficiency in recovering broadcasting losses in?wireless LANs but does not use out-of-band signals. The comprehensive?simulation results in the paper show that, as compared with existing?schemes, the proposed scheme improves node broadcast throughput by?from several tens to more than one hundred percent in wireless LANs.
High Speed Reconfigurable SWP Operator for Multimedia Processing Using Redundant Data Representation
Pages
:
45-52
Shafqat Khan, Emmanuel Casseau, Daniel Menard
For better performance and efficiency, high-speed reconfigurable computation units are required in processor design. However the reconfiguration overheads like interconnection cost and reconfiguration time reduce the benefits of reconfigurable processors. At the same time within the arithmetic operators, the speed of operations on binary data cannot be increased beyond certain limits because of the inherited carry propagation at any stage of the addition. In this paper to address both reconfiguration and computation time issues, a high-speed reconfigurable operator is proposed for multimedia applications. This operator provides reconfigurability at both the operation level (different multimedia oriented operations) and at the data size level (different pixel data sizes) through the use of multimedia oriented subword parallelism (SWP). The speed of the different arithmetic operations is improved through the use of a carry propagation free addition on a redundant (barrow save) data representation. For multimedia applications, this operator ensures reconfigurability with high resource utilization along with high-speed operations.
Autonomic Computing Strategy for Server Virtualization
Pages
:
53-59
Marius-Constantin Popescu
This paper presents a technique specially adapted for the implementation of some techniques for self-supply and self-optimization for autonomic computing with application in server virtualization. The autonomic computing processes are considered non-linear, variable systems with constant linear parameter variations. The approach is based on the fact that a computer system behaves in time in a non-linear way, its parameters having a random variation and the components of the autonomic environment can fail occasionally.
Evaluating Intrusion Detection Approaches Using a Multi-criteria Decision Making
Pages
:
60-67
Iftikhar Ahmad, Azween Abdullah, Abdullah Alghamdi
We can witness the growing interest of researchers in the field of intrusion detection because a single attack can easily cause a big harm to the computer or network system. A number of intrusion detection approaches are available to tackle this issue but it is hard to identity that which approach is most suitable. Therefore, we have addressed this issue in this paper that which approach should be adopted in intrusion detection systems. The current paper explains the concepts, tools and methodologies being used to evaluate different intrusion detection approaches by a multi-criteria decision making technique such as Analytical Hierarchy Process (AHP). The present study indicates that artificial neural network approach is most suitable to tackle the current issues of intrusion detection systems such as regular updating, detection rate, false positive, false negative, suitability and adaptability.
Improved Bayesian Network Structure Learning for Breast Cancer Prognosis
Pages
:
68-76
Farzana Kabir Ahmad, Safaai Deris, Nor Hayati Othman
Structure learning of Bayesian networks is a well-researched but computationally and NP-hard task. We present an algorithm that integrates a low-order conditional independence approach for learning structures of Bayesian networks. Our algorithm also makes use of basic Bayesian network concepts. We show that the proposed algorithm is capable of handling networks with a large number of variables and small sample size in the case of microarray data analysis. We present the applicability of the proposed algorithm on breast cancer data sets and also compare its performance and computational efficiency with full-order conditional independence method. The experimental results show that our method can efficiently and accurately identify complex network structures from data.
A Secure Protocol for Three-Party Authenticated Key Exchange with Provable Belief
Pages
:
77-87
Ting-Fang Cheng, Chin-Chen Chang, Zhi-Hui Wang
Three-Party authenticated key exchange (3PAKE) protocol is an important cryptographic mechanism in which two clients can request the session key for communicating with each other and one trusted server takes the responsibility for authenticating users and key agreements. In 2007, Lu and Cao proposed a simple 3PAKE protocol. Nevertheless, we find that it is vulnerable to the off-line password guessing attack and the impersonation attack. We therefore propose a novel version using smart cards to withstand more malicious attacks. We also give a formal correctness analysis of mutual authentication to our scheme using BAN authentication logic. What is more, we make detail discussions for highlighting that our proposed scheme can prevent several malicious attacks and is more efficient than other related works.
Home
|
Aims and scopes
|
Editorial board
|
Published issues
|
Instruction for authors
