Hasil Pencarian  ::  Simpan CSV :: Kembali

Hasil Pencarian

Ditemukan 184 dokumen yang sesuai dengan query
cover
"This book provides a platform for exploring nature-inspired optimization techniques in the context of imaging applications. Optimization has become part and parcel of all computational vision applications, and since the amount of data used in these applications is vast, the need for optimization techniques has increased exponentially. These accuracy and complexity are a major area of concern when it comes to practical applications. However, these optimization techniques have not yet been fully explored in the context of imaging applications. By presenting interdisciplinary concepts, ranging from optimization to image processing, the book appeals to a broad readership, while also encouraging budding engineers to pursue and employ innovative nature-inspired techniques for image processing applications."
Switzerland: Springer Cham, 2019
e20502684
eBooks  Universitas Indonesia Library
cover
Wright, Stephen J., 1960-
"In the past decade, primal-dual algorithms have emerged as the most important and useful algorithms from the interior-point class. This book presents the major primal-dual algorithms for linear programming in straightforward terms. A thorough description of the theoretical properties of these methods is given, as are a discussion of practical and computational aspects and a summary of current software. This is an excellent, timely, and well-written work.
The major primal-dual algorithms covered in this book are path-following algorithms (short- and long-step, predictor-corrector), potential-reduction algorithms, and infeasible-interior-point algorithms. A unified treatment of superlinear convergence, finite termination, and detection of infeasible problems is presented. Issues relevant to practical implementation are also discussed, including sparse linear algebra and a complete specification of Mehrotra's predictor-corrector algorithm. Also treated are extensions of primal-dual algorithms to more general problems such as monotone complementarity, semidefinite programming, and general convex programming problems."
Philadelphia: Society for Industrial and Applied Mathematics, 1997
e20451208
eBooks  Universitas Indonesia Library
cover
T. Faisal
"Beginning with the Airline Deregulation Act of 1978 in US, followed by the European Union in 1997, airlines have been constructing route networks of their own choosing rather than operating ones implicitly chosen for them by civil aviation authority. These changes have had profound effects on many aspects of airline operation, particularly fares, service, quality, and safety. But, most importantly, airlines have altered their route structures by developing hub-and-spoke networks, and this has affected all of these aspects. This structure is likely to flourish around the world as a consequence of airline liberalization and the growing trend toward privatization of this industry.
In a hub-and-spoke network, centrally located service facilities serve as the hubs. Flows from a set of outlying nonhub nodes arrive at hubs and, after regrouping, all leave the hub facilities bound either to other hubs or to their ultimate destinations. Thus, the flows from the same origin with different destinations are consolidated on the route to a hub facility and the flows with different origins but the same destination on the route out of a hub facility. The centralization and broader scope of operations let the system take advantage of economies of scale.
This paper proposes a framework to optimize the flight network using hub-and-spoke system. This problem consists of the determination of hub number, hub location and route assignment in order to minimize the overall transportation cost. The model is solved using genetic algorithm approach. Two networking strategies are considered:
1. Strict hubbing, in which a spoke is assigned to exactly one hub and all flows to/from spoke are channeled trough the same hub and
2. Nonstrict hubbing, in which a spoke can be assigned to more than one hub under certain condition. Different values of airport fixed costs are also implemented. Variations of these strategies are evaluated along with various parameters of air transport production using data on air passenger flows between top 30 Indonesian airports in 2000.
The result shows that the adoption of hub-and-spoke network increase the overall system performance with increasing load factor, frequency, coverage area, revenue passenger kilometer, available seat kilometer and more efficient utilization of aircraft. Moreover, Nonstrict hubbing strategy offers smaller total system cost, more routes and more nonstop flights."
Depok: Fakultas Teknik Universitas Indonesia, 2003
T10674
UI - Tesis Membership  Universitas Indonesia Library
cover
Muhammad Sujatmiko
"ABSTRAK
Tesis ini membahas disain, implementasi dan analisa kinerja algoritma paralel integrasi numerik adaptif yang mempunyai paradigma tree computation. Implementasi algoritma paralel ini dilakukan pada jaringan komputer PC dengan bahasa pemrograman C yang berbasis PVM (parallel virtual machine). Ujicoba pengukuran dan analisa kinerja dari algoritma tersebut dilakukan pada jumlah slave yang bervariasi dari mesin-mesin komputer yang heterogen. Parameter-parameter yang diukur adalah nilai speedup, efisiensi penggunaan prosesor, computation to communication ratio, job allocation untuk mendapatkan load balancing yang merata, dan distribusi waktu eksekusi.
Ada tiga model algoritma paralel yang ditawarkan dalam integrasi numerik adaptif ini. Model pertama menawarkan suatu cara dimana setiap node yang terbentuk pada tree computation akan dikerjakan oleh prosesor yang berbeda. Master akan mengirimkan node-node sebagai sub-sub problem. ke slave-slave secara ternus menerus sehingga semua slave tidak ada yang idle. Hasil yang diterima master belum tentu hasil akhir, sehingga mungkin sekali sub problem tersebut akan dipecah menjadi sub-sub problem bare yang akan dikirim kembali ke slave-slave.
Pada solusi model kedua, master mengirim node-node sebagai sub-sub problem ke semua slave. Slave akan melakukan komputasi secara rekursif sampai diperoleh hasil akhir, sehingga terbentuk suatu sub tree computation pada setiap slave. Hasil akhir yang diterima master akan dikumpulkan untuk mendapatkan total hasil akhir. Slave yang telah selesai akan diberi sub problem berikutnya.
Sedang pada model ketiga, master membagi problem secara liner sesuai dengan jumlah mesin yang terlibat, tanpa memperhatikan volume beban komputasi dari setiap sub problem. Selanjutnya master dan slave-slave akan melakukan komputasi secara rekursif sampai diperoleh hasil akhir. Jadi baik pada master maupun slave akan terbentuk sub-sub tree computation. Master akan menerima hasil dari setiap slave untuk dikumpulkan menjadi total hasil akhir. "
1998
T-Pdf
UI - Tesis Membership  Universitas Indonesia Library
cover
Judhi Santoso
"Dengan suatu program dapat ditunjukkan bahwa kompleksitas waktu simulasi MT 2-pita dengan MPA menggunakan blok memori mempunyai orde yang sama dengan hasil yang diperoleh dari analisa algoritma, yakni T (n) loglog (S (n)).
Dalam tugas akhir ini digunakan tiga metoda untuk menguji orde kompleksitas waktu tersebut. Metoda tersebut adalah:
1. metoda blok statis
2. metoda blok dinamis
3. metoda tabel look up"
Depok: Universitas Indonesia, 1990
T8503
UI - Tesis Membership  Universitas Indonesia Library
cover
Arif Djunaidy
"Dalam makalah ini dibahas hasil desain dan implementasi perangkat lunak pencarian ciri-ciri wajah dengan masukan berupa citra wajah yang memiliki ukuran tertentu, dengan menggunakan gabungan metode model distribusi titik dan algoritma genetika. Perangkat lunak dibagi menjadi dua sub-sistem, yaitu sub-sistem pelatihan, data pelatihan diproses dengan menggunakan metode model distribusi titik untuk mendapatkan serangkaian parameter yang berguna pada proses pencarian. Selanjutnya dalam sub-sistem pencarian, parameter-parameter tersebut dimodifikasi dan dikombinasi dengan menggunakan metode algoritma genetika untuk mendapatkan ciri-ciri wajah yang dimiliki oleh citra.
Uji coba perangkat lunak dilakkukan terhadap 30 citra wajah yang berbeda, dian setiap citra diuji coba dengan 24 parameter algortitma genetika yang berbeda. Hasil uji coba menunjukkan bahwa tingkat kesalahan yang merepresentasikan perbedaan koordinat titik-titik dari citra uji coba terhadap citra pelatihan berada pada interval 2% - 17% dengan tingkat kesalahan minimum, maksimum dan rata-rata berturut-turut sebesar 2.5%, 16.18% dan 5.92%. "
2002
JIKT-2-2-Nov2002-8
Artikel Jurnal  Universitas Indonesia Library
cover
"Permasalahan penjadwalan job terhadap beberapa mesin (scheduling jobs on multiple machineslSJMM) merupakan salah satu permasalahan penjadwalan klasik yang dapat ditemui pada proses komputasi terlebih jika komputasi dilakukan seeara terdistribusi. Beberapa metode penyelesaian permasalahan tersebut telah dikembangkan baik dengan pendekatan eksak maupun heuristiklmetaheuristik. Tabu search sebagai salah satu metode metaheuristik yang relatif baru dapat menjadi aIternatif metode untuk mendapatkan pendekatan penyelesaian permasalahan tersebut. Metode ini sudah diaplikasikan pad a permasalahan optimasi kombinatorial, optimasi multi ekstermal, serta rare event simulation, dengan hasil penyelesaian yang eukup optimal dengan waktu yang relatif singkat. Penelitian ini mengimplementasikan metode tabu search yang digabungkan dengan algoritma genetika (Incorporation Genetic-Tabu Search AlgorithmllGTS) dalam permasalahan SJMM pada komputasi grid. Hasil yang dicapai eukup memuaskan dibandingkan dengan menggunakan salah satu algoritma baik genetika saja atau algoritma tabu search, hal ini dapat terlihat dari nilai makes pan yang lebih kecil. "
620 JURTEL 15:2 (2010)
Artikel Jurnal  Universitas Indonesia Library
cover
"Classification is an important topic in data mining research . A classification problem on the discovery of classification reles that correctly classify an unkown member of a class...."
Artikel Jurnal  Universitas Indonesia Library
cover
O`Regan, Gerard
"Tracing the story of computing from Babylonian counting boards to smartphones, this inspiring textbook/reference provides a concise overview of the key events in the history of computing, together with discussion exercises to stimulate deeper investigation into this fascinating area.
Topics and features:
* Provides chapter introductions, summaries and key topics, as well as review questions and a glossary
* Includes an introduction to analogue and digital computers, and to the foundations of computing
* Examines the contributions of the ancient Babylonian, Egyptian, Greek, Roman, and Islamic civilisations to the field of computing
* Covers the first digital computers, and the earliest examples of commercial computers, mainframes and minicomputers
* Describes the invention and early development of the integrated circuit and the microprocessor
* Reviews the emergence of home computers, and the introduction of the IBM personal computer
* Discusses the technological revolutions initiated by the creation of the Internet, the invention of the smartphone, and the rise of social media
* Presents a short history of telecommunications, programming languages, operating systems, software engineering, artificial intelligence, and databases
This engaging and easy-to-read work serves as an introductory textbook for students of computer science interested in the historical basis of the field. The curious reader will also find the book to be ideal as a self-study primer on the origins of the fundamental theory and early applications of the technology which has now become ubiquitous in modern society."
Switzerland: Springer International Publishing, 2016
e20528411
eBooks  Universitas Indonesia Library
cover
Rotshtein, Alexander P.
"The purpose of this book is to present a methodology for designing and tuning fuzzy expert systems in order to identify nonlinear objects; that is, to build input-output models using expert and experimental information. The results of these identifications are used for direct and inverse fuzzy evidence in forecasting and diagnosis problem solving.
The book is organised as follows : Chapter 1 presents the basic knowledge about fuzzy sets, genetic algorithms and neural nets necessary for a clear understanding of the rest of this book. Chapter 2 analyzes direct fuzzy inference based on fuzzy if-then rules. Chapter 3 is devoted to the tuning of fuzzy rules for direct inference using genetic algorithms and neural nets. Chapter 4 presents models and algorithms for extracting fuzzy rules from experimental data. Chapter 5 describes a method for solving fuzzy logic equations necessary for the inverse fuzzy inference in diagnostic systems. Chapters 6 and 7 are devoted to inverse fuzzy inference based on fuzzy relations and fuzzy rules. Chapter 8 presents a method for extracting fuzzy relations from data. All the algorithms presented in Chapters 2-8 are validated by computer experiments and illustrated by solving medical and technical forecasting and diagnosis problems. Finally, Chapter 9 includes applications of the proposed methodology in dynamic and inventory control systems, prediction of results of football games, decision making in road accident investigations, project management and reliability analysis. "
Berlin: [Springer, ], 2012
e20398322
eBooks  Universitas Indonesia Library