• 한국멀티미디어학회논문지
• /
• 제18권8호
• /
• pp.968-979
• /
• 2015

In this paper, we study a vibration bell App which shows waiting sequence numbers by utilizing smartphones to solve an inconveniently long waiting time from ordering to getting foods in restaurants and coffee shops. Unlike existing independently developed hardware and software, the vibration bell App is developed to manage and integrate customer management service, POS service in shops, and group shop management services. The functions of the vibration bell App include two-way communications based on NFC- issuing waiting sequence numbers and electronic coupon, showing event information, and transferring user information. Furthermore, the user's personal information is minimized by recognizing the pre-existing information of the user's smartphone. Replacing the shop's vibration bell system with the vibration bell APP, the shops can reduce the cost of construction and maintenance by up to 1/10, compared to the cost of for existing vibration bell systems. Moreover, the customer's preference and current sales trend can be easily figured out. Thus, it will have a great effect on the future marketing strategies.

• 산업공학
• /
• 제20권2호
• /
• pp.112-120
• /
• 2007

As the market rapidly changes, the speed of new product development is highlighted as a critical element which determines the success of firms. While firms endeavor to accelerate the development speed, frequent iterations in a development process hinders the effort of acceleration. For this reason, many previous researches tried to find the optimal structure of the development process which minimizes the number of iterations. However, such researches have a limitation in that they can be applied to only a single-project environment. In a multi-project environment, waiting time induced by lack of resources also delays the process as well as the iterations do. In this paper, we propose dynamic sequencing method focusing on both iterations and waiting time for reducing the durations of development projects in a multi-project environment. This method reduces the waiting time by changing the sequence of development tasks according to the states of resources. While the method incurs additional iterations, they are expected to be offset by the reduced waiting time. The results of simulation show that the dynamic sequencing method dramatically improves the efficiency of a development process. Especially, the improvement is more salient as projects are more crowded and the process is more unbalanced. This method gives a new insight in researches on managing multiple development projects.

• 정보처리학회논문지C
• /
• 제10C권3호
• /
• pp.325-334
• /
• 2003

이동 클라이언트/서버 데이터베이스 시스템에서 클라이언트 캐쉬의 상태 정보가 없이 비동기적 캐쉬 무효화 기법을 사용하여, 읽기-전용 트랜잭션을 지역에서 처리한다면 비동기적 무효화 리포트는 완료를 요청한 이동 트랜잭션의 대기시간에 대해 보장을 해주지 않는 문제가 발생한다. 이 문제를 해결하기 위해, 본 논문에서는 두 가지 종류의 메시지 사용을 제안한다. 트랜잭션의 처리 지연을 줄이기 위한 비동기적 무효화 메시지와 완료를 요청한 트랜잭션의 대기 시간을 보장해 주기 위한 안내 메시지이다. 비동기 무효화 리포트는 자신을 나타내기 위한 일련번호를 가지며, 안내 메시지는 가장 최근에 브로드캐스트 된 무효화 메시지의 일련번호를 가진다. 이동 클라이언트는 이 메시지들의 일련번호를 사용하여 자신의 캐쉬에 대한 유효여부를 점검함으로 이동 트랜잭션의 대기시간에 대해 보장해준다.

• 한국항해항만학회:학술대회논문집
• /
• 한국항해항만학회 2004년도 춘계학술대회 논문집
• /
• pp.451-456
• /
• 2004

본 연구에서는 장치장 운영규칙의 현실성을 높이기 위해서 트랜스퍼 크레인의 작업운영체계를 분석하고 작업우선순위의 적용을 위한 운영규칙의 적용방법을 설명하였다. 또한 장치장에서 주행로의 특성에 따른 대기 및 주행로 점거형태를 분석하여 블록에 진입하여 대기할 수 있는 최대 대기차량수를 도출할 수 있는 산정식을 정리하고 공간의 제약상태를 분석하였다. 또한 공간의 제약사항 극복하기 위해서 공간자원을 정의할 수 있는 다작업원칙을 제시하고 그 원칙을 위한 해법과 순서도를 묘사하였다.

• 한국항해항만학회지
• /
• 제28권8호
• /
• pp.721-726
• /
• 2004

본 연구에서는 장치장 운영규칙의 현실성을 높이기 위해서 트랜스퍼 크레인의 작업운영체계를 분석하고 작업우선순위의 적용을 위한 운영규칙의 적용방법을 설명하였다. 또한 장치장에서 주행로의 특성에 따른 트럭의 대기 및 주행로 점거형태를 분석하여 블록에 진입하여 대기할 수 있는 최대 대기차량수를 도출할 수 있는 산정식을 정리하고 공간의 제약상태를 분석하였다. 또한 공간의 제약사항 극복하기 위해서 공간자원을 정의할 수 있는 다작업원칙을 제시하고 그 원칙을 위한 해법과 순서도를 묘사하였다.

• 산업경영시스템학회지
• /
• 제39권1호
• /
• pp.81-90
• /
• 2016

Different from general operating policies to be applied for controllable queueing models, two of three well-known simple N, T and D operating policies are applied alternatingly to the single server controllable queueing models, so called alternating (NT), (ND) and (TD) policies. For example, the alternating (ND) operating policy is defined as the busy period is initiated by the simple N operating policy first, then the next busy period is initiated by the simple D operating policy and repeats the same sequence after that continuously. Because of newly designed operating policies, important system characteristic such as the expected busy and idle periods, the expected busy cycle, the expected number of customers in the system and so on should be redefined. That is, the expected busy and idle periods are redefined as the sum of the corresponding expected busy periods and idle periods initiated by both one of the two simple operating policies and the remaining simple operating policy, respectively. The expected number of customers in the system is represented by the weighted or pooled average of both expected number of customers in the system when the predetermined two simple operating policies are applied in sequence repeatedly. In particular, the expected number of customers in the system could be used to derive the expected waiting time in the queue or system by applying the famous Little's formulas. Most of such system characteristics derived would play important roles to construct the total cost functions per unit time for determination of the optimal operating policies by defining appropriate cost elements to operate the desired queueing systems.

• 한국경영과학회지
• /
• 제33권1호
• /
• pp.35-49
• /
• 2008

To load a container in a yard block onto a ship, a Transfer Crane (TC) moves to a target yard bay, then its hoist picks up a selected container and loads it onto a waiting Yard Truck (YT). An optimal routing problem of Transfer Crane is a decision problem which determines a given TC's the visiting sequence of yard-bays and the number of containers to transfer from each yard-bay. The objective is to minimize the travel time of the TC between yard-bays and setup time for the TC in a visiting yard. In this paper, we shows that the problem is NP-complete, and suggests a new formulation for it. Using the new formulation for the problem, we investigate some characteristics of solutions, a lower and upper bounds for it. Moreover, our lower and upper bound is very efficient to applying some instances suggested in a previous work.

• Journal of Communications and Networks
• /
• 제18권2호
• /
• pp.238-245
• /
• 2016

A sequence number checking technique is proposed to improve the performance of TCP connections in mobile ad hoc networks. While a TCP connection is initialized, a routing protocol takes the responsibility for checking the hop count between a source and destination pair. If the hop count is greater than a predefined value, the routing protocol decides to use a proxy node. The responsibility of a proxy node is to check the correctness of data packets and inform the missing packets by sending an acknowledgement from a proxy node to the source node. By doing so, the source node is able to retransmit any missing packet in advance without waiting until an end-to-end acknowledgement is received from the destination. Simulation results show that the proposed mechanism is able to increase throughput up to 55% in static network and decrease routing overhead up to 95%in mobile network.

• 한국신뢰성학회지:신뢰성응용연구
• /
• 제17권1호
• /
• pp.58-65
• /
• 2017

Different from general operating policies applied for various waiting line situations, two complementary dyadic operating policies are applied alternatingly to a single server maintenance service center model. That is, either of the two dyadic Min (N, T) or Max (N, T) policy is applied to operate such center first and the other operating policy should be applied later, and then the same sequence of both operating policies is followed repeatedly. This operating policy is denoted by the Minimax (N, T) policy. Purpose: Because of the newly introduced operating policy, important system characteristics of the considered service center model such as the expected busy and idle periods, the expected number of customers in the service center and so on should be derived to provide necessary information for determination of the optimal operating policy. Methods: Based on concepts of the newly introduced Minimax (N, T) policy, all necessary system characteristics should be redefined and then derived by constructing appropriate relations between complementary two dyadic operating policies. Results: Desired system characteristics are obtained successfully using simple procedures developed by utilizing peculiar structure of the Minimax (N, T) policy. Conclusion: Applying Minimax (N, T) operating policy is equivalent to applying the simple N and T operating policies alternatingly.

• Reproductive and Developmental Biology
• /
• 제30권3호
• /
• pp.181-187
• /
• 2006

최근 돼지의 장기를 사람에게 이식하는 이종간 장기 이식에 관한 연구가 급속히 발전되고 있다. 그러나 돼지의 장기를 이식할 경우 가장 큰 문제점 중의 하나는 돼지 genome 내에 존재하는 내인성 레트로바이러스(porcine endogenous retrovirus; PERV)가 인간에게 그대로 전이될 수 있다는 것이다. 이에 대한 대안으로 최근 활발히 연구되고 있는 RNA 간섭을 통한 PERV RNA의 발현을 최대한 억제하는 방법이 제안되고 있는데, RNA 간섭(RNA interference)은 double-standard RNA(dsRNA)가 상보적인 표적 mRNA를 분해하여 결과적으로 표적 단백질의 발현을 특이적으로 억제하는 현상을 의미한다. 본 연구에서는 PERV에 대한 RNA 간섭 현상을 일으키는 shRNA 유전자를 레트로바이러스 벡터를 이용하여 돼지세포에 RNA)가 상보적인 표적 mRNA를 분해하여 결과적으로 표적 단백질의 발현을 특이적으로 억제하는 현상을 의미하다. 도입한 후 PERV의 발현율 감소 여부를 조사하였다. 그 결과, gag-pol 유전자와 env 유전자 발현은 각각 대조군 세포의 4%와 10% 정도로 억제되었다. 한편, virus 입자의 생산에서 gag-pol 유전자는 대조군 세포에 비해 300배 이상 억제되었으며, env 유전자에서는 20만 배 이상 억제되었다. 이상의 결과를 미루어 볼 때 형질 전환 돼지를 이용한 이종 장기 이식에 있어서 RNA 간섭 현상을 이용한 PERV의 발현을 억제하는 시도는 생물학적안전성을 크게 증가시킬 수 있을 것으로 사료된다.