• International Journal of Computer Science & Network Security
• /
• 제22권9호
• /
• pp.31-34
• /
• 2022

The concept of locating chromatic number of graph is a development of the concept of vertex coloring and partition dimension of graph. The locating-chromatic number of G, denoted by χ_L(G) is the smallest number such that G has a locating k-coloring. In this paper we will discussed about the procedure for determine the locating chromatic number of Origami graph using Python Programming.

• 한국인터넷방송통신학회논문지
• /
• 제12권5호
• /
• pp.11-16
• /
• 2012

기회전송 시스템은 소형 단말기에 다수의 안테나를 장착하지 않고 무선 채널에서 발생되는 페이딩을 완화할 수 있기 때문에 많은 주목을 받고 있다. 기회전송 시스템에서는 소스로부터 수신된 신호 대 잡음비가 임계값보다 큰 릴레이만 목적지로 송신한다. 그러나 현실적인 시스템에서 목적지의 수신 가지 수는 고정되어있기 때문에 송신 릴레이 수가 수신 가지보다 많으면 시스템 성능을 개선하지 못할 뿐 만 아니라 전력소모도 증가한다. 따라서 이 논문에서는 평균 송신 릴레이수를 조정할 수 있는 DOT 협동 다이버시티 시스템을 이용한다. 비록 DOT 시스템에서 두 개의 임계 치를 조정하여 평균 릴레이 수를 조정한다고 하여도 무선 채널의 페이딩 현상으로 순간 송신 릴레이의 수는 가변된다. 그러므로 릴레이로부터 송신되는 신호의 수에 따라서 목적지에서 최대비 결합(MRC) 또는 일반 선택 결합(GSC) 방법을 제안한다. 제안한 시스템의 오수신율을 폐쇄형으로 유도하였다. 해석결과 시스템의 성능은 수신 가지 수에 따라서 향상됨을 알 수 있었다. 그리고 수신 가지 수가 고정되어있을 때, 소스-릴레이 경로 및 릴레이-목적지 경로의 평균 SNR이 증가함에 따라서 오수신율이 감소하였다.

• 산업경영시스템학회지
• /
• 제20권44호
• /
• pp.153-161
• /
• 1997

This paper has proposed the modelling by simulation in order to evaluate the performance of process through discrete event simulation using SIMAN language in flexible manufacturing systems. The production system is assumed to be a job shop type of system under the batch production of discrete products. In this paper, the input data is the workstation(process) time, the number of workstation(process), a probability distribution, the number of simulation runs. Also, transient period is considered. In the case study, this paper deals with three products in real flexible manufacturing systems. Finally, a number of simulation runs were executed under different experimental conditions to obtain preliminary statistics on the following performance measures: operating rate of facility and average system operating rate, transient period, central processing unit, average system throughput, and average waiting time in queues.

• 디지털콘텐츠학회 논문지
• /
• 제12권4호
• /
• pp.585-592
• /
• 2011

경매 매물 정보시스템은 수요자의 상황과 특성에 맞춰 원하는 경매매물의 고급 정보만을 제공하는 것을 목표로 한다. 특히, 시시각각으로 변하는 조회수와 같은 실시간 정보와 경매가 예측을 위한 고도의 분석결과를 제공받기 위해서 상황인식에 기반한 모바일 정보시스템이 요구된다. 이에 따라 본 연구는 스마트폰 환경에서 수요자의 위치, 특정 매물 조회수, 현재 입찰자 수 등과 같은 경매정보를 제공해주는 상황인식 기반의 경매매물 정보시스템을 연구한다.

• ETRI Journal
• /
• 제35권1호
• /
• pp.35-40
• /
• 2013

Asynchronous ranging is one practical method to implement a locating system that provides accurate results. However, a locating system utilizing asynchronous ranging generates a large number of messages that cause transmission delays or failures and degrades the system performance. This paper proposes a novel approach for efficient congestion control in an asynchronous range-based locating system. The proposed method significantly reduces the number of messages generated during the reader discovery phase by eavesdropping on other transmissions and improves the efficiency of ranging by organizing the tags in a hierarchical fashion in the measurement phase. Our evaluation shows that the proposed method reduces the number of messages by 70% compared to the conventional method and significantly improves the success rate of ranging.

• 한국시스템다이내믹스연구
• /
• 제8권1호
• /
• pp.49-66
• /
• 2007

Due to criminal aspects spreading nation wide, their intelligence level increasing and becoming digitalized, the citizens' interest in and desire for crime security have increased. Until now, the preceding researches have been focused on finding the specific variables that have direct effects on the demand for police manpower through regression analysis and attempted to predict number of needs. However, there have never been any researches producing the accurate number of demands for crimes and human resources needed for each work load. Therefore, this research have analyzed each police station functions by interviewing the persons in charge and selected the main duty for each functions. From this, by using the method of system dynamics, this research was able to predict the standard number of manpower needed for each police station functions. Also, by making a model for each 235 police stations, the best efficient employment plan for police stations and district agencies have been further discussed based on the computer simulation results.

• 품질경영학회지
• /
• 제20권1호
• /
• pp.158-167
• /
• 1992

This paper represents the new techniques for optimal sampling plans of reliability applying the mathematical complex number(real and imaginary number) in the complex system of reliability. The research formulation represent a mathematical model Which preserves all essential aspects of the main and auxiliary factors of the research objectives. It is important to formule the problem in good agreement with the objective of the research considering the main and auxilary factors which affect the system performance. This model was repeatedly tested to determine the required statistical chatacteristics which in themselves determine the actual and standard distributions. The evaluation programs and techniques are developed for establishing criteria for sampling plans of reliability effectiveness, and the evaluation of system performance was based on the complex stochastic process(derived by the Runge-Kutta method. by kolmogorv's criterion and the transform of a solution to a Sturon-Liouville equation.) The special structure of this mathematical model is exploited to develop the optimal sampling plans of reliability in the complex system.

• 한국전자통신학회논문지
• /
• 제2권3호
• /
• pp.157-162
• /
• 2007

The goal of researching a proper crowd animation is to design system that is satisfied with the reality of scenes, performance of system, and interaction with users to show the crowd vividly and effectively in virtual underwater world. In this paper, we smartly expressed the behavior patterns for flocks of fish in virtual underwater and we made up for the weak points in spending time and cost to produce crowd animation. We compared with the number of mesh, the number of fish, the number of frame, elapsed time, and resolution and analyzes them with the fish behavior simulating system. We developed a virtual underwater simulator using this system.

• Communications for Statistical Applications and Methods
• /
• 제6권1호
• /
• pp.99-106
• /
• 1999

This paper considers an imperfect repair model for which the repairable system is maintained preventively at periodic times and is replaced by a new system when a predetermined number of preventive maintenance has been applied. our main objective of this is to determine the optimal number of preventive maintenances before the system is replaced and the optimal length of interval between two consecutive preventive maintenances under a new repair model which is referred to as an ineffective preventive maintenance. Such a model assumes a periodic preventive maintenance in which the system is effectively maintained with a certain probability. Otherwise the system is not improved at all after each maintenance and thus the failure rate remains the same as before. The criteria to determine the optimal number of preventive maintenances and length of period is the expected cost rate per unit time for an infinite time span. We give the explicit expressions for the expected cost rate per unit time. Some numerical examples are presented for illustrative purposes.

• 한국경영과학회지
• /
• 제32권3호
• /
• pp.17-31
• /
• 2007

In this paper, we consider a service system with bi-functional servers, which can switch between the primary service room and the secondary room. A service policy is characterized by the switching paints which depend on the queue length in the primary service room and the service level requirement constraint of the secondary room. The primary service room is modeled as a Markovian queueing system and the throughput of the primary service room is function of the total number of bi-functional servers. the buffer capacity of the primary service room, and the service policy. There is a revenue obtained from throughput and costs due to servers and buffers. We study the problem of simuitaneously determining the optimal number of servers, buffer capacity, and service policy to maximize profit of the service system, and develop an algorithm which can be successfully applied with the small number of computations.