• Title/Summary/Keyword: Optimal Broadcasting

Search Result 310, Processing Time 0.52 seconds

Design of Environment Monitoring for distribution of Living Fishery products (활수산 유통을 위한 환경 모니터링 설계)

  • Lee, Yun-Min;Shin, Jin-Seob
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.18 no.4
    • /
    • pp.155-159
    • /
    • 2018
  • In this paper, we designed and built a system that is site manager can be monitored remotely to the growth of the fishery environment. To this end, modular distribution system and environmental monitoring of live fishery products. Simulation results, were building a purification system and the oxygen supply to the fishery living inside the container was to build a system that can be monitored in real time. As a result, it was able to raise the necessary environment for the storage and distribution of fisheries products. We constructed a monitoring system with database and communication environment and created the optimal environment suitable for growth with sensor. As a result, it was possible to monitor the environment for the storage and distribution of fishery products and to build a suitable fishery products management system.

Big Data Refining System for Environmental Sensor of Continuous Manufacturing Process using IIoT Middleware Platform (IIoT 미들웨어 플랫폼을 활용한 연속 제조공정의 환경센서 빅데이터 정제시스템)

  • Yoon, Yeo-Jin;Kim, Tea-Hyung;Lee, Jun-Hee;Kim, Young-Gon
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.18 no.4
    • /
    • pp.219-226
    • /
    • 2018
  • IIoT(Industrial Internet of Thing) means that all manufacturing processes are informed beyond the conventional automation of process automation. The objective of the system is to build an information system based on the data collected from the sensors installed in each process and to maintain optimal productivity by managing and automating each process in real time. Data collected from sensors in each process is unstructured and many studies have been conducted to collect and process such unstructured data effectively. In this paper, we propose a system using Node-RED as middleware for effective big data collection and processing.

A Study on the Fusion of WiFi Fingerprint and PDR data using Kalman Filter (칼만 필터를 이용한 WiFi Fingerprint 및 PDR 데이터의 연동에 관한 연구)

  • Oh, Jongtaek
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.20 no.4
    • /
    • pp.65-71
    • /
    • 2020
  • In order to accurately track the trajectory of the smartphone indoors and outdoors, the WiFi Fingerprint method and the Pedestrian Dead Reckoning method are fused. The former can estimate the absolute position, but an error occurs randomly from the actual position, and the latter continuously estimates the position, but there are accumulated errors as it moves. In this paper, the model and Kalman Filter equation to fuse the estimated position data of the two methods were established, and optimal system parameters were derived. According to covariance value of the system noise and measurement noise the estimation accuracy is analyzed. Using the measured data and simulation, it was confirmed that the improved performance was obtained by complementing the two methods.

Aggregate Planning Using Least Cost First Assignment Algorithm of Transportation Problem (운송 문제의 최소비용 우선 배정 알고리즘을 적용한 총괄계획)

  • Lee, Sang-Un
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.21 no.5
    • /
    • pp.181-188
    • /
    • 2021
  • In preparing a aggregate production plan(APP), the transportation method generally uses a linear planning(LP) software package for TSM(transportation simplex method), which seeks initial solutions with either NCM, LCM, or VAM specialized in transportation issues and optimizes them with either SSM or MODI. On the other hand, this paper proposes a transportation method that easily, quickly, and accurately prepares a APP without software package assistance. This algorithm proposed simply assigned to least cost-first, and minimized the inventory periods. Applying the proposed algorithm to 6-benchmarking data, this algorithm can be obtained better optimal solution than VAM or LP for 4 data, and we obtain the same results for the remained 2 data.

Min-Cut Algorithm for Arrangement Problem of the Seats in Wedding Hall (결혼식장 좌석배치 계획 문제의 최소-절단 알고리즘)

  • Lee, Sang-Un
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.19 no.1
    • /
    • pp.253-259
    • /
    • 2019
  • The wedding seating problem(WSP) is to finding a minimum loss of guest relations(sit together preference) with restricted seats of a table for complex guest relation network. The WSP is NP-hard because of the algorithm that can be find the optimal solution within polynomial-time is unknown yet. Therefore we can't solve the WSP not computer-assisted programming but by hand. This paper suggests min-cut rule theory that the two guests with maximum preference can't separate in other two tables because this is not obtains minimum loss of preference. As a result of various experimental, this algorithm obtains proper seating chart meet to the seats of a table constraints.

Financing Problem for an Early Retirement Scheme (조기은퇴제도를 위한 자금조달문제)

  • Lee, Sang-Un
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.21 no.3
    • /
    • pp.151-157
    • /
    • 2021
  • This paper deals with financing an early retirement scheme problem(FERSP) with minimum initial cash and filling up maximum financial interest. For this problem, Guéret et al. programming the Mosel, and Edvall merely realize the CPLEX Branch-and-Cut MIP Solver program to get the optimal solution. But there is no clear rule to finding the solution. This paper suggests calculation formula of bond number decision-making that the reverse from long arrival due date to short. Then we optimize and confirm the bonds number in accordance with continuative effect of the arrival due date. The shortage prepare with the principal and interest of one year deposit(saving) reversely calculation formula.

Assignment-Change Optimization for the Problem of Bid Evaluation (입찰 평가 문제의 배정-변경 최적화)

  • Lee, Sang-Un
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.21 no.4
    • /
    • pp.171-176
    • /
    • 2021
  • This paper deals with bid evaluation problem that chooses the vendors and quantity with minimum purchasing cost for bid information of setup cost and unit price. For this problem, the branch-and-bound(BB) and branch-and-cut(BC) methods are well-known. But these methods can be fail to obtain the optimal solution. This paper gets the initial feasible solution with procuring quantity assignment principle in accordance with the unit price or setup cost rank-first. Then procuring quantity moving optimization(vendor change) is execute take account of unit price or setup cost rank. As a result of experimentation, the propose algorithm is significantly lower compared to BB and BC.

Smart contract research for efficient learner problem recommendation in online education environment (온라인 교육 환경에서 효율적 학습자 문제추천을 위한 스마트 컨트랙트 연구)

  • Min, Youn-A
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.22 no.4
    • /
    • pp.195-201
    • /
    • 2022
  • For a efficient distance education environment, the need for correct problem recommendation guides considering the learner's exact learning pattern is increasing. In this paper, we study block chain based smart contract technology to suggest a method for presenting the optimal problem recommendation path for individual learners based on the data given by situational weights to the problem patterns of learners collected in the distance education environment. For the performance evaluation of this study, the learning satisfaction with the existing similar learning environment, the usefulness of the problem recommendation guide, and the learner data processing speed were analyzed. Through this study, it was confirmed that the learning satisfaction improved by more than 15% and the learning data processing speed was improved by more than 20% compared to the existing learning environment.

Optimal Circuit Design through Snubber Circuit Analysis (스너버(Snubber) 회로 분석을 통한 회로의 최적설계)

  • Yongho Yoon
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.23 no.4
    • /
    • pp.137-142
    • /
    • 2023
  • When designing a SMPS(Switched Mode Power Supply) circuit, a part that is easily overlooked without special consideration is a snubber circuit. However, the performance degradation of the SMPS due to the snubber circuit and the effect on the entire SET cannot be ignored. In addition, a snubber circuit is added to both ends of the switch to protect the device from peak voltage and current during switching and to reduce loss during on/off switching. Therefore, in this paper, for a sufficient understanding of snubber circuits, theoretical analysis and experimental formulas that can be applied by designers during actual circuit design are arranged to promote optimization of snubber circuits.

A Signal Detection of Minimum Variance Algorithm on Linear Constraints

  • Kwan Hyeong Lee
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.15 no.3
    • /
    • pp.8-13
    • /
    • 2023
  • We propose a method for removing interference and noise to estimate target information. In wireless channels, information signals are subject to interference and noise, making it is difficult to accurately estimate the desired signal. To estimate the desired information signal, it is essential to remove the noise and interference from the received signal, extracting only the desired signal. If the received signal noise and interference are not removed, the estimated information signal will have a large error in distance and direction, and the exact location of the target cannot be estimated. This study aims to accurately estimate the desired target in space. The objective is to achieve more presice target estimation than existing methods and enhance target resolution.An estimation method is proposed to improve the accuracy of target estimation. The proposed target estimation method obtains optimal weights using linear constraints and the minimum variance method. Through simulation, the performance of the proposed method and the existing method is analyzed. The proposed method successfully estimated all four targets, while the existing method only estimated two targets. The results show that the proposed method has better resolutiopn and superior estimation capability than the existing method.