OPAC - Pencarian Artikel Jurnal & Majalah Library USD
Menampilkan semua artikel (Halaman 132 dari 34169, Total: 341690 data)
Desain dan Implementasi e-EduKids Berbasis Multimedia bagi Anak TK
klik untuk membaca file PDF
| Pengarang | : | Hartanti, Dwi,Suyoto,RJB. Wahju Agung W |
| Nama Majalah/Jurnal | : | Jurnal Teknologi Industri |
| Volume / Edisi | : | 7 (No. 4) |
| Halaman | : | 223-230 |
| Abstrak | : | In this paper, a simple, easy to use and free of an education system at playgroup for Indonesian people known as an e-EduKids is introduced. This system use Multimedia technology, this technology can be accessed through the Internet. Multimedia is about integration of video, photographic image, computer graphics and animation with sound, text, data and programs. The system supported by Macromedia Flash, PHP (Hypertext Preprocessor) and MySQL as the database. This system can show the basic knowledge to children at playgroup, about animal, fruit, number, color, activity, vocabulary English and test of the knowledge. To edit, add and delete user, system completed with menu admin. Before using the system, user and admin must input login name and password first. |
REPELITA IV: EKONOMI POLITIK TARGET PERTUMBUHAN LIMA PERSEN
| Pengarang | : | - |
| Nama Majalah/Jurnal | : | Analisa |
| Volume / Edisi | : | XIII-3, MARET (No. 3) |
| Halaman | : | 168-181 |
| Abstrak | : | - |
PEREKONOMIAN INDONESIA DALAM PELITA IV
| Pengarang | : | Pande Radja Silalahi |
| Nama Majalah/Jurnal | : | Analisa |
| Volume / Edisi | : | XIII-3, MARET (No. 3) |
| Halaman | : | 154-167 |
| Abstrak | : | - |
Decremental Single-Source Shortest Paths on Undirected Graphs in Near-Linear Total Update Time
| Pengarang | : | Monika Henzinger, Sebastian Krinninger, Danupon Nanongkai |
| Nama Majalah/Jurnal | : | Journal of the ACM |
| Volume / Edisi | : | 65 (No. 6) |
| Halaman | : | 1-40 |
| Abstrak | : | n the decremental single-source shortest paths (SSSP) problem, we want to maintain the distances between a given source node s and every other node in an n-node m-edge graph G undergoing edge deletions. While its static counterpart can be solved in near-linear time, this decremental problem is much more challenging even in the undirected unweighted case. In this case, the classic O(mn) total update time of Even and Shiloach [16] has been the fastest known algorithm for three decades. At the cost of a (1+?)-approximation factor, the running time was recently improved to n2+o(1) by Bernstein and Roditty [9]. In this article, we bring the running time down to near-linear: We give a (1+?)-approximation algorithm with m1+o(1) expected total update time, thus obtaining near-linear time. Moreover, we obtain m1+o(1) log W time for the weighted case, where the edge weights are integers from 1 to W. The only prior work on weighted graphs in o(mn) time is the mn0.9 + o(1)-time algorithm by Henzinger et al. [18, 19], which works for directed graphs with quasi-polynomial edge weights. The expected running time bound of our algorithm holds against an oblivious adversary. In contrast to the previous results, which rely on maintaining a sparse emulator, our algorithm relies on maintaining a so-called sparse (h, ?)-hop set introduced by Cohen [12] in the PRAM literature. An (h, ?)-hop set of a graph G=(V, E) is a set F of weighted edges such that the distance between any pair of nodes in G can be (1+?)-approximated by their h-hop distance (given by a path containing at most h edges) on G′=(V, E ∪ F). Our algorithm can maintain an (no(1), ?)-hop set of near-linear size in near-linear time under edge deletions. It is the first of its kind to the best of our knowledge. To maintain approximate distances using this hop set, we extend the monotone Even-Shiloach tree of Henzinger et al. [20] and combine it with the bounded-hop SSSP technique of Bernstein [4, 5] and M?dry [27]. These two new tools might be of independent interest. |
Analisis Pengaruh Pemberian Toleransi Geometri Terhadap Waktu Pengerjaan Produk Menggunakan Desain Eksperimen Faktorial 4 X 2 X 2 X 2
| Pengarang | : | Wisnu Anggoro, Paulus,Ratnasari, Lucia |
| Nama Majalah/Jurnal | : | Jurnal Teknologi Industri |
| Volume / Edisi | : | 7 (No. 3) |
| Halaman | : | 211-222 |
| Abstrak | : | It is impossible for an operator in practice to make components in ideal geometrical quality. Some deviations indeed can not be avoided during the process of components making. Hence, it is important for operator to use tolerance. However, in practice, Cost-International Tolerance (IT) Curve method does not always be used to determine the optimal geometrical tolerance, because of some limitations of the processing itself. Four important factors considered in the analysis of determining the length of components processing are the geometrical tolerance quality (IT), motor speed (n-rpm), feeding rate (s), and the operator. All factors are considered as an important variable in determining the quality of the components, which processed by conventional machine. In this research, some effects of giving geometrical tolerance as a function of processing time are studied by using Factorial Experiment Design. The results are summarized as follows: The four factors give a significant effect to the processing time |
The MRTD Method Based on Haar Wavelet for Numerical Solution of Maxwells Equations
| Pengarang | : | - |
| Nama Majalah/Jurnal | : | Jurnal Teknologi Industri |
| Volume / Edisi | : | 7 (No. 3) |
| Halaman | : | 201-210 |
| Abstrak | : | The recently developed multi resolution time-domain (MRTD) based on Haar wavelets is applied to the modeling of electromagnetic wave pulsation. The multi resolution nature of the wavelets was used in the formulation and a time stepping algorithm that is similar to the conventional finite difference time-domain (FDTD) method is discussed. Perfect electric conductor condition has been formulated and implemented. Computed electromagnetic fields are compared to the exact solution, the comparison shows a good agreement. |
Matroid Secretary Problems
| Pengarang | : | Moshe Babaioff, Nicole Immorlica, David Kempe, Robert Kleinberg |
| Nama Majalah/Jurnal | : | Journal of the ACM |
| Volume / Edisi | : | 65 (No. 6) |
| Halaman | : | 1-26 |
| Abstrak | : | We define a generalization of the classical secretary problem called the matroid secretary problem. In this problem, the elements of a matroid are presented to an online algorithm in uniformly random order. When an element arrives, the algorithm observes its value and must make an irrevocable decision whether or not to accept it. The accepted elements must form an independent set, and the objective is to maximize the combined value of these elements. We present an O(log k)-competitive algorithm for general matroids (where k is the rank of the matroid), and constant-competitive algorithms for several special cases including graphic matroids, truncated partition matroids, and bounded degree transversal matroids. We leave as an open question the existence of constant-competitive algorithms for general matroids. Our results have applications in welfare-maximizing online mechanism design for domains in which the sets of simultaneously satisfiable agents form a matroid. |
Perbandingan Metode-metode Analsiis Keandalan Manusia
| Pengarang | : | Dewi, Luciana Triana |
| Nama Majalah/Jurnal | : | Jurnal Teknologi Industri |
| Volume / Edisi | : | 7 (No. 3) |
| Halaman | : | 191-200 |
| Abstrak | : | It is important to measure human's potential error in work system since human are essential in such system. Some human-performance reliability analysis methods had been developed. This paper explains four methods in human reliability analysis which are: Technique for Human Error rate Prediction (THERP), Human Error Assessment and Reduction Technique (HEART), Justification of Human Error Data Information (JHEDI), and Human Error and Criticality Analysis (HECA). The four methods are then compared to each other, and their use, strengths and weaknesses are identified. The result is useful in choosing the proper method for human reliability analysis of a system. |
Byte-Oriented Canonical Huffman Coding
| Pengarang | : | Kusnadi |
| Nama Majalah/Jurnal | : | Jurnal Teknologi Industri |
| Volume / Edisi | : | 7 (No. 3) |
| Halaman | : | 179-190 |
| Abstrak | : | Canonical Huffman coding is considered quite optimal for lossless compression; in the case that encoder can operate off-line. However, because generally canonical Huffman coding is bit-oriented, it is considered rather slow in term of decoding time. In this paper, byte-oriented scheme is employed to gain faster decoding with loss of some compression. Other fast non-entropy coders are also discussed for comparisons. |
Perencanaan Dimensi Pola Cetakan Pasir untuk Minimasi Cacat Coran pada Pengecoran Pully Alumunim Diameter 3 Inci
| Pengarang | : | B. Hanandoko, Theodorus,Rosmawati, Triana |
| Nama Majalah/Jurnal | : | Jurnal Teknologi Industri |
| Volume / Edisi | : | 7 (No. 3) |
| Halaman | : | 165-178 |
| Abstrak | : | Sand casting technology has been known as metal processing without scraps. Practically, it is not easy to make cast products without defects. One of many factors considered in sand casting process is a shrinkage phenomenon. To provide better cast product, this phenomenon should be anticipated by good design in the shape and dimensions of pattern, sprue, and riser. This paper represents how to minimize defects in casting process by designing the pattern, sprue and riser for an Aluminum pulley with 3-inch diameter, which is usually used to transmit power by combining with the V-belt. |