Journal of the Korea Academia-Industrial cooperation Society
/
v.18
no.2
/
pp.324-334
/
2017
The simulators for a plant unit master control (UMC) developed by domestic or overseas researchers have been developed for operator-training purposes. UMC simulators normally constructed at the end of the plant construction, despite the UMC logics, should be simulated to pre-check many signal interfaces within the power generation systems. Because of the differences in construction schedule, it is difficult for logic designers or commissioning engineers to simulate the UMC logic during the design or commissioning stage. In this background, this paper proposes a simulation method that can be used easily by plant logic designers or operators in the MATLAB Simulink programming environment. The core of the UMC is realized with a unique simulation algorithm based on mathematical analysis and functional blocks combination. In addition, an integer-based configuration was proposed to realize the plant target value control for the equipment in the logic. With these simulation methods, functions, e.g., load distribution, high-low limitations, frequency compensation, etc. were simulated. The results showed that the plant UMC logic can be simulated in Simulink without a plant simulator. The various functions proposed in this paper can provide useful information about Simulink-based simulation design for plant logic designers or commissioning engineers during the power plant construction period.
Large scale secular registry or surveillance systems have been accumulating vast data that allow mathematical modeling of cancer incidence and mortality rates. Most contemporary models in this regard use time series and APC (age-period-cohort) methods and focus primarily on predicting or analyzing cancer epidemiology with little attention being paid to implications for designing cancer registry, surveillance or evaluation initiatives. This research models age-specific cancer incidence rates using logistic growth equations and explores their performance under different scenarios of data completeness in the hope of deriving clues for reshaping relevant data collection. The study used China Cancer Registry Report 2012 as the data source. It employed 3-parameter logistic growth equations and modeled the age-specific incidence rates of all and the top 10 cancers presented in the registry report. The study performed 3 types of modeling, namely full age-span by fitting, multiple 5-year-segment fitting and single-segment fitting. Measurement of model performance adopted adjusted goodness of fit that combines sum of squred residuals and relative errors. Both model simulation and performance evalation utilized self-developed algorithms programed using C# languade and MS Visual Studio 2008. For models built upon full age-span data, predicted age-specific cancer incidence rates fitted very well with observed values for most (except cervical and breast) cancers with estimated goodness of fit (Rs) being over 0.96. When a given cancer is concerned, the R valuae of the logistic growth model derived using observed data from urban residents was greater than or at least equal to that of the same model built on data from rural people. For models based on multiple-5-year-segment data, the Rs remained fairly high (over 0.89) until 3-fourths of the data segments were excluded. For models using a fixed length single-segment of observed data, the older the age covered by the corresponding data segment, the higher the resulting Rs. Logistic growth models describe age-specific incidence rates perfectly for most cancers and may be used to inform data collection for purposes of monitoring and analyzing cancer epidemic. Helped by appropriate logistic growth equations, the work vomume of contemporary data collection, e.g., cancer registry and surveilance systems, may be reduced substantially.
Mobile P2P protocols in ad-hoc networks have gained large attention recently. Although there has been much research on P2P algorithms for wired networks, existing P2P protocols are not suitable for mobile ad-hoc networks because they do not consider mobility of peers. This study proposes a new cluster-based P2P protocol for ad hoc networks which utilizes peer mobility. In typical cluster-based P2P algorithms, each cluster has a super peer and other peers of the cluster register their file list to the super peer. High mobility peers would cause a lot of file list registration traffic because they hand-off between clusters frequently. In the proposed scheme, while peers with low mobility behave in the same way as the peers of the typical cluster-based P2P schemes, peers with high mobility behave differently. They inform their entrance to the cluster region to the super peer but they do not register their file list to the super peer. When a peer wishes to find a file, it first searches the registered file list of the super peer and if fails, query message is broadcasted. We perform mathematical modeling, analysis and optimization of the proposed scheme regarding P2P traffic and associated routing traffic. Numerical results show that the proposed scheme performs much better than or similar to the typical cluster-based P2P scheme and flooding based Gnutella.
This work aims to introduce the concept of microcomputer aided port design simulation methodology including the analysis of the mathematical models to be implemented and apply it to the Third Stage Busan Port Development Project. In the Busan case study, the size of the proposed turning basin of the new terminal, together with the operational strategies of berthing and unberthing, was examined, In addition, the safety on ship's entry and exit through the projected new breakwaters was ascertained. From the application of simulation to the Busan project, it was found that the proposed dredging area was not sufficiently wide enough for the modelled container ship to perform A time unberthing (in which the ship turns to port as she manoeuvres away from N.1. Berth with the assistance of tugs), especially in a strong easterly wind. It is therefore, recommended that Busan pilots should be advised to sue B type unberthing strategy, in which the ship goes astern from no.1 berth tot he turning area in front of No.2 berth(where the ship turns 180 degrees clockwise), especially when the wind is very strong, It is also recommended that a sea buoy be placed outside the new breakwaters, as this was found to improve the safety of ship manoeuvres through the breakwaters significantly . Another recommendation is that the Korean hydrodynamic Office carry out a detailed survey of the currents in the water area near the new breakwaters once they have been constructed. In addition, it is to be recommended that a current meter be placed at the recommended sea buoy to improve the safety of ship manoeuvres which could otherwise be jeopardised by eeroneos current information.
The moisture content of sawdust must be measured accurately and controlled appropriately during storage and transportation because biological degradation could be caused by improper moisture. In this study, to measure the moisture contents of Larix kaempferi sawdust, the near-infrared reflectance spectra (Wavelength 1000-2400 nm) of sawdust were used as detection parameter. After acquiring the NIR reflection spectrum of specimens which were humidified at each relative humidity condition ($25^{\circ}C$, RH 30~99%), moisture content prediction model was developed using mathematical preprocessings (e.g. smoothing, standard normal variate) and partial least squares (PLS) analysis with the acquired spectrum data. High reliability of the MC regression model with NIR spectroscopy was verified by cross validation test ($R^2$ = 0.94, RMSEP = 1.544). The results of this study show that NIR spectroscopy could be used as a convenient and accurate method for the nondestructive determination of moisture content of sawdust, which could lead to optimize wood utilization.
Journal of the Earthquake Engineering Society of Korea
/
v.3
no.3
/
pp.63-74
/
1999
A sliding mode fuzzy control (SMFC) algorithm is presented for vibration of large structures. Rule-base of the fuzzy inference engine is constructed based on the sliding mode control, which is one of the nonlinear control algorithms. Fuzziness of the controller makes the control system robust against the uncertainties in the system parameters and the input excitation. Non-linearity of the control rule makes the controller more effective than linear controllers. Design procedure based on the present fuzzy control is more convenient than those of the conventional algorithms based on complex mathematical analysis, such as linear quadratic regulator and sliding mode control(SMC). Robustness of presented controller is illustrated by examining the loop transfer function. For verification of the present algorithm, a numerical study is carried out on the benchmark problem initiated by the ASCE Committee on Structural Control. To achieve a high level of realism, various aspects are considered such as actuator-structure interaction, modeling error, sensor noise, actuator time delay, precision of the A/D and D/A converters, magnitude of control force, and order of control model. Performance of the SMFC is examined in comparison with those of other control algorithms such as $H_{mixed 2/{\infty}}$ optimal polynomial control, neural networks control, and SMC, which were reported by other researchers. The results indicate that the present SMFC is an efficient and attractive control method, since the vibration responses of the structure can be reduced very effectively and the design procedure is simple and convenient.
This research develops tools and strategies for optimizing RC column sections applied in tall buildings. Optimization parameters are concrete strength and section shape, the objective function for which is subject to several predefined constraints drawn from the original structural design. For this purpose, we developed new components for StrAuto, a parametric modeling and optimization tool for building structure. The components receive from external analysis solvers member strengths calculated from the original design model, and output optimized column sections satisfying the minimum cost. Using these components, optimized sections are firstly obtained for each predefined concrete strength applied to the whole floors in the project building. The obtained results for each concrete strength are comparatively examined to determine the fittest sections which will also result in the fittest vertical zoning for concrete strength. The main optimization scenario for this is to search for the vertical levels where the identical optimized sections coincide for the two different concrete strengths in concern, and select those levels for the boundaries where a concrete strength will be changed to another. The optimization process provided in this research is a product of an intensive development designed for a specific member in a specific project. Thus, the algorithm suggested takes on a microscopic and mathematical approach. However, the technique has a lot of potential that it can further be extensively developed and applied for future projects.
The Journal of the Institute of Internet, Broadcasting and Communication
/
v.17
no.6
/
pp.69-78
/
2017
Shannon of the 5G smartphone and Fourier of the signal processing meet in the sampling theorem (2 times the highest frequency 1). In this paper, the initial Shannon Theorem finds the Shannon capacity at the point-to-point, but the 5G shows on the Relay channel that the technology has evolved into Multi Point MIMO. Fourier transforms are signal processing with fixed parameters. We analyzed the performance by proposing a 2N-1 multivariate Fourier-Jacket transform in the multimedia age. In this study, the authors tackle this signal processing complexity issue by proposing a Jacket-based fast method for reducing the precoding/decoding complexity in terms of time computation. Jacket transforms have shown to find applications in signal processing and coding theory. Jacket transforms are defined to be $n{\times}n$ matrices $A=(a_{jk})$ over a field F with the property $AA^{\dot{+}}=nl_n$, where $A^{\dot{+}}$ is the transpose matrix of the element-wise inverse of A, that is, $A^{\dot{+}}=(a^{-1}_{kj})$, which generalise Hadamard transforms and centre weighted Hadamard transforms. In particular, exploiting the Jacket transform properties, the authors propose a new eigenvalue decomposition (EVD) method with application in precoding and decoding of distributive multi-input multi-output channels in relay-based DF cooperative wireless networks in which the transmission is based on using single-symbol decodable space-time block codes. The authors show that the proposed Jacket-based method of EVD has significant reduction in its computational time as compared to the conventional-based EVD method. Performance in terms of computational time reduction is evaluated quantitatively through mathematical analysis and numerical results.
Journal of The Korean Association of Information Education
/
v.11
no.3
/
pp.339-347
/
2007
Along with developments of information and communication technologies, internet has spread not only all over the society, but also our everyday life deeply. Recently, requirements for e-learning using internet in the educational aspect have a great influence on the changes of school educations. Cyber Home Learning System, in particular, has been implemented throughout the nation for the purpose of reducing private expenditure for education and promoting substantial improvements in quality of public education. However, there have been exposed many problems with respect to quality of operations and managements of the system comparing to its quantitative growth, and so, at this point in time, researcher conducted analysis of actuality of perceptions of both elementary and middle school teachers with a focus on the case of S System in K province. To test this, total 278 participants were sampled from the elementary schools (139 teachers) and the middle schools (139 teachers) located in K province and were asked to complete a survey and the results therefrom were analyzed accordingly. Results from the analyses revealed that elementary school teachers responded more positively than other respondents in the most areas, including supply of a variety of learning contents of S System, quality of contents, and providing for helps insomuch as to complement school works, etcetera. In addition, researcher has found out that, to make the system become all the more efficient, it shall be required to establish a strategy in order to induce students' interest in the system, as well as to construct infrastructure for facilitating the use of computer. And that there are also needs for continuous supports from both the school and the education authority concerned, and for method of flexible operation of curriculum.
Journal of the Korean Institute of Intelligent Systems
/
v.14
no.3
/
pp.253-261
/
2004
Game theory is mathematical analysis developed to study involved in making decisions. In 1928, Von Neumann proved that every two-person, zero-sum game with finitely many pure strategies for each player is deterministic. As well, in the early 50's, Nash presented another concept as the basis for a generalization of Von Neumann's theorem. Another central achievement of game theory is the introduction of evolutionary game theory, by which agents can play optimal strategies in the absence of rationality. Not the rationality but through the process of Darwinian selection, a population of agents can evolve to an Evolutionary Stable Strategy (ESS) introduced by Maynard Smith. Keeping pace with these game theoretical studies, the first computer simulation of co-evolution was tried out by Hillis in 1991. Moreover, Kauffman proposed NK model to analyze co-evolutionary dynamics between different species. He showed how co-evolutionary phenomenon reaches static states and that these states are Nash equilibrium or ESS introduced in game theory. Since the studies about co-evolutionary phenomenon were started, however many other researchers have developed co-evolutionary algorithms, in this paper we propose Game theory based Co-Evolutionary Algorithm (GCEA) and confirm that this algorithm can be a solution of evolutionary problems by searching the ESS.To evaluate newly designed GCEA approach, we solve several test Multi-objective Optimization Problems (MOPs). From the results of these evaluations, we confirm that evolutionary game can be embodied by co-evolutionary algorithm and analyze optimization performance of GCEA by comparing experimental results using GCEA with the results using other evolutionary optimization algorithms.
본 웹사이트에 게시된 이메일 주소가 전자우편 수집 프로그램이나
그 밖의 기술적 장치를 이용하여 무단으로 수집되는 것을 거부하며,
이를 위반시 정보통신망법에 의해 형사 처벌됨을 유념하시기 바랍니다.
[게시일 2004년 10월 1일]
이용약관
제 1 장 총칙
제 1 조 (목적)
이 이용약관은 KoreaScience 홈페이지(이하 “당 사이트”)에서 제공하는 인터넷 서비스(이하 '서비스')의 가입조건 및 이용에 관한 제반 사항과 기타 필요한 사항을 구체적으로 규정함을 목적으로 합니다.
제 2 조 (용어의 정의)
① "이용자"라 함은 당 사이트에 접속하여 이 약관에 따라 당 사이트가 제공하는 서비스를 받는 회원 및 비회원을
말합니다.
② "회원"이라 함은 서비스를 이용하기 위하여 당 사이트에 개인정보를 제공하여 아이디(ID)와 비밀번호를 부여
받은 자를 말합니다.
③ "회원 아이디(ID)"라 함은 회원의 식별 및 서비스 이용을 위하여 자신이 선정한 문자 및 숫자의 조합을
말합니다.
④ "비밀번호(패스워드)"라 함은 회원이 자신의 비밀보호를 위하여 선정한 문자 및 숫자의 조합을 말합니다.
제 3 조 (이용약관의 효력 및 변경)
① 이 약관은 당 사이트에 게시하거나 기타의 방법으로 회원에게 공지함으로써 효력이 발생합니다.
② 당 사이트는 이 약관을 개정할 경우에 적용일자 및 개정사유를 명시하여 현행 약관과 함께 당 사이트의
초기화면에 그 적용일자 7일 이전부터 적용일자 전일까지 공지합니다. 다만, 회원에게 불리하게 약관내용을
변경하는 경우에는 최소한 30일 이상의 사전 유예기간을 두고 공지합니다. 이 경우 당 사이트는 개정 전
내용과 개정 후 내용을 명확하게 비교하여 이용자가 알기 쉽도록 표시합니다.
제 4 조(약관 외 준칙)
① 이 약관은 당 사이트가 제공하는 서비스에 관한 이용안내와 함께 적용됩니다.
② 이 약관에 명시되지 아니한 사항은 관계법령의 규정이 적용됩니다.
제 2 장 이용계약의 체결
제 5 조 (이용계약의 성립 등)
① 이용계약은 이용고객이 당 사이트가 정한 약관에 「동의합니다」를 선택하고, 당 사이트가 정한
온라인신청양식을 작성하여 서비스 이용을 신청한 후, 당 사이트가 이를 승낙함으로써 성립합니다.
② 제1항의 승낙은 당 사이트가 제공하는 과학기술정보검색, 맞춤정보, 서지정보 등 다른 서비스의 이용승낙을
포함합니다.
제 6 조 (회원가입)
서비스를 이용하고자 하는 고객은 당 사이트에서 정한 회원가입양식에 개인정보를 기재하여 가입을 하여야 합니다.
제 7 조 (개인정보의 보호 및 사용)
당 사이트는 관계법령이 정하는 바에 따라 회원 등록정보를 포함한 회원의 개인정보를 보호하기 위해 노력합니다. 회원 개인정보의 보호 및 사용에 대해서는 관련법령 및 당 사이트의 개인정보 보호정책이 적용됩니다.
제 8 조 (이용 신청의 승낙과 제한)
① 당 사이트는 제6조의 규정에 의한 이용신청고객에 대하여 서비스 이용을 승낙합니다.
② 당 사이트는 아래사항에 해당하는 경우에 대해서 승낙하지 아니 합니다.
- 이용계약 신청서의 내용을 허위로 기재한 경우
- 기타 규정한 제반사항을 위반하며 신청하는 경우
제 9 조 (회원 ID 부여 및 변경 등)
① 당 사이트는 이용고객에 대하여 약관에 정하는 바에 따라 자신이 선정한 회원 ID를 부여합니다.
② 회원 ID는 원칙적으로 변경이 불가하며 부득이한 사유로 인하여 변경 하고자 하는 경우에는 해당 ID를
해지하고 재가입해야 합니다.
③ 기타 회원 개인정보 관리 및 변경 등에 관한 사항은 서비스별 안내에 정하는 바에 의합니다.
제 3 장 계약 당사자의 의무
제 10 조 (KISTI의 의무)
① 당 사이트는 이용고객이 희망한 서비스 제공 개시일에 특별한 사정이 없는 한 서비스를 이용할 수 있도록
하여야 합니다.
② 당 사이트는 개인정보 보호를 위해 보안시스템을 구축하며 개인정보 보호정책을 공시하고 준수합니다.
③ 당 사이트는 회원으로부터 제기되는 의견이나 불만이 정당하다고 객관적으로 인정될 경우에는 적절한 절차를
거쳐 즉시 처리하여야 합니다. 다만, 즉시 처리가 곤란한 경우는 회원에게 그 사유와 처리일정을 통보하여야
합니다.
제 11 조 (회원의 의무)
① 이용자는 회원가입 신청 또는 회원정보 변경 시 실명으로 모든 사항을 사실에 근거하여 작성하여야 하며,
허위 또는 타인의 정보를 등록할 경우 일체의 권리를 주장할 수 없습니다.
② 당 사이트가 관계법령 및 개인정보 보호정책에 의거하여 그 책임을 지는 경우를 제외하고 회원에게 부여된
ID의 비밀번호 관리소홀, 부정사용에 의하여 발생하는 모든 결과에 대한 책임은 회원에게 있습니다.
③ 회원은 당 사이트 및 제 3자의 지적 재산권을 침해해서는 안 됩니다.
제 4 장 서비스의 이용
제 12 조 (서비스 이용 시간)
① 서비스 이용은 당 사이트의 업무상 또는 기술상 특별한 지장이 없는 한 연중무휴, 1일 24시간 운영을
원칙으로 합니다. 단, 당 사이트는 시스템 정기점검, 증설 및 교체를 위해 당 사이트가 정한 날이나 시간에
서비스를 일시 중단할 수 있으며, 예정되어 있는 작업으로 인한 서비스 일시중단은 당 사이트 홈페이지를
통해 사전에 공지합니다.
② 당 사이트는 서비스를 특정범위로 분할하여 각 범위별로 이용가능시간을 별도로 지정할 수 있습니다. 다만
이 경우 그 내용을 공지합니다.
제 13 조 (홈페이지 저작권)
① NDSL에서 제공하는 모든 저작물의 저작권은 원저작자에게 있으며, KISTI는 복제/배포/전송권을 확보하고
있습니다.
② NDSL에서 제공하는 콘텐츠를 상업적 및 기타 영리목적으로 복제/배포/전송할 경우 사전에 KISTI의 허락을
받아야 합니다.
③ NDSL에서 제공하는 콘텐츠를 보도, 비평, 교육, 연구 등을 위하여 정당한 범위 안에서 공정한 관행에
합치되게 인용할 수 있습니다.
④ NDSL에서 제공하는 콘텐츠를 무단 복제, 전송, 배포 기타 저작권법에 위반되는 방법으로 이용할 경우
저작권법 제136조에 따라 5년 이하의 징역 또는 5천만 원 이하의 벌금에 처해질 수 있습니다.
제 14 조 (유료서비스)
① 당 사이트 및 협력기관이 정한 유료서비스(원문복사 등)는 별도로 정해진 바에 따르며, 변경사항은 시행 전에
당 사이트 홈페이지를 통하여 회원에게 공지합니다.
② 유료서비스를 이용하려는 회원은 정해진 요금체계에 따라 요금을 납부해야 합니다.
제 5 장 계약 해지 및 이용 제한
제 15 조 (계약 해지)
회원이 이용계약을 해지하고자 하는 때에는 [가입해지] 메뉴를 이용해 직접 해지해야 합니다.
제 16 조 (서비스 이용제한)
① 당 사이트는 회원이 서비스 이용내용에 있어서 본 약관 제 11조 내용을 위반하거나, 다음 각 호에 해당하는
경우 서비스 이용을 제한할 수 있습니다.
- 2년 이상 서비스를 이용한 적이 없는 경우
- 기타 정상적인 서비스 운영에 방해가 될 경우
② 상기 이용제한 규정에 따라 서비스를 이용하는 회원에게 서비스 이용에 대하여 별도 공지 없이 서비스 이용의
일시정지, 이용계약 해지 할 수 있습니다.
제 17 조 (전자우편주소 수집 금지)
회원은 전자우편주소 추출기 등을 이용하여 전자우편주소를 수집 또는 제3자에게 제공할 수 없습니다.
제 6 장 손해배상 및 기타사항
제 18 조 (손해배상)
당 사이트는 무료로 제공되는 서비스와 관련하여 회원에게 어떠한 손해가 발생하더라도 당 사이트가 고의 또는 과실로 인한 손해발생을 제외하고는 이에 대하여 책임을 부담하지 아니합니다.
제 19 조 (관할 법원)
서비스 이용으로 발생한 분쟁에 대해 소송이 제기되는 경우 민사 소송법상의 관할 법원에 제기합니다.
[부 칙]
1. (시행일) 이 약관은 2016년 9월 5일부터 적용되며, 종전 약관은 본 약관으로 대체되며, 개정된 약관의 적용일 이전 가입자도 개정된 약관의 적용을 받습니다.