• Language and Information
• /
• v.5 no.2
• /
• pp.9-20
• /
• 2001

Barker (1997) has argued that all the three approaches to anaphora, namely, E-type theories, Discourse Representation Theory, and Dynamic Semantics, are faced with the so-called 'double-bind' problem in the quantifier/variable-binding model of anaphora. Recently, in the same journal, Slater (2000) has claimed that the so-called epsilon account (Slater 1991, 1993, 1994, 1997) handles the problem without any difficulty. However, it will be proposed in this paper that the epsilon account has its own problems in handling the quantifier/variable-binding, and that as argued in Yoon (1998), the so-called‘conjunctive paraphrase’account is the correct solution to the problem, which is intuitively supported as well.

• 한국정보컨버전스학회:학술대회논문집
• /
• 2008.06a
• /
• pp.125-128
• /
• 2008

The aim this master thesis is to find out if is possible to Integrate haptic hardware support in the source 3D game engine Crystal Space. Integrating haptic support would make it possible to get a haptic representation of 3D geometry in Crystal Space and therefore take advantage of all the benefits a 3D game engine provides, when building haptic applications, An implementation of the support should be as low-cost as Possible by taking advantage of available source haptic API alternatives. The thesis report presents an evaluation of available haptic APIs and comes up with a design and an implementation. The solution has been implemented as a Crystal Space plugin by using modified parts of the e-Touch open module API. The plugin makes it possible to utilize the Phantom haptic device to touch and feel the 3D environments in a Crystal Space application. Two demo applications have also been constructed to show the capabilities of the plugin.

• Structural Engineering and Mechanics
• /
• v.43 no.2
• /
• pp.147-161
• /
• 2012

This paper presents a curvature method for analysis of beam-columns with different materials and arbitrary cross-section shapes and subjected to combined biaxial moments and axial load. Both material and geometric nonlinearities (the p-delta effect in this case) were incorporated. The proposed method considers biaxial curvatures and uniform normal strains of discrete cross-sections of beam-columns as basic unknowns, and seeks for a solution of the column deflection curve that satisfies force equilibrium conditions. A piecewise representation of the beam-column deflection curve is constructed based on the curvatures and angles of rotation of the segmented cross-sections. The resulting bending moments were evaluated based on the deformed column shape and the axial load. The moment curvature relationship and the beam-column deflection calculation are presented in matrix form and the Newton-Raphson method is employed to ensure fast and stable convergence. Comparison with results of analytic solutions and eccentric compression tests of wood beam-columns implies that this method is reliable and effective for beam-columns subjected to eccentric compression load, lateral bracings and complex boundary conditions.

• Journal of the Korea Society for Simulation
• /
• v.14 no.2
• /
• pp.15-24
• /
• 2005

The goal of a distributed simulation such as battle field simulation is to combine all kinds of simulations in the same synthetic environment and to make people interact at the same time. It is a key issue to share the same synthetic environment among simulations. To support reusability and affordability in the modeling and simulation area, DMSO(Defense Modeling and Simulation Office) of USA developed concepts such as HLA(High Level Architecture) and SEDRIS (Synthetic Environmental Data Representation and Interchange Specification). In the industrial simulation area, the digital manufacturing is the main stream. To reduce cost and to reuse simulation environment, the standardization becomes the focus of digital manufacturing. This study proposes to use SEDRIS to improve interoperability of manufacturing data. The simulation data of DELMIA, which is a leading commercial digital manufacturing solution, is mapped and translated into the SEDRIS transmittal format. Mapping of the manufacturing simulation data and the synthetic environment are implemented and verified through experiments.

• Proceedings of the Safety Management and Science Conference
• /
• 2005.05a
• /
• pp.523-534
• /
• 2005

This paper is concerned with the integrated problem of line balancing and model sequencing in mixed model assembly lines(MMALBS), which is important to efficient utilization of the lines. In the problem, we deal with the objective of minimizing the overall line length To apply the GAs to MMALBS problems, we suggest a GA representation which suitable for its problems, an efficient decoding technique for the objective, and genetic operators which produce feasible offsprings. Extensive experiments are carried out to analyze the performance of the proposed algorithm. The computational results show that our algorithm is promising in solution quality.

• Journal of Ubiquitous Convergence Technology
• /
• v.2 no.1
• /
• pp.40-50
• /
• 2008

The problem of assigning customers to satellite channels is a difficult combinatorial optimization problem and is NP-complete. For this combinatorial optimization problem, standard optimization methods take a large computation time and so genetic algorithms (GA) and ant colony optimization (ACO) can be used to obtain the best and/or optimal assignment of customers to satellite channels. In this paper, we present a comparative study of GA and ACO to this problem. Various issues related to genetic algorithms approach to this problem, such as solution representation, selection methods, genetic operators and repair of invalid solutions are presented. We also discuss an ACO for this problem. In ACO methodology, three strategies, ACO with only ranking, ACO with only max-min ant system (MMAS), and ACO with both ranking and MMAS, are considered. A comparison of these two approaches (i,e., GA and ACO) with the standard optimization method is presented to show the advantages of these approaches in terms of computation time.

• Proceedings of the Korea Concrete Institute Conference
• /
• 1992.04a
• /
• pp.74-79
• /
• 1992

The confinement of concrete from splitting bond failure is studied with the experiments and finite element models. The cracks in the test beam-end specimens containing various covers show a typical splitting failure with a dominant fracture surface. The finite element model includes representation of the splitting cracking using Hillerborg's fictitious crack model. The increase in bond strength from addition of covers are consistant for both test bars and numerical models. The numerical solution agrees well with results and also with the test results and also with the empirical equations. The splitting crack in the numerical models generally matches the crack surface observed in the laboratory. The confinement of concrete from splitting is one of the governing factors in the ultimate bond force.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2000.05a
• /
• pp.224-227
• /
• 2000

In this Paper, we prepose a method of constructing neural networks using bio-inspired emergent and evolutionary concepts. This method is algorithm that is based on the characteristics of the biological DNA and growth of plants. Here is, we propose a constructing method to make a DNA coding method for production rule of L-system. L-system is based on so-called the parallel rewriting mechanism. The DNA coding method has no limitation in expressing the production rule of L-system. Evolutionary algorithms motivated by Darwinian natural selection are population based searching methods and the high performance of which is highly dependent on the representation of solution space. In order to verify the effectiveness of our scheme, we apply it to one step ahead prediction of Mackey-Glass time series, Sun spot data and KOSPI data.

• Journal of applied mathematics & informatics
• /
• v.11 no.1_2
• /
• pp.155-164
• /
• 2003

The existence and representations of some generalized inverses, including ${A_{T,*}}^{(2)},\;{A_{T,*}}^{(1,2)},\;{A_{T,*}}^{(2,3)},\;{A_{*,S}}^{(2)},\;{A_{*,S}}^{(1,2)}\;and\;{A_{*,S}}^{(2,4)}$, are showed. As applications, the perturbation theory for the generalized inverse {A_{T,S}}^{(2)} and the perturbation bound for unique solution of the general restricted system $A_{x}$ = b(dim(AT)=dimT, $b{\in}AT$ and $x{\in}T$) are studied. Moreover, a characterization and representation of the generalized inverse ${A_{T,*}}^{(2)}$ is obtained.

• Structural Engineering and Mechanics
• /
• v.17 no.5
• /
• pp.671-690
• /
• 2004

A meshless method with novel variation of point collocation by finite mixture approximation is developed in this paper, termed the meshless finite mixture (MFM) method. It is based on the finite mixture theorem and consists of two or more existing meshless techniques for exploitation of their respective merits for the numerical solution of partial differential boundary value (PDBV) problems. In this representation, the classical reproducing kernel particle and differential quadrature techniques are mixed in a point collocation framework. The least-square method is used to optimize the value of the weight coefficient to construct the final finite mixture approximation with higher accuracy and numerical stability. In order to validate the developed MFM method, several one- and two-dimensional PDBV problems are studied with different mixed boundary conditions. From the numerical results, it is observed that the optimized MFM weight coefficient can improve significantly the numerical stability and accuracy of the newly developed MFM method for the various PDBV problems.