• Journal of Electrical Engineering and Technology
• /
• 제13권6호
• /
• pp.2456-2467
• /
• 2018

Wireless multimedia sensor networks (WMSNs) require real-time quality-of-service (QoS) guarantees to be provided by the network. The end-to-end delay is very critical metric for QoS guarantees in WMSNs. In WMSNs, due to the transmission errors incurred over wireless channels, it is difficult to obtain reliable delivery of data in conjunction with low end-to-end delay. In order to improve the end-to-end delay performance, the system has to drop few packets during network congestion. In this article, our proposal is based on optimization of end-to end delay for WMSNs. We optimize end-to-end delay constraint by assuming that each packet is allowed fixed number of retransmissions. To optimize the end-to-end delay, first, we compute the performance measures of the system, such as end-to-end delay and reliability for different network topologies (e.g., linear topology, tree topology) and against different choices of system parameters (e.g., data rate, number of nodes, number of retransmissions). Second, we study the impact of the end-to-end delay and packet delivery ratio on indoor and outdoor environments in WMSNs. All scenarios are simulated with multiple run-times by using network simulator-2 (NS-2) and results are evaluated and discussed.

• Journal of Communications and Networks
• /
• 제11권3호
• /
• pp.297-305
• /
• 2009

Multiprotocol label switching (MPLS) networks require dynamic flow admission control to guarantee end-to-end quality of service (QoS) for each Internet protocol (IP) traffic flow. In this paper, we propose to tackle the joint routing and admission control problem for the IP traffic flows in MPLS networks without rerouting already admitted flows. We propose two mathematical programming models for this problem. The first model includes end-to-end delay constraints and the second one, end-to-end packet loss constraints. These end-to-end QoS constraints are imposed not only for the new traffic flow, but also for all already admitted flows in the network. The objective function of both models is to minimize the end-to-end delay for the new flow. Numerical results show that considering end-to-end delay (or packet loss) constraints for all flows has a small impact on the flow blocking rate. Moreover, we reduces significantly the mean end-to-end delay (or the mean packet loss rate) and the proposed approach is able to make its decision within 250 msec.

• 사물인터넷융복합논문지
• /
• 제9권1호
• /
• pp.65-70
• /
• 2023

본 논문에서는 비전 센서 기반 시스템의 차선 이탈과 신호등 오인식 등을 개선하기 위해 End to End 모델을 활용한 자율주행 시스템을 제안한다. End to End 학습은 다양한 환경 조건에 대해 확장을 할 수 있다. 비전 센서 기반 모형 자동차를 이용하여 주행 데이터를 수집한다. 수집한 데이터를 이용하여 기존의 데이터와 아웃레이어를 제거한 데이터로 구성한다. 입력 데이터인 카메라 이미지 데이터, 출력 데이터인 속도와 조향 데이터로 클래스를 구성하고 End to End 모델을 활용하여 데이터 학습을 수행하였다. 학습된 모델의 신뢰성을 확인했다. 모형 자동차에 학습한 End to End 모델을 적용하여 이미지 데이터로 조향각을 예측한다. 모형 자동차의 학습 결과, 아웃레이어를 제거한 모델이 기존 모델보다 향상된 것을 볼 수 있다.

• 한국정보과학회 언어공학연구회:학술대회논문집(한글 및 한국어 정보처리)
• /
• 한국정보과학회언어공학연구회 2018년도 제30회 한글 및 한국어 정보처리 학술대회
• /
• pp.453-458
• /
• 2018

본 논문은 한국어 자소를 인식 단위로 사용한 hybrid CTC-Attention 모델 기반 end-to-end speech recognition을 제안한다. End-to-end speech recognition은 기존에 사용된 DNN-HMM 기반 음향 모델과 N-gram 기반 언어 모델, WFST를 이용한 decoding network라는 여러 개의 모듈로 이루어진 과정을 하나의 DNN network를 통해 처리하는 방법을 말한다. 본 논문에서는 end-to-end 모델의 출력을 추정하기 위해 자소 단위의 출력구조를 사용한다. 자소 기반으로 네트워크를 구성하는 경우, 추정해야 하는 출력 파라미터의 개수가 11,172개에서 49개로 줄어들어 보다 효율적인 학습이 가능하다. 이를 구현하기 위해, end-to-end 학습에 주로 사용되는 DNN 네트워크 구조인 CTC와 Attention network 모델을 조합하여 end-to-end 모델을 구성하였다. 실험 결과, 음절 오류율 기준 10.05%의 성능을 보였다.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2004년도 ICCAS
• /
• pp.747-752
• /
• 2004

Researches about scheduling of the distributed real-time systems have been proposed. However, they have some weak points, not scheduling both sporadic and periodic tasks and messages or being unable to guaranteeing the end-to-end constraints due to omitting precedence relations between sporadic tasks. So this paper proposes a new scheduling method for distributed real-time systems consisting of sporadic and periodic tasks with precedence relations and sporadic and periodic messages, guaranteeing end-to-end constraints. The proposed method is based on a binary search-based period assignment algorithm, an end-to-end laxity-based priority assignment algorithm, and three kinds of schedulability analysis, node, network, and end-to-end schedulability analysis. In addition, this paper describes the application model of sporadic tasks with precedence constraints in a distributed real-time system, shows that existing scheduling methods such as Rate Monotonic (RM) scheduling are not proper to be applied to the system having sporadic tasks with precedence constraints, and proposes an end-to-end laxity-based priority assignment algorithm.

• 제어로봇시스템학회논문지
• /
• 제11권2호
• /
• pp.175-185
• /
• 2005

The scheduling methods of the distributed real-time systems have been proposed. However, they have some weak points. They did not schedule both sporadic and periodic tasks and messages at the same time or did not consider the end-to-end constraints such as precedence relations between sporadic tasks. This means that system scheduling must guarantee the constraints of practical systems and be applicable to them. This paper proposes a new scheduling method that can be applied to more practical model of distributed real-time systems. System model consists of sporadic and periodic tasks with precedence relations and sporadic and periodic messages and has end-to-end constraints. The proposed method is based on a binary search-based period assignment algorithm, an end-to-end laxity-based priority assignment algorithm, and three kinds of schedulability analysis, node, network, and end-to-end schedulability analysis. In addition, this paper describes the application model of sporadic tasks with precedence constraints in a distributed real-time system, shows that existing scheduling methods such as Rate Monotonic scheduling are not proper to be applied to the system having sporadic tasks with precedence constraints, and proposes an end-to-end laxity-based priority assignment algorithm.

• 대한전기학회논문지:시스템및제어부문D
• /
• 제53권7호
• /
• pp.501-508
• /
• 2004

In this paper, a coordinated scheduling algorithm is proposed to reduce end-to-end delay in distributed control of systems. For the algorithm, the analysis of practical end-to-end delay in the worst case is performed priory with considering implementation of the systems. The end-to-end delay is composed of the delay caused by multi-task scheduling of operating systems, the delay caused by network communications, and the delay caused by asynchronous timing between operating systems and network communications. Through some simulation tests based on CAN(Controller Area Network), the proposed worst case end-to-end delay analysis is validated. Through the simulation tests, it is also shown that a real-time distributed control system designed to existing worst case delay cannot guarantee end-to-end time constraints. With the analysis, a coordinated scheduling algorithm is proposed here. The coordinated scheduling algorithm is focused on the reduction of the delay caused by asynchronous timing between operating systems and network communications. Online deadline assignment strategy is proposed for the scheduling. The performance enhancement of the distributed control systems by the scheduling algorithm is shown through simulation tests.

• 한국컴퓨터정보학회:학술대회논문집
• /
• 한국컴퓨터정보학회 2013년도 제48차 하계학술발표논문집 21권2호
• /
• pp.325-327
• /
• 2013

Although, there are so much information for telecommunication companies to manipulate and handle. there are still many side-effects in the field of completeness while transmitting information among information systems. Especially, works related to End-to-End Reconciliation bring about side-effects. In this research, we establish a proposed model for end-to-end analysis. After an experiment in a business company, we analyze its experimental results.

• 한국정보통신설비학회:학술대회논문집
• /
• 한국정보통신설비학회 2009년도 정보통신설비 학술대회
• /
• pp.333-336
• /
• 2009

DSON is a service overlay network architecture that can guarantee end-to-end quality of service to home network area. DSON makes service possible to be provided dynamically. This paper gives service model and scenario using DSON architecture.

• Journal of Biosystems Engineering
• /
• 제29권3호
• /
• pp.281-286
• /
• 2004

The end-effector is the one of the important factors on development of the cucumber robot to harvester a cucumber. Three end-effectors were designed the single blade end-effector with one blade, the double blade end-effector with two blades and the triple blade end-effector with three blades. Performance tests of the end-effector, the fully integrated system, were conducted to determine the cutting rate by using two different kinds of cucumber. The success rates of cucumber cutting ratio of single end-effector, double end-effector and triple end-effector in laboratory. were 61.7%, 95%, 86.7%, respectively. The cutting rate of single blade or double blade was a little difference with respect to the different diameters of cucumber stem. However, the success cutting rate of the end-effector with triple blade was 61.7% under 29mm diameter of a grabbing stem section. The triple end-effector was not suitable for harvesting a cucumber, but was considered to be suitable for harvesting a grape, an apple and a tomato. The success rate of cucumber cutting ratio of triple end-effectors in greenhouse was 84%. The failure cutting rate was 16% which are due to abnormal shape of cucumber fruit.