• Title/Summary/Keyword: Feasible solution set

Search Result 56, Processing Time 0.019 seconds

Centralized Channel Allocation Schemes for Incomplete Medium Sharing Systems with General Channel Access Constraints (불완전매체공유 시스템을 위한 집중방식 채널할당기법)

  • Kim Dae-Woo;Lee Byoung-Seok;Choe Jin-Woo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.3B
    • /
    • pp.183-198
    • /
    • 2006
  • We define the incomplete medium sharing system as a multi-channel shared medium communication system where constraints are imposed to the set of channels that may be allocated to some transmitter-receiver node pairs. To derive a centralized MAC scheme of a incomplete medium sharing system, we address the problem of optimal channel allocation The optimal channel allocation problem is then translated into a max-flow problem in a multi-commodity flow graph, and it is shown that the optimal solution can then be obtained by solving a linear programming problem. In addition, two suboptimal channel allocation schemes are proposed to bring down the computational complexity to a practical/feasible level; (1) one is a modified iSLIP channel allocation scheme, (2) the other is sequential channel allocation scheme. From the results of a extensive set of numerical experiments, it is found that the suboptimal schemes evaluate channel utilization close to that of the optimal schemes while requiring much less amount of computation than the optimal scheme. In particular, the sequential channel allocation scheme is shown to achieve higher channel utilization with less computational complexity than . the modified iSLIP channel allocation scheme.

An Efficient Search Space Generation Technique for Optimal Materialized Views Selection in Data Warehouse Environment (데이타 웨어하우스 환경에서 최적 실체뷰 구성을 위한 효율적인 탐색공간 생성 기법)

  • Lee Tae-Hee;Chang Jae-young;Lee Sang-goo
    • Journal of KIISE:Databases
    • /
    • v.31 no.6
    • /
    • pp.585-595
    • /
    • 2004
  • A query processing is a critical issue in data warehouse environment since queries on data warehouses often involve hundreds of complex operations over large volumes of data. Data warehouses therefore build a large number of materialized views to increase the system performance. Which views to materialized is an important factor on the view maintenance cost as well as the query performance. The goal of materialized view selection problem is to select an optimal set of views that minimizes total query response time in addition to the view maintenance cost. In this paper, we present an efficient solution for the materialized view selection problem. Although the optimal selection of materialized views is NP-hard problem, we developed a feasible solution by utilizing the characteristics of relational operators such as join, selection, and grouping.

An Exact Solution Approach for Release Planning of Software Product Lines (소프트웨어 제품라인의 출시 계획을 위한 최적해법)

  • Yoo, Jae-Wook
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.35 no.2
    • /
    • pp.57-63
    • /
    • 2012
  • Software release planning model of software product lines was formulated as a precedence-constrained multiple 0-1 knapsack problem. The purpose of the model was to maximize the total profit of an entire set of selected features in a software product line over a multi-release planning horizon. The solution approach is a dynamic programming procedure. Feasible solutions at each stage in dynamic programming are determined by using backward dynamic programming approach while dynamic programming for multi-release planning is forward approach. The pre-processing procedure with a heuristic and reduction algorithm was applied to the single-release problems corresponding to each stage in multi-release dynamic programming in order to reduce the problem size. The heuristic algorithm is used to find a lower bound to the problem. The reduction method makes use of the lower bound to fix a number of variables at either 0 or 1. Then the reduced problem can be solved easily by the dynamic programming approaches. These procedures keep on going until release t = T. A numerical example was developed to show how well the solution procedures in this research works on it. Future work in this area could include the development of a heuristic to obtain lower bounds closer to the optimal solution to the model in this article, as well as computational test of the heuristic algorithm and the exact solution approach developed in this paper. Also, more constraints reflecting the characteristics of software product lines may be added to the model. For instance, other resources such as multiple teams, each developing one product or a platform in a software product line could be added to the model.

Solution and Estimate to the Angular Velocity of INS Formed only by Linear Accelerometers

  • Junwei, Wu;Jinfeng, Liu;Yunan, Zhang;Na, Yuan
    • Proceedings of the Korean Institute of Navigation and Port Research Conference
    • /
    • v.1
    • /
    • pp.103-107
    • /
    • 2006
  • At present, most efforts tend to develop a INS which is only based linear accelerometers, because of the low cost micro-machining gyroscopes lack of the accuracy needed for precise navigation application and possible achieving the required levels of precise for micro-machining accelerometer. Although it was known in theory that a minimum of six accelerometers are required for a complete description of a rigid body motion, and any configuration of six accelerometers (except for a "measure zero " set of six-accelerometer schemes) will work. Studies on the feasible configuration of GF-INS indicate that the errors of angular velocity resolved from the six accelerometers scheme are diverged with time or have multi solutions. The angular velocity errors are induced by the biases together with the position vectors of the accelerometers, therefore, in order to treat with the problem just mentioned, researchers have been doing many efforts, such as the extra three accelerometers or the magnetometers may be taken as the reference information, the extended Kalman filter (EKF) involved to make the angular velocity errors bound and be estimated, and so on. In this paper, the typical configurations of GF-INS are introduced; for each type GF-INS described, the solutions to the angular velocity and the specific force are derived and the characteristic is indicated; one of the corresponding extend Kalman filters are introduced to estimate the angular errors; parts of the simulation results are presented to verify the validity of the equations of angular velocity and specific force and the performance of extend Kalman filter.

  • PDF

Multi-day Trip Planning System with Collaborative Recommendation (협업적 추천 기반의 여행 계획 시스템)

  • Aprilia, Priska;Oh, Kyeong-Jin;Hong, Myung-Duk;Ga, Myeong-Hyeon;Jo, Geun-Sik
    • Journal of Intelligence and Information Systems
    • /
    • v.22 no.1
    • /
    • pp.159-185
    • /
    • 2016
  • Planning a multi-day trip is a complex, yet time-consuming task. It usually starts with selecting a list of points of interest (POIs) worth visiting and then arranging them into an itinerary, taking into consideration various constraints and preferences. When choosing POIs to visit, one might ask friends to suggest them, search for information on the Web, or seek advice from travel agents; however, those options have their limitations. First, the knowledge of friends is limited to the places they have visited. Second, the tourism information on the internet may be vast, but at the same time, might cause one to invest a lot of time reading and filtering the information. Lastly, travel agents might be biased towards providers of certain travel products when suggesting itineraries. In recent years, many researchers have tried to deal with the huge amount of tourism information available on the internet. They explored the wisdom of the crowd through overwhelming images shared by people on social media sites. Furthermore, trip planning problems are usually formulated as 'Tourist Trip Design Problems', and are solved using various search algorithms with heuristics. Various recommendation systems with various techniques have been set up to cope with the overwhelming tourism information available on the internet. Prediction models of recommendation systems are typically built using a large dataset. However, sometimes such a dataset is not always available. For other models, especially those that require input from people, human computation has emerged as a powerful and inexpensive approach. This study proposes CYTRIP (Crowdsource Your TRIP), a multi-day trip itinerary planning system that draws on the collective intelligence of contributors in recommending POIs. In order to enable the crowd to collaboratively recommend POIs to users, CYTRIP provides a shared workspace. In the shared workspace, the crowd can recommend as many POIs to as many requesters as they can, and they can also vote on the POIs recommended by other people when they find them interesting. In CYTRIP, anyone can make a contribution by recommending POIs to requesters based on requesters' specified preferences. CYTRIP takes input on the recommended POIs to build a multi-day trip itinerary taking into account the user's preferences, the various time constraints, and the locations. The input then becomes a multi-day trip planning problem that is formulated in Planning Domain Definition Language 3 (PDDL3). A sequence of actions formulated in a domain file is used to achieve the goals in the planning problem, which are the recommended POIs to be visited. The multi-day trip planning problem is a highly constrained problem. Sometimes, it is not feasible to visit all the recommended POIs with the limited resources available, such as the time the user can spend. In order to cope with an unachievable goal that can result in no solution for the other goals, CYTRIP selects a set of feasible POIs prior to the planning process. The planning problem is created for the selected POIs and fed into the planner. The solution returned by the planner is then parsed into a multi-day trip itinerary and displayed to the user on a map. The proposed system is implemented as a web-based application built using PHP on a CodeIgniter Web Framework. In order to evaluate the proposed system, an online experiment was conducted. From the online experiment, results show that with the help of the contributors, CYTRIP can plan and generate a multi-day trip itinerary that is tailored to the users' preferences and bound by their constraints, such as location or time constraints. The contributors also find that CYTRIP is a useful tool for collecting POIs from the crowd and planning a multi-day trip.

An Operations Study on a Home Health Nursing Demonstration Program for the Patients Discharged with Chronic Residual Health Care Problems (추후관리가 필요한 만성질환 퇴원환자 가정간호 시범사업 운영 연구)

  • 홍여신;이은옥;이소우;김매자;홍경자;서문자;이영자;박정호;송미순
    • Journal of Korean Academy of Nursing
    • /
    • v.20 no.2
    • /
    • pp.227-248
    • /
    • 1990
  • The study was conceived in relation to a concern over the growing gap between the needs of chronic patients and the availability of care from the current health care system in Korea. Patients with agonizing chronic pain, discomfort, despair and disability are left with helplessly unprepared families with little help from the acute care oriented health care system after discharge from hospital. There is a great need for the development of an alternative means of quality care that is economically feasible and culturally adaptible to our society. Thus, the study was designed to demonstrate the effectiveness of home heath care as an alternative to bridge the existing gap between the patients' needs and the current practice of health care. The study specifically purports to test the effects of home care on health expenditure, readmission, job retention, compliance to health care regime, general conditions, complications, and self-care knowledge and practices. The study was guided by the operations research method advocated by the Primary Health Care Operations Research Institute(PRICOR) which constitutes 3 stages of research : namely, problem analysis solution development, and solution validation. The first step in the operations research was field preparation to develop the necessary consensus and cooperation. This was done through the formation of a consulting body at the hospital and a steering committee among the researchers. For the stage of problem analysis, the Annual Report of Seoul National University Hospital and the patients records for last 5 years were reviewed and selective patient interviews were conducted to find out the magnitude of chronic health problems and areas of unmect health care needs to finally decide on the kinds of health problems to study. On the basis of problem analysis, the solution development stage was devoted to home care program development asa solution alternative. Assessment tools, teaching guidelines and care protocols were developed and tested for their validity. The final stage was the stage of experimentation and evaluation. Patients with liver diseases, hemiplegic and diabetic conditions were selected as study samples. Discharge evaluation, follow up home care, measurement and evaluation were carried out according to the protocols of care and measurement plan for each patient for the period of 6 months after discharge. The study was carried out for the period from Jan. 1987 to Dec. 1989. The following are the results of the study presented according to the hypotheses set forth for the study ; 1. Total expenditures for the period of study were not reduced for the experimental group, however, since the cost per hospital visit is about 4 times as great as the cost per home visit, the effect of cost saving by home care will become a reality as home care replaces part of the hospital visits. 2. The effect on the rate of readmission and job retention was found to be statistically nonsignificant though the number of readmission was less among the experimental group receiving home care. 3. The effect on compliance to the health care regime was found to be statistically significant at the 5% level for hepatopathic and diabetic patients. 4. Education on diet, rest and excise, and medication through home care had an effect on improved liver function test scores, prevention of complications and self - care knowledge in hepatopathic patients at a statistically significant level. 5. In hemiplegic patient, home care had an effect on increased grasping power at a significant level. However. there was no significant difference between the experimental and control groups in the level of compliane, prevention of complications or in self-care practices. 6. In diabetic patients, there was no difference between the experimental and control groups in scores of laboratory tests, appearance of complications, and self-care knowledge or self -care practices. The above findings indicate that a home care program instituted for such short term as 6 months period could not totally demonstrate its effectiveness at a statistically significant level by quantitative analysis however, what was shown in part in this analysis, and in the continuous consultation sought by those who had been in the experimental group, is that home health care has a great potential in retarding or preventing pathological progress, facilitating rehabilitative and productive life, and improving quality of life by adding comfort, confidence and strength to patients and their families. For the further studies of this kind with chronic patients it is recommended that a sample of newly diagnosed patients be followed up for a longer period of time with more frequent observations to demonstrate a more dear- cut picture of the effectiveness of home care.

  • PDF