• Journal of Astronomy and Space Sciences
• /
• v.33 no.2
• /
• pp.93-99
• /
• 2016

A redback system is a binary system composed of a pulsar and a main sequence star. The inverse Compton (IC) scattering between the stellar soft photons and the relativistic pulsar wind will generate orbital-modulating GeV photons. We look for these IC emissions from redback systems. A multi-wavelength observation of an unassociated gamma-ray source, 3FGL J2039.6-5618, by Salvetti et al. (2015) detected an orbital modulation with a period of 0.2 days in both X-ray and optical cases. They suggested 3FGL J2039.6-5618 to be a new redback candidate. We analyzed the gamma-ray emission of 3FGL J2039.6-5618 using the data from the Fermi large area telescope (Fermi-LAT) and obtained the spectrum in different orbital phases. We propose that the spectrum has orbital dependency and estimate the characteristic energy of the IC emission from the stellar-pulsar wind interaction.

• Proceedings of the KSME Conference
• /
• 2003.04a
• /
• pp.1972-1979
• /
• 2003

Transport of a scalar quantity, such as chemical concentration or temperature, is important in many engineering applications and environmental flows. Here we report on results obtained from the large eddy simulations of flow and concentration fields inside the tank performed using a spectral multi-domain technique. The computations were driven by specifying the impeller-induced flow at the blade tip radius (Yoon et al. $^{(1)}$). This study focused on the concentration development at different molecular diffusivities in a stirred tank operated under turbulent conditions. The main objective of the work presented here is to study the large-scale mixing structure at different molecular diffusivities in a stirred tank by using the large eddy simulation. The time sequence of concentration and flow fields shows the flow dependency of the concentration development. The presence of spatial inhomogenieties is detailed by observing the time variation of local concentration at different positions.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.15 no.26
• /
• pp.189-199
• /
• 1992

Standard acceptance sampling plans models the production process as a sequence of independent identically distributed Beruoulli random variables. However, the quality of items sampled sequentially from an ongoing production process often exhibits statistical dependency that is not accounted for in standard acceptance sampling plans. In this paper, a dependent production process is modelled as an ARMA process and as a two-state Markov chain. A simulation study of each is performed. A comparison of the probability of acceptance is done for the simulation method and for the approximation method.

• Economic and Environmental Geology
• /
• v.28 no.4
• /
• pp.425-431
• /
• 1995

Genetic algorithms are so named because they are analogous to biological processes. The model parameters are coded in binary form. The algorithm then starts with a randomly chosen population of models called chromosomes. The second step is to evaluate the fitness values of these models, measured by a correlation between data and synthetic for a particular model. Then, the three genetic processes of selection, crossover, and mutation are performed upon the model in sequence. Genetic algorithms share the favorable characteristics of random Monte Carlo over local optimization methods in that they do not require linearizing assumptions nor the calculation of partial derivatives, are independent of the misfit criterion, and avoid numerical instabilities associated with matrix inversion. An additional advantage over converntional methods such as iterative least squares is that the sampling is global, rather than local, thereby reducing the tendency to become entrapped in local minima and avoiding the dependency on an assumed starting model.

• Transactions of Materials Processing
• /
• v.13 no.1
• /
• pp.90-101
• /
• 2004

An inverse mosaic method has been proposed to generate an initial blank shape from the final product shape. Differently from the geometric mapping method, the method can handle triangular patches. However, the generated blank shape is strongly dependent on the order of determination of nodes. In order to compensate the dependency error smoothing technique has been also developed. Although the accuracy has been improved greatly compared with the geometrical mapping method, the method has limitation, due to the no incorporation of plasticity theory. Even though the accuracy of the radius vector method is already proved. the method requires initial guess to start the method. In order to compromise the limitation of the present method and the radius vector method, the method has been connected to the radius vector method. The efficiency of the present optimal blank design method has been verified with some chosen examples.

• Phonetics and Speech Sciences
• /
• v.6 no.4
• /
• pp.127-132
• /
• 2014

This paper describes a robust speech recognition technique by reconstructing spectral components mismatched with a training environment. Although the cluster-based reconstruction method can compensate the unreliable components from reliable components in the same spectral vector by assuming an independent, identically distributed Gaussian-mixture process of training spectral vectors, the presented method exploits the temporal dependency of speech to reconstruct the components by introducing a hidden-Markov-model prior which incorporates an internal state transition plausible for an observed spectral vector sequence. The experimental results indicate that the described method can provide temporally consistent reconstruction and further improve recognition performance on average compared to the conventional method.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2000.10a
• /
• pp.567-570
• /
• 2000

지금까지의 수정영향 분석에 대한 연구는 주로 원시코드 기반으로 진행되어 왔다. 그러나 원시코드를 기반으로 한 소프트웨어의 수정영향 분석은 세부적이고 복잡하여, 소프트웨어의 수정영향 범위를 효과적으로 분석하고 클래스간의 제어의존성을 파악하기에 부적합하다. 따라서, 본 논문에서는 UML의 설계단계 산출물인 순차도(sequence diagram)를 기반으로 하여, 클래스간의 수정영향범위 분석을 위한 제어의존성 관계그래프와 알고리즘을 제안한다. 본 논문에서 제안한 제어의존성 관계그래프와 알고리즘은, 소프트웨어에 수정이 일어났을 경우에 수정의 영향범위를 결정하고 제어구조에 따라서 테스트의 순서를 명확히 정의함으로 유지보수 단계에서 시스템을 효율적으로 관리하고 유지하는데 드는 비용과 노력을 절약한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2000.10a
• /
• pp.571-574
• /
• 2000

지금까지의 수정영향 분석에 대한 연구는 주로 원시코드 기반으로 진행되어 왔다. 그러나 원시코드를 기반으로 한 소프트웨어의 수정영향 분석은 세부적이고 복잡하여, 소프트웨어의 수정영향 범위를 효과적으로 분석하고 클래스간의 제어의존성을 파악하기에 부적합하다. 따라서, 본 논문에서는 UML의 설계단계 산출물인 순차도(sequence diagram)를 기반으로 하여, 클래스간의 수정영향범위 분석을 위한 제어의존성 관계그래프와 알고리즘을 제안한다. 본 논문에서 제안한 제어의존성 관계그래프와 알고리즘은, 소프트웨어에 수정이 일어났을 경우에 수정의 영향범위를 결정하고 제어구조에 따라서 테스트의 순서를 명확히 정의함으로 유지보수 단계에서 시스템을 효율적으로 관리하고 유지하는데 드는 비용과 노력을 절약한다.

• IE interfaces
• /
• v.12 no.1
• /
• pp.132-142
• /
• 1999

Two-sided (left- and right-sided) assembly lines in practice can provide several advantages over one-sided lines in terms of the required line length, throughput time, cost of tools and fixtures, and so on. This paper considers two-sided assembly line balancing with the objective of minimizing line length. The balancing problem is more complicated than that of one-sided lines due to sequence-dependency of tasks assigned to a pair of directly facing workstations. This paper shows how genetic algorithm can be used to solve two-sided assembly line balancing. For this, an encoding and a decoding method suitable to the problem are presented. Proper genetic operators and an evalutation function are also employed. Extensive computational experiments are carried out to show the efficacy of the proposed algorithm. The results show that the algorithm is viable and promising in solution quality and computation time.

• Journal of KIISE:Software and Applications
• /
• v.27 no.1
• /
• pp.33-40
• /
• 2000

Computer Aided Process Planning (CAPP) plays a key role by linking CAD and CAM. Given CAD data of a part, CAPP has to recognize manufacturing features of the part. Despite the long history of research on feature recognition, its research results have rarely been transferred into industry. One of the reasons lies in the separation of feature recognition and process planning. This paper proposes to integrate the two activities through AI techniques, and presents efforts for manufacturable feature recognition, setup minimization, feature dependency construction, and generation of an optimal machining sequence.