• Title/Summary/Keyword: Corresponding rate

Search Result 1,606, Processing Time 0.026 seconds

LOCAL CONVERGENCE THEOREMS FOR NEWTON METHODS

  • Argyros, Ioannis K.
    • Journal of applied mathematics & informatics
    • /
    • v.8 no.2
    • /
    • pp.345-360
    • /
    • 2001
  • Affine invariant sufficient conditions are given for two local convergence theorems involving inexact Newton-like methods. The first uses conditions on the first Frechet-derivative whereas the second theorem employs hypotheses on the mth(m≥2 an integer). Radius of convergence as well as rate of convergence results are derived. Results involving superlinear convergence and known to be true for inexact Newton methods are extended here. Moreover, we show that under hypotheses on the mth Frechet-derivative our radius of convergence can sometimes be larger than the corresponding one in [10]. This allows a wider choice for the initial guess. A numerical example is also provided to show that our radius of convergence is larger than the one in [10].

Reliability Models for Redundant Systems Using Phase-type Distributions

  • Moon, Sinmyeong;Lie, Changhoon
    • Management Science and Financial Engineering
    • /
    • v.7 no.2
    • /
    • pp.73-90
    • /
    • 2001
  • This paper presents the reliability models for redundant systems composed of repairable components whose failure time and repair time distributions are phase-type. It is shown that the distribution of time to system failure is also phase-type. The dependency between components are considered and integrated into the model by the used of the rate adjustment factor. The phase-type representation is constructed for the system through algebraic operations on the parameters of components\` failure time and repair time distributions and the corresponding rate adjustment factors. Types of system structures considered are parallel, k-out-of-N system with load sharing scheme and standby system with operation priority.

  • PDF

Robust EOQ Models with Decreasing Cost Functions (감소하는 비용함수를 가진 Robust EOQ 모형)

  • Lim, Sung-Mook
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.32 no.2
    • /
    • pp.99-107
    • /
    • 2007
  • We consider (worst-case) robust optimization versions of the Economic Order Quantity (EOQ) model with decreasing cost functions. Two variants of the EOQ model are discussed, in which the purchasing costs are decreasing power functions in either the order quantity or demand rate. We develop the corresponding worst-case robust optimization models of the two variants, where the parameters in the purchasing cost function of each model are uncertain but known to lie in an ellipsoid. For the robust EOQ model with the purchasing cost being a decreasing function of the demand rate, we derive the analytical optimal solution. For the robust EOQ model with the purchasing cost being a decreasing function of the order quantity, we prove that it is a convex optimization problem, and thus lends itself to efficient numerical algorithms.

An efficient channel allocation for video transmission in OFDMA systems (OFDMA 시스템에서 비디오 전송을 위한 효율적인 채널 할당)

  • Lee, Sang-Jae;Kim, Se-Heon
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2007.11a
    • /
    • pp.325-329
    • /
    • 2007
  • The mobile and multimedia service on wireless network have been leaded from the improvement of telecommunication techniques. A typical multimedia service, a video transmission usually requires larger bandwidth than voice transmission. Many channel allocation algorithms for Orthogonal Frequency Division Multiple Access (OFBMA) to use resources more efficiently, Previous channel allocation algorithms have developed with an assumption that the data traffic is constant bit rate (CBR). However, existing algorithms are not suitable to video traffic because it usually generates a variable bit rate (VBR) traffic. In this paper, we proposed a new channel allocation algorithm called a queue-based channel allocation. it is more suitable to transmit the video traffics. Also, a problem are notified in case of realtime generated video traffic and a corresponding heuristic solution was proposed.

  • PDF

AFFINE INVARIANT LOCAL CONVERGENCE THEOREMS FOR INEXACT NEWTON-LIKE METHODS

  • Argyros, Ioannis K.
    • Journal of applied mathematics & informatics
    • /
    • v.6 no.2
    • /
    • pp.393-406
    • /
    • 1999
  • Affine invariant sufficient conditions are given for two local convergence theorems involving inexact Newton-like methods. The first uses conditions on the first Frechet-derivative whereas the second theorem employs hypotheses on the second. Radius of con-vergence as well as rate of convergence results are derived. Results involving superlinear convergence and known to be true for inexact Newton methods are extended here. Moreover we show that under hypotheses on the second Frechet-derivation our radius of convergence results are derived. Results involving superlinear convergence and known to be true or inexact Newton methods are extended here. Moreover we show that under hypotheses on the second Frechet-derivative our radius of conver-gence is larger than the corresponding one in [10]. This allows a wider choice for the initial guess. A numerical example is also pro-vided to show that our radius of convergence is larger then the one in [10].

Yeast Biomass Production from Concentrated Sugar Cane Stillage Using a Thermotolerant Candida rugosa

  • Lee, Ki-Young;Lee, Sung-Taek
    • Journal of Microbiology and Biotechnology
    • /
    • v.5 no.2
    • /
    • pp.114-116
    • /
    • 1995
  • Concentrated Brazillian sugar cane stillage was used as a substrate for the yeast biomass production using Candida rugosa isolated from East Africa. At the optimum stillage concentration of 10% dry matter, biomass production was 20.4 g/l and COD reduction rate was 41%. The specific growth rate of the yeast was 0.17 $h^{-1}$ and the corresponding productivity 0.91 g $l{-1} h^{-1}$ in the batch fermentation was observed at $40{\circ}^C$.

  • PDF

Throughput Based Study of UWB Receiver Modem Parameters

  • Choi, Byoung-Jo
    • Journal of information and communication convergence engineering
    • /
    • v.6 no.2
    • /
    • pp.158-163
    • /
    • 2008
  • The MB-OFDM based UWB communication system is a personal area network specification aiming to provide 480Mbps peak data rate over 528 MHz spectrum. As the corresponding baseband modem operates at high clock rate, its complexity should be optimized for low power consumption. A set of modem design parameters is suggested including the AD bit width, the clipping level and the quantization level at the Viterbi decoder input as well as the trace-back depth of the Viterbi decoder. The data throughput is used to evaluate the performance of the receiver and a recommended set of design parameter values is presented to aid efficient modem implementation.

Parallel Scrambling Techniques for SDH and ATM Transmissions (SDH와 ATM 전송을 위한 병렬혼화 기법)

  • 김석창;이병기
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.18 no.8
    • /
    • pp.1146-1158
    • /
    • 1993
  • In this paper, parallel scrambling techniques are considered for practical use in the SDH transmission and the ATM transmission. In the ATM transmission, there are two ways of transmitting ATM cells - the SDH-based and the cell-based - and the corresponding scrambling techniques differ accordingly. For the SDH transmission and the SDH-based ATM transmission, the FSS (frame synchronous scrambling) is applied to the STM frames : while for the cell-based ATM trans-mission, the DSS(distributed sample scrambling) is used on the ATM cell stream. The parallel scrambling techniques are examined for the FSS and the DSS, and applied to achieve the parallel FSSs for use in the SDH and the SDH-based ATM transmission along with the parallel DSS applicable to the cell-based ATM transmission. The resulting(8, 4) PSRG(parallel shift resister generator) and (8, 16) PSRG based parallel scramblings are directly applicable for the STM-1 rate processing of the STM-4 and STM-16 scramblings, respectively. Likewise, the resulting (1, 8)PSRG and double-sampling-double-correction based parallel scrambling techniques can be practically used for a low-rate processing of the SDH-based and the cell-based ATM signal scrambling respectively.

  • PDF

Parameter Recovery for LIDAR Data Calibration Using Natural Surfaces

  • Lee Impyeong;Moon Jiyoung;Kim Kyoung-ok
    • Proceedings of the KSRS Conference
    • /
    • 2004.10a
    • /
    • pp.642-645
    • /
    • 2004
  • This paper focuses on recovering systematic biases during LIDAR calibration, particularly using natural surfaces as control features. Many previous approaches have utilized all the points overlapping with the control features and often experienced with an inaccurate value converged with a poor rate due to wrong correspondence in pairing a point and the corresponding control features. To overcome these shortcomings, we establish a preventive scheme to select the pairs of high confidence, where the confidence value is based on the error budget associated with the point measurement and the linearity and roughness of the control feature. This approach was then applied to calibraring the LIDAR data simulated with the given systematic biases. The parameters were successfully recovered using the proposed approach with the accuracy and convergence rate superior to those using the previous approaches.

  • PDF

On a Reduced-Complexity Inner Decoder for the Davey-MacKay Construction

  • Jiao, Xiaopeng;Armand, M.A.
    • ETRI Journal
    • /
    • v.34 no.4
    • /
    • pp.637-640
    • /
    • 2012
  • The Davey-MacKay construction is a promising concatenated coding scheme involving an outer $2^k$-ary code and an inner code of rate k/n, for insertion-deletion-substitution channels. Recently, a lookup table (LUT)-based inner decoder for this coding scheme was proposed to reduce the computational complexity of the inner decoder, albeit at the expense of a slight degradation in word error rate (WER) performance. In this letter, we show that negligible deterioration in WER performance can be achieved with an LUT as small as $7{\cdot}2^{k+n-1}$, but no smaller, when the probability of receiving less than n-1 or greater than n+1 bits corresponding to one outer code symbol is at least an order of magnitude smaller than the WER when no LUT is used.