• Journal of Biosystems Engineering
• /
• v.22 no.2
• /
• pp.177-188
• /
• 1997

A pepper harvester using a pair of counter rotating helically wound cylinders as a pepper removal mechanism has been developed. Pepper harvesting by machines under the customary cultivation practice was expected to lower land productivity, that most farmers were concerned about. As one way to compensate for loss in land productivity by machine harvest, experts on pepper cultivation suggested change of both varieties and plant density per area. From the view of machine design, their suggestion implied that distance between rows should be narrower and height of the pepper removal mechanism could be shorter. Experiments to improve perfect pepper recovery ratio and to reduce size of the pepper removal mechanism was accomplished. In order to be a economically feasible harvester, minimum pepper recovery ratio was required to be greater or equal to 80%. The research goal was achieved by both reducing the diameter of the wire-helices from 30 cm to 18 cm and increasing rotational speed of the wire-helices up to 425 rpm. The best perfect pepper recovery ratio was 82.3%. Validity of experiment design and interpretation on statistical analysis were discussed. To understand the pepper removal mechanism properly, a pepper removal theory based physics was judged to be necessary.

• Journal of Institute of Control, Robotics and Systems
• /
• v.4 no.2
• /
• pp.264-272
• /
• 1998

This paper proposes a fault detection and recovery mechanism for a fault-tolerant Mini-MAP system, and provides detailed techniques for its implementation. This paper considers the fault-tolerant Mini-MAP system which has dual layer structure from the LLC sublayer down to the physical layer to cope with the faults of those layers. For a good fault detection, a redundant and hierarchical fault supervision architecture is proposed and its implementation technique for a stable detection operation is provided. Information for the fault location is provided from data reported with a fault detection and obtained by an additional network diagnosis. The faults are recovered by the stand-by sparing method applied for a dual network composed of two equivalent networks. A network switch mechanism is proposed to achieve a reliable and stable network function. A fault-tolerant Mini-MAP system is implemented by applying the proposed fault detection and recovery mechanism.

• Physical Therapy Korea
• /
• v.2 no.2
• /
• pp.98-107
• /
• 1995

Physical therapists use assumptions about motor control in every aspect of their work in treating stroke patients. An understanding of the recovery process after stroke, some neural mechanism of recovery and therapeutic model is critical factor for physical therapist to evaluate and obtain a higher final stage of recovery. The purpose of this article was to review the recovery process after stroke, some neural mechanism of recovery, the role of rehabilitation in the process of recovery, therapeutic model and its limitation. This article will help understanding of recovery process. evaluation, and treatment of the stroke patients. Each therapeutic method consists of a different set of assumptions and they are not completely independent of one another. Therefore specializing in any techniques of physical therapy will not be enough to treat stroke, so we are in need of integrated approach and objective measurement instrument to adequately evaluate and treat stroke patients.

• 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 KIISE:Computer Systems and Theory
• /
• v.31 no.1_2
• /
• pp.67-77
• /
• 2004

Value prediction is a technique to obtain performance gains by supplying earlier source values of its data dependent instructions using predicted value of a instruction. To fully exploit the potential of value speculation, however, the efficient recovery mechanism is necessary in case of value misprediction. In this paper, we propose a sequential and selective recovery mechanism for value misprediction. It searches data dependency chain of the mispredicted instruction sequentially without pipeline stalls and adverse impact on clock cycle time. In our scheme, only the dependent instructions on the predicted instruction is selectively squashed and reissued in case of value misprediction.

• Journal of Communications and Networks
• /
• v.6 no.1
• /
• pp.60-67
• /
• 2004

With the fast growth of Internet and a new widespread interest in optical networks, the unparalleled potential of Multi-Protocol Label Switching (MPLS) is leading to further research and development efforts. One of those areas of research is Path Protection Mechanism. It is widely accepted that layer three protection and recovery mechanisms are too slow for today’s reliability requirements. Failure recovery latencies ranging from several seconds to minutes, for layer three routing protocols, have been widely reported. For this reason, a recovery mechanism at the MPLS layer capable of recovering from failed paths in 10’s of milliseconds has been sought. In light of this, several MPLS based protection mechanisms have been proposed, such as end-to-end path protection and local repair mechanism. Those mechanisms are designed for intra-domain recoveries and little or no attention has been given to the case of non-homogenous independent inter-domains. This paper presents a novel solution for the setup and maintenance of independent protection mechanisms within individual domains and merged at the domain boundaries. This innovative solution offers significant advantages including fast recovery across multiple nonhomogeneous domains and high scalability. Detailed setup and operation procedures are described. Finally, simulation results using OPNET are presented showing recovery times of a few milliseconds.

• Agribusiness and Information Management
• /
• v.1 no.2
• /
• pp.43-60
• /
• 2009

To improve the performance of wide-issue superscalar processors, it is essential to increase the width of instruction fetch and the issue rate. Removal of control hazard has been put forward as a significant new source of instruction-level parallelism for superscalar processors and the conditional branch prediction is an important technique for improving processor performance. Branch mispredictions, however, waste a large number of cycles, inhibit out-of-order execution, and waste electric power on mis-speculated instructions. Hence, the branch predictor with higher accuracy is necessary for good processor performance. In global-history-based predictors like gshare and GAg, many mispredictions come from commit update of the branch history. Some works on this subject have discussed the need for speculative update of the history and recovery mechanisms for branch mispredictions. In this paper, we present a new mechanism for recovering the branch history after a misprediction. The proposed mechanism adds an age_counter to the original predictor and doubles the size of the branch history register. The age_counter counts the number of outstanding branches and uses it to recover the branch history register. Simulation results on the SimpleScalar 3.0/PISA tool set and the SPECINT95 benchmarks show that gshare and GAg with the proposed recovery mechanism improved the average prediction accuracy by 2.14% and 9.21%, respectively and the average IPC by 8.75% and 18.08%, respectively over the original predictor.

• The Journal of Society for e-Business Studies
• /
• v.4 no.3
• /
• pp.159-178
• /
• 1999

As Electronic Commerce is getting larger, the volume of Internet-based commerce by enterprise is also getting larger. This phenomenon applies to Internet EDI, Global Internet Business, and CALS information services. In this paper, a new type of cryptographic key recovery mechanism satisfying requirements of business environment is proposed. It is also applied to enterprise information infrastructure for managing employees' task related to handling official properties of electronic enterprise documents exchange. This technology needs to be complied to information management policy of a certain enterprise environment because behavior of cryptographic key recovery can cause interruption of the employees' privacy. However, the cryptographic key recovery mechanism is able to applied to any kind of information service, the application areas of key recovery technology must be seriously considered as not disturbing user's privacy It will depend on the policy of enterprise information management of a specific company.

• ETRI Journal
• /
• v.25 no.5
• /
• pp.356-368
• /
• 2003

This paper analyzes the characteristics of packet losses in mobile computing environments based on the Gilbert model and then describes a mechanism that can recover the lost audio packets using redundant data. Using information periodically reported by a receiver, the sender dynamically adjusts the amount and offset values of redundant data with the constraint of minimizing the bandwidth consumption of wireless links. Since mobile computing environments can be often characterized by frequent and consecutive packet losses, loss recovery mechanism need to deal efficiently with both random and consecutive packet losses. To achieve this, the suggested mechanism uses relatively large, discontinuous exponential offset values. That gives the same effect as using both the sequential and interleaving redundant information. To verify the effectiveness of the mechanism, we extended and implemented RTP/RTCP and applications. The experimental results show that our mechanism, with an exponential offset, achieves a remarkably low complete packet loss rate and adapts dynamically to the fluctuation of the packet loss pattern in mobile computing environments.

• Convergence Security Journal
• /
• v.8 no.2
• /
• pp.57-62
• /
• 2008

In this paper, we suggest new fast recovery mechanism in RPR network, in case of node addition or removing by exterior attack. A RPR network recovery time is consist of two. Failure detecting time and reporting time are that. In this paper we propose fast recovery mechanism that can reduce each time. In a Legacy recovery mechanism, To report node's state, rpr node transmit protection messages. But interval of this protection messages increase exponentially. Thus A transmission failure of protection message cause delay of reporting of network state. Therefore we propose new node state reporting mechanism that put a node state in type b fairness message. And We also suggest fast failure detecting mechanism.