The IJICS (International Journal of Informatics and Computer Science)
The The IJICS (International Journal of Informatics and Computer Science) covers the whole spectrum of intelligent informatics, which includes, but is not limited to : • Artificial Immune Systems, Ant Colonies, and Swarm Intelligence • Autonomous Agents and Multi-Agent Systems • Bayesian Networks and Probabilistic Reasoning • Biologically Inspired Intelligence • Brain-Computer Interfacing • Business Intelligence • Chaos theory and intelligent control systems • Clustering and Data Analysis • Complex Systems and Applications • Computational Intelligence and Soft Computing • Cognitive systems • Distributed Intelligent Systems • Database Management and Information Retrieval • Evolutionary computation and DNA/cellular/molecular computing • Expert Systems • Fault detection, fault analysis and diagnostics • Fusion of Neural Networks and Fuzzy Systems • Green and Renewable Energy Systems • Human Interface, Human-Computer Interaction, Human Information Processing • Hybrid and Distributed Algorithms • High Performance Computing • Information storage, security, integrity, privacy and trust • Image and Speech Signal Processing • Knowledge Based Systems, Knowledge Networks • Knowledge discovery and ontology engineering • Machine Learning, Reinforcement Learning • Memetic Computing • Multimedia and Applications • Networked Control Systems • Neural Networks and Applications • Natural Language Processing • Optimization and Decision Making • Pattern Classification, Recognition, speech recognition and synthesis • Robotic Intelligence • Rough sets and granular computing • Robustness Analysis • Self-Organizing Systems • Social Intelligence • Soft computing in P2P, Grid, Cloud and Internet Computing Technologies • Stochastic systems • Support Vector Machines • Ubiquitous, grid and high performance computing • Virtual Reality in Engineering Applications • Web and mobile Intelligence, and Big Data
Articles
110 Documents
<![CDATA[The Application of The Nearest Neighbor Algorithm in Detecting Appendicitis Disease ]]>
<![CDATA[Sari Handayani]]>;
<![CDATA[Nelly Astuti Hasibuan]]>;
<![CDATA[Putri Ramadhani]]>
<![CDATA[ The IJICS (International Journal of Informatics and Computer Science) Vol 2, No 1 (2018): March 2018 ]]>
Publisher : <![CDATA[STMIK Budi Darma ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
Full PDF (236.402 KB)
|
DOI: 10.30865/ijics.v2i1.817
<![CDATA[The expert system is a branch of artificial intelligence that facilitates the knowledge of an expert into an application that can be used to help the work of experts. The knowledge base is formed by an inference engine that translates an expert's knowledge. The result or output of the expert system can not guarantee its certainty. Therefore, it takes several methods that can be used to solve it. In this study, expert systems are applied to the medical or medical world. The following are related to the medical appendicitis disease or better known as appendicitis.Method used to improve the accuracy of the decision of the nearest neighbor algorithm. The nearest neighbor algorithm is an approach to finding a case with proximity or similarity between a new case and an old case. The results of this study is an engineering inference expertise with the aim to obtain clinical decisions of appendicitis diseases on the user (user) as medical treatment as early as]]>
<![CDATA[Implementation of Data Mining Using Naïve Bayes Classification Method To Predict Participation of Governor And Vocational Governor Selection In Jemirahan Village, Jabon District ]]>
<![CDATA[Arif Senja Fitrani]]>;
<![CDATA[Fajrillah Fajrillah]]>;
<![CDATA[Wirda Novarika]]>
<![CDATA[ The IJICS (International Journal of Informatics and Computer Science) Vol 3, No 2 (2019): September 2019 ]]>
Publisher : <![CDATA[STMIK Budi Darma ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
Full PDF (447.622 KB)
|
DOI: 10.30865/ijics.v3i2.1391
<![CDATA[General Election (ELECTION) is an important political event to determine a leader in a democratic country. The General Election (ELECTION) in East Java which was held on 27 June 2018 yesterday was the election of the Governor and Deputy Governor for the 2019-2024 period. There are two pairs of candidates for Governor and Deputy Governor. Through the General Election (ELECTION) then all parties can be accommodated what they want and aspire to so that a better life can be realized. The community is the determining component of the success or failure of an Election. Therefore, in this study the researcher wanted to examine how the electoral participation in Jemirahan Village, Jabon District by using the classification method, the Naïve Bayes algorithm. To predict the participation of the General Election (PEMILU) in Jemirahan Village, Jabon District, it can be done using the Naïve Bayes Algorithm with 6 predefined variables. The results of the prediction of election participation from the dataset taken were 300 data divided by 2, as many as 65% of 195 training data and 35% of 105 data testing.]]>
<![CDATA[Implementation of Computer Based Systems as Efficiency of Manager Decisions in Employee Reward ]]>
<![CDATA[Maringan Sianturi]]>
<![CDATA[ The IJICS (International Journal of Informatics and Computer Science) Vol 1, No 2 (2017): September 2017 ]]>
Publisher : <![CDATA[STMIK Budi Darma ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
Full PDF (220.638 KB)
|
DOI: 10.30865/ijics.v1i2.1374
<![CDATA[The purpose of this study is to provide support to management in determining employees who are entitled to employee reward based on competence using a computer-based system. Rewards for employees are aimed at motivating employees. The method used is the Preference Selection Index (PSI), which has the advantage of being able to produce criteria weight values without identifying using the weighting method.]]>
<![CDATA[Russel Approximation Method And Vogel’s Approximation Method In Solving Transport Problem ]]>
<![CDATA[Nelly Astuti Hasibuan]]>
<![CDATA[ The IJICS (International Journal of Informatics and Computer Science) Vol 1, No 1 (2017): March 2017 ]]>
Publisher : <![CDATA[STMIK Budi Darma ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
Full PDF (370.186 KB)
|
DOI: 10.30865/ijics.v1i1.454
<![CDATA[Transportation problems can be regarded as one of the problems that occur routinely in a company in the process of distributing products from several sources to certain places. Transportation issues are included in one of the optimization issues in operations research aimed at minimizing transportation costs. Differences in transportation costs can be due to several factors such as distance gap, type of transport used and other things. The optimization of transportation cost can be done by using Vogel Approximation method and Russel Approximation Method. Method. To see the effectiveness of optimization conducted by the two methods is needed a comparison process.]]>
<![CDATA[Analysis Of Database Record Compression Using The Levenstein Algorithm ]]>
<![CDATA[Rian Syahputra]]>
<![CDATA[ The IJICS (International Journal of Informatics and Computer Science) Vol 3, No 1 (2019): March 2019 ]]>
Publisher : <![CDATA[STMIK Budi Darma ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
Full PDF (204.507 KB)
|
DOI: 10.30865/ijics.v3i1.1347
<![CDATA[Data stored in the database affects how much storage memory is used. The more data stored, the more memory will be used. To reduce memory usage it is necessary to reduce the data to be stored. The technique that can be used is data compression. Levenstein algorithm is a data compression technique that replaces the initial bits of the string, resulting in smaller compression. Levenstein algorithm is suitable for compressing data that has many repetitions.]]>
<![CDATA[Application of Data Mining to Predict Procurement of Office Writing in Al-Ikhwan Middle School using Naïve Bayes Method ]]>
<![CDATA[Aida Sopia]]>;
<![CDATA[Muhammad Syahrizal]]>
<![CDATA[ The IJICS (International Journal of Informatics and Computer Science) Vol 4, No 2 (2020): September 2020 ]]>
Publisher : <![CDATA[STMIK Budi Darma ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
Full PDF (833.302 KB)
|
DOI: 10.30865/ijics.v4i2.2119
<![CDATA[Office stationery (ATK) is now a necessity for almost everyone, especially for corporate instances or educational institutions. The need for office stationery is often an unexpected need to buy, this is what makes some educational institutions overwhelmed in doing their work, when they find out their office stationery is out of stock, so it is not uncommon to make work in company or institutional instances education is not completed on time, one of the ways to be more efficient is by implementing data mining to predict the purchase of office stationery (ATK) at the company or educational institution's intents, especially at the AL IKHWAN Middle School in Tanjung Morawa. The Naive Bayes method is used to analyze data in pattern recognition and predict purchase of office stationery (ATK) at AL IKHWAN Middle School in Tanjung Morawa. The data needed is the data for the purchase of office stationery (ATK) last month as test data, calculated from the date of the first purchase until the expiry date of office stationery (ATK) at AL IKHWAN Middle School in Tanjung Morawa. The results of this study are to be able to predict whether the office stationery (ATK) at AL IKHWAN Middle School in Tanjung Morawa can be bought back, or it can still be used for a long time, and if more than four types of stationery at the AL IKHWAN Middle School in Tanjung Morawa the lack of writing instruments from the two then the purchase of new stationery is feasible to do, from the amount of data occurring out of stationery]]>
<![CDATA[Implementing Forward, Backward Chaining and Certainty Factor in Responsive Web-Based Expert System of Cow Disease ]]>
<![CDATA[Rizki Wahyudi]]>;
<![CDATA[Wisnu Dwi Prasetyo]]>
<![CDATA[ The IJICS (International Journal of Informatics and Computer Science) Vol 2, No 1 (2018): March 2018 ]]>
Publisher : <![CDATA[STMIK Budi Darma ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
Full PDF (393.552 KB)
|
DOI: 10.30865/ijics.v2i1.816
<![CDATA[This research aims to design and build expert systems of cow disease to assist farmers in identifying cattle diseases. A large number of cattle in Banyumas is not matched by the number of veterinarians, the Department of Fisheries and Livestock (DINKANAK). Banyumas records 961 cases of sick cows in 2016. This expert system is expected to assist cattle ranchers to identify cow disease and symptom-based remedies illness-symptoms. By using Inference Forward and Backward chaining which is a search method or tracking technique by using information from breeders, and Certainty Factor is used to accommodate the uncertainty of thinking of a data expert that is Doctor the process of extracting knowledge by interview. In this research system development using ESDLC (Expert System Development Life Cycle) with stages of Planning, Knowledge Acquisition, Implementation, and Evaluation. Testing is done with two approaches are Alpha Testing and Beta Testing. Alpha Testing conducted on the developer side to test the functional system using Black Box Testing method result all functional system can function well. Beta Testing is aimed at user acceptance by a Questionnaire method yields an average score of 76% or usability and the quality of system information is easy to understand.]]>
<![CDATA[Analysis of Even-Rodeh Code For Text Compression ]]>
<![CDATA[Rian Syahputra]]>
<![CDATA[ The IJICS (International Journal of Informatics and Computer Science) Vol 4, No 1 (2020): March 2020 ]]>
Publisher : <![CDATA[STMIK Budi Darma ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
Full PDF (129.023 KB)
|
DOI: 10.30865/ijics.v4i1.1348
<![CDATA[Text compression is used to reduce the repetition of letters so that the storage space used becomes smaller and transmission becomes faster. Techniques in text compression that can be used are using lossless compression. Lossless compression is a type of compression where when the decompression process occurs no data is lost. The Even-Rodeh Code algorithm is a lossless type of compression algorithm that replaces the initial bit code of the data with a code from the Even-Rodeh Code algorithm so that it can produce smaller data sizes]]>
<![CDATA[Image Scrambling Using One Time Pad with Linear Congruent Key Generator ]]>
<![CDATA[Imam Saputra]]>
<![CDATA[ The IJICS (International Journal of Informatics and Computer Science) Vol 1, No 1 (2017): March 2017 ]]>
Publisher : <![CDATA[STMIK Budi Darma ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
Full PDF (445.148 KB)
|
DOI: 10.30865/ijics.v1i1.525
<![CDATA[With the changing of the times, more and more moments can be photographed. Digital imagery stores a lot of information through visual display. Many people perpetuate the things that are personal in the form of digital imagery, with so many files in the form of digital imagery that is private and not for publication. With the development of cloud computing systems, every image recorded through the smartphone will be synchronized with the online storage service provider. This has many advantages, such as users do not have to worry about the damage to storage devices that exist in their gadgets. But the disadvantage of this system is that if an account falls into the hands of an unauthorized person then photographs containing this personal information may be published by an unauthorized person, of course this will be very detrimental. One solution that can be used is to randomize the original image so that its visual appearance will not be like the actual visual display. One way that can be used for image randomization is by cryptographic techniques. The one time pad algorithm is a very powerful classical cryptographic algorithm and can not be solved by cryptanalis until now. One disadvantage of a one time pad algorithm is the key length must be the same as the length of the plaintext. This makes the algorithm unused because it is less practical in its key usage. To overcome this required a key generator that could generate randomly generated locks ie a linear congruent generator, thus the key length must be equal to the length of the plaintext can be generated only with a few variables. In this way, image randomization can be done with a strong and practical cryptographic algorithm.]]>
<![CDATA[Web-Based College Student Assignment File Collection Application Using Google Drive API ]]>
<![CDATA[Khairi Ibnutama]]>;
<![CDATA[Hendryan Winata]]>;
<![CDATA[Masyuni Hutasuhut]]>
<![CDATA[ The IJICS (International Journal of Informatics and Computer Science) Vol 3, No 2 (2019): September 2019 ]]>
Publisher : <![CDATA[STMIK Budi Darma ]]>
Show Abstract
|
Download Original
|
Original Source
|
Check in Google Scholar
|
Full PDF (326.403 KB)
|
DOI: 10.30865/ijics.v3i2.1371
<![CDATA[The use of internet media, especially cloud storage as a practical solution in information and communication should be able to be applied in academics, especially in the scope of teaching and learning. By using cloud storage as a communication medium, especially in sending data in the form of assignments files can facilitate lecturers and students in carrying out one of the mandatory activities in lectures, namely the collection of assignments. The main problem that often occurs is the storage capacity provided by hosting services is very limited, so storing large amounts of files will require large costs as well. Google Drive provides an API driven file storage service that makes it easy for users to create applications that can communicate and interact with 15 GB free storage services. The free service is expected to facilitate teaching and learning activities in lectures, especially in the collection of student assignments]]>
