• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.6 no.8
• /
• pp.1161-1168
• /
• 2002

In this paper, the throughput performance of an ARQ scheme is analyzed with noisy feedback channel, in order to exactly analysis for performance of an ARQ scheme. An ARQ mechanism is presented by state diagram, and the throughput of an ARQ scheme is mathematically derived using generation function for a signal flow graph. The channel is modeled by the Nakagami-m fading channel which is distributed over far and wide, and the throughput performance of an ARQ scheme, which is applied in BPSK and BFSK systems, according to feedback gain and fading index m is analyzed through computer simulation. In the results, It is shown conformed that the throughput of an ARQ scheme decreased according to the increase of the noise for feedback channel, but it increased according to the increase of the feedback gain and fading index m. Also, it is shown that the throughput of an ARQ scheme using BPSK system is superior to BFSK system because of the difference of bit error probability between BPSK and BFSK systems.

• The Korean Journal of Physiology
• /
• v.16 no.2
• /
• pp.153-157
• /
• 1982

It has been hypothesized that the effectiveness of the popular mini-trampoline as a conditioning device is due to the increased gravitational forces which are imparted to every cell in the body during its use. This study evaluated a means of determining the acceleration forces on a subject using a minitrampoline. By cinematic evaluation, a plot of the changes in distance over time was obtained. Using the formulas developed at the Arizona State University Crash Survival Investigators' School, the maximum acceleration forces were determined to be approximately $3.2+G_z$.

• Journal of KIISE
• /
• v.43 no.9
• /
• pp.1026-1033
• /
• 2016

Path-finding on a grid map is a problem generally addressed in the fields of robotics, intelligent agents, and computer games. As technology advances, virtual game worlds tend to be represented more accurately and more realistically, resulting in an excessive increase in the number of grid tiles and in path-search time. In this study, we propose a path-finding algorithm that allows a prompt response to real-time queries by constructing a reduced state space and by precomputing all possible paths in an offline preprocessing stage. In the preprocessing stage, we vertically decompose free space on the grid map, construct a connectivity graph where nodes are the decomposed regions, and store paths between all pairs of nodes in matrix form. In the real-time query stage, we first find the nodes containing the query points and then retrieve the corresponding stored path. The proposed method is simulated for a set of maps that has been used as a benchmark for grid-based path finding. The simulation results show that the state space and the search time decrease significantly.

• Korean Journal of Chemical Engineering
• /
• v.35 no.12
• /
• pp.2327-2335
• /
• 2018

Fluid catalytic cracking (FCC) is an important chemical process that is widely used to produce valuable petrochemical products by cracking heavier components. However, many difficulties exist in modeling the FCC process due to its complexity. In this study, a dynamic process model of a FCC process is suggested and its structural observability is analyzed. In the process modeling, yield function for the kinetic model of the riser reactor was applied to explain the product distribution. Hydrodynamics, mass balance and energy balance equations of the riser reactor and the regenerator were used to complete the modeling. The process model was tested in steady-state simulation and dynamic simulation, which gives dynamic responses to the change of process variables. The result was compared with the measured data from operating plaint. In the structural analysis, the system was analyzed using the process model and the process design to identify the structural observability of the system. The reactor and regenerator unit in the system were divided into six nodes based on their functions and modeling relationship equations were built based on nodes and edges of the directed graph of the system. Output-set assignment algorithm was demonstrated on the occurrence matrix to find observable nodes and variables. Optimal locations for minimal addition of measurements could be found by completing the whole output-set assignment algorithm of the system. The result of this study can help predict the state more accurately and improve observability of a complex chemical process with minimal cost.

• Journal of Electrical Engineering and Technology
• /
• v.6 no.6
• /
• pp.867-873
• /
• 2011

A navigation mesh (NavMesh) is a suitable tool for the representation of a three-dimensional game world. A NavMesh consists of convex polygons covering free space, so the path can be found reliably without detecting collision with obstacles. The main disadvantage of a NavMesh is the huge state space. When the $A^*$ algorithm is applied to polygonal meshes for detailed terrain representation, the pathfinding can be inefficient due to the many states to be searched. In this paper, we propose a method to reduce the number of states searched by using visibility tests to achieve fast searching even on a detailed terrain with a large number of polygons. Our algorithm finds the visible vertices of the obstacles from the critical states and uses the heuristic function of $A^*$, defined as the distance to the goal through such visible vertices. The results show that the number of searched states can be substantially reduced compared to the $A^*$ search with a straight-line distance heuristic.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.06c
• /
• pp.319-323
• /
• 2007

실세계의 여러 문제들은 마르코프 결정 문제(Markov decision problem, MDP)로 표현될 수 있고, 이 MDP는 모델이 알려진 경우에는 평가치 반복(value iteration) 이나 모델이 알려지지 않은 경우에도 강화 학습(reinforcement learning) 알고리즘 등을 사용하여 풀 수 있다. 하지만 이들 알고리즘들은 시간 복잡도가 높아 크기가 큰 실세계 문제에 적용하기 쉽지 않아, MDP를 계층적으로 분할하거나, 여러 단계를 묶어서 수행하는 등의 시간적 추상화(temporal abstraction) 방법이 제안되어 왔다. 이러한 시간적 추상화 방법들의 문제점으로는 시간적 추상화의 디자인에 따라 MDP의 풀이 성능이 크게 달라질 수 있으며, 많은 경우 사용자가 이 디자인을 직접 제공해야 한다는 것들이 있다. 최근 사용자의 간섭이 필요 없이 자동적으로 시간적 추상화를 만드는 방법들이 제안된 바 있으나, 이들 방법들 역시 결과물에 대한 이론적인 성능 보장(performance guarantee)은 제공하지 못하고 있다. 본 연구에서는 이러한 문제점을 해결하기 위해 MDP의 구조와 그 풀이 성능을 연관짓는 복잡도 척도에 대해 살펴본다. 이를 위해 MDP로부터 얻은 상태 경로 그래프(state trajectory graph)의 위상적 성질들을 여러 네트워크 척도(network measurements) 들을 이용하여 측정하고, 이와 MDP의 풀이 성능과의 관계를 다양한 상황에 대해 실험적, 이론적으로 분석해 보았다.

• Korean Journal of Biological Psychiatry
• /
• v.22 no.3
• /
• pp.101-108
• /
• 2015

Recent breakthroughs in functional neuroimaging techniques have launched the quest of mapping the connections of the human brain, otherwise known as the human connectome. Imaging connectomics is an umbrella term that refers to the neuroimaging techniques used to generate these maps, which recently has enabled comprehensive brain mapping of network connectivity combined with graph theoretic methods. In this review, we present an overview of the key concepts in functional connectomics. Furthermore, we discuss articles that applied task-based and/or resting-state functional magnetic resonance imaging to examine network deficits in post-traumatic stress disorder (PTSD). These studies have provided important insights regarding the etiology of PTSD, as well as the overall organization of the brain network. Advances in functional connectomics are expected to provide insight into the pathophysiology and the development of biomarkers for diagnosis and treatment of PTSD.

• The Journal of Society for e-Business Studies
• /
• v.2 no.1
• /
• pp.21-37
• /
• 1997

As the complexity in design and manufacturing activities of distributed virtual enterprises rapidly increases, the issue of process management becomes more critical to shorten the time-to-market, reduce the manufacturing cost and improve the product quality. This paper proposes a unified framework to manage design and manufacturing processes in a distributed environment. We present a methodology which utilizes process flow graphs to depict the hierarchical structure of workflows and process grammars to represent various design processes and design tools. To implement the proposed concept, we develop a process management system which mainly consists of a cockpit and manager programs, and we finally address a preliminary implementation procedure based on the Object Modeling Technique. Since the proposed framework can be a formal approach to the process management by providing formalism, parallelism, reusability, and flexibility, it can be effectively applied to further application domains of distributed virtual enterprises.

• MALSORI
• /
• no.59
• /
• pp.53-68
• /
• 2006

We report the evaluation results of the Korean speech recognition platform called ECHOS. The platform has an object-oriented and reusable architecture so that researchers can easily evaluate their own algorithms. The platform has all intrinsic modules to build a large vocabulary speech recognizer: Noise reduction, end-point detection, feature extraction, hidden Markov model (HMM)-based acoustic modeling, cross-word modeling, n-gram language modeling, n-best search, word graph generation, and Korean-specific language processing. The platform supports both lexical search trees and finite-state networks. It performs word-dependent n-best search with bigram in the forward search stage, and rescores the lattice with trigram in the backward stage. In an 8000-word continuous speech recognition task, the platform with a lexical tree increases 40% of word errors but decreases 50% of recognition time compared to the HTK platform with flat lexicon. ECHOS reduces 40% of recognition errors through incorporation of cross-word modeling. With the number of Gaussian mixtures increasing to 16, it yields word accuracy comparable to the previous lexical tree-based platform, Julius.

• Asian Journal of Business Environment
• /
• v.8 no.1
• /
• pp.7-15
• /
• 2018

Purpose -This paper is to study the process of the negative effects of Sino-foreign joint ventures, hoping to find out an effective path in which local enterprises can avoid the risks in the utilization of foreign capital, and ultimately achieve independent innovation. Research design, data, and methodology -The outflow of assets, the loss of local brands and the "technology hollowing-out" problem brought by joint ventures is becoming more and more serious. Based on conflict analysis graph model, this paper takes Yuhuan joint venture as an example to identify the conflict problem in Sino-foreign joint ventures. Results -The results of the stability analysis show that establishing joint venture cannot really realize the introduction of technology because the technology is fully controlled by the foreign part. So when introducing foreign capital, local enterprises should participate in R&D and master the initiative. Conclusions - Local enterprises should pay attention to patent containment and technology blockade of multinationals. Domestic enterprises should try to protect state-owned assets and local brands in Sino-foreign joint ventures. Independent innovation is the most effective strategy for the development of enterprises in China.