• 한국정보통신설비학회:학술대회논문집
• /
• 한국정보통신설비학회 2005년도 하계학술대회
• /
• pp.174-179
• /
• 2005

In the SONET/SDH based ASON, one VC3 connection contains 21 VC12 calls. Hence, it can serve up to 21 VC12 calls. When a new VC12 call arrives, if there exists at least one available VC3 connection in the network, that VC12 call is severed immediately. However, if there is no available VC3 connection, that VC12 call has to wait a certain time, called setup latency, for the a new VC3 connection to be established. This is inconvenient for the customers. On the other hand, if there are more VC3 connections than the network requires, this can waste network resources. In this paper, we proposed the solution for these problems. In order to reduce the number of VC12 calls which have to wait, we setup a new VC3 before all VC12 time slots are occupied. Furthermore, to avoid the waste of the network resources, we do not establish all VC3 connections at the same time, but do establish step by step.

• Journal of applied mathematics & informatics
• /
• 제28권1_2호
• /
• pp.531-537
• /
• 2010

In this paper, some vacation policies are considered, which can be related to the past behavior of the system. The server, after serving all customers, stays idle or to wait for some time before a vacation is taken. General formulas for the waiting time and the amount of work in the system are derived for a vacation policy. Using the analysis on the vacation system, we derived the waiting time in the sequential bottleneck station.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제3권2호
• /
• pp.209-218
• /
• 2009

In a wireless sensor network(WSN) each sensor node deals with numerous sensing data elements. For the sake of energy efficiency and network lifetime, sensing data must be handled effectively. A technique used for this is data aggregation. Sending/receiving data involves numerous steps such as MAC layer control packet handshakes and route path setup, and these steps consume energy. Because these steps are involved in all data communication, the total cost increases are related to the counts of data sent/received. Therefore, many studies have proposed sending combined data, which is known as data aggregation. Very effective methods to aggregate sensing data have been suggested, but there is no means of deciding how long the sensor node should wait for aggregation. This is a very important issue, because the wait time affects the total communication cost and data reliability. There are two types of data aggregation; the data counting method and the time waiting method. However, each has weaknesses in terms of the delay. A hybrid method can be adopted to alleviate these problems. But, it cannot provide an optimal point of aggregation. In this paper, we suggest a stochastic-based data aggregation scheme, which provides the cost(in terms of communication and delay) optimal aggregation point. We present numerical analysis and results.

• 융합정보논문지
• /
• 제8권4호
• /
• pp.27-35
• /
• 2018

본 연구는 일부 치과 의료소비자들의 대기시간에 대한 반응과 병원이미지 및 환자만족도와의 관계를 파악하여 의료서비스의 질적 대기환경관리를 위한 기초자료를 제공하고자 시도되었다. 연구대상은 치과 병 의원에 내원한 대기시간을 경험한 성인으로 하였고, 2016년 5월 16일부터 6월 18일까지 구조화된 무기명 자기기입식 설문조사를 실시하였다. 병원이미지는 장시간 대기 시 치과 의료기관 신뢰도 변화, 재이용의사 변화, 예약시스템, 환자만족도는 성별, 예상 대기시간설명, 장시간 대기 시 치과 의료기관 신뢰도 변화, 재이용의사 변화, 예약시스템과 관련이 있었다. 대기시간에 대한 긍정적 반응과 병원이미지, 환자만족도는 양의 상관관계로 나타났고, 부정적 반응은 병원이미지, 환자만족도와 음의 상관관계를 나타났으며, 병원 이미지와 환자만족도는 양의 상관관계를 나타냈다. 병원이미지 제고와 환자만족도 향상을 위한 실제적인 접근방안이 요구되며, 대기의 불안과 부정적 반응을 해소 할 수 있는 IT기술 및 여러 컨텐츠를 접목한 대기환경의 변화가 필요하다고 사료된다.

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

일반적으로 은행, 관공서, 병원과 같이 사람이 많은 장소에서는 대체로 고객에게 일정 시간의 대기시간이 요구되며, 이로 인해 고객의 방문 순서에 따라 고객 대기번호가 기재된 순번대기표를 뽑아 순번을 기다리게 된다. 이와 같은 방법에서는 대기 중인 고객은 현재 처리중인 대기 순서를 항상 확인해야 하므로 대기번호표시부가 보이는 장소 내에 있어야 하는 제약이 있어 다른 장소에서 별도의 업무를 볼 수 없다는 문제점이 있다. 본 논문은 스마트폰을 이용한 대기번호를 발급하는 어플리케이션인 SmartQ 시스템을 개발하였다. SmartQ는 스마트폰을 이용하여 기존의 대기번호 발권기를 대체하여 편리하게 순번대기 서비스를 이용할 수 있도록 지원하며, 서비스 알림, 대기인원, 시간대별/업무별 예상대기시간 등을 실시간으로 제공한다.

• 한국멀티미디어학회논문지
• /
• 제22권8호
• /
• pp.887-896
• /
• 2019

In this paper, we discuss an optimization approach for time-synchronizations in networked simulators. This method is a sub-technology that is required to combine heterogeneous simulators into a single simulation. In previous time-synchronization studies, they had built a network system among networked simulators. The network system collects network packets and adds time-stamps to the networked packets based on the time that occurs in events of simulation objects in the individual simulators. Then, it sorts them in chronological order. Finally, the network system applies time-synchronization to each simulator participating in interworking sequentially. However, the previous approaches have a limitation in that other participating simulators should wait for while processing an event in a simulator in a time stamp order. In this paper, we attempt to solve the problem by optimizing time-synchronizations in networked simulation environments. In order to prove the practicality of our approach, we have conducted an experiment. Finally, we discuss the contributions of this paper.

• Journal of Information Processing Systems
• /
• 제13권3호
• /
• pp.618-629
• /
• 2017

Mobile nodes can't always connect each other in DTNs (delay tolerant networks). Many DTN routing protocols that favor the "multi-hop forwarding" are proposed to solve these network problems. But they also lead to intolerant delivery cost so that designing a overhead-efficient routing protocol which is able to perform well in delivery ratio with lower delivery cost at the same time is valuable. Therefore, we utilize the small-world property and propose a new delivery metric called multi-probability to design our relay node selection principles that nodes with lower delivery predictability can also be selected to be the relay nodes if one of their history nodes has higher delivery predictability. So, we can find more potential relay nodes to reduce the forwarding overhead of successfully delivered messages through our proposed algorithm called HESnW. We also apply our new messages copies allocation scheme to optimize the routing performance. Comparing to existing routing algorithms, simulation results show that HESnW can reduce the delivery cost while it can also obtain a rather high delivery ratio.

• 성인간호학회지
• /
• 제27권5호
• /
• pp.604-611
• /
• 2015

Purpose: Knowledge, clinical reasoning, and self-confidence are the basis for undergraduate education, and determine students' level of competence. The purpose of this study was to assess the effects of the addition of a one-time simulation experience to the didactic curriculum on nursing students' knowledge acquisition, clinical reasoning skill, and self-confidence. Methods: Using a quasi-experimental crossover design consisted of intervention and wait-list control groups. Participants were non-randomly assigned to the first intervention group (Group A, n=48) or the wait-list control group (Group B, n=46). Knowledge level was assessed through a multiple choice written test, and clinical reasoning skill was measured using a nursing process model-based rubric. Self-confidence was measured using a self-reported questionnaire. Results: Results indicated that students in the simulation group scored significantly higher on clinical reasoning skill and related knowledge than those in the didactic lecture group; no difference was found for self-confidence. Conclusion: Findings suggest that undergraduate nursing education requires a simulation-based curriculum for clinical reasoning development and knowledge acquisition.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제15권3호
• /
• pp.814-836
• /
• 2021

Wildlife ecologists and biologists recapture deer to collect tracking data from deer collars or wait for a drop-off of a deer collar construction that is automatically detached and disconnected. The research teams need to manage a base camp with medical trailers, helicopters, and airplanes to capture deer or wait for several months until the deer collar drops off of the deer's neck. We propose an intelligent robust base-station research with a low-cost and time saving method to obtain recording sensor data from their collars to a listener node, and readings are obtained without opening the weatherproof deer collar. We successfully designed the and implemented a robust base station system for automatically collecting data of the collars and listener motes in harsh wilderness environments. Intelligent solutions were also analyzed for improved data collections and pattern predictions with drone-based detection and tracking algorithms.

• 한국정보통신학회논문지
• /
• 제13권7호
• /
• pp.1363-1370
• /
• 2009

본 논문은 자동차용 임베디드 시스템에 탑재되는 운영체제의 실시간 스케줄링 알고리즘에 대해서 개선된 알고리즘을 제안한다. 기존 OSEK OS의 스케줄링 알고리즘에서 큰 차이를 보이는 부분은 16개의 우선순위 대기 큐를 4개의 우선순위 대기 큐로 줄였다. 그리고 대기 큐에서 FIFO 알고리즘을 사용하지만 제안하는 스케줄링 알고리즘은 EDF 알고리즘을 사용하여 실시간성을 좀 더 높였다. 제안한 스케줄링 알고리즘에 대해서 간단한 실험을 수행하였다. 실험 결과 FIFO 알고리즘을 사용한 기존 OSEK OS의 경우 평균 26.29ms이고, 제안한EDF 알고리즘을 사용한 경우 평균 26.13ms로 제안한 EDF 알고리즘을 사용한 경우가 0.16ms 정도 빠름을 알 수 있다. FIFO 알고리즘을 사용한 기존 OSEK OS의 스케줄링 알고리즘 보다 제안하는 EDF 스케줄링 알고리즘을 사용한 스케줄링 알고리즘이 우수함을 알 수 있다.