• Title/Summary/Keyword: information-maximization method

Search Result 151, Processing Time 0.023 seconds

Characteristics of Maximization Output Control for Variable Wind Generation System Using IPMSG (IPMSG을 이용한 풍력 발전 시스템의 최대 출력화 제어 특성)

  • Mun, Sang-Pil;Heo, Young-Hwan;Kim, Jong-Suk;Park, Han-Seok
    • The Transactions of the Korean Institute of Electrical Engineers P
    • /
    • v.65 no.3
    • /
    • pp.151-157
    • /
    • 2016
  • This paper proposes the variable wind generation system based on the direct torque control(DTC)for the interior permanent magnet synchronous generator. The proposed system can achieve the MPPT control without wind speed in addition to the speed and position sensorless control as well as the conventional current control method. The DTC has several advantages such as simply system configuration, ease of the flux weakening control and the sensorless control. The experimental results show the performance of the proposed wind generation system.

Tabu search Algorithm for Maximizing Network Lifetime in Wireless Broadcast Ad-hoc Networks (무선 브로드캐스트 애드혹 네트워크에서 네트워크 수명을 최대화하기 위한 타부서치 알고리즘)

  • Jang, Kil-Woong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.26 no.8
    • /
    • pp.1196-1204
    • /
    • 2022
  • In this paper, we propose an optimization algorithm that maximizes the network lifetime in wireless ad-hoc networks using the broadcast transmission method. The optimization algorithm proposed in this paper applies tabu search algorithm, a metaheuristic method that improves the local search method using the memory structure. The proposed tabu search algorithm proposes efficient encoding and neighborhood search method to the network lifetime maximization problem. By applying the proposed method to design efficient broadcast routing, we maximize the lifetime of the entire network. The proposed tabu search algorithm was evaluated in terms of the energy consumption of all nodes in the broadcast transmission occurring in the network, the time of the first lost node, and the algorithm execution time. From the performance evaluation results under various conditions, it was confirmed that the proposed tabu search algorithm was superior to the previously proposed metaheuristic algorithm.

Energy Efficiency Maximization for Energy Harvesting Bidirectional Cooperative Sensor Networks with AF Mode

  • Xu, Siyang;Song, Xin;Xia, Lin;Xie, Zhigang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.6
    • /
    • pp.2686-2708
    • /
    • 2020
  • This paper investigates the energy efficiency of energy harvesting (EH) bidirectional cooperative sensor networks, in which the considered system model enables the uplink information transmission from the sensor (SN) to access point (AP) and the energy supply for the amplify-and-forward (AF) relay and SN using power-splitting (PS) or time-switching (TS) protocol. Considering the minimum EH activation constraint and quality of service (QoS) requirement, energy efficiency is maximized by jointly optimizing the resource division ratio and transmission power. To cope with the non-convexity of the optimizations, we propose the low complexity iterative algorithm based on fractional programming and alternative search method (FAS). The key idea of the proposed algorithm first transforms the objective function into the parameterized polynomial subtractive form. Then we decompose the optimization into two convex sub-problems, which can be solved by conventional convex programming. Simulation results validate that the proposed schemes have better output performance and the iterative algorithm has a fast convergence rate.

Reducing Decoding Complexity by Improving Motion Field Using Bicubic and Lanczos Interpolation Techniques in Wyner-Ziv Video Coding

  • Widyantara, I Made O.;Wirawan, Wirawan;Hendrantoro, Gamantyo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.9
    • /
    • pp.2351-2369
    • /
    • 2012
  • This paper describes interpolation method of motion field in the Wyner-Ziv video coding (WZVC) based on Expectation-Maximization (EM) algorithm. In the EM algorithm, the estimated motion field distribution is calculated on a block-by-block basis. Each pixel in the block shares similar probability distribution, producing an undesired blocking artefact on the pixel-based motion field. The proposed interpolation techniques are Bicubic and Lanczos which successively use 16 and 32 neighborhood probability distributions of block-based motion field for one pixel in k-by-k block on pixel-based motion field. EM-based WZVC codec updates the estimated probability distribution on block-based motion field, and interpolates it to pixel resolution. This is required to generate higher-quality soft side information (SI) such that the decoding algorithm is able to make syndrome estimation more quickly. Our experiments showed that the proposed interpolation methods have the capability to reduce EM-based WZVC decoding complexity with small increment of bit rate.

Task Assignment Strategies for a Complex Real-time Network System

  • Kim Hong-Ryeol;Oh Jae-Joon;Kim Dae-Won
    • International Journal of Control, Automation, and Systems
    • /
    • v.4 no.5
    • /
    • pp.601-614
    • /
    • 2006
  • In this paper, a study on task assignment strategies for a complex real-time network system is presented. Firstly, two task assignment strategies are proposed to improve previous strategies. The proposed strategies assign tasks with meeting end-to-end real-time constraints, and also with optimizing system utilization through period modulation of the tasks. Consequently, the strategies aim at the optimizationto optimize of system performance with while still meeting real-time constraints. The proposed task assignment strategies are devised using the genetic algorithmswith heuristic real-time constraints in the generation of new populations. The strategies are differentiated by the optimization method of the two objectives-meeting end-to-end real-time constraints and optimizing system utilization: the first one has sequential genetic algorithm routines for the objectives, and the second one has one multiple objective genetic algorithm routine to find a Pareto solution. Secondly, the performances of the proposed strategies and a well-known existing task assignment strategy using the BnB(Branch and Bound) optimization are compared with one other through some simulation tests. Through the comparison of the simulation results, the most adequate task assignment strategies are proposed for some as system requirements-: the optimization of system utilization, the maximization of running tasktasks, and the minimization of the number of network node nodesnumber for a network system.

Physical Layer Security of AF Relay Systems With Jamming.

  • Ofori-Amanfo, Kwadwo Boateng;Lee, Kyoung-Jae
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2019.05a
    • /
    • pp.288-289
    • /
    • 2019
  • This paper studies the secrecy capacity for a wireless cooperative network with perfect channel state information at the relays, and receiver. A similar assumption is also made for the instance where there exist a direct link between the transmitter and receiver. Physical Layer security techniques are employed in wireless networks to mitigate against the activity of eavesdroppers. It offers a viable alternative to computationally intensive encryption. In this paper the design of a protocol utilizing jamming (via jamming nodes) for better security and relaying (via relay nodes) for the amplify-and-forward (AF) operation, is investigated. A a signal-to-noise variant of secrecy known as secrecy gap is explored because of its use of lesser computational power - preferable for practical systems. Thus we maximize this signal-to-noise approach instead of the conventional secrecy capacity maximization method. With this, an iterative algorithm using geometric programming (GP) and semi-definite programming (SDP) is presented with appreciable benefits. The results show here highlight the benefits of using fractional components of the powers of the relays to offer better secrecy capacity.

  • PDF

QoS Constrained Optimization of Cell Association and Resource Allocation for Load Balancing in Downlink Heterogeneous Cellular Networks

  • Su, Gongchao;Chen, Bin;Lin, Xiaohui;Wang, Hui;Li, Lemin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.5
    • /
    • pp.1569-1586
    • /
    • 2015
  • This paper considers the optimal cell association and resource allocation for load balancing in a heterogeneous cellular network subject to user's quality-of-service (QoS) constraints. We adopt the proportional fairness (PF) utility maximization formulation which also accommodates the QoS constraints in terms of minimum rate requirements. With equal resource allocation this joint optimization problem is either infeasible or requires relaxation that yields a solution which is difficult to implement. Nevertheless, we show that this joint optimization problem can be effectively solved without any priori assumption on resource allocation and yields a cell association scheme which enforces single BS association for each user. We re-formulated the joint optimization problem as a network-wide resource allocation problem with cardinality constraints. A reweighted heuristic l1-norm regularization method is used to obtain a sparse solution to the re-formulated problem. The cell association scheme is then derived from the sparsity pattern of the solution, which guarantees a single BS association for each user. Compared with the previously proposed method based on equal resource allocation, the proposed framework results in a feasible cell association scheme and yields a robust solution on resource allocation that satisfies the QoS constraints. Our simulations illustrate the impact of user's minimum rate requirements on cell association and demonstrate that the proposed approach achieves load balancing and enforces single BS association for users.

A Study on Kernel Size Adaptation for Correntropy-based Learning Algorithms (코렌트로피 기반 학습 알고리듬의 커널 사이즈에 관한 연구)

  • Kim, Namyong
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.22 no.2
    • /
    • pp.714-720
    • /
    • 2021
  • The ITL (information theoretic learning) based on the kernel density estimation method that has successfully been applied to machine learning and signal processing applications has a drawback of severe sensitiveness in choosing proper kernel sizes. For the maximization of correntropy criterion (MCC) as one of the ITL-type criteria, several methods of adapting the remaining kernel size ( ) after removing the term have been studied. In this paper, it is shown that the main cause of sensitivity in choosing the kernel size derives from the term and that the adaptive adjustment of in the remaining terms leads to approach the absolute value of error, which prevents the weight adjustment from continuing. Thus, it is proposed that choosing an appropriate constant as the kernel size for the remaining terms is more effective. In addition, the experiment results when compared to the conventional algorithm show that the proposed method enhances learning performance by about 2dB of steady state MSE with the same convergence rate. In an experiment for channel models, the proposed method enhances performance by 4 dB so that the proposed method is more suitable for more complex or inferior conditions.

Performance Analysis of Bandwidth Allocation Scheme using POBP Method in ATM Networks. (ATM 네트워크에서 POBP 방식을 이용한 대역폭 할당 방법의 성능분석)

  • 한상엽;박광채
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.4 no.3
    • /
    • pp.537-548
    • /
    • 2000
  • ATM is the effective information transmission method which multiply statistical and can accept effective the traffic of the various transmission rate. However, it can happen excessive cell loss probability and cell delay when it have temporarily overload. Therefore, it is required the effective traffic control and network resource management for which guarantee QoS(Quality of Service) in terms of users and bandwidth utilization maximization in terms of networks. In this paper, we proposed POBP(PushOut BP) scheme which mixed pushout scheme with BP(Back Pressure), reactive control scheme recommended at the ATM Forum, to guarantee QoS in two stages ATM switch networks. In proposed method, we have to understand exactly using bandwidth information in real-time and become traffic shaping. Thorough these processes, we can not only use effectively unused bandwidth, but also guarantee the fair bandwidth utilization and then can improve cell-loss possibility happened by congestion states in two stage ATM networks.

  • PDF

A Study on the Reference Evaluation Applying Conjoint Analysis of the Marketing Research (마케팅조사의 결합분석법을 활용한 참고봉사의 평가에 관한 연구)

  • Bae Soon Ja
    • Journal of the Korean Society for Library and Information Science
    • /
    • v.21
    • /
    • pp.141-168
    • /
    • 1991
  • The Purpose of this study is to explore and analyse ways of enhancing the effectiveness of reference service through reference evaluation. Marketing research technique combined with pre-evaluation theory was applied in this study to find out information for practice the service based on current concept of reference service. Aims and results of this study can be summarised as follows: First, the evaluation of effectiveness of reference service should be conducted for the purpose of finding out the ways of increasing user's satisfaction. Second, the policy evaluation was understood as the appropriated evaluation concept. The policy evaluation in principle coincides with reference service in sense that the satisfaction of public should have priority and hence be the criterion of the evaluation. Third, marketing research based on recently developed 'marketing concept', which concentrates all its efforts to meet user's demand and attempt to acquire the information for better marketing management of non-profit organization such as library, is examined to find out the evaluation method practically applicable to the pre-evaluation of reference service. In this study , conjoint analysis was adopted as the method of pre-evaluation about reference service. The Reference Room of the Central Library Yonsei University, was selected as the arget sample to find out the expected condition for the maximization of the user's satisfaction from the reference service. Based on this example study, the analysis indicates as the most desirable combination for reference service in terms of the user's satisfaction is following condition: the younger librarian with aimable personality who displays willingness In his/her assistance, plus as the method of reference service, sufficient and practical introduction to the reference materials available, plus immediate and satisfactory result of the service, and finally a library equipped with inter-library use system.

  • PDF