• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.10
• /
• pp.3588-3607
• /
• 2021

Covid-19 pandemic required all the world to use internet more actively. As a result, individuals and businesses are more open to digital threats. In order to provide security within the network, firewalls should be used. Firewalls act as a gateway between the corporate and the external networks. Therefore, it is more important than ever to choose the right firewall for each network. In this study, a new linear decision making model is proposed in order to find out the most suitable firewall and the estimates are completed according to this new model. Also, this model is compared with multi-objective optimization on the basis of ratio analysis (MOORA) method. This study distinguishes from other studies by proposing a new solution which ranks the firewall alternatives using linear and MOORA approaches. These approaches are used in many fields before but not in information technologies. Thus, this study can be considered quite innovative in terms of the problem it handles and the approaches used. It offers up-to-date and practical suggestions related to a decision making problem that has not been previously studied in the literature.

• International Journal of Computer Science & Network Security
• /
• v.24 no.4
• /
• pp.44-50
• /
• 2024

This paper offers an overview of matrix formation and calculation techniques within the framework of General Linear Models (GLMs). It takes a sequential approach, beginning with a detailed exploration of matrix formation and calculation methods in regression analysis and univariate analysis of variance (ANOVA). Subsequently, it extends the discussion to cover multivariate analysis of variance (MANOVA). The primary objective of this study was to provide a clear and accessible explanation of the underlying matrices that play a crucial role in GLMs. Through linking, essentially different statistical methods, by fundamental principles and algebraic foundations that underpin the GLM estimation. Insights presented here aim to assist researchers, statisticians, and data analysts in enhancing their understanding of GLMs and their practical implementation in diverse research domains. This paper contributes to a better comprehension of the matrix-based techniques that can be extended to GLMs.

• The Journal of the Korea Contents Association
• /
• v.5 no.6
• /
• pp.41-48
• /
• 2005

This paper presents a face recognition method based on the combination of well-known statistical representations of Principal Component Analysis(PCA), and Linear Discriminant Analysis(LDA) with Radial Basis Function Networks. The original face image is first processed by PCA to reduce the dimension, and thereby avoid the singularity of the within-class scatter matrix in LDA calculation. The result of PCA process is applied to LDA classifier. In the second approach, the LDA process Produce a discriminational features of the face image, which is taken as the input of the Radial Basis Function Network(RBFN). The proposed approaches has been tested on the ORL face database. The experimental results have been demonstrated, and the recognition rate of more than 93.5% has been achieved.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.7 no.1
• /
• pp.91-96
• /
• 2012

Recently, the research of security and its related problems has been received great interested. The research for hper-chaos systems and its synchronization are actively processing as one of method to apply to secure and cryptography communication. In this paper, we propose the synchronization method by coupling coefficient of linear and nonlinear in order to accomplish the synchronization of hyper-chaos system that organized by SC-CNN(State-Controlled Cellular Neural Network). We also verify and confirm the result of synchronization between entire transmitter and receiver, and each subsystem in transmitter and receiver through the phase portrait and difference of time-series by the computer simulation.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.9
• /
• pp.3056-3074
• /
• 2014

Convergecast is probably the most common communication style in wireless sensor networks (WSNs). And linear network coding (LNC) is a promising concept to improve throughput or reliability of convergecast. Most of the existing works have mainly focused on exploiting these benefits without considering its potential adverse effect. In this paper, we argue that LNC may not always benefit convergecast. This viewpoint is discussed within four basic scenarios: LNC-aided and none-LNC convergecast schemes with and without automatic repeat request (ARQ) mechanisms. The most concerned performance metrics, including packet collection rate, energy consumption, energy consumption balance and end-to-end delay, are investigated. Theoretical analyses and simulation results show that the way LNC operates, i.e., conscious overhearing and the prerequisite of successfully decoding, could naturally diminish its advantages in convergecast. And LNC-aided convergecast schemes may even be inferior to none-LNC ones when the wireless link delivery ratio is high enough. The conclusion drawn in this paper casts a new light on how to effectively apply LNC to practical WSNs.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.19 no.39
• /
• pp.47-61
• /
• 1996

We propose a parallel neural network model in which patterns are clustered and patterns in a cluster are studied in a parallel neural network. The learning algorithm used in this paper is based on LVQ algorithm of Kohonen(1990) for clustering and ADALINE(Adaptive Linear Neuron) network of Widrow and Hoff(1990) for parallel learning. The proposed algorithm consists of two parts. First, N patterns to be learned are categorized into C clusters by LVQ clustering algorithm. Second, C patterns that was selected from each cluster of C are learned as input pattern of ADALINE(Adaptive Linear Neuron). Data used in this paper consists of 250 patterns of ASCII characters normalized into $8\times16$ and 1124. The proposed algorithm consists of two parts. First, N patterns to be learned are categorized into C clusters by LVQ clustering algorithm. Second, C patterns that was selected from each cluster of C are learned as input pattern of ADALINE(Adaptive Linear Neuron). Data used in this paper consists 250 patterns of ASCII characters normalized into $8\times16$ and 1124 samples acquired from signals generated from 9 car models that passed Inductive Loop Detector(ILD) at 10 points. In ASCII character experiment, 191(179) out of 250 patterns are recognized with 3%(5%) noise and with 1124 car model data. 807 car models were recognized showing 71.8% recognition ratio. This result is 10.2% improvement over backpropagation algorithm.

• Korean Journal of Construction Engineering and Management
• /
• v.12 no.1
• /
• pp.23-32
• /
• 2011

Domestic leading construction companies has been establishing and performing TACT scheduling method, similar to linear scheduling model such as line of balance and repetitive schedule, and etc. in which repetitive construction works are involved like high-rise building. Linear scheduling model has been researched as a visual scheduling method presenting the work space and time information. Likewise scheduling constraints of CPM network such as finish-to-finish, start-to-start, finish-to-start, start-to-start, linear scheduling model also has the relationships constraints, namely boundary conditions, between activities. It is especially necessary to define the boundary conditions of the activities' relationships in order to apply the linear scheduling model to be compatible with the network schedule. Therefore, this research considers the boundary conditions between activities for establishing the linear scheduling model. This paper also applies the proposed boundary conditions to TACT schedule and then deduces the main considerations in order to establish and perform TACT schedule.

• International Journal of Control, Automation, and Systems
• /
• v.6 no.6
• /
• pp.915-927
• /
• 2008

Networked control systems(NCSs) have gained increasing attention in recent years due to their advantages and potential applications. The network Quality-of-Service(QoS) in NCSs always fluctuates due to changes of the traffic load and available network resources. To handle the network QoS variations problem, this paper presents an intelligent scheduling control method for NCSs, where the sampling period and the control parameters are simultaneously scheduled to compensate the effect of QoS variation on NCSs performance. For NCSs with network-induced delays and packet dropouts, a discrete-time switch model is proposed. By defining a sampling-period-dependent Lyapunov function and a common quadratic Lyapunov function, the stability conditions are derived for NCSs in terms of linear matrix inequalities(LMIs). Based on the obtained stability conditions, the corresponding controller design problem is solved and the performance optimization problem is also investigated. Simulation results are given to demonstrate the effectiveness of the proposed approaches.

• Korean Management Science Review
• /
• v.15 no.1
• /
• pp.1-12
• /
• 1998

This paper discusses a new algorithm, the PAPANET (Pivot And Probe Algorithm for NETwork optimization), for solving linear, capacitated linear network flow problem (NPs), PAPANET is a variation and specialization of the Pivot And Probe Algorithm (PAPA) developed by Sethi and Thompson, published in 1983-1984. PAPANET first solves an initial relaxed NP (RNP) with all the nodes from the original problem and a limited set of arcs (possibly all the artificial and slack arcs). From the arcs not considered in the current relaxation, we PROBE to identify candidate arcs that violate the current solution's dual constraints maximally. Candidate arcs are added to the RNP, and this new RNP is solved to optimality. This candidate pricing procedure and pivoting continue until all the candidate arcs price unfavorably and all of the dual constraints corresponding to the other, so-called noncandidate arcs, are satisfied. The implementation of PAPANET requires significantly fewer arcs and less solution CPU time than is required by the standard network simplex method implementation upon which it is based. Computational tests on randomly generated NPs indicate that our PAPANET implementation requires up to 40-50% fewer pivots and 30-40% less solution CPU time than is required by the comparable standard network simplex implementation from which it is derived.

• Journal of information and communication convergence engineering
• /
• v.7 no.2
• /
• pp.119-124
• /
• 2009

In this paper, we propose a novel approach to estimating the real-time moving trajectory of an object is proposed in this paper. The object's position is obtained from the image data of a CCD camera, while a state estimator predicts the linear and angular velocities of the moving object. To overcome the uncertainties and noises residing in the input data, a Extended Kalman Filter(EKF) and neural networks are utilized cooperatively. Since the EKF needs to approximate a nonlinear system into a linear model in order to estimate the states, there still exist errors as well as uncertainties. To resolve this problem, in this approach the Kohonen networks, which have a high adaptability to the memory of the input-output relationship, are utilized for the nonlinear region. In addition to this, the Kohonen network, as a sort of neural network, can effectively adapt to the dynamic variations and become robust against noises. This approach is derived from the observation that the Kohonen network is a type of self-organized map and is spatially oriented, which makes it suitable for determining the trajectories of moving objects. The superiority of the proposed algorithm compared with the EKF is demonstrated through real experiments.