cover
Article Per Year (5 Year)
All
Home Page
OAI Link
Editorial Team
Contact
Reviewer
Google Scholar
Contact Name
-
Contact Email
-
Phone
-
Journal Mail Official
-
Editorial Address
-
Location
Kota yogyakarta,
Daerah istimewa yogyakarta
INDONESIA
International Journal of Informatics and Communication Technology (IJ-ICT)
Published by Institute of Advanced Engineering and Science
ISSN : 22528776     EISSN : 27222616     DOI : -
Core Subject : Science,
Computer Science & IT
International Journal of Informatics and Communication Technology (IJ-ICT) is a common platform for publishing quality research paper as well as other intellectual outputs. This Journal is published by Institute of Advanced Engineering and Science (IAES) whose aims is to promote the dissemination of scientific knowledge and technology on the Information and Communication Technology areas, in front of international audience of scientific community, to encourage the progress and innovation of the technology for human life and also to be a best platform for proliferation of ideas and thought for all scientists, regardless of their locations or nationalities. The journal covers all areas of Informatics and Communication Technology (ICT) focuses on integrating hardware and software solutions for the storage, retrieval, sharing and manipulation management, analysis, visualization, interpretation and it applications for human services programs and practices, publishing refereed original research articles and technical notes. It is designed to serve researchers, developers, managers, strategic planners, graduate students and others interested in state-of-the art research activities in ICT.
Arjuna Subject : -
Articles 8 Documents
 1 
Search results for , issue "Vol 2, No 1: April 2013" : 8 Documents clear
Bounds on Codes Correcting Periodic Errors Blockwise Pankaj Kr Das
International Journal of Informatics and Communication Technology (IJ-ICT) Vol 2, No 1: April 2013
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (274.826 KB)

Abstract

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.1332
Interval-valued Intuitionistic Fuzzy Weighted Entropy in Evaluation of Service Quality Lazim Abdullah; Hui Mei Ling
International Journal of Informatics and Communication Technology (IJ-ICT) Vol 2, No 1: April 2013
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (406.564 KB)

Abstract

The importance of measuring service quality perceived by customers is an issue since the service quality is a key to success in service oriented industry. The estimation of service quality should be carried out with suitable measurement scales according to the types of service provided. To the best of authors’ knowledge, there have been little discussion about the applications of interval-valued intuitionistic fuzzy sets- based evaluation in measuring service quality. This paper proposes an evaluation for service quality of five vehicle insurance companies using interval-valued intuitionistic fuzzy entropy measure. Linguistic data were collected from customers using a questionnaire. An averaged interval-valued intuitionistic fuzzy number is used to construct decision matrix.  Interval-valued intuitionistic fuzzy weighted averaging operator is used to aggregate the interval-valued intuitionistic fuzzy numbers for alternatives. It is found that PCF Insurance was evaluated as the best vehicle insurance company in providing service quality to customersDOI: http://dx.doi.org/10.11591/ij-ict.v2i1.1525
Query Dependent Ranking for Information Retrieval Based on Query Clustering Pwint Hay Mar Lwin
International Journal of Informatics and Communication Technology (IJ-ICT) Vol 2, No 1: April 2013
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (403.006 KB)

Abstract

Ranking is the central problem for information retrieval (IR), and employing machine learning techniques to learn the ranking function is viewed as a promising approach to IR. In information retrieval, the users’ queries often vary a lot from one to another. In this paper we take into account the diversity of query type by clustering the queries. Instead of deriving a single function, this system attempt to develop several ranking functions based on the resulting query clusters in the sense that different queries of the same cluster should have similar characteristics in terms of ranking. Before the queries are clustered, query features are generated based on the average scores of its associated retrieved documents.  So, for each query cluster, there will be its associated ranking model. To rank the documents for a new query, the system first find the most suitable cluster for that query and produce the scoring results depend on that cluster. The effectiveness of the system will be tested on LETOR, publicly available benchmark dataset.DOI: http://dx.doi.org/10.11591/ij-ict.v2i1.1505
Positive UX and Active Use of ICT Devices among the Elderly Ayako Hashizume; Masaaki Kurosu
International Journal of Informatics and Communication Technology (IJ-ICT) Vol 2, No 1: April 2013
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (765.786 KB)

Abstract

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.1506
Efficient K-Means Cluster Reliability on Ternary Face Recognition Using Angle Oriented Approach Remani Naga Venkata Jagan Mohan; Kurra RajaSekhara Rao
International Journal of Informatics and Communication Technology (IJ-ICT) Vol 2, No 1: April 2013
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (835.038 KB)

Abstract

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.1779
XML-Based RDF Data Management for XPath Query Language Win Lai Hnin
International Journal of Informatics and Communication Technology (IJ-ICT) Vol 2, No 1: April 2013
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (481.598 KB)

Abstract

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.1503
Botnet Prevention Strategies for Social Network Users: Cases and Remedies Nishikant C Dhande
International Journal of Informatics and Communication Technology (IJ-ICT) Vol 2, No 1: April 2013
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (366.98 KB)

Abstract

A Botnet is a collection of computers infected with malicious code that use FTP, TFTP, and HTTP protocol based services for infecting the computers. They keep on spreading till a desired strength of Botnet is assembled. Since social networking users have inclination to grow the Social Networks, a poorly designed social networking website can have some loop holes which could invoke a Botnet to spread around the users connected to it.  In this paper attempt is made to elaborate assimilation of social networks and to show how they can turn into Botnet. This study is based on the analysis of spam, Internet blogs, newsgroups & Cases for converging into conclusionsDOI: http://dx.doi.org/10.11591/ij-ict.v2i1.1819
Optimal Solution of Minmax 0/1 Knapsack Problem using Dynamic Programming Ani Dijah Rahajoe; Edi Winarko
International Journal of Informatics and Communication Technology (IJ-ICT) Vol 2, No 1: April 2013
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (704.037 KB)

Abstract

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.1299

Page 1 of 1 | Total Record : 8

 1 

Filter by Year

2013 2013


Reset
Filter By Issues
All Issue Vol 12, No 3: December 2023 Vol 12, No 2: August 2023 Vol 12, No 1: April 2023 Vol 11, No 3: December 2022 Vol 11, No 2: August 2022 Vol 11, No 1: April 2022 Vol 10, No 3: December 2021 Vol 10, No 2: August 2021 Vol 10, No 1: April 2021 Vol 9, No 3: December 2020 Vol 9, No 2: August 2020 Vol 9, No 1: April 2020 Vol 8, No 3: December 2019 Vol 8, No 2: August 2019 Vol 8, No 1: April 2019 Vol 7, No 3: December 2018 Vol 7, No 2: August 2018 Vol 7, No 1: April 2018 Vol 6, No 3: December 2017 Vol 6, No 2: August 2017 Vol 6, No 1: April 2017 Vol 5, No 3: December 2016 Vol 5, No 2: August 2016 Vol 5, No 1: April 2016 Vol 4, No 3: December 2015 Vol 4, No 2: August 2015 Vol 4, No 1: April 2015 Vol 3, No 3: December 2014 Vol 3, No 2: August 2014 Vol 3, No 1: April 2014 Vol 2, No 3: December 2013 Vol 2, No 2: August 2013 Vol 2, No 1: April 2013 Vol 1, No 2: December 2012 Vol 1, No 1: June 2012 More Issue