Pencarian Artikel Jurnal & Majalah

Menampilkan keseluruhan arsip dokumen (Halaman 165 dari 34194, Total: 341939 data)

IP Traceback Menggunakan Packet Marking Algorithm

Nama Pengarang : -
Nama Majalah/Jurnal : Jurnal Teknologi Industri
Volume / Nomor Edisi : 7 (No. 2)
Nomor Halaman : 115-132
Abstraksi Narasi : This paper told a technical brief for to trace flooding packet attack what has anonymous characteristic on Internet, from attack victims until to attack sources. Increase of frequency and advance of denial-of-service attacks, and so difficult to trace packets with fault sources (spoofing) was the main of motivation this papers. In this papers explained a traceback mechanism with packet marking-based on the network. In this brief, victims could be identified traffic path attack on the network without needed interactive support from Internet Service Provider (ISP). For progress, technical of traceback can do with post mortem after attack happen To describe implementation of this brief, what is backward compatible commonly, and can be do it with conventional technology.

Industri Manufaktur Berbasis Agen

Nama Pengarang : Santoso, Albertus Joko
Nama Majalah/Jurnal : Jurnal Teknologi Industri
Volume / Nomor Edisi : 7 (No. 2)
Nomor Halaman : 107-114
Abstraksi Narasi : The agent-based intelligent manufacturing systems is a solution to problems of the 21" century's manufacturing industry. In this paper, we describe about agent definition, agent-based manufacturing, learning in agent-based manufacturing, intelligent manufacturing agent, and agent-based intelligent manufacturing architecture.

Enkripsi Data pada Steganografi dengan Algoritma MD5

Nama Pengarang : Hidayat, Danny,RJB. Wahju Agung W,Suharini, Yustina Sri
Nama Majalah/Jurnal : Jurnal Teknologi Industri
Volume / Nomor Edisi : 7 (No. 2)
Nomor Halaman : 99-106
Abstraksi Narasi : Data security is an important need for personal users and sharing systems. Steganography is a set of information hiding techniques. One of them is MD5. This paper is focused in implementing MDS to hide some data in image pixels.

Aplikasi Algoritma Clustering untuk Klasifikasi Lulusan

Nama Pengarang : Ernawati
Nama Majalah/Jurnal : Jurnal Teknologi Industri
Volume / Nomor Edisi : 7 (No. 2)
Nomor Halaman : 89-98
Abstraksi Narasi : Graduates as the output of a university usually be classified by Graduate Point Average (GPA). This paper tries to classify graduates based on GPA and length of study using clustering algorithm. Clustering Algorithm which used is Average Link Clustering. As a sample, GPA and length of study from 40 graduates was chosen. The result is, the graduates can classify into 3 clusters. The first cluster is graduates that have high GPA and short length of study, the second is graduates that have low GPA and long time for length of study and the third cluster is graduates that have average GPA and length of study. The biggest proportion is in the third cluster.

Teori Homotopy dalam Algoritma Iterasi Path Following untuk Penyelesaian Sistem Persamaan Linear

Nama Pengarang : Ardanari, Patricia
Nama Majalah/Jurnal : Jurnal Teknologi Industri
Volume / Nomor Edisi : 7 (No. 2)
Nomor Halaman : 79-88
Abstraksi Narasi : This paper explained a new algorithm to solve the simple linear equation system by using homotopy theory. The algorithm uses a path following method. The method will stop the iterations when t reaches 1-1, which closes to the true solution (convergent). This parameter allows the solution of linear equation system with scale of n 20 be formed and be compared using the other existing algorithms.

Modifikasi Shifting Bottleneck Procedure dalam Masalah Penjadualan Job Shop

Nama Pengarang : Panggabean, Henry Pantas
Nama Majalah/Jurnal : Jurnal Teknologi Industri
Volume / Nomor Edisi : 7 (No. 2)
Nomor Halaman : 67-78
Abstraksi Narasi : Job-shop scheduling problem is one of the hardest np-complete combinatorial optimization problems. Shifting Bottleneck Problem (SBP) had been proved qualified in solving this problem with good solution and small computation time. SBP decomposes job-shop scheduling problem into m one-machine scheduling problems. solves each with Carlier algorithm, and then combines one-machine schedules with some technique to form a job-shop schedule. The drawback of this method laid on its assumption that all jobs to be scheduled in one-machine is independent. In the contrary, some jobs in one machine problems can be dependent during the scheduling process, so that it is impossible to find optimal solution in that case, which in turn cause SBP to select an incorrect machine to schedule. This paper presents a modification to improve this drawback by utilizing a directed graph representation model and critical path method properly to hinder any cycle in job-shop schedule formation.

Manajemen Situs Web dengan Sistem Autoupdating

Nama Pengarang : -
Nama Majalah/Jurnal : Jurnal Teknologi Industri
Volume / Nomor Edisi : 7 (No. 1)
Nomor Halaman : 59-66
Abstraksi Narasi : This paper will discuss automatic updating web page system. The comem on a web page will change automatically when user upload a new information. This system helps user to search new information on a web page, because old information will not appears automatically. The system offers a lot of functions such as it enable to edit. add anda delete any information with an admin menu. The system is implemented by PIIP on the chent side and MySQL for the database

Perancangan Sistem Pendukung Diagnosa Berbasis Komputer untuk Penyakit Anak-anak

Nama Pengarang : -
Nama Majalah/Jurnal : Jurnal Teknologi Industri
Volume / Nomor Edisi : 7 (No. 1)
Nomor Halaman : 51-58
Abstraksi Narasi : Concerning some restrictions in public medical services, some simple alternatives could be offered in medical support empowerment to increase doctor service level efficiency or public empowerment in medical activities generally Suppose we discover in detail about Indonesian citizenship structure (similar with other developing countries), we will find that the biggest proportion is citizen aged in child aged (from 0 to 12 years). Base on this, design and construction of a Decision Support System (DSS) for Pediatric is proper to be done. This DSS is proposed to be a supporting peripheral for doctors, medical representatives, medical students or parents with some considerations This Pediatrics Decision Support Systems is composed with consideration on ROMC (Representation. Operation, Memory Aids and Control Mechanism) and Herative approaches This research use mediu al diagnosis model on pediatric diseases classification based on type and its symptoms First input for this DSS is actual symptoms which are suffered by the children From this input, we might get the list of alternatives diseases which is suspected Second output must be given by user av a confidence level which illustrate how big user confidence about conformity of actual symptoms with clinical or laboratory symptoms which should be occur Result of this phase is rank of diseases diagnosed. Output of this wastem is a suspected disease including its recovery and health treatment procedures for children This procedure covers pharmaceutical detail diet recommendation and therapy needed

Object Recognition Using S-Ray Method

Nama Pengarang : -
Nama Majalah/Jurnal : Jurnal Teknologi Industri
Volume / Nomor Edisi : 7 (No. 1)
Nomor Halaman : 41-50
Abstraksi Narasi : In this paper we describe a new recognition method called S-Ray Method. The method recognizes 3D-object by identify ASCII file. The S Ray Method is implemented using 3D S-CAD objects. S CAD is Computer Aided Design software used by Secondary Schools throughout Malaysia, to study design concepts and techniques.

Inplementasi Penjadwalan Flow Shop dengan Algoritma Genetik

Nama Pengarang : -
Nama Majalah/Jurnal : Jurnal Teknologi Industri
Volume / Nomor Edisi : 7 (No. 1)
Nomor Halaman : 31-40
Abstraksi Narasi : This paper describes flow shop scheduling implementation with Genetic algorithm method. Scheduling process with Genetic Algorithm cover how to construct jobs becomes chromosomes (jobs order). Chromosomes are constructed from genes (jobs list). Then these genes will to go through crossover process to exchange genes from one chromosome to others, selection process and mutation process which bring two jobs to one job list. With Genetic Algorithm, we will take more efficient total process time (makespan)
← Kembali ke Halaman Utama