cover
Article Per Year (5 Year)
All
Home Page
OAI Link
Editorial Team
Contact
Reviewer
Google Scholar
Contact Name
Computer Science and Information Technologies (CSIT)
Contact Email
csit@aptikom-journal.id
Phone
+6285781002211
Journal Mail Official
csit@aptikom-journal.id
Editorial Address
Jl. Jend. Sudirman No, 40 Modern – Cikokol Tangerang 15117, Indonesia
Location
Kota bandung,
Jawa barat
INDONESIA
APTIKOM Journal on Computer Science and Information Technologies (CSIT)
Published by Asosiasi Perguruan Tinggi Informatika dan Ilmu Komputer
ISSN : 25282417     EISSN : 25282425     DOI : 10.34306
Core Subject : Science, Education, Engineering,
Computer Science & IT Education Electrical & Electronics Engineering Energy Materials Science & Nanotechnology
APTIKOM Journal on Computer Science and Information Technologies is a peer-reviewed international journal that publish original research article, review papers, short communications that will have an immediate impact on the ongoing research in all areas of Computer Science, Informatics, Electronics Engineering, Communication Network and Information Technologies. The journal is published four-monthly (March, July and November) by the Indonesian Association of Higher Education Institutions in Computer Science and Information Technology (APTIKOM).
Arjuna Subject : Ilmu Komputer (semua kategori) - Ilmu Komputer (Lain-Lain)
Articles 6 Documents
 1 
Search results for , issue "Vol 2 No 1 (2017): APTIKOM Journal on Computer Science and Information Technologies (CSIT)" : 6 Documents clear
AN IMPROVED APPROXIMATION ALGORITHM FOR CO-LOCATION MINING IN UNCERTAIN DATA SETS USING PROBABILISTIC APPROACH Sheshikala, M.; Rao, D. Rajeswara; Kadampur, Md. Ali
APTIKOM Journal on Computer Science and Information Technologies Vol 2 No 1 (2017): APTIKOM Journal on Computer Science and Information Technologies (CSIT)
Publisher : APTIKOM Publisher

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

complete data. Many of the real world data is Uncertain, for example, Demographic data, Sensor networksdata, GIS data etc.,. Handling such data is a challenge for knowledge discovery particularly in colocation mining.One straightforward method is to find the Probabilistic Prevalent colocations (PPCs). This method tries to find allcolocations that are to be generated from a random world. For this we first apply an approximation error to find allthe PPCs which reduce the computations. Next find all the possible worlds and split them into two different worldsand compute the prevalence probability. These worlds are used to compare with a minimum probability threshold todecide whether it is Probabilistic Prevalent colocation (PPCs) or not. The experimental results on the selected dataset show the significant improvement in computational time in comparison to some of the existing methods used incolocation mining.
DETECTION OF CRIMES USING UNSUPERVISED LEARNING TECHNIQUES Babu, R. Buli; Snehal, G.; Kiran, Aditya Satya
APTIKOM Journal on Computer Science and Information Technologies Vol 2 No 1 (2017): APTIKOM Journal on Computer Science and Information Technologies (CSIT)
Publisher : APTIKOM Publisher

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Data mining can be used to detect model crime problems. This paper is about the importance of datamining about its techniques and how we can easily solve the crime. Crime data will be stored in criminal?s database.To analyze the data easily we have data mining technique that is clustering. Clustering is a method to group identicalcharacteristics in which the similarity is maximized or minimized. In clustering techniques also we have different typeof algorithm, but in this paper we are using the k-means algorithm and expectation-maximization algorithm. We areusing these techniques because these two techniques come under the partition algorithm. Partition algorithm is oneof the best methods to solve crimes and to find the similar data and group it. K-means algorithm is used to partitionthe grouped object based on their means. Expectation-maximization algorithm is the extension of k-means algorithmhere we partition the data based on their parameters.
A SECURITY APPROACH FOR SMART GRID ON REVIEW Suman, Santosh Kumar; Aqib, Mohd.; Singh, Sumit Kumar
APTIKOM Journal on Computer Science and Information Technologies Vol 2 No 1 (2017): APTIKOM Journal on Computer Science and Information Technologies (CSIT)
Publisher : APTIKOM Publisher

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Aim of this paper the infrastructure for the traditional grid & smart grid. Together depend uponmanagement and control system but the main modification is in the security system because it activities the benefits ofthe cyber world for realizing its objectives, it also faces security attacks. Therefore security of the smart grid becomesforemost concern. Even the best smart grid infrastructure along with best management and control mechanisms willprove to be ineffective if security of the smart grid is not taken care of. In this discusses about the importance ofprotection in smart grid. It presents a review of progress made by researchers and governments and the technologiesused in the area. It identifies the security issues involved with the current infrastructure. It points out about the areasin security where the research is still needed and discusses some observations regarding improvement of security insmart grid.
SPEECH SCRAMBLING BASED ON CHAOTIC MAPPING AND RANDOM PERMUTATION FOR MODERN MOBILE COMMUNICATION SYSTEMS G, Dhanya; Jayakumari, J
APTIKOM Journal on Computer Science and Information Technologies Vol 2 No 1 (2017): APTIKOM Journal on Computer Science and Information Technologies (CSIT)
Publisher : APTIKOM Publisher

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

The expanding significance of securing data over the network has promoted growth of strong encryptionalgorithms. To enhance the information protection in network communications, this paper presents a Randompermutation, chaotic mapping and pseudo random binary scrambling. It involves transforming the intelligible speechsignal into an unintelligible form to protect it from interrupters. In this report, suggest a simple and secure procedureto secure the speech signal. The speech scrambling process makes use of two Permutations. In the first step, Randompermutation algorithm is used to swap the rows of the original speech followed by swapping of rows using chaoticBernoulli mapping. This produces an intermediary scrambled speech. In the second measure, pseudo random binarygenerator is used to make the final scrambled signal. Various analysis tests are then executed to determine thequality of the encrypted image. The test results determine the efficiency of the proposed speech scrambling process.
DECISION SUPPORT SYSTEM BASED ON BENEFIT COST RATIO METHOD FOR PROJECT TENDER Rukmana, Siti Hardiyanti; Muslim, Much Aziz
APTIKOM Journal on Computer Science and Information Technologies Vol 2 No 1 (2017): APTIKOM Journal on Computer Science and Information Technologies (CSIT)
Publisher : APTIKOM Publisher

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

The procurement process became one of the important aspects for PT. PLN (Persero) to operate thecompany. One way to meet these needs is through the project tender. The tender process aims to get high-gradematerials with the lowest prices that meet the criteria of efficiency PT. PLN (Persero). In order to simplify thebidding process required a decision support system. The method used in this system is Benefit Cost Ratio (BCR).Input in this application are the documents and the tender offer price from bidders with complete tender documentsthat have been validated by prospective bidders and then selected by the tender committee to make an assessment andvalidation winner. The output of this process is the winner of the tender project based on calculations Benefit CostRatio (BCR). Therefore, the method Benefit Cost Ratio (BCR) can be used as a decision support system to determinethe winner of the project tender.
QUALITY OF SERVICE BASED MULTICASTING ROUTING PROTOCOLS FOR MANETS: A SURVEY Sahu, Prabhat Kumar; Pattanayak, Binod Kumar
APTIKOM Journal on Computer Science and Information Technologies Vol 2 No 1 (2017): APTIKOM Journal on Computer Science and Information Technologies (CSIT)
Publisher : APTIKOM Publisher

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

The modern electronic age consists of many new approaches for the communication among the humancivilizations and the AD HOC network is one of the successful self-configuring and infrastructure-lesscommunicating approach. Mobile ad hoc networks (MANETs) comprised of mobile nodes organize themselves insuch a manner that the can move freely inside the network and frequently change their position. Open architectureand dynamic nature of the network enhance its use in multimedia applications that needs graphics, audio, data,image, video and animation. Now a day?s the increasing use of multimedia and Internet technology needs quality ofservice (QoS) in MANETs in order to provide better service for the companies. This type of applications lendsthemselves well to multicast operations. As multicasting supports group oriented computing it can improve the QoSof the wireless medium by means of sending multiple copies of packets by exploring the internet broadcast propertiesof wireless transmission. Hence QoS multicasting plays a great role in MANETs for multimedia applications.However it is very difficult and challenging task to provide QoS multicasting. With unique features and by means ofdifferent recovery mechanisms, many researchers have been proposed various QoS based multicasting routingprotocols for MANETs. In order to assist QoS multicasting routing protocols design for MANETs, we characterizethe taxonomy of the multicast routing protocols and design features in this paper.

Page 1 of 1 | Total Record : 6

 1 

Filter by Year

2017 2017


Reset
Filter By Issues
All Issue Vol 5 No 2 July (2020): APTIKOM Journal on Computer Science and Information Technologies (CSIT) Vol 5 No 1 March (2020): APTIKOM Journal on Computer Science and Information Technologies (CSIT) Vol 4 No 3 (2019): APTIKOM Journal on Computer Science and Information Technologies (CSIT) Vol 4 No 2 (2019): APTIKOM Journal on Computer Science and Information Technologies (CSIT) Vol 4 No 1 (2019): APTIKOM Journal on Computer Science and Information Technologies (CSIT) Vol 3 No 3 (2018): APTIKOM Journal on Computer Science and Information Technologies (CSIT) Vol 3 No 2 (2018): APTIKOM Journal on Computer Science and Information Technologies (CSIT) Vol 3 No 1 (2018): APTIKOM Journal on Computer Science and Information Technologies (CSIT) Vol 2 No 3 (2017): APTIKOM Journal on Computer Science and Information Technologies (CSIT) Vol 2 No 2 (2017): APTIKOM Journal on Computer Science and Information Technologies (CSIT) Vol 2 No 1 (2017): APTIKOM Journal on Computer Science and Information Technologies (CSIT) Vol 1 No 3 (2016): APTIKOM Journal on Computer Science and Information Technologies (CSIT) Vol 1 No 2 (2016): APTIKOM Journal on Computer Science and Information Technologies (CSIT) Vol 1 No 1 (2016): APTIKOM Journal on Computer Science and Information Technologies (CSIT) More Issue