• Journal of Nutrition and Health
• /
• v.1 no.1
• /
• pp.33-36
• /
• 1968

Amounts of heat production determined by two indirect calorimetric methods, i.e., respiration-calorimetric method and body balance method were compared. In this report the apparatus, its operation and computation procedures for Haldane respiration-calorimetry modified by Han as well as procedures for body balance method are described. It was found that the heat production measured by two methods are similar.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.34C no.9
• /
• pp.22-32
• /
• 1997

This paper proposes an imprecise compuitation model for DCT considering QOS of images and a two dimensional DCT architecture for imprecise computations. In case that many processes are scheduling in a hard real time system, the system resources are shared among them. Thus all processes can not be allocated enough system resources (such as processing power and communication bandwidth). The imprecise computtion model can be used to provide scheduling flexibility and various QOS(quality of service)levels, to enhance fault tolerance, and to ensure service continuity in rela time systems. The DCT(discrete cosine transform) is known as one of popular image data compression techniques and adopted in JPEG and MPEG algorithms since the DCT can remove the spatial redundancy of 2-D image data efficiently. Even though many commercial data compression VLSI chips include the DCST hardware, the DCT computation is still a very time-consuming process and a lot of hardware resources are required for the DCT implementation. In this paper the DCT procedure is re-analyzed to fit to imprecise computation model. The test image is simulated on teh base of this model, and the computation time and the quality of restored image are studied. The row-column algorithm is used ot fit the proposed imprecise computation DCT which supports pipeline operatiions by pixel unit, various QOS levels and low speed stroage devices. The architecture has reduced I/O bandwidth which could make its implementation feasible in VLSI. The architecture is proved using a VHDL simulator in architecture level.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.10 no.1
• /
• pp.113-120
• /
• 2014

In this paper, I present a new echo canceller using the adaptive cascade system identification (CSI) method, which a system response is divided into several responses so that each response is adaptively estimated and combined. Echo cancellation is required for a dual-duplex DSL, in order to allow each individual loop to operate in a full duplex fashion. Echo cancellation was one of the most difficult aspects of DSL design, requiring high linearity and total echo return loss in excess of 70 dB. Especially, for a fickle response, if the response is estimated by an adaptive filter, the filter needs more taps and the performance is decreased. But the response is divided into several responses, the computation complexities are decreased and the performance is increased. For the stage constant n, which represents the number of stages, if the response is not divided (n=1), the computation complexity of multiply is $2N^2$. And if the response is divided into two responses (n=2), the computation complexity of multiply is $2N^2$. Also, if n=3, the computation complexity is ${\frac{2}{3}}N^2$. Therefore, it is known that the computation complexity is decreased as n is increased. Finally, this proposed method is verified through simulation of echo canceller for digital subscriber line (DSL) application.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.11a
• /
• pp.57-59
• /
• 2006

The purpose of search problem is to maximize the probability of target detection as limited search capability. Especially, as elapsing of time at a point of time of initial information received the target detection rate for searching an expected location due to a moving target such that wrecked ship or submarine decrease in these problems. The algorithm of search problem to a moving target having similar property of above targets should solve the search route as quickly as possible. In existing studies, they have a limit of applying in practice due to increasing computation time required by problem size (i.e., number of search area, search time). In this study, we provide that it takes more reasonable computation time than preceding studies even though extending a problem size practically using an approximate computation of probability.

• 한국전산유체공학회:학술대회논문집
• /
• 1995.10a
• /
• pp.43-48
• /
• 1995

A numerical computation is carried out to analyse characteristics of flow fields around Air Supported Ships having arbitrary form. The computations are performed in a rectangular grid system with MAC(Marker And Cell) method. The governing equations are represented in a Finite Difference form by forward differencing in time and centered differencing in space except for convection terms. For validation of this numerical analysis method, the computation of flow fields around Catamaran and ACV(Air Cushion Vehicle) with pressure distribution on free surface are done, and that around Surface Effect Ship is also carried out. The results of the computations are compared with the those of existed numerical computation and experimental results with the same condition.

• Journal of applied mathematics & informatics
• /
• v.5 no.3
• /
• pp.717-734
• /
• 1998

In the present paper is presented a new matrix pencil-based numerical approach achieving the computation of the elemen-tary divisors of a given matrix $A \in C^{n\timesn}$ This computation is at-tained without performing similarity transformations and the whole procedure is based on the construction of the Piecewise Arithmetic Progression Sequence(PAPS) of the associated pencil $\lambda I_n$ -A of matrix A for all the appropriate values of $\lambda$ belonging to the set of eigenvalues of A. This technique produces a stable and accurate numerical algorithm working satisfactorily for matrices with a well defined eigenstructure. The whole technique can be applied for the computation of the first second and Jordan canonical form of a given matrix $A \in C^{n\timesn}$. The results are accurate for matrices possessing a well defined canonical form. In case of defective matrices indications of the most appropriately computed canonical form. In case of defective matrices indication of the most appropriately computed canonical form are given.

• Research in Mathematical Education
• /
• v.3 no.1
• /
• pp.57-68
• /
• 1999

In this paper, we investigate the comparative effectiveness of two kinds of instructional methods in transfer of mathematics learning: one based on the situated cognition, i.e. situated learning (SL) and the other based on traditional learning (TL). Both classes (of grade 2) studied addition and subtraction of 3-digit numbers. After that, they completed two written tests (Written Test 1 included computation problems, Written Test 2 included computation problems and story problems) and a real situation test. As a result, no significant differences were found between the two groups' performance on computation skill in Written Tests 1 and 2. But the SL group performed significantly better on the performance of story problem and real situation test than TL group. This result indicated that the SL made improvement in transfer of mathematics learning. As a result of interviews with 12 children of the SL group were able to use contextual resources in solving real situation as well as story problems.

• 한국전산유체공학회:학술대회논문집
• /
• 2003.08a
• /
• pp.43-48
• /
• 2003

When the Eulerian-Lagrangian method is used to analyze the particle laden two-phase flow, a large number of particles should be used to obtain statistically meaningful solutions. Then it takes too much time to track the particles and to average the particle properties in the numerical analysis of two-phase flow. The purpose of this paper is to reduce the computation time by means of a set of particle gird separate to the flow grid. Particle motion equation here is the simplified B-B-O equation, which is integrated to get the particle trajectories. Particle turbulent dispersion, wall collision, and wall roughness effects are considered but the two-way coupling effects between gas and particles are neglected. Particle laden 2-D channel flow is solved and it is shown that the computational efficiency is indeed improved by using the current method

• Journal of the Korean Society of Combustion
• /
• v.3 no.1
• /
• pp.21-29
• /
• 1998

Mathematical modeling of combustion characteristics in HVOF thermal spray processes was carried out on the basis of equilibrium chemistry. The main objective of this work was the development of a computation code which allows to determine chemical composition of combustion products, adiabatic flame temperature, thermodynamic and transport properties. The free energy minimization method was employed with the descent Newton-Raphson technique for numerical solution of systems of nonlinear thermochemical equations. Adiabatic flame temperature was calculated by using a Newton#s iterative method incorporating the computation module of chemical composition. The performance of this code was verified by comparing computational results with data obtained by ChemKin code and in the literature. Comparisons between the calculated and measured flame temperatures showed a deviation less than 2%. It was observed that adiabatic flame temperature augments with increase in combustion pressure; the influence was significant in the region of low pressure but becomes weaker and weaker with increase in pressure. Relationships of adiabatic flame temperature, dissociation ratio and combustion pressure were also analyzed.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.2
• /
• pp.606-615
• /
• 1997

This paper proposes an dffcient method for test pattern generation.Current test pattern genration systems generate a test vester for fault $F_{i+l}$ independently of the computation previously done for faults F1,F2...,Fi The proposed algorithm generates a test vector for fault $F_{i+l}$ by inheriting the test vector for fault Fi. A new test vector is grnerated from inherited values by gradually changing the inhderited values .The inherited values may partially activate a fauog and propagate the fault signal,Normally,this reduses the number of decision steps and backtracks in the second search.Experimental results for well-Known benchmark circuts show that the proposed algorithm is very efficient with small backtrack kimit;in combination eith other algorithms,it is very efficient for arbitrary backtrack limits.