• Title/Summary/Keyword: Dynamic weights

Search Result 228, Processing Time 0.022 seconds

Analysis of Influence Parameters to Evaluate the Effective Depth of Improvement of Dynamic Compaction Method (동다짐 공법의 유효다짐깊이 결정에 영향을 주는 인자 분석)

  • Kim, Hong-Taek;Lee, Hyuk-Jin;Park, Inn-Joon
    • Proceedings of the Korean Geotechical Society Conference
    • /
    • 2004.03b
    • /
    • pp.659-666
    • /
    • 2004
  • Dynamic compaction has evolved as an acceptable method of site improvement by treating poor soils in situ. The method is often an economical alternative for utilizing shallow foundations and preparing subgrades for construction when compared with conventional solutions. In general, the installation purpose of dynamic compaction are to increase bearing capacity and decrease differential settlement within a specified depth of improvement. This method involves the s systematically dropping large weights onto the ground surface to compact the underlying ground. The weights used on dynamic compaction projects have been typically constructed of steel plates, sand or concrete filled steel shells, and reinforced concrete. Typically, weights range from 5-20 ton and base configurations are, circular or octagonal. In this study, the effective depth of improvement is evaluated based on the numerical analysis code, the dynamic analysis of FLAC-3D program, in order to analyze the influence parameters ; ground conditions, maximum applied load and the area of compaction plate.

  • PDF

A Strategy of Dynamic Inference for a Knowledge-Based System with Fuzzy Production Rules (퍼지규칙으로 구성된 지식기반시스템에서 동적 추론전략)

  • 송수섭
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.25 no.4
    • /
    • pp.81-95
    • /
    • 2000
  • A knowledge-based system with fuzzy production rules is a representation of static knowledge of an expert. On the other hand, a real system such as the stock market is dynamic in nature. Therefore we need a strategy to reflect the dynamic nature of real system when we make inferences with a knowledge-based system. This paper proposes a strategy of dynamic inferencing for a knowledge-based system with fuzzy production rules. The strategy suggested in this paper applies weights of attributes of conditions of a rule in the knowledge-base. A degree of match(DM) between actual input information and a condition of a rule is represented by a value [0,1]. Weights of relative importance of attributes in a rule are obtained by AHP(Analytic Hierarcy Process) method. Then these weights are applied as exponents for the DM, and the DMs in a rule are combined, with MIN operator, into a single DM for the rule. In this way, overall DM for a rule changes depending on the importance of attributes of the rule. As a result, the dynamic nature of a real system can be incorporated in an inference with fuzzy production rules.

  • PDF

Identification of Nonlinear Systems based on Dynamic Recurrent Neural Networks (동적 귀환 신경망에 의한 비선형 시스템의 동정)

  • 이상환;김대준;심귀보
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1997.10a
    • /
    • pp.413-416
    • /
    • 1997
  • Recently, dynamic recurrent neural networks(DRNN) for identification of nonlinear dynamic systems have been researched extensively. In general, dynamic backpropagation was used to adjust the weights of neural networks. But, this method requires many complex calculations and has the possibility of falling into a local minimum. So, we propose a new approach to identify nonlinear dynamic systems using DRNN. In order to adjust the weights of neurons, we use evolution strategies, which is a method used to solve an optimal problem having many local minimums. DRNN trained by evolution strategies with mutation as the main operator can act as a plant emulator. And the fitness function of evolution strategies is based on the difference of the plant's outputs and DRNN's outputs. Thus, this new approach at identifying nonlinear dynamic system, when applied to the simulation of a two-link robot manipulator, demonstrates the performance and efficiency of this proposed approach.

  • PDF

A Study on Dynamic Inference for a Knowlege-Based System iwht Fuzzy Production Rules

  • Song, Soo-Sup
    • Journal of the military operations research society of Korea
    • /
    • v.26 no.2
    • /
    • pp.55-74
    • /
    • 2000
  • A knowledge-based with production rules is a representation of static knowledge of an expert. On the other hand, a real system such as the stock market is dynamic in nature. Therefore we need a method to reflect the dynamic nature of a system when we make inferences with a knowledge-based system. This paper suggests a strategy of dynamic inference that can be used to take into account the dynamic behavior of decision-making with the knowledge-based system consisted of fuzzy production rules. A degree of match(DM) between actual input information and a condition of a rule is represented by a value [0,1]. Weights of relative importance of attributes in a rule are obtained by the AHP(Analytic Hierarchy Process) method. Then these weights are applied as exponents for the DM, and the DMs in a rule are combined, with the Min operator, into a single DM for the rule. In this way, the importance of attributes of a rule, which can be changed from time to time, can be reflected in an inference with fuzzy production systems.

  • PDF

Efficient Dynamic Weighted Frequent Pattern Mining by using a Prefix-Tree (Prefix-트리를 이용한 동적 가중치 빈발 패턴 탐색 기법)

  • Jeong, Byeong-Soo;Farhan, Ahmed
    • The KIPS Transactions:PartD
    • /
    • v.17D no.4
    • /
    • pp.253-258
    • /
    • 2010
  • Traditional frequent pattern mining considers equal profit/weight value of every item. Weighted Frequent Pattern (WFP) mining becomes an important research issue in data mining and knowledge discovery by considering different weights for different items. Existing algorithms in this area are based on fixed weight. But in our real world scenarios the price/weight/importance of a pattern may vary frequently due to some unavoidable situations. Tracking these dynamic changes is very necessary in different application area such as retail market basket data analysis and web click stream management. In this paper, we propose a novel concept of dynamic weight and an algorithm DWFPM (dynamic weighted frequent pattern mining). Our algorithm can handle the situation where price/weight of a pattern may vary dynamically. It scans the database exactly once and also eligible for real time data processing. To our knowledge, this is the first research work to mine weighted frequent patterns using dynamic weights. Extensive performance analyses show that our algorithm is very efficient and scalable for WFP mining using dynamic weights.

Acceleration Sensor Based Measurement and Noise Reduction of Dynamic Weights (가속도 센서에 기반한 동하중의 측정 및 잡음 감소)

  • Na, Seung-You;Shin, Dae-Jung
    • Journal of Sensor Science and Technology
    • /
    • v.13 no.1
    • /
    • pp.1-11
    • /
    • 2004
  • Due to various types of errors added to dynamic weight measurement data, proper methods to reduce measurement errors are required to produce reliable weights. To cope with parasitic types of errors in real systems, information provided by the various sensors is utilized and combined in such a way to reduce the measurement errors of load cells. In addition to four channels of load cells from a trailer, an accelerometer is used to obtain the information to compensate the error induced from vertical movement of the vehicle due to the variation of ground level. A model trailer system is run to verify the effectiveness of the proposed method to reduce noise of dynamic weight measurements. Experiments show that the processed error magnitudes of less than 20 g can be obtained for 10 Kg experimental loads.

A Novel Dynamic Optimization Technique for Finding Optimal Trust Weights in Cloud

  • Prasad, Aluri V.H. Sai;Rajkumar, Ganapavarapu V.S.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.6
    • /
    • pp.2060-2073
    • /
    • 2022
  • Cloud Computing permits users to access vast amounts of services of computing power in a virtualized environment. Providing secure services is essential. There are several problems to real-world optimization that are dynamic which means they tend to change over time. For these types of issues, the goal is not always to identify one optimum but to keep continuously adapting to the solution according to the change in the environment. The problem of scheduling in Cloud where new tasks keep coming over time is unique in terms of dynamic optimization problems. Until now, there has been a large majority of research made on the application of various Evolutionary Algorithms (EAs) to address the issues of dynamic optimization, with the focus on the maintenance of population diversity to ensure the flexibility for adapting to the changes in the environment. Generally, trust refers to the confidence or assurance in a set of entities that assure the security of data. In this work, a dynamic optimization technique is proposed to find an optimal trust weights in cloud during scheduling.

Learning an Artificial Neural Network Using Dynamic Particle Swarm Optimization-Backpropagation: Empirical Evaluation and Comparison

  • Devi, Swagatika;Jagadev, Alok Kumar;Patnaik, Srikanta
    • Journal of information and communication convergence engineering
    • /
    • v.13 no.2
    • /
    • pp.123-131
    • /
    • 2015
  • Training neural networks is a complex task with great importance in the field of supervised learning. In the training process, a set of input-output patterns is repeated to an artificial neural network (ANN). From those patterns weights of all the interconnections between neurons are adjusted until the specified input yields the desired output. In this paper, a new hybrid algorithm is proposed for global optimization of connection weights in an ANN. Dynamic swarms are shown to converge rapidly during the initial stages of a global search, but around the global optimum, the search process becomes very slow. In contrast, the gradient descent method can achieve faster convergence speed around the global optimum, and at the same time, the convergence accuracy can be relatively high. Therefore, the proposed hybrid algorithm combines the dynamic particle swarm optimization (DPSO) algorithm with the backpropagation (BP) algorithm, also referred to as the DPSO-BP algorithm, to train the weights of an ANN. In this paper, we intend to show the superiority (time performance and quality of solution) of the proposed hybrid algorithm (DPSO-BP) over other more standard algorithms in neural network training. The algorithms are compared using two different datasets, and the results are simulated.

A Study on Dynamic Asset Allocation Strategy for Optimal Portfolio Selection

  • Lee, Hojin
    • East Asian Economic Review
    • /
    • v.25 no.3
    • /
    • pp.310-336
    • /
    • 2021
  • We use iterative numerical procedures combined with analytical methods due to Rapach and Wohar (2009) to solve for the dynamic asset allocation strategy for optimal portfolio demand. We compare different optimal portfolio demands when investors in each country have different access to overseas and domestic investment opportunities. The optimal dynamic asset allocation strategy without foreign investment opportunities leads domestic investors in Korea, Hong Kong, and Singapore to allocate more funds to domestic bonds than to domestic stocks. However, the U.S. investors allocate more wealth to domestic stocks than to domestic bonds. Investors in all countries short bills at a low level of risk aversion. Next, we investigate dynamic asset allocation strategy when domestic investors in Korea have access to foreign markets. The optimal portfolio demand leads investors in Korea to allocate most resources to domestic bonds and foreign stocks. On the other hand, the portfolio weights on foreign bonds and domestic stocks are relatively low. We also analyze dynamic asset allocation strategy for the investors in the U.S., Hong Kong, and Singapore when they have access to the Korean markets as overseas investment opportunities. Compared to the results when the investors only have access to domestic markets, the investors in the U.S. and Singapore increase the portfolio weights on domestic stocks in spite of the overseas investment opportunities in the Korean markets. The investors in the U.S., Hong Kong, and Singapore short domestic bills to invest more than initial funds in risky assets with a varying degree of relative risk aversion coefficients without exception.

A New Ensemble System using Dynamic Weighting Method (동적 중요도 결정 방법을 이용한 새로운 앙상블 시스템)

  • Seo, Dong-Hun;Lee, Won-Don
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.15 no.6
    • /
    • pp.1213-1220
    • /
    • 2011
  • In this paper, a new ensemble system using dynamic weighting method with added weight information into classifiers is proposed. The weights used in the traditional ensemble system are those after the training phase. Once extracted, the weights in the traditional ensemble system remain fixed regardless of the test data set. One way to circumvent this problem in the gating networks is to update the weights dynamically by adding processes making architectural hierarchies, but it has the drawback of added processes. A simple method to update weights dynamically, without added processes, is proposed, which can be applied to the already established ensemble system without much of the architectural modification. Experiment shows that this method performs better than AdaBoost.