• Journal of the Korea institute for structural maintenance and inspection
• /
• v.10 no.2
• /
• pp.123-133
• /
• 2006

The main objective of this study is to develop an optimization algorithm of framed structures with rigid and various semi-rigid connections using the multilevel dynamic programming and the sequential unconstrained minimization techniques (SUMT). The second-order elastic analysis is performed for steel framed structures. The second order elastic analysis is developed based on nonlinear beam-column theory considering the bowing effect. The following semi-rigid connections are considered; double web angle, top-seat angle and top-seat angle with web angle. We considered the three connection models, such as modified exponential, polynomial and three parameter model. The total weight of the structural steel is used as the objective function in the optimization process. The dimensions of steel cross section are selected as the design variables. The design constraints consist of strength requirements for axial, shear and flexural resistance and serviceability requirements.

• Journal of KIISE:Computing Practices and Letters
• /
• v.12 no.3
• /
• pp.192-207
• /
• 2006

Today, the SSL protocol has been used as core part in various computing environments or security systems. But, the SSL protocol has several problems, because of the rigidity on operating. First, SSL protocol brings considerable burden to the CPU utilization so that performance of the security service in encryption transaction is lowered because it encrypts all data which is transferred between a server and a client. Second, SSL protocol can be vulnerable for cryptanalysis due to the key in fixed algorithm being used. Third, it is difficult to add and use another new cryptography algorithms. Finally. it is difficult for developers to learn use cryptography API(Application Program Interface) for the SSL protocol. Hence, we need to cover these problems, and, at the same time, we need the secure and comfortable method to operate the SSL protocol and to handle the efficient data. In this paper, we propose the SSL component which is designed and implemented using CBD(Component Based Development) concept to satisfy these requirements. The SSL component provides not only data encryption services like the SSL protocol but also convenient APIs for the developer unfamiliar with security. Further, the SSL component can improve the productivity and give reduce development cost. Because the SSL component can be reused. Also, in case of that new algorithms are added or algorithms are changed, it Is compatible and easy to interlock. SSL Component works the SSL protocol service in application layer. First of all, we take out the requirements, and then, we design and implement the SSL Component, confidentiality and integrity component, which support the SSL component, dependently. These all mentioned components are implemented by EJB, it can provide the efficient data handling when data is encrypted/decrypted by choosing the data. Also, it improves the usability by choosing data and mechanism as user intend. In conclusion, as we test and evaluate these component, SSL component is more usable and efficient than existing SSL protocol, because the increase rate of processing time for SSL component is lower that SSL protocol's.

• Journal of Korean Society of Transportation
• /
• v.23 no.2
• /
• pp.117-130
• /
• 2005

In both deteministic user Optimal Traffic Assignment Model (UOTAM) and stochastic UOTAM, travel time, which is a major ccriterion for traffic loading over transportation network, is defined by the sum of link travel time and turn delay at intersections. In this assignment method, drivers actual route perception processes and choice behaviors, which can become main explanatory factors, are not sufficiently considered: therefore may result in biased traffic loading. Even though there have been some efforts in Stochastic UOTAM for reflecting drivers' route perception cost by assuming cumulative distribution function of link travel time, it has not been fundamental fruitions, but some trials based on the unreasonable assumptions of Probit model of truncated travel time distribution function and Logit model of independency of inter-link congestion. The critical reason why deterministic UOTAM have not been able to reflect route perception cost is that the route perception cost has each different value according to each origin, destination, and path connection the origin and destination. Therefore in order to find the optimum route between OD pair, route enumeration problem that all routes connecting an OD pair must be compared is encountered, and it is the critical reason causing computational failure because uncountable number of path may be enumerated as the scale of transportation network become bigger. The purpose of this study is to propose a method to enable UOTAM to reflect route perception cost without route enumeration between an O-D pair. For this purpose, this study defines a link as a least definition of path. Thus since each link can be treated as a path, in two links searching process of the link label based optimum path algorithm, the route enumeration between OD pair can be reduced the scale of finding optimum path to all links. The computational burden of this method is no more than link label based optimum path algorithm. Each different perception cost is embedded as a quantitative value generated by comparing the sub-path from the origin to the searching link and the searched link.

• Journal of Intelligence and Information Systems
• /
• v.19 no.4
• /
• pp.55-79
• /
• 2013

In this paper, we propose a hybrid genetic algorithm (HGA) approach to effectively solve the reverse logistics network with centralized centers (RLNCC). For the proposed HGA approach, genetic algorithm (GA) is used as a main algorithm. For implementing GA, a new bit-string representation scheme using 0 and 1 values is suggested, which can easily make initial population of GA. As genetic operators, the elitist strategy in enlarged sampling space developed by Gen and Chang (1997), a new two-point crossover operator, and a new random mutation operator are used for selection, crossover and mutation, respectively. For hybrid concept of GA, an iterative hill climbing method (IHCM) developed by Michalewicz (1994) is inserted into HGA search loop. The IHCM is one of local search techniques and precisely explores the space converged by GA search. The RLNCC is composed of collection centers, remanufacturing centers, redistribution centers, and secondary markets in reverse logistics networks. Of the centers and secondary markets, only one collection center, remanufacturing center, redistribution center, and secondary market should be opened in reverse logistics networks. Some assumptions are considered for effectively implementing the RLNCC The RLNCC is represented by a mixed integer programming (MIP) model using indexes, parameters and decision variables. The objective function of the MIP model is to minimize the total cost which is consisted of transportation cost, fixed cost, and handling cost. The transportation cost is obtained by transporting the returned products between each centers and secondary markets. The fixed cost is calculated by opening or closing decision at each center and secondary markets. That is, if there are three collection centers (the opening costs of collection center 1 2, and 3 are 10.5, 12.1, 8.9, respectively), and the collection center 1 is opened and the remainders are all closed, then the fixed cost is 10.5. The handling cost means the cost of treating the products returned from customers at each center and secondary markets which are opened at each RLNCC stage. The RLNCC is solved by the proposed HGA approach. In numerical experiment, the proposed HGA and a conventional competing approach is compared with each other using various measures of performance. For the conventional competing approach, the GA approach by Yun (2013) is used. The GA approach has not any local search technique such as the IHCM proposed the HGA approach. As measures of performance, CPU time, optimal solution, and optimal setting are used. Two types of the RLNCC with different numbers of customers, collection centers, remanufacturing centers, redistribution centers and secondary markets are presented for comparing the performances of the HGA and GA approaches. The MIP models using the two types of the RLNCC are programmed by Visual Basic Version 6.0, and the computer implementing environment is the IBM compatible PC with 3.06Ghz CPU speed and 1GB RAM on Windows XP. The parameters used in the HGA and GA approaches are that the total number of generations is 10,000, population size 20, crossover rate 0.5, mutation rate 0.1, and the search range for the IHCM is 2.0. Total 20 iterations are made for eliminating the randomness of the searches of the HGA and GA approaches. With performance comparisons, network representations by opening/closing decision, and convergence processes using two types of the RLNCCs, the experimental result shows that the HGA has significantly better performance in terms of the optimal solution than the GA, though the GA is slightly quicker than the HGA in terms of the CPU time. Finally, it has been proved that the proposed HGA approach is more efficient than conventional GA approach in two types of the RLNCC since the former has a GA search process as well as a local search process for additional search scheme, while the latter has a GA search process alone. For a future study, much more large-sized RLNCCs will be tested for robustness of our approach.

• 한국해양학회지
• /
• v.27 no.4
• /
• pp.332-341
• /
• 1992

한반도 주변의 정규적인 해양관측 효시는 1910년대로부터 시작된다. 1915년 6월부 터 원산, 부산 등 12개 항구의 중앙부에서 10일 간격으로 해양관측이 시작되었으며, 1916년 7월부터는 거문도 해야 어청도 등 10개 등대관측소에서 연안정지관측을 역일로 시작했고, 1917년 5월부터 정선해양관측이 이루어 졌는데 이들은 총독부 수산과에서 수산시험조사사업의 일환으로 수행되었고 1921년부터 총독부수산 시험장에서 이들을 더욱 발전다. 1930년대에는 정선해양관측이 매월 초순 각 도별로 수항되어 가장 훌륭 한 관측결과가 생산되었다. 1961년부터는 항구관측을 폐지하고 연안정지관측과 정선해 양관측만 이루어 지고 있으며 해양조사선을 20여개로 수정하여 2개월마다 조사에 임하 고 있다. 이들은 기본적으로 해양생물자원의 경제적 획득에 목적을 두고 있으나 자료 를 널리 공개하여 전세계의 어느 해양연구자들도 이용할 수 있도록 하고 있다. 1960년 부터는 우리 나라 연안의 조석관측도 연속적으로 수행되고 있다. 1990년 현재 21개 정 선해양관측자료와 42개의 연안정지관측자료, 매일의 표면수온분포도 21개의 평균해면 자료가 공개적으로 이용가능하다. 앞으로 유명한 연구소일수록 해양관측자료를 공개하 여 공동이용할 수 있어야 하며 해양관측의 활성화를 위해 첫째 해양관측기구를 소모품 으로 취급할 것이 요구되고, 둘째 관측선 요원의 정당한 처우가 이루어져야 하며, 셋 째 세계적인 해양조사 사업은 국가기관에서 더욱 성실히 수행될 수 있도록 여건을 조 성할 필요가 있다. 과거에는 어업활동을 위해 해양조사가 현재에는 기후변동연구에 중 요한 자료로도 이용되고 있으므로 우리는 우리주변의 해양관측을 미래학문의 기초자료 로 끊임없이 수행해야 할 중차대한 임무를 지니고 있다.는 대체로 Weddell Sea쪽에서 남동쪽으로 가면서 증가하며, 영 양염 농도가 낮은 얼음 녹은 물의 유입이 얼룩소 a의 농도를 감소시키는 것으로 사료 된다.되어, 경기만에서 출현하는 식물플랑크톤이 서해 중동부 연안수역에서 출현하는 식물 플랑크톤보다 상대적으로 낮은 광에 적응되어 있었다. the most important in the global optimum analysis because small variation of it results in the large change of the objective function, the sum of squares of deviations of the observed and computed groundwater levels. 본 논문에서는 가파른 산사면에서 산사태의 발생을 예측하기 위한 수문학적 인 지하수 흐름 모델을 개발하였다. 이 모델은 물리적인 개념에 기본하였으며, Lumped-parameter를 이용하였다. 개발된 지하수 흐름 모델은 두 모델을 조합하여 구성되어 있으며, 비포화대 흐름을 위해서는 수정된 abcd 모델을, 포화대 흐름에 대해서는 시간 지체 효과를 고려할 수 있는 선형 저수지 모델을 이용하였다. 지하수 흐름 모델은 토층의 두께, 산사면의 경사각, 포화투수계수, 잠재 증발산 량과 같은 불확실한 상수들과 a, b, c, 그리고 K와 같은 자유모델변수들을 가진다. 자유모델변수들은 유입-유출 자료들로부터 평가할 수 있으며, 이를 위해서 본 논문에서는 Gauss-Newton 방법을 이용한 Bard 알고리즘을 사용하였다. 서울 구로구 시흥동 산사태 발생 지역의 산사면에 대하여 개발된 모델을 적용하여 예제 해석을 수행함으로써, 지하수 흐름 모델이 산사태 발생 예측을 위하여 이용할 수 있음을 입증하였다.

• KIPS Transactions on Computer and Communication Systems
• /
• v.9 no.11
• /
• pp.256-264
• /
• 2020

Industrial Wireless Sensor Networks (IWSNs) is exploited to achieve various objectives such as improving productivity and reducing cost in the diversity of industrial application, and it has requirements such as low-delay and high reliability packet transmission. To accomplish the requirement, the network manager performs graph construction and resource allocation about network topology, and determines the transmission cycle and path of each node in advance. However, this network management scheme cannot treat mobile devices that cause continuous topology changes because graph reconstruction and resource reallocation should be performed as network topology changes. That is, despite the growing need of mobile devices in many industries, existing scheme cannot adequately respond to path failure caused by movement of mobile device and packet loss in the process of path recovery. To solve this problem, a network management scheme is required to prevent packet loss caused by mobile devices. Thus, we analyse the location and movement cycle of mobile devices over time using machine learning for predicting the mobility pattern. In the proposed scheme, the network manager could prevent the problems caused by mobile devices through performing graph construction and resource allocation for the predicted network topology based on the movement pattern. Performance evaluation results show a prediction rate of about 86% compared with actual movement pattern, and a higher packet delivery ratio and a lower resource share compared to existing scheme.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.29 no.2
• /
• pp.179-185
• /
• 2016

In this paper numerical stability of CSS and ISS schemes in axisymmetric fluid-structure-burning simulation for solid rocket motors are studied. The implemented CSS and ISS algorithms for two-dimensional axisymmetric FSI problems are used to analyze ACM and BCM solid rocket motors. Numerical results from CSS and ISS schemes are compared to investigate the efficacy of ISS scheme over CSS scheme in stabilizing the numerical solution. The ACM and BCM simulation results show that ISS scheme gives stable and converged numerical solutions with appropriately small system time step size, while CSS scheme fails to converge after generating rapidly amplified oscillatory solutions. It is concluded that ISS scheme can be useful in improving the numerical stability of FSI analysis for ACM and BCM solid rocket motor simulations, which is not successfully obtained with CSS scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.11
• /
• pp.730-742
• /
• 2014

In the case of On-demand routing protocol in cognitive radio ad-hoc networks, broadcasting of control packets may occur common control channel overload and packet collisions during the routing procedure. This situation is to increase the overhead of path finding and also limited to find the accurate and reliable path. Since reliable channel and path finding is restricted, path life time is shorten and path reliability is reduced. In this paper, we propose a new routing algorithm that reduces control channel overhead and increases path life time by considering the probability of appearance of primary user and channel status of neighbor nodes. Each node performs periodic local sensing to detect primary user signal and to derive primary user activity patterns. The probability of primary appearance on the current channel and the channel status can be obtained based on the periodic sensing. In addition, each node identifies the quality of the channel by message exchange through a common channel with neighbor nodes, then determines Link_Levels with neighbor nodes. In the proposed method, the Link Level condition reduces the number of control messages that are generated during the route discovery process. The proposed method can improve path life time by choosing a path through Path_Reliability in which stability and quality are weighted depending on the location. Through simulation, we show that our proposed algorithm reduces packet collisions and increases path life time in comparison with the traditional algorithm.

• Journal of Radiation Protection and Research
• /
• v.21 no.3
• /
• pp.147-153
• /
• 1996

The Korea Atomic Energy Research Institute(KAERI) conducted a intercomparison study for personnel dosimetry services in Korea to enhance the accuracy and precision of the dosimetry system. Nine types of dosimeters(6 TLD, 3 film badge) from 7 institutions took part in this intercomparison study. Each participant submitted 30 dosimeters including transit control for irradiations. Both TLDs and film badges were irradiated with Cs-137 gamma, Sr/Y-90 beta and 4 X-ray beams in ISO wide series. Four dosimeters were irradiated on phantom with same dose equivalent for each field category. The delivered dose equivalent was in the range of $0.1{\sim}10mSv$. The participants assessed the results of their dosimeter readings in terms of the ICRU operational quantities for personal monitoring, Hp(10) and Hp(0.07). Most participants except 1 dosimeter estimated the delivered dose equivalent with biases less than ${\pm}25%$ for Cs-137 and Sr/Y-90. But for X-rays, the biases exceeded ${\pm}35%$ in some cases bacause the dose evaluation algorithm was based on the ANSI N13.11 X-ray fields which are different from those given by ISO.

• Journal of Energy Engineering
• /
• v.29 no.3
• /
• pp.64-73
• /
• 2020

This paper presented a methodology for calculating daily load curves per city by taking into account the charging/discharging location of electric vehicle. In other words, this is the daily load curve calculation algorithm by city, which takes into account the charging/discharging location of electric vehicles, so that the impact of loads generated by charging/discharging of electric vehicles on the power grid can be easily understood in certain cities. Specifically, in accordance with the PEVs share scenario, the PEVs discharge power was calculated to reflect both the characteristics of the arriving vehicle in the morning and the SMP plan after establishing a assumption that the electric vehicle arrived at work in the morning and the electric vehicle arrived at home in the afternoon for each of the charging/discharging locations, that is, work and home, of electric vehicles in the city. After calculating the daily load curve for each charging/discharging power type for the PEVs charging strategy, which takes into account both the characteristics of the vehicle arriving at home in the afternoon and the TOU fare system, it was analyzed by comparing the impact assessment on the grid by adding the existing load.