• Management Science and Financial Engineering
• /
• v.18 no.1
• /
• pp.13-20
• /
• 2012

This paper considers a revenue maximization problem on a single processor. Each job is identified as its processing time, initial reward, reward decreasing rate, and preferred start time. If the processor starts a job at time zero, revenue of the job is its initial reward. However, the revenue decreases linearly with the reward decreasing rate according to its processing start time till its preferred start time and finally its revenue is zero if it is started the processing after the preferred time. Our objective is to find the optimal sequence which maximizes the total revenue. For the problem, we characterize the optimal solution properties and prove the NP-hardness. Based upon the characterization, we develop a branch-and-bound algorithm for the optimal sequence and suggest five heuristic algorithms for efficient solutions. The numerical tests show that the characterized properties are useful for effective and efficient algorithms.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.5A
• /
• pp.702-708
• /
• 2000

In this paper, we designed one-dimensional VLSI array with optimal pipeline period for high speed processing fractal image compression. The algorithm is derived which is suitable for VLSI array from axed block partition algorithm. Also the algorithm satisfies high quality of image and high compression-ratio. The designed VLSI array has optimal pipeline relied because the required processing time of PEs is distributed as same as possible. As this result, we can improve the processing speed up to about 3 times. The number of input/output pins can be reduced by sharing the input/output and arithmetic unit of the domain blocks and the range blocks.

• International Journal of Control, Automation, and Systems
• /
• v.4 no.6
• /
• pp.714-724
• /
• 2006

In this note a method of designing optimal vibration control based on Haar functions to control of bounce and pitch vibrations in engine-body vibration structure is presented. Utilizing properties of Haar functions, a computational method to find optimal vibration control for the engine-body system is developed. It is shown that the optimal state trajectories and optimal vibration control are calculated approximately by solving only algebraic equations instead of solving the Riccati differential equation. Simulation results are included to demonstrate the validity and applicability of the technique.

• Proceedings of the Korean Society for Agricultural Machinery Conference
• /
• 1993.10a
• /
• pp.952-965
• /
• 1993

A simulation modeling is necessary for the optimal design of a rice processing plant, which consists of a facility (a silo system) of rice drying and storage and a rice mill plant. In a rice processing plant, the production scheduling and the decision on capcity of each unit based on a queuing theory is very important and difficult. In this study a process-oriented simulation model was developed for the design of a rice drying and storage system with SLAMSYSTEM. The simulation model is capable of simulating virtually all the processing activities and provides work schedules which minimize total processing time , mean flow time and bottleneck of the plant system and estimate drying time for a batch in a drying silo. Model results were used for determination the size and capacity of each processing unit and for analyzing the performance of the plant . The developed model was actually applied to construct a grain silo system for rice drying and storage.

• Asia pacific journal of information systems
• /
• v.6 no.1
• /
• pp.21-38
• /
• 1996

This paper investigates the performance improvement opportunities through a resiliency mechanism in the distributed primary/backup database system. Recognizing that a distributed transaction executes at several servers during its lifetime, we propose a resiliency mechanism which allows continuous transaction processing in distributed database server systems in the presence of a server failure. In order to perform continuous transaction processing despite failures, every state change of a transaction processing can be saved in the backup server. Obviously, this pessimistic synchronization may give more burdens than benefits to the system. Thus, the tracking needs not be done synchronously with the transaction progress. Instead, the state of all transaction processing in a system is saved periodically. This activity is referred to as a savepoint. Then, the question is how often the savepoint has to be done. We derive the optimal savepoint to identify the optimization parameters for the resilient transaction processing system.

• Journal of Korea Multimedia Society
• /
• v.21 no.3
• /
• pp.391-399
• /
• 2018

In this paper, we construct and compare various guitar chord classification systems using perceptron neural network and convolutional neural network without pre-processing other than Fourier transform to identify the optimal chord classification system. Conventional guitar chord classification schemes use, for better feature extraction, computationally demanding pre-processing techniques such as stochastic analysis employing a hidden markov model or an acoustic data filtering and hence are burdensome for real-time chord classifications. For this reason, we construct various perceptron neural networks and convolutional neural networks that use only Fourier tranform for data pre-processing and compare them with dataset obtained by playing an electric guitar. According to our comparison, convolutional neural networks provide optimal performance considering both chord classification acurracy and fast processing time. In particular, convolutional neural networks exhibit robust performance even when only small fraction of low frequency components of the data are used.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.2
• /
• pp.483-503
• /
• 2015

This paper analyzes the optimal user density and power allocation for Device-to-Device (D2D) communication underlaying cellular networks on multiple bands with the target of maximizing the D2D transmission capacity. The entire network is modeled by Poisson point process (PPP) which based on stochastic geometry. Then in order to ensure the outage probabilities of both cellular and D2D communication, a sum capacity optimization problem for D2D system on multiple bands is proposed. Using convex optimization, the optimal D2D density is obtained in closed-form when the D2D transmission power is determined. Next the optimal D2D transmission power is obtained in closed-form when the D2D density is fixed. Based on the former two conclusions, an iterative algorithm for the optimal D2D density and power allocation on multiple bands is proposed. Finally, the simulation results not only demonstrate the D2D performance, density and power on each band are constrained by cellular communication as well as the interference of the entire system, but also verifies the superiority of the proposed algorithm over sorting-based and removal algorithms.

• Journal of Korean Society of Steel Construction
• /
• v.21 no.4
• /
• pp.361-373
• /
• 2009

Using the genetic algorithm, the optimal-design technique of the Nielsen arch bridge was proposed in this paper. The design parameters were the arch-rise ratio and the steel weight ratio of the Nielsen arch bridge, and optimal-design techniques were utilized to analyze the behavior of the bridge. The optimal parameter values were determined for the estimated optimal level. The parameter determination requires the standardization of the safety, utility, and economic concepts as the critical factors of a structure. For this, a genetic algorithm was used, whose global-optimal-solution search ability is superior to the optimization technique, and whose object function in the optimal design is the total weight of the structure. The constraints for the optimization were displacement, internal stress, and time and space. The structural analysis was a combination of the small displacement theory and the genetic algorithm, and the runtime was reduced for parallel processing. The optimal-design technique that was developed in this study was employed and deduced using the optimal arch-rise ratio, steel weight ratio, and optimal-design domain. The optimal-design technique was presented so it could be applied in the industry.

• International Journal of Control, Automation, and Systems
• /
• v.6 no.2
• /
• pp.160-170
• /
• 2008

Temperature control of an enclosed thermal system which has many applications including Rapid Thermal Processing (RTP) of semiconductor wafers showed an input-constraint violation for nonlinear controllers due to inherent strong coupling between the elements [1]. In this paper, a constrained nonlinear optimal control design is developed, which accommodates input constraints using the linear algebraic equivalence of the nonlinear controllers, for the temperature control of an enclosed thermal process. First, it will be shown that design of nonlinear controllers is equivalent to solving a set of linear algebraic equations-the linear algebraic equivalence of nonlinear controllers (LAENC). Then an input-constrained nonlinear optimal controller is designed based on that LAENC using the constrained linear least squares method. Through numerical simulations, it is demonstrated that the proposed controller achieves the equivalent performances to the classical nonlinear controllers with less total energy consumption. Moreover, it generates the practical control solution, in other words, control solutions do not violate the input-constraints.

• Journal of the Korean Society for information Management
• /
• v.18 no.3
• /
• pp.29-40
• /
• 2001

In this paper, we suggest a query optimization algorithm to select the optimal processing method of an extended boolean query on inverted files. There can be a lot of methods for processing an extended boolean query according to the processing sequence oh the keywords con tamed in the query, In this sense, the problem of optimizing an extended boolean query it essentially that of optimizing the keyword sequence in the query. In this paper, we show that the problem is basically analogous to the problem of finding the optimal join order in database query optimization, and apply the ideas in the area to the problem solving. We establish the cost model for processing an extended boolean query and develop an algorithm to filled the optimal keyword-processing sequence based on the concept of keyword rank using the keyword selectivity and the access costs of inverted file. We prove that the method selected by the optimization algorithm is really optimum, and show, through experiments, that the optimal method is superior to the others in performance We believe that the suggested optimization algorithm will contribute to the significant enhancement of the information retrieval performance.