• Title/Summary/Keyword: Multiple-Chain

Search Result 571, Processing Time 0.026 seconds

Intrinsic bent DNA colocalizes with the sequence involved in the Nd-sD mutation in the Bombyx mori fibroin light chain gene

  • Barbosa, Joice Felipes;Bravo, Juliana Pereira;Takeda, Karen Izumi;Zanatta, Daniela Bertolini;Silva, Jose Luis Da Conceicao;Balani, Valerio Americo;Fiorini, Adriana;Fernandez, Maria Aparecida
    • BMB Reports
    • /
    • v.41 no.5
    • /
    • pp.394-399
    • /
    • 2008
  • Multiple sequence alignments of the Bombyx mori fibroin light chain gene (fib-L) from hybrids and from Chinese and Japanese strains demonstrated that 51.6% of the fib-L third intron is conserved. One of these conserved segments, 41 bp long, contains the sequence CGTTATTATACATATT, which is duplicated in the B. mori Nd-$s^D$ mutant. In the present work, electrophoretic mobility assays and computational analyses revealed a major peak of intrinsic bent DNA within the segment that undergoes breakage in the previously-described Nd-$s^D$ mutation. This result suggested that this intrinsically-curved region might mediate DNA cleavage and enhance recombination events in the third intron of the Bombyx mori fib-L gene.

A Reliability Redundancy Optimization Problem with Continuous Time Absorbing Markov Chain (연속시간 흡수 마코프체인을 활용한 신뢰도 중복 최적화 문제)

  • Kim, Gak-Gyu;Baek, Seungwon;Yoon, Bong-Kyu
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.39 no.4
    • /
    • pp.290-297
    • /
    • 2013
  • The increasing level of operation in high-tech industry is likely to require ever more complex structure in reliability problem. Furthermore, system failures are more significant on society as a whole than ever before. Reliability redundancy optimization problem (RROP) plays a important role in the designing and analyzing the complex system. RROP involves selection of components with multiple choices and redundancy levels for maximizing system reliability with constraints such as cost, weight, etc. Meanwhile, previous works on RROP dealt with system with perfect failure detection, which gave at most a good solution. However, we studied RROP with imperfect failure detection and switching. Using absorbing Markov Chain, we present not a good solution but the optimal one. In this study, the optimal system configuration is designed with warm and cold-standby redundancy for k-out-of-n system in terms of MTTF that is one of the performance measures of reliability.

Does Higher Datarate Perform Better in IEEE 802.11-based Multihop Ad Hoc Networks?

  • Li, Frank Y.;Hafslund, Andreas;Hauge, Mariann;Engelstad, Paal;Kure, Oivind;Spilling, Pal
    • Journal of Communications and Networks
    • /
    • v.9 no.3
    • /
    • pp.282-295
    • /
    • 2007
  • Due to the nature that high datarate leads to shorter transmission range, the performance enhancement by high datarate 802.11 WLANs may be degraded when applying high datarate to an 802.11 based multihop ad hoc network. In this paper, we evaluate, through extensive simulations, the performance of multihop ad hoc networks at multiple transmission datarates, in terms of the number of hops between source and destination, throughput, end-to-end delay and packet loss. The study is conducted based on both stationary chain topology and mesh topologies with or without node mobility. From numerical results on network performance based on chain topology, we conclude that there is almost no benefit by applying the highest datarate when the chain length is 6 hops or more. With node mobility in mesh topology, the benefit of using high datarate diminishes at even shorter number of hops. To explore the main reasons for this behavior, analyses on multihop end-to-end throughput and network k-connectivity have been conducted later in the paper, and correspondingly an auto-rate adaptation algorithm has been proposed.

Application of Hidden Markov Chain Model to identify temporal distribution of sub-daily rainfall in South Korea

  • Chandrasekara, S.S.K;Kim, Yong-Tak;Kwon, Hyun-Han
    • Proceedings of the Korea Water Resources Association Conference
    • /
    • 2018.05a
    • /
    • pp.499-499
    • /
    • 2018
  • Hydro-meteorological extremes are trivial in these days. Therefore, it is important to identify extreme hydrological events in advance to mitigate the damage due to the extreme events. In this context, exploring temporal distribution of sub-daily extreme rainfall at multiple rain gauges would informative to identify different states to describe severity of the disaster. This study proposehidden Markov chain model (HMM) based rainfall analysis tool to understand the temporal sub-daily rainfall patterns over South Korea. Hourly and daily rainfall data between 1961 and 2017 for 92 stations were used for the study. HMM was applied to daily rainfall series to identify an observed hidden state associated with rainfall frequency and intensity, and further utilized the estimated hidden states to derive a temporal distribution of daily extreme rainfall. Transition between states over time was clearly identified, because HMM obviously identifies the temporal dependence in the daily rainfall states. The proposed HMM was very useful tool to derive the temporal attributes of the daily rainfall in South Korea. Further, daily rainfall series were disaggregated into sub-daily rainfall sequences based on the temporal distribution of hourly rainfall data.

  • PDF

Cooperative Game Theory Application for Three-Echelon Supply Chain (3단계 공급사슬게임을 위한 협조적 게임이론의 적용)

  • Lee, Dongju
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.42 no.3
    • /
    • pp.15-24
    • /
    • 2019
  • Fair Allocation of profits or costs arising from joint participation by multiple individuals or entities with different purposes is essential for their continuing involvement and for their dissatisfaction reduction. In this research, fair allocation of the profits of forming a grand coalition in Three-Echelon Supply Chain (TESC) game that is composed of manufacturer, distributor and retailer, is studied. In particular, the solutions of the proportional method of profit, the proportional method of marginal profit, and Shapley value based on cooperative game theory are proved to be in the desirable characteristics of the core. The proportional method of profit and the proportional method of marginal profit are often used because of their ease of application. These methods distribute total profit in proportion to profits or marginal profits of each game participant. In addition, Shapley value can be defined as the average marginal profit when one game player is added at a time. Even though the calculation of the average of all possible marginal profits is not simple, Shapley value are often used as a useful method. Experiments have shown that the solution of the incremental method, which calculates the marginal cost of adding game players in the order of manufacturers, distributors and retailers, does not exist in the core.

Supply chain attack detection technology using ELK stack and Sysmon (ELK 스택과 Sysmon을 활용한 공급망 공격 탐지 기법)

  • hyun-chang Shin;myung-ho Oh;seung-jun Gong;jong-min Kim
    • Convergence Security Journal
    • /
    • v.22 no.3
    • /
    • pp.13-18
    • /
    • 2022
  • With the rapid development of IT technology, integration with existing industries has led to an increase in smart manufacturing that simplifies processes and increases productivity based on 4th industrial revolution technology. Security threats are also increasing and there are. In the case of supply chain attacks, it is difficult to detect them in advance and the scale of the damage is extremely large, so they have emerged as next-generation security threats, and research into detection technology is necessary. Therefore, in this paper, we collect, store, analyze, and visualize logs in multiple environments in real time using ELK Stack and Sysmon, which are open source-based analysis solutions, to derive information such as abnormal behavior related to supply chain attacks, and efficiently We try to provide an effective detection method.

The effects of Supply Chain Management Factors on the Performance of SCM Adoption in Textile/Apparel Firms

  • Shin, Sang-Moo
    • Journal of Fashion Business
    • /
    • v.9 no.3
    • /
    • pp.37-46
    • /
    • 2005
  • The purpose at this study was to investigate how component factors at SCM affect the performance at textile and apparel firms in a competitive market. For the methodology at this study, the questionnaire was developed based upon the literature review. 150 questionnaires were distributed to the CEOs, CMOs, and experts who operate SCM in textile and apparel firms. The returned usable 85 were analyzed by SPSS10.0 with multiple regression analysis and Cronbach's Alpha for internal consistency and reliability. The performance at the textile and apparel firms that adopted SCM was affected by information system, partnership, and business environment in a descending order. For details, the performance of the textile and apparel firms that adopted SCM was affected by computerization, information sharing, CEO's concern, alliance, and support in a descending order.

Integrating Multiple Mathematical Models for Supply Chain Optimization (공급사슬 최적화를 위한 다중의 수리적 모델 활용 구조)

  • 한현수
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2001.10a
    • /
    • pp.97-100
    • /
    • 2001
  • 제조 기업의 가치사슬 최적화를 위한 전략적, 운영상 의사결정 문제는 수리적 모델을 이용한 DSS의 효과적인 활용을 통하여 해결 될 수 있다. 의사결정 프로세스는 필연적으로 공급사슬의 여러 성과 목표와 관련 조직간의 Trade-off 및 연계관계(Interaction)가 고려되므로 복수의 DSS 활용이 필요하게 된다. 이와 관련하여 본 논문에서는 공급 사슬 전체의 최적화를 위한 다수의 전략적 목표 및 의사결정 프로세스, 연계된 수리적 모델들을 정의하고, 관련 조직 및 성과 지표 별 부분적 최적화(Local Optimality)를 지양하고 전체최적화 (Global Optimality)를 달성하기 위한 DSS Logic을 철강산업 프로세스를 대상으로 수리적 모델들의 분할(Decomposition) 및 통합개념을 통하여 제시하였다.

  • PDF

Bayesian Change-point Model for ARCH

  • Nam, Seung-Min;Kim, Ju-Won;Cho, Sin-Sup
    • Communications for Statistical Applications and Methods
    • /
    • v.13 no.3
    • /
    • pp.491-501
    • /
    • 2006
  • We consider a multiple change point model with autoregressive conditional heteroscedasticity (ARCH). The model assumes that all or the part of the parameters in the ARCH equation change over time. The occurrence of the change points is modelled as the discrete time Markov process with unknown transition probabilities. The model is estimated by Markov chain Monte Carlo methods based on the approach of Chib (1998). Simulation is performed using a variant of perfect sampling algorithm to achieve the accuracy and efficiency. We apply the proposed model to the simulated data for verifying the usefulness of the model.

An efficient polygonal chian inersection algorithm (점열 곡선의 꼬임을 효율적으로 찾는 알고리즘)

  • 박상철;신하용;최병규
    • Korean Journal of Computational Design and Engineering
    • /
    • v.4 no.3
    • /
    • pp.190-199
    • /
    • 1999
  • Presented in this paper is an algorithm for finding all intersections among polygonal chains with an O((n+k)·log m) worst-case time complexity, where n is the number of lien segments in the polygonal chains, k is the number of intersections, and m is the number of monotone chains. The proposed algorithm is based on the sweep line algorithm. Unlike the previous polygonal-chain intersection algorithms that are designed to handle special only cases, such as convex polygons or C-oriented polygons, the proposed algorithm can handle arbitrarily shaped polygonal chains having self-intersections and singularities (tangential contact, multiple intersections). The algorithms has been implemented and applied to 1) testing simplicity of a polygon, 2) finding intersections among polygons and 3) offsetting planar point-sequence curves.

  • PDF