• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.10 no.7
• /
• pp.1549-1555
• /
• 2009

The Relay node placement problem is one of the most important requirements for many wireless sensor networks because the lifetime of sensor networks is closely related with the placement of relay nodes which receive sensed data from sensor nodes and forward them to the base station. Relay node placement problem has focused at minimization of dissipated total energy of the sensor nodes in whole networks. However, minimum total energy causes the unbalance of consumed energy in sensor nodes due to different distances between relay nodes and sensor nodes. This paper proposes the concept of energy balance ratio and finds the locations of relay nodes using objective functions which maximize the energy balance ratio. Maximizing this ratio results in maximizing the network lifetime by minimizing the energy consumption of large-scale sensor networks. However, finding a solution to relay node placement problem is NP-hard and it is very difficult to get exact solutions. Therefore, we get approximate solutions to EBR-RNP problem which considers both energy balance ratio and relay node placement using constraint programming.

• Journal of KIISE
• /
• v.42 no.7
• /
• pp.852-859
• /
• 2015

As the amount of knowledge information significantly increases, a lot of progress has been made in the studies focusing on how to reason large scale ontology effectively at the level of RDFS or OWL. These reasoning methods are divided into TBox classifications and ABox realizations. A TBox classification mainly deals with integrity and dependencies in schema, whereas an ABox realization mainly handles a variety of issues in instances. Therefore, the ABox realization is very important in practical applications. In this paper, we propose a realization method for analyzing the constraint of the specified class, so that the reasoning system automatically infers the classes to which instances belong. Unlike conventional methods that take advantage of the object oriented language based distributed file system, we propose a large scale ontology reasoning method using spark, which is a functional programming-based in-memory system. To verify the effectiveness of the proposed method, we used instances created from the Wine ontology by W3C(120 to 600 million triples). The proposed system processed the largest 600 million triples and generated 951 million triples in 51 minutes (696 K triple / sec) in our largest experiment.

• Korean Journal of Construction Engineering and Management
• /
• v.23 no.4
• /
• pp.65-77
• /
• 2022

Schedule management is one of pivotal project success factors during construction projects. However, there are many difficulties in rapid scheduling and controlling since the existing planning techniques require considerable amount of manual work and manager's judgment in a construction project. This research aims to propose a new scheduling method and algorithm for automating and visualizing the planning process, which is called Countable-grid scheduling method. In this method, if the scope of work is defined via a visualized tool, the schedule plan is created automatically according to the productivity and workable conditions of each activity. The location of the work for each date can be visualized in grid-based approach. Moreover, the work schedule can be updated automatically according to the progress. The industrial applicability of the proposed method was verified in construction projects via case study with sample data. This research can contribute to the construction industry by automating the construction schedule management process.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.22 no.3
• /
• pp.374-380
• /
• 2021

Band Wittgenstein is a relatively band-shaped team since Shin Hae-Chul's previous big band "Next." The album, which features Shin Hae-Chul's unique lyrics and specific concepts, is also similar to the Next albums. However, there is a difference in sounds used on the album that are properly fused sampling based work and computer music. This album is a low-budget home recording album produced at a total cost of 3 million won. Shin Hae-Chul was in charge of the main vocals and programming, and all of the works were done together by the band members. In this album, Shin Hae-Chul focused on teamwork rather than producing his own music. The low budget could have been a constraint on music production, but it must be highly appreciated for it being a novel attempt. Musicians who create music always create conflicts between their favorite music and popular ones. However, without creative efforts, there is no evolution or development in the music industry. It is clear that constant changes can continue to develop musical ability, which leads to the development of Korean pop music.

• Journal of the Korean Society of Propulsion Engineers
• /
• v.3 no.2
• /
• pp.1-9
• /
• 1999

Applicability of the pressure gradient method which is formulated based on pressure gradient is verified against turbulent flow analysis. In the pressure gradient method, pressure gradient instead of pressure itself is obtained using continuity constraint. Since correct pressure gradient is found only when mass conservation is satisfied, pressure gradient method can reflect physics of flow field properly The pressure gradient method is formulated with semi-staggered grid system which locates each primitive variables on the same grid point but evaluates pressure gradient in-between. This grid system ensures easy programming and reflection of correct physics in analysis. For verifying applicability of this method, the pressure gradient method is applied to turbulent flow analysis with low Reynolds number $\kappa$-$\varepsilon$ model. Turbulent flows include fully developed channel flow, backward-facing step flow, and conical diffuser flow. Prediction results show that the pressure gradient method can be applied to turbulent flow analysis. However, the pressure gradient method requires somewhat long computation time. Proper way to find optimum under-relaxation factor, $\gamma$, is also need to be developed.

• Proceedings of the IEEK Conference
• /
• 2003.11a
• /
• pp.401-404
• /
• 2003

In this paper, $H_2$, $H_{\infty}$, and mixed $H_2/H_{\infty}$ FIR filters are newly proposed for discrete-time state space signal models. The proposed filters require linearity, unbiased property, FIR structure, and independence of the initial state information in addition to the performance criteria in both $H_2$ and $H_{\infty}$ sense. It is shown that $H_2$, $H_{\infty}$, and mixed $H_2/H_{\infty}$ FIR filter design problems can be converted into convex programming problems via linear matrix inequalities (LMIs) with a linear equality constraint. Simulation studies illustrat that the proposed FIR filter is more robust against uncertainties and has faster convergence than the conventional IIR filters. the conventional IIR filters.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.12 no.3
• /
• pp.39-55
• /
• 1992

In this research, a Three Level Decomposition technique has been developed for configuration design optimization of truss structures. In the first level, as design variables, behavior variables are used and the strain energy has been treated as the cost function to be maximized so that the truss structure can absorb maximum energy. For design constraint of the optimal design problem, allowable stress, buckling stress, and displacement under multi-loading conditions are considered. In the second level, design problem is formulated using the cross-sectional area as the design variable and the weight of the truss structure as the cost function. As for the design constraint, the equilibrium equation with the optimal displacement obtained in the first level is used. In the third level, the nodal point coordinates of the truss structure are used as coordinating variable and the weight has been taken as the cost function. An advantage of the Three Level Decomposition technique is that the first and second level design problems are simple because they are linear programming problems. Moreover, the method is efficient because it is not necessary to carry out time consuming structural analysis and techniques for sensitivity analysis during the design optimization process. By treating the nodal point coordinates as design variables, the third level becomes unconstrained optimal design problems which is easier to solve. Moreover, by using different convergence criteria at each level of design problem, improved convergence can be obtained. The proposed technique has been tested using four different truss structures to yield almost identical optimum designs in the literature with efficient convergence rate regardless of constraint types and configuration of truss structures.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.13 no.2
• /
• pp.173-182
• /
• 1993

This paper presents an algorithm to derive the representative unit hydrograph for the real environment of a watershed. For a given watershed, the conventional methods give several different unit hydrographs by storm events. In this study the LP model is somewhat modified based on the previous study by Mays et also as follows: the objective function is designed to minimize the sum of weighted residuals. An additional constraint of moving average is added to prevent the unit hydrograph from the occurence of oscillation which was not active in Mays's paper. Configuration of rainfall matrix was improved to reduce its dimension in accordance with Diskin's review point. In spite of the superiority of LP approach in terms of representativeness, all the methods were very sensitive to the validity of baseflow separation and rainfall-loss. Several methods of the separations for rainfall excesses and direct runoffs were applied and no preferred methods were identified. This is the matter of judgement considering catchment and rainfall characteristics. This algorithm was applied to a real watershed of the Wi stream in the Nak-dong river. Compared with the IHP results by conventional methods, this optimized representative unit hydrograph demonstrated relatively smaller and shorter values in terms of the peak discharge and the basin lag respectively, and the oscillation of its falling limb successfully eliminated owing to the additional constraints of moving averages.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.36C no.11
• /
• pp.64-74
• /
• 1999

A new clock skew optimization for clock routing using link-edge insertion is proposed in this paper. It satisfies the given skew bound and prevent the total wire length from increasing. As the clock skew is the major constraint for high speed synchronous ICs, it must be minimized in order to obtain high performance. But clock skew minimization can increase total wire length, therefore clock routing is performed within the given skew bound which can not induce the malfunction. Clock routing under the specified skew bound can decrease total wire length Not only total wire length and delay time minimization algorithm using merging point relocation method but also clock skew reduction algorithm using link-edge insertion technique between two nodes whose delay difference is large is proposed. The proposed algorithm construct a new clock routing topology which is generalized graph model while previous methods uses only tree-structured routing topology. A new cost function is designed in order to select two nodes which constitute link-edge. Using this cost function, delay difference or clock skew is reduced by connecting two nodes whose delay difference is large and distance difference is short. Furthermore, routing topology construction and wire sizing algorithm is developed to reduce clock delay. The proposed algorithm is implemented in C programming language. From the experimental results, we can get the delay reduction under the given skew bound.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.12 no.3
• /
• pp.65-79
• /
• 1992

This study is concerned with the optimal design of two hinged steel arches with I cross sectional type and aimed at the exact analysis of the arches and the safe and economic design of structure. The analyzing method of arches which introduces the finite difference method considering the displacements of structure in analyzing process is used to eliminate the error of analysis and to determine the sectional force of structure. The optimizing problems of arches formulate with the objective functions and the constraints which take the sectional dimensions(B, D, $t_f$, $t_w$) as the design variables. The object functions are formulated as the total weight of arch and the constraints are derived by using the criteria with respect to the working stress, the minimum dimension of flange and web based on the part of steel bridge in the Korea standard code of road bridge and including the economic depth constraint of the I sectional type, the upper limit dimension of the depth of web and the lower limit dimension of the breadth of flange. The SUMT method using the modified Newton Raphson direction method is introduced to solve the formulated nonlinear programming problems which developed in this study and tested out throught the numerical examples. The developed optimal design programming of arch is tested out and examined throught the numerical examples for the various arches. And their results are compared and analyzed to examine the possibility of optimization, the applicablity, the convergency of this algorithm and with the results of numerical examples using the reference(30). The correlative equations between the optimal sectional areas and inertia moments are introduced from the various numerical optimal design results in this study.