• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.11 no.4
• /
• pp.305-309
• /
• 2011

A sparse reconfigurable adaptive filter (SRAF) based on a photonic switch determines the appropriate time delays and weight values for an optical switch implementation of tapped-delay-line (TDL) systems. It is well known that the choice of switch delays is significantly important for efficiently implementing the SRAF. If the same values exist as calculating the sum of weight magnitudes for implementing the connection constraint required by the SRAF, conventional connection algorithm based on sequentially selection the maximum elements might not work perfectly. In an effort to increase the effectiveness of system identification, an upgraded connection algorithm used progressive calculation to obtain the better solution is considered in this paper. The performance of the proposed connection constraint algorithm is illustrated by computer simulation for a system identification application.

• Journal of information and communication convergence engineering
• /
• v.12 no.3
• /
• pp.140-144
• /
• 2014

A general linearly constrained adaptive array is examined in the weight vector space to illustrate the array performance with respect to the gain factor. A narrowband linear adaptive array is implemented in a coherent signal environment. It is shown that the gain factor in the general linearly constrained adaptive array has an effect on the linear constraint gain of the conventional linearly constrained adaptive array. It is observed that a variation of the gain factor of the general linearly constrained adaptive array results in a variation of the distance between the constraint plane and the origin in the translated weight vector space. Simulation results are shown to demonstrate the effect of the gain factor on the nulling performance.

• Journal of information and communication convergence engineering
• /
• v.15 no.3
• /
• pp.137-142
• /
• 2017

A general linearly constrained narrowband adaptive array is examined in the eigenvector space. The optimum weight vector in the eigenvector space is shown to have the same performance as in the standard coordinate system, except that the input signal correlation matrix and look direction steering vector are replaced with the eigenvalue matrix and transformed steering vector. It is observed that the variation in gain factor results in the variation in the distance between the constraint plane and the origin in the translated weight vector space such that the increase in gain factor decreased the distance from the constraint plane to the origin, thus affecting the nulling performance. Simulation results showed that the general linearly constrained adaptive array performed better at an optimal gain factor compared with the conventional linearly constrained adaptive array in a coherent signal environment and the former showed similar performance as the latter in a noncoherent signal environment.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.51 no.10
• /
• pp.446-452
• /
• 2002

For most of pattern recognition applications, it is required to correctly recognize patterns even if they have translation variations. In this paper, to achieve the goal of translation invariant pattern recognition, we propose a new generalized translation invariant second-order neural network using a constraint on the weights. The weight constraint is implemented using generalized translation invariant features which are accumulated sums of pixel combinations. Simulation results will be given to demonstrate that the proposed second-order neural network has the generalized translation invariant property.

• Magazine of the Korean Society of Agricultural Engineers
• /
• v.37 no.E
• /
• pp.31-39
• /
• 1995

Weight minimization for the steel bridge girders using an approximation based optimization technique is presented. To accomplish this, an optimization oriented finite element program is used to achieve continuous weight reduction until the optimum is reached. To reduce computational cost, approximation techniques are adopted during the optimization process. Constraint deletion as well as intermediate design variables and responses are also used for higher qualitv of approximations and for a better convergence rate. Both the reliability and the effectiveness of the underlying optimization method are reviewed.

• Proceedings of the Korea Society for Simulation Conference
• /
• 2001.10a
• /
• pp.63-67
• /
• 2001

Since the transportation cost takes about two thirds of the logistics cost of Korean firms, significant reduction of business logistics cost can hardly be achieved without effectively reducing the transportation cost. Although consolidated transportation has been regarded as the most promising strategy for reducing the transportation cost, it has not been successful in practice. In this paper we consider a consolidated transportation for the factories located in a limited area such as industrial complexes, where loads of various volume and weight are consolidated. We want to group the loads to assign to a truck of various size such that the total transportation cost is minimized, while the maximum volume constraint and weight constraint of each truck are satisfied. We suggest four heuristic algorithms to efficiently determine the groups of loads; and conduct a computer simulation to evaluate the performances of the algorithms.

• Journal of Navigation and Port Research
• /
• v.27 no.4
• /
• pp.397-402
• /
• 2003

Generally, container arrangement has been carried out based on the Classification guidelines. However, guidelines provide only container securing forces for the given container arrangement and Classification requirements of the forces. In order to design container arrangement additional information is needed such as container securing forces and arrangement that accounts for lashing bridges, vertical lashing, vertical center of gravity (VCG), and maximum stack weight. Trial and error method using the existing guidelines requires excessive amount of calculation time and cannot provide accurate results of the calculations. In order to fulfill this need, a new container securing system has been established based on the equilibrium conditions that include lashing bridges and vertical lashing. An optimization algorithm has been developed for the new system since current optimization methods such as genetic algorithms and evolution strategies are unsuitable for the container securing problems, which involve equality constraint. Design variables are container weights of tier and objective function is either total container weight or VCG of a stack. The newly developed system provides optimum arrangement of containers for both maximum stack weight and maximum VCG. It also greatly reduces time for designing container arrangement.

• Proceedings of the KSME Conference
• /
• 2001.06a
• /
• pp.920-925
• /
• 2001

A study on the topology optimization of a multi-spectral camera for space-use is presented. A multi-spectral camera for space-use experiences degradation of optical image in the space, which can not be detected on the optical test bench on the earth. An optical surface deformation of a primary mirror, which is a principal component of the camera system, under the self-weight loading is an important factor affecting the optical performance of the whole camera system. In this study, topology optimization of the primary mirror of the camera is presented. Total mass of the primary mirror is given as a constraint to the optimization problem. The sensitivities of the objective function and constraint are calculated by direct differentiation method. Optimization procedure is carried out by an optimality criterion method using the sensitivities of the objective function and the constraint. As a preliminary example, topology optimization considering a self-weight loading is treated. For practical use, the polishing pressure is included as a loading in the topology optimization of the primary mirror. Results of the optimized design topology for the primary mirror with varying mass ratios are presented.

• ETRI Journal
• /
• v.27 no.6
• /
• pp.733-746
• /
• 2005

In the context of multi-protocol label switching (MPLS) traffic engineering, this paper proposes a scalable constraintbased shortest path first (CSPF) routing algorithm with multiple QoS metrics. This algorithm, called the multiple constraint-based shortest path first (M_CSPF) algorithm, provides an optimal route for setting up a label switched path (LSP) that meets bandwidth and end-to-end delay constraints. In order to maximize the LSP accommodation probability, we propose a link weight computation algorithm to assign the link weight while taking into account the future traffic load and link interference and adopting the concept of a critical link from the minimum interference routing algorithm. In addition, we propose a bounded order assignment algorithm (BOAA) that assigns the appropriate order to the node and link, taking into account the delay constraint and hop count. In particular, BOAA is designed to achieve fast LSP route computation by pruning any portion of the network topology that exceeds the end-to-end delay constraint in the process of traversing the network topology. To clarify the M_CSPF and the existing CSPF routing algorithms, this paper evaluates them from the perspectives of network resource utilization efficiency, end-to-end quality, LSP rejection probability, and LSP route computation performance under various network topologies and conditions.

• Journal of Sensor Science and Technology
• /
• v.28 no.2
• /
• pp.81-87
• /
• 2019

One of the major issues in inertial and magnetic measurement unit (IMMU)-based 3D orientation estimation is compensation for magnetic disturbances in magnetometer signals, as the magnetic disturbance is a major cause of inaccurate yaw estimation. In the proposed approach, a kinematic constraint is used to provide a measurement equation in addition to the accelerometer and magnetometer signals to mitigate the disturbance effect on the orientation estimation. Although a Kalman filter (KF) is the most popular framework for IMMU-based orientation estimation, a complementary filter (CF) has its own advantages over KF in terms of mathematical simplicity and ease of implementation. Accordingly, this paper introduces a quaternion-based CF with a constraint-combined correction equation. Furthermore, the weight of the constraint relative to the magnetometer signal is adjusted to adapt to magnetic environments to optimally deal with the magnetic disturbance. In the results of our validation experiments, the average and maximum of yaw errors were $1.17^{\circ}$ and $1.65^{\circ}$ from the proposed CF, respectively, and $8.88^{\circ}$ and $14.73^{\circ}$ from the conventional CF, respectively, showing the superiority of the proposed approach.