• Journal of the Korea Society of Computer and Information
• /
• v.25 no.3
• /
• pp.51-55
• /
• 2020

In this paper, an improved FAM is proposed by adopting similarity learning in the existing FAM (Fuzzy Associative Memory) used in image restoration. Image restoration refers to the recovery of the latent clean image from its noise-corrupted version. In serious application like face recognition, this process should be noise-tolerant, robust, fast, and scalable. The existing FAM is a simple single layered neural network that can be applied to this domain with its robust fuzzy control but has low capacity problem in real world applications. That similarity measure is implied to the connection strength of the FAM structure to minimize the root mean square error between the recovered and the original image. The efficacy of the proposed algorithm is verified with significant low error magnitude from random noise in our experiment.

• Journal of Internet Computing and Services
• /
• v.9 no.1
• /
• pp.145-158
• /
• 2008

The detected arcs by the cone intersection(CI) method exist within a tolerant error from the original curve. But the position of breakpoint by the CI method is sensitive to the tolerant error. The deviation of breakpoint position makes ill effects to the detection of arc center or radius. In this paper a improved CI method for center detection and arc segmentation is proposed. The detected arcs from curves by the proposed method have very stable mean of deviations from the original curves. The experimental results show that the position of breakpoint by the proposed method is closer to real position than the one by other methods.

• Journal of Information Processing Systems
• /
• v.7 no.3
• /
• pp.435-446
• /
• 2011

Microprocessors are becoming increasingly vulnerable to soft errors due to the current trends of semiconductor technology scaling. Traditional redundant multi-threading architectures provide perfect fault tolerance by re-executing all the computations. However, such a full re-execution technique significantly increases the verification workload on the processor resources, resulting in severe performance degradation. This paper presents a pro-active verification management approach to mitigate the verification workload to increase its performance with a minimal effect on overall reliability. An anomaly-speculation-based filter checker is proposed to guide a verification priority before the re-execution process starts. This technique is accomplished by exploiting a value similarity property, which is defined by a frequent occurrence of partially identical values. Based on the biased distribution of similarity distance measure, this paper investigates further application to exploit similar values for soft error tolerance with anomaly speculation. Extensive measurements prove that the majority of instructions produce values, which are different from the previous result value, only in a few bits. Experimental results show that the proposed scheme accelerates the processor to be 180% faster than traditional fully-fault-tolerant processor with a minimal impact on overall soft error rate.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.13 no.5
• /
• pp.415-422
• /
• 2013

In this paper, we present Self-Checking look-up-table (LUT) based on Scalable Error Detection Coding (SEDC) scheme for use in fault-tolerant reconfigurable architectures. SEDC scheme has shorter latency than any other existing coding schemes for all unidirectional error detection and the LUT execution time remains unaffected with self-checking capabilities. SEDC scheme partitions the contents of LUT into combinations of 1-, 2-, 3- and 4-bit segments and generates corresponding check codes in parallel. We show that the proposed LUT with SEDC performs better than LUT with traditional Berger as well as Partitioned Berger Coding schemes. For 32-bit data, LUT with SEDC takes 39% less area and 6.6 times faster for self-checking than LUT with traditional Berger Coding scheme.

• Journal of information and communication convergence engineering
• /
• v.10 no.3
• /
• pp.237-241
• /
• 2012

In wireless sensor networks, the importance of transporting data correctly with reliability is increasing gradually along with the need to support communications between the nodes and sink. Data flow from the sink to the nodes requires reliability for control or management that is very sensitive and intolerant of error; however, data flow from the nodes to the sink is relatively tolerant. In this paper, with emphasis on the data flow from the sink to the nodes, we propose a mechanism that considers accurate transport with reliability hop-by-hop. During the process of sending the data, if errors occur or data is missing, the proposed mechanism supports error recovery using a fixed window with selective acknowledgment. In addition, this mechanism supports congestion control depending on the buffer condition. Through the simulation, we show that this mechanism is accurate, reliable, and proper for transport in wireless sensor networks.

• Journal of Institute of Control, Robotics and Systems
• /
• v.19 no.9
• /
• pp.822-826
• /
• 2013

In this paper, we propose an AFDO (Adaptive Fault Diagnosis Observer) and a fault tolerant controller for a class of nonlinear continuous-time system under the nonlinear abrupt actuator faults. Together with its estimation laws, the AFDO which estimates that the actuator faults is designed by using the Lyapunov analysis. Then, based on the designed AFDO, an adaptive sliding mode controller is proposed as the fault tolerant controller. Using Lyapunov stability analysis, we also prove the uniform boundedness of the state, the output and the fault estimation errors, and the asymptotic stability of the tracking error under the nonlinear time-varying faults. Finally, we illustrate the effectiveness of the proposed diagnosis method and the control scheme thorough computer simulations.

• Journal of information and communication convergence engineering
• /
• v.9 no.6
• /
• pp.625-628
• /
• 2011

Dynamic sensor network(DSN) technology which is based on swarming flight type air node offers analyzed and acquired information on target data gathered by air nodes in rotation flight or 3 dimension array flight. Efficient operation of dynamic sensor network based on air node is possible when problems of processing time, data transmission reliability, power consumption and intermittent connectivity are solved. Delay tolerant network (DTN) can be a desirable alternative to solve those problems. DTN using store-and-forward message switching technology is a solution to intermittent network connectivity, long and variable delay time, asymmetric data rates, and high error rates. However, all processes are performed at the bundle layer, so high power consumption, long processing time, and repeated reliability technique occur. DSN based on swarming flight type air node need to adopt store-and-forward message switching technique of DTN, the cancelation scheme of repeated reliability technique, fast processing time with simplified layer composition.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.17 no.3
• /
• pp.458-464
• /
• 2017

A magnetic tunnel junction (MTJ) based ternary content addressable memory (TCAM) is proposed which provides non-volatility. A unit cell of the TCAM has two MTJ's and 4.875 transistors, which allows the realization of TCAM in a small area. The equivalent resistance of parallel connected multiple unit cells is compared with the equivalent resistance of parallel connected multiple reference resistance, which provides the averaging effect of the variations of device characteristics. This averaging effect renders the proposed TCAM to be variation-tolerant. Using 65-nm CMOS model parameters, the operation of the proposed TCAM has been evaluated including the Monte-Carlo simulated variations of the device characteristics, the supply voltage variation, and the temperature variation. With the tunneling magnetoresistance ratio (TMR) of 1.5 and all the variations being included, the error probability of the search operation is found to be smaller than 0.033-%.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2003.06a
• /
• pp.963-968
• /
• 2003

The continuous process systems usually consists of various components: driven rollers. idle rolls, load-cell and so on. Even a simple fault in a single component in the line may cause a catastrophic damage on the final products. Therefore it is absolutely necessary to diagnosis the components of the continuous systems. In this paper, an adaptive eccentricity compensation method is presented. And a new diagnosis method for transverse roll shape defects on rolling process is developed. The new method was induced from analyzing the rolling mechanism by using rolling force model, tension model, Hitchcock's equation, and measured delivery thickness of materials etc. Computer simulation results also show that the proposed diagnosis methods is very effective in the diagnosis of 3-D roll shape

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.8 no.1
• /
• pp.47-53
• /
• 2012

Sensor networks and car networks that have different structure from that of conventional TCP/IP network require extreme network environment due to frequent change of connectivity. Because such extreme network environment has characteristics like unreliable link connectivity, long delay time, asymmetrical data transfer rate, and high error rate, etc., it is difficult to perform normally with the conventional TCP/P-based routing. DTNs (delay and disruption tolerant network) was designed to support data transfer in extreme network environment with long delay time and no guarantee for continuous connectivity between terminals. This study suggests an algorithm that limits the maximum number of copying transferred message to L by improving the spray and wait routing protocol, which is one of the conventional DTNs routing protocols, and using the azimuth and density data of the mobile nods. The suggested algorithm was examined by using ONE, a DTNs simulator. As a result, it could reduce the delay time and overhead of unnecessary packets compared to the conventional spray and wait routing protocol.