• The Journal of Industrial Distribution & Business
• /
• v.8 no.1
• /
• pp.5-13
• /
• 2017

Purpose - In this article, a dynamic model like a VAR is an appropriate choice for estimating the possible interrelationship between ownership structure and firm performance as a dynamic process. Research design, data, and methodology - Data of this work are collected from Chinese stock exchange including 350 Chinese-listed firms during the period of 1999-2012. We hypothesize that this interrelationship dynamically exists between ownership structure and firm performance. To examine the correlation, a panel Vector Auto-regression (PVAR) approach generated by GMM method is utilized to test the possible dynamic relation embedded in corporate governance. Another two dynamic analysis solutions such as orthogonalized impulse-response function and variance decomposition are also used simultaneously. Results - Findings of this study indicate the evidence that dynamically endogenous relationship exists between ownership structure and firm performance. Further, there is a dynamical correlation between investment and performance. Impulse response and variance decomposition illustrate that impact of a shock to variables themselves is the main source for their variability. Conclusions - The conclusion in this study is that there is a bidirectional and inter-temporal effect between proportion of ownership and corporate performance for a long run in accordance with impulse response function. Overall, our results suggest that corporate governance in China is more market oriented.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.1B
• /
• pp.27-32
• /
• 2003

This paper presents the Genetic Algorithm based Task Scheduling (GATS) method for the scheduling of programs with diverse embedded parallelism types in Distributed Parallel Systems, which consist of a set of loosely coupled parallel and vector machines connected via high speed networks The distributed parallel processing tries to solve computationally intensive problems that have several types of parallelism, on a suite of high performance and parallel machines in a manner that best utilizes the capabilities of each machine. When scheduling in distributed parallel systems, the matching of the parallelism characteristics between tasks and parallel machines rather than load balancing should be carefully handled with the minimization of communication cost in order to obtain more speedup. This paper proposes the based initialization methods for an initial population and the knowledge-based mutation methods to accommodate the parallelism type matching in genetic algorithms.

• Smart Structures and Systems
• /
• v.4 no.6
• /
• pp.759-777
• /
• 2008

A wireless sensing system is designed for application to structural monitoring and damage detection applications. Embedded in the wireless monitoring module is a two-tier prediction model, the auto-regressive (AR) and the autoregressive model with exogenous inputs (ARX), used to obtain damage sensitive features of a structure. To validate the performance of the proposed wireless monitoring and damage detection system, two near full scale single-story RC-frames, with and without brick wall system, are instrumented with the wireless monitoring system for real time damage detection during shaking table tests. White noise and seismic ground motion records are applied to the base of the structure using a shaking table. Pattern classification methods are then adopted to classify the structure as damaged or undamaged using time series coefficients as entities of a damage-sensitive feature vector. The demonstration of the damage detection methodology is shown to be capable of identifying damage using a wireless structural monitoring system. The accuracy and sensitivity of the MEMS-based wireless sensors employed are also verified through comparison to data recorded using a traditional wired monitoring system.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.8
• /
• pp.2101-2123
• /
• 2023

Recent studies have shown that the neural network-based binary code similarity detection technology performs well in vulnerability mining, plagiarism detection, and malicious code analysis. However, existing cross-architecture methods still suffer from insufficient feature characterization and low discrimination accuracy. To address these issues, this paper proposes a cross-architecture binary function similarity detection method based on composite feature model (SDCFM). Firstly, the binary function is converted into vector representation according to the proposed composite feature model, which is composed of instruction statistical features, control flow graph structural features, and application program interface calling behavioral features. Then, the composite features are embedded by the proposed hierarchical embedding network based on a graph neural network. In which, the block-level features and the function-level features are processed separately and finally fused into the embedding. In addition, to make the trained model more accurate and stable, our method utilizes the embeddings of predecessor nodes to modify the node embedding in the iterative updating process of the graph neural network. To assess the effectiveness of composite feature model, we contrast SDCFM with the state of art method on benchmark datasets. The experimental results show that SDCFM has good performance both on the area under the curve in the binary function similarity detection task and the vulnerable candidate function ranking in vulnerability search task.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.40 no.9
• /
• pp.597-604
• /
• 2016

A parallel algorithm of bi-conjugate gradient method was developed based on CUDA for parallel computation of the incompressible Navier-Stokes equations. The governing equations were discretized using splitting P2P1 finite element method. Asymmetric stenotic flow problem was solved to validate the proposed algorithm, and then the parallel performance of the GPU was examined by measuring the elapsed times. Further, the GPU performance for sparse matrix-vector multiplication was also investigated with a matrix of fluid-structure interaction problem. A kernel was generated to simultaneously compute the inner product of each row of sparse matrix and a vector. In addition, the kernel was optimized to improve the performance by using both parallel reduction and memory coalescing. In the kernel construction, the effect of warp on the parallel performance of the present CUDA was also examined. The present GPU computation was more than 7 times faster than the single CPU by double precision.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.37 no.1
• /
• pp.1-10
• /
• 2000

In this paper, a new digital watermarking algorithm using wavelet transform is proposed. Wavelet transform is widely used for image processing, because of its multiresolution characteristic which conforms to the principles of the human visual system(HVS). It is also very efficient for localizing images in the spatial and frequency domain. Since wavelet coefficients can be characterized by the gaussian distribution, the proposed algorithm uses a gaussian distributed random vector as the watermark in order to achieve invisibility and robustness. After the original image is transformed using DWT(Discrete Wavelet Transform), the coefficients of all subbands including LL subband are utilized to equally embed the watermark to the whole image. To select perceptually significant coefficients for each subband, we use level-adaptive thresholding. The watermark is embedded to the selected coeffocoents, using different scale factors according to the wavelet characteristics. In the process of watermark detection, the similarity between the original watermark and the extracted watermark is calculated by using vector projection method. We analyze the performance of the proposed algorithm, compared with other transform-domain watermarking methods. The experimental results tested on various images show that the proposed watermark is less visible to human eyes and more robust to image compressions, image processings, geometric transformations and various noises, than the existing methods.

• Information Systems Review
• /
• v.22 no.4
• /
• pp.21-39
• /
• 2020

Recently, deep learning has shown high performance in various applications such as pattern analysis and image classification. Especially known as a difficult task in the field of machine learning research, stock market forecasting is an area where the effectiveness of deep learning techniques is being verified by many researchers. This study proposed a deep learning Convolutional Neural Network (CNN) model to predict the direction of stock prices. We then used the feature selection method to improve the performance of the model. We compared the performance of machine learning classifiers against CNN. The classifiers used in this study are as follows: Logistic Regression, Decision Tree, Neural Network, Support Vector Machine, Adaboost, Bagging, and Random Forest. The results of this study confirmed that the CNN showed higher performancecompared with other classifiers in the case of feature selection. The results show that the CNN model effectively predicted the stock price direction by analyzing the embedded values of the financial data

• Journal of KIISE:Software and Applications
• /
• v.27 no.2
• /
• pp.108-119
• /
• 2000

Most of prior works on testing parallel programs have concentrated on how to guarantee the reproducibility by employing event traces exercised during executions of a program. Consequently, little work has been done to generate meaningful event sequences, especially, from specifications. This paper describes techniques for deriving event sequences from Message Sequence Charts(MSCs) which are widely used in telecommunication areas for its simplicity in specifying the behaviors of a program. For deriving event sequences from MSCs, we have to uncover the causality relations among events embedded implicitly in MSCs. In order to attain this goal, we adapt vector time stamping which has been previously used to determine the ordering of events taken place during an execution of interacting processes. Then, valid event sequences, satisfying the causality relations, are generated according to the interleaving rules suggested in this paper. The feasibility of our testing technique was investigated using the phone conversation example. In addition, we discussed on the experimental results gained from the example and how to combine various test criteria into our testing environment.

• KIPS Transactions on Software and Data Engineering
• /
• v.5 no.1
• /
• pp.43-50
• /
• 2016

This paper introduces an appearance-based facial expression recognition method using ASM landmarks which is used to acquire a detailed face region. In particular, EHMM-based algorithm and SVM classifier with histogram feature are employed to appearance-based facial expression recognition, and performance evaluation of proposed method was performed with CK and JAFFE facial expression database. In addition, performance comparison was achieved through comparison with distance-based face normalization method and a geometric feature-based facial expression approach which employed geometrical features of ASM landmarks and SVM algorithm. As a result, the proposed method using ASM-based face normalization showed performance improvements of 6.39% and 7.98% compared to previous distance-based face normalization method for CK database and JAFFE database, respectively. Also, the proposed method showed higher performance compared to geometric feature-based facial expression approach, and we confirmed an effectiveness of proposed method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.9C
• /
• pp.712-719
• /
• 2008

Temporal error concealment indicates the algorithm that restores the lost video data using temporal correlation between previous frame and current frame with lost data. It can be categorized into the methods of block-based and pixel-based concealment. The proposed method in this paper is for pixel-based temporal error concealment using affine transform. It outperforms especially when the object or background in lost block has geometric transform which can be modeled using affine transform, that is, rotation, magnification, reduction, etc. Furthermore, in order to maintain good performance even though one or more motion vector represents the motion of different objects, we defines a cost function. According to cost from the cost function, the proposed method adopts affine error concealment adaptively. Simulation results show that the proposed method yields better performance up to 1.9 dB than the method embedded in reference software of H.264/AVC.