• Title/Summary/Keyword: Maximization

Search Result 1,103, Processing Time 0.026 seconds

Estimating System Reliability under Brown-Proschan Imperfect Repair with Covariates (공변량을 이용한 Brown-Proschan 불완전수리 하의 시스템 신뢰도 추정)

  • 임태진;이진승
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.23 no.4
    • /
    • pp.111-130
    • /
    • 1998
  • We propose an imperfect repair model which depends on external effects quantified by covariates. The model is based on the Brown-Proschan imperfect repair model wherefrom the probability of perfect repair is represented by a function of covariates. We are motivated by deficiency of the BP model whose stationarity prevents us from predicting dynamically the time to next failure according to external condition. Five types of function for the probability of perfect repair are proposed. This article also presents a procedure for estimating the parameter of the function for the probability of perfect repair, as well as the inherent lifetime distribution of the system, based on consecutive inter-failure times and the covariates. The estimation procedure is based on the expectation-maximization principle which is suitable to incomplete data problems. focusing on the maximization step, we derive some theorems which guarantee the existence of the solution. A Monte Carlo study is also performed to illustrate the prediction power of the model as well as to show reasonable properties of the estimates. The model reduces significantly the mean square error of the in-sample prediction. so it can be utilized in real fields for evaluating and maintaining repairable systems.

  • PDF

k-Fragility Maximization Problem to Attack Robust Terrorist Networks

  • Thornton, Jabre L.;Kim, Donghyun;Kwon, Sung-Sik;Li, Deying;Tokuta, Alade O.
    • Journal of information and communication convergence engineering
    • /
    • v.12 no.1
    • /
    • pp.33-38
    • /
    • 2014
  • This paper investigates the shaping operation problem introduced by Callahan et al., namely the k-fragility maximization problem (k-FMP), whose goal is to find a subset of personals within a terrorist group such that the regeneration capability of the residual group without the personals is minimized. To improve the impact of the shaping operation, the degree centrality of the residual graph needs to be maximized. In this paper, we propose a new greedy algorithm for k-FMP. We discover some interesting discrete properties and use this to design a more thorough greedy algorithm for k-FMP. Our simulation result shows that the proposed algorithm outperforms Callahan et al.'s algorithm in terms of maximizing degree centrality. While our algorithm incurs higher running time (factor of k), given that the applications of the problem is expected to allow sufficient amount of time for thorough computation and k is expected to be much smaller than the size of input graph in reality, our algorithm has a better merit in practice.

Blocking of Zeolite Pore by Loading Ni-Pt Nanoparticles for Maximization of Isomerization Selectivity

  • Bhavani, A. Geetha;Reddy, N. Subba
    • Korean Chemical Engineering Research
    • /
    • v.58 no.4
    • /
    • pp.658-664
    • /
    • 2020
  • Zeolite HY is wet impregnated with Ni (0.1, 0.3, 0.4, 0.5 wt%), Pt (0.1 wt%) and reduced in presence of hydrogen to form nanosized particles of Ni and Pt. All the catalysts were characterized by XRD, TEM, ESCA, NH3-TPD, Pyridine adsorbed FT-IR and BET. Characterization results confirm that the Ni and Pt fractions effectively rehabilitated the physio-chemical properties of the zeolite HY catalysts. Further, all the reduced catalyst were screened with hydroisomerization of m-xylene at LHSV = 2.0 h-1 in the temperature range 250-400 ℃ in steps of 50 ℃ in hydrogen atmosphere (20 ml/g). The addition of Ni to Pt catalyst increases hydroisomerization conversion, as well as maximizes p-xylene selectivity by restricting the pore size. The increasing trend in activity continues up to 0.3 wt% of Ni and 0.1 wt% Pt addition over zeolite HY. The increasing addition of Ni increases the total number of active metallic sites to exposed, which increases the metallic sites/acid sites ratio towards the optimum value for these reactions by better balance of synergic effect for stable activity. The rate of deactivation is pronounced on monometallic catalysts. The results confirm the threshold Ni addition is highly suitable for hydroisomerization reaction for product selectivity over Ni-Pt bimetallic/support catalysts.

An Optimal Power-Throughput Tradeoff Study for MIMO Fading Ad-Hoc Networks

  • Yousefi'zadeh, Homayoun;Jafarkhani, Hamid
    • Journal of Communications and Networks
    • /
    • v.12 no.4
    • /
    • pp.334-345
    • /
    • 2010
  • In this paper, we study optimal tradeoffs of achievable throughput versus consumed power in wireless ad-hoc networks formed by a collection of multiple antenna nodes. Relying on adaptive modulation and/or dynamic channel coding rate allocation techniques for multiple antenna systems, we examine the maximization of throughput under power constraints as well as the minimization of transmission power under throughput constraints. In our examination, we also consider the impacts of enforcing quality of service requirements expressed in the form of channel coding block loss constraints. In order to properly model temporally correlated loss observed in fading wireless channels, we propose the use of finite-state Markov chains. Details of fading statistics of signal-to-interference-noise ratio, an important indicator of transmission quality, are presented. Further, we objectively inspect complexity versus accuracy tradeoff of solving our proposed optimization problems at a global as oppose to a local topology level. Our numerical simulations profile and compare the performance of a variety of scenarios for a number of sample network topologies.

A Efficient Image Separation Scheme Using ICA with New Fast EM algorithm

  • Oh, Bum-Jin;Kim, Sung-Soo;Kang, Jee-Hye
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.14 no.5
    • /
    • pp.623-629
    • /
    • 2004
  • In this paper, a Efficient method for the mixed image separation is presented using independent component analysis and the new fast expectation-maximization(EM) algorithm. In general, the independent component analysis (ICA) is one of the widely used statistical signal processing scheme in various applications. However, it has been known that ICA does not establish good performance in source separation by itself. So, Innovation process which is one of the methods that were employed in image separation using ICA, which produces improved the mixed image separation. Unfortunately, the innovation process needs long processing time compared with ICA or EM. Thus, in order to overcome this limitation, we proposed new method which combined ICA with the New fast EM algorithm instead of using the innovation process. Proposed method improves the performance and reduces the total processing time for the Image separation. We compared our proposed method with ICA combined with innovation process. The experimental results show the effectiveness of the proposed method by applying it to image separation problems.

Resource Allocation Algorithm Based on Simultaneous Wireless Information and Power Transfer for OFDM Relay Networks

  • Xie, Zhenwei;Zhu, Qi;Zhao, Su
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.12
    • /
    • pp.5943-5962
    • /
    • 2017
  • A resource allocation algorithm based on simultaneous wireless information and power transfer (SWIPT) to maximize the system throughput is proposed in orthogonal frequency division multiplexing (OFDM) relay networks. The algorithm formulates the problem under the peak power constraints of the source and each subcarrier (SC), and the energy causality constraint of the relay. With the given SC allocation of the source, we give and prove the optimal propositions of the formulated problem. Then, the formulated problem could be decomposed into two separate throughput maximization sub-problems by setting the total power to transfer energy. Finally, several SC allocation schemes are proposed, which are energy priority scheme, information priority scheme, balanced allocation scheme and exhaustive scheme. The simulation results reveal that the energy priority scheme can significantly reduce computational complexity and achieve approximate performance with the exhaustive scheme.

Maximum-likelihood Estimation of Radar Cross Section of a Swerling III Target (Swerling III 표적 RCS의 최대공산추정)

  • Jung, Young-Hun;Hong, Sun-Mog
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.54 no.3
    • /
    • pp.87-93
    • /
    • 2017
  • A maximum likelihood (ML) approach is presented for estimating the mean of radar cross section (RCS) of a Swerling III target and its numerical solution methods are discussed. The solution methods are based on an approximate expression for implementing the expectation maximization (EM) algorithm. The methods are evaluated and compared through Monte Carlo simulations in terms of estimation accuracy and computational efficiency to obtain a most efficient method for both Swerling I and Swerling III targets. The methods are also compared with a previously reported method based on heuristics.

Estimation and Analysis of MIMO Channel Parameters using the SAGE Algorithm (SAGE 알고리즘을 이용한 MIMO 채널 파라미터 추정과 분석)

  • Kim, Joo-Seok;Yeo, Bong-Gu;Choi, Hong-Rak;Kim, Kyung-Seok
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.17 no.5
    • /
    • pp.79-84
    • /
    • 2017
  • This paper is a multi-input multi-path (Multiple-input multiple-output: MIMO) using a space-alternating generalized expectation maximization(SAGE) algorithm in the parameter channel and determine the channel estimation performance. Estimated by the algorithm, SAGE time-varying channel environment, the channel parameters estimated from the parameters of the channel measured in the island region 781 of the band in order to compare the performance and compares the original data. This allows you to check the performance of the algorithm SAGE and is highly stable to delay spread (Delay Spread), the diffusion angle of arrival (Arrive of Angular Spread) performance in terms of accuracy down through the SAGE algorithm for estimating a more general calculation parameters.

Optimization of Air Quality Monitoring Networks in Busan Using a GIS-based Decision Support System (GIS기반 의사결정지원시스템을 이용한 부산 대기질 측정망의 최적화)

  • Yoo, Eun-Chul;Park, Ok-Hyun
    • Journal of Korean Society for Atmospheric Environment
    • /
    • v.23 no.5
    • /
    • pp.526-538
    • /
    • 2007
  • Since air quality monitoring data sets are important base for developing of air quality management strategies including policy making and policy performance assessment, the environmental protection authorities need to organize and operate monitoring network properly. Air quality monitoring network of Busan, consisting of 18 stations, was allocated under unscientific and irrational principles. Thus the current state of air quality monitoring networks was reassessed the effect and appropriateness of monitoring objectives such as population protection and sources surveillance. In the process of the reassessment, a GIS-based decision support system was constructed and used to simulate air quality over complex terrain and to conduct optimization analysis for air quality monitoring network with multi-objective. The maximization of protection capability for population appears to be the most effective and principal objective among various objectives. The relocation of current monitoring stations through optimization analysis of multi-objective appears to be better than the network building for maximization of population protection capability. The decision support system developed in this study on the basis of GIS-based database appear to be useful for the environmental protection authorities to plan and manage air quality monitoring network over complex terrain.

Gaussian Processes for Source Separation: Pseudo-likelihood Maximization (유사-가능도 최대화를 통한 가우시안 프로세스 기반 음원분리)

  • Park, Sun-Ho;Choi, Seung-Jin
    • Journal of KIISE:Software and Applications
    • /
    • v.35 no.7
    • /
    • pp.417-423
    • /
    • 2008
  • In this paper we present a probabilistic method for source separation in the case here each source has a certain temporal structure. We tackle the problem of source separation by maximum pseudo-likelihood estimation, representing the latent function which characterizes the temporal structure of each source by a random process with a Gaussian prior. The resulting pseudo-likelihood of the data is Gaussian, determined by a mixing matrix as well as by the predictive mean and covariance matrix that can easily be computed by Gaussian process (GP) regression. Gradient-based optimization is applied to estimate the demixing matrix through maximizing the log-pseudo-likelihood of the data. umerical experiments confirm the useful behavior of our method, compared to existing source separation methods.