• Title/Summary/Keyword: Stochastic optimization

Search Result 386, Processing Time 0.035 seconds

Real-time implementation of the 2.4kbps EHSX Speech Coder Using a $TMS320C6701^TM$ DSPCore ($TMS320C6701^TM$을 이용한 2.4kbps EHSX 음성 부호화기의 실시간 구현)

  • 양용호;이인성;권오주
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.7C
    • /
    • pp.962-970
    • /
    • 2004
  • This paper presents an efficient implementation of the 2.4 kbps EHSX(Enhanced Harmonic Stochastic Excitation) speech coder on a TMS320C6701$^{TM}$ floating-point digital signal processor. The EHSX speech codec is based on a harmonic and CELP(Code Excited Linear Prediction) modeling of the excitation signal respectively according to the frame characteristic such as a voiced speech and an unvoiced speech. In this paper, we represent the optimization methods to reduce the complexity for real-time implementation. The complexity in the filtering of a CELP algorithm that is the main part for the EHSX algorithm complexity can be reduced by converting program using floating-point variable to program using fixed-point variable. We also present the efficient optimization methods including the code allocation considering a DSP architecture and the low complexity algorithm of harmonic/pitch search in encoder part. Finally, we obtained the subjective quality of MOS 3.28 from speech quality test using the PESQ(perceptual evaluation of speech quality), ITU-T Recommendation P.862 and could get a goal of realtime operation of the EHSX codec.c.

A Study on Objective Functions for the Multi-purpose Dam Operation Plan in Korea (국내 다목적댐 운영계획에 적합한 목적함수에 관한 연구)

  • Eum, Hyung-Il;Kim, Young-Oh;Yun, Ji-Hyun;Ko, Ick-Hwan
    • Journal of Korea Water Resources Association
    • /
    • v.38 no.9 s.158
    • /
    • pp.737-746
    • /
    • 2005
  • Optimization is a process that searches an optimal solution to obtain maximum or minimum value of an objective function. Many researchers have focused on effective search algorithms for the optimum but few researches were interested in establishing the objective function. This study compares two approaches for the objective function: one allows a tradeoff among the objectives and the other does not allow a tradeoff by assigning weights for the absolute priority between the objectives. An optimization model using sampling stochastic dynamic programming was applied to these two objective functions and the resulting optimal policies were compared. As a result, the objective function with no tradeoff provides a decision making process that matches practical reservoir operations than that with a tradeoff allowed. Therefore, it is more reasonable to establish the objective function with no a tradeoff among the objectives for multi-purpose dam operation plan in Korea.

Web-based Three-step Project Management Model and Its Software Development

  • Hwang Heung-Suk;Cho Gyu-Sung
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2006.05a
    • /
    • pp.373-378
    • /
    • 2006
  • Recently the technical advances and complexities have generated much of the difficulties in managing the project resources, for both scheduling and costing to accomplish the project in the most efficient manner. The project manager is frequently required to render judgments concerning the schedule and resource adjustments. This research develops an analytical model for a schedule-cost and risk analysis based on visual PERT/CPM. We used a three-step approach: 1) in the first step, a deterministic PERT/CPM model for the critical path and estimating the project time schedule and related resource planning and we developed a heuristic model for crash and stretch out analysis based upon a time-cost trade-off associated with the crash and stretch out of the project. 2) In second step, we developed web-based risk evaluation model for project analysis. Major technologies used for this step are AHP (analytic hierarchy process, fuzzy-AHP, multi-attribute analysis, stochastic network simulation, and web based decision support system. Also we have developed computer programs and have shown the results of sample runs for an R&D project risk analysis. 3) We developed an optimization model for project resource allocation. We used AHP weighted values and optimization methods. Computer implementation for this model is provided based on GUI-Type objective-oriented programming for the users and provided displays of all the inputs and outputs in the form of GUI-Type. The results of this research will provide the project managers with efficient management tools.

  • PDF

Optimal Design of Municipal Water Distribution System (관수로 시스템의 최적설계)

  • Ahn, Tae Jin;Park, Jung Eung
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.14 no.6
    • /
    • pp.1375-1383
    • /
    • 1994
  • The water distribution system problem consists of finding a minimum cost system design subject to hydraulic and operational constraints. Since the municipal water distribution system problem is nonconvex with multiple local minima, classical optimization methods find a local optimum. An outer flow search - inner optimization procedure is proposed for choosing a better local minimum for the water distribution systems. The pipe network is judiciously subjected to the outer search scheme which chooses alternative flow configurations to find an optimal flow division among pipes. Because the problem is nonconvex, a global search scheme called Stochastic Probing method is employed to permit a local optimum seeking method to migrate among various local minima. A local minimizer is employed for the design of least cost diameters for pipes in the network. The algorithm can also be employed for optimal design of parallel expansion of existing networks. In this paper one municipal water distribution system is considered. The optimal solutions thus found have significantly smaller costs than the ones reported previously by other researchers.

  • PDF

Reliability based optimization of spring fatigue design problems accounting for scatter of fatigue test data (피로시험 데이터의 산포를 고려한 스프링의 신뢰성 최적설계)

  • An, Da-Wn;Won, Jun-Ho;Choi, Joo-Ho
    • Proceedings of the KSME Conference
    • /
    • 2008.11a
    • /
    • pp.1314-1319
    • /
    • 2008
  • Fatigue reliability problems are nowadays actively considered in the design of mechanical components. Recently, Dimension Reduction Method using Kriging approximation (KDRM) was proposed by the authors to efficiently calculate statistical moments of the response function. This method, which is more tractable for its sensitivity-free nature and providing the response PDF in a few number of analyses, is adopted in this study for the reliability analysis. Before applying this method to the practical fatigue problems, accuracies are studied in terms of parameters of the KDRM through a number of numerical examples, from which best set of parameters are suggested. In the fatigue reliability problems, good number of experimental data are necessary to get the statistical distribution of the S-N parameters. The information, however, are not always available due to the limited expense and time. In this case, a family of curves with prediction interval, called P-S-N curve, is constructed from regression analysis. Using the KDRM, once a set of responses are available at the sample points at the mean, all the reliability analyses for each P-S-N curve can be efficiently studied without additional response evaluations. The method is applied to a spring design problem as an illustration of practical applications, in which reliability-based design optimization (RBDO) is conducted by employing stochastic response surface method which includes probabilistic constraints in itself. Resulting information is of great practical value and will be very helpful for making trade-off decision during the fatigue design.

  • PDF

Numerical evaluation of gamma radiation monitoring

  • Rezaei, Mohsen;Ashoor, Mansour;Sarkhosh, Leila
    • Nuclear Engineering and Technology
    • /
    • v.51 no.3
    • /
    • pp.807-817
    • /
    • 2019
  • Airborne Gamma Ray Spectrometry (AGRS) with its important applications such as gathering radiation information of ground surface, geochemistry measuring of the abundance of Potassium, Thorium and Uranium in outer earth layer, environmental and nuclear site surveillance has a key role in the field of nuclear science and human life. The Broyden-Fletcher-Goldfarb-Shanno (BFGS), with its advanced numerical unconstrained nonlinear optimization in collaboration with Artificial Neural Networks (ANNs) provides a noteworthy opportunity for modern AGRS. In this study a new AGRS system empowered by ANN-BFGS has been proposed and evaluated on available empirical AGRS data. To that effect different architectures of adaptive ANN-BFGS were implemented for a sort of published experimental AGRS outputs. The selected approach among of various training methods, with its low iteration cost and nondiagonal scaling allocation is a new powerful algorithm for AGRS data due to its inherent stochastic properties. Experiments were performed by different architectures and trainings, the selected scheme achieved the smallest number of epochs, the minimum Mean Square Error (MSE) and the maximum performance in compare with different types of optimization strategies and algorithms. The proposed method is capable to be implemented on a cost effective and minimum electronic equipment to present its real-time process, which will let it to be used on board a light Unmanned Aerial Vehicle (UAV). The advanced adaptation properties and models of neural network, the training of stochastic process and its implementation on DSP outstands an affordable, reliable and low cost AGRS design. The main outcome of the study shows this method increases the quality of curvature information of AGRS data while cost of the algorithm is reduced in each iteration so the proposed ANN-BFGS is a trustworthy appropriate model for Gamma-ray data reconstruction and analysis based on advanced novel artificial intelligence systems.

A Comparison of Admission Controls of Reservation Requests with Callable Products (임의상환가능 상품 도입하의 예약 요청 승인 방법 비교)

  • Lee, Haeng-Ju
    • Journal of Digital Convergence
    • /
    • v.17 no.9
    • /
    • pp.127-133
    • /
    • 2019
  • A callable product is one of service derivatives using options to generate demand and reduce risk. This paper compares two booking admission controls for callable products, the online and the batch admission controls. To this end, the paper computes the optimal booking policy by using the backward dynamic programming and the stochastic optimization method. Intuitively, the provider should outperform under the batch control by utilizing demand information. The contribution of the paper is to show that the two controls are equivalent in terms of the booking strategy and the expected profit, which enables the provider to keep its current control method. The paper develops the closed-form solutions for the three fare classes. The future work is to extend the result to the model with complicated fare structures.

Regularized Optimization of Collaborative Filtering for Recommander System based on Big Data (빅데이터 기반 추천시스템을 위한 협업필터링의 최적화 규제)

  • Park, In-Kyu;Choi, Gyoo-Seok
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.21 no.1
    • /
    • pp.87-92
    • /
    • 2021
  • Bias, variance, error and learning are important factors for performance in modeling a big data based recommendation system. The recommendation model in this system must reduce complexity while maintaining the explanatory diagram. In addition, the sparsity of the dataset and the prediction of the system are more likely to be inversely proportional to each other. Therefore, a product recommendation model has been proposed through learning the similarity between products by using a factorization method of the sparsity of the dataset. In this paper, the generalization ability of the model is improved by applying the max-norm regularization as an optimization method for the loss function of this model. The solution is to apply a stochastic projection gradient descent method that projects a gradient. The sparser data became, it was confirmed that the propsed regularization method was relatively effective compared to the existing method through lots of experiment.

Statistical Analysis of the Springback Scatter according to the Material Strength in the Sheet Metal Forming Process (판재성형공정에서의 소재 강도에 따른 스프링백 산포의 통계분석)

  • Son, Min-Kyu;Kim, Se-Ho
    • Journal of the Korea Convergence Society
    • /
    • v.13 no.4
    • /
    • pp.287-292
    • /
    • 2022
  • In this paper, the stochastic distribution of the springback amount is investigated for the stamping process of a U-channel shaped-product with ultra-high strength steel. Using the reliability-based design optimization technique (RBDO), stochastic distribution of process parameters is considered in the analysis including material properties and process variation. Quantification of the springback scatters is carried out with the statistical analysis method according to the material strength. It is found that the scattering amount of springback decreases while the amount of springback increases as the tensile strength of the blank material increases, which is investigated by analyzing the strain and stress distribution of the punch and die shoulder. It is noted that the proposed scheme is capable of predicting and responding to the unavoidable scattering of springback in the sheet metal forming process.

Predicting concrete's compressive strength through three hybrid swarm intelligent methods

  • Zhang Chengquan;Hamidreza Aghajanirefah;Kseniya I. Zykova;Hossein Moayedi;Binh Nguyen Le
    • Computers and Concrete
    • /
    • v.32 no.2
    • /
    • pp.149-163
    • /
    • 2023
  • One of the main design parameters traditionally utilized in projects of geotechnical engineering is the uniaxial compressive strength. The present paper employed three artificial intelligence methods, i.e., the stochastic fractal search (SFS), the multi-verse optimization (MVO), and the vortex search algorithm (VSA), in order to determine the compressive strength of concrete (CSC). For the same reason, 1030 concrete specimens were subjected to compressive strength tests. According to the obtained laboratory results, the fly ash, cement, water, slag, coarse aggregates, fine aggregates, and SP were subjected to tests as the input parameters of the model in order to decide the optimum input configuration for the estimation of the compressive strength. The performance was evaluated by employing three criteria, i.e., the root mean square error (RMSE), mean absolute error (MAE), and the determination coefficient (R2). The evaluation of the error criteria and the determination coefficient obtained from the above three techniques indicates that the SFS-MLP technique outperformed the MVO-MLP and VSA-MLP methods. The developed artificial neural network models exhibit higher amounts of errors and lower correlation coefficients in comparison with other models. Nonetheless, the use of the stochastic fractal search algorithm has resulted in considerable enhancement in precision and accuracy of the evaluations conducted through the artificial neural network and has enhanced its performance. According to the results, the utilized SFS-MLP technique showed a better performance in the estimation of the compressive strength of concrete (R2=0.99932 and 0.99942, and RMSE=0.32611 and 0.24922). The novelty of our study is the use of a large dataset composed of 1030 entries and optimization of the learning scheme of the neural prediction model via a data distribution of a 20:80 testing-to-training ratio.