• 제목/요약/키워드: Optimized service

검색결과 443건 처리시간 0.02초

VANET 환경에서의 경로 최적화를 위한 그리드 기반 위치 정보 서비스 스팟 기법 (Grid-based Location Service Spot scheme for optimized routing path on VANET)

  • 김종현;김기천;정우영
    • 한국ITS학회 논문지
    • /
    • 제9권1호
    • /
    • pp.76-90
    • /
    • 2010
  • 고정 인프라 없이 차량 노드 간 자체적으로 구성되는 차량 애드?혹 네트워크, VANET은 사고 예방과 교통량 통제로 그 사용 목적과 필요성이 분명하게 나타난다. VANET 환경에 적합한 위치 정보 기반 라우팅 기법은 소스 노드가 목적지 노드의 위치 정보를 가지고 있다는 전제를 바탕으로 하여, 위치 정보 제공을 위한 위치 정보 서비스(Location service)가 요구된다. 본 논문에서는 위치 정보 서비스에서의 접근성 문제 및 노드 간 형평성 유지에 관한 문제를 해결하기 위해 최적경로 설정을 위한 그리드 기반 위치 정보 서비스 스팟(Grid-based Location service spot, GLSS) 기법을 제안한다. 이 기법에서 지역을 구성하는 각 그리드에 일정 범위가 LSS로 설정되어, 해당 그리드의 모든 노드들은 위치 정보 등록 및 요청 메시지를 LSS로 Geocast 전송을 하게 된다. 위치 정보 요청 메지시는 LSS 간 확산을 통해 응답 메시지 발신 노드는 그리드 간 최적 경로를 통해 전달을 수행하여 신뢰성 있는 전송을 보장한다. 본 논문에서는 도로 환경과 지형 지물을 고려하여 각 그리드의 LSS를 경유하는 최적 경로 기법과 GPSR을 비교하여 성능 평가를 수행하였다.

Long-Term Container Allocation via Optimized Task Scheduling Through Deep Learning (OTS-DL) And High-Level Security

  • Muthakshi S;Mahesh K
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제17권4호
    • /
    • pp.1258-1275
    • /
    • 2023
  • Cloud computing is a new technology that has adapted to the traditional way of service providing. Service providers are responsible for managing the allocation of resources. Selecting suitable containers and bandwidth for job scheduling has been a challenging task for the service providers. There are several existing systems that have introduced many algorithms for resource allocation. To overcome these challenges, the proposed system introduces an Optimized Task Scheduling Algorithm with Deep Learning (OTS-DL). When a job is assigned to a Cloud Service Provider (CSP), the containers are allocated automatically. The article segregates the containers as' Long-Term Container (LTC)' and 'Short-Term Container (STC)' for resource allocation. The system leverages an 'Optimized Task Scheduling Algorithm' to maximize the resource utilisation that initially inquires for micro-task and macro-task dependencies. The bottleneck task is chosen and acted upon accordingly. Further, the system initializes a 'Deep Learning' (DL) for implementing all the progressive steps of job scheduling in the cloud. Further, to overcome container attacks and errors, the system formulates a Container Convergence (Fault Tolerance) theory with high-level security. The results demonstrate that the used optimization algorithm is more effective for implementing a complete resource allocation and solving the large-scale optimization problem of resource allocation and security issues.

A Study on Optimized Size of a Mobile Harbor for South Korea Coastal Service

  • Heo, Sung-Kuk;Park, Nam-Kyu
    • 한국항해항만학회지
    • /
    • 제35권2호
    • /
    • pp.159-165
    • /
    • 2011
  • The aim of paper is to calculate the optimized size of Mobile Harbor(MH) which would be operated in South Korea coast area. MH is the combined entity which has the function of both ship and container port. In estimating the optimized size, the total cost concept is applied to the different size of MH. Trade-off factors for calculating total cost are MH cost and the over-capacity lost cost. The factors for MH cost estimation are the cargo demand, distance from origin to destination, voyage route and MH's fixed and variable cost in both sailing and port. The other cost is the over-capacity lost cost which is occurred from dead space in case of oversize compared with a voyage demand. The alternatives for the least cost are 250TEU, 500TEU, 750TEU and 1,000TEU sized vessel. The result of research is that 250TEU sized vessel is optimized in a South Korea costal service. If the coastal area be separated in terms of voyage distance or the specific area in considering trade, the optimized size is changed depending upon distance.

Seamless Video Switching System for Service Compatible 3DTV Broadcasting

  • Kim, Sangjin;Jeon, Taehyun
    • ETRI Journal
    • /
    • 제38권5호
    • /
    • pp.847-857
    • /
    • 2016
  • Broadcasting services such as multi/single channel HDTV and 3DTV/2DTV use a multi-channel encoder that changes the bitrate and composition of the video service depending on the time. However, this type of multi-channel encoder could cause a longer latency owing to the variable bitrate and relatively bigger size of the buffers, which results in the same delay as in 3DTV even for a conventional DTV service. On the other hand, systems built based on separate encoders, each of which is optimized for the target service, might not have such latency problems. Nevertheless, there might be a distortion problem in the image and sound at the time of a switchover between two encoders with different output bitrates and group of picture structures. This paper proposes a system that can realize a seamless video service conversion using two different video encoders optimized for each video service. An overall functional description of the video service change control server, which is a main control block for the proposed system, is also provided. The experiment results confirm the seamless switchover and reduced broadcasting latency of DTV services compared with a broadcasting system composed of a multi-channel encoder system.

지도 오픈 API를 활용한 사용자 경험 기반 최적화 이동 경로 탐색 기법의 설계와 구현 (Design and Implementation of Optimized Route Search Technique based on User Experience Using Open APIs)

  • 사공운
    • 한국멀티미디어학회논문지
    • /
    • 제18권5호
    • /
    • pp.682-690
    • /
    • 2015
  • Among location-based systems, a route search service is very highly utilized as a representative technique, but it provides relatively low accuracy when we find a route path on foot in our real environment. In this paper, we design and implement an optimized route search technique based on user experience utilizing open APIs as location-based services. Finally, we develop an Android-based application to provide this feature. In our experiment, we found that our technique enhanced performance by about 14-36% compared to previous solutions, such as route path searches using map APIs. In addition, the performance of our technique can be further enhanced, as the number of users who find such optimized route path is increasing.

과학 학술정보 서비스 플랫폼에서 개인화를 적용한 콘텐츠 추천 알고리즘 최적화를 통한 추천 결과의 성능 평가 (Performance Evaluation of Recommendation Results through Optimization on Content Recommendation Algorithm Applying Personalization in Scientific Information Service Platform)

  • 박성은;황윤영;윤정선
    • 한국콘텐츠학회논문지
    • /
    • 제17권11호
    • /
    • pp.183-191
    • /
    • 2017
  • 본 연구는 과학 학술정보 서비스 플랫폼 이용자의 정보 검색 편의성을 확보하고 적합한 정보의 획득에 소요되는 시간을 절약하기 위하여, 운영 중인 서비스 메뉴와 각 서비스 별 콘텐츠 정보를 제공하는 알고리즘 중 콘텐츠 추천 알고리즘을 최적화하고 그 결과를 비교평가 하는 것이다. 추천 정확도를 높이기 위해 이용자의 '전공' 항목을 기존 알고리즘에 추가하였으며, 기존 알고리즘과 최적화된 알고리즘을 통한 추천 결과의 성능평가를 수행하였다. 성능평가 결과 최적화된 알고리즘을 통해 이용자에게 제공되는 콘텐츠의 적합도가 21.2% 증가함을 파악하였다. 이용자에게 적합한 콘텐츠를 시스템에서 자동 도출하여 각 서비스 메뉴 별로 제공함으로써 정보 획득 시간을 단축하고, 연구정보로서 가치 있는 연구결과물의 생명주기를 연장할 수 있는 방안이라는 데 본 연구의 의의가 있다.

인공지능프로세서 기술 동향 (Trends in AI Processor Technology)

  • 이미영;정재훈;이주현;한진호;권영수
    • 전자통신동향분석
    • /
    • 제35권3호
    • /
    • pp.66-75
    • /
    • 2020
  • As the increasing expectations of a practical AI (Artificial Intelligence) service makes AI algorithms more complicated, an efficient processor to process AI algorithms is required. To meet this requirement, processors optimized for parallel processing, such as GPUs (Graphics Processing Units), have been widely employed. However, the GPU has a generalized structure for various applications, so it is not optimized for the AI algorithm. Therefore, research on the development of AI processors optimized for AI algorithm processing has been actively conducted. This paper briefly introduces an AI processor especially for inference acceleration, developed by the Electronics and Telecommunications Research Institute, South Korea., and other global vendors for mobile and server platforms. However, the GPU has a generalized structure for various applications, so it is not optimized for the AI algorithm. Therefore, research on the development of AI processors optimized for AI algorithm processing has been actively conducted.

Profile-based Service Continuity Framework for N-Screen Service

  • Chung, Young-Sik;Paik, Eui-Hyun;Rhee, Woo-Seop
    • International Journal of Contents
    • /
    • 제8권1호
    • /
    • pp.47-54
    • /
    • 2012
  • The dynamic adaptation between various service environments using the application profiles for the service continuity is a key issue of the profile-based service continuity framework (PSCF) for N-screen service using next generation networks. PSCF offers an optimized service framework for providing continuous user services, which are multimedia video streaming, educational broadcasting, game, etc., using the various devices that are not restricted by the service environment of the user. This paper specifies the functional model of PSCF, service scenario and explains the experimental results of the service continuity for N-screen service using PSCF.

Development of Preliminary Design Model for Ultra-Large Container Ships by Genetic Algorithm

  • Han, Song-I;Jung, Ho-Seok;Cho, Yong-Jin
    • International Journal of Ocean System Engineering
    • /
    • 제2권4호
    • /
    • pp.233-238
    • /
    • 2012
  • In this study, we carried out a precedent investigation for an ultra-large container ship, which is expected to be a higher value-added vessel. We studied a preliminary optimized design technique for estimating the principal dimensions of an ultra-large container ship. Above all, we have developed optimized dimension estimation models to reduce the building costs and weight, using previous container ships in shipbuilding yards. We also applied a generalized estimation model to estimate the shipping service costs. A Genetic Algorithm, which utilized the RFR (required freight rate) of a container ship as a fitness value, was used in the optimization technique. We could handle uncertainties in the shipping service environment using a Monte-Carlo simulation. We used several processes to verify the estimated dimensions of an ultra-large container ship. We roughly determined the general arrangement of an ultra-large container ship up to 1500 TEU, the capacity check of loading containers, the weight estimation, and so on. Through these processes, we evaluated the possibility for the practical application of the preliminary design model.