• Title/Summary/Keyword: Constraint Resource

Search Result 206, Processing Time 0.022 seconds

Design of U-Healthcare Access Authority Control Model Using Context Constrain RBAC Model (상황제한 RBAC 모델을 이용한 U-헬스케어 접근권한 제어모델 설계)

  • Kim, Chang-Bok;Kim, Nam-Il;Park, Seong-Hwan
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.9 no.5
    • /
    • pp.233-242
    • /
    • 2009
  • The security of medical information need continued research about steady and flexible security model because of privacy of patient's as well as directly relation in the patient's life. In particular, u-healthcare environment is need flexible and detailed access control by variety changes of context. Control model analyzed relation of resource and authority, and analyzed authority about all accessible resource from access point using K2BASE. The context-based access control model can change flexibly authority change and role, and can obtain resource of authority granted and meaningly connected resource. As a result, this thesis can apply flexible and adaptive access control model at u-healthcare domain which context change various.

  • PDF

The Design and Implementation of an Agent for Resolving the Problem of Redundant Input of Distributed Human Resources Information (산재된 인력정보의 중복입력 문제 해결을 위한 에이전트 설계 및 구현 방법에 관한 연구)

  • Shon, Kang-Ryul;Han, Hee-Jun;Lim, Jong-Tae
    • Journal of Information Management
    • /
    • v.38 no.1
    • /
    • pp.75-98
    • /
    • 2007
  • Each domain of web services increased in geometrical progression by remarkable growth of the Internet serves various services or functions, and earns an income. And all services are divided by individual goal in each domain. What counts is that we must offer a personal data, our human resource information to use web service in the majority of cases. Otherwise we have to act under constraint in using the many web services. In this paper, we analyze the database structure or schema for managing human resource information from several web sites or service demands, and propose an agent design and implementation method for preventing duplication input of personal human resource information and sharing the human resource data.

Interference Pricing based Resource Allocation for D2D Communications in Cellular Networks

  • Li, Xiaomeng;Lv, Tiejun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.9
    • /
    • pp.4166-4182
    • /
    • 2018
  • We consider the Device-to-Device (D2D) communications in cellular networks where each cellular user (CU) shares the same resource with multiple D2D users (DUs). In this paper, we aim to maximize the energy efficiency (EE) of the D2D networks, subject to an interference constraint required by the CU. Since the cellular and D2D communications belong to different networks, we consider to incentivize base station (BS) while assisting the DUs. To this end, we propose a Stackelberg game based interference pricing framework for the considered D2D communications in cellular networks. Unlike most of the existing methods, we use interference pricing framework to jointly address the EE resource allocation problem and the interference management in our networks rather than only improve the EE of the DUs or protect cellular networks. In particular, BS and all the users do not need all channel state information, which is more realistic in practice. In addition, two different pricing strategies are also proposed. Based on the two strategies, we analyze the equilibrium of the game. Moreover, in the first strategy, the upper and lower boundaries of the interference price are obtained. The closed-form expression is gained with a backward induction for the second strategy. Both offer valuable insights to the considered scenarios. Finally, compared with the existing work, the EE of the D2D communications is significantly improved. The advantageous performance of our scheme are demonstrated by the simulation results.

A New Resource Allocation with Rate Proportionality Constraints in OFDMA Systems (OFDMA 시스템에서 비율적 전송률 분배를 위한 자원 할당)

  • Han, Seung-Youp;Oh, Eun-Sung;Han, Myeong-Su;Hong, Dae-Sik
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.45 no.1
    • /
    • pp.59-65
    • /
    • 2008
  • In this paper, a new adaptive resource allocation scheme is proposed in orthogonal frequency-division multiple access(OFDMA) systems with rate proportionality constraints. The problem of maximizing the overall system capacity with constraints on bit error rate, total transmission power and rate-proportionality for user requiring different classes of service is formulated. Since the optimal solution to the constrained fairness problem is extremely complex to obtain, a low-complexity suboptimal algorithm that separates subchannel allocation and power allocation is proposed. Firstly, the number of subchannels to be assigned to each user is determined based on the users' average signal-to-noise ratio and rate-proportion. Subchannels are subsequently distributed according to the modified max-min criterion. Lastly, based on the subchannel allocation, the optimal power allocation by solving the Language dual problem is proposed. Additionally, in order to reduce the computational complexity, iterative rate proportionality tracking algorithm is proposed for maximizing the capacity together with maintaining the rate proportionality constraint.

Optimization and Performance Analysis of Partial Multiplexing (부분 다중화의 성능 분석 및 최적화)

  • Kim, Seong Hwan;Ban, Tae Won;Jung, Bang Chul
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.7
    • /
    • pp.1589-1596
    • /
    • 2013
  • Recently, spectral efficiency or reliability is required to be improved in the scenario of multiple access. In this paper, we consider a scenario where two source nodes access one destination node. Different with conventional multiple access studies, in our research, a part of the allocated resource is shared by two source nodes and this scheme is called partial multiplexing. Let $R_s$ denote the ratio of the amount of the shared resource to that of the resource allocated to each user. We analyze and optimize the performance of the partial multiplexing in term of $R_s$. We show that the optimal $R_s$ to maximize the throughput is 1 or 0 based on approximated bit error rate (BER). In addition, if we set a constraint on frame error rate (FER), $R_s$ can have a value between 0 and 1. We also find the approximated $R_s$ to meet the constraint as a closed form. Partial multiplexing can be a novel multiple access scheme.

Joint Resource Allocation Scheme for OFDM Wireless-Powered Cooperative Communication Networks

  • Liang, Guangjun;Zhu, Qi;Xin, Jianfang;Pan, Ziyu
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.3
    • /
    • pp.1357-1372
    • /
    • 2017
  • Energy harvesting techniques, particularly radio frequency energy harvesting (RF-EH) techniques, which are known to provide feasible solutions to enhance the performance of energy constrained wireless communication systems, have gained increasing attention. In this paper, we consider a wireless-powered cooperative communication network (WPCCN) for transferring energy in the downlink and forwarding signals in the uplink. The objective is to maximize the average transmission rate of the system, subject to the total network power constraint. We formulate such a problem as a form of wireless energy transmission based on resource allocation that searches for the joint subcarrier pairing and the time and power allocation, and this can be solved by using a dual approach. Simulation results show that the proposed joint optimal scheme can efficiently improve system performance with an increase in the number of subcarriers and relays.

A Heuristic Approach to Budget-Mix Problems (여산믹스문제를 위한 발견적접근)

  • Lee Jae-Kwan
    • Journal of the military operations research society of Korea
    • /
    • v.6 no.1
    • /
    • pp.93-101
    • /
    • 1980
  • An effectively designed budget system in the poor resources environment necessarily has three design criteria : (i) to be both planning-oriented and control-oriented, (ii) to be both rationalistic and realistic, (iii) to be sensitive to the variations of resources environment. PPB system is an extreme (planning-oriented and rationalistic) and conventional OEB/OUB system is the other extreme (control-oriented and incrementalistic). Generally, the merits of rationalism are limited because of the infeasibility of applications. Hence, mixtures of the two extremes such as MBO, ZBB, and RZBB have been examined and applied during the last decade. The classical mathematical models of capital budgeting are the starting points of the development of the Budget-Mix Model introduced in this paper. They are modified by the followings: (i) technological-resource constraints, (ii) bounded-variable constraint, (iii) the exchange rules. Special emphasis is laid on the above (iii), because we need more efficient interresource exchanges in the budget-mix process. The Budget-Mix Model is not based on optimization, but a heuristic approach which assures a satisficing solution. And the application fields of this model range between the incremental Nonzero-Base Budgeting and the rational Zero-Base Budgeting. In this thesis, the author suggests 'the budget- mix concept' and a budget-mix model. Budget-mix is a decision process of making program-mix and resource-mix together. For keeping this concept in the existing organization realistic, we need the development of quantitative models describing budget-mix situations.

  • PDF

Margin Adaptive Optimization in Multi-User MISO-OFDM Systems under Rate Constraint

  • Wei, Chuanming;Qiu, Ling;Zhu, Jinkang
    • Journal of Communications and Networks
    • /
    • v.9 no.2
    • /
    • pp.112-117
    • /
    • 2007
  • In this paper, we focus on the total transmission power minimization problem for downlink beamforming multiple-input multiple-output (MIMO) orthogonal frequency division multiplexing (OFDM) systems while ensuring each user's QoS requirement. Although the linear integer programming (LIP) solution we formulate provides the performance upper bound of the margin adaptive (MA) optimization problem, it is hard to be implemented in practice due to its high computational complexity. By regarding each user's equivalent channel gain as approximate independent values and using iterative descent method, we present a heuristic MA resource allocation algorithm. Simulation results show that the proposed algorithm efficiently converges to the local optimum, which is very close to the performance of the optimal LIP solution. Compared with existing space division multiple access (SDMA) OFDM systems with or without adaptive resource allocation, the proposed algorithm achieves significant performance improvement by exploiting the frequency diversity and multi-user diversity in downlink multiple-input single-output (MISO) OFDM systems.

Energy Efficient Resource Allocation with Energy Harvesting in Cognitive Radio Networks (인지 라디오 네트워크에서 에너지 하베스팅을 고려한 에너지 효율적 자원 할당 방안)

  • Lee, Kisong;Lee, Woongsup
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.20 no.7
    • /
    • pp.1255-1261
    • /
    • 2016
  • Recently, the energy harvesting technology in which energy is collected from the wireless signal which is transmitted by mobile communication devices, has been considered as a novel way to improve the life time of wireless sensors by mitigating the lack of power supply problem. In this paper, we consider the optimal sensing time and power allocation problem for cognitive radio systems, where the energy efficiency of secondary user is maximized while the constraint are satisfied, using the optimization technique. Based on the derived optimal solutions, we also have proposed an iterative resource allocation algorithm in which the optimal power and sensing time allocation can be found without excessive computations. The simulation results confirm that the proposed scheme achieves the optimal performance and it outperforms the conventional resource allocation schemes in terms of energy efficiency while the constraints are guaranteed to be satisfied.

Organizational Program Management of Multiple Maintenance Projects Under Fund Constraints (복수 개${\cdot}$보수 프로젝트의 자금제약하 프로그램 관리 - 자원제약 마스터-일정계획을 중심으로 -)

  • Koo Kyo-Jin
    • Korean Journal of Construction Engineering and Management
    • /
    • v.5 no.2 s.18
    • /
    • pp.211-218
    • /
    • 2004
  • In a large owner organization, a program manager of multiple maintenance and remodeling projects has experienced increasing scale and complexity of coordinating the M/R projects with in-house technicians who belong to multiple trade shops. This paper proposes a dual-level hierarchical planning strategy that consists of a program master plan in the long-term horizon and a master construction schedule in an operational scheduling window. A rolling horizon approach to the program master plan is proposed to deal with the external uncertainty of unknown stream of project requests. A resource-constrained scheduling algorithm is developed to generate the master construction schedule in a scheduling window. During development of the algorithm, more emphasis is placed on long-term organizational resource continuity, especially flow management of program constraint resources, than ephemeral events of an individual activity and project. Monte Carlo simulation experiments of three scheduling windows are used to evaluate the relative performance of the proposed scheduling algorithm against three popular scheduling heuristics for resource-constrained multiple projects.