• Title/Summary/Keyword: two bound theory

Search Result 58, Processing Time 0.033 seconds

A Study on Flashless Non-Axisymmetric Forging (플래시 없는 비축대칭 단조에 관한 연구)

  • Bae, Won-Byong;Kim, Young-Ho;Choi, Jae-Chan;Lee, Jong-Heon;Kim, Dong-Young
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.12 no.3
    • /
    • pp.42-52
    • /
    • 1995
  • An UBET(Upper Bound Elemental Techniquel) program has been developed to analyze forging load, die-cavity filling and effective strain distribution for flashless non-axisymmetric forging. To analyze the process easily, it is suggested that the deforma- tion is divided into two different parts. Those are axisymmetric part in corner and plane- strain part in lateral. The total power consumption is minimized through combination of two deformation parts by building block method, form which the upper-bound forging load, the flow pattern, the grid pattern, the velocity distribution and the effective strain are deter- mined. To show the merit of flashless forging, the results of flashless and flash-forging processes are compared through theory and experiment. Experiments have been carried out with plasticine billets at room temperature. The theoretical predictions of the forging load and the flow pattern are in good agrement with the experimental results.

  • PDF

Characterization of New Two Parametric Generalized Useful Information Measure

  • Bhat, Ashiq Hussain;Baig, M. A. K.
    • Journal of Information Science Theory and Practice
    • /
    • v.4 no.4
    • /
    • pp.64-74
    • /
    • 2016
  • In this paper we define a two parametric new generalized useful average code-word length $L_{\alpha}^{\beta}$(P;U) and its relationship with two parametric new generalized useful information measure $H_{\alpha}^{\beta}$(P;U) has been discussed. The lower and upper bound of $L_{\alpha}^{\beta}$(P;U), in terms of $H_{\alpha}^{\beta}$(P;U) are derived for a discrete noiseless channel. The measures defined in this communication are not only new but some well known measures are the particular cases of our proposed measures that already exist in the literature of useful information theory. The noiseless coding theorems for discrete channel proved in this paper are verified by considering Huffman and Shannon-Fano coding schemes on taking empirical data. Also we study the monotonic behavior of $H_{\alpha}^{\beta}$(P;U) with respect to parameters ${\alpha}$ and ${\beta}$. The important properties of $H_{{\alpha}}^{{\beta}}$(P;U) have also been studied.

Differential Game Based Air Combat Maneuver Generation Using Scoring Function Matrix

  • Park, Hyunju;Lee, Byung-Yoon;Tahk, Min-Jea;Yoo, Dong-Wan
    • International Journal of Aeronautical and Space Sciences
    • /
    • v.17 no.2
    • /
    • pp.204-213
    • /
    • 2016
  • A differential game theory based approach is used to develop an automated maneuver generation algorithm for Within Visual Range (WVR) air-to-air combat of unmanned combat aerial vehicles (UCAVs). The algorithm follows hierarchical decisionmaking structure and performs scoring function matrix calculation based on differential game theory to find the optimal maneuvers against dynamic and challenging combat situation. The score, implying how much air superiority the UCAV has, is computed from the predicted relative geometry, relative distance and velocity of two aircrafts. Security strategy is applied at the decision-making step. Additionally, a barrier function is implemented to keep the airplanes above the altitude lower bound. To shorten the simulation time to make the algorithm more real-time, a moving horizon method is implemented. An F-16 pseudo 6-DOF model is used for realistic simulation. The combat maneuver generation algorithm is verified through three dimensional simulations.

Design of Suboptimal Robust Kalman Filter via Linear Matrix Inequality (선형 행렬 부등식을 이용한 준최적 강인 칼만 필터의 설계)

  • Jin, Seung-Hee;Yoon, Tae-Sung;Park, Jin-Bae
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.48 no.5
    • /
    • pp.560-570
    • /
    • 1999
  • This paper formulates the suboptimal robust Kalman filtering problem into two coupled Linear Matrix Inequality (LMI) problems by applying Lyapunov theory to the augmented system which is composed of the state equation in the uncertain linear system and the estimation error dynamics. This formulations not only provide the sufficient conditions for the existence of the desired filter, but also construct the suboptimal robust Kalman filter. The proposed filter can guarantee the optimized upper bound of the estimation error variance for uncertain systems with parametric uncertainties in both the state and measurement matrices. In addition, this paper shows how the problem of finding the minimizing solution subject to Quadratic Matrix Inequality (QMI), which cannot be easily transformed into LMI using the usual Schur complement formula, can be successfully modified into a generic LMI problem.

  • PDF

An Optimality Approach to NPI Constructions

  • Moon, Seung-Chul;Sohng, Hong-Ki
    • Journal of English Language & Literature
    • /
    • v.55 no.3
    • /
    • pp.459-474
    • /
    • 2009
  • The Journal of English Language and Literature. The purpose of this study is to provide an optimality theoretic approach to NPIs (Negative Polarity Items) in English and Korean by proposing three universal constraints. The constraints are C-command Condition (CCC): NPI must be c-commanded by a constituent with negative meaning; Locality Condition (LOC): NPI must be bound in the local domain; Subjacency: NPI licensing must satisfy Subjacency Condition (SBJ); Previous analyses have shown that these three constraints control NPIs in one way or another. This study attempts to demonstrate that NPIs in both English and Korean languages can be nicely accounted for by setting a different constraint hierarchy for the two independent languages. That is, by slightly changing the constraint hierarchy, distributional differences of NPIs in both languages can be accounted straightforwardly within the framework of Optimality Theory.

A Study on the Prediction Model of Shear Strength of RC Beams Strengthened for Shear by FRP (섬유보강재로 전단보강된 RC보의 전단강도예측을 위한 해석모델에 대한 연구)

  • 심종성;오홍섭;유재명
    • Journal of the Korea Concrete Institute
    • /
    • v.12 no.5
    • /
    • pp.35-46
    • /
    • 2000
  • In this paper, an analytical model is proposed to predict the shear strenth of RC beams strengthened by FRP. This predictional model is composed of two basic models-the upper bound theorem for shear failure (shear tension or shear compression criteria) and a truss model based on the lower bound theorem for diagonal tension creteria. Also, a simple flexural theory based on USD is used to explain flexural failure. The major cause of destruction of RC beams shear strengthened by FRP does not lie in FRP fracture but in the loss of load capacity incurred by rip-off failure of shear strengthening material. Since interfacial shear stree between base concrete and the FRP is a major variable in rip-off failure mode, it is carefully analyzed to derive the shear strengthening effect of FRP. The ultimate shear strength and failure mode of RC beams, using different strengthening methods, estimated in this predictional model is then compared with the result derived from destruction experiment of RC beams shear strengthened using FRP. To verify the accuracy and consistency of the analysis, the estimated results using the predictional model are compared with various other experimental results and data from previous publications. The result of this comparative analysis showed that the estimates from the predictional model are in consistency with the experimental results. Therefore, the proposed shear strength predictional model is found to predict with relative accuracy the shear strength and failure mode of RC beams shear strengthened by FRP regardless of strengthening method variable.

Lower bound on the Number of Rounds for Optimistic Multi-party Contract Signing Protocol (낙관적 다자간 계약서 서명 프로토콜 라운드의 하한)

  • Joo, Hong-Don;Chang, Jik-Hyun
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.32 no.10
    • /
    • pp.499-506
    • /
    • 2005
  • The growth of networks increase the importance of electronic commerces. Since the fair exchange protocol is an important part of electronic commerces, a number of researches have been done in relation to the fair exchange protocol. As the contract signing protocol is a part of fair exchange protocol, many protocols have been proposed, but most of them were focused on two-party protocol. Only a few were on the multi-party contract signing protocol. So far the optimistic multi-party contract signing protocol presented by Baum-Waidner has the least number of rounds in asynchronous network[4]. But, the lower bound on the number of rounds required by any optimistic multi-party contract signing protocol has been not known. In this paper, we present a tight lower bound on the number of rounds for optimistic multi-party contract signing protocol.

Some Calculated (p,α) Cross-Sections Using the Alpha Particle Knock-On and Triton Pick-Up Reaction Mechanisms: An Optimisation of the Single-Step Feshbache-Kermane-Koonin (FKK) Theory

  • Olise, Felix S.;Ajala, Afis;Olaniyi, Hezekiah B.
    • Nuclear Engineering and Technology
    • /
    • v.48 no.2
    • /
    • pp.482-494
    • /
    • 2016
  • The Feshbache-Kermane-Koonin (FKK) multi-step direct (MSD) theory of pre-equilibrium reactions has been used to compute the single-step cross-sections for some (p,${\alpha}$) reactions using the knock-on and pick-up reaction mechanisms at two incident proton energies. For the knock-on mechanism, the reaction was assumed to have taken place by the direct ejection of a preformed alpha cluster in a shell-model state of the target. But the reaction was assumed to have taken place by the pick-up of a preformed triton cluster (also bound in a shell-model state of the target core) by the incident proton for the pick-up mechanism. The Yukawa forms of potential were used for the proton-alpha (for the knock-on process) and proton-triton (for the pick-up process) interaction and several parameter sets for the proton and alpha-particle optical potentials. The calculated cross-sections for both mechanisms gave satisfactory fits to the experimental data. Furthermore, it has been shown that some combinations of the calculated distorted wave Born approximation cross-sections for the two reaction mechanisms in the FKK MSD theory are able to give better fits to the experimental data, especially in terms of range of agreement. In addition, the theory has been observed to be valid over a wider range of energy.

A Lower Bound Estimation on the number of LUT′s in Time-Multiplexed FPGA Synthesis (시분할 FPGA 합성에서 LUT 개수에 대한 하한 추정 기법)

  • Eom, Seong-Yong
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.29 no.7
    • /
    • pp.422-430
    • /
    • 2002
  • For a time-multiplexed FPGA, a circuit is partitioned into several subcircuits, so that they temporally share the same physical FPGA device by hardware reconfiguration. In these architectures, all the hardware reconfiguration information called contexts are generated and downloaded into the chip, and then the pre-scheduled context switches occur properly and timely. Since the maximum number of the LUT's required in the same time determines the size of the chip used in the synthesis, it needs to be minimized, if possible. Many previous work use their own approaches, which are very similar to either scheduling method in high level synthesis or multi-way circuit partitioning method, to solve the problem. In this paper, we propose a method which estimates the lower bound on the number of LUT's without performing any actual synthesis. The estimated lower bounds help to evaluate the results of the previous work. If the estimated lower bound on the number of LUT's exactly matches the number of LUT's of the result from the previous work, the result must be optimal. In contrast, if they do not match, the following two cases are expected : the more exact lower bound may exist, or we might find the new synthesis result better than the result from the previous work. Experimental results show that our lower bound estimation method is very accurate. In almost al] cases experimented, the estimated lower bounds on the number of LUT's exactly match those of the previous synthesis results respectively, implying that the best results from the previous work are optimal as well as our method predicted the exact lower bound for those examples.

Ultimate Shear Capacity of Prestressed Girder of Ultra High Performance Fiber Reinforced Concrete (초고강도 섬유보강 콘크리트 프리스트레스트 거더의 극한 전단력)

  • Han, Sang-Mook;Wu, Xiang-Guo
    • Journal of the Korean Society of Hazard Mitigation
    • /
    • v.8 no.2
    • /
    • pp.51-58
    • /
    • 2008
  • This study is to investigate the ultimate shear load of prestressed girder made of Ultra High Performance Fiber Reinforced Concrete (UHPFRC). Nine girders were tested until failure in shear. An analytical model to predict the ultimate shear load was formulated based on the Two Bounds Theory. A fiber reinforcing model was constituted based on the random assumption of steel fiber uniform distribution. The predicted values were compared with the conventional predictions and the test results. The proposed equations for computing the ultimate shear strength can be used for the ultimate failure status analysis, which could also be utilized for numerical limit analysis of prestressed UHPFRC girder. The established fiber reinforcing theoretical model can also be a reference for micro-mechanics analysis of UHPFRC.