• Title/Summary/Keyword: Simulation Service

Search Result 2,843, Processing Time 0.031 seconds

Fast Algorithm for Disparity Estimation in ATSC-M/H based Hybrid 3DTV (ATSC-M/H 기반의 융합형 3DTV를 위한 양안시차 고속 추정 알고리즘)

  • Lee, Dong-Hee;Kim, Sung-Hoon;Lee, Jooyoung;Kang, Dongwook;Jung, Kyeong-Hoon
    • Journal of Broadcast Engineering
    • /
    • v.19 no.4
    • /
    • pp.521-532
    • /
    • 2014
  • ATSC-M/H based hybrid 3DTV, which is one of the service compatible 3DTV system, has considerable quality gap between the left and right views. And CRA(Conditional Replenishment Algorithm) has been proposed to deal with the issue of resolution mismatch and improve the visual quality. In CRA, the disparity vectors of stereoscopic images are estimated. The disparity compensated left view and simply enlarged right view are compared and conditionally selected for generating the enhanced right view. In order to implement CRA, a fast algorithm is strongly required because the disparity vectors need to be obtained at every layer and the complexity of CRA is quite high. In this paper, we adopted SDSP(Small Diamond Search Pattern) instead of full search and predicted the initial position of search pattern by examining the spatio-temporal correlation of disparity vectors and also suggested the SKIP mode to limit the number of processing units. The computer simulation showed that the proposed fast algorithm could greatly reduce the processing time while minimizing the quality degradation of reconstructed right view.

A Study on Variation and Application of Metabolic Syndrome Prevalence using Geographically Weighted Regression (지리적 가중 회귀를 이용한 대사증후군 유병률의 지역별 변이에 관한 연구 및 적용 방안)

  • Suhn, Mi Ohk;Kang, Sung Hong;Chun, Jin-Ho
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.19 no.2
    • /
    • pp.561-574
    • /
    • 2018
  • In this study, regional variations and factors associated with prevalence of metabolic syndrome were grasped using GWR (geographically weighted regression) and methodologies for the efficient management of metabolic syndrome were then set up to resolve health inequalities. Based on the National Health Screening Statistical Yearbook published by the National Health Insurance Service (NHIS), community health survey (KCDC) and other governmental institutions, indicators of social structural and mediation factors related to the regional prevalence of metabolic syndrome were collected. First, the existence of indicators to measure variations in metabolic syndrome were confirmed with the collected data by calculating the EQ (extremal quotient) and CV (coefficient of variations). The GWR, which is able to take spatial variations into consideration, was then adopted to analyze the factors of regional variations in metabolic syndrome. The GWR analysis revealed that severity and management of the main causes need to be prioritized in accordance with the prevalence of metabolic syndrome. Consequently, the order of priority in management of regional prevalence of metabolic syndrome was established, and plans that can increase the effectiveness of management of metabolic syndrome were confirmed to be feasible.

Design of NePID using Anomaly Traffic Analysis and Fuzzy Cognitive Maps (비정상 트래픽 분석과 퍼지인식도를 이용한 NePID 설계)

  • Kim, Hyeock-Jin;Ryu, Sang-Ryul;Lee, Se-Yul
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.10 no.4
    • /
    • pp.811-817
    • /
    • 2009
  • The rapid growth of network based IT systems has resulted in continuous research of security issues. Probe intrusion detection is an area of increasing concerns in the internet community. Recently, a number of probe intrusion detection schemes have been proposed based on various technologies. However, the techniques, which have been applied in many systems, are useful only for the existing patterns of probe intrusion. They can not detect new patterns of probe intrusion. Therefore, it is necessary to develop a new Probe Intrusion Detection technology that can find new patterns of probe intrusion. In this paper, we proposed a new network based probe intrusion detector(NePID) using anomaly traffic analysis and fuzzy cognitive maps that can detect intrusion by the denial of services attack detection method utilizing the packet analyses. The probe intrusion detection using fuzzy cognitive maps capture and analyze the packet information to detect syn flooding attack. Using the result of the analysis of decision module, which adopts the fuzzy cognitive maps, the decision module measures the degree of risk of denial of service attack and trains the response module to deal with attacks. For the performance evaluation, the "IDS Evaluation Data Set" created by MIT was used. From the simulation we obtained the max-average true positive rate of 97.094% and the max-average false negative rate of 2.936%. The true positive error rate of the NePID is similar to that of Bernhard's true positive error rate.

Pre-Planned Tree Reconfiguration Mechanism for QoS Multicast Routing (QoS 멀티캐스트 라우팅을 위한 계획된 트리 재구성 방법)

  • Han, Seung-Jae;Park, Sun-Ju
    • Journal of KIISE:Information Networking
    • /
    • v.34 no.2
    • /
    • pp.120-133
    • /
    • 2007
  • A multicast tree includes several, possibly a large number of, paths connecting source-receiver pairs, and network failure may disable part of the multicast tree. Reconstruction of the entire multicast tree to recover from a component failure is highly undesirable, because some group members have to suffer service disruptions even though the communication paths to/from them are not affected by the failure. To limit reconfiguration region and to maximize the likelihood of successful reconfiguration, we propose and evaluate a pre-planned reconfiguration policy for QoS multicast sessions. Specifically, we equip a reconfiguration path (RP) with each end-to-end path that connects a source-receiver pair in the multicast tree, and reserve resources in advance along the RPs. Efficient resource-sharing techniques are applied to reduce the amount of resources reserved for RPs but not used in the absence of failures. This way, we prevent uncontrolled competition among different multicast sessions which may simultaneously try to recover from failures. We evaluate the performance of the proposed scheme using simulation on randomly-generated networks. We use the shortest-path routing for QoS multicast sessions, and simulate both source-based and shared multicast trees. The evaluation results indicates that successful pre-planned reconfiguration can be achieved for all group members with reasonable overhead. Our scheme is also shown to adapt well to dynamic changes of group membership.

An Analytical Study of the Effect of Inclined Angle of Road on Turn-over Accident of a High-speed Coach running on a Curved Road under Cross-wind Condition (횡풍이 작용하는 속도로의 회전구간에서 도로의 편경사각이 주행차량의 전복사고에 미치는 영향에 관한 분석연구)

  • Park, Hyeong-Su
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.18 no.1
    • /
    • pp.373-381
    • /
    • 2017
  • Kyeonggi Provincial Government is considering double decker bus service to solve the problem of heavy rush hour traffic. However, the height-to-width ratio is more than 1.16 times larger than that of a general high-speed single decker bus, and the center of gravity is higher. This could cause driving stability problems, such as turnover and breakaway from the lane, especially under strong side-wind conditions at high speed. In this numerical study, the driving characteristics of a model double decker bus were reviewed under side-wind and superelevation conditions at high driving speed. The rolling, pitching, and yawing moment of the model bus were calculated with CFD numerical simulation, and the results were compared to the recovery angular moments of the model bus to evaluate the dynamic stability under given driving conditions. As the model vehicle moves on a straight level road, it is stable under any side-wind conditions. However, on a curved road under side-wind conditions, it could reach unstable conditions dynamically. There is a chance that the bus will turn over when it moves on a curved road with a radius of gyration less than 100 m under side-wind (15 m/s). However, there is a very small chance of breakaway from the lane under any driving conditions.

A Mobile P2P Message Platform Enabling the Energy-Efficient Handover between Heterogeneous Networks (이종 네트워크 간 에너지 효율적인 핸드오버를 지원하는 모바일 P2P 메시지 플랫폼)

  • Kim, Tae-Yong;Kang, Kyung-Ran;Cho, Young-Jong
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.15 no.10
    • /
    • pp.724-739
    • /
    • 2009
  • This paper suggests the energy-efficient message delivery scheme and the software platform which exploits the multiple network interfaces of the mobile terminals and GPS in the current mobile devices. The mobile terminals determine the delivery method among 'direct', 'indirect', and 'WAN' based on the position information of itself and other terminals. 'Direct' method sends a message directly to the target terminal using local RAT. 'Indirect' method extends the service area by exploiting intermediate terminals as relay node. If the target terminal is too far to reach through 'direct' or 'indirect' method, the message is sent using wireless WAN technology. Our proposed scheme exploits the position information and, thus, power consumption is drastically reduced in determining handover time and direction. Network simulation results show that our proposed delivery scheme improves the message transfer efficiency and the handover detection latency. We implemented a message platform in a smart phone realizing the proposed delivery scheme. We compared our platform with other typical message platforms from energy efficiency aspect by observing the real power consumption and applying the mathematical modeling. The comparison results show that our platform requires significantly less power.

MAC Scheduling Algorithm for Efficient Management of Wireless Resources in Bluetooth Systems (블루투스 시스템에서의 효율적 무선자원관리를 위한 MAC 스케쥴링 기법)

  • 주양익;권오석;오종수;김용석;이태진;엄두섭;차균현
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.9A
    • /
    • pp.702-709
    • /
    • 2003
  • In this paper, we propose an efficient and QoS-aware MAC scheduling algorithm for Bluetooth, which considers both throughput and delay performance of each Master-Slave pair in scheduling decisions, and thus, attempts to maximize overall performance. The proposed algorithm, MTDPP (Modified Throughput-Delay Priority Policy), makes up for the drawbacks of T-D PP (Throughput-Delay Priority Policy) proposed in [6] and improves the performance. Since Bluetooth employs a master-driven TDD based scheduling algorithm, which is basically operated with the Round Robin policy, many slots may be wasted by POLL or NULL packets when there is no data waiting for transmission in queues. To overcome this link wastage problem, several algorithms have been proposed. Among them, queue state-based priority policy and low power mode-based algorithm can perform with high throughput and reasonable fairness. However, their performances may depend on traffic characteristics, i.e., static or dynamic, and they require additional computational and signaling overheads. In order to tackle such problems, we propose a new scheduling algorithm. Performance of our proposed algorithm is evaluated with respect to throughput and delay. Simulation results show that overall performances can be improved by selecting suitable parameters of our algorithm.

GMPLS based Functional Models and Connection Admission Control Algorithms for Optical Burst Switched Networks (광 버스트 교환 망을 위한 GMPLS 기반 기능 모델과 연결 수락 제어 알고리즘)

  • 소원호;노선식;김영천
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.7B
    • /
    • pp.585-597
    • /
    • 2004
  • In this paper, we propose the functional models of optical burst switching (OBS) routers to apply GMPLS (Generalized Multiprotocol Label Switching) to optical networks based on OBS. In addition, we introduce a connection admission control (CAC) algorithms which are operated in this models and can accommodate the required QoS. Firstly, the characteristics of current GMPLS and OBS for the optical Internet are basically considered. With this consideration, the models are proposed to accept OBS features which include the recognition of data boundary with control information and the statistical multiplexing in terms of bursts. Secondly, we use an offset time decision (OTD) algorithm on behalf of controlling the connection admission with taking QoS parameters such as burst loss rate(BLR) and service-differentiation ratio(SDR) into consideration. The proposed CAC algorithms use the offered load of LSP (Label Switched Path), wavelength information, and QoS parameters as inputs of OTD algorithm. A call setup request will be accepted when the offset time decided by OTD algorithm is reasonable for guaranteeing its requested QoS. Simulation is used for performance evaluation. Results show the proposed schemes can guarantee the required QoS and those are better than the previous one in terms of channel utilization.

Peer-to-Peer Transfer Scheme for Multimedia Partial Stream using Client Initiated with Prefetching (멀티미디어 데이터를 위한 피어-투-피어 전송모델)

  • 신광식;윤완오;정진하;최상방
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.7B
    • /
    • pp.598-612
    • /
    • 2004
  • Client requests have increased with the improvement of network resources at client side, whereas network resources at server side could not keep pace with the increased client request. Therefore, it is primary factor of the Qos that efficiently utilize network resources at server side. In this paper, we proposed a new model that peer-to-peer transfer scheme for partial multimedia stream based on CIWP which it decrease server network bandwidth by utilizing client disk resources saves additional server network resources. Especially, adapting Threshold_Based Multicast scheme guarantees to do that data transfer within clients never exceed service time of previous peer by restriction of which data size transferring from previous peer less than data size transferring from server. Peer-to-peer transfer within clients is limited in same group classified as ISPs. Our analytical result shows that proposed scheme reduces appling network resources at server side as utilizing additional client disk resource. furthermore, we perform various simulation study demonstrating the performance gain through comparing delay time and proportion of waiting requesters. As a result, when we compared to Threshold_Based Multicast scheme, the proposed scheme reduces server network bandwidth by 35%.

An Energy Consumption Model using Two-Tier Clustering in Mobile Sensor Networks (모바일 센서 네트워크에서 2계층 클러스터링을 이용한 에너지 소비 모델)

  • Kim, Jin-Su
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.17 no.12
    • /
    • pp.9-16
    • /
    • 2016
  • Wireless sensor networks (WSN) are composed of sensor nodes and a base station. The sensor nodes deploy a non-accessible area, receive critical information, and transmit it to the base station. The information received is applied to real-time monitoring, distribution, medical service, etc.. Recently, the WSN was extended to mobile wireless sensor networks (MWSN). The MWSN has been applied to wild animal tracking, marine ecology, etc.. The important issues are mobility and energy consumption in MWSN. Because of the limited energy of the sensor nodes, the energy consumption for data transmission affects the lifetime of the network. Therefore, efficient data transmission from the sensor nodes to the base station is necessary for sensing data. This paper, proposes an energy consumption model using two-tier clustering in mobile sensor networks (TTCM). This method divides the entire network into two layers. The mobility problem was considered, whole energy consumption was decreased and clustering methods of recent researches were analyzed for the proposed energy consumption model. Through analysis and simulation, the proposed TTCM was found to be better than the previous clustering method in mobile sensor networks at point of the network energy efficiency.