• Proceedings of the Korea Committee for Ocean Resources and Engineering Conference
• /
• 2004.11a
• /
• pp.35-39
• /
• 2004

In a shipyard, there exist various critical decision making components pertaining to various production hindrances. The most prominent one is best-fit spatial arrangement for the minimal spatial occupancy with better pick-ability for the erection of the ship in the dock. During the present research, a concept have been conceived to evade the gap between the identification oj inter-relationships among a set of blocks to be included on a pre-erection area, and a detailed graphical layout of their positions, is called an Optimal Block Relationship Diagram A research has been performed on generation of optimal (or near Optimal) that is, with minimal scrap area. An effort has been made in the generation of optimal (or near-optimal) Optimal Block Relationship Diagram with the Goldberg's Genetic Algorithms with a representation and a set of operators are 'trained' specifically for this application. The expected result to date predicts very good solutions to test problems involving innumerable different blocks to place. The suggested algorithm could accept input from an erection sequence generator program which assists the user in defining the nature and strength of the relationships among blocks, and could produce input suitable for use in a detailed layout stage.

• Structural Engineering and Mechanics
• /
• v.24 no.4
• /
• pp.479-491
• /
• 2006

This paper deals with optimal fibre orientations of symmetrically laminated fibre reinforced composite structures for maximising the fundamental frequency of small-amplitude. A set of fiber orientation angles in the layers are considered as design variable. The Modified Feasible Direction method is used in order to obtain the optimal designs. The effects of number of layers, boundary conditions, laminate thicknesses, aspect ratios and in-plane loads on the optimal designs are studied.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.3
• /
• pp.107-113
• /
• 2015

This paper presents a polynomial time algorithm to the minimum cardinality feedback edge set and minimum weight feedback edge set problems. The algorithm makes use of the property wherein the sum of the minimum spanning tree edge set and the minimum feedback edge set equals a given graph's edge set. In other words, the minimum feedback edge set is inherently a complementary set of the former. The proposed algorithm, in pursuit of the optimal solution, modifies the minimum spanning tree finding Kruskal's algorithm so as to arrange the weight of edges in a descending order and to assign cycle-deficient edges to the maximum spanning tree edge set MXST and cycle-containing edges to the feedback edge set FES. This algorithm runs with linear time complexity, whose execution time corresponds to the number of edges of the graph. When extensively tested on various undirected graphs both with and without the weighed edge, the proposed algorithm has obtained the optimal solutions with 100% success and accuracy.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1996.04a
• /
• pp.83-86
• /
• 1996

In this paper we study the problem of augmenting a physical network to improve the topology for new survivable network architectures. We are given a graph G=(V,E,F), where V is a set of nodes that represents transmission systems which be interconnected by physical links, and E is a collection of edges that represent the possible pairs of nodes between which a direct transmission link can be placed. F, a subset of E is defined as a set of the existing direct links, and E/F is defined as a set of edges for the possible new connection. The cost of establishing network $N_{H}$=(V,H,F) is defined by the sum of the costs of the individual links contained in new link set H. We call that $N_{H}$=(V,H,F) is feasible if certain connectivity constrints can be satisfied in $N_{H}$=(V,H,F). The computational goal for the suggested model is to find a minimum cost network among the feasible solutions. For a k edge (node) connected component S .subeq. F, we charactrize some optimality conditions with respect to S. By this characterization we can find part of the network that formed by only F-edges. We do not need to augment E/F edges for these components in an optimal solution. Hence we shrink the related component into a node. We study some good primal heuristics by considering construction and exchange ideas. For the construction heuristics, we use some greedy methods and relaxation methods. For the improvement heuristics we generalize known exchange heuristics such as two-optimal cycle, three-optimal cycle, pretzel, quezel and one-optimal heuristics. Some computational experiments show that our heuristic is more efficient than some well known heuristics.stics.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.16 no.4
• /
• pp.13-24
• /
• 2017

This paper presents a sequentially combined method of determining location conditions, the number of unmanned parcel service box and their optimal locations. First of all, block, accessibility and main public facilities are considered as location conditions and then set-covering model and p-median model are adopted for deciding the number of unmanned parcel service box and optimal locations, respectively. A case study for a region composed of small housings and multiplex housings in Ansan is conducted to prove the validation and application of the proposed method. The result indicates that 2 unmanned parcel service boxes are necessary in specific public places. The research contributes to resonable choice of unmanned parcel service boxes, crime reduction relevant to delivery man impersonation and economic benefit due to parcel service industry growth.

• Korean Journal of English Language and Linguistics
• /
• v.1 no.1
• /
• pp.101-117
• /
• 2001

In English, whether or not wh-movement creates weak crossover effects depends upon the type of wh-phrases that cross over. A bare interrogative like who shows a typical weak crossover effect whereas which N type (e.g. which girl) and partitive type (e.g. which of these girls) wh-phrases would show mere weaker and weakest crossover effects, respectively. Previous approaches to English crossover phenomena that resort to a binary notion of specificity or D-linking cannot account for the three-way contrast the three different types of wh-phrases show. To overcome this problem, I argue in this paper that specificity should be a non-binary set-theoretic notion and propose the following subset principle and optimal binding relation: Between two lexical nominal expressions A and B, A is regarded as more specific than B iff the denotation of A comes from a more narrowly defined non-singleton set than B. Between two lexical nominal expressions A and B, if A locally binds B, then the non-singleton set from which the denotation of A comes should be a subset of the set from which the denotation of B comes (i.e. B cannot be more specific than A). The smaller the subset (i.e. the wider the specificity gap between binder and binder), the more optimal the local binding relation is. A locally binds B iff A is coindexed with B, and A c-commands B, and there is no such C that does not bind A but binds B. Finally, I show that partitivity functions to carve out a smaller subset and thus make partitive wh-phrases more specific than simple which N type wh-phrases.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2006.04a
• /
• pp.299-306
• /
• 2006

Using a level set method and topological derivatives, a topological shape optimization method that is independent of an initial design is developed for linearly elastic structures. In the level set method, the initial domain is kept fixed and its boundary is represented by an implicit moving boundary embedded in the level set function, which facilitates to handle complicated topological shape changes. The 'Hamilton-Jacobi (H-J)' equation and computationally robust numerical technique of 'up-wind scheme' lead the initial implicit boundary to an optimal one according to the normal velocity field while minimizing the objective function of compliance and satisfying the constraint of allowable volume. Based on the asymptotic regularization concept, the topological derivative is considered as the limit of shape derivative as the radius of hole approaches to zero. The required velocity field to update the H -J equation is determined from the descent direction of Lagrangian derived from optimality conditions. It turns out that the initial holes is not required to get the optimal result since the developed method can create holes whenever and wherever necessary using indicators obtained from the topological derivatives. It is demonstrated that the proper choice of control parameters for nucleation is crucial for efficient optimization process.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2005.04a
• /
• pp.301-304
• /
• 2005

In this paper, we propose a new fuzzy set-based polynomial neuron (FSPN) involving the information granule, and new fuzzy-neural networks - Fuzzy Set based Polynomial Neural Networks (FSPNN). We have developed a design methodology (genetic optimization using Genetic Algorithms) to find the optimal structure for fuzzy-neural networks that expanded from Group Method of Data Handling (GMDH). It is the number of input variables, the order of the polynomial, the number of membership functions, and a collection of the specific subset of input variables that are the parameters of FSPNN fixed by aid of genetic optimization that has search capability to find the optimal solution on the solution space. We have been interested in the architecture of fuzzy rules that mimic the real world, namely sub-model (node) composing the fuzzy-neural networks. We adopt fuzzy set-based fuzzy rules as substitute for fuzzy relation-based fuzzy rules and apply the concept of Information Granulation to the proposed fuzzy set-based rules.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.4
• /
• pp.662-674
• /
• 1997

In order to post process the vector-quantized images employing the theory of projections onto convex sets or the constrained minimization technique, the the projector onto QCS(quantization constraint set) as well as the filter that smoothes the lock boundaries should be investigated theoretically. The basic idea behind the projection onto QCS is to prevent the processed data from diverging from the original quantization region in order to reduce the blurring artifacts caused by a filtering operation. However, since the Voronoi regions in order to reduce the blurring artifacts caused by a filtering operation. However, since the Voronoi regions in the vector quantization are arbitrarilly shaped unless the vector quantization has a structural code book, the implementation of the projection onto QCS is very complicate. This paper mathematically analyzes the projection onto QCS from the viewpoit of minimizing the mean square error. Through the analysis, it has been revealed that the projection onto a subset of the QCS yields lower distortion than the projection onto QCS does. Searching for an optimal constraint set is not easy and the operation of the projector is complicate, since the shape of optimal constraint set is dependent on the statistical characteristics between the filtered and original images. Therefore, we proposed a hyper-cube as a constraint set that enables a simple projection. It sill be also shown that a proper filtering technique followed by the projection onto the hyper-cube can reduce the quantization distortion by theory and experiment.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.19 no.5
• /
• pp.73-78
• /
• 2019

This paper proposes polynomial-time rule for maximum weighted independent set(MWIS) problem that is well known NP-hard. The well known distributed algorithm selects the maximum weighted node as a element of independent set in a local. But the merged independent nodes with less weighted nodes have more weights than maximum weighted node are frequently occur. In this case, existing algorithm fails to get the optimal solution. To deal with these problems, this paper constructs maximum weighted independent set in local area. Application result of proposed algorithm to various networks, this algorithm can be get the optimal solution that fail to existing algorithm.