• 제어로봇시스템학회논문지
• /
• 제8권8호
• /
• pp.706-712
• /
• 2002

In general, a deadlock in flexible manufacturing systems (FMSs) is caused by a resource limitation and the diversity of routings. However, the deadlock of industrial controllers such as programmable logic controllers (PLCs) can occur from different causes compared with those in general FMSs. The deadlock of PLCs is usually caused by an error signal between PLCs and manufacturing systems. In this paper, we propose a deadlock detection and recovery (DDR) algorithm to resolve the deadlock problem of PLCs at design stage. This paper employs the MAPN (modified automation Petri net), MTPL (modified token passing logic), and ECC (efficient code conversion) algorithm to model manufacturing systems and to convert a Petri net model into a desired LD (ladder diagram). Finally, an example of manufacturing systems is provided to illustrate the proposed DDR algorithm.

• ETRI Journal
• /
• 제37권6호
• /
• pp.1251-1258
• /
• 2015

We investigate an image recovery method for sparse-view computed tomography (CT) using an iterative shrinkage algorithm based on a second-order approach. The two-step iterative shrinkage-thresholding (TwIST) algorithm including a total variation regularization technique is elucidated to be more robust than other first-order methods; it enables a perfect restoration of an original image even if given only a few projection views of a parallel-beam geometry. We find that the incoherency of a projection system matrix in CT geometry sufficiently satisfies the exact reconstruction principle even when the matrix itself has a large condition number. Image reconstruction from fan-beam CT can be well carried out, but the retrieval performance is very low when compared to a parallel-beam geometry. This is considered to be due to the matrix complexity of the projection geometry. We also evaluate the image retrieval performance of the TwIST algorithm -sing measured projection data.

• Journal of electromagnetic engineering and science
• /
• 제11권4호
• /
• pp.250-256
• /
• 2011

This paper applies a compressed algorithm to improve the spectrum sensing performance of cognitive radio technology. At the fusion center, the recovery error in the analog to information converter (AIC) when reconstructing the transmit signal from the received time-discrete signal causes degradation of the detection performance. Therefore, we propose a subspace pursuit (SP) algorithm to reduce the recovery error and thereby enhance the detection performance. In this study, we employ a wide-band, low SNR, distributed compressed sensing regime to analyze and evaluate the proposed approach. Simulations are provided to demonstrate the performance of the proposed algorithm.

• PNF and Movement
• /
• 제13권2호
• /
• pp.55-72
• /
• 2015

Purpose: The purpose of this study was to propose a new therapy algorithm that combines motor imagery and physiotherapy as a physiotherapeutic clinical intervention technique that can stimulate the recovery of damaged physical function for patients with stroke. Methods: A variety of scientific research results related to motor imagery were reviewed and analyzed to investigate their applicability to physiotherapy in clinics. Results: As a new therapy algorithm for the therapeutic approach of motor imagery in stroke rehabilitation, a therapy algorithm that combines motor imagery with physiotherapy is proposed, which consists of three stages or steps: STEP 1 motor imagery familiarization, STEP 2 explicit learning stage, and STEP 3 implicit learning. Conclusion: The new therapy algorithm proposed in this study is expected to be a very useful clinical therapeutic approach for stimulating the recovery of damaged physical function in patients with stroke. It is believed that it will be necessary to confirm and standardize the effects of the therapeutic algorithm proposed in this study in the future by conducting diverse clinical studies.

• 한국통신학회논문지
• /
• 제28권4B호
• /
• pp.288-297
• /
• 2003

TCP Reno 는 하나의 윈도우 내에서 다수 개의 패킷 손실이 발생하는 경우 손실된 패킷들을 효율적으로 복구하는 것이 불가능한 문제점을 가지과 있다. 이 문제점을 개선하기 위해서 설계된 TCP New-Reno 는 부분 스인 패킷(partial acknowledgement)를 통해 fast recovery를 연장함으로써 다수 개의 패킷 손실이 발생하더라도 이들을 재전송에 의해 복구하는 것이 가능하다. 그러나 TCP New-Reno 역시 재전송 패킷들이 다시 손질되는 경우 불가피한 RTO(Retransmission Timeout)가 발생한다는 문제점을 가지고 있다. 이런 문제점을 개선하기 위해서 중복 승인 패킷 수를 근거로 재전송 패킷 손실을 감지할 수 있는 DAC(Duplicate Acknowledgement Counting) 알고리듬을 제안한다. TCP Reno. TCP New-Reno 그리고 DAC를 사용하는 경우에 대해 손실 복구 과정을 정확하게 모델링하고 손실된 패킷이 복구되기 위한 조건들을 유도한다. 임의 패킷 손실 확률에 대한 손실 복구 확률을 수학적으로 계산하고 이를 통해 DAC가 TCP New-Reno 의 손실 복구 기능을 향상시킬 수 있다는 것을 보인다.

• Journal of Communications and Networks
• /
• 제8권1호
• /
• pp.59-69
• /
• 2006

Bluetooth is reputed as a wireless networking technology supplying ad-hoc networks between digital devices. In particular, Bluetooth scatternet is an essential part of dynamic ad-hoc networks. Yet, there have not been sufficient researches performed on scatternet environment. This paper proposes a scatternet reformation algorithm for ad-hoc networks for instances where some nodes enter or leave the scatternet. The proposed algorithm is a general algorithm that can be applied to many types of Bluetooth scatternet regardless of the topology. The proposed algorithm is made for two reformation cases, i.e., nodes leaving and nodes entering. For the reformation when nodes leave a scatternet, the recovery node vector (RNV) algorithm is proposed. It has short reformation setup delay because the process involves a single page process (not including inquiry process). For the reformation when nodes enter a scatternet, the entry node algorithm is proposed. This is a simple and easily implementable algorithm. In this paper, real hardware experiments are carried out to evaluate the algorithm's performance where the reformation setup delay, the reformation setup probability and the data transfer rate are measured. The proposed algorithm has shown improvement in the reformation setup delay and probability.

• Journal of Communications and Networks
• /
• 제18권5호
• /
• pp.699-712
• /
• 2016

Recently, greedy algorithm has received much attention as a cost-effective means to reconstruct the sparse signals from compressed measurements. Much of previous work has focused on the investigation of a single candidate to identify the support (index set of nonzero elements) of the sparse signals. Well-known drawback of the greedy approach is that the chosen candidate is often not the optimal solution due to the myopic decision in each iteration. In this paper, we propose a tree search based sparse signal recovery algorithm referred to as the tree search matching pursuit (TSMP). Two key ingredients of the proposed TSMP algorithm to control the computational complexity are the pre-selection to put a restriction on columns of the sensing matrix to be investigated and the tree pruning to eliminate unpromising paths from the search tree. In numerical simulations of Internet of Things (IoT) environments, it is shown that TSMP outperforms conventional schemes by a large margin.

• 정보처리학회논문지B
• /
• 제12B권7호
• /
• pp.755-760
• /
• 2005

이동통신 채널과 같은 저대역 통신망에서는 비디오 전송을 위해서 H.263+와 같이 압축율이 높은 부호화 방법이 사용된다. 저대역폭을 통해 고압축 비디오 비트스트림을 전송할 경우, 패킷이 손실되면 영상의 품질이 심각하게 떨어진다. 본 논문에서는 H.263+ 부호화영상이 전송될 때 손상되는 움직임 벡터의 복원기법을 제안하였다. 본 논문에서는 손실된 블록의 움직임 벡터는 인접한 블록의 움직임 벡터와 높은 상관성을 갖는 다는 사실에 착안하여, 시공간적 오류은닉(Temporal-Spatial Error Concealment) 방법을 제안한다. 제안된 방법에서는 손실된 모션벡터를 인접한 블록의 움직임을 클러스터링하여 복원한다. 인접한 블록의 모션벡터는 ALA(Average Linkage Algorithm) 클러스터링 알고리즘에 따라 클러스터링되며, 각 클러스터의 대표값을 계산하여 후보 움직임 벡터 집합을 얻은 다음, 이들 후보의 움직임의 왜곡정도를 계산하여 왜곡이 최소인 움직임 벡터를 선택한다. 제안한 방법으로 복원한 영상의 화질에 대한 객관적, 주관적 평가에서 개선된 결과를 확인하였다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1999년도 추계종합학술대회 논문집
• /
• pp.47-50
• /
• 1999

Adaptive channel equalization accomplished without resorting to a training sequence is known as blind equalization. The Constant Modulus Algorithm(CMA) and Modified CMA(MCMA) are widely referenced algorithms for blind equalization of a QAM system. This paper proposes a hybrid scheme of CMA and MCMA with Carrier Recovery that is robust for high level QAM with low steady state tracking error.

• 한국통신학회논문지
• /
• 제28권5B호
• /
• pp.427-434
• /
• 2003

본 논문은 TCP-Reno등의 TCP 등에서 사용되는 다른 혼잡 제어 알고리즘보다 에러가 많은 무선 환경에 더욱 강인한 향상된 TCP 혼잡 제어 알고리즘을 제안한다. 제안하는 알고리즘은 혼잡 윈도우 크기를 패킷 에러율과 현 TCP의 상태가 fast recovery 혹은 slow start 상태에 있느냐에 따라 결정한다. 시뮬레이션을 통해 제안하는 알고리즘의 유효성을 보여 주며, 여러 TCP 혼잡 제어 알고리즘들과 혼잡 윈도우 크기와 효율과 같은 성능 지표 관점에서 비교하였다. 제안하는 알고리즘은 다른 알고리즘보다 높은 PER하에서는 높은 효율을 가지며, 낮은 PER하에서는 비슷한 효율을 가진다.