• Title/Summary/Keyword: Search process

Search Result 2,238, Processing Time 0.024 seconds

Operating Room Reservation Problem Considering Patient Priority : Modified Value Iteration Method with Binary Search (환자 우선순위를 고려한 수술실 예약 : 이진검색을 활용한 수정 평가치반복법)

  • Min, Dai-Ki
    • IE interfaces
    • /
    • v.24 no.4
    • /
    • pp.274-280
    • /
    • 2011
  • Delayed access to surgery may lead to deterioration in the patient condition, poor clinical outcomes, increase in the probability of emergency admission, or even death. The purpose of this work is to decide the number of patients selected from a waiting list and to schedule them in accordance with the operating room capacity in the next period. We formulate the problem as an infinite horizon Markov Decision Process (MDP), which attempts to strike a balance between the patient waiting times and overtime works. Structural properties of the proposed model are investigated to facilitate the solution procedure. The proposed procedure modifies the conventional value iteration method along with the binary search technique. An example of the optimal policy is provided, and computational results are given to show that the proposed procedure improves computational efficiency.

A Study on the Searching Behavior of the Online Database Searchers (온라인 데이터베이스 탐색자의 탐색 행태에 관한 연구)

  • 장혜란
    • Journal of the Korean Society for information Management
    • /
    • v.8 no.2
    • /
    • pp.32-73
    • /
    • 1991
  • The purpose of this study is to find important personal characteristics that affect search process and outcome, and to formulate causal models about searching behavior, by examining the channels and the magnitude of the factors identified. The study was designed to conduct a quasi-experiment with 67 student subjects. A total of 29 elements concerned with aptitude, personality, formal education, effectiveness of online training, search process, and search outcome are measured and reduced to 9 variables. 12 hypotheses were tested statistically and path analysis was done to investigate causal relationship among variables. Finally 5 models were formulated.

  • PDF

Simulation Optimization Methods with Application to Machining Process (시뮬레이션 최적화 기법과 절삭공정에의 응용)

  • 양병희
    • Journal of the Korea Society for Simulation
    • /
    • v.3 no.2
    • /
    • pp.57-67
    • /
    • 1994
  • For many practical and industrial optimization problems where some or all of the system components are stochastic, the objective functions cannot be represented analytically. Therefore, modeling by computer simulation is one of the most effective means of studying such complex systems. In this paper, with discussion of simulation optimization techniques, a case study in machining process for application of simulation optimization is presented. Most of optimization techniques can be classified as single-or multiple-response techniques. The optimization of single-response category, these strategies are gradient based search methods, stochastic approximate method, response surface method, and heuristic search methods. In the multiple-response category, there are basically five distinct strategies for treating the responses and finding the optimum solution. These strategies are graphical method, direct search method, constrained optimization, unconstrained optimization, and goal programming methods. The choice of the procedure to employ in simulation optimization depends on the analyst and the problem to be solved.

  • PDF

Performance Analysis of Layer Pruning on Sphere Decoding in MIMO Systems

  • Karthikeyan, Madurakavi;Saraswady, D.
    • ETRI Journal
    • /
    • v.36 no.4
    • /
    • pp.564-571
    • /
    • 2014
  • Sphere decoding (SD) for multiple-input and multiple-output systems is a well-recognized approach for achieving near-maximum likelihood performance with reduced complexity. SD is a tree search process, whereby a large number of nodes can be searched in an effort to find an estimation of a transmitted symbol vector. In this paper, a simple and generalized approach called layer pruning is proposed to achieve complexity reduction in SD. Pruning a layer from a search process reduces the total number of nodes in a sphere search. The symbols corresponding to the pruned layer are obtained by adopting a QRM-MLD receiver. Simulation results show that the proposed method reduces the number of nodes to be searched for decoding the transmitted symbols by maintaining negligible performance loss. The proposed technique reduces the complexity by 35% to 42% in the low and medium signal-to-noise ratio regime. To demonstrate the potential of our method, we compare the results with another well-known method - namely, probabilistic tree pruning SD.

Object tracking algorithm of Swarm Robot System for using Polygon based Q-learning and parallel SVM

  • Seo, Snag-Wook;Yang, Hyun-Chang;Sim, Kwee-Bo
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.8 no.3
    • /
    • pp.220-224
    • /
    • 2008
  • This paper presents the polygon-based Q-leaning and Parallel SVM algorithm for object search with multiple robots. We organized an experimental environment with one hundred mobile robots, two hundred obstacles, and ten objects. Then we sent the robots to a hallway, where some obstacles were lying about, to search for a hidden object. In experiment, we used four different control methods: a random search, a fusion model with Distance-based action making (DBAM) and Area-based action making (ABAM) process to determine the next action of the robots, and hexagon-based Q-learning, and dodecagon-based Q-learning and parallel SVM algorithm to enhance the fusion model with Distance-based action making (DBAM) and Area-based action making (ABAM) process. In this paper, the result show that dodecagon-based Q-learning and parallel SVM algorithm is better than the other algorithm to tracking for object.

A Route Search of Urban Traffic Network using Fuzzy Non-Additive Control (퍼지 비가법 제어를 이용한 도시 교통망의 경로 탐색)

  • 이상훈;김성환
    • Journal of Korean Society of Transportation
    • /
    • v.21 no.1
    • /
    • pp.103-113
    • /
    • 2003
  • This paper shows alternative route search and preference route search for the traffic route search, and proposes the use of the fuzzy non-additive controller by the application of AHP(analytic hierarchy process). It is different from classical route search and notices thinking method of human. Appraisal element, weight of route is extracted from basic of the opinion gathering for the driving expert and example of route model was used for the finding of practice utility. Model evaluation was performed attribute membership function making of estimate element, estimate value setting, weight define by the AHP, non additive presentation of weight according to $\lambda$-fuzzy measure and Choquet fuzzy integral. Finally, alternative route search was possible to real time traffic route search for the well variable traffic environment, and preference route search showed reflection of traffic route search disposition for the driver individual. This paper has five important meaning. (1)The approach is similar to the driver's route selection decision process. (2)The approach is able to control of route appraisal criteria for the multiple attribute. (3)The approach makes subjective judgement objective by a non additive. (4)The approach shows dynamic route search for the alternative route search. (5)The approach is able to consider characteristics of individual drivers attributed for the preference route search.

A study on service matching information for Web services Selection and process (매칭 정보를 이용한 웹 서비스 선정방법 및 선정 프로세스에 관한 연구)

  • Sim, Sung-Ho
    • Journal of Digital Convergence
    • /
    • v.11 no.12
    • /
    • pp.353-359
    • /
    • 2013
  • The search method that web services offers has its limitations. The search service considers only functional factors based on the client's preferences. In order to improve the web service search - which alone only considers functional factors - our research introduces an execution phase which performs both functional and non-functional factors by utilizing WSDL and matching information. Our research studies the architecture of both the service selecting method and the selecting process to help determine the best service solution for the client. We do so, taking into consideration the client's preferences. Our research also studies selecting methods for the best overall service. This service not only considers the matching of functional factors provided by the web service's selecting process, but it is also accommodating by matching the information as defined by the client. This paper research can offer the best quality service preferred by any end-user. Again, this is done by utilizing web services that considers the user's non-functional factors identified by the web service's selecting process and also by extracting matching information.

A Study on the Development of the Information Literacy Curriculum Model for Undergraduates Based on Kuhlthau's Information Search Process(ISP) Model (Kuhlthau의 ISP모델에 기반한 대학의 정보활용능력 교육과정 모델 개발 연구)

  • Kim, Ji-Eun
    • Journal of the Korean BIBLIA Society for library and Information Science
    • /
    • v.22 no.2
    • /
    • pp.101-122
    • /
    • 2011
  • Information literacy(IL) is the essential skill in the knowledge information society in the 21st century. Spreading the awareness of importance of IL across the world, the efforts to develop and implement IL standards or instructions are expanded around United States, United Kingdom, and Australia. In this study, Author extracts the core elements of IL from domestic and foreign IL standards and integrates those with Kuhlthau's Information Search Process(ISP) Model in order to develop the curriculum model of IL for undergraduates. The curriculum model has been constructed by consideration of capability of application to practice and expressed as the syllabus for the structure of university education. In the curriculum model, major instructional contents are extracted from 6 core elements of IL and the contents are organized by 6 ISP stages. Author suggests some successive studies based on the curriculum model for expansion and advancement of IL instruction.

Development of A Turn Label Based Optimal Path Search Algorithm (Turn Label 기반 최적경로탐색 알고리즘 개발)

  • Meeyoung Lee
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.23 no.2
    • /
    • pp.1-14
    • /
    • 2024
  • The most optimal route-search algorithm thus far has introduced a method of applying node labels and link labels. Node labels consider two nodes simultaneously in the optimal route-search process, while link labels consider two links simultaneously. This study proposes a turn-label-based optimal route-search technique that considers two turns simultaneously in the process. Turn-label-based optimal route search guarantees the optimal solution of dynamic programming based on Bellman's principle as it considers a two-turn search process. Turn-label-based optimal route search can accommodate the advantages of applying link labels because the concept of approaching the limit of link labels is applied equally. Therefore, it is possible to reflect rational cyclic traffic where nodes allow multiple visits without expanding the network, while links do not allow visits. In particular, it reflects the additional cost structure that appears in two consecutive turns, making it possible to express the structure of the travel-cost function more flexibly. A case study was conducted on the metropolitan urban railway network consisting of transportation card terminal readers, aiming to examine the scalability of the research by introducing parameters that reflect psychological resistance in travel with continuous pedestrian transfers into turn label optimal path search. Simulation results showed that it is possible to avoid conservative transfers even if the travel time and distance increase as the psychological resistance value for continuous turns increases, confirming the need to reflect the cost structure of turn labels. Nevertheless, further research is needed to secure diversity in the travel-cost functions of road and public-transportation networks.

Relating Consumption Values to Pre-purchase Decision Making of Apparels (소비가치와 의복구매전 의사결정과의 관계)

  • 한희정;김미숙
    • Journal of the Korean Society of Clothing and Textiles
    • /
    • v.26 no.6
    • /
    • pp.853-864
    • /
    • 2002
  • The purpose of this study was to measure consumption values and to investigate the differences in the process of decision making when purchasing apparel products among groups divided by consumption values. A self-administered questionnaire was distributed to 550 subjects in their 20's and 30's from Sepember 29th to October 25th in 2001; 463 were used for the data analysis. The results of this study were as follows; Consumption values were classified into five factors: Practical/functional value, Social/conformitive value, Subjective/aesthetic value, Epistemic value and Conspicuous value. Subjects were classified into 4 groups based on consumption values: the Conspicuous, the Epistemic, the Social/conformitive and the Indifferent. There were significant differences among the four groups in selected motives in the problem recognition process. Significant differences were found among the groups in own taste & personality in the information search process. Significant difference were also found in the importance of design, color, price, coordination, fashion and self-image in the alternative evaluation process.