Asian Science Citation Index is committed to provide an authoritative, trusted and significant information by the coverage of the most important and influential journals to meet the needs of the global scientific community.  
ASCI Database
308-Lasani Town,
Sargodha Road,
Faisalabad, Pakistan
Fax: +92-41-8815544
Contact Via Web
Suggest a Journal
Articles by Ali Mamat
Total Records ( 4 ) for Ali Mamat
  Waleed Halboob , Ramlan Mahmod , Khaled S. Alghathbar and Ali Mamat
  Controlling access to the cloud computing services involves new scalability and security challenges that cannot be directly addressed by traditional access control solutions. In other words, cloud computing access control requires establishing a trust between users, service provider and provided services in a scalable manner. Moreover, several access control issues have not been considered in cloud computing such as providing users with a temporal and delegable access. This paper proposed the design of a trusted and decentralized cloud computing access control model for better security and scalability. To address the scalability issue, the components of the proposed model are separated in such a way that they can be decentralized and executed in different extensible machines. The proposed model includes a Trusted XML-based Cloud Computing Policy Language (TXCCPL) that specifies access control policies for authenticating and authorizing both the user and his platform based on the Decentralized Trust Management (DTM) and Trusted Computing (TC) concepts. An Identity Based Encryption (IBE) is used for providing users with temporal and delegable access. Our analysis shows that the proposed model is cost-effectively distributed while avoiding the possible bottlenecks and, as a result, effectively scales with increased workloads. Also, using the DTM and TC concepts help on addressing several security challenges found in cloud computing.
  Mohammed Radi , Ali Mamat , M. Mat Deris , Hamidah Ibrahim and Subramaniam Shamala
  Replication is a well known technique to improve reliability and performance for a Data Grid. Keeping consistent content at all distributed replica is an important subject in Data Grid. Replica consistency protocol using classical propagation method called the radial method suffers from high overhead at the master replica site, while line method suffers from high delay time. In Data Grid not all replicas can be dealt with in the same way, since some will be in greater demand than others. Updating first replica having most demand, a greater number of clients would access the updated content in a shorter period of time. In this study, based on asynchronous aggressive update propagation technique, a scalable replica consistency protocol is developed to maintain replica consistency in data grid which aimed to reaching delay reduction and load balancing, such that the high access weight replicas updated faster than the others. The simulation results shows that the proposed protocol is capable of sending the updates to high access replicas in a short period while reducing the total update propagation repose time and reached load balancing.
  Mohammad Reza Soltan Aghaei , Zuriati Ahmad Zukarnain , Ali Mamat and Hishamuddin Zainuddin
  Problem statement: In this study, a general plan of hybrid architecture for quantum algorithms is proposed. Approach: Analysis of the quantum algorithms shows that these algorithms were hybrid with two parts. First, the relationship of classical and quantum parts of the hybrid algorithms was extracted. Then a general plan of hybrid structure was designed. Results: This plan was illustrated the hybrid architecture and the relationship of classical and quantum parts of the algorithms. This general plan was used to increase implementation performance of quantum algorithms. Conclusion/Recommendations: Moreover, simulation results of quantum algorithms on the hybrid architecture proved that quantum algorithms can be implemented on the general plan as well.
  Meghdad Mirabi , Hamidah Ibrahim , Ali Mamat , Nur Izura Udzir and Leila Fathi
  Problem statement: In order to facilitate XML query processing, labeling schemes are used to determine the structural relationships between XML nodes. However, labeling schemes have to reliable the existing nodes or recalculate the label values when a new node is inserted into the XML document during XML update process. EXEL as a labeling scheme is able to remove relabeling for existing nodes during XML update process. Also, it is able to compute the structural relationship between nodes effectively. However, for the case of skewed insertions where nodes are always inserted at a fixed place, the label size of EXEL scheme increases very fast. Approach: This study discussed how to control the increment of label size for the EXEL scheme. In addition, EXEL does not consider the process of deleting labels. We also study how to reuse the deleted labels for future label insertions. Results: We proposed an algorithm which is able to control the label size increment. Conclusion: It required less storage size to store the inserted binary bit string and thus can improve query performance.
Copyright   |   Desclaimer   |    Privacy Policy   |   Browsers   |   Accessibility