• Title/Summary/Keyword: (Max,+)-Linear Systems

Search Result 44, Processing Time 0.021 seconds

Nonlinear Characteristics of Fuzzy Inference Systems by Means of Individual Input Space (개별 입력 공간에 의한 퍼지 추론 시스템의 비선형 특성)

  • Park, Keon-Jun;Lee, Dong-Yoon
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.12 no.11
    • /
    • pp.5164-5171
    • /
    • 2011
  • In fuzzy modeling for nonlinear process, typically using the given data, the fuzzy rules are formed by the input variables and the space division by selecting the input variable and dividing the input space for each input variables. The premise part of the fuzzy rule is identified by selection of the input variables, the number of space division and membership functions and the consequent part of the fuzzy rule is identified by polynomial functions in the form of simplified and linear inference. In general, formation of fuzzy rules for nonlinear processes using the given data have the problem that the number of fuzzy rules exponentially increases. To solve this problem complex nonlinear process can be modeled by separately forming the fuzzy rules by means of fuzzy division of each input space. Therefore, this paper utilizes individual input space to generate fuzzy rules. The premise parameters of the fuzzy rules are identified by Min-Max method using the minimum and maximum values of input data set and membership functions are used as a series of triangular, gaussian-like, trapezoid-type membership functions. And lastly, using the data which is widely used in nonlinear process we evaluate the performance and the system characteristics.

Studies on Soybean Protein [Part ll]-Isolation and Subunit Composition of Multiple 7S Globulins- (대두(大豆) 단백질(蛋白質)에 관(關)한 연구(硏究) 제2보[第二報]-7S Globulin중의 복합단백질(複合蛋白質)의 분리(分離) 및 그 구성(構成) Subunit에 대하여)

  • Lee, C.Y.;Kim, I.S.;Kim, S.U.
    • Applied Biological Chemistry
    • /
    • v.20 no.1
    • /
    • pp.26-32
    • /
    • 1977
  • The multiple 7S globulins composed of two fractions (A and B) in the electrophoresis with Davis' method were isolated at different stages of the soybean seed development. Electrophoresis of their subunits liberated in PAWU solvent [phenol-acetic acid-water (2 : 1 : 1) solution plus 5M urea] yielded 4 major bands. Observation of both the electrophoretic bands of the multiple 7S fractions(7S-A and 7S-B) and those of their subunits was suggestive of a similarity of the subunit pattern between two 7S fractions. The two fractions in multiple 7S globulins were isolated with DEAE-Sephadex A-50 column$(2.0{\sim}100cm)$ chromatography. They were separated into 2 fractions in a linear gradient concentration of 0.28 to 0.40M NaCl with phosphate buffer (pH 7.8) containing 10mM ${\beta}-mercaptoethanol$(ME). The isolated protein was dissociated into subunits with two different solvent systems; in PAWU solvent and in Tris-HCl buffer(pH 8.0) containing 1% sodium dodecyl sulfate (SDS) and 40mM ME. The dissociated subunits were subjected to electrophoresis in PAWU-treated 7.5% acrylamide gel and in 1% SDS-treated 5.6% acrylamide gel. In PAWU gel electrophoresis, total 7S globulin was separated into 5 major bands, two of which were occupied in common by two 7S fractions(7S-A and 7S-B). In SDS gel electrophoresis, total 7S globulin was separated into 7 major bands, three of which were overlapped with the subunit of the two 7S fractions. The above results alluded us to the presence of a common and/or similar subunit between the multiple 7S globulins.

  • PDF

A Study on the Forest Yield Regulation by Systems Analysis (시스템분석(分析)에 의(依)한 삼림수확조절(森林收穫調節)에 관(關)한 연구(硏究))

  • Cho, Eung-hyouk
    • Korean Journal of Agricultural Science
    • /
    • v.4 no.2
    • /
    • pp.344-390
    • /
    • 1977
  • The purpose of this paper was to schedule optimum cutting strategy which could maximize the total yield under certain restrictions on periodic timber removals and harvest areas from an industrial forest, based on a linear programming technique. Sensitivity of the regulation model to variations in restrictions has also been analyzed to get information on the changes of total yield in the planning period. The regulation procedure has been made on the experimental forest of the Agricultural College of Seoul National University. The forest is composed of 219 cutting units, and characterized by younger age group which is very common in Korea. The planning period is devided into 10 cutting periods of five years each, and cutting is permissible only on the stands of age groups 5-9. It is also assumed in the study that the subsequent forests are established immediately after cutting existing forests, non-stocked forest lands are planted in first cutting period, and established forests are fully stocked until next harvest. All feasible cutting regimes have been defined to each unit depending on their age groups. Total yield (Vi, k) of each regime expected in the planning period has been projected using stand yield tables and forest inventory data, and the regime which gives highest Vi, k has been selected as a optimum cutting regime. After calculating periodic yields and cutting areas, and total yield from the optimum regimes selected without any restrictions, the upper and lower limits of periodic yields(Vj-max, Vj-min) and those of periodic cutting areas (Aj-max, Aj-min) have been decided. The optimum regimes under such restrictions have been selected by linear programming. The results of the study may be summarized as follows:- 1. The fluctuations of periodic harvest yields and areas under cutting regimes selected without restrictions were very great, because of irregular composition of age classes and growing stocks of existing stands. About 68.8 percent of total yield is expected in period 10, while none of yield in periods 6 and 7. 2. After inspection of the above solution, restricted optimum cutting regimes were obtained under the restrictions of Amin=150 ha, Amax=400ha, $Vmin=5,000m^3$ and $Vmax=50,000m^3$, using LP regulation model. As a result, about $50,000m^3$ of stable harvest yield per period and a relatively balanced age group distribution is expected from period 5. In this case, the loss in total yield was about 29 percent of that of unrestricted regimes. 3. Thinning schedule could be easily treated by the model presented in the study, and the thinnings made it possible to select optimum regimes which might be effective for smoothing the wood flows, not to speak of increasing total yield in the planning period. 4. It was known that the stronger the restrictions becomes in the optimum solution the earlier the period comes in which balanced harvest yields and age group distribution can be formed. There was also a tendency in this particular case that the periodic yields were strongly affected by constraints, and the fluctuations of harvest areas depended upon the amount of periodic yields. 5. Because the total yield was decreased at the increasing rate with imposing stronger restrictions, the Joss would be very great where strict sustained yield and normal age group distribution are required in the earlier periods. 6. Total yield under the same restrictions in a period was increased by lowering the felling age and extending the range of cutting age groups. Therefore, it seemed to be advantageous for producing maximum timber yield to adopt wider range of cutting age groups with the lower limit at which the smallest utilization size of timber could be produced. 7. The LP regulation model presented in the study seemed to be useful in the Korean situation from the following point of view: (1) The model can provide forest managers with the solution of where, when, and how much to cut in order to best fulfill the owners objective. (2) Planning is visualized as a continuous process where new strateges are automatically evolved as changes in the forest environment are recognized. (3) The cost (measured as decrease in total yield) of imposing restrictions can be easily evaluated. (4) Thinning schedule can be treated without difficulty. (5) The model can be applied to irregular forests. (6) Traditional regulation methods can be rainforced by the model.

  • PDF

A Time Series Graph based Convolutional Neural Network Model for Effective Input Variable Pattern Learning : Application to the Prediction of Stock Market (효과적인 입력변수 패턴 학습을 위한 시계열 그래프 기반 합성곱 신경망 모형: 주식시장 예측에의 응용)

  • Lee, Mo-Se;Ahn, Hyunchul
    • Journal of Intelligence and Information Systems
    • /
    • v.24 no.1
    • /
    • pp.167-181
    • /
    • 2018
  • Over the past decade, deep learning has been in spotlight among various machine learning algorithms. In particular, CNN(Convolutional Neural Network), which is known as the effective solution for recognizing and classifying images or voices, has been popularly applied to classification and prediction problems. In this study, we investigate the way to apply CNN in business problem solving. Specifically, this study propose to apply CNN to stock market prediction, one of the most challenging tasks in the machine learning research. As mentioned, CNN has strength in interpreting images. Thus, the model proposed in this study adopts CNN as the binary classifier that predicts stock market direction (upward or downward) by using time series graphs as its inputs. That is, our proposal is to build a machine learning algorithm that mimics an experts called 'technical analysts' who examine the graph of past price movement, and predict future financial price movements. Our proposed model named 'CNN-FG(Convolutional Neural Network using Fluctuation Graph)' consists of five steps. In the first step, it divides the dataset into the intervals of 5 days. And then, it creates time series graphs for the divided dataset in step 2. The size of the image in which the graph is drawn is $40(pixels){\times}40(pixels)$, and the graph of each independent variable was drawn using different colors. In step 3, the model converts the images into the matrices. Each image is converted into the combination of three matrices in order to express the value of the color using R(red), G(green), and B(blue) scale. In the next step, it splits the dataset of the graph images into training and validation datasets. We used 80% of the total dataset as the training dataset, and the remaining 20% as the validation dataset. And then, CNN classifiers are trained using the images of training dataset in the final step. Regarding the parameters of CNN-FG, we adopted two convolution filters ($5{\times}5{\times}6$ and $5{\times}5{\times}9$) in the convolution layer. In the pooling layer, $2{\times}2$ max pooling filter was used. The numbers of the nodes in two hidden layers were set to, respectively, 900 and 32, and the number of the nodes in the output layer was set to 2(one is for the prediction of upward trend, and the other one is for downward trend). Activation functions for the convolution layer and the hidden layer were set to ReLU(Rectified Linear Unit), and one for the output layer set to Softmax function. To validate our model - CNN-FG, we applied it to the prediction of KOSPI200 for 2,026 days in eight years (from 2009 to 2016). To match the proportions of the two groups in the independent variable (i.e. tomorrow's stock market movement), we selected 1,950 samples by applying random sampling. Finally, we built the training dataset using 80% of the total dataset (1,560 samples), and the validation dataset using 20% (390 samples). The dependent variables of the experimental dataset included twelve technical indicators popularly been used in the previous studies. They include Stochastic %K, Stochastic %D, Momentum, ROC(rate of change), LW %R(Larry William's %R), A/D oscillator(accumulation/distribution oscillator), OSCP(price oscillator), CCI(commodity channel index), and so on. To confirm the superiority of CNN-FG, we compared its prediction accuracy with the ones of other classification models. Experimental results showed that CNN-FG outperforms LOGIT(logistic regression), ANN(artificial neural network), and SVM(support vector machine) with the statistical significance. These empirical results imply that converting time series business data into graphs and building CNN-based classification models using these graphs can be effective from the perspective of prediction accuracy. Thus, this paper sheds a light on how to apply deep learning techniques to the domain of business problem solving.