• Journal of the Korean Society of Industry Convergence
• /
• v.25 no.6_2
• /
• pp.1071-1081
• /
• 2022

As the demand for high-rise buildings increases, the demand for high-speed elevators is also increasing. In order to make a high-speed elevator, a method is needed to reduce the weight of the elevator's components, which is a constraint on the increase in speed. As a measure to reduce the weight, it is possible to remove the traveling cable for power and signal supply. Since the weight of the traveling cable varies depending on the position of the carriage, it is difficult to compensate the weight using the counter weight. The power supply is a structure in which a brush-rail type power input terminal is installed in the elevator hoistway to receive power in a contact-type manner while the carriage is moving. If a small-capacity ESS is installed in a passenger car, power can be supplied uninterruptedly inside the passenger car. A small-capacity ESS charging system to be applied to such an elevator system is required to perform several functions. First, the passenger Car must be able to charge as much as possible even during high-speed operation. A control algorithm with high responsiveness is required because charging starts and ends repeatedly by the partially installed input power stage. In addition, if the input-side line impedance is large due to the structure of the system and the response characteristic is increased, the stability of the system may be lowered. Accordingly, in this paper, we propose a control algorithm that has a stable steady-state output while having a fast response in a transient state. To verify the proposed control algorithm, simulation was conducted using PSIM, and the performance of the controller was verified by manufacturing a prototype buck conveter charger.

• Journal of Korean Society of Steel Construction
• /
• v.12 no.5 s.48
• /
• pp.475-485
• /
• 2000

In this study, an automated optimum design program for steel box girder bridges has been developed for the optimum design of composite steel box girder bridges. The design constraints required for the optimum design of steel box girder bridges are based on the Korean standard bridge specification. Considering characteristics of steel box girder bridges, several approximation techniques, such as artificial constraint deletion, variable linking and stress reanalysis technique etc. are also introduced to enhance the efficiency of optimization. The developed program is mainly composed of major sub-system modules including structural analysis module using commercial structural analysis program such as RM-SPACEFRAME, optimum design module, pre-process module for friendly user input, and post-processor module for office automation. In addition, in order to demonstrate the efficiency and applicability of the developed optimum design program for steel box girder bridges, a few numerical examples are applied. Based on the results of the application, it may be stated that the automatic optimum design program developed in this study can be a prototype model for the developement of optimum design program for other type of bridge.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.12C
• /
• pp.1020-1028
• /
• 2010

Relay has attracted great attention due to its inherent capability to extend the service coverage and combat shadowing in next generation mobile communication systems. So far, most relay technologies have been developed under the half-duplex (HD) constraint that prevents relays from transmitting and receiving at the same time. Although half-duplex relay (HDR) is easy to implement, it requires partitioning of resource for transmission and reception, reducing the whole system capacity. In this paper, we propose a multinser precoding and power control scheme with sum rate matching for a full-duplex (FD) multiple-input multiple-output (MIMO) relay. Full-duplex relay (FDR) can overcome the drawback of HDR by transmitting and receiving on the same frequency at the same time, while it is crucial to reduce the effect of self-interference that is caused by its own transmitter to its own receiver. The proposed precoding scheme cancels the self-interference of the FDR as well as to support multiuser MIMO. Moreover, we suggest a power allocation scheme for FD MIMO relay with the constraint that the sum rate of the relay's received data streams is equal to that of the relay's transmit data streams.

• Journal of Communications and Networks
• /
• v.15 no.5
• /
• pp.476-485
• /
• 2013

In this paper, the effective capacity of a multiple-input multiple-output (MIMO) system in two different cases with receive antenna selection (RAS) and transmit antenna selection (TAS) schemes is investigated. A closed-form solution for the maximum constant arrival rate of this network with statistical delay quality of service (QoS) constraint is extracted in the quasi-static fading channel. This study is conducted in two different cases.When channel state information (CSI) is not available at the MIMO transmitter, implementation of TAS is difficult. Therefore, RAS scheme is employed and one antenna with the maximum instantaneous signal to noise ratio is chosen at the receiver. On the other hand, when CSI is available at the transmitter, TAS scheme is executed. In this case, one antenna is selected at the transmitter. Moreover, an optimal power-control policy is applied to the selected antenna and the effective capacity of the MIMO system is derived. Finally, this optimal power adaptation and the effective capacity are investigated in two asymptotic cases with the loose and strict QoS requirements. In particular, we show that in the TAS scheme with the loose QoS restriction, the effective capacity converges to the ergodic capacity. Then, an exact closed-form solution is obtained for the ergodic capacity of the channel here.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.8
• /
• pp.3-9
• /
• 2015

Under the maximum transmit power constraint and the minimum rate constraint, we propose the optimal number of transmit antennas and transmit power which maximize energy-efficiency (EE) in multi-user multiple-input multiple-output (MIMO) downlink system with the maximal ratio transmission (MRT) precoding. Because the optimization problem for the instantaneous channel is difficult to solve, we use independence of individual channel, average channel gain and path loss to approximate the objective function. Since the approximated EE optimization problem is two-dimensional search problem, we find the optimal number of transmit antennas and transmit power using Lagrange multipliers and our proposed algorithm. Simulation results show that the number of transmit antennas and power obtained by proposed algorithm are almost identical to the value by the exhaustive search.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.18 no.6
• /
• pp.75-82
• /
• 2018

In this paper, we consider a precoder design for downlink multiuser multiple-input multiple-output (MU-MIMO) in distributed antenna systems (DAS). In DAS, remote radio heads (RRHs) are placed at geographically different locations within a cell area. Three different precoder design schemes are proposed to maximize the separate or joint signal-to-leakage-plus-noise ratio (SLNR) metrics by considering RRH sum power or per-RRH power constraints. The analytical closed-form form solution for each optimization problem is presented. Through computer simulation, we show that the joint SLNR based precoding schemes have better signal-to-interference-plus-noise ratio (SINR) and bit error rate (BER) performances than the separate SLNR based schemes. Also, it is shown that the precoding scheme with RRH sum power constraint has better performance than the precoding scheme with per-RRH power constraint.

• Proceedings of the Korean Society for Bioinformatics Conference
• /
• 2005.09a
• /
• pp.267-271
• /
• 2005

The goal of data mining is to extract new and useful knowledge from large scale datasets. As the amount of available data grows explosively, it became vitally important to develop faster data mining algorithms for various types of data. Recently, an interest in developing data mining algorithms that operate on graphs has been increased. Especially, mining frequent patterns from structured data such as graphs has been concerned by many research groups. A graph is a highly adaptable representation scheme that used in many domains including chemistry, bioinformatics and physics. For example, the chemical structure of a given substance can be modelled by an undirected labelled graph in which each node corresponds to an atom and each edge corresponds to a chemical bond between atoms. Internet can also be modelled as a directed graph in which each node corresponds to an web site and each edge corresponds to a hypertext link between web sites. Notably in bioinformatics area, various kinds of newly discovered data such as gene regulation networks or protein interaction networks could be modelled as graphs. There have been a number of attempts to find useful knowledge from these graph structured data. One of the most powerful analysis tool for graph structured data is frequent subgraph analysis. Recurring patterns in graph data can provide incomparable insights into that graph data. However, to find recurring subgraphs is extremely expensive in computational side. At the core of the problem, there are two computationally challenging problems. 1) Subgraph isomorphism and 2) Enumeration of subgraphs. Problems related to the former are subgraph isomorphism problem (Is graph A contains graph B?) and graph isomorphism problem(Are two graphs A and B the same or not?). Even these simplified versions of the subgraph mining problem are known to be NP-complete or Polymorphism-complete and no polynomial time algorithm has been existed so far. The later is also a difficult problem. We should generate all of 2$^n$ subgraphs if there is no constraint where n is the number of vertices of the input graph. In order to find frequent subgraphs from larger graph database, it is essential to give appropriate constraint to the subgraphs to find. Most of the current approaches are focus on the frequencies of a subgraph: the higher the frequency of a graph is, the more attentions should be given to that graph. Recently, several algorithms which use level by level approaches to find frequent subgraphs have been developed. Some of the recently emerging applications suggest that other constraints such as connectivity also could be useful in mining subgraphs : more strongly connected parts of a graph are more informative. If we restrict the set of subgraphs to mine to more strongly connected parts, its computational complexity could be decreased significantly. In this paper, we present an efficient algorithm to mine frequent subgraphs that are more strongly connected. Experimental study shows that the algorithm is scaling to larger graphs which have more than ten thousand vertices.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.37 no.4
• /
• pp.80-89
• /
• 2000

In this paper, we propose a new CPLD technology mapping algorithm for sequential circuit under time constraints. The algorithm detects feedbacks of sequential circuit, separate each feedback variables into immediate input variable, and represent combinational part into DAG. Also, among the nodes of the DAG, the nodes that the number of outdegree is more than or equal to 2 is not separated, but replicated from the DAG, and reconstructed to fanout-free-tree. To use this construction method is for reason that area is less consumed than the TEMPLA algorithm to implement circuits, and process time is improved rather than TMCPLD within given time constraint. Using time constraint and delay of device the number of partitionable multi-level is defined, the number of OR terms that the initial costs of each nodes is set to and total costs that the$^1$costs is set to after merging nodes is calculated, and the nodes that the number of OR terms of CLBs that construct CPLD is excessed is partitioned and is reconstructed as subgraphs. The nodes in the partitioned subgraphs is merged through collapsing, and the collapsed equations is performed by bin packing so that it fit to the number of OR terms in the CLBs of a given device. In the results of experiments to MCNC circuits for logic synthesis benchmark, we can shows that proposed technology mapping algorithm reduces the number of CLBs by 15.58% rather than the TEMPLA, and reduces process time rather than the TMCPLD.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.1
• /
• pp.224-234
• /
• 2000

In this paper, we propose a new CPLD technology mapping algorithm for sequential circuit under time constraints. The algorithm detects feedbacks of sequential circuit, separate each feedback variables into immediate input variable, and represent combinational part into DAG. Also, among the nodes of the DAG, the nodes that the number of outdegree is more than or equal to 2 is not separated, but replicated from the DAG, and reconstructed to fanout-free-tree. To use this construction method is for reason that area is less consumed than the TEMPLA algorithm to implement circuits, and process time is improved rather than TMCPLD within given time constraint. Using time constraint and delay of device the number of partitionable multi-level is defined, the number of OR terms that the initial costs of each nodes is set to and total costs that the costs is set to after merging nodes is calculated, and the nodes that the number of OR terms of CLBs that construct CPLD is excessed is partitioned and is reconstructed as subgraphs. The nodes in the partitioned subgraphs is merged through collapsing, and the collapsed equations is performed by bin packing so that if fit to the number of OR terms in the CLBs of a given device. In the results of experiments to MCNC circuits for logic synthesis benchmark, we can shows that proposed technology mapping algorithm reduces the number of CLBs bu 15.58% rather than the TEMPLA, and reduces process time rather than the TMCPLD.

• Journal of the Korea Society for Simulation
• /
• v.21 no.3
• /
• pp.79-88
• /
• 2012

Recently, the study in efficient operation, maintenance, and equipment-design have been growing rapidly in military industry to meet the required missions. Through out these studies, the importance of Concurrent Spare Parts(CSP) are emphasized. The CSP, which is critical to the operation and maintenance to enhance the availability, is offered together when a equipment is delivered. Despite its significance, th responsibility for determining the range and depth of CSP are done from administrative decision rather than engineering analysis. The purpose of the paper is to optimize the number of CSP per item using simulation and multiple regression. First, the result, as the change of operational availability, was gained from changing the number of change in simulation model. Second, mathematical regression was computed from the input and output data, and the number of CSP was optimized by multiple regression and linear programming; the constraint condition is the cost for optimization. The advantage of this study is to respond with the transition of constraint condition quickly. The cost per item is consistently altered in the development state of equipment. The speed of analysis, that simulation method is continuously performed whenever constraint condition is repeatedly altered, would be down. Therefore, this study is suitable for real development environment. In the future, the study based on the above concept improves the accuracy of optimization by the technical progress of multiple regression.