• Title/Summary/Keyword: optimization scheme

Search Result 1,157, Processing Time 0.026 seconds

Frequency Allocation and Path Selection Scheme in Underlay Cognitive Radio Networks Using Network Coding (네트워크 코딩을 쓰는 언더레이 인지 무선 네트워크에서의 주파수 할당과 경로 선택 기법)

  • Lee, Do-Haeng;Lee, Won Hyoung;Kang, Sung-Min;Hwang, Ho Young
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.40 no.12
    • /
    • pp.2372-2380
    • /
    • 2015
  • In this paper, we propose frequency allocation and path selection scheme in underlay cognitive radio (CR) networks using network coding. In the proposed scheme, we choose the path with consideration of network coding and interference temperature in underlay CR networks and propose an optimization problem to maximize the system throughput of secondary users (SUs). Then, we represent the proposed optimization problem as the multi-dimensional multiple-choice knapsack problem and give the theoretical upper bound for the system throughput of SUs by using linear programming. Finally, we compute the system throughput of SUs by using brute-force search (BFS) and link quality first (LQF) scheme in underlay CR networks. Simulation results show that the system throughput of SUs with BFS is higher than that with LQF in underlay CR networks with and without application of network coding, respectively.

Replica Update Propagation Method for Cost Optimization of Request Forwarding in the Grid Database (그리드 데이터베이스에서 전송비용 최적화를 위한 복제본 갱신 전파 기법)

  • Jang, Yong-Il;Baek, Sung-Ha;Bae, Hae-Young
    • Journal of Korea Multimedia Society
    • /
    • v.9 no.11
    • /
    • pp.1410-1420
    • /
    • 2006
  • In this paper, a replica update propagation method for cost optimization of request forwarding in the Grid database is proposed,. In the Grid database, the data is replicated for performance and availability. In the case of data update, update information is forwarded to the neighbor nodes to synchronize with the others replicated data. There are two kinds of update propagation method that are the query based scheme and the log based scheme. And, only one of them is commonly used. But, because of dynamically changing environment through property of update query and processing condition, strategies that using one propagation method increases transmission cost in dynamic environment. In the proposed method, the three classes are defined from two cost models of query and log based scheme. And, cost functions and update propagation method is designed to select optimized update propagation scheme from these three classes. This paper shows a proposed method has an optimized performance through minimum transmission cost in dynamic processing environment.

  • PDF

A MAC Parameter Optimization Scheme for IEEE 802.11e-based Multimedia Networks (IEEE 802.11e 기반 멀티미디어 네트워크를 위한 MAC 매개 변수 최적화 방법)

  • Sung, Min-Young
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.9 no.2
    • /
    • pp.455-461
    • /
    • 2008
  • Enhanced Distributed Channel Access (EDCA) is a channel access scheme adopted by the IEEE 802.11e draft standard for QoS-enabled wireless local area networks. It classifies traffic into separate Access Categories (ACs) and achieves service differentiation by allowing each AC to have its own values of channel access parameters. This paper proposes a scheme to dynamically adapt the EDCA parameters to traffic environment so that they both maximize the throughput of non real-time traffics and meet the delay and throughput constraints of real-time traffics. For this purpose, we develop a design algorithm for efficient exploration of the EDCA parameter space. Using the algorithm, we derive a Pareto curve fur delay-throughput trade-off in each anticipated traffic environment. The Pareto database can then be used to optimally adjust the parameter according to the traffic environment and administrative policies. Simulation results show that compared with the default parameter configuration, the proposed scheme is better for delay, throughput guarantee and can improve the throughput of non real-time traffics by 12% on average.

RBFNN Based Decentralized Adaptive Tracking Control Using PSO for an Uncertain Electrically Driven Robot System with Input Saturation (입력 포화를 가지는 불확실한 전기 구동 로봇 시스템에 대해 PSO를 이용한 RBFNN 기반 분산 적응 추종 제어)

  • Shin, Jin-Ho;Han, Dae-Hyun
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.19 no.2
    • /
    • pp.77-88
    • /
    • 2018
  • This paper proposes a RBFNN(Radial Basis Function Neural Network) based decentralized adaptive tracking control scheme using PSO(Particle Swarm Optimization) for an uncertain electrically driven robot system with input saturation. Practically, the magnitudes of input voltage and current signals are limited due to the saturation of actuators in robot systems. The proposed controller overcomes this input saturation and does not require any robot link and actuator model parameters. The fitness function used in the presented PSO scheme is expressed as a multi-objective function including the magnitudes of voltages and currents as well as the tracking errors. Using a PSO scheme, the control gains and the number of the RBFs are tuned automatically and thus the performance of the control system is improved. The stability of the total control system is guaranteed by the Lyapunov stability analysis. The validity and robustness of the proposed control scheme are verified through simulation results.

MPC-based Two-stage Rolling Power Dispatch Approach for Wind-integrated Power System

  • Zhai, Junyi;Zhou, Ming;Dong, Shengxiao;Li, Gengyin;Ren, Jianwen
    • Journal of Electrical Engineering and Technology
    • /
    • v.13 no.2
    • /
    • pp.648-658
    • /
    • 2018
  • Regarding the fact that wind power forecast accuracy is gradually improved as time is approaching, this paper proposes a two-stage rolling dispatch approach based on model predictive control (MPC), which contains an intra-day rolling optimal scheme and a real-time rolling base point tracing scheme. The scheduled output of the intra-day rolling scheme is set as the reference output, and the real-time rolling scheme is based on MPC which includes the leading rolling optimization and lagging feedback correction strategy. On the basis of the latest measured thermal unit output feedback, the closed-loop optimization is formed to correct the power deviation timely, making the unit output smoother, thus reducing the costs of power adjustment and promoting wind power accommodation. We adopt chance constraint to describe forecasts uncertainty. Then for reflecting the increasing prediction precision as well as the power dispatcher's rising expected satisfaction degree with reliable system operation, we set the confidence level of reserve constraints at different timescales as the incremental vector. The expectation of up/down reserve shortage is proposed to assess the adequacy of the upward/downward reserve. The studies executed on the modified IEEE RTS system demonstrate the effectiveness of the proposed approach.

A method for purifying reprocessed uranium from even isotopes under conditions of multiple recycle

  • Smirnov, A.Yu.;Palkin, V.A.;Chistov, A.V.;Sulaberidze, G.A.
    • Nuclear Engineering and Technology
    • /
    • v.54 no.10
    • /
    • pp.3650-3659
    • /
    • 2022
  • We proposed a modification of a double cascade scheme to enrich reprocessed uranium. Such a cascade scheme represents a combination of one cascade with "broadening" of the flow and an ordinary three-flow cascade. A calculation and optimization method has been developed for the proposed scheme according to various efficiency criteria. It is shown that the proposed scheme makes it possible to obtain low-enriched uranium of commercial quality using reprocessed uranium of different initial compositions. For example, the enrichment of reprocessed uranium, which had gone through five consequent recycles, was considered. The proposed scheme allowed to enrich it with simultaneous fulfillment of restrictions on isotopes 232U, 234U, and 236U. Such results indicate the scheme's applicability under conditions of multiple recycling of uranium in reactor fuel. Computational experiments have shown that in the proposed modification, a noticeable saving of natural uranium in the cycle (~18%) can be achieved, provided that the additional consumption of separative work does not exceed 10%, compared with the case of enrichment of natural uranium to obtain LEU of equivalent quality.

Design Optimization of A Multi-Blade Centrifugal Fan with Navier-Stokes Analysis and Response Surface Method (삼차원 Navier-Stokes 해석과 반응면기법을 이용한 원심다익송풍기의 최적설계)

  • Seo, Seoung-Jin;Kim, Kwang-Yong
    • Transactions of the Korean Society of Mechanical Engineers B
    • /
    • v.27 no.10
    • /
    • pp.1457-1463
    • /
    • 2003
  • In this paper, the response surface method using three-dimensional Navier-Stokes analysis to optimize the shape of a multi-blade centrifugal fan, is described. For numerical analysis, Reynolds-averaged Navier-Stokes equations with standard k - c turbulence model are transformed into non-orthogonal curvilinear coordinate system, and are discretized with finite volume approximations. Due to the large number of blades in this centrifugal fan, the flow inside of the fan is regarded as steady flow by introducing the impeller force models for economic calculations. Linear Upwind Differencing Scheme(LUDS) is used to approximate the convection terms in the governing equations. SIMPLEC algorithm is used as a velocity-pressure correction procedure. Design variables, location of cur off, radius of cut off, expansion angle of scroll and width of impeller were selected to optimize the shapes of scroll and blades. Data points for response evaluations were selected by D-optimal design, and linear programming method was used for the optimization on the response surface. As a main result of the optimization, the efficiency was successfully improved. It was found that the optimization process provides reliable design of this kind of fans with reasonable computing time.

Trajectory Optimization for Nonlinear Tracking Control in Stratospheric Airship Platform (비선형 추종제어를 위한 성층권비행선의 궤적 최적화)

  • Lee, Sang-Jong;Bang, Hyo-Choong;Chang, Jae-Won;Seong, Kie-Jeong
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.37 no.1
    • /
    • pp.42-54
    • /
    • 2009
  • Contrast to the 6-DOF nonlinear dynamic modeling of nonlinear tracking problem, 3-DOF point-mass modeling of flight mechanics is efficient and adequate for applying the trajectory optimization problem. There exist limitations to apply an optimal trajectory from point-mass modeling as a reference trajectory directly to conduct the nonlinear tracking control, In this paper, new matching trajectory optimization scheme is proposed to compensate those differences of mismatching. To verify performance of proposed method, full ascent three-dimensional flight trajectories are obtained by reflecting the real constraints of flight conditions and airship performance with and without jet stream condition. Then, they are compared with the optimal trajectories obtained from conventional method.

Query Optimization Scheme using Query Classification in Hybrid Spatial DBMS (하이브리드 공간 DBMS에서 질의 분류를 이용한 최적화 기법)

  • Chung, Weon-Il;Jang, Seok-Kyu
    • The Journal of the Korea Contents Association
    • /
    • v.8 no.1
    • /
    • pp.290-299
    • /
    • 2008
  • We propose the query optimization technique using query classification in hybrid spatial DBMS. In our approach, user queries should to be classified into three types: memory query, disk query, and hybrid query. Specialty, In the hybrid query processing, the query predicate is divided by comparison between materialized view creating conditions and user query conditions. Then, the deductions of the classified queries' cost formula are used for the query optimization. The optimization is mainly done by the selection algorithm of the smallest cost data access path. Our approach improves the performance of hybrid spatial DBMS than traditional disk-based DBMS by $20%{\sim}50%$.

Development of an Efficient Optimization Technique for Robust Design by Approximating Probability Constratints (확률조건의 근사화를 통한 효율적인 강건 최적설계 기법의 개발)

  • Jeong, Do-Hyeon;Lee, Byeong-Chae
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.24 no.12
    • /
    • pp.3053-3060
    • /
    • 2000
  • Alternative formulation is presented for robust optimization problems and an efficient computational scheme for reliability estimation is proposed. Both design variables and design parameters considered as random variables about their nominal values. To ensure the robustness of objective performance a new cost function bounding the performance and a new constraint limiting the performance variation are introduced. The constraint variations are regulated by considering the probability of feasibility. Each probability constraint is transformed into a sub-optimization problem and then is resolved with the modified advanced first order second moment(AFOSM) method for computational efficiency. The proposed robust optimization method has advantages that the mean value and the variation of the performance function are controlled simultaneously and the second order sensitivity information is not required even in case of gradient based optimization. The suggested method is examined by solving three examples and the results are compared with those for deterministic case and those available in literature.