• 대한의용생체공학회:의공학회지
• /
• 제41권3호
• /
• pp.128-137
• /
• 2020

Cardiac electrophysiology studies often use simulation to predict how cardiac will behave under various conditions. To observe the cardiac tissue movement, it needs to use the high--resolution heart mesh with a sophisticated and large number of nodes. The higher resolution mesh is, the more computation time is needed. To improve computation speed and performance, parallel processing using multi-core processes and network computing resources is performed. In this study, we compared the computational speeds of CPU parallelization and GPU parallelization in virtual heart simulation for efficiently calculating a series of ordinary differential equations (ODE) and partial differential equations (PDE) and determined the optimal CPU and GPU parallelization architecture. We used 2D tissue model and 3D ventricular model to compared the computation performance. Then, we measured the time required to the calculation of ODEs and PDEs, respectively. In conclusion, for the most efficient computation, using GPU parallelization rather than CPU parallelization can improve performance by 4.3 times and 2.3 times in calculations of ODEs and PDE, respectively. In CPU parallelization, it is best to use the number of processors just before the communication cost between each processor is incurred.

• 한국위성정보통신학회논문지
• /
• 제3권2호
• /
• pp.1-6
• /
• 2008

시공간 부호(Space-time codes; STC)는 부가적인 대역폭 요구 사항 없이도 다중경로 환경에서 부호화 이득을 얻을 수 있는 효율적인 방식이다. 위성시스템에서도 시공간부호를 이용하여 지상 중계 장치와의 협동 다이버시티 이득 구현이 가능함이 제안되어 왔다. 특히 위성 DMB 시스템에서는 방송 서비스의 단방향 특성으로 인하여 전송 다이버시티를 이용하여 성능을 향상시키는 것이 매우 효율적이라고 할 수 있다. 본 논문에서는 차세대 위성 DMB 서비스의 성능을 향상시키는데 기여할 수 있는 여러 가지 STC 방식의 성능을 비교한 결과를 제시한다. 본 논문에서 제시하는 방식들은 위성과 지상의 중계기가 서로 협동적으로 동작하여 STC 부호화 이득을 얻을 수 있도록 하는 방식이다. 또한, 향후 이런 방식들을 개발함에 있어서 고려해야 할 점들을 기술한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제7권12호
• /
• pp.2957-2986
• /
• 2013

The traditional approach of fixed spectrum allocation to licensed networks has resulted in spectrum underutilisation. Cognitive radio technology is envisioned as a promising solution that can be used to resolve the ineffectiveness of the fixed spectrum allocation policy by accessing the underutilised spectrum of existing technologies opportunistically. The implementation of cognitive radio networks (CRNs) faces distinct challenges due to the fact that two systems (i.e., cognitive radio (CR) and primary users (PUs)) with conflicting interests interact with each other. Specially, in self-organised systems such as ad-hoc CRNs (AHCRNs), the coordination of spectrum access introduces challenges to researchers due to rapid utilisation changes in the available spectrum, as well as the multi-hop nature of ad-hoc networks, which creates additional challenges in the analysis of resource allocation (e.g., power control, channel and rate allocation). Instead, game theory has been adopted as a powerful mathematical tool in analysing and modelling the interaction processes of AHCRNs. In this survey, we first review the most fundamental concepts and architectures of CRNs and AHCRNs. We then introduce the concepts of game theory, utility function, Nash equilibrium and pricing techniques. Finally, we survey the recent literature on the game theoretic analysis of AHCRNs, highlighting its applicability to the physical layer PHY, the MAC layer and the network layer.

• 한국정밀공학회지
• /
• 제20권12호
• /
• pp.55-63
• /
• 2003

The traffic accident is the prerequisite of the traffic accident reconstruction. In this study, the traffic accident (forward collision) and traffic accident reconstruction (inverse collision) simulations are conducted to improve the quality and accuracy of the traffic accident reconstruction. The vehicle and tire models are used to simulate the trajectories for the post-impact motion of the vehicles after collision. The impact dynamic model applicable to the forward and inverse collision simulations is also provided. The accuracy of impact analysis for the vehicular collision depends on the accuracy of the coefficients of restitution and friction. The neural network is used to estimate these coefficients. The forward and inverse collision simulations for the multi-collisions are conducted. The new method fur the accident reconstruction is proposed to calculate the pre-impact velocities of the vehicles without using the trial and error process which requires the repeated calculations of the initial velocities until the forward collision simulation satisfies with the accident evidences. This method estimates the pre-impact velocities of the vehicles by analyzing the trajectories of the vehicles. The vehicle slides on a road surface not only under the skidding during an emergency braking but also under the steering. A vehicle over steering or cornering with excessive speed loses the traction and leaves tile yaw marks on the road surface. The new critical speed formula based on the vehicle dynamics is proposed to analyze the yaw marks and shows smaller errors than ones of the existing critical speed formula.

• 대한교통학회지
• /
• 제25권5호
• /
• pp.183-193
• /
• 2007

전통적으로 혼잡통행료는 교통시설의 한계사회비용과 한계개인비용의 차이를 혼잡통행료로 부과함으로써 사용자 균형(user equilibrium)상태의 도로망을 체계최적(system optimum)으로 유도하는 한계비용가격(marginal cost pricing) 또는 최적혼잡통행료(first-optimal pricing)이론에 근거를 두고 있다. 이러한 이론을 기초로 본 연구에서는 가변수요를 갖는 다계층 도로이용자를 대상으로 링크 최적혼잡통행료의 이론적 특성을 살펴보고 혼잡통행료 징수에 따른 계층간 그리고 지역간 형평성을 분석하기 위한 방법론을 연구한다. 여기서, 도로이용자가 경험하는 경로통행비용은 시간요소(통행시간)와 화폐요소(혼잡통행료)의 2가지 판단기준으로 구성되고 시간가치에 의해 하나의 단위로 전환(trade off)이 가능하다. 경로 통행비용이 시간단위로 환산될 경우, 최적혼잡통행료는 시간단위 체계최적 조건으로부터 도출될 수 있고 경로통행비용이 화폐단위로 환산될 경우, 최적혼잡통행료는 화폐단위 체계최적 조건으로부터 도출될 수 있다. 따라서 본 연구에서는 이러한 체계최적 조건으로부터 도출된 최적혼잡통행료를 산정하는 모형을 개발하고 이를 통하여 계층간 형평성을 살펴본다.

• 동의생리병리학회지
• /
• 제22권1호
• /
• pp.262-266
• /
• 2008

We plan to make the standardization of the pattern identifications for stroke and differentiate them by tongue diagnosis. We make a case report form which has questionnaires for tongue diagnosis in stroke patients. And we collected cases from the multi center network which consists of twelve university hospitals and one local hospital. The cases confirmed by diagnosis of medical specialists and residents are 321 cases. They are divided into Qi Defficiency 30.84%, Dampness& Phlegm 25.55%, Fire & Heat 22.43%, Eum Defficiency 18.69% and Blood Stasis 2.49%. We analyzed the markers which classified into the color of tongue body, the color of fur, the quality of fur, the dryness of tongue, the shape of tongue. To make a stroke pattern identification standard, we must try variable ways.

• 대한기계학회논문집A
• /
• 제35권10호
• /
• pp.1323-1328
• /
• 2011

자동차 로워암과 같이 다양한 형상설계변수를 갖는 부품모듈의 최근 설계경향은 설계자가 관심을 갖는 설계영역을 선형 및 2 차 다항식으로 근사화시키는 반응표면모델로 탐색하고, 다음 단계로서 최적설계를 수행하는 것이다. 본 연구에서는 로워암의 설계변수 변화에 따른 작용응력과 중량의 비선형적 변화뿐만 아니라 이의 예측에 적합한 신경망모델로 직교성과 균형성을 모두 만족시키는 다수준 전산실험계획법으로 설계영역을 탐색하였다. 구축된 신경망모델에 형상 설계변수의 공차도 같이 고려할 수 있는 식스시그마 제약조건을 적용하여 로워암의 공차 최적설계를 수행하고, 최적해의 공차 강건성을 확보하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제4권5호
• /
• pp.859-876
• /
• 2010

In this paper, we propose a hierarchical application traffic classification system as an alternative means to overcome the limitations of the port number and payload based methodologies, which are traditionally considered traffic classification methods. The proposed system is a new classification model that hierarchically combines a binary classifier SVM and Support Vector Data Descriptions (SVDDs). The proposed system selects an optimal attribute subset from the bi-directional traffic flows generated by our traffic analysis system (KU-MON) that enables real-time collection and analysis of campus traffic. The system is composed of three layers: The first layer is a binary classifier SVM that performs rapid classification between P2P and non-P2P traffic. The second layer classifies P2P traffic into file-sharing, messenger and TV, based on three SVDDs. The third layer performs specialized classification of all individual application traffic types. Since the proposed system enables both coarse- and fine-grained classification, it can guarantee efficient resource management, such as a stable network environment, seamless bandwidth guarantee and appropriate QoS. Moreover, even when a new application emerges, it can be easily adapted for incremental updating and scaling. Only additional training for the new part of the application traffic is needed instead of retraining the entire system. The performance of the proposed system is validated via experiments which confirm that its recall and precision measures are satisfactory.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제4권6호
• /
• pp.1063-1079
• /
• 2010

Vehicle ad hoc networks (VANET) are one of the most important technologies to provide various ITS services. While VANET requires rapid and reliable transmission, packet transmission in VANET is unstable because of high mobility. Many routing protocols have been proposed and assessed to improve the efficiency of VANET. However, topology-based routing protocols generate heavy overhead and long delay, and position-based routing protocols have frequent packet loss due to inaccurate node position. In this paper, we propose a position-based routing repair algorithm to improve the efficiency of VANET. This algorithm is proposed based on the premise that AODV (-PGB) can be used effectively in VANET, if the discovery, maintenance and repair mechanism of AODV is optimized for the features of VANET. The main focus of this algorithm is that the relay node can determine whether its alternative node exits and judge whether the routing path is disconnected. If the relay node is about to swerve from the routing path in a multi-hop network, the node recognizes the possibility of path loss based on a defined critical domain. The node then transmits a handover packet to the next hop node, alternative nodes and previous node. The next node repairs the alternative path before path loss occurs to maintain connectivity and provide seamless service. We simulated protocols using both the ideal traffic model and the realistic traffic model to assess the proposed algorithm. The result shows that the protocols that include the proposed algorithm have fewer path losses, lower overhead, shorter delay and higher data throughput compared with other protocols in VANET.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권4호
• /
• pp.1406-1423
• /
• 2014

Multi-mode device which combines multiple access technologies into a device will offer more cost-effective solution than a sole access implementation. Its concurrent multipath transfer (CMT) technology can transmit media flows over multiple end-to-end paths simultaneously, which is essential to select at least two paths from all available paths. At real networks, different paths are likely to overlap each other and even share bottleneck, which can weaken the path diversity gained through CMT. Spurred by this observation, it is necessary to select multiple independent paths as much as possible to avoid underlying shared bottleneck between topologically joint paths. Recent research in this context has shown that different paths with shared bottleneck can weaken the path diversity gained through CMT. In our earlier work, a grouping-based multipath selection (GMS) mechanism is introduced and developed. However, how to estimating the selection is still to be resolved. In this paper, we firstly introduce a Selection Correctness Index (SCI) to evaluate the correctness of selection results in actual CMT experiment. Therefore, this metric is helpful to discuss and validate the accuracy of the output paths. From extensive experiments with a realized prototype, the proposed scheme provides better evaluation tool and criterion in various network conditions.