• Journal of the Korean Data and Information Science Society
• /
• v.16 no.3
• /
• pp.581-589
• /
• 2005

The purpose of this thesis is to develop and introduce Add-in program which we can systematically, visually and dynamically study discrete probability distribution of binomial distribution, poisson distribution and hypergeometric distribution, and continuous probability distribution of normal distribution, exponential distribution, and the definition and characteristics of t distribution, F distribution and ${\chi}^2$ distribution to be driven from normal distribution, and graphs, the computation process of probability by using VBA which is the device of Excel.

• Honam Mathematical Journal
• /
• v.32 no.1
• /
• pp.177-192
• /
• 2010

We study the concepts of congruent number problems and elliptic curves. We research the structure of the group of elliptic curves and find out a method of the computation of L($E_n$, 1) and L'($E_n$, 1) by using SAGE program. In this paper, we obtain the first few congruent numbers for n ${\leq}$ 2500.

• Microbiology and Biotechnology Letters
• /
• v.24 no.1
• /
• pp.132-136
• /
• 1996

A comutation server is needed to provide analysis programs to Korean biologists, especially genome researchers, on GINet. For each analysis program, we implmented an input form with HTML and a CGI program for interface between an input form and an analysis program with C language on GINet computatin Web server. We made two construction methods of CGI programs for analysis programs, and implemented all CGI programs based on the methods followed by modifying each CGI program for specific processing of each program. On the server ten programs are availabel now, which include most frequently used ones and those developed by our team, and most programs with will be ported or developed by our team will be available on the Web server.

• Journal of the korean Society of Automotive Engineers
• /
• v.6 no.2
• /
• pp.1-6
• /
• 1984

복잡한 연소과정의 예측을 위한 이론적인 연구는 Gosman, Spalding, Patankar등의 수치해석방 법을 이용하여 진행된 것들이 많다. 현재 이분야에 응용되는 일반적인 Program으로는 Boundary Layer Type의 방정식을 이용한 One-Dimensional Program (GENMIX 4, Revised GENMIX) 등이 있으나 Parabolic Type이므로 주방향에 수직된 방향으로 동일한 값이 2개 이상 존재할 수 있는 Elliptic현상을 설명하기에는 어려움이 있다. 그러므로 비록 기억용량(Computation Storage) 및 계산시간(Running Time)에 불리한 점이 있기는 하나 Elliptic상황을 해석해야만 할 경우가 있다. 본 해설은 Patankar의 Elliptic "SIMPLE" Program을 연소 해석과정에 이용되는 방법을 간단한 연소과정의 예로서 설명하는 것으로 연소과정의 연구보다도 Program의 응용성에 중점을 두었다. 따라서 실제의 물리적인 연소 mechanism에서 많은 가정을 도입하여 문제를 단순화 시켰으며 실제의 연소문제에 충분한 접근을 위해서는 turbulence-modeling과 radiation heat flux가 본 해설에 덧붙여져서 논의되어야 한다. 논의되어야 한다.

• The Journal of the Acoustical Society of Korea
• /
• v.1 no.1
• /
• pp.60-64
• /
• 1982

Redundancies in the computational procedure of the FFT by which the DFT is calculated are analized and a modified algorithm to reduce redundancies is proposed. An amended FFT fortran program adopting the proposed algorithm shows that the time necessary for DFT computation is decreased about one-tenth. The proposed method can be applied to the most of other transformation algorithms.

• Proceedings of the KOSOMBE Conference
• /
• v.1996 no.11
• /
• pp.289-292
• /
• 1996

The 2-way beam simulation for the diagnostic ultrasound is performed with simplified computation by approximating the transducer and the system. The results show that the simulation program can be used as a good system design tool.

• Proceedings of the Korean Institute of IIIuminating and Electrical Installation Engineers Conference
• /
• 2009.10a
• /
• pp.163-167
• /
• 2009

Although the domestic electric power consumption of lighting have shared 20${\sim}$30 % of the national electric power consumption, the spread of lighting control system which can reduce the electric power consumption have been insignificant. The government have set the demonstration project and given the incentive to promote the spread of lighting control system since 2008. The M&V (Measurement and Verification) methodology for lighting control system have not been set yet in our country, but the direct measurement was suggested in US. The direct measurement methodology can increase the accuracy of measurement, but it cost much money to burden a customer. This study have suggested a new M&V methodology which cost low and is simple relatively. I had measured the amount of electric consumption through both the direct measurement and the new M&V program computation, and have analyzed the deviation. The amount of electric consumption measured by the new M&V program computation have agreed with one by the direct measurement within the error range of the instrumentation in case of lab scale test, and the 4${\sim}$8 % deviation have existed in case of field evaluation.

• Proceedings of the Korean Geotechical Society Conference
• /
• 2006.03a
• /
• pp.1287-1294
• /
• 2006

A pile is compressed with settlements when loading and bearing capacity is altered along relative displacement of pile/soil on settlement and compression. Settlements of pile displaying limit skin friction is different from displaying tip resistance. Therefore, it is an error in traditional method that bearing capacity of pile is estimated from the sum of limit skin fraction and tip resistance. Accordingly, development of design method considering behavior of load-settlement is needed. In this study, we would like to establish the base for development of design method considering bearing capacity altering along displacement on settlement and compression. For this, we established system and substance of design method. And in order to establish relationship of load-settlement of pile on the type of soil, we analyzed and arranged existing database and pile loading test. On design method, settlement is assumed gradually on each capacity level being assumed gradually. Bearing capacity developing on the pile is obtained on each settlement level. Until the obtained bearing capacity will be equal to assumed capacity, this process is continued with increasing settlement. Load-settlement curve for soil classification is sketched in the process computing settlement on assumed capacity. This design method will be materialized by computation program.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.17 no.6
• /
• pp.1509-1517
• /
• 1993

The purpose of this study is to develop a program for the automatic derivation of the symbolic equations necessary for the kinematic and dynamic analyses of the spatial mechanism. For this purpose, a symbolic manipulation package called MCSYMA is used. Every symbolic equation is formulated using relative joint coordinate to obtain the numerically efficient system equations. These equations are produced in FORTRAN statements and linked to a FORTRAN program for numerical analysis. Several examples are taken for comparison with the commercial package called DADS which is using Cartesian coordinate approach. Also, this symbolic formulation approach is compared with a conventional numerical approach for an example. The results show that this symbolic approach with relative joint coordinate system is most efficient in computational time among three and is recommended for the derivation of macro elements frequently used.

• Journal of Communications and Networks
• /
• v.9 no.2
• /
• pp.198-209
• /
• 2007

This paper provides a thorough study on shared segment protection (SSP) for mesh communication networks in the complete routing information scenario, where the integer linear program (ILP) in [1] is extended such that the following two constraints are well addressed: (a) The restoration time constraint for each connection request, and (b) the switching/merging capacity constraint at each node. A novel approach, called SSP algorithm, is developed to reduce the extremely high computation complexity in solving the ILP formulation. Basically, our approach is to derive a good approximation on the parameters in the ILP by referring to the result of solving the corresponding shared path protection (SPP) problem. Thus, the design space can be significantly reduced by eliminating some edges in the graphs. We will show in the simulation that with our approach, the optimality can be achieved in most of the cases. To verify the proposed formulation and investigate the performance impairment in terms of average cost and success rate by the additional two constraints, extensive simulation work has been conducted on three network topologies, in which SPP and shared link protection (SLP) are implemented for comparison. We will demonstrate that the proposed SSP algorithm can effectively and efficiently solve the survivable routing problem with constraints on restoration time and switching/merging capability of each node. The comparison among the three protection types further verifies that SSP can yield significant advantages over SPP and SLP without taking much computation time.