International Journal of Informatics and Communication Technology (IJ-ICT)
Not a member yet
494 research outputs found
Sort by
802.11 DCF in Dynamic MANET On-demand Routing
A Mobile Ad-Hoc Network (MANET) is a collection of wireless mobile nodes that communicates with each other without using any existing infrastructure, access point or centralized administration .wireless LAN is an IEEE 802.11 standard supported DCF and MAC features. In this article discuss performance on Distributed Coordination Function (DCF) in Dynamic MANET on demand routing protocols on constant bit rate (CBR).Using Qualnet simulation tools 5.0.2 and finally discuss combine comparative performance analysis 802.11 DCF .The effective performance of 802.11 DCF in Dynamic MANET on demand routing protocol on the performance metrics such as 802.11 DCF: Broadcasts sent, Broadcasts received, Unicasts sent, Unicasts received, CTS packet sent, packet drops due to retransmissions limit, RTS packet sent, ACK packet sent, RTS retransmissions due to time out and packet retransmissions due to ACK timeout..DOI: http://dx.doi.org/10.11591/ij-ict.v2i2.395
Bounds on Codes Correcting Periodic Errors Blockwise
This paper presents a necessary and sufficient condition on the number of paritycheck digits required for the existence of codes correcting periodic errors of different ordersin different blocks of a code. An example of such a code has also been provided.DOI: http://dx.doi.org/10.11591/ij-ict.v2i1.133
Human Machine Interface Based on Eye Wink Detection
The research of human-computer interfaces has become a growing field in computer science, which aims to attain the development of more natural, intuitive, unobtrusive and efficient interfaces. The present work describes a Human Machine Interface Based on Eye Wink Detection for helping the severely handicapped people to manipulate the household devices and to perform day to day activities. Algorithm for eye detection that is conductedthrough a process of extracting the face image from the video image followed by evaluating the eye region and then eventually detecting the eye state based on skin colour segmentation. Binary values 1 and 0 is assigned based on the opening and closing of eye. Finally applying the dynamic programming to translate the code sequences to a certain valid command. Experiment conducted for different test video displayed significant results which is carried out with different set of inputs.DOI: http://dx.doi.org/10.11591/ij-ict.v2i2.392
Positive UX and Active Use of ICT Devices among the Elderly
People have started to use ICT(Information and Communication Technology) devices to acieve various goals in many situations. But a gap still exsists between high end users and low end users that is related to their demographic group. One of the important traits is the generation or the age group. Authors conducted field research by the contextual inquiry method and analyzed the data by applying M-GTA, then summarized the information into a category relationship diagram. In this diagram,factors such as the motivation for using ICTs, active involvement in the communication and ICT literacy were regarded as three major components.DOI: http://dx.doi.org/10.11591/ij-ict.v2i1.150
Efficient K-Means Cluster Reliability on Ternary Face Recognition Using Angle Oriented Approach
One of the major difficulties in face recognition system is an in-depth pose verification problem. Face recognition is a broad area of research over the last 25 years. However, the field is highly unsolved, largely due to variations in pose, illumination and expression. In this paper, a Ternary based Angle Oriented Face Recognition algorithm is proposed. In this algorithm, the data is made into two clusters namely, Clock wise and Anti-clock wise rotations using Fuzzy method. The image is extracted using angle oriented DCT (Discrete Cosine Transform) that invokes certain normalization techniques. Face Matching is compared to the technique of k-means. Based on Image Recognition pattern, the reliability of clusters is studied using Nelson model. The experimental results are verified.DOI: http://dx.doi.org/10.11591/ij-ict.v2i1.177
Design of Registration and Validation Algorithm of Member’s Personal Data
This paper deals with the methods of verification of web-forum members’ personal data, which are implemented in the algorithm of registration and validation of personal data on web-community member. The problem of personal data verifying and method of registration in an online community is investigated. These issues have the greatest influence on efficiency rise of virtual communities functioning and the level of data authenticity in web-members’ personal profiles. Solution of these problems is possible by using computer-linguistic analysis of web-members’ posts.DOI: http://dx.doi.org/10.11591/ij-ict.v2i2.396
XML-Based RDF Data Management for XPath Query Language
The Semantic Web is an extention of the current Web that will allow to find, share and combine information more easily. The meaning in the Semantic Web is mostly represented by Resource Description Framework (RDF). To harvest such power requires robust and scalable data repositories that can store RDF data. Most of the existing RDF storage techniques rely on relation model and relational database technologies for these tasks. The mis-match between the graph model of the RDF data and the rigid 2D tables of relational model jeopardizes the scalability of such repositories and frequently renders a repository inefficient for some types of data and queries. This paper proposed a system that can store RDF data in the XML repository and discuss the basic idea of conversion from RDF Schema to XML Schema and XPath queries for extract information from XML database.DOI: http://dx.doi.org/10.11591/ij-ict.v2i1.150
Optimal Solution of Minmax 0/1 Knapsack Problem using Dynamic Programming
Knapsack problem is a problem that occurs when looking for optimal selection of objects that will be put into a container with limited space and capacity. On the issue of loading goods into the container, optimal selection of objects or items to be sent must fulfilled to minimize the total weight of the capacity or volume limits without exceeding the maximum capacity of containers that have been determined. The types of knapsack that has been discussed so far is only to maximize the use not to exceed the limits specified capacity so it cannot be applied to the problem. This study aims to develop a dynamic programming algorithm to solve the MinMax 0/1 knapsack, which is an extension of the 0/1 knapsack with minimal and maximal constrain. The result study showed that application of the MinMax 0/1 knapsack is used to generate the optimal solution to the problem of loading system goods into the container to optimize container space available compared with the loading of goods by PT DFI.DOI: http://dx.doi.org/10.11591/ij-ict.v2i1.129
An Evaluation Framework for New ICTs Adoption in Architectural Education
The advent of new Information and Communication Technologies (ICTs) poses several challenges for its use and adoption particularly for teaching and learning purposes in most Higher Educational Institutions (HEIs). Understanding the criteria to use and how to measure success are some of the challenges faces by most departments of Architecture in Nigerian Universities. Thus, this paper has attempted to address these challenges by proposing an evaluation framework for the adoption of new ICTs in tertiary institutions of learning with particular interest in Architectural education. Baseline information collected from the department of architecture in five different Nigerian Universities was used to identify the major constraints encountered in Information and Communication Technologies adoption in Architectural education and the best approach that will promote better rate of Information Technology (IT) adoption. The major contribution of the study is that the proposed framework can be used to interpret specific results as to whether the use of technology within a particular literacy program led to improved learning, and provide a better understanding of such results in larger contexts and various aspects of other issues related to evaluation, access, and literacy learning in Architectural education.DOI: http://dx.doi.org/10.11591/ij-ict.v2i3.528
Named Data Networking (NDN), New Approach to Future Internet Architecture Design: A Survey
To envision and evolve the Internet into the future, what required is a simple but a vital architectural modification which focuses on “What (the contents)” rather than “Where (the addresses)”, that the Internet users and the applications are more concern about. So the communication can be more in effect if the customers can simply identify that what content they want to have instead of from where the content can be possessed. To achieve this and also to make the system more efficient and effective, new internet architecture emerged which we baptized as “Named Data Networking” or simply “NDN” in which packets bring with it the hierarchical data names instead of carrying the source and destination address. In NDN when the customer needs some data, he sends the interest packet which carries the name, is first received by the router and the router then forwards it as per instructed by FIB and uphold the status of pending interest , in further which is used for guiding the retrieved data back to the customer. The main objectives behind developing this architecture are to bring the scalability, efficiency, security and robustness in the current internet state, facilitating the user choice and competition as well. In this paper an overview of different future internet architectural approaches are provided such as CCN, NetInf, PRISP and DONA. NDN as a brand new architectural design among them remains the leading focus and its altered architectural design as a source of fulfilling the above mentioned major issues and objectives.DOI: http://dx.doi.org/10.11591/ij-ict.v2i3.512