• 전기학회논문지P
• /
• 제66권1호
• /
• pp.43-47
• /
• 2017

A SIL(Safety Integrity Level) assignment method is used for preventing failure action. The goal of safety system for processing automation is to reduce the human fatal risk. Even if we have developed the processing automation according to developing technology, we are also realized on increasing the human fatal risk cause of unexpected accidents. This study is directed the solution of decision for safety level for safety system and the best architecture for safety system in process automation.

• 경영과학
• /
• 제19권1호
• /
• pp.55-66
• /
• 2002

Given a directed network, a designated arc, and lowers and upper bounds for the distance of each arc, the preprocessing shortest path problem Is a decision problem that decides whether there is some choice of distance vector such that the distance of each arc honors the given lower and upper bound restriction, and such that the designated arc is on some shortest path from a source node to a destination notre with respect to the chosen distance vector. The preprocessing shortest path problem has many real world applications such as communication and transportation network management and the problem is known to be NP-complete. In this paper, we develop an algorithm that solves the problem using the structural properties of shortest paths.

• 경영과학
• /
• 제26권2호
• /
• pp.37-59
• /
• 2009

Electronic brainstorming (EBS) to improve the process and outcomes of group decision making is an artifact of Information Systems legacy. Despite three decades of research with EBS in an effort to become a key resource of organizational performance, its performance when compared to that of nominal is inconclusive because of the recent debate over its usefulness in terms of productivity. Subsequent researchers have directed our attention to the re-examination of cognitive stimulation, which is considered the major benefit in computer-based idea generation, to explain the performance singularity in computer-based groups. While both cognitive and motivational factors that moderate and mediate the group-interaction process remain unexplored, individual differences that are tightly linked to creative behavior have been largely ignored to account for the discrepancy in performance. Since simulations have been widely used in situations where an outcome does not meet the assumptions, the notion of a group simulator and detailed simulation mechanisms are introduced to examine the potential effects of individual differences on the performance of computer-based idea generation groups. In addition, two prior studies that empirically explored cognitive mechanisms with the group simulator are showcased along with six propositions to initiate future research.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2004년도 ICEIC The International Conference on Electronics Informations and Communications
• /
• pp.159-164
• /
• 2004

This paper aims towards designing and implementation of a new adaptive Peer to Peer (P2P) network that cluster itself on the basis of semantic proximity. We also developed an algorithm to classify the nodes to form the semantic groups and to direct the queries to appropriate groups without any human intervention. This is done using Bloom filters to summarise keywords of the documents shared by a peer. The queries are directed towards the appropriate clusters instead of flooding them. The proposed topology supports a system for maintaining a global, omnipresent trust value for each peer in an efficient manner both in terms of decision time and network load.

• 한국통신학회논문지
• /
• 제21권9호
• /
• pp.2349-2354
• /
• 1996

이 논문에서는 눈 먼 균등화에 쓰이는 4차 고다드 알고리즘의 수렴에 대하여 살펴보았다. 평균 성능 함수가 가장 작은 값을 갖는 점 부근에서의 4차 고다드 알고리즘의 국소적 성질을 이해함으로써 적응이득을 결정하였다. 4차 고다드 알고리즘의 정규화된 적응이득과 수렴속도는 결정 지향 알고리즘과 견주어 볼 때 적응이득은 작아야 한다는 것과 수렴속도는 빠르다는 것을 보였다.

• 대한전기학회논문지:시스템및제어부문D
• /
• 제49권5호
• /
• pp.269-277
• /
• 2000

We propose two new types multi-stage blind clustering equalizers for QAM demoulation, which are called a complex classification algorithm(CCA) and a radial basis function algorithm(RBFA). The CCA uses a clustering technique based on the joint gaussian probability function and computes separately the real part and imaginary part for simple implementation as well as less computation. In order to improve the performance of CCA, the Dual-Mode CCA(DMCCA) incorporates the CCA tap-updating mode with the decision-directed(DD) mode. The RBFA reduces the number of cluster centers through three steps using the classification technique of RBF and then updates the equalizer taps for QAM demodulation. Test results on 16-QAM confirm that the proposed algorithms perform better the conventional multi-state equalizers in the senses of SER and MSE under multi-path fading channel.

• ETRI Journal
• /
• 제29권5호
• /
• pp.596-606
• /
• 2007

It is well known that an OFDM receiver is vulnerable to synchronization errors. Despite fine estimations used in the initial acquisition, there are still residual synchronization errors. Though these errors are very small, they severely degrade the bit error rate (BER) performance. In this paper, we propose a residual error elimination scheme for the digital OFDM baseband receiver aiming to improve the overall BER performance. Three improvements on existing schemes are made: a pilot-aided recursive algorithm for joint estimation of the residual carrier frequency and sampling time offsets; a delay-based timing error correction technique, which smoothly adjusts the incoming data stream without resampling disturbance; and a decision-directed channel gain update algorithm based on recursive least-squares criterion, which offers faster convergence and smaller error than the least-mean-squares algorithms. Simulation results show that the proposed scheme works well in the multipath channel, and its performance is close to that of an OFDM system with perfect synchronization parameters.

• 전자공학회논문지B
• /
• 제32B권9호
• /
• pp.62-70
• /
• 1995

In some practical applications of the LMS Algorithm the coefficient adaptation can be performed only after some fixed delay. The resulting algorithm is known as the Delayed Least Mean Square (DLMS) algorithm in the literature. There exist analyses for this algorithm, but most of them are based on the unrealistic independence assumption between successive input vectors. Inthis paper we consider the DLMS algorithm with decreasing step size .mu.(n)=n/a, a>0 and prove the almost-sure convergence ofthe weight vector W(n) to the Wiener solution W$_{opt}$ as n .rarw. .inf. under the mixing unput condition and the satisfaction of the law of large numbers. Computer simulations for decision-directed adaptive equalizer with decoding delay are performed to demonstrate the functioning of the proposed algorithm.m.

• 산업경영시스템학회지
• /
• 제34권3호
• /
• pp.90-96
• /
• 2011

Finding the critical path (or the longest path) on acyclic directed graphs, which is well-known as PERT/CPM, the ambiguity of each acr's length can be modeled as a range or an interval, in which the actual length of arc may realize. In this case, the min-max regret criterion, which is widely used in the decision making under uncertainty, can be applied to find the critical path minimizing the maximum regret in the worst case. Since the min-max regret critical path problem with the interval arc's lengths is known as NP-hard, this paper proposes a heuristic algorithm to diminish the maximum regret. Then the computational experiments shows the proposed algorithm contributes to the improvement of solution compared with the existing heuristic algorithms.

• 한국군사과학기술학회지
• /
• 제14권6호
• /
• pp.1043-1048
• /
• 2011

In this paper, a newsynchronization technique applied to burst-mode communication is proposed. A synchronization technique is to estimate carrier frequency and phase offsets in a noisy channel environment. A fundamental problem for estimating the parameters(carrier phase and frequency offsets) in burst-mode transmission is that the ways of pursuing estimation accuracy and transmission efficiency are always trade-off. To solve this problem, a new carrier recovery technique is proposed to improve the transmission efficiency with reliable performance especially at low S/N. In the proposed technique, the synchronization parameters are first estimated based on a data-aided feed-forward estimation scheme. Then, a phase tracker using decision-directed DPLL estimates the phase offset for the data portion of the burst data. From simulation results, it shows fast synchronization with shorter preamble maintaining reasonable BER performance at low S/N.