• Title/Summary/Keyword: Intelligent machine

Search Result 1,068, Processing Time 0.025 seconds

Decomposition of T-generalized State Machines

  • 조성진;김재겸;김석태
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.6 no.4
    • /
    • pp.27-33
    • /
    • 1996
  • In this paper we introduce the notions of T-generalized state machines and primary submachines of T-generalized state machines and obtain a decomposition theorem for T-generalized state machine in terms of primary submachines.

  • PDF

ON TL-FINITE STATE MACHINES

  • Kim, Jae-Gyeom;Cho, Sung-Jin
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1995.10b
    • /
    • pp.78-81
    • /
    • 1995
  • In this paper we introduce the notions of a TL-finite state machine, TL-retrievability, TL-separability, TL-connectivity and discuss their basic properties.

  • PDF

Dynamic ATC Computation for Real-Time Power Markets

  • Venkaiah, Ch.;Kumar, D.M. Vinod;Murali, K.
    • Journal of Electrical Engineering and Technology
    • /
    • v.5 no.2
    • /
    • pp.209-219
    • /
    • 2010
  • In this paper, a novel dynamic available transfer capability (DATC) has been computed for real time applications using three different intelligent techniques viz. i) back propagation algorithm (BPA), ii) radial basis function (RBF), and iii) adaptive neuro fuzzy inference system (ANFIS) for the first time. The conventional method of DATC is tedious and time consuming. DATC is concerned with calculating the maximum increase in point to point transfer such that the transient response remains stable and viable. The ATC information is to be continuously updated in real time and made available to market participants through an internet based Open Access Same time Information System (OASIS). The independent system operator (ISO) evaluates the transaction in real time on the basis of DATC information. The dynamic contingency screening method [1] has been utilized and critical contingencies are selected for the computation of DATC using the energy function based potential energy boundary surface (PEBS) method. The PEBS based DATC has been utilized to generate patterns for the intelligent techniques. The three different intelligent methods are tested on New England 68-bus 16 machine and 39-bus 10 machine systems and results are compared with the conventional PEBS method.

Cascaded-Hop For DeepFake Videos Detection

  • Zhang, Dengyong;Wu, Pengjie;Li, Feng;Zhu, Wenjie;Sheng, Victor S.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.5
    • /
    • pp.1671-1686
    • /
    • 2022
  • Face manipulation tools represented by Deepfake have threatened the security of people's biological identity information. Particularly, manipulation tools with deep learning technology have brought great challenges to Deepfake detection. There are many solutions for Deepfake detection based on traditional machine learning and advanced deep learning. However, those solutions of detectors almost have problems of poor performance when evaluated on different quality datasets. In this paper, for the sake of making high-quality Deepfake datasets, we provide a preprocessing method based on the image pixel matrix feature to eliminate similar images and the residual channel attention network (RCAN) to resize the scale of images. Significantly, we also describe a Deepfake detector named Cascaded-Hop which is based on the PixelHop++ system and the successive subspace learning (SSL) model. By feeding the preprocessed datasets, Cascaded-Hop achieves a good classification result on different manipulation types and multiple quality datasets. According to the experiment on FaceForensics++ and Celeb-DF, the AUC (area under curve) results of our proposed methods are comparable to the state-of-the-art models.

Some Observations for Portfolio Management Applications of Modern Machine Learning Methods

  • Park, Jooyoung;Heo, Seongman;Kim, Taehwan;Park, Jeongho;Kim, Jaein;Park, Kyungwook
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.16 no.1
    • /
    • pp.44-51
    • /
    • 2016
  • Recently, artificial intelligence has reached the level of top information technologies that will have significant influence over many aspects of our future lifestyles. In particular, in the fields of machine learning technologies for classification and decision-making, there have been a lot of research efforts for solving estimation and control problems that appear in the various kinds of portfolio management problems via data-driven approaches. Note that these modern data-driven approaches, which try to find solutions to the problems based on relevant empirical data rather than mathematical analyses, are useful particularly in practical application domains. In this paper, we consider some applications of modern data-driven machine learning methods for portfolio management problems. More precisely, we apply a simplified version of the sparse Gaussian process (GP) classification method for classifying users' sensitivity with respect to financial risk, and then present two portfolio management issues in which the GP application results can be useful. Experimental results show that the GP applications work well in handling simulated data sets.

Investigations on Dynamic Trading Strategy Utilizing Stochastic Optimal Control and Machine Learning (확률론적 최적제어와 기계학습을 이용한 동적 트레이딩 전략에 관한 고찰)

  • Park, Jooyoung;Yang, Dongsu;Park, Kyungwook
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.23 no.4
    • /
    • pp.348-353
    • /
    • 2013
  • Recently, control theory including stochastic optimal control and various machine-learning-based artificial intelligence methods have become major tools in the field of financial engineering. In this paper, we briefly review some recent papers utilizing stochastic optimal control theory in the fields of the pair trading for mean-reverting markets and the trend-following strategy, and consider a couple of strategies utilizing both stochastic optimal control theory and machine learning methods to acquire more flexible and accessible tools. Illustrative simulations show that the considered strategies can yield encouraging results when applied to a set of real financial market data.

A Differential Evolution based Support Vector Clustering (차분진화 기반의 Support Vector Clustering)

  • Jun, Sung-Hae
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.17 no.5
    • /
    • pp.679-683
    • /
    • 2007
  • Statistical learning theory by Vapnik consists of support vector machine(SVM), support vector regression(SVR), and support vector clustering(SVC) for classification, regression, and clustering respectively. In this algorithms, SVC is good clustering algorithm using support vectors based on Gaussian kernel function. But, similar to SVM and SVR, SVC needs to determine kernel parameters and regularization constant optimally. In general, the parameters have been determined by the arts of researchers and grid search which is demanded computing time heavily. In this paper, we propose a differential evolution based SVC(DESVC) which combines differential evolution into SVC for efficient selection of kernel parameters and regularization constant. To verify improved performance of our DESVC, we make experiments using the data sets from UCI machine learning repository and simulation.

Design of Robust Support Vector Machine Using Genetic Algorithm (유전자 알고리즘을 이용한 강인한 Support vector machine 설계)

  • Lee, Hee-Sung;Hong, Sung-Jun;Lee, Byung-Yun;Kim, Eun-Tai
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.20 no.3
    • /
    • pp.375-379
    • /
    • 2010
  • The support vector machine (SVM) has been widely used in variety pattern recognition problems applicable to recommendation systems due to its strong theoretical foundation and excellent empirical successes. However, SVM is sensitive to the presence of outliers since outlier points can have the largest margin loss and play a critical role in determining the decision hyperplane. For robust SVM, we limit the maximum value of margin loss which includes the non-convex optimization problem. Therefore, we proposed the design method of robust SVM using genetic algorithm (GA) which can solve the non-convex optimization problem. To demonstrate the performance of the proposed method, we perform experiments on various databases selected in UCI repository.

Machine Learning Data Analysis for Tool Wear Prediction in Core Multi Process Machining (코어 다중가공에서 공구마모 예측을 위한 기계학습 데이터 분석)

  • Choi, Sujin;Lee, Dongju;Hwang, Seungkuk
    • Journal of the Korean Society of Manufacturing Process Engineers
    • /
    • v.20 no.9
    • /
    • pp.90-96
    • /
    • 2021
  • As real-time data of factories can be collected using various sensors, the adaptation of intelligent unmanned processing systems is spreading via the establishment of smart factories. In intelligent unmanned processing systems, data are collected in real time using sensors. The equipment is controlled by predicting future situations using the collected data. Particularly, a technology for the prediction of tool wear and for determining the exact timing of tool replacement is needed to prevent defected or unprocessed products due to tool breakage or tool wear. Directly measuring the tool wear in real time is difficult during the cutting process in milling. Therefore, tool wear should be predicted indirectly by analyzing the cutting load of the main spindle, current, vibration, noise, etc. In this study, data from the current and acceleration sensors; displacement data along the X, Y, and Z axes; tool wear value, and shape change data observed using Newroview were collected from the high-speed, two-edge, flat-end mill machining process of SKD11 steel. The support vector machine technique (machine learning technique) was applied to predict the amount of tool wear using the aforementioned data. Additionally, the prediction accuracies of all kernels were compared.