Browsing by Author "Abdullah I."
Now showing 1 - 3 of 3
Results Per Page
Sort Options
- Some of the metrics are blocked by yourconsent settings
Publication Controlling algorithm for energy consumption of radio bandwidth to manage coverage area problem(CRC Press/Balkema, 2015) ;Marsal K.A. ;Abdullah I.Universiti Sains Islam Malaysia (USIM)There is a wide range of application in wireless ad-hoc networks which are related to crucial operations of the government and security, private sectors, health services as well as environmental assessment. Based on the importance of these networks, the coverage area problem has remained an area of focus among researchers and is implemented as one of the most important design criteria of mobile devices. Efficiency consumption of energy is one of the key areas of wireless ad-hoc networks due to the limitation of batteries. Therefore, the protocol that uses low energy consumption is an important factor in these networks due to their impact on the network�s coverage. In this study, the main objective is to determine the energy-efficient algorithms for coverage problems from the literature. It has been determined that to accommodate a large wireless ad-hoc network, distributed algorithms can be used to obtain a higher energy efficiency through coverage regulating algorithms. � 2015 Taylor & Francis Group, London. - Some of the metrics are blocked by yourconsent settings
Publication On the symbolic manipulation for the cardinality of certain degree polynomials(American Institute of Physics Inc., 2016) ;Abdullah I. ;Seman K. ;Taib B.M. ;Puspita F.M. ;Faculty of Science and Technology ;Universiti Sains Islam Malaysia (USIM)University of SriwijayaThe research on cardinality of polynomials was started by Mohd Atan [1] when he considered a set, V(f-;p?)={umodp?:f-(u)?0modp?}, where ? > 0 and f-=(f1,f2,?fn). The term f-(u)?0-modp? means that we are considering all congruence equations of modulo p? and we are looking for u that makes the congruence equation equals zero. This is called the zeros of polynomials. The total numbers of such zeros is termed as N(f-;p?). The above p is a prime number and Zp is the ring of p-adic integers, and x-=(x1,x2, ?xn). He later let N(f-;p?)=card V(f-;p?). The notation N(f-;p?) means the number of zeros for that the polynomials f-. For a polynomial f (x) defined over the ring of integers Z, Sandor [2] showed that N(f;p?)? mp12ordpD, where D ? 0, ? > ordpD and D is the discriminant of f. In this paper we will try to introduce the concept of symbolic manipulation to ease the process of transformation from two-variables polynomials to one-variable polynomials. � 2016 Author(s). - Some of the metrics are blocked by yourconsent settings
Publication Successful factors on e-government security social-technical aspect(Asian Research Publishing Network, 2015) ;Ihmouda R. ;Alwi N.H.M. ;Abdullah I. ;Faculty of Science and TechnologyUniversiti Sains Islam Malaysia (USIM)This study explored and identified success social-technical factors related to the information security effectiveness in organizations. It explored these factors based on literature view, and documents, the study based on the Socio-Technical approach (STA) and the Security by Consensus (SBC) model. Quantitative analysis of the organizations' employees' experiences were analyzed and discussed to validate the questionnaire. The aim of this paper is to propose conceptual framework for understanding, clarification and investigation of the socio-technical factors involved in improving e-government security effectiveness in developing countries. 2006-2015 Asian Research Publishing Network (ARPN).