• Title/Summary/Keyword: Optimal Broadcasting

Search Result 310, Processing Time 0.02 seconds

Polynomial Time Algorithm for Worker Assignment Problem (작업자 배정 문제의 다항시간 알고리즘)

  • Lee, Sang-Un
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.22 no.5
    • /
    • pp.159-164
    • /
    • 2022
  • The linear assignment problem (LAP) and linear bottleneck assignment problem (LBAP) has been unknown the algorithm to solve the optimal solution within polynomial-time. These problems are classified by NP-hard. Therefore, we can be apply metaheuristic methods or linear programming (LP) software package or Hungarian algorithm (HA) with O(m4) computational complexity. This paper suggests polynomial time algorithm with O(mn)=O(m2),m=n time complexity to LAP and LBAP. The select-delete method is simply applied to LAP, and the delete-select method is used to LBAP. For the experimental data without the unique algorithm can be apply to whole data, the proposed algorithm can be obtain the optimal solutions for whole data.

Polynomial Time Algorithm for Advertising and Publicity Campaign Problem (광고홍보활동 문제의 다항시간 알고리즘)

  • Sang-Un, Lee
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.23 no.1
    • /
    • pp.151-156
    • /
    • 2023
  • This paper deals with the optimization problem that decides the number of advertising for any media among various medium to maximize the perception quality index of new product meets the given budget and over the minimum reached people constraints. For this problem, there is only in used the mathematical approach as linear programming (LP) software package and has been unknown the polynomial time algorithm. In this paper we suggest the heuristic algorithm with O(nlog n)time complexity to solve the optimal solution for this problem. This paper suggests the evaluation index to select the media most economically-efficient way and decides the media and the number of advertisement. While we utilize Excel, the proposed algorithm can be get the same optimal solution as LP for experimental data.

Design and Optimality Analysis of Cache Performance Model for Multimedia Streaming Environments (멀티미디어 스트리밍 환경을 위한 캐쉬 성능평가 모델 설계 및 최적성 분석)

  • Hyokyung Bahn;Kyungwoon Cho
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.23 no.5
    • /
    • pp.9-13
    • /
    • 2023
  • Multimedia streaming data is very large in size and accessed sequentially, making the LRU(Least Recently Used) algorithm widely used to improve I/O performance in traditional caching environments ineffective. Experimental analysis of this has shown the superiority of interval-based caching over LRU, but the theoretical basis has not been proven. In this paper, we design a cache performance model to analyze the optimality of caching for multimedia streaming environments and design a theoretically optimal caching algorithm based on interval caching. Then, we show that the algorithm we design is an optimal algorithm that minimizes cache misses of streaming data based on the proposed model.

Outage Optimal Transmission Strategy for Full-Duplex Relay System (전이중 릴레이 시스템에서 오수신 확률을 최소화 시키는 전송 기법)

  • Lee, Sun-Young;Kim, Seong-Lyun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.11A
    • /
    • pp.853-860
    • /
    • 2011
  • In this paper, we proposed a transmission scheme for a full-duplex relay system that minimizes outage probability. A relay system with the full-duplex relay can mitigate resource inefficiency of a half-duplex relay system. However, the mobile station suffers from the interference because the base station and the relay station transmits signal simultaneously to the mobile station. First, we suggest a layered broadcasting for full-duplex relaying. Second, we derive an optimal power allocation for the layered broadcasting in terms of the outage probability minimization. The proposed algorithm shows better performance than a half-duplex relaying system with and without the diversity, and a conventional full-duplex relaying system.

Desktop-LED lighting for Eye Muscle Movement by Adjusting the Light Illuminance and Color Temperature

  • Kim, Byoung-Chul;Kim, Seon-Jong;Kim, Joo-Man
    • International journal of advanced smart convergence
    • /
    • v.9 no.4
    • /
    • pp.203-208
    • /
    • 2020
  • In this paper, we propose the design and implementation of a desktop LED stand and smart app that automatically adjusts color temperature and illuminance for optimal brightness and eye health by improving the structural problem of the LED stand. It is a tabletop LED stand that supports optimal brightness through color temperature control and heat transfer through infrared LED to relieve eye strain through blood circulation and muscle movement. The LED stand works with the smartphone to automatically adjust the optimal brightness and color temperature for the user's environment. In addition, the brightness of the infrared LED is adjusted to a living frequency of 4Hz to relax the eye muscles and reduce eye strain. This study implemented an effective measured data-based system of previous studies through the color temperature and illumination of LED lighting, and near-infrared rays, and presented meaningful results by conducting an experiment to prove the effect through subjects.

Optimal Solution for Transportation Problems (수송문제의 최적해)

  • Lee, Sang-Un
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.13 no.2
    • /
    • pp.93-102
    • /
    • 2013
  • This paper proposes an algorithm designed to obtain the optimal solution for transportation problem. The transportation problem could be classified into balanced transportation where supply meets demand, and unbalanced transportation where supply and demand do not converge. The archetypal TSM (Transportation Simplex Method) for this optimal solution firstly converts the unbalanced problem into the balanced problem by adding dummy columns or rows. Then it obtains an initial solution through employment of various methods, including NCM, LCM, VAM, etc. Lastly, it verifies whether or not the initial solution is optimal by employing MODI. The abovementioned algorithm therefore carries out a handful of complicated steps to acquire the optimal solution. The proposed algorithm, on the other hand, skips the conversion stage for unbalanced transportation problem. It does not verify initial solution, either. The suggested algorithm firstly allocates resources so that supply meets demand, in the descending order of its loss cost. Secondly, it optimizes any surplus quantity (the amount by which the initially allocated quantity exceeds demand) in such a way that the loss cost could be minimized Once the above reallocation is terminated, an additional arrangement is carried out by transferring the allocated quantity in columns with the maximum cost to the rows with the minimum transportation cost. Upon application to 2 unbalanced transportation data and 13 balanced transportation data, the proposed algorithm has successfully obtained the optimal solution. Additionally, it generated the optimal solution for 4 data, whose solution the existing methods have failed to obtain. Consequently, the suggested algorithm could be universally applied to the transportation problem.

Optimal Solution of a Large-scale Travelling Salesman Problem applying DNN and k-opt (DNN과 k-opt를 적용한 대규모 외판원 문제의 최적 해법)

  • Lee, Sang-Un
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.15 no.4
    • /
    • pp.249-257
    • /
    • 2015
  • This paper introduces a heuristic algorithm to NP-hard travelling salesman problem. The proposed algorithm, in its bid to determine initial path, applies SW-DNN, DW-DNN, and DC-DNN, which are modified forms of the prevalent Double-sided Nearest Neighbor Search and searches the minimum value. As a part of its optimization process on the initial solution, it employs 2, 2.5, 3-opt of a local search k-opt on candidate delete edges and 4-opt on undeleted ones among them. When tested on TSP-1 of 26 European cities and TSP-2 of 49 U.S. cities, the proposed algorithm has successfully obtained optimal results in both, disproving the prevalent disbelief in the attainability of the optimal solution and making itself available as a general algorithm for the travelling salesman problem.

Reliability Analysis of the Communications & Broadcasting Satellite Transponder and its Optimal Design (통신방송위성 중계기의 신뢰도 분석 및 최적 설계)

  • Kim, Young-Suk;Chang, Young-Keun;Jeong, Chul-Oh
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.30 no.8
    • /
    • pp.94-102
    • /
    • 2002
  • Since it would be almost impossible to recover and/or repair the satellite in space once it has been launched, a detailed analysis and design, manufacturing using the high quality workmanship, and qualification and acceptance tests in space-simulation environments are necessary for all satellite components prior to launch. Even though these efforts arc made, the failure can still occur. Therefore, redundancy should be considered in the satellite design for continuous operations in preparation for part or equipment failure. In this paper, the reliability analysis of the transponder, which is a payload of Communications & Broadcasting Satellite being developed by ETRI, was performed and compared for various design cases with different redundancies to find the optimal design. The optimal design has been finalized by investigating how the redundant components are composed from the viewpoint of technical performance measures, such as reliability, cost, schedule, and mass.

A Method for Deriving an Optimal Product Feature Configuration Considering Feature Interaction (상호작용을 고려한 최적의 제품휘처형상 도출 방법)

  • Lee, Kwanwoo
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.14 no.2
    • /
    • pp.115-120
    • /
    • 2014
  • Many product line engineering methods use the feature model to structure commonality and variability among products in terms of features and to derive a product feature configuration, which is the set of features required for the development of a product. Features to be selected during product derivation are mainly determined based on the quality attributes required for a product. Most methods published so far derived an optimal product feature configuration through linear co-relationship between features and quality attributes. However, the co-relationship between features and quality attributes can be formulated as a non-linear function because of feature interactions. This paper proposes a method that derives an optimal product feature configuration considering feature interactions. Four product line cases are used to validate the proposed methods.

Optimal Path Search Algorithm for Urban Applying Received Signal Strength on Satellite Communication Environment (위성통신 환경에서 전파수신감도를 활용한 도심지 최적경로탐색 알고리즘)

  • Park, No-Uk;Kim, Joo-Seok;Lim, Joo-Yoeng;Lim, Tae-Hyuk;Yoo, Chang-Hyun;Kwon, Kun-Sup;Kim, Kyung-Seok
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.12 no.6
    • /
    • pp.189-197
    • /
    • 2012
  • In this paper, we propose an optimal path search algorithm that applies the received signal strength between a mobile device and a satellite. Because the common path search algorithm is only based on the shortest path search, it is difficult to provide stable multimedia services for the satellite mobile devices. The proposed algorithm provides the stable communication environment for the satellite mobile devices based on received signal strength. In Satellite communications, changes in the radio quality are severe depending on the receiving environment. Therefore, an accurate analysis of the receiving environment characteristics is very important for providing stable multimedia services of satellite communications. The causes of radio attenuation are atmosphere attenuation, vegetation attenuation and buildings attenuation. These factors were applied to analyze the received signal strength. The proposed algorithm can search the optimal path in urban for stable satellite multimedia services.