• Structural Engineering and Mechanics
• /
• v.10 no.1
• /
• pp.67-79
• /
• 2000

Critical loads and load-carrying capacities for steel scaffolds used as shoring systems were compared using computational and experimental methods in Part I of this paper. In that paper, a simple 2-D model was established for use in evaluating the structural behavior of scaffold-shoring systems. This 2-D model was derived using an incremental finite element analysis (FEA) of a typical complete scaffold-shoring system. Although the simplified model is only two-dimensional, it predicts the critical loads and failure modes of the complete system. The objective of this paper is to present a closed-form solution to the 2-D model. To simplify the analysis, a simpler model was first established to replace the 2-D model. Then, a closed-form solution for the critical loads and failure modes based on this simplified model were derived using a bifurcation (eigenvalue) approach to the elastic-buckling problem. In this closed-form equation, the critical loads are shown to be function of the number of stories, material properties, and section properties of the scaffolds. The critical loads and failure modes obtained from the analytical (closed-form) solution were compared with the results from the 2-D model. The comparisons show that the critical loads from the analytical solution (simplified model) closely match the results from the more complex model, and that the predicted failure modes are nearly identical.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.32A no.8
• /
• pp.39-46
• /
• 1995

A complete form of physical optics solution to the E-polarized diffraction by a composite of conducting and dielectric wedges is obtained by sum ov geometrical optics solution and edge-diffracted field. The diffraction coefficients of the edge-diffracted field are expressed in series of cotangent functions. The electric field patterns of the physical optics solution are plotted in figures.

• Journal of the Korean Mathematical Society
• /
• v.39 no.2
• /
• pp.237-252
• /
• 2002

We study the compatibility conditions and the existence of solutions or overdetermined PDE systems that admit complete prolongation. For a complete system of order k there exists a submanifold of the ($\kappa$-1)st jet space of unknown functions that is the largest possible set on which the initial conditions of ($\kappa$-1)st order may take values. There exists a unique solution for any initial condition that belongs to this set if and only if the complete system satisfies the compatibility conditions on the initial data set. We prove by applying the Frobenius theorem to a Pfaffian differential system associated with the complete prolongation.

• Proceedings of the Korean Society of Life Science Conference
• /
• 2000.06a
• /
• pp.15-15
• /
• 2000

• Proceedings of the Korean Geotechical Society Conference
• /
• 2000.03b
• /
• pp.58-76
• /
• 2000

An analytical solution method capable of determining the geometric configuration and developed tensile forces of mooring lines associated with fixed plate/pile or drag anchors is presented. The solution method, satisfying complete equilibrium conditions, is capable of analyzing multi-segmented mooring lines that can consist of either chains, cables, or wires embedded in layered seafloor soils. Centrifuge model tests and full -scale field tests were used to calibrate and validate the analytical solution.

• Journal of the Chungcheong Mathematical Society
• /
• v.23 no.2
• /
• pp.185-195
• /
• 2010

In the unified field theory(UFT), in order to find a solution of the Einstein's equation it is necessary and sufficient to study the torsion tensor. The main goal in the present paper is to obtain, using a given torsion tensor (3.1), the complete representation of a particular solution of the Einstein's equation in terms of the basic tensor $g_{{\lambda}{\nu}}$ in even-dimensional UFT $X_n$.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.29 no.3
• /
• pp.145-155
• /
• 2004

The design of a communication network has long been a challenging optimization problem. Since the optimal design of a network topology is a well known as a NP-complete problem, many researches have been conducted to obtain near optimal solutions in polynomial time instead of exact optimal solutions. All of these researches suggested diverse heuristic algorithms that can be applied to network design problems. Among these algorithms, a simulated annealing algorithm has been proved to guarantee a good solution for many NP-complete problems. in applying the simulated annealing algorithms to network design problems, generating mechanisms for initial solutions and candidate solutions play an important role in terms of goodness of a solution and efficiency. This study aims at analyzing these mechanisms through experiments, and then suggesting reliable mechanisms.

• Journal of the military operations research society of Korea
• /
• v.17 no.1
• /
• pp.146-158
• /
• 1991

In this paper, we deal with the TSP (Traveling Salesperson Problem) which is well-known as NP-complete optimization problem. the TSP is applicable to network routing. task allocation or scheduling. and VLSI wiring. Well known numerical methods such as Newton's Metheod. Gradient Method, Simplex Method can not be applicable to find Global Solution but the just give Local Minimum. Exhaustive search over all cyclic paths requires 1/2 (n-1) ! paths, so there is no computer to solve more than 15-cities. Heuristic algorithm. Simulated Annealing, Artificial Neural Net method can be used to get reasonable near-optimum with polynomial execution time on problem size. Therefore, we are able to select the fittest one according to the environment of problem domain. Three methods are simulated about symmetric TSP with 30 and 50-city samples and are compared by means of the quality of solution and the running time.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.4
• /
• pp.81-88
• /
• 2016

The optimal solution of quadratic assignment problem (QAP) cannot get done in polynomial time. This problem is called by NP-complete problem. Therefore the meta-heuristic techniques are applied to this problem to get the approximated solution within polynomial time. This paper proposes an algorithm for a random type QAP, in which the instance of two nodes are arbitrary. The proposed algorithm employs what is coined as a max flow-min distance rule by which the maximum flow node is assigned to the minimum distance node. When applied to the random type QAP, the proposed algorithm has been found to obtain optimal solutions superior to those of the genetic algorithm.

• ETRI Journal
• /
• v.28 no.6
• /
• pp.793-795
• /
• 2006

When quadrature error exists, the shape of the M-ary phase shift keying (MPSK) signal constellation becomes skewed-elliptic. Each MPSK symbol takes on a different symbol error probability (SEP) value. The analytical results presented thus far have been derived from studies which examined the SEP problem assuming that the SEP of each MPSK symbol is equally likely; therefore, those results should not be treated as offering a complete solution. In this letter, we present a new and more complete solution to the SEP problem of MPSK by relaxing the above assumption and finding the expressions for the average as well as individual SEP in the presence of quadrature error.