• Title/Summary/Keyword: dual problem

Search Result 710, Processing Time 0.029 seconds

A Study on the Dual Control Platform for Drone Field Training (드론 교육현장 이중화 제어 플랫폼 연구)

  • Ryu, Ukjae;Kim, Yanghoon
    • Journal of Platform Technology
    • /
    • v.10 no.2
    • /
    • pp.20-26
    • /
    • 2022
  • Interest and investment in drones that apply the concept of the 4th industrial revolution and ICT convergence advanced technology are continuing. The purpose of drone operation has been widely spread from the initial military use to the use of various industries such as construction, forestry, facilities, and agricultural support. In these industries, the training of pilots who can actually operate drones is increasing centering on the qualification system. However, the detailed standards including the training place, training place, educational environment, and education method for nurturing pilots are ambiguous, so the education through the oral instruction of the training instructor is continuing at the drone training site. In order to solve this problem, this study conducted a study on a dual control platform in which a training instructor could directly intervene in the pilot's flying drone to execute a map in order to improve the quality of synesthesia, which is essential in the field.

Investigation of AI-based dual-model strategy for monitoring cyanobacterial blooms from Sentinel-3 in Korean inland waters

  • Hoang Hai Nguyen;Dalgeun Lee;Sunghwa Choi;Daeyun Shin
    • Proceedings of the Korea Water Resources Association Conference
    • /
    • 2023.05a
    • /
    • pp.168-168
    • /
    • 2023
  • The frequent occurrence of cyanobacterial harmful algal blooms (CHABs) in inland waters under climate change seriously damages the ecosystem and human health and is becoming a big problem in South Korea. Satellite remote sensing is suggested for effective monitoring CHABs at a larger scale of water bodies since the traditional method based on sparse in-situ networks is limited in space. However, utilizing a standalone variable of satellite reflectances in common CHABs dual-models, which relies on both chlorophyll-a (Chl-a) and phycocyanin or cyanobacteria cells (Cyano-cell), is not fully beneficial because their seasonal variation is highly impacted by surrounding meteorological and bio-environmental factors. Along with the development of Artificial Intelligence (AI), monitoring CHABs from space with analyzing the effects of environmental factors is accessible. This study aimed to investigate the potential application of AI in the dual-model strategy (Chl-a and Cyano-cell are output parameters) for monitoring seasonal dynamics of CHABs from satellites over Korean inland waters. The Sentinel-3 satellite was selected in this study due to the variety of spectral bands and its unique band (620 nm), which is sensitive to cyanobacteria. Via the AI-based feature selection, we analyzed the relationships between two output parameters and major parameters (satellite water-leaving reflectances at different spectral bands), together with auxiliary (meteorological and bio-environmental) parameters, to select the most important ones. Several AI models were then employed for modelling Chl-a and Cyano-cell concentration from those selected important parameters. Performance evaluation of the AI models and their comparison to traditional semi-analytical models were conducted to demonstrate whether AI models (using water-leaving reflectances and environmental variables) outperform traditional models (using water-leaving reflectances only) and which AI models are superior for monitoring CHABs from Sentinel-3 satellite over a Korean inland water body.

  • PDF

A Weight on Boolean Algebras for Cryptography and Error Correcting Codes (암호학 및 오류 수정 코드를 위한 부울 대수 가중치 연구)

  • Yon, Yong-Ho;Kang, An-Na
    • Journal of Advanced Navigation Technology
    • /
    • v.15 no.5
    • /
    • pp.781-788
    • /
    • 2011
  • A sphere-packing problem is to find an arrangement of the spheres to fill as large area of the given space as possible, and covering problems are optimization problems which are dual problems to the packing problems. We generalize the concepts of the weight and the Hamming distance for a binary code to those of Boolean algebra. In this paper, we define a weight and a distance on a Boolean algebra and research some properties of the weight and the distance. Also, we prove the notions of the sphere-packing bound and the Gilbert-Varshamov bound on Boolean algebra.

A Study on the Removal of Electrostatic using Transmitted Ions Generated Soft X-ray with Compressed Air (기류방출형 연X선 조사에 의한 정전기 제거 장치에 관한 연구)

  • Kwon, Sung-Yul;Lee, Dong-Hoon;Choi, Jae-Wook;Seo, Min-Seok
    • Journal of the Korean Society of Safety
    • /
    • v.25 no.1
    • /
    • pp.27-31
    • /
    • 2010
  • It is a well known fact that the LCD and Semiconductor Devices are a central part of IT industry which is important in the present and the future. But the biggest problem of Semiconductor and LCD manufacturing is maintaining a cleaning room environment. For this reason, the soft X-ray type Ionizer was used as the electrostatic reducer device, which protects damage of the product against electrostatic discharge in the manufacturing process. Therefore it is a essential important factor during Semiconductor and LCD production process. But the soft X-ray has a intrinsic problem with harmful to human being in case of soft X-ray exposure. That's reason we have the research to solve above problem and made an apparatus that it was covered with shielding structure to protect X-ray radiation to outside. And besides, it has a possibility to eliminate the charged electrostatic in the narrow space through the slot for Ion emissions with dual soft X-ray sources on the both side. It is also not make the particles from itself when it has been operated.

Power Allocation in Heterogeneous Networks: Limited Spectrum-Sensing Ability and Combined Protection

  • Ma, Yuehuai;Xu, Youyun;Zhang, Dongmei
    • Journal of Communications and Networks
    • /
    • v.13 no.4
    • /
    • pp.360-366
    • /
    • 2011
  • In this paper, we investigate the problem of power allocation in a heterogeneous network that is composed of a pair of cognitive users (CUs) and an infrastructure-based primary network. Since CUs have only limited effective spectrum-sensing ability and primary users (PUs) are not active all the time in all locations and licensed bands, we set up a new multi-area model to characterize the heterogeneous network. A novel combined interference-avoidance policy corresponding to different PU-appearance situations is introduced to protect the primary network from unacceptable disturbance and to increase the spectrum secondary-reuse efficiency. We use dual decomposition to transform the original power allocation problem into a two-layer optimization problem. We propose a low-complexity joint power-optimizing method to maximize the transmission rate between CUs, taking into account both the individual power-transmission constraints and the combined interference power constraint of the PUs. Numerical results show that for various values of the system parameters, the proposed joint optimization method with combined PU protection is significantly better than the opportunistic spectrum access mode and other heuristic approaches.

Spectrum Leasing and Cooperative Resource Allocation in Cognitive OFDMA Networks

  • Tao, Meixia;Liu, Yuan
    • Journal of Communications and Networks
    • /
    • v.15 no.1
    • /
    • pp.102-110
    • /
    • 2013
  • This paper considers a cooperative orthogonal frequency division multiple access (OFDMA)-based cognitive radio network where the primary system leases some of its subchannels to the secondary system for a fraction of time in exchange for the secondary users (SUs) assisting the transmission of primary users (PUs) as relays. Our aim is to determine the cooperation strategies among the primary and secondary systems so as to maximize the sum-rate of SUs while maintaining quality-of-service (QoS) requirements of PUs. We formulate a joint optimization problem of PU transmission mode selection, SU (or relay) selection, subcarrier assignment, power control, and time allocation. By applying dual method, this mixed integer programming problem is decomposed into parallel per-subcarrier subproblems, with each determining the cooperation strategy between one PU and one SU. We show that, on each leased subcarrier, the optimal strategy is to let a SU exclusively act as a relay or transmit for itself. This result is fundamentally different from the conventional spectrum leasing in single-channel systems where a SU must transmit a fraction of time for itself if it helps the PU's transmission. We then propose a subgradient-based algorithm to find the asymptotically optimal solution to the primal problem in polynomial time. Simulation results demonstrate that the proposed algorithm can significantly enhance the network performance.

A Dual-Population Memetic Algorithm for Minimizing Total Cost of Multi-Mode Resource-Constrained Project Scheduling

  • Chen, Zhi-Jie;Chyu, Chiuh-Cheng
    • Industrial Engineering and Management Systems
    • /
    • v.9 no.2
    • /
    • pp.70-79
    • /
    • 2010
  • Makespan and cost minimization are two important factors in project investment. This paper considers a multi-mode resource-constrained project scheduling problem with the objective of minimizing costs, subject to a deadline constraint. A number of studies have focused on minimizing makespan or resource availability cost with a specified deadline. This problem assumes a fixed cost for the availability of each renewable resource per period, and the project cost to be minimized is the sum of the variable cost associated with the execution mode of each activity. The presented memetic algorithm (MA) consists of three features: (1) a truncated branch and bound heuristic that serves as effective preprocessing in forming the initial population; (2) a strategy that maintains two populations, which respectively store deadline-feasible and infeasible solutions, enabling the MA to explore quality solutions in a broader resource-feasible space; (3) a repair-and-improvement local search scheme that refines each offspring and updates the two populations. The MA is tested via ProGen generated instances with problem sizes of 18, 20, and 30. The experimental results indicate that the MA performs exceptionally well in both effectiveness and efficiency using the optimal solutions or the current best solutions for the comparison standard.

A numerical analysis of driven cavity flow using singular finite element method (모서리특이성이 존재하는 유체유동의 특이유한요소를 이용한 수치해석적 연구)

  • ;;Lee, Jin Hee
    • Transactions of the Korean Society of Mechanical Engineers
    • /
    • v.19 no.11
    • /
    • pp.2971-2980
    • /
    • 1995
  • A numerical study of fluid flow in driven cavity was carried out using singular finite element method. The driven cavity problem is known to have infinite velocity gradients as well as dual velocity conditions at the singular points. To overcome such difficulties, a finite element method with singular shape functions was used and a special technique was employed to allow multiple values of velocities at the singular points. Application of singular elements in the driven cavity problem has a significant influence on the stability of solution. It was found the singular elements gave a stable solution, especially, for the pressure distribution of the entire flow field by keeping up a large pressure at the singular points. In the existing solutions of driven cavity problem, most efforts were focused on the study of streamlines and vorticities, and pressure were seldom mentioned. In this study, however, more attention was given to the pressure distribution. Computations showed that pressure decreased very rapidly as the distance from the singular point increased. Also, the pressure distribution along the vertical walls showed a smoother transition with singular elements compared to those of conventional method. At the singular point toward the flow direction showed more pressure increase compared with the other side as Reynolds number increased.

LSTM-based Model for Effective Sensor Filtering in Sensor Registry System (센서 레지스트리 시스템에서 효율적인 센서 필터링을 위한 LSTM 기반 모델)

  • Chen, Haotian;Jung, Hyunjun;Lee, Sukhoon;On, Byung-Won;Jeong, Dongwon
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2021.10a
    • /
    • pp.12-14
    • /
    • 2021
  • A sensor registry system (SRS) provides semantic metadata about a sensor based on location information of a mobile device in order to solve a problem of interoperability between a sensor and a device. However, if the GPS of the mobile device is incorrectly received, the SRS receives incorrect sensor information and has a problem in that it cannot connect with the sensor. This paper proposes a dual collaboration strategy based on geographical embedding and LSTM-based path prediction to improve the probability of successful requests between mobile devices and sensors to address this problem and evaluate with the Monte Carlo approach. Through experiments, it was shown that the proposed method can compensate for location abnormalities and is an effective multicasting mechanism.

  • PDF

Resource allocation algorithm for space-based LEO satellite network based on satellite association

  • Baochao Liu;Lina Wang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.18 no.6
    • /
    • pp.1638-1658
    • /
    • 2024
  • As a crucial development direction for the sixth generation of mobile communication networks (6G), Low Earth Orbit (LEO) satellite networks exhibit characteristics such as low latency, seamless coverage, and high bandwidth. However, the frequent changes in the topology of LEO satellite networks complicate communication between satellites, and satellite power resources are limited. To fully utilize resources on satellites, it is essential to determine the association between satellites before power allocation. To effectively address the satellite association problem in LEO satellite networks, this paper proposes a satellite association-based resource allocation algorithm. The algorithm comprehensively considers the throughput of the satellite network and the fairness associated with satellite correlation. It formulates an objective function with logarithmic utility by taking the logarithm and summing the satellite channel capacities. This aims to maximize the sum of logarithmic utility while promoting the selection of fewer associated satellites for forwarding satellites, thereby enhancing the fairness of satellite association. The problems of satellite association and power allocation are solved under constraints on resources and transmission rates, maximizing the logarithmic utility function. The paper employs an improved Kuhn-Munkres (KM) algorithm to solve the satellite association problem and determine the correlation between satellites. Based on the satellite association results, the paper uses the Lagrangian dual method to solve the power allocation problem. Simulation results demonstrate that the proposed algorithm enhances the fairness of satellite association, optimizes resource utilization, and effectively improves the throughput of LEO satellite networks.