• The Journal of the Korea Contents Association
• /
• v.21 no.6
• /
• pp.19-34
• /
• 2021

The aim of this study is verifying the effects of chatbot's error types and structures of error message on attitude, behavior intention towards the chatbot and perceived usability of the chatbot. The error types of chatbot are divided into 'experience' error and 'agency' error, which set different expectancy level, according to mind perception theory. The structures of error message were either unstructured condition composed of error specification only or structured condition composed of apology, explanation and willingness of improvement. It was found that score of perceived usability was higher in experience error condition than agency error condition. Also, all three scores of dependent variables were higher in structured error message condition than unstructured error message condition. Furthermore, expectation gap of experience didn't predict the dependent variables but expectation gap of agency predicted all three dependent variables. Finally, the tendency of interaction effect between the error type and the structure of the error message on expectation gap of agency was observed. This study confirmed the mitigating effect of structured error messages and the possibility that these effects may vary by the type of error. The result is expected to be applicable to design of error coping strategies that enhance user experience.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.6
• /
• pp.471-478
• /
• 2013

Powerful error control and increase in the number of bits per symbol should be provided for future high-quality communication systems. Each message bit may have different importance in multimedia data. Hence, UEP(unequal error protection) may be more efficient than EEP(equal error protection) in such cases. And the LDPC(low-density parity-check) code shows near Shannon limit error correcting performance. Therefore, the effect of UEP with LDPC codes is analyzed for high-quality message data in this paper. The relationship among MSE(mean square error), BER(bit error rate) and the number of bits per symbol is analyzed theoretically. Then, total message bits in a symbol are classified into two groups according to importance to prove the relationship by simulation. And the UEP performance is obtained by simulation according to the number of message bits in each group with the constraint of a fixed total code rate and codeword length. As results, the effect of UEP with the LDPC codes is analyzed by MSE according to the number of bits per symbol, the ratio of the message bits, and protection level of the classified groups.

• Journal of KIISE:Information Networking
• /
• v.29 no.3
• /
• pp.277-285
• /
• 2002

This paper proposes and analyzes an error control scheme for the transmission control based real-time communication, such as FDDI, TDMA, and wireless LAN, which delivers the message according to the round robin fashion after the off-line bandwidth allocation. Taking into account the time constraint of each message, the proposed error control scheme makes the receiver transmit the error report via asynchronous traffic while the sender resend the requested message via overallocated access time which is inevitably introduced by the bandwidth allocation procedure for hard real -time guarantee. The error control procedure does not interfere other real -time message transmissions. In addition, as each frame contains the size of the message it belongs, the receiver can recognize the end of completion of message transmission. This enables earlier error report to the receiver so that the sender can cope with more network errors. The analysis results along with simulation performed via SMPL show that the proposed scheme is able to enhance the deadline meet ratio of messages by overcoming the network errors. Using the proposed error control scheme, the hard real -time network can be built at cost lower than, but performance comparable to the expensive dual link network.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.9
• /
• pp.1162-1170
• /
• 1995

In this paper, we present a message transfer scheme for efficient message passing in the hierarchically structured multiprocessor computer SPAX(Scalable Parallel Architecture computer based on X-bar network). The message transfer scheme provides interface not only with operating system but also with end users. In order to transfer two types of control message and data message efficiently, it supports both of memory-mapped transfer and DMA-based transfer. Dual-port RAMs are used as message buffers, and control and status registers provide efficient programming interface. Interlaced parity scheme is adopted for error control. If any error is detected at receiving node, errored packet is resent by sender according to retry mechanism. In conjunction with retry mechanism, watchdog timers are used to protect infinite waiting and repeated retry. The proposed message transfer scheme can be applied to input/output nodes and communication connection nodes as well as processing nodes in the SPAX.

• Journal of Communications and Networks
• /
• v.11 no.1
• /
• pp.84-93
• /
• 2009

This paper focuses on message complexity performance analysis of mobile ad hoc network (MANET) address autoconfiguration protocols (AAPs) in reference to link errors generated by mobile wireless nodes. An enhancement was made using a proposed retransmission limit, S, to be computed for error recovery (based on the link error probability), to measure message complexity of AAPs in reference to the link error probability, $P_e$. The control procedures for the retransmission limit have been included for each of the AAPs. Retransmission limit control is critical for efficient energy consumption of MANET nodes operating on limited portable energy. O-notation has been applied to analyze the upper bound of the number of messages generated by a MANET group of nodes. The AAPs investigated in this paper are strong duplicate address detection (DAD), weak DAD with proactive routing protocol (WDP), weak DAD with on-demand routing protocol (WDO), and MANETConf. Each AAP reacts different to link errors, as each AAP has different operational procedures. The required number of broadcasting, unicasting, relaying, and received messages of the nodes participating in a single-node joining procedure is investigated to asymptotically calculate the message complexity of each AAP. Computer simulation was conducted and the results have been analyzed to verify the theoretical message complexity bounds derived. The message complexity of WDP was lowest, closely followed byWDO, based on the simulation results and analysis of the message complexity under nominal situations. The message complexity of MANETConf was higher than WDO, and strong DAD resulted to be most complex among the four AAPs.

• Journal of KIISE:Information Networking
• /
• v.35 no.4
• /
• pp.282-291
• /
• 2008

This paper focuses on message complexity performance analysis of MANET AAPs in reference to link errors generated by the mobile wireless nodes. To obtain the message complexity performance of AAPs in reference to the link error probability ($P_e$), an enhancement was made by proposing the retransmission limit (S) to be computed for error recovery (based on the link error probability), and then for each of the AAPs the control procedures for the retransmission limit have been properly included. The O-notation has been applied in analyzing the upper bound of the number of messages generated by a MANET group of N nodes. Based on a link error probability range of $P_e=0$ to 0.8, the AAPs investigated in this paper are Strong DAD, Weak DAD with proactive routing protocol (WDP), Weak DAD with on-demand routing protocol (WDO), and MANETconf. Based on the simulation results and analysis of the message complexity, for nominal situations, the message complexity of WDP was lowest, closely followed by WDO. The message complexity of MANETconf is higher than that of WDO, and Strong DAD results to be most complex among the four AAPs.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.10
• /
• pp.2223-2229
• /
• 2010

The integrity monitoring of anomalous GPS signal have been researched because of the degradation of GPS satellite performance. It is known that anomalous GPS signal can occur by failure of GPS satellite, sudden increase of ionosphere delay error, SA, wrong modeling for navigation parameters from control segment, and an electromagnetic wave interference, etc. In case of GPS anomaly by satellites can arise from carrier frequency, code and navigation message. In this paper, the scenarios with navigation message errors were made by using GPS simulator, and the influences of GPS navigation message error to receiver were analysed. The anomalies of preamble, bits related TOW count message, subframe ID in HOW, bits related satellite healthy, and the other navigation message errors were described and simulated. Also, the number of satellites, DOP and pseudorange are analyzed to know how the anomalous signal can affect on GPS receiver.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.6C
• /
• pp.561-569
• /
• 2003

In this paper, for my linear orthogonal space-time block including the orthogonal space-time codes introduced by Alamouti［1］, Tarokh［14］, and Xia［11］, the exact expression for the pairwise error probability in the slow Rayleigh fading channel is derived in terms of the message symbol distance between two message vectors rather than the codeword symbol distance between two transmitted codeword matrices. Using the one-dimensional component symbol error probability, the exact closed form expressions for the symbol error probability of linear orthogonal space-time codes are derived for QPSK, 16-QAM, 64-QAM, and 256-QAM.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.19 no.4
• /
• pp.642-649
• /
• 2018

The Modbus protocol is the most widely used protocol for connecting multiple slave control units (SCUs) in the master control unit. However, the Modbus protocol does not identify which SCU response message corresponds to the service request message. Therefore, when using the Modbus protocol, one service request message can be transmitted after processing the previous message. In this paper, we propose a Modbus application protocol with an index code and a service code to solve the problem. As a result of experimentation, it is possible to transmit the next service request message without processing the previous service request message. And when a communications error occurs, it is possible to identify what type of error occurred using an error detection algorithm. Also, with simultaneous multiple service requests, the proposed protocol can improve processing time by about 66.2%, compared to the original Modbus protocol.

• Journal of Advanced Navigation Technology
• /
• v.14 no.5
• /
• pp.625-631
• /
• 2010

In this paper, robustness performance of SNUR message is compared with those of existing ones, RTCM(Radio Technical Commission for Maritime Services) v2 MT(Message Type) 18/19 and MT 20/21 under a poor broadcast condition such as temporary data loss or disconnection We defined the temp oral data loss as 2 second delay and reconnection after disconnection as 7 second latency, and then evaluated its robustness for each latency case by double differentiating the observables. Our result shows that SNUR protocol method can reduce the latency error of the existing RTCM messages by 30~60%. Moreover, a rover using SNUR message, whose latency error is bounded within 1/4 L1 wave length, can figure out its own fixed position continuously in spite of 7 second disconnection, while the other using RTCM message, whose error is larger than half wave length, cannot keep its previous fixed solution.