Sistem Informasi Wedding Organizer Berbasis Android

Dalam mempromosikan jasa pernikahan, suatu wedding organizer (WO) belum dapat menyajikan informasi paket pernikahan secara lengkap. Banyak permasalahan yang terjadi seperti dalam pengolahan daftar paket pernikahan yang terbaru serta data transaksi yang dikerjakan secara manual yang memungkinan terjadinya kekeliruan informasi dalam detail pemesanan serta pencarian data pesanan pelanggan. Ini juga mengakibatkan kesalahan dalam pencatatan serta perhitungan untuk mengetahui keuntungan dan kerugian usaha. Penelitian ini bertujuan untuk menyajikan data informasi secara lengkap sehingga membantu penyedia jasa mempromosikan layanan secara efektif. Adapun metode yang digunakan adalah metode pengembangan sistem dengan model prototype dimana tahapannya, yaitu: communication, quick plan and modelling quick design, contruction of prototype dan deployment delivery and feedback. Hasil dari penelitian ini menunjukkan bahwa sistem aplikasi WO dapat menginformasikan paket pernikahan secara lengkap, dapat melakukan update terbaru daftar paket pernikahan, proses transaksi pemesan dilakukan secara real time serta informasi data pesanan yang masuk secara otomatis. In promoting wedding services, a wedding organizer is yet able to present complete wedding package information. Many problems occur, such as in the processing of the latest wedding package lists and transaction data that is done manually, which allows for information errors in order details and search for customer order data. This also results in errors in recording and calculating in finding out the profits and losses of the business. This study aimed to present complete information data so as to help service providers promoting the services effectively. The method employed was a system development method with a prototype model where the stages are communication, quick plan and modeling quick design, construction of prototype and deployment delivery, and feedback. The results indicate that the Wedding Organizer Information System can provide complete information on wedding packages, can update the latest list of wedding packages, process customer transactions and information on incoming order data in real time and automatically.

A Comparison of Machine Learning Algorithms in Manufacturing Production Process

This research aims to improve the productivity and reliability of incoming orders in the manufacturing process. The unclassified data attributes of the incoming order can affect the order plan which will impact to the low productivity and reliability in the manufacturing process. In order to overcome the problem, machine learning algorithms are implemented to analyze the data and expected to help the manufacturing process in deciding the incoming order arrangement process. Four machine learning algorithms are implemented (Decision Tree, Nave Bayes, Support Vector Machine, and Neural Network). These machine learning algorithms are compared by their algorithm performance to the manufacturing process problem. The result of the research shows that machine learning algorithms can improve the productivity and reliability rate in production area up to 41.09% compared to the previous rate without any dataset arrangement before. The accuracy of this prediction test achieves 97%.

Dynamic stability of the Nash equilibrium for a bidding game

A one-sided limit order book is modeled as a noncooperative game for several players. An external buyer asks for an amount [Formula: see text] of a given asset. This amount will be bought at the lowest available price, as long as the price does not exceed an upper bound [Formula: see text]. One or more sellers offer various quantities of the asset at different prices, competing to fulfill the incoming order. The size [Formula: see text] of the order and the maximum acceptable price [Formula: see text] are not a priori known, and thus regarded as random variables. In this setting, we prove that a unique Nash equilibrium exists, where each seller optimally prices his assets in order to maximize his own expected profit. Furthermore, a dynamics is introduced, assuming that each player gradually adjusts his pricing strategy in reply to the strategies adopted by all other players. In the case of (i) infinitely many small players or (ii) two large players with one dominating the other, we show that the pricing strategies asymptotically converge to the Nash equilibrium.

Scheduling Methods for Disk Requests

Disk scheduling changes the sequence order to serve the requests that are waiting in the queue. While data placement reduces the access time of a disk request, scheduling reduces the waiting time of a request. Thus, the response time is found as: Response time = Waiting time + Access time The longer the waiting queue, the more useful is the scheduling method. When there is no waiting queue, any scheduling methods perform the same. Expected waiting time and queue length can be found using queueing theory. The queueing theory is out of the scope of this book. In general, a disk scheduling policy changes the service order of waiting requests. A disk scheduling policy accepts the waiting requests and serves them in the new service sequence. Notice that the service sequence may or may not be the same as the incoming order of the waiting requests. In this chapter, we shall describe two common disk scheduling methods. First, we shall describe the simple first-in-first-out method. After that, we shall describe the efficient SCAN algorithm in the following sections.