• Journal of Korean Institute of Industrial Engineers
• /
• v.9 no.2
• /
• pp.3-8
• /
• 1983

The multiple choice knapsack problem is modified. To solve this modified multiple choice knapsack problem, Lagrangian relaxation is used, and to take advantage of the special structure of subproblems obtained by decomposing this relaxed Lagrangian problem, a modified ranking algorithm is used. The K best rank order solutions obtained from each subproblem as a result of applying modified ranking algorithm are used to formulate restricted problems of the original problem. The optimality for the original problem of solutions obtained from the restricted problems is judged from the upper bound and lower bounds calculated iteratively from the relaxed problem and restricted problems, respectively.

• Korean Management Science Review
• /
• v.12 no.2
• /
• pp.77-87
• /
• 1995

In this paper we develop an efficient heuristic algorithm for the problem of scheduling n sequence-dependent jobs on a basic processor to minimize makespan. Efficient solution methods are already known for the sequence- independent case. But for the sequence-dependent case, this problem belongs to a set of strong NP-complete problems. We present a heuristic which is similar to shortest setup time heuristic but opportunity cost of setup time rather than shortest setup time is used for choosing next job. This heuristic algorithm has same computational complexity and worst case ratio as the shortest setup time heuristic. We used Wilcoxon signed rank test to show that our heuristic is superior to nearest setup time heuristic in term of average behavior.

• Transactions on Control, Automation and Systems Engineering
• /
• v.3 no.2
• /
• pp.77-82
• /
• 2001

This paper deals with a fault detection algorithm for linear descriptor systems via unknown input PI observer. An unknown input PI observer is presented and its realization conditions is proposed by using the rank condition of system matrices. From the characteristics of unknown input PI observer, the states of system with unknown inputs are estimated and the occurrences of fault are detected, and its magnitudes are estimated easily by using integrated output estimation error under the step faults. Finally, a numerical example is given to verify the effectiveness of the proposed fault detection algorithm.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2013.10a
• /
• pp.130-132
• /
• 2013

This paper presents an improvement for calculating method of astronomical vessel position with circle of equal altitude equation based on using a virtual object in sun and two stars observation. In addition, to enhance the accuracy of ship position achieved from solving linear matrix system, and surmount the disadvantages on rank deficient matrices situation, the authors used singular value decomposition (SVD) in least square method instead of normal equation and QR decomposition, so, the solution of matrix system will be available in all situation. As proposal algorithm, astronomical ship position will give more accuracy than previous methods.

• ETRI Journal
• /
• v.42 no.3
• /
• pp.388-398
• /
• 2020

We herein propose a heuristic redundancy selection algorithm that combines resubmission, replication, and checkpointing redundancies to reduce the resiliency overhead in fault-tolerant workflow scheduling. The appropriate combination of these redundancies for workflow tasks is obtained in two consecutive phases. First, to compute the replication vector (number of task replicas), we apportion the set of provisioned resources among concurrently executing tasks according to their needs. Subsequently, we obtain the optimal checkpointing interval for each task as a function of the number of replicas and characteristics of tasks and computational environment. We formulate the problem of obtaining the optimal checkpointing interval for replicated tasks in situations where checkpoint files can be exchanged among computational resources. The results of our simulation experiments, on both randomly generated workflow graphs and real-world applications, demonstrated that both the proposed replication vector computation algorithm and the proposed checkpointing scheme reduced the resiliency overhead.

• Journal of applied mathematics & informatics
• /
• v.28 no.3_4
• /
• pp.687-696
• /
• 2010

In this paper, an algorithm for computing the sparse approximate inverse factor of matrix $A^{T}\;A$, where A is an $m\;{\times}\;n$ matrix with $m\;{\geq}\;n$ and rank(A) = n, is proposed. The computation of the inverse factor are done without computing the matrix $A^{T}\;A$. The computed sparse approximate inverse factor is applied as a preconditioner for solving normal equations in conjunction with the CGNR algorithm. Some numerical experiments on test matrices are presented to show the efficiency of the method. A comparison with some available methods is also included.

• Journal of Information Technology Services
• /
• v.13 no.3
• /
• pp.323-331
• /
• 2014

This research is based on real-time service model that uses lock screen of smart devices which is mostly exposed to device users. The potential for lock screen space is immense due to their exposing time for user. The effect can be maximized by offering useful information contents on lock screen. This service model offers real-time keyword with abridged sentence. They match real-time keyword with news by using text matching algorithm and extracts kernel sentence from news to provide short sentence to user. News from the lock screen to match real-time query sentence, and then only to the original core of the ability to move a user evaluation was conducted after adding. The report provided a key statement users feel the lack of original Not if you go to an average of 5.71%. Most algorithms allow only real-time zoom key sentence extracted keywords can accurately determine the reason for that was confirmed.

• The Journal of the Korea Contents Association
• /
• v.5 no.2
• /
• pp.229-242
• /
• 2005

We constructed a full-text retrieval system for the scanned Hangul document images. The system consists of three parts; preprocessing, recognition, and retrieval components. The retrieval algorithm uses recognition results up to k-ranks. The algorithm is not only insensitive to the recognition errors, but also has the advantage of user-controllable recall and precision. For the objective performance evaluation, we used the scanned images of the Journal of Korea Information Science Society provided by KISTI. The system was shown to be practical through theevaluationofrecognitionandretrievalrates.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.452-452
• /
• 2000

This paper deals with a fault detection algorithm for linear descriptor systems via unknown input PI observer. An unknown input PI observer is presented and its realization conditions is proposed by using the rank condition of system matrices. From the characteristics of unknown input PI observer, the states of system with unknown inputs are estimated and the magnitude of failures are detected and isolated easily by using integrated output error under the step failures. Finally, a numerical example is given to verify the effectiveness of the proposed algorithm.

• Communications for Statistical Applications and Methods
• /
• v.13 no.1
• /
• pp.29-38
• /
• 2006

We proposed a procedure for detecting of multiple outliers in multivariate data. Rousseeuw and van Zomeren (1990) have suggested the robust distance $RD_i$ by using the Resampling Algorithm. But $RD_i$ are based on the assumption that X is in the general position.(X is said to be in the general position when every subsample of size p+1 has rank p) From the practical points of view, this is clearly unrealistic. In this paper, we proposed a computing method for approximating MVE, which is not subject to these problems. The procedure is easy to compute, and works well even if subsample is singular or nearly singular matrix.