• Journal of the Korea Society of Computer and Information
• /
• v.20 no.11
• /
• pp.69-75
• /
• 2015

This paper suggests heuristic polynomial time algorithm for crew scheduling problem that is a kind of optimization problems. This problem has been solved by linear programming, set cover problem, set partition problem, column generation, etc. But the optimal solution has not been obtained by these methods. This paper sorts transit costs $c_{ij}$ to ascending order, and the task i and j crew paths are merged in case of the sum of operation time ${\Sigma}o$ is less than day working time T. As a result, we can be obtain the minimum number of crews $_{min}K$ and minimum transit cost $z=_{min}c_{ij}$. For the transit cost of specific number of crews $K(K>_{min}K)$, we delete the maximum $c_{ij}$ as much as the number of $K-_{min}K$, and to partition a crew path. For the 5 benchmark data, this algorithm can be gets less transit cost than state-of-the-art algorithms, and gets the minimum number of crews.

• Journal of the Korean Society for Precision Engineering
• /
• v.12 no.11
• /
• pp.140-147
• /
• 1995

This paper deals with conversion from the STL file to the Slice to the Slice cross-sectional information for Stereolithography. The STL file is widely used for Stereolithography, but it is very difficult to convert STL file into Slice file directly. Because it consists of an ordered list of triangular net without any topological information other than the orientation of each facet. So, The system is accomplished by data flow through several intermediate stages such as Reference. SL1. .SL2L. .SL3. and .SLC file. The data processing is performed in 5 steps: 1) Create a Reference file including common information. 2) Modify STL file within the effective range of SL machine. 3) Calculate a point of intersection between plane equation and line equation. 4) Sort z values in ascending order using quick sort algorithm. 5) Search the adjacent points and formulate a closed loop usingsingly linked linear list. The system is developed by using Borland C++ 3.1 compiler in the environment of Pentium PC, and verified to be satisfactory by making some prototypes of electric household appliances.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.5
• /
• pp.161-166
• /
• 2016

This paper suggests heuristic algorithm with O(m) linear time complexity for choice of expansion projects that can't be obtain the optimal solution using linear programming until now. This algorithm ascending sort of net profit for all projects. Then, we apply a simple method that deletes the project with minimum net profit until this result satisfies the carried over for n-years more than zero value. While this algorithm using simple rule, not the linear programing fails but the proposed algorithm can be get the optimal solution for experimental data.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.9C
• /
• pp.888-894
• /
• 2007

The computational complexity of a sphere decoder (SD) is conventionally reduced by decoding order scheme which sorts candidate symbols in the ascending order of the Euclidean distance from the output of a zero-forcing (ZF) receiver. However, since the ZF output may not be a reliable sorting reference, we propose two types of sorting schemes to allow faster decoding. The first is to use the newly found lattice points in the previous search round instead of the ZF output (Type I). Since these lattice points are closer to the received signal than the ZF output, they can serve as a more reliable sorting reference for finding the maximum likelihood (ML) solution. The second sorting scheme is to sort candidate symbols in descending order according to the number of candidate symbols in the following layer, which are called child symbols (Type II). These two proposed sorting schemes can be combined with layer sorting for more complexity reduction. Through simulation, the Type I and Type II sorting schemes were found to provide 12% and 20% complexity reduction respectively over conventional sorting schemes. When they are combined with layer sorting, Type I and Type II provide an additional 10-15% complexity reduction while maintaining detection performance.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.20 no.3
• /
• pp.147-152
• /
• 2020

The baseball elimination problem(BEP) is eliminates teams that finishes the season in the early stage without play the remaining games because of the team never most wins even though all wins of remaining games. This problem solved by max-flow/min-cut theorem. But the max-flow/min-cut method has a shortcoming of iterative constructs the network for all of team and decides the min-cut for each network. This paper suggests ascending sort in wins game plus remaining games for each team, then the candidate eliminating team set K with lower 1/2 rank and most easy, simple, and fast computes the existence or not of subset R that a team elimination decision. As a result of various experimental data, this algorithm can be find all of elimination teams for whole data with fast and correct.

• Journal of Korean Medical Ki-Gong Academy
• /
• v.11 no.1
• /
• pp.1-58
• /
• 2009

1. The rapid increasing elderly population represents a significant increase in the population with dementia. So, studies on the method for the prevention of dementia are necessary. 2. In oriental medicine, the causes of dementia are based on the deficiency of Jeong(精;essence of the body), the lack of bone marrow, and abnormal brain function. Emotional stress, bad habits of lifestyle including eating habits are also responsible for dementia. They causes dementia by blocking the circulation of Gi(氣) such as Suseunghwagang(水升火降;ascending kidney water and descending heart fire) and suppressing the function of Danjeon(丹田; the hypogastric center). 3. Gochi(叩齒) is a sort of mastication that facilitate salivation and secretion of parotin, next step is swallowing saliva. These supplement Jeong(精) of the five viscera and the six entrails(五臟六腑), promote Suseunghwagang(水升火降), and advance the function of the hypogastric center (丹田) and activate the brain. 4. So this paper draw a conclusion that Gochi(叩齒) is negatively related to the causes of dementia and it will be useful in preventing dementia.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.29 no.10
• /
• pp.791-798
• /
• 2018

The CFAR algorithm is mainly used for target detection in radar systems. In particular, OS CFAR is used in a non-uniform noise environment. However, it requires a large amount of computation, because it should sort reference cells in ascending order. This makes it difficult to apply the radar system in real time. In this paper, we describe how to reduce the computational burden of OS CFAR. We compared the power of the test cell and reference cell to determine only the presence or absence of target detection. The common reference cells overlapping in the reference cells of the three test cells are obtained. We first compare the test cell with the highest power value among the three test cells to the common reference cells. Next, we compare each test cell to general reference cells, excluding the common reference cells. The computation time is shortened by reducing the power comparison computation amounts.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.1
• /
• pp.153-162
• /
• 2013

This paper proposes the most simple method for optimal solution of the transshipment problem. Usually the transshipment problem is solved by direct linear programming or TSM (Transportation Simplex Method). The method using TSM has two steps. First it is to get a initial solution using NCM, LCM, or VAM, second to refine the initial solution using MOD or SSM. However the steps is complex and difficult. The proposed method applies the method that transforms transshipment problem to transportation problem. In the proposed method it simply selects the minimum cost of rows about transportation problem, and then it applies the method that assigns a transported volume as an ascending sort of the costs of rows about the selected costs. Our method makes to be very fast got the initial value. Also we uses the method that controls assignment volume, if a heavy item of cost is assigned to a transported volume and it has a condition to be able to transform to more lower cost. The proposed algorithm simply got the optimal solution with applying to 11 transshipment problem.