• 제목/요약/키워드: Allocation form

검색결과 217건 처리시간 0.023초

The Research on Herb and Its Allocation Form in Landscape

  • Zhang, Li-Qin;Piao, Yong-Ji;Shen, Ning;Cho, Tae-Dong
    • 한국환경과학회지
    • /
    • 제22권2호
    • /
    • pp.131-138
    • /
    • 2013
  • In order to provide a scientific foundation for herb application in landscape, the photographs were taken from the herb landscape in urban green space and sightseeing garden. The questionnaire-based survey was also applied to analyze the cognitive situation of herb. Most investigators love herb, but have a low level of herb; Interviewees' consideration of herb function lie in ornamental, healthcare and medical treatment; The bulk of the visitors think herb landscape is insufficient; Investigators' preferences for herb application forms are landscape edging and combining with stone. We also probe into the optimum allocation form combining herb with landscape elements. When we combine herb with landscape water or landscape architecture, artistic conception and reasonable plant allocation should be considered; When we combine herb with landscape path or garden ornament, reasonable plant disposition and appearance and practical collocation should be thought over; When we combine herb with flower-border, richly colored landscape and reasonable plant allocation should be deliberated on.

Bit Allocation for Interframe Video Coding Systems

  • Kim, Wook-Joong;Kim, Seong-Dae;Kim, Jin-Woong
    • ETRI Journal
    • /
    • 제24권4호
    • /
    • pp.280-289
    • /
    • 2002
  • In this work, we present a novel approach to the bit allocation problem that aims to minimize overall distortion subject to a bit rate constraint. The optimal solution can be found by the Lagrangian method with dynamic programming. However, the optimal bit allocation for block-based interframe coding is practically unattainable because of the interframe dependency of macroblocks caused by motion compensation. To reduce the computational burden while maintaining a result close to the optimum, i.e., near optimum, we propose an alternative method. First, we present a partitioned form of the bit allocation problem: a "frame-level problem" and "one-frame macroblock-level problems." We show that the solution to this new form is also the solution to the conventional bit allocation problem. Further, we propose a bit allocation algorithm using a "two-phase optimization technique" with an interframe dependency model and a rate-distortion model.

  • PDF

Improving Physical-Layer Security for Full-duplex Radio aided Two-Way Relay Networks

  • Zhai, Shenghua;An, Jianping
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제14권2호
    • /
    • pp.562-576
    • /
    • 2020
  • The power allocation optimization problem is investigated for improving the physical-layer security in two-way relaying networks, where a full-duplex relay based half-jamming protocol (HJP-FDR) is considered. Specially, by introducing a power splitter factor, HJP-FDR divides the relay's power into two parts: one for forwarding the sources' signals, the other for jamming. An optimization problem for power split factor is first developed, which is proved to be concave and closed-form solution is achieved. Moreover, we formulate a power allocation problem to determine the sources' power subject to the total power constraint. Applying the achieved closed-form solutions to the above-mentioned problems, a two-stage strategy is proposed to implement the overall power allocation. Simulation results highlight the effectiveness of our proposed algorithm and indicate the necessity of optimal power allocation.

Joint Relay-and-Antenna Selection and Power Allocation for AF MIMO Two-way Relay Networks

  • Wang, xiaoxiang;Zhou, Jia;Wang, DongYu
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제10권3호
    • /
    • pp.1016-1033
    • /
    • 2016
  • In this paper, we present a joint relay-and-antenna selection and power allocation strategy for multiple-input multi-output (MIMO) amplify-and-forward (AF) two-way relay networks (TWRNs). In our approach, we select the best transmit and receive antennas at the two sources, a best relay and a best transmit and receive antenna at the selected relay based on maximizing the minimum of the end-to-end received signal-to-noise-ratios (SNRs) under a total transmit power constraints. We obtained the closed-form solution for the optimal power allocation firstly. Then with the optimal allocation solution we found, we can reduce the joint relay-and-antenna selection to a simpler problem. Besides, the overall outage probability is investigated and a tight closed-form approximation is derived, which provides a method to evaluate the outage performance easily and fast. Simulation results are presented to verify the analysis.

Scratchpad Memory Architectures and Allocation Algorithms for Hard Real-Time Multicore Processors

  • Liu, Yu;Zhang, Wei
    • Journal of Computing Science and Engineering
    • /
    • 제9권2호
    • /
    • pp.51-72
    • /
    • 2015
  • Time predictability is crucial in hard real-time and safety-critical systems. Cache memories, while useful for improving the average-case memory performance, are not time predictable, especially when they are shared in multicore processors. To achieve time predictability while minimizing the impact on performance, this paper explores several time-predictable scratch-pad memory (SPM) based architectures for multicore processors. To support these architectures, we propose the dynamic memory objects allocation based partition, the static allocation based partition, and the static allocation based priority L2 SPM strategy to retain the characteristic of time predictability while attempting to maximize the performance and energy efficiency. The SPM based multicore architectural design and the related allocation methods thus form a comprehensive solution to hard real-time multicore based computing. Our experimental results indicate the strengths and weaknesses of each proposed architecture and the allocation method, which offers interesting on-chip memory design options to enable multicore platforms for hard real-time systems.

GPRS에서 채널 de-allocation 이용시 자원관리 정책 평가 비교 (Performance and comparison resource management policies with channel De-Allocation in GPRS Network)

  • 송윤경;박동선
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2003년도 하계종합학술대회 논문집 I
    • /
    • pp.61-64
    • /
    • 2003
  • GPRS is designed for transmitting packet data and supposed to take its radio resource form the pool of channels unused by GSM voice services. In this paper, The GPRS and GSM circuit switched services share the same radio resource. Whenever a channel is not used by circuit switched services, it may be utilized by GPRS. In this paper, the main aim is performance and comparison resource management policies with channel de-allocation in GPRS network. Three resource management policies is voice priority, R-reservation, dynamic reservation.

  • PDF

컨테이너 터미널의 자원 할당계획에 관한 연구 (Study on the Resource Allocation Planning of Container Terminal)

  • 장양자;장성용;양창호;박진우
    • 대한산업공학회지
    • /
    • 제28권1호
    • /
    • pp.14-24
    • /
    • 2002
  • We focus on resource allocation planning in container terminal operation planning problems and present network design model and genetic algorithm. We present a network design model in which arc capacities must be properly dimensioned to sustain the container traffic. This model supports various planning aspects of container terminal and brings in a very general form. The integer programming model of network design can be extended to accommodate vertical or horizontal yard configuration by adding constraints such as restricting the sum of yard cranes allocated to a block of yards. We devise a genetic algorithm for the network design model in which genes have the form of general integers instead of binary integers. In computational experiments, it is found that the genetic algorithm can produce very good solution compared to the optimal solution obtained by CPLEX in terms of computation time and solution quality. This algorithm can be used to generate many alternatives of a resource allocation plan for the container terminal and to evaluate the alternatives using various tools such as simulation.

On Power Calculation for First and Second Strong Channel Users in M-user NOMA System

  • Chung, Kyuhyuk
    • International journal of advanced smart convergence
    • /
    • 제9권3호
    • /
    • pp.49-58
    • /
    • 2020
  • Non-orthogonal multiple access (NOMA) has been recognized as a significant technology in the fifth generation (5G) and beyond mobile communication, which encompasses the advanced smart convergence of the artificial intelligence (AI) and the internet of things (IoT). In NOMA, since the channel resources are shared by many users, it is essential to establish the user fairness. Such fairness is achieved by the power allocation among the users, and in turn, the less power is allocated to the stronger channel users. Especially, the first and second strong channel users have to share the extremely small amount of power. In this paper, we consider the power optimization for the two users with the small power. First, the closed-form expression for the power allocation is derived and then the results are validated by the numerical results. Furthermore, with the derived analytical expression, for the various channel environments, the optimal power allocation is investigated and the impact of the channel gain difference on the power allocation is analyzed.

Long-term Fading Statistics-Based Power Allocation for Fixed Decode-and-Forward Relays

  • 공형윤;보 뉘웬 �o 바오
    • 한국통신학회논문지
    • /
    • 제33권12A호
    • /
    • pp.1138-1146
    • /
    • 2008
  • This paper considers 2-hop wireless cooperative communications networks with fixed decode-and-forward relays. Specifically, we first derive the closed-form BER expression for theoretically evaluating the end-to-end performance of these networks. Then, based on this expression and long-tenn fading statistics, we propose a power allocation method for source and relay. Such a method brings about multiple advantages in tenn of spectral efficiency and implementation complexity over other power allocation methods based on instantaneous fading statistics. A variety of numerical results reveal that the cooperative communications scheme with the proposed power allocation significantly outperforms that with the equal power allocation and the direct transmission scheme for any position of the relay subject to the same total transmit power constraint.

Joint Resource Allocation for Cellular and D2D Multicast Based on Cognitive Radio

  • Wu, Xiaolu;Chen, Yueyun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제8권1호
    • /
    • pp.91-107
    • /
    • 2014
  • Device-to-device (D2D) communication is an excellent technology to improve the system capacity by sharing the spectrum resources of cellular networks. Multicast service is considered as an effective transmission mode for the future mobile social contact services. Therefore, multicast based on D2D technology can exactly improve the spectrum resource efficiency. How to apply D2D technology to support multicast service is a new issue. In this paper, a resource allocation scheme based on cognitive radio (CR) for D2D underlay multicast communication (CR-DUM) is proposed to improve system performance. In the cognitive cellular system, the D2D users as secondary users employing multicast service form a group and reuse the cellular resources to accomplish a multicast transmission. The proposed scheme includes two steps. First, a channel allocation rule aiming to reduce the interference from cellular networks to receivers in D2D multicast group is proposed. Next, to maximize the total system throughput under the condition of interference and noise impairment, we formulate an optimal transmission power allocation jointly for the cellular and D2D multicast communications. Based on the channel allocation, optimal power solution is in a closed form and achieved by searching from a finite set and the interference between cellular and D2D multicast communication is coordinated. The simulation results show that the proposed method can not only ensure the quality of services (QoS), but also improve the system throughput.