• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.26 no.4
• /
• pp.42-49
• /
• 2003

The branch and bound techniques based on cut tree and eigenvector have been Introduced in the literature [1, 2, 3, 6, 9, 12]. These techniques are used as a basis to allocate departments to floors and then to fit departments with unchangeable dimensions into floors. Grouping algorithms to allocate departments to each floor are developed and branch and bound forms the basis of optimizing using the criteria of rectilinear distance. The proposed branch and bound technique, in theory, will provide the optimal solution on two dimensional layout. If the runs are time and/or node limited, the proposed method is a strong heuristic The technique is made further practical by the fact that the solution is constrained such that the rectangular shape dimensions length and width are fixed and a perfect fit is generated if a fit is possible. Computational results obtained by cut tree-based algorithm and eigenvector-based algorithm are shown when the number of floors are two or three and there is an elevator.

• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.2
• /
• pp.111-123
• /
• 2009

We present an efficient algorithm for computing the Hausdorff distance between two 2D convex polygons. Two convex polygons are bounded by k-DOPs and the regions of interest are traced using the orientational and hierarchical properties of k-DOP. The algorithm runs in a logarithmic time in the average case, and the worst case time complexity is linear.

• Journal of Korean Philosophical Society
• /
• v.130
• /
• pp.23-45
• /
• 2014

It can be said that Scheler's theory of perception is the theory of drive-conditioned perception, in more detail the theory of drive-motoric conditions of perception. Scheler tells us that Immanuel Kant and Ernst Mach were mistaken in their assumption that sensations are purely receptive and primary in all experience. He claims that sensations are not primary but subsequent to a subliminal attention of vital drives(called 'Vor-Liebe und Vor-Interesse' by him). And because sense perception cannot take place without a vital energy of drives that account for the ongoing activity of perception, no object can be perceived unless it stimulates movement in an organism which exercises a count-movement against objects and thereby resisting objects. According to Scheler, an order of foundation such as the preexistence of images prior to perception; the priority of perception with regard to functions of senses; the priority of sense functions with regard to sensations has to be kept in mind. And it has to be kept in mind that the essence of life is pre-empirical, is pure becoming(Werden) and unbecoming(Entwerden), a process in which its two empirical sides are not yet separated. Then it is easy to see that perception is conditioned by vital drives. The drive-conditioned theory of perception is also supported by the fact that the motility of an organism determines its sensory apparatus, an organism has an alphabet of senses that can serve as signs of luring and noticing objects that are meaningful for its drive-motoric behavior. For example a lizard remains undisturbed by a gun shot but runs away from the slightest noise in the grass.

• Journal of Power Electronics
• /
• v.17 no.2
• /
• pp.358-367
• /
• 2017

This paper presents a novel filtering method for speed measurements to improve the low-speed performance of the direct-drive permanent magnet traction machines for elevators. Based on the theory of nonlinear tracking differentiator (NTD), this method, which can act as a high performance filter of a raw speed signal, obtains a more accurate speed feedback signal when applying a low-resolution encoder. In addition, it can relieve the interference caused by the position derivative for speed sampling. By analyzing the frequency response of the NTD, the influence of its parameters on the performance of the speed filtering is investigated. Compared with different types of low-pass filters, the proposed method shows a shorter time delay and a stronger ability in terms of noise suppression when the parameters are selected carefully. In addition, when using the measured speed signal through a nonlinear tracking differentiator as the feedback of the system, the motor runs more steadily at low speeds. As a result, the riding comfort of a direct-drive elevator can be improved. The feasibility of the proposed strategy was verified on an 11.7kW elevator traction machine using a commercial inverter.

• Journal of the Korean Society for Precision Engineering
• /
• v.19 no.2
• /
• pp.213-219
• /
• 2002

A cone-shaped active magnetic healing spindle system for high speed internal grinding with built-in motor that has 7.5kW power and maximum rotational speed of 50,000 rpm is designed and built. Using cone-shaped AMB(Active Magnetic Bearing) system, the axial rotor dick and magnets of conventional 5-axis actuating design can be eliminated. so this concept of design provides a simple magnetic bearing system. In this paper, the cone-shaped electromagnets are designed by magnetic circuit theory, and a de-coupled direct feedback PID controller is applied to control the coupled magnetic bearings. The designed crone-shaped AMB spindle system is built and constructed with a digital control system, which has TMS320C6702 DSP, 16 bit AD/DA, switching power amplifier and gap sensors. As the AMB system provides high damping ratio eliminating overshoot and resonance speed, this spindle runs up to 40,000 rpm stably with about 5${\mu}{\textrm}{m}$ of runout.

• Biotechnology and Bioprocess Engineering:BBE
• /
• v.9 no.5
• /
• pp.331-338
• /
• 2004

The Separation of two amino acids, phenylalanine and tryptophan, was carried out using laboratory simulated moving bed (SMB) chromatography. The SMB process consisted of four zones, with each zone having 2 columns. The triangle theory was used to obtain the operating conditions for the SMB. The mass transfer coefficients of the two amino acids were obtained from the best-fit values by comparing simulated and experimental pulse data. The competitive adsorption isotherms of the two amino acids were obtained by single and binary frontal analyses, taking into consideration the competition between the two components. A competitive Langmuir isotherm, obtained from single-component frontal chromatography, was used in the first run, and the isotherm from binary frontal chromatography in the second, with the flow rate of zone 1 modified to improve the purity. Compared to the first and second runs, the competitive Langmuir isotherm from the binary frontal chromatography Showed good agreement with the experimental results. Also, adjusting the flow rate in zone 1 increased the purity of the products. The purities of the phenylalanine in the raffinate and the tryptophan in the extract were 99.84 and $99.99\%$, respectively.

• Communications for Statistical Applications and Methods
• /
• v.14 no.3
• /
• pp.483-495
• /
• 2007

In a general fractional factorial design, the n-levels of a factor are coded by the $n^{th}$ roots of the unity. Pistone and Rogantin (2007) gave a full generalization to mixed-level designs of the theory of the polynomial indicator function using this device. This article discusses the optimal blocking scheme for nonregular designs. According to hierarchical principle, the minimum aberration (MA) has been used as an important criterion for selecting blocked regular fractional factorial designs. MA criterion is mainly based on the defining contrast groups, which only exist for regular designs but not for nonregular designs. Recently, Cheng et al. (2004) adapted the generalized (G)-MA criterion discussed by Tang and Deng (1999) in studying $2^p$ optimal blocking scheme for nonregular factorial designs. The approach is based on the method of replacement by assigning $2^p$ blocks the distinct level combinations in the column with different blocks. However, when blocking level is not a power of two, we have no clue yet in any sense. As an example, suppose we experiment during 3 days for 12-run Plackett-Burman design. How can we arrange the 12-runs into the three blocks? To solve the problem, we apply G-MA criterion to nonregular mixed-level blocked scheme via the mixed-level indicator function and give an answer for the question.

• Journal of the Korean Solar Energy Society
• /
• v.33 no.1
• /
• pp.40-47
• /
• 2013

An aerodynamic design tool was developed for small wind turbine blades based on the blade element momentum theory. The lift and drag coefficients of blades that are needed for aerodynamic blade design were obtained in real time from the Xfoil program developed at University of Illinois. While running, the developed tool automatically accesses the Xfoil program, runs it with proper aerodynamic and airfoil properties, and finally obtains lift and drag coefficients. The obtained aerodynamic coefficients are then used to find out optimal twist angles and chord lengths of the airfoils. The developed tool was used to design a wind turbine blade using low Reynolds number airfoils, SG6040 and SG6043 to have its maximum power coefficient at a specified tip speed ratio. The performance of the blade was verified by a commercial code well known for its prediction accuracies.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.10
• /
• pp.1258-1263
• /
• 1999

본 논문에서는 CRCW(Concurrent Read Concurrent Write)와 CREW(Concurrent Read Exclusive Write) PRAM(Parallel Random Access Machine) 모델에서 무방향성 그래프 G=(V, E)의 극대 매칭을 구하기 위해 간결한 랜덤 병렬 알고리즘을 제안한다. CRCW PRAM 모델에서 m개의 선을 가진 그래프에 대해, 제안된 매칭 알고리즘은 m개의 프로세서 상에서 {{{{ OMICRON (log m)의 기대 수행 시간을 가진다. 또한 CRCW 알고리즘을 CREW PRAM 모델에서 구현한 CREW 알고리즘은 OMICRON (log^2 m)의 기대 수행 시간을 가지지만,OMICRON (m/logm) 개의 프로세서만을 가지고 수행될 수 있다.Abstract This paper presents simple randomized parallel algorithms for finding a maximal matching in an undirected graph G=(V, E) for the CRCW and CREW PRAM models. The algorithm for the CRCW model has {{{{ OMICRON (log m) expected running time using m processors, where m is the number of edges in G We also show that the CRCW algorithm can be implemented on a CREW PRAM. The CREW algorithm runs in {{{{ OMICRON (log^2 m) expected time, but it requires only OMICRON (m / log m) processors.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.26 no.3
• /
• pp.58-66
• /
• 2003

The cut tree approach of Montreuil and Ratliff [16] and eigenvector approach [10] are used to automatically draw a feasible facility layout with aisle structure. The department arrangement can minimize an aisle distance criterion considering door locations and dimension constraints. The aisle distance is measured by the door to door distance between departments. An eigenvector and cut tree approaches [1] are implemented based on the branch and bound technique in Kim et al. [2] in order to obtain feasible layouts. Then, the algorithm to fix the door location of each department is developed. After the door locations are determined, the factory layout is evaluated in terms of aisle distance. The aisle structure is obtained by expanding the original layout. The solution is kept until we will find better factory layout. The proposed approach based on the branch and bound technique, in theory, will provide the optimal solution. If the runs are time and/or node limited, the proposed method is a strong heuristic. The technique is made further practical by the fact that the solution is constrained such that the rectangular shape dimensions length(l) and width(w) are fixed and a perfect fit is generated if a fit is possible.