• 제목/요약/키워드: time resource

검색결과 3,299건 처리시간 0.037초

IMMPDAF를 Sonar Resource Management에 적용한 기동표적분석 연구 (Target Motion Analysis with the IMMPDAF for Sonar Resource Management)

  • 임영택;송택렬
    • 대한전기학회논문지:시스템및제어부문D
    • /
    • 제53권5호
    • /
    • pp.331-337
    • /
    • 2004
  • Target motion analysis with a sonar system in general uses a regular sampling time and thus obtains regular target information regardless of the target maneuver status. This often results in overconsumption of the limited sonar resources. We propose two methods of the IMM(interacting Multiple Model) PDAF algorithm for sonar resource management to improve target motion analysis performance and to save sonar resources in this paper. In the first method, two different process noise covariance which are used as mode sets are combined based on probability. In the second method, resource time which are processed from two mode sets is calculated based on probability and then considered as update time at next step. Performance of the proposed algorithms are compared with the other algorithms by a series of Monte Carlo simulation.

ARMA 모델을 이용한 모바일 셀룰러망의 예측자원 할당기법 (Predictive Resource Allocation Scheme based on ARMA model in Mobile Cellular Networks)

  • 이진이
    • 한국항행학회논문지
    • /
    • 제11권3호
    • /
    • pp.252-258
    • /
    • 2007
  • 무선모바일 통신망에서는 사용자의 이동성보장 기술과 사용자가 요구하는 서비스품질(QoS)을 만족시키기 위한 효율적인 무선자원관리기술이 많이 연구되어 왔다. 본 연구에서는 시계열 예측기법(Time series prediction) 인 ARMA(Auto Regressive Moving Average) 모델을 이용하여 사용자가 요구하는 자원의 양을 예측하여 동적으로 자원을 할당함으로써 사용자의 이동성에 따른 QoS를 보장할 수 있는 자원할당방법을 제안한다. 제안한 방법은 ARMA 예측모델을 사용하여 이전에 핸드오프연결이 사용한 채널 수를 기초로 앞으로 필요로 하는 채널 수를 예측하여 예약함으로써 원하는 핸드오프 손실률에서 서비스가 이루어지도록 한다. 시뮬레이션을 통하여 기존의 RCS(Reserved channel scheme) 방법과 비교하여 핸드오프 연결의 손실률과 자원의 이용률에서 우수함을 보인다.

  • PDF

중학생의 시간관리 : 관련변수 및 학업성취도와의 관계 (The Time Management Practice of Middle School Students : Affecting Variables and Correlations with Academic Achievement)

  • 박은정;김외숙
    • 가족자원경영과 정책
    • /
    • 제12권1호
    • /
    • pp.41-55
    • /
    • 2008
  • The purpose of this study was to clarify variables affecting time management practice and the relationship between the practice and academic achievement of middle school students. Questionnaires including a time management scale were used for this study and the survey data were taken from 352 middle school students in Seoul and Gyeonggi-do. The statistical methods for the analysis were frequency, percentage, average, t-test, ANOVA and Pearson's correlation. The variables affecting student time management were gender, their standard of living, parental educational level and parental occupation. Religion and residential area were indicated as variables affecting several subscales of time management but the academic year of student had no effect on student time management behavior. The relationship between time management and the academic achievement of middle school students was slightly positive. Developing programs for time management in the field of family resource management is also necessary.

  • PDF

Genetic Algorithm based Resource Management for Cognitive Mesh Networks with Real-time and Non-real-time Services

  • Shan, Hangguan;Ye, Ziyun;Bi, Yuanguo;Huang, Aiping
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제9권8호
    • /
    • pp.2774-2796
    • /
    • 2015
  • Quality-of-service (QoS) provisioning for a cognitive mesh network (CMN) with heterogeneous services has become a challenging area of research in recent days. Considering both real-time (RT) and non-real-time (NRT) traffic in a multihop CMN, [1] studied cross-layer resource management, including joint access control, route selection, and resource allocation. Due to the complexity of the formulated resource allocation problems, which are mixed-integer non-linear programming, a low-complexity yet efficient algorithm was proposed there to approximately solve the formulated optimization problems. In contrast, in this work, we present an application of genetic algorithm (GA) to re-address the hard resource allocation problems studied in [1]. Novel initialization, selection, crossover, and mutation operations are designed such that solutions with enough randomness can be generated and converge with as less number of attempts as possible, thus improving the efficiency of the algorithm effectively. Simulation results show the effectiveness of the newly proposed GA-based algorithm. Furthermore, by comparing the performance of the newly proposed algorithm with the one proposed in [1], more insights have been obtained in terms of the tradeoff among QoS provisioning for RT traffic, throughput maximization for NRT traffic, and time complexity of an algorithm for resource allocation in a multihop network such as CMN.

Adaptive and Prioritized Random Access and Resource Allocation Schemes for Dynamic TDMA/TDD Protocols

  • Choi, Hyun-Ho
    • Journal of information and communication convergence engineering
    • /
    • 제15권1호
    • /
    • pp.28-36
    • /
    • 2017
  • The medium access control (MAC) protocol based on dynamic time division multiple access/time division duplex (TDMA/TDD) is responsible for random access control and radio resource allocation in dynamic traffic environments. These functions of random access and resource allocation are very important to prevent wastage of resources and improve MAC performance according to various network conditions. In this paper, we propose new random access and resource allocation schemes to guarantee quality of service (QoS) and provide priority services in a dynamic TDMA/TDD system. First, for the QoS guarantee, we propose an adaptive random access and resource allocation scheme by introducing an access probability. Second, for providing priority service, we propose a priority-based random access and resource allocation scheme by extending the first adaptive scheme in both a centralized and a distributed manner. The analysis and simulation results show that the proposed MAC protocol outperforms the legacy MAC protocol using a simple binary exponential backoff algorithm, and provides good differential performance according to priorities with respect to the throughput and delay.

Resource Efficient AI Service Framework Associated with a Real-Time Object Detector

  • Jun-Hyuk Choi;Jeonghun Lee;Kwang-il Hwang
    • Journal of Information Processing Systems
    • /
    • 제19권4호
    • /
    • pp.439-449
    • /
    • 2023
  • This paper deals with a resource efficient artificial intelligence (AI) service architecture for multi-channel video streams. As an AI service, we consider the object detection model, which is the most representative for video applications. Since most object detection models are basically designed for a single channel video stream, the utilization of the additional resource for multi-channel video stream processing is inevitable. Therefore, we propose a resource efficient AI service framework, which can be associated with various AI service models. Our framework is designed based on the modular architecture, which consists of adaptive frame control (AFC) Manager, multiplexer (MUX), adaptive channel selector (ACS), and YOLO interface units. In order to run only a single YOLO process without regard to the number of channels, we propose a novel approach efficiently dealing with multi-channel input streams. Through the experiment, it is shown that the framework is capable of performing object detection service with minimum resource utilization even in the circumstance of multi-channel streams. In addition, each service can be guaranteed within a deadline.

5세대 이동통신을 위한 후보 변조기술들의 시간과 주파수 자원 비교 분석 (Comparison Analysis of Time and Frequency Resource of Candidate Waveforms for 5G Mobile Communications)

  • 안창영;유흥균
    • 한국전자파학회논문지
    • /
    • 제27권11호
    • /
    • pp.987-995
    • /
    • 2016
  • 5세대 이동통신을 위한 후보변조기술에서 중요한 평가 요인 중 하나는 OOB(Out of Band) 전력 저감을 통한 주파수 효율 향상 특성이다. 본 논문에서는 5세대 이동통신을 위한 후보변조기술로 주목받고 있는 UFMC(Universal Filtered Multi-Carrier), FBMC(Filter Bank Multi-Carrier), W-OFDM(Weighted Orthogonal Frequency Division Multiplexing) 시스템에 대한 시간 자원 할당에 대한 주파수 자원의 효율을 평가하고 비교 분석한다. 시뮬레이션을 통해 시간 자원 할당에 대한 스펙트럼 효율 향상 특성을 확인하였으며, 추가적으로 확보할 수 있는 주파수 자원을 확인하였다. 본 논문에서는 동일한 데이터 비트를 전송하며, 4개의 심볼을 전송하는 조건에서, 시스템이 선형일 때, 각 시스템은 모두 유사한 시간-주파수 자원 활용 효율을 보이나, 비선형 조건에서는 FBMC의 시간-주파수 자원 활용 효율이 가장 크게 저하되는 것을 확인하였다.

이동 컴퓨팅 환경에서 동적인 이동성 등급을 이용한 자원 예약 기법 (A Resource Reservation Scheme using Dynamic Mobility Class on the Mobile Computing Environment)

  • 박시용;정기동
    • 한국정보과학회논문지:정보통신
    • /
    • 제31권1호
    • /
    • pp.112-122
    • /
    • 2004
  • 본 논문에서는 이동 컴퓨팅 환경에서 셀 내부 영역에 기반을 둔 이동성 예측 모델과 모바일 호스트들의 이동성을 토대로 하는 이동성 등급을 동적으로 조정할 수 있는 자원 예약 기법을 제안한다. 본 논문에서 제안하는 이동성 예측 모델은 셀 내부의 각각 다른 영역을 기반으로 가약 마코프 체인을 이용하여 모델링 하였으며, 새로운 방법으로 핸드오프 확률을 추정한다. 그리고 모바일 호스트들이 셀 내부에 머물 가능성이 있는 셀 내부 존재 시간을 제공하며, 그 셀 내부 존재 시간은 동적인 자원 예약 기법의 새로운 인자로 활용된다. 동적인 자원 예약 기법은 모바일 호스트들의 내부 존재 시간의 마감에 따라서 변화하는 이동성 등급을 이용하여 이웃 셀의 자원을 동적으로 예약한다. 이 기법들은 신규 호 블록킹율과 핸드 오프 호 종료율을 개선시켰다.

한국의 장기요양서비스에 대한 RUG-III의 적용가능성 (On the Feasibility of a RUG-III based Payment System for Long-Term Care Facilities in Korea)

  • 김은경;박하영;김창엽
    • 대한간호학회지
    • /
    • 제34권2호
    • /
    • pp.278-289
    • /
    • 2004
  • Purpose: The purpose of this study was to classify the elderly in long-term care facilities using the Resource Utilization Group(RUG-III) and to examine the feasibility of a payment method based on the RUG-III classification system in Korea. Method: This study measured resident characteristics using a Resident Assessment Instrument-Minimum Data Set(RAI-MDS) and staff time. Data was collected from 530 elderly residents over sixty, residing in long-term care facilities. Resource use for individual patients was measured by a wage-weighted sum of staff time and the total time spent with the patient by nurses, aides, and physiotherapists. Result: The subjects were classified into 4 groups out of 7 major groups. The group of Clinically Complex was the largest (46.3%), and then Reduced Physical Function(27.2%), Behavior Problems (17.0%), and Impaired Cognition (9.4%) followed. Homogeneity of the RUG-III groups was examined by total coefficient of variation of resource use. The results showed homogeneity of resource use within RUG-III groups. Also, the difference in resource use among RUG major groups was statistically significant (p<0.001), and it also showed a hierarchy pattern as resource use increases in the same RUG group with an increase of severity levels(ADL). Conclusion: The results of this study showed that the RUG-Ill classification system differentiates resources provided to elderly in long-term care facilities in Korea.

A Memory Configuration Method for Virtual Machine Based on User Preference in Distributed Cloud

  • Liu, Shukun;Jia, Weijia;Pan, Xianmin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제12권11호
    • /
    • pp.5234-5251
    • /
    • 2018
  • It is well-known that virtualization technology can bring many benefits not only to users but also to service providers. From the view of system security and resource utility, higher resource sharing degree and higher system reliability can be obtained by the introduction of virtualization technology in distributed cloud. The small size time-sharing multiplexing technology which is based on virtual machine in distributed cloud platform can enhance the resource utilization effectively by server consolidation. In this paper, the concept of memory block and user satisfaction is redefined combined with user requirements. According to the unbalanced memory resource states and user preference requirements in multi-virtual machine environments, a model of proper memory resource allocation is proposed combined with memory block and user satisfaction, and at the same time a memory optimization allocation algorithm is proposed which is based on virtual memory block, makespan and user satisfaction under the premise of an orderly physical nodes states also. In the algorithm, a memory optimal problem can be transformed into a resource workload balance problem. All the virtual machine tasks are simulated in Cloudsim platform. And the experimental results show that the problem of virtual machine memory resource allocation can be solved flexibly and efficiently.