• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.5 no.3
• /
• pp.49-59
• /
• 1985

Formulation of the geometric optimization for truss structures based on the elasticity theory turn out to be the nonlinear programming problem which has to deal with the Cross sectional area of the member and the coordinates of its nodes simultaneously. A few techniques have been proposed and adopted for the analysis of this nonlinear programming problem for the time being. These techniques, however, bear some limitations on truss shapes loading conditions and design criteria for the practical application to real structures. A generalized algorithm for the geometric optimization of the truss structures which can eliminate the above mentioned limitations, is developed in this study. The algorithm developed utilizes the two-phases technique. In the first phase, the cross sectional area of the truss member is optimized by transforming the nonlinear problem into SUMT, and solving SUMT utilizing the modified Newton-Raphson method. In the second phase, the geometric shape is optimized utilizing the unidirctional search technique of the Rosenbrock method which make it possible to minimize only the objective function. The algorithm developed in this study is numerically tested for several truss structures with various shapes, loading conditions and design criteria, and compared with the results of the other algorithms to examme its applicability and stability. The numerical comparisons show that the two-phases algorithm developed in this study is safely applicable to any design criteria, and the convergency rate is very fast and stable compared with other iteration methods for the geometric optimization of truss structures.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.13 no.1
• /
• pp.107-113
• /
• 1995

Generally, the objectives of the geodetic network adjustments are for solving the configuration of geodetic net-works and the problem of observation plans. In this study, assuming that the configuration is fixed, for improving the accuracy of geodetic networks, we focus on choosing adjustment control points and adjustment methods. By choosing adjustment control points and adjustment methods, the adjustment result accuracy of national geodetic networks can be different. So, in this study, we introduce the algorithm that use free network adjustment concept to minimize the displacements of new station points but fixing existing control points. Then, us-ing adjustment results, we can check the errors of existing control points. After checking the errors of existing control point, in case of severe error points in existing control points, we change those points into unknown station points and repeat the algorithm to optimize the coordinates of new station points. As applying this algorithm to simulation network, we can check the errors of existing control points. And changing severe error points into unknown station points, we can decrease the errors of network and optimize the coordinates of new station points. From the results of simulation network adjustment, we think that, as applying this algorithms to sequential adjustment of geodetic network and public surveying that using national geodetic network, the accuracy of network adjustments can be improved.

• Investigative Magnetic Resonance Imaging
• /
• v.6 no.2
• /
• pp.137-146
• /
• 2002

Purpose : This paper introduces an improved classification approach which adopts a deterministic relaxation method and an agglomerative clustering technique for the classification of MRI using neural network. The proposed approach can solve the problems of convergency to local optima and computational burden caused by a large number of input patterns when a neural network is used for image classification. Materials and methods : Application of Hopfield neural network has been solving various optimization problems. However, major problem of mapping an image classification problem into a neural network is that network is opt to converge to local optima and its convergency toward the global solution with a standard stochastic relaxation spends much time. Therefore, to avoid local solutions and to achieve fast convergency toward a global optimization, we adopt MFA to a Hopfield network during the classification. MFA replaces the stochastic nature of simulated annealing method with a set of deterministic update rules that act on the average value of the variable. By minimizing averages, it is possible to converge to an equilibrium state considerably faster than standard simulated annealing method. Moreover, the proposed agglomerative clustering algorithm which determines the underlying clusters of the image provides initial input values of Hopfield neural network. Results : The proposed approach which uses agglomerative clustering and deterministic relaxation approach resolves the problem of local optimization and achieves fast convergency toward a global optimization when a neural network is used for MRI classification. Conclusion : In this paper, we introduce a new paradigm to classify MRI using clustering analysis and deterministic relaxation for neural network to improve the classification results.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.7
• /
• pp.619-628
• /
• 2000

Abstract Perspective views provide a powerful depth cue and thus aid the interpretation of complicated images. The main drawback of current perspective volume rendering is the long execution time. In this paper, we present an efficient perspective volume rendering algorithm based on coherency between rays. Two sets of templates are built for the rays cast from horizontal and vertical scanlines in the intermediate image which is parallel to one of volume faces. Each sample along a ray is calculated by interpolating neighboring voxels with the pre-computed weights in the templates. We also solve the problem of uneven sampling rate due to perspective ray divergence by building more templates for the regions far away from a viewpoint. Since our algorithm operates in object-order, it can avoid redundant access to each voxel and exploit spatial data coherency by using run-length encoded volume. Experimental results show that the use of templates and the object-order processing with run-length encoded volume provide speedups, compared to the other approaches. Additionally, the image quality of our algorithm improves by solving uneven sampling rate due to perspective ray di vergence.

• 한국벤처창업학회:학술대회논문집
• /
• 2010.08a
• /
• pp.71-89
• /
• 2010

It is strongly believed that multicast will become one of the most promising services on internet for the next generation. Multicast service can be deployed either on network-layer or application-layer. IP multicast (network-layer multicast) is implemented by network nodes (i.e., routers) and avoids multiple copies of the same datagram on the same link. Despite the conceptual simplicity of IP multicast and its obvious benefits, it has not been widely deployed since there remain many unresolved issues. As an alternative to IP multicast, overlay multicast (application-layer multicast) implements the multicast functionality at end hosts rather than routers. This may require more overall bandwidth than IP multicast because duplicate packets travel the same physical links multiple times, but it provides an inexpensive, deployable method of providing point-to-multipoint group communication. In this paper we develop an efficient method applied greedy algorithm for solving two models of overlay multicast tree building problem that is aimed to construct MDST (Minimum Diameter Spanning Tree : minimum cost path from a source node to all its receivers) and MST (Minimum Spanning Tree : minimum total cost spanning all the members). We also simulate and analyze MDST and MST.

• The Journal of Information Technology
• /
• v.3 no.2
• /
• pp.73-85
• /
• 2000

The efficient algorithms are suggested in this study for solving the multicommodity network flow problems applied to Communications Systems. These problems are typical NP-complete optimization problems that require integer solution and in which the computational complexity increases numerically in appropriate with the problem size. Although the suggested algorithms are not absolutely optimal, they are developed for computationally efficient and produce near-optimal and primal integral solutions. We supplement the traditional Lagrangian method with a price-directive decomposition. It proceeded as follows. First, A primal heuristic from which good initial feasible solutions can be obtained is developed. Second, the dual is initialized using marginal values from the primal heuristic. Generally, the Lagrangian optimization is conducted from a naive dual solution which is set as ${\lambda}=0$. The dual optimization converged very slowly because these values have sort of gaps from the optimum. Better dual solutions improve the primal solution, and better primal bounds improve the step size used by the dual optimization. Third, a limitation that the Lagrangian decomposition approach has Is dealt with. Because this method is dual based, the solution need not converge to the optimal solution in the multicommodity network problem. So as to adjust relaxed solution to a feasible one, we made efficient re-allocation heuristic. In addition, the computational performances of various versions of the developed algorithms are compared and evaluated. First, commercial LP software, LINGO 4.0 extended version for LINDO system is utilized for the purpose of implementation that is robust and efficient. Tested problem sets are generated randomly Numerical results on randomly generated examples demonstrate that our algorithm is near-optimal (< 2% from the optimum) and has a quite computational efficiency.

• Journal of Elementary Mathematics Education in Korea
• /
• v.10 no.2
• /
• pp.221-242
• /
• 2006

For teaching division more effectively, it is necessary to know students' informal knowledge before they learned formal knowledge about division. The purpose of this study is to research students' informal knowledge of division and to analyze meaningful suggestions to link formal knowledge of division in elementary school mathematics. According to this purpose, two research questions were set up as follows: (1) What is the students' informal knowledge before they learned formal knowledge about division in elementary school mathematics? (2) What is the difference of thinking strategies between students who have learned formal knowledge and students who have not learned formal knowledge? The conclusions are as follows: First, informal knowledge of division of natural numbers used by grade 1 and 2 varies from using concrete materials to formal operations. Second, students learning formal knowledge do not use so various strategies because of limited problem solving methods by formal knowledge. Third, acquisition of algorithm is not a prior condition for solving problems. Fourth, it is necessary that formal knowledge is connected to informal knowledge when teaching mathematics. Fifth, it is necessary to teach not only algorithms but also various strategies in the area of number and operation.

• Structural Engineering and Mechanics
• /
• v.58 no.3
• /
• pp.459-473
• /
• 2016

Various vague and unstructured problems encountered the civil engineering/designers that persuaded by their experiences. One of these problems is the structural failure of the reinforced concrete (RC) building determination. Typically, using the traditional Limit state method is time consuming and complex in designing structures that are optimized in terms of one/many parameters. Recent research has revealed the Artificial Neural Networks potentiality in solving various real life problems. Thus, the current work employed the Multilayer Perceptron Feed-Forward Network (MLP-FFN) classifier to tackle the problem of predicting structural failure of multistoried reinforced concrete buildings via detecting the failure possibility of the multistoried RC building structure in the future. In order to evaluate the proposed method performance, a database of 257 multistoried buildings RC structures has been constructed by professional engineers, from which 150 RC structures were used. From the structural design, fifteen features have been extracted, where nine features of them have been selected to perform the classification process. Various performance measures have been calculated to evaluate the proposed model. The experimental results established satisfactory performance of the proposed model.

• Advances in nano research
• /
• v.16 no.5
• /
• pp.473-487
• /
• 2024

The current study employs the nonlocal Timoshenko beam (NTB) theory and von-Kármán's geometric nonlinearity to develop a non-classic beam model for evaluating the nonlinear free vibration of bi-directional functionally-graded (BFG) nanobeams. In order to avoid the stretching-bending coupling in the equations of motion, the problem is formulated based on the physical middle surface. The governing equations of motion and the relevant boundary conditions have been determined using Hamilton's principle, followed by discretization using the differential quadrature method (DQM). To determine the frequencies of nonlinear vibrations in the BFG nanobeams, a direct iterative algorithm is used for solving the discretized underlying equations. The model verification is conducted by making a comparison between the obtained results and benchmark results reported in prior studies. In the present work, the effects of amplitude ratio, nanobeam length, material distribution, nonlocality, and boundary conditions are examined on the nonlinear frequency of BFG nanobeams through a parametric study. As a main result, it is observed that the nonlinear vibration frequencies are greater than the linear vibration frequencies for the same amplitude of the nonlinear oscillator. The study finds that the difference between the dimensionless linear frequency and the nonlinear frequency is smaller for CC nanobeams compared to SS nanobeams, particularly within the α range of 0 to 1.5, where the impact of geometric nonlinearity on CC nanobeams can be disregarded. Furthermore, the nonlinear frequency ratio exhibits an increasing trend as the parameter µ is incremented, with a diminishing dependency on nanobeam length (L). Additionally, it is established that as the nanobeam length increases, a critical point is reached at which a sharp rise in the nonlinear frequency ratio occurs, particularly within the nanobeam length range of 10 nm to 30 nm. These findings collectively contribute to a comprehensive understanding of the nonlinear vibration behavior of BFG nanobeams in relation to various parameters.

• The Mathematical Education
• /
• v.29 no.1
• /
• pp.21-34
• /
• 1990

This is a study on an instruction of estimation for error correction in the calculation with a computer or a calculator. The aim of this study is to survey a new aspect of calaulation teaching and the teaching strategy of estimation and finally to frame a new curriculum model of estimation instruction. This research required a year and the outcomes of the research can be listed as follows: 1. Social utilities of estimation were made clear, and a new trend of calculation teaching related to estimation instruction was shown. 2. The definition of estimation was given and actual examples of conducting an estimation among pupils in lower grades were given for them to have abundant experiences. 3. The ways of finding estimating values in fraction and decimal fraction were presented for the pupils to be able to conduct an estimation. 4. The following contents were given as a basic strategy for estimation. 1) Front-end strategy 2) Clustering strategy 3) Rounding strategy 4) Compatible numbers strategy 5) Special numbers strategy 5. In an instuction of estimation the meaning, method. and process of calculation and calculating algorithm were reviewed for the cultivation of children's creativity through promoting their basic skill, mathematical thinking and problem-solving ability. 6. The following contents were also covered as an estimation strategy for measurement 1) Calculating the sense of quantity on the size of unit. 2) Estimating the total quantity by frequent repetition of unit quantity. 3) Estimating the length and the volume by weighing. 4) Estimating unknown quantity based on the quatity already known. 5) Estimating the area by means of equivalent area transformation. 7. The ways of instructing mental computation were presented. 8. Reviews were made on the curricular and the textbook contents concerning estimation instructions both in Korea and Japan. and a new model of curriculum was devised with reference to estimation instruction data of the United States.