• 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 Institute of Control, Robotics and Systems
• /
• v.5 no.2
• /
• pp.174-179
• /
• 1999

In this paper, we propose an optimal algorithm for finding the shortest connection of two kinds of parts to pairs. If total part numbers are of size N, then there are order 2ㆍ(N/2)$^{N}$ possible solutions, of which we want the one that minimizes the energy function. The appropriate dynamic rule and parameters used in network are proposed by a new energy function which is minimized when 3-constraints are satisfied. This dynamic nile has three important parameters, an enhancement variable connected to pairs, a normalized distance term and a time variable. The enhancement variable connected to pairs have to a perfect connection of two kinds of parts to pairs. The normalized distance term get rids of a unstable states caused by the change of total part numbers. And the time variable removes the un-optimal connection in the case of distance constraint and the wrong or not connection of two kinds of parts to pairs. First of all, we review the theoretical basis for Hopfield model and present a new energy function. Then, the connection matrix and the offset bias created by a new energy function and used in dynamic nile are shown. Finally, we show examples through computer simulation with 20, 30 and 40 parts and discuss the stability and feasibility of the resultant solutions for the proposed connection algorithm.m.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.22 no.3
• /
• pp.11-22
• /
• 1997

The aim of this paper is to develop the B & B type algorithms for globally minimizing concave function under 0-1 knapsack constraint. The linear convex envelope underestimating the concave object function is introduced for the bounding operations which locate the vertices of the solution set. And the simplex containing the solution set is sequentially partitioned into the subsimplices over which the convex envelopes are calculated in the candidate problems. The adoption of cutting plane method enhances the efficiency of the algorithm. These mean valid inequalities with respect to the integer solution which eliminate the nonintegral points before the bounding operation. The implementations are effectively concretized in connection with the branching stategys.

• Journal of information and communication convergence engineering
• /
• v.5 no.1
• /
• pp.29-34
• /
• 2007

This paper proposes a MAC protocol for real-time VBR (rt-VBR) services in wireless ATM networks. The proposed protocol is characterized by a contention-based mechanism of the reservation request, a contention-free polling scheme for transferring the dynamic parameters, and a priority scheme of the slot allocation. The design objective of the proposed protocol is to guarantee the real-time constraint of rt-VBR traffic. The scheduling algorithm uses a priority scheme based on the maximum cell transfer delay parameter. The wireless terminal establishes an rt-VBR connection to the base station with a contention-based scheme. The base station scheduler allocates a dynamic parameter minislot to the wireless terminal for transferring the residual lifetime and the number of requesting slots as the dynamic parameters. Based on the received dynamic parameters, the scheduler allocates the uplink slots to the wireless terminal with the most stringent delay requirement. The simulation results show that the proposed protocol can guarantee the delay constraint of rt-VBR services along with its cell loss rate significantly reduced.

• Journal of the Society of Naval Architects of Korea
• /
• v.56 no.2
• /
• pp.152-160
• /
• 2019

In this study, we propose a piping material supply management method using CAD system. The piping materials installed in super large offshore plants have very complicated connection conditions. Therefore, it is very difficult to determine the order of receipt of a large number of installation materials. Therefore, we have developed a system that can automatically check the preparation rate of installation materials prior to the installation process. We have developed an algorithm to obtain connection information among installation items from PDMS system. We have developed an algorithm that can determine the order of installation materials to be installed using the connection information. The order of the installation material is determined by taking into account the constraint conditions for the complete installation of the piping material. We confirm the effectiveness of the developed algorithms in the operating system. This system is also used to manage installation schedules and plan the installation manpower.

• Journal of Electrical Engineering and information Science
• /
• v.3 no.1
• /
• pp.1-7
• /
• 1998

High-Level synthesis of digital circuits calls for automatic translation of a behavioral description to a structural design entity represented in terms of components and connection. One of the critical steps in high-level synthesis is to determine a particular scheduling algorithm that will assign behavioral operations to control states. A new scheduling algorithm called Data Availability Scheduling (DAS) for high-level synthesis is presented. It can determine an appropriate scheduling algorithm and minimize the number of states required using data availability and dependency conditions extracted from the behavioral code, taking into account of states required using data availability and dependency conditions extracted from the behavioral code, taking into account resource constraint in each control state. The DAS algorithm is efficient because data availability conditions, and conditional and wait statements break the behavioral code into manageable pieces which are analyzed independently. The output is the number of states in a finite state machine and shows better results than those of previous algorithms.

• Journal of Communications and Networks
• /
• v.9 no.2
• /
• pp.198-209
• /
• 2007

This paper provides a thorough study on shared segment protection (SSP) for mesh communication networks in the complete routing information scenario, where the integer linear program (ILP) in [1] is extended such that the following two constraints are well addressed: (a) The restoration time constraint for each connection request, and (b) the switching/merging capacity constraint at each node. A novel approach, called SSP algorithm, is developed to reduce the extremely high computation complexity in solving the ILP formulation. Basically, our approach is to derive a good approximation on the parameters in the ILP by referring to the result of solving the corresponding shared path protection (SPP) problem. Thus, the design space can be significantly reduced by eliminating some edges in the graphs. We will show in the simulation that with our approach, the optimality can be achieved in most of the cases. To verify the proposed formulation and investigate the performance impairment in terms of average cost and success rate by the additional two constraints, extensive simulation work has been conducted on three network topologies, in which SPP and shared link protection (SLP) are implemented for comparison. We will demonstrate that the proposed SSP algorithm can effectively and efficiently solve the survivable routing problem with constraints on restoration time and switching/merging capability of each node. The comparison among the three protection types further verifies that SSP can yield significant advantages over SPP and SLP without taking much computation time.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.23 no.3
• /
• pp.331-340
• /
• 2010

The basic theory and application of new adaptive finite element algorithm have been proposed in this study including the adaptive hp-refinement strategy, and the effective method for constructing hp-approximation. The hp-adaptive finite element concept needs the integrals of Legendre shape function, nonuniform p-distribution, and suitable constraint of continuity in conjunction with irregular node connection. The continuity of hp-adaptive mesh is an important problem at the common boundary of element interface. To solve this problem, the constraint of continuity has been enforced at the common boundary using the connectivity mapping matrix. The effective method for constructing of the proposed algorithm has been developed by using hierarchical nature of the integrals of Legendre shape function. To verify the proposed algorithm, the problem of simple cantilever beam has been solved by the conventional h-refinement and p-refinement as well as the proposed hp-refinement. The result obtained by hp-refinement approach shows more rapid convergence rate than those by h-refinement and p-refinement schemes. It it noted that the proposed algorithm may be implemented efficiently in practice.

• Journal of Korean Society of Steel Construction
• /
• v.18 no.6
• /
• pp.707-716
• /
• 2006

The optimization of the direct design system of semi-rigid steel frames using advanced analysis and genetic algorithm was presented. Advanced analysis can predict the combined nonlinear effects of connection, geometry, and material on the behavior and strength of semi-rigid frames. Geometric nonlinearity was determined using stability functions. On the other hand, material nonlinearity was determined using the Column Research Council (CRC) tangent modulus and parabolic function. The Kishi-Chen power model was used to describe the nonlinear behavior of semi-rigid connections. The genetic algorithm was used as the optimization technique. The objective function was assumed as the weight of the steel frame, with the constraint functions accounting for load-carrying capacities, deflections, inter-story drifts and ductility requirement. Member sizes determined by the proposed method were compared with those derived using the conventional method.

• ETRI Journal
• /
• v.31 no.1
• /
• pp.21-30
• /
• 2009

In low bit-rate video transmission, the payload of a single packet can often contain a whole coded frame due to the high compression ratio in both spatial and temporal domains of most modern video coders. Thus, the loss of a single packet not only causes the loss of a whole frame, but also produces error propagation into subsequent frames. In this paper, we propose a novel whole frame error concealment algorithm which reconstructs the first of the subsequent frames instead of the current lost frame to suppress the effects of error propagation. In the proposed algorithm, we impose a constraint which uses side match distortion (SMD) and overlapped region difference (ORD) to estimate motion vectors between the target reconstructed frame and its reference frame. SMD measures the spatial smoothness connection between a block and its neighboring blocks. ORD is defined as the difference between the correlated pixels which are predicted from one reference pixel. Experimental results show that the proposed algorithm effectively suppresses error propagation and significantly outperforms other conventional techniques in terms of both peak signal-to-noise ratio performance and subjective visual quality.