D. Darso, Imam Much Ibnu Subroto, Prasetyowati Sri Arttini Dwi
{"title":"Cosine Similarity Measurement for Indonesian Publication Recommender System","authors":"D. Darso, Imam Much Ibnu Subroto, Prasetyowati Sri Arttini Dwi","doi":"10.12928/JTI.V5I2","DOIUrl":"https://doi.org/10.12928/JTI.V5I2","url":null,"abstract":"So many publications are increasing every year and it causes an overflow of data and it makes the information function on the site cannot be delivered entirely to the visitors. As a scientific publication site, the IPI garuda portal (Index of Indonesian publications) has more than 4000 Indonesian journals in the database. Therefore it will be designed a system that can provide information and knowledge for the user. The system can also provide recommendations related articles and relevant for users. Recommendations are made by calculating similarities between related documents. The similarity calculation method used in this research was cosine similarity. The steps taken were pre-processed, weight calculation, vector length and then they were calculated using cosine similarity so that the value would be achieved that ranged from 0 to 1. Performance testing of recommendation system used precision and recall. Performance system with average precision value about 0.664 meant that the document had good system accuracy, and then the average recall point with value about 0.962 meant that documents were successfully returned by the system.","PeriodicalId":364935,"journal":{"name":"Journal of Telematics and Informatics","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115478646","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Student Academic Performance Prediction on Problem Based Learning Using Support Vector Machine and K-Nearest Neighbor","authors":"Badieah Assegaf","doi":"10.12928/jti.v5i1.22-28","DOIUrl":"https://doi.org/10.12928/jti.v5i1.22-28","url":null,"abstract":"Academic evaluation is an important process to know how well the learning process was conducted and also one of the decisive factors that can determine the quality of the higher education institution. Though it usually curative, the preventive effort is needed by predicting the performance of the student before the semester begin. This effort aimed to reduce the failure rate of the students in certain subjects and make it easier for the PBL tutor to create appropiate learning strategies before the tutorial class begin. The purpose of this work is to find the best data mining technique to predict student academic performance on PBL system between two data mining classification algorithms. This work applied and compared the performance of the classifier models built from Support Vector Machine (SVM) and K-Nearest Neighbor (KNN). After preprocessed the dataset, the classifier models were developed and validated. The result shows that both algorithms were giving good accuracy by 97% and 95,52% respectively though SVM showing the best performance compared to KNN in F-Measure with 80%. The further deployment is needed to integrate the model with academic information system, so that academic evaluation can be easily done.","PeriodicalId":364935,"journal":{"name":"Journal of Telematics and Informatics","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131279533","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Imam Much Ibnu Subroto, A. Selamat, Badieah Assegaf
{"title":"Synthesis of Unequally Spaced Linear Micro Strip Rectangular Patch Antenna Array Using Improved Local Search Particle Swarm Optimization","authors":"Imam Much Ibnu Subroto, A. Selamat, Badieah Assegaf","doi":"10.12928/JTI.V4I2","DOIUrl":"https://doi.org/10.12928/JTI.V4I2","url":null,"abstract":"Antenna array systems with low side lobe levels are essential for today wireless communication systems. This paper presents the synthesis of unequally spaced linear rectangular micro strip antenna array with minimum side lobe levels using the novel evolutionary algorithm known as improved local search particle swarm optimization (ILSPSO). ILSPSO is a modified version of particle swarm optimization (PSO), in which Gaussian distribution is used to enhance the local search of the PSO. In this paper, ILPSO is applied to optimize the positions of the micro strip antenna elements to suppress the peak side lobe level (PSLL) along with PSO and differential evolution (DE) algorithms. The steps involved in problem formulation along with design examples illustrating the performance of the ILPSO in minimizing the side lobe levels are demonstrated. A 20 and 32 element linear micro strip rectangular patch antenna (MSRPA) element are considered to show the effectiveness of the proposed method. The optimized micro strip antenna array is simulated using high frequency structure simulator (HFSS). The synthesis results demonstrate that the ILSPSO outperforms PSO and DE in terms of producing lower PSLL and convergence rate. The flexibility and ease of implementation of the ILSPSO algorithm is obvious from this paper, showing the algorithms usefulness in other array synthesis problems.","PeriodicalId":364935,"journal":{"name":"Journal of Telematics and Informatics","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122286560","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Mobility Aware Schema To Lower Packet Losses For Reactive Ad Hoc Routing Protocols","authors":"Ilyas Bambrik, Didi Fedoua","doi":"10.12928/jti.v4i1","DOIUrl":"https://doi.org/10.12928/jti.v4i1","url":null,"abstract":"In an increasingly wireless world, Ad hoc networks have progressively been developed to become a suitable replacement or, at least complement to the traditional wireless networks. In contrast to the conventional wireless network, the Ad hoc network does not necessarily need a preset infrastructure to be functional. The network members move freely and arrange themselves to perform the routing operations in a distributed fashion. The kernel technology enabling such flexibility is the routing protocol. Though the absence of the infrastructure lowers the installation, configuration and maintenance cost of the dynamic networks, the mobile nodes must deal with several complex issues. Thus, managing : a) security, b) power consumption and balance, c) Quality of Service, in a distributed manner is very challenging. However, above all else, maintaining a path formed by moving particles is the most problematic task. In this paper we analyse the effect of the nodes mobility on the routing protocol performance. Then, we propose a simple schema to counter this issue.","PeriodicalId":364935,"journal":{"name":"Journal of Telematics and Informatics","volume":"145 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121606140","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Abdelhadi Husein Aburawis, Imam Much Ibnu Subroto, M. Qomaruddin
{"title":"Design of Computer Based Signal Generator","authors":"Abdelhadi Husein Aburawis, Imam Much Ibnu Subroto, M. Qomaruddin","doi":"10.12928/jti.v4i1.","DOIUrl":"https://doi.org/10.12928/jti.v4i1.","url":null,"abstract":"The project includes various types of signals alternative study and representation of a computer in digital format and out through the port as an outlet for the output of digital data to generate signals and electronic control circuit of the printer parallel LPT1 prevailing used to generate signals. The aim of the research is to evaluate the usage of the computer including the advantage of its possibilities, capabilities in multiple signals processing, and control signal generation methods in many ways that are used to generate various signals at frequencies different capacities. The necessary software requires generating different types of signals, frequencies, and capacities. It is as well as the different software required for the purpose of controlling the electronic circuit. It has been relying on a programmatic method depends on the language of Visual Basic. In addition to the study of the physical system requirements, the analysis how to connect them with the computer and version control signals E-circle this study using speed of a transferring time for generator is Tc = 100nsec. The Speed of a computer which is used to treat 1000 MH’, is got on the farthest frequency to get out from the circle is 2500 Hz. It is used to different signals, sine, triangular or square in 30 samples. The sample numbers are tested. The result of this study shows that each of the sample number, input frequency, and sample time influence the results clearly. If the sample numbers increase, the accuracy of the waves increases. If the input frequency increases, the width of the wave losses.","PeriodicalId":364935,"journal":{"name":"Journal of Telematics and Informatics","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114685614","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Automated Erythrocytes Counting in Microscopic Thin Blood Smear Digital Images","authors":"Naveed Abbas, D. Mohamad, Abdual Hanan Abdullah","doi":"10.12928/jti.v3i2.","DOIUrl":"https://doi.org/10.12928/jti.v3i2.","url":null,"abstract":"The Erythrocytes counting is part of the complete blood count test and it is frequently suggested by the Physician to know the number of Erythrocytes in the patient’s body. At present mostly the counting process is performed manually which is laborious, error prone and time consuming. The main purpose of this study is to use the digital image processing techniques to automate the counting process of the Erythrocytes or Red Blood Cells in Microscopic thin Blood smear digital images. The automated diagnosing gain the attention of the researchers from the last two decades because it assist the experts to reduce the burden of errors, labour and time of examination. In this regard, too much research has been performed on the automation of the counting process of the Erythrocytes but still the test demands to be done in a proper, efficient, accurate and realistic way. The proposed method achieved an average True Positive Rate (TPR) of 95%, True Negative Rate (TNR) of 5%, average accuracy of 97% and average error of 3%.","PeriodicalId":364935,"journal":{"name":"Journal of Telematics and Informatics","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124176200","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
M. Venkateswarao, J. Triveni, K. B. Latha, K. N. Deepika, K. R. Pavan
{"title":"Comparison of Pipelined Floating Point Unit with Unpipelined Floating Point Unit","authors":"M. Venkateswarao, J. Triveni, K. B. Latha, K. N. Deepika, K. R. Pavan","doi":"10.12928/JTI.V3I1.7-14","DOIUrl":"https://doi.org/10.12928/JTI.V3I1.7-14","url":null,"abstract":"Floating-point numbers are broadly received in numerous applications due their element representation abilities. Floating-point representation has the capacity hold its determination and exactness contrasted with altered point representations. Any Digital Signal Processing (DSP) calculations utilization floating-point math, which obliges a huge number of figuring’s every second to be performed. For such stringent necessities, outline of quick, exact and effective circuits is the objective of each VLSI creator. This paper displays a correlation of pipelined floating-point snake dissention with IEEE 754 organization with an unpipelined viper additionally protests with IEEE 754 arrangement. It depicts the IEEE floating-point standard 754. A pipelined floating point unit in light of IEEE 754 configuration is produced and the outline is contrasted and that of an unpipelined floating point unit and an investigation is defeated speed, range, and force contemplations. It builds the rate as well as is vitality productive. Every one of these changes is at the expense of slight increment in the chip region. The basic methodology and approach used for VHDL (Very Large Scale Integration Hardware Descriptive Language) implementation of the floating-point unit are also described. Detailed synthesis report operated upon Xilinx ISE 11 software and Modelsim is given.","PeriodicalId":364935,"journal":{"name":"Journal of Telematics and Informatics","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125518879","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
T. Ravi, V.Venkata Sai Aditya, B. Rani, Manjeera Boppana
{"title":"Segmentation of Blood Vessels and Optic disc in Retinal Images","authors":"T. Ravi, V.Venkata Sai Aditya, B. Rani, Manjeera Boppana","doi":"10.12928/jti.v3i1.1-6","DOIUrl":"https://doi.org/10.12928/jti.v3i1.1-6","url":null,"abstract":"Understanding of picture substance is one of the targets in PC vision particularly in picture transforming. In this period it has gotten much familiarity with analysts. In picture elucidation the segment of the picture into article and foundation is a serious step. Division differentiates a picture into its segment locales or articles. Picture division t needs to portion the article from the foundation to peruse the picture legitimately and recognize the substance of the picture painstakingly. In this setting, edge identification is a principal apparatus for picture division. In this paper an endeavor is made to study the execution of most usually utilized edge location strategies for picture division.","PeriodicalId":364935,"journal":{"name":"Journal of Telematics and Informatics","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115848136","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Retail Web System Upgrading with Strategic Customer Using Threshold Policy","authors":"M. Sree, K. Subrahmanyam","doi":"10.12928/jti.v3i1.28-32","DOIUrl":"https://doi.org/10.12928/jti.v3i1.28-32","url":null,"abstract":"This paper mainly deals with the problems that online retailers are facing by some group of strategic customers by upgrading web system and goods pricing. A monopolist price of a product for which stylized dynamic pricing model is considered at the beginning and the price change is done on the product after considering some set of constraints based on the product availability. Due to some network issues sometimes website may get problems at that time there may be a chance of transaction failure for customer during online purchasing. To predict this probability and doing purchasing opinion depending on the belief of Transaction Success Probability (TSP).Considering this there will be a threshold policy for purchasing by customers here it is going to consider it as first one: Customers buy products only if his valuation for products is above threshold (total reduced profit) otherwise they will not take it into consideration. The threshold rises as TSP degrades, or customers turn out to be risk averse. Here we obtain the best cost of each phase and make out the best strategy for online shopping site customizing by threshold and upgrade the system when present TSP is less than threshold. The online trader turns to increase the price if he disregards strategic customer behavior. The value of disregarding strategic customer deeds is significant. The profit loss cost of disregarding strategic customer deeds grows as customer transaction cost rises.","PeriodicalId":364935,"journal":{"name":"Journal of Telematics and Informatics","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128238639","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Encryption Based Access Control Model In Cloud: A Survey","authors":"Rachana Chavda, Dr Rajanikanth Aluvalu","doi":"10.12928/jti.v3i1.15-21","DOIUrl":"https://doi.org/10.12928/jti.v3i1.15-21","url":null,"abstract":"Cloud computing is known as “Utility”. Cloud Computing enabling users to remotely store their data in a server and provide services on-demand. Since this new computing technology requires user to entrust their valuable data to cloud providers, there have been increasing security and privacy concerns on outsourced data. We can increase security on access of the data in the cloud. Morever we can provide encryption on the data so third party can not use the data. In this paper we will be reviewing various encryption based access control model for enhancing cloud security along with their limitations. We will be concluding with a proposed access control model to enhance cloud security.","PeriodicalId":364935,"journal":{"name":"Journal of Telematics and Informatics","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130924463","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}