• 한국통신학회논문지
• /
• 제36권10B호
• /
• pp.1168-1174
• /
• 2011

IEFT에서는 PMIPv6 환경에서 다중 인터페이스틀 가지는 MN에 플로우 단위의 이동성을 지원하기 위한 연구가 활발히 진행되고 있다. 본 논문에서는 기존 PMIPv6 환경에 플로우 이동성을 제공하기 위하여 LMA의 BCE에 추가적인 필드와 절차를 제안하였다. 제안한 방안을 통하여 LMA에서 플로우 단위의 라우팅이 가능하게 하며 MAG에서 플로우 핸드오버된 패킷을 폐기하는 문제점을 해결하였다. 또한 제안한 방안의 검증을 위하여 LMA와 MAG, 요구되는 기능을 실제 구현하였으며 구현한 테스트베드를 이용하여 제안한 방안을 검증하였다. 그 결과 제안한 방안을 통하여 성공적으로 플로우 이동성이 제공됨을 확인하였다.

• 한국통신학회논문지
• /
• 제29권2B호
• /
• pp.250-262
• /
• 2004

IPv6 환경에서는 인터넷 전화, 주문형 비디오 및 다자간의 대용량 파일 교환 서비스 등이 더욱 증가될 것이므로 단-대-단(End-to-End)기반의 엄격한 품질 보장 및 상대적으로 사용을 억제할 수 있는 차등화된 품질 제어 방안이 동시에 요구된다. 본 논문은 IPv6망에서 트래픽을 플로우 단위로 식별하고 IPv6 홉-바이-홉 옵션 헤더 내의 QoS 정보를 이용하여 멀티서비스의 QoS 개선을 위한 플로우 기반의 제어 방안을 제시한다. 플로우 제어 대상은 플로우 레이블 값을 이용하는 Non-default QoS 트래픽 뿐만 아니라 최선형 및 암호화 트래픽으로 확대 적용한다. 이를 통해 실시간 서비스에 대한 보장성은 강화하고 불필요하게 망 자원을 남용하는 플로우는 효과적으로 제어한다. 또한, 기존 망 자원의 최소 변경과 통신사업자의 백본망 현황을 반영하여 플로우와 MPLS간 매핑 방안을 제시한다. 시뮬레이션 결과에서는 제안하는 플로우 품질 제어 방안이 실시간 서비스에 대한 QoS 제공 및 백본 자원의 활용 측면에서 효율적임을 확인한다.

• Management Science and Financial Engineering
• /
• 제4권2호
• /
• pp.1-13
• /
• 1998

The Shortest Path Problem in Time-dependent Networks, where the travel time of each link depends on the time interval, is not realistic since the model and its solution violate the Non-passing Property (NPP:often referred to as FIFO) of real phenomena. Furthermore, solving the problem needs much more computational and memory complexity than the general shortest path problem. A new model for Time-dependent Networks where the flow speeds of each link depend on time interval, is suggested. The model is more realistic since its solution maintains the NPP. Solving the problem needs just a little more computational complexity, and the same memory complexity, as the general shortest path problem. A solution algorithm modified from Dijkstra's label setting algorithm is presented. We extend this model to the problem of Minimum Expected Time Path in Time-dependent Stochastic Networks where flow speeds of each link change statistically on each time interval. A solution method using the Kth-shortest Path algorithm is presented.

• 대한전기학회논문지
• /
• 제35권8호
• /
• pp.309-315
• /
• 1986

We proposed a preliminary Data Flow Machine Model(DNL1) operating on the basis of Node Label. In this model, all the PMs(Processing Modules) were synchronized with the content of LC(Level Counter) and were not implemented dy the processing cability on conditional nodes. This paper presents an architecture of a concurrent multiprocessor system which was developed from DNL1 with two additional types of memories, CF(Control Flag) and ETF (Enabled Token Flag). The CF memory holds the control condition flag ('1' or '0') to be referenced to when a node is fired and the ETF represents the firability of a certain node. Firable nodes are fetched to the PU(Processing Unit) and processed. This Data Flow system can be extended hierarchically by a network of simple modules. The principle working elements of the machine are a set of PMs, each of which performs the execution of the data flow procedures held in a local memory, NTM(Node Token Memory) within the PM.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제15권6호
• /
• pp.2168-2187
• /
• 2021

The smart grid replaces the traditional power structure with information inventiveness that contributes to a new physical structure. In such a field, malicious information injection can potentially lead to extreme results. Incorrect, FDI attacks will never be identified by typical residual techniques for false data identification. Most of the work on the detection of FDI attacks is based on the linearized power system model DC and does not detect attacks from the AC model. Also, the overwhelming majority of current FDIA recognition approaches focus on FDIA, whilst significant injection location data cannot be achieved. Building on the continuous developments in deep learning, we propose a Deep Learning based Locational Detection technique to continuously recognize the specific areas of FDIA. In the development area solver gap happiness is a False Data Detector (FDD) that incorporates a Convolutional Neural Network (CNN). The FDD is established enough to catch the fake information. As a multi-label classifier, the following CNN is utilized to evaluate the irregularity and cooccurrence dependency of power flow calculations due to the possible attacks. There are no earlier statistical assumptions in the architecture proposed, as they are "model-free." It is also "cost-accommodating" since it does not alter the current FDD framework and it is only several microseconds on a household computer during the identification procedure. We have shown that ANN-MLP, SVM-RBF, and CNN can conduct locational detection under different noise and attack circumstances through broad experience in IEEE 14, 30, 57, and 118 bus systems. Moreover, the multi-name classification method used successfully improves the precision of the present identification.

• 한국정보통신학회논문지
• /
• 제24권10호
• /
• pp.1271-1279
• /
• 2020

문자 영역 검출이란 수기 혹은 인쇄된 문서에서 문자의 영역을 검출하는 기술이다. 검출된 문자 영역들은 인식 단계를 거쳐 디지털화되며 이는 활용 목적에 따라 다양한 곳에서 활용된다. 하지만 문자 단위의 검출 결과는 대용량 문서를 인식해야 하는 산업 현장의 문자 인식 단계에는 적합하지 않다. 또한, 문서 내 존재하는 표는 문자 영역 검출 단계에서 오검출을 야기하며 이는 문자 인식 단계에서 악영향을 끼친다. 이를 해결하기 위해 본 논문에서는 표의 테두리 정보를 활용한 문자 영역 검출 방법을 제안한다. 표의 테두리 정보를 활용하기 위하여 제안하는 방법은 2개 디코더를 추가하고 간접적인 학습을 유도하기 위하여 각 디코드의 흐름을 조절하였다. 실험을 통해 표의 테두리 유사 라벨을 이용한 약지도 학습 방법이 성능 향상에 도움이 됨을 보였다.

• Journal of Chest Surgery
• /
• 제17권1호
• /
• pp.101-109
• /
• 1984

The influences of acute respiratory and metabolic acid-base disturbances on the carotid, renal and coronary blood flow were measured in dogs. Respiratory acidosis was induced by artificial respiration with 8% CO2 -02 gas mixture and respiratory alkalosis was induced by hyperventilation under the control of respirator. Metabolic acidosis and metabolic alkalosis were induced by intravenous infusion of 0.3N hydrochloric acid and 0.6M sodium bicarbonate solution. To observe the effect of hyperkalemia, isotonic potassium chloride solution was infused. CVI electromagnetic flowmeter probes were placed on the left common carotid artery, left renal artery and left circumflex coronary artery. Each flow was recorded on polygraph. 1. The carotid blood flow showed rapid showed rapid and marked increase in acute respiratory acidosis. Even in the cases when arterial blood pressure was lowered during the state of respiratory acidosis, carotid blood flow increased. By the infusion of hydrochloric acid, carotid blood flow increased slowly and returned to the previous label after discontinuation of the infusion. Carotid blood flow also increased by the infusion of large amount of sodium bicarbonate, but it might be the combined effect of expansion of extracellular fluid and compensatory elevation of carbon dioxide tension. 2.The renal blood flow remained unchanged during the acute acid-base disturbances, suggesting effective autoregulation. Renal blood flow, however, increased very slowly when the infusion of potassium chloride continued for a long period. 3.Although less marked than the carotid blood flow, the coronary blood flow increased in the acute respiratory and metabolic acidosis. In asphyxiated condition, coronary blood flow increased most markedly and this might be the combined effect of hypoxia, hypercapnea, and lowering of pH. In summary, the carotid blowflow showed more marked change in the acute respiratory and metabolic acidosis than the renal and coronary blood flow. Respiratory and metabolic components of acid-base disturbances may influence the local blood flow concomitantly, there being more differences in the individual responses, but respiratory component manifested more rapid and marked effect than metabolic component.

• ETRI Journal
• /
• 제27권6호
• /
• pp.733-746
• /
• 2005

In the context of multi-protocol label switching (MPLS) traffic engineering, this paper proposes a scalable constraintbased shortest path first (CSPF) routing algorithm with multiple QoS metrics. This algorithm, called the multiple constraint-based shortest path first (M_CSPF) algorithm, provides an optimal route for setting up a label switched path (LSP) that meets bandwidth and end-to-end delay constraints. In order to maximize the LSP accommodation probability, we propose a link weight computation algorithm to assign the link weight while taking into account the future traffic load and link interference and adopting the concept of a critical link from the minimum interference routing algorithm. In addition, we propose a bounded order assignment algorithm (BOAA) that assigns the appropriate order to the node and link, taking into account the delay constraint and hop count. In particular, BOAA is designed to achieve fast LSP route computation by pruning any portion of the network topology that exceeds the end-to-end delay constraint in the process of traversing the network topology. To clarify the M_CSPF and the existing CSPF routing algorithms, this paper evaluates them from the perspectives of network resource utilization efficiency, end-to-end quality, LSP rejection probability, and LSP route computation performance under various network topologies and conditions.

• 한국가시화정보학회지
• /
• 제20권3호
• /
• pp.19-26
• /
• 2022

In droplet microfluidics, precise droplet manipulation is required in numerous applications. This study presents ultrasonic surface acoustic wave (USAW)-based microfluidic device for label-free droplet separation based on size. The proposed device is composed of a slanted-finger interdigital transducer on a piezoelectric substrate and a polydimethylsiloxane microchannel placed on the substrate. The microchannel is aligned in the cross-type configuration where the USAWs propagate in a perpendicular direction to the flow in the microchannel. When droplets are exposed to an acoustic field, they experience the USAW-induced acoustic radiation force (ARF), whose magnitude varies depending on the droplet size. We modeled the USAW-induced ARF based on ray acoustics and conducted a series of experiments to separate different-sized droplets. We found that the experimental results were in good agreement with the theoretical estimation. We believe that the proposed method will serve as a promising tool for size-based droplet separation in a label-free manner.

• 한국통신학회논문지
• /
• 제30권10B호
• /
• pp.660-668
• /
• 2005

최근에는 인터넷 기반의 통신 방식이 원격 제어와 데이터 수집 분야에서도 널리 채택되어지고 있다. 현재의 인터넷에서 대부분의 네트워크 애플리케이션들은 Client-Sever 모델로 개발되고 있다. 본 논문에서는 인터넷상에서 Client와 Server의 역할을 교환하여, 다양한 산업용 디바이스를 위해 단일화된 디바이스 인터페이스를 제공해 주는 DCP(Device Configuration Protocol) 프로토콜을 제안한다. 제안된 프로토콜은 TCP/IP 표준 프로토콜 상에서 돌아가는 응용 계층 프로토콜로 동작한다. 또한 DCP 프로토콜을 확장하여 실시간 처리 기능을 추가하고, IPv6의 QoS(Quality of Service) 지원기능인 FlowLabel과 연동하여 실시간 처리가 사용자 수준에서 가능하도록 하였다. 시뮬레이션 수행 결과 실시간 처리가 요구되는 패킷과 일반적인 패킷을 비교하였을 때, 지연시간 측면에서 보면 실시간 처리가 요구되는 패킷은 처리율과 무관하게 마감 시간 전에 처리됨을 알 수 있다.