• 제목/요약/키워드: requests

검색결과 1,530건 처리시간 0.039초

대학도서관 희망도서의 신청 패턴과 이용효과 분석에 관한 연구 (A Study on the Pattern and Efficiency of Patron-Driven Acquisition in Academic Libraries)

  • 권소담;남영준
    • 정보관리학회지
    • /
    • 제35권4호
    • /
    • pp.263-284
    • /
    • 2018
  • 대학도서관은 구성원이 교육과 연구를 수행하는 데 있어 필요수적인 자료를 선정하여 구입할 필요가 있다. 따라서 이용자의 정보 요구를 장서 개발에 반영하는 방법으로 희망도서 제도를 운영하고 있다. 본 연구는 10년간의 장기적 관점에서 희망도서 신청 과정과 결과를 분석하였다. 희망도서는 단행본에 대한 강력한 정보 요구이기 때문에 주제 분야별 이용자의 정보 요구 패턴을 파악할 수 있었다. 대학 구성원으로서 이용자는 전공하는 학문 분야에 대해서는 전공 도서를 선정하면서도 다른 주제 분야의 교양 도서를 적절히 선정하여 장서 구성에 기여하고 있었다. 결과적으로 희망도서는 소수의 이용자에 의해 선정이 이루어지지만 도서관 전체 이용자의 정보 요구를 충족시키고 있어 효율적인 장서 개발 정책으로 운용되고 있다고 볼 수 있다.

데이터 갱신요청의 연속성과 빈도를 고려한 개선된 핫 데이터 검증기법 (Improved Hot data verification considering the continuity and frequency of data update requests)

  • 이승우
    • 사물인터넷융복합논문지
    • /
    • 제8권5호
    • /
    • pp.33-39
    • /
    • 2022
  • 모바일 컴퓨팅 분야에서 사용되는 저장장치는 저전력, 경량화, 내구성 등을 갖추어야 하며 사용자에 의해 생성되는 대용량 데이터를 효과적으로 저장 및 관리할 수 있어야 한다. 낸드 플래시 메모리는 모바일 컴퓨팅 분야에서 저장장치로 주로 사용되고 있다. 낸드 플래시 메모리는 구조적 특징 때문에 데이터 갱신요청 시 제자리 덮어쓰기가 불가능하여 데이터 갱신요청이 자주 발생하는 요청과 그렇지 않은 요청을 정확히 구분하여 각 블록에 저장 및 관리함으로써 해결할 수 있다. 이러한 데이터 갱신요청에 분류기법을 핫 데이터 식별 기법이라고 하며 현재 다양한 연구가 진행되었다. 본 논문은 더 정확한 핫 데이터 검증을 위해 카운팅 필터를 사용하여 데이터 갱신요청 발생을 연속적으로 기록하고 또한 특정 시간 동안 요청된 갱신요청이 얼마나 자주 발생하는지를 고려하여 핫 데이터를 검증한다.

DQDB망 소거노드 알고리즘 (An Erasure Node Algorithm for DQDB Networks)

  • 전병천;김대영
    • 전자공학회논문지A
    • /
    • 제29A권11호
    • /
    • pp.1-13
    • /
    • 1992
  • In this DQDB networks, erasure nodes may be allocated on the bus and release slots which already had been read by destination nodes. An important function of the erasure node must be to eliminate as many requests as erased slots used by downstream nodes. In the networks with priorities, following two additional issues must be solved : (1) accurately to guess for which priority the erased slots is to be used, and (2) to find in a short period a request of that priority to cancel. In this paper, we propose two erasure node algorithms based on elimination of the requests. In these algorithms, the requests are eliminated excessively at low load but optimum elimination can be achieved at full load. Simulation results show that these two algorithms have similar access delay to that of existing algorithms at low load and better performance at high load.

  • PDF

2-단계 공급사슬경영 시스템에서 주문배달 및 수거를 위한 차량운송계획 모델 (A Vehicle Pickup and Deliverly Scheduling with Advance Requests Tin a 2-Echelon Supply-Chain System)

  • 황흥석
    • 산업공학
    • /
    • 제13권3호
    • /
    • pp.462-470
    • /
    • 2000
  • This paper is concerned with a vehicle routing model to assist in scheduling palletized cargo pickup and delivery so called the pickup and delivery problem with advance requests in a 2-echelon supply-chain system. In this study vehicles is dispatched and routed so that each request is picked up or delivered at its original and to its destination. The model provides point-to-point transportations based on advance requests. The assignment algorithm is developed and designed for using with on-line computers and it immediately provides arrangements to be made at the time requested. This algorithm also provides the best scheduling solutions and alternatives for both to system operators and requesters. According to this algorithm, we developed computer programs and show the sample results.

  • PDF

Locating Idle Vehicles in Tandem-Loop Automated Guided Vehicle Systems to Minimize the Maximum Response Time

  • Lee, Shiwoo
    • Industrial Engineering and Management Systems
    • /
    • 제6권2호
    • /
    • pp.125-135
    • /
    • 2007
  • An automated guided vehicle (AGV) system is a group of collaborating unmanned vehicles which is commonly used for transporting materials within manufacturing, warehousing, or distribution systems. The performance of an AGV system depends on the dispatching rules used to assign vehicles to pickup requests, the vehicle routing protocols, and the home location of idle vehicles, which are called dwell points. In manufacturing and distribution environments which emphasize just-in-time principles, performance measures for material handling are based on response times for pickup requests and equipment utilization. In an AGV system, the response time for a pickup request is the time that it takes for the vehicle to travel from its dwell point to the pickup station. In this article, an exact dynamic programming algorithm for selecting dwell points in a tandem-loop multiple-vehicle AGV system is presented. The objective of the model is to minimize the maximum response time for all pickup requests in a given shift. The recursive algorithm considers time restrictions on the availability of vehicles during the shift.

Request Deduplication Scheme in Cache-Enabled 5G Network Using PON

  • Jung, Bokrae
    • Journal of information and communication convergence engineering
    • /
    • 제18권2호
    • /
    • pp.100-105
    • /
    • 2020
  • With the advent of the 5G era, the rapid growth in demand for mobile content services has increased the need for additional backhaul investment. To meet this demand, employing a content delivery network (CDN) and optical access solution near the last mile has become essential for the configuration of 5G networks. In this paper, a cache-enabled architecture using the passive optical network (PON) is presented to serve video on demand (VoD) for users. For efficient use of mobile backhaul, I propose a request deduplication scheme (RDS) that can provide all the requested services missed in cache with minimum bandwidth by eliminating duplicate requests for movies within tolerable range of the quality of service (QoS). The performance of the proposed architecture is compared with and without RDS in terms of the number of requests arriving at the origin server (OS), hit ratio, and improvement ratio according to user requests and cache sizes.

IPLAN을 이용한 전력설비의 계통접속 기술검토 프로그램 개발 (An IPLAN-based Program for Technical Assessment of New-connected Facilities)

  • 유헌수;배주천
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2005년도 추계학술대회 논문집 전력기술부문
    • /
    • pp.220-222
    • /
    • 2005
  • When a large-scale load or a new generator is connected to power systems, KPX assesses the effect of the connection on power systems to keep security and reliability standards. As the number of connection requests has been increased, KPX is spending much time for technical assessments of the requests. This paper developed an automatic assessment program to reduce analysis time and enhance simulation accuracy. The program is based on IPLAN and. can be applied to both load and generator network connection requests.

  • PDF

RAS: Request Assignment Simulator for Cloud-Based Applications

  • Rajan, R. Arokia Paul;Francis, F. Sagayaraj
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제9권6호
    • /
    • pp.2035-2049
    • /
    • 2015
  • Applications deployed in cloud receive a huge volume of requests from geographically distributed users whose satisfaction with the cloud service is directly proportional to the efficiency with which the requests are handled. Assignment of user requests based on appropriate load balancing principles significantly improves the performance of such cloud-based applications. To study the behavior of such systems, there is a need for simulation tools that will help the designer to set a test bed and evaluate the performance of the system by experimenting with different load balancing principles. In this paper, a novel architecture for cloud called Request Assignment Simulator (RAS) is proposed. It is a customizable, visual tool that simulates the request assignment process based on load balancing principles with a set of parameters that impact resource utilization. This simulator will help to ascertain the best possible resource allocation technique by facilitating the designer to apply and test different load balancing principles for a given scenario.

자녀양육 스트레스 및 아버지 교육 프로그램에 대한 요구도 - 영유아기 자녀를 둔 아버지를 대상으로 - (Parenting Stress and Requests for Father Education Program - Fathers with Infants and Preschool Children -)

  • 홍길회;황정해
    • 아동학회지
    • /
    • 제27권3호
    • /
    • pp.301-317
    • /
    • 2006
  • This study investigated parenting stress and requests for parent education by fathers with infants and preschool children. Subjects were 220 fathers. Data were analyzed by factor analysis and ANOVA. Results showed that middle class fathers whose wife had a job outside the home experienced more stress. Sex of child was a significant variable. : fathers with daughters expressed more requests for a father education program for a father education program, from highest to lowest, were for methods of childcare, the development of a child, guidance for discipline in daily life, relationship with their partner, and the fathers' role.

  • PDF

보육컨설팅에 관한 예비보육교사의 인식 및 요구 (A Study on the Awareness, Requests of Early Childhood Pre-service Teachers on Childcare Consulting)

  • 정은희
    • 수산해양교육연구
    • /
    • 제28권2호
    • /
    • pp.564-581
    • /
    • 2016
  • The purpose of this research was to provide basic data to childcare consulting scholarship which will be expanded completely in the future by examining awareness on childcare consulting, requests for childcare consultant, operation method of childcare consulting and tendency and meaning of childcare consulting for 500 early childhood pre-service teachers who are attending senior classes of departments related to childcare teachers in Busan. The results of research, obtained by the above process, are as follows. In the awareness of early childhood pre-service teachers on childcare consulting, they replied that they know concept and method of childcare consulting well. Also, qualifications of childcare consultant are actual knowledge and technology related to childcare process, they wanted consultants to provide ideas about class technology and problems which are expected among the consultants are lack of time by heavy works, etc. As expanded in the aspects of educational necessities and qualitative and quantitative system as the awareness or publicity of childcare consulting is insufficient.