• Title/Summary/Keyword: Redundant Mechanism

Search Result 83, Processing Time 0.094 seconds

Platform of Hot Pepper Stress Genomics: Indentification of Stress Inducible Genes in Hot Pepper (Capsicum annuum L.) Using cDNA Microarray Analysis

  • Chung, Eun-Jo;Lee, Sanghyeob;Park, Doil
    • Proceedings of the Korean Society of Plant Pathology Conference
    • /
    • 2003.10a
    • /
    • pp.81.1-81
    • /
    • 2003
  • Although plants have evolved to possess various defense mechanisms from local biotic and abiotic stressors, most of yield loss is caused by theses stressors. Recent studies have revealed that several different stress responsive reactions are inter-networking. Therefore, the identification and dissection of stress responsive genes is an essential and first step towards understanding of the global defense mechanism in response to various stressors. For this purpose, we applied cDNA microarray analysis, because it has powerful ability to monitor the global gene expression in a specific situation. To date, more than 10,000 non-redundant genes were identified from seven different cDNA libraries and deposited in our EST database (http://plant.pdrs.re.kr/ks200201/pepper.html). For this study, we have built 5K cDNA microarray containing 4,685 unigene clones from three different cDNA libraries. Monitoring of gene expression profiles of hot pepper interactions with biotic stress, abiotic stresses and chemical treatments will be presented. Although this work shows expression profiling at the sub-genomic level, this could be a good starting point to understand the complexity of global defense mechanism in hot pepper.

  • PDF

Reliable Gossip Zone for Real-Time Communications in Wireless Sensor Networks

  • Li, Bijun;Kim, Ki-Il
    • Journal of information and communication convergence engineering
    • /
    • v.9 no.2
    • /
    • pp.244-250
    • /
    • 2011
  • Gossip is a well-known protocol which was proposed to implement broadcast service with a high reliability in an arbitrarily connected network of sensor nodes. The probabilistic techniques employed in gossip have been used to address many challenges which are caused by flooding in wireless sensor networks (WSNs). However, very little work has yet been done on real-time wireless sensor networks which require not only highly reliable packets reception but also strict time constraint of each packet. Moreover, the unique energy constraining feature of sensor makes existing solutions unsuitable. Combined with unreliable links, redundant messages overhead in real-time wireless sensor networks is a new challenging issue. In this paper, we introduce a Reliable Gossip Zone, a novel fine-tailored mechanism for real-time wireless sensor networks with unreliable wireless links and low packet redundancy. The key idea is the proposed forwarding probability algorithm, which makes forwarding decisions after the realtime flooding zone is set. Evaluation shows that as an oracle broadcast service design, our mechanism achieves significantly less message overhead than traditional flooding and gossip protocols.

Query Optimization with Knowledge Management in Relational Database (관계형 데이타베이스에서 지식관리에 의한 질의 최적화)

  • Nam, In-Gil;Lee, Doo-Han
    • The Transactions of the Korea Information Processing Society
    • /
    • v.2 no.5
    • /
    • pp.634-644
    • /
    • 1995
  • In this paper, we propose a mechanism to transform more effective and semantically equivalent queries by using appropriately represented three kinds of knowledge. Also we proposed a mechanism which transforms partially omitted components or expressions into complete queries so that users can use more simple queries. The knowledges used to transform and optimize are semantic, structural and domain knowledge. Semantic knowledge includes semantic integrity constraints and domain integrity constraints. Structural knowledge represents physical relationship between relations. And domain knowledge maintains the domain information of attributes. The proposed system optimizes to more effective queries by eliminating/adding/replacing unnecessary or redundant restrictions/joins.

  • PDF

Research on the enhancement of throughput for traffic in WLAN (초고속 무선 랜에서 트래픽 간의 처리율 향상을 위한 연구)

  • Song, Byunjin;Lee, Seonhee
    • Journal of Satellite, Information and Communications
    • /
    • v.10 no.3
    • /
    • pp.53-56
    • /
    • 2015
  • In this paper, we want provide improved services with faster transmission, IEEE 802.11n was standardized. A-MPDU (Aggregation MAC Protocol Data UNIT) is a vital function of the IEEE 802.11n standard, which was proposed to improve transmission rate by reducing frame transmission overhead. In this paper, we show the problems of TCP retransmission with A-MPDU and propose a solution utilizing the property of TCP cumulative ACK. If the transmission of an MPDU subframe fails, A-MPDU mechanism allows selective re-transmission of failed MPDU subframe in the MAC layer. In TCP traffic transmission, however, a failed MPDU transmission causes TCP Duplicate ACK, which causes unnecessary TCP re-transmission. Furthermore, congestion control of TCP causes reduction in throughput. By supressing unnecessary duplicate ACKs the proposed mechanism reduces the overhead in transmitting redundant TCP ACKs, and transmitting only a HS-ACK with the highest sequence number. By using the RACK mechanism, through the simulation results, it was conrmed that the RACK mechanism increases up to 20% compared the conventional A-MPDU, at the same time, it tightly assures the fairness among TCP flows.

A Novel Redundant Data Storage Algorithm Based on Minimum Spanning Tree and Quasi-randomized Matrix

  • Wang, Jun;Yi, Qiong;Chen, Yunfei;Wang, Yue
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.1
    • /
    • pp.227-247
    • /
    • 2018
  • For intermittently connected wireless sensor networks deployed in hash environments, sensor nodes may fail due to internal or external reasons at any time. In the process of data collection and recovery, we need to speed up as much as possible so that all the sensory data can be restored by accessing as few survivors as possible. In this paper a novel redundant data storage algorithm based on minimum spanning tree and quasi-randomized matrix-QRNCDS is proposed. QRNCDS disseminates k source data packets to n sensor nodes in the network (n>k) according to the minimum spanning tree traversal mechanism. Every node stores only one encoded data packet in its storage which is the XOR result of the received source data packets in accordance with the quasi-randomized matrix theory. The algorithm adopts the minimum spanning tree traversal rule to reduce the complexity of the traversal message of the source packets. In order to solve the problem that some source packets cannot be restored if the random matrix is not full column rank, the semi-randomized network coding method is used in QRNCDS. Each source node only needs to store its own source data packet, and the storage nodes choose to receive or not. In the decoding phase, Gaussian Elimination and Belief Propagation are combined to improve the probability and efficiency of data decoding. As a result, part of the source data can be recovered in the case of semi-random matrix without full column rank. The simulation results show that QRNCDS has lower energy consumption, higher data collection efficiency, higher decoding efficiency, smaller data storage redundancy and larger network fault tolerance.

Design Scheme for a 6-DOF Parallel Haptic Device and Comparative Study on the Singularity-Free Algorithms (6자유도 병렬형 햅틱장치의 설계와 특이점 회피 알고리즘의 비교연구)

  • 김형욱;이재훈;이병주;서일홍
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.8 no.12
    • /
    • pp.1041-1047
    • /
    • 2002
  • It is known that parallel-type mechanisms have many singularities than serial-type mechanisms. In haptic application, these singularities deteriorate the system performance when the haptic system displays the reflecting force. Moreover, different from general manipulators, haptic systems can't avoid the singular point because they are operated by user's random motion command. Although many singularity-free algorithms for serial mechanisms have been proposed and studied. singularity-free algorithms for parallel haptic application have not been deeply discussed. In this paper, various singularity-free algorithms, which are appropriate to parallel haptic system, will be discussedand evaluated.

A Study on the Redundant Vibration Analysis for the Development of Scratch Processing Technology (스크래치 가공기술 개발에 따른 잉여 진동 성분 분석에 관한 연구)

  • Jeon C.D.;Cha J.H.;Yun Sh.I.;Han S.B.
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 2005.06a
    • /
    • pp.1660-1663
    • /
    • 2005
  • Unwanted vibrations are inevitably induced in other directions when pure unidirectional vibration motion is desired for the vertical scratching mechanism. Pure vertical vibration motion of the scratching machine can be obtained by driving identical two motors with symmetrically positioned eccentric unbalance masses. The desired optimal condition for driving pure vertical vibration for the scratching machine is assumed to be the resonance condition in that direction. Imposing the flexibility of the scratching machine in the horizontal direction, we can find out the amount of horizontal vibration component while maintaining the resonance in vertical direction. The desired stiffness in horizontal direction which produces the minimum vibration in horizontal direction are defined which can be used as a guide line to design the supporting structure of the scratching machine.

  • PDF

Molecules of the Tumor Necrosis Factor (TNF) Receptor and Ligand Superfamilies: Endless Stories

  • Kwon, Byung-Suk;Kwon, Byoung-Se
    • BMB Reports
    • /
    • v.32 no.5
    • /
    • pp.419-428
    • /
    • 1999
  • Tumor necrosis factor (TNF) receptor members have unique structures composed of 2-4 cysteine - rich pseudorepeats in the extracellular domain. On ligation by trimeric ligand molecules, oligomerization of three receptor molecules occurs, which in turn activates the receptor and recruits intracellular signaling molecules to the cytoplasmic tail to initiate biological events. Recently, the numbers of tumor necrosis factor receptor and ligand family members have been rapidly expanding. Functional characterization of the new members has indicated redundant roles with other known members as well as provided insights into novel functions. In particular, identification of soluble decoy receptors which have the ability to bind multiple ligands highlights a complex control mechanism of immune responses by these molecules. Studies of the new members have also revealed that the TNF receptor and ligand family members play an important role in other than the immune system.

  • PDF

APDE(Antenna Positioning Drive Electronics) Design for MSC (Multi-Spectral Camera)

  • Kong Jong-Pil;Heo Haeng-Pal;Kim YoungSun;Park Jong-Euk;Youn Heong-Sik
    • Proceedings of the KSRS Conference
    • /
    • 2004.10a
    • /
    • pp.440-443
    • /
    • 2004
  • As a main management unit of MSC, PMU controls the MSC payload operation by issuing commands to other subunit and PMU internal modules. One of these main control functions is to drive the APS(Antenna Pointing System) when APS motion is required. For this purpose, SBC(Single Board Computer) for calculating motor commands and APDE for driving APM(Antenna Pointing Mechanism) by PWM signal operate inside PUM. In this paper, details on APDE design shall be described such as electronic board architecture, primary and redundant design concept, Cross-Strap, FPGA contents and latch-up immune concept, etc., which shall show good practices of electronic board design for space program.

  • PDF

A Probabilistic Broadcasting Mechanism based on Cross Layer Model Deliberating Received Signal Strength Ratio in Mobile Ad Hoc Networks

  • Kim, Jae-Soo
    • Journal of the Korea Society of Computer and Information
    • /
    • v.21 no.3
    • /
    • pp.25-32
    • /
    • 2016
  • Mobile Ad Hoc Networks(MANETs) consists of mobile nodes which communicate with each other without any centralized infrastructure. Message broadcasting by flooding for route discovery in MANET can result in high redundant retransmission, contention and collision of broadcasting packet, known as the broadcast storm problem collectively. The cross-layer design is adopted in this paper, which lets routing layer share the received signal strength information at MAC layer. Also this paper proposes a new probabilistic approach that dynamically adjusts the rebroadcasting probability of a node for routing request packets (RREQs) according to the received signal strength. The simulation results show that the proposed approach demonstrates better performance than blind flooding, fixed probabilistic broadcasting approaches.