• Journal of Korea Society of Industrial Information Systems
• /
• v.12 no.2
• /
• pp.68-78
• /
• 2007

D-class is defined as a set of equivalent $n{\times}n$ boolean matrices according to a given equivalence relation. The D-class computation requires the multiplication of three boolean matrices for each of all possible triples of $n{\times}n$ boolean matrices. However, almost all the researches on boolean matrices focused on the efficient multiplication of only two boolean matrices and a few researches have recently been shown to deal with the multiplication of all boolean matrices. The paper suggests a mathematical theory that enables the efficient multiplication for all possible boolean matrix triples and the efficient computation of all D-classes, and discusses algorithms designed with the theory and their execution results.

• Journal of the Speleological Society of Korea
• /
• no.88
• /
• pp.38-44
• /
• 2008

This study aims to identify the efficiency by applying diverse index to the positions of vertex in the network among the network analysis methods in order to identify the relational location features of caves. The first consideration was about the relational location features according to the linking degree and centrality of cave. The second consideration was about the structural equivalence between caves or between caves and the surrounding tourists attractions. A variety of index examined in this study is very efficient for identifying the positions of caves in the network. Furthermore, the relational location features in consideration of surrounding tourists attractions identified the availability of more objective and quantitative expression. In particular, when there are other caves around a cave, it is also very useful to identify the structural equivalence or comparison with other caves.

• Lingua Humanitatis
• /
• v.2 no.2
• /
• pp.301-319
• /
• 2002

In a recent paper, I have proposed an analysis concerning propositions and 'that'-clauses as a solution to Kripke's puzzle and other similar puzzles, which I now call 'the Indefinite Description Analysis of Belief Ascription Sentences.' I have listed some of the major advantages of this analysis besides its merit as a solution to the puzzles: it is amenable to the direct-reference theory of proper names; it does not nevertheless need to introduce Russellian (singular) propositions or any other new entities. David Lewis has constructed an interesting argument to refute this analysis. His argument seems to show that my analysis has an unwelcome consequence: if someone believes any proposition, then he or she should, ipso facto, believe any necessary (mathematical or logical) proposition (such as the proposition that 1 succeeds 0). In this paper, I argue that Lewis's argument does not pose a real threat to my analysis. All his argument shows is that we should not accept the assumption called 'the equivalence thesis': if two sentences are equivalent, then they express the same proposition. I argue that this thesis is already in trouble for independent reasons. Especially, I argue that if we accept the equivalence thesis then, even without my analysis, we can derive a sentence like 'Fred believes that 1 succeeds 0 and snow is white' from a sentence like 'Fred believes that snow is white.' The consequence mentioned above is not worse than this consequence.

• Composites Research
• /
• v.17 no.2
• /
• pp.9-14
• /
• 2004

In this study, analytical investigations on the flexural behavior of FRP reinforced concrete slab were discussed. In the derivation of analytic solution, the FRP reinforced concrete slab was modeled as a structural orthotropic plate. To determine the flexural rigidities of an orthotropic plate model, the elastic equivalence method was employed. In the finite element analysis, the approximate method to determine the rigidity matrix of orthotropic plate element was also suggested using the elastic equivalence method. The results obtained by the analytical solution and the finite element analysis were compared with that of experiment.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.8 no.3
• /
• pp.16-25
• /
• 1998

In this paper, we propose features extraction method using Rough sets theory for efficient data classifications in hyperspectral environment. First, analyze the properties of multispectral image data, then select the most efficient bands using discemibility of Rough sets theory based on analysis results. The proposed method is applied Landsat TM image data, from this, we verify the equivalence of traditional bands selection method by band features and bands selection method using Rough sets theory that pmposed in this paper. Finally, we present theoretical basis to features extraction in hyperspectral environment.

• Korean Journal of Optics and Photonics
• /
• v.2 no.1
• /
• pp.36-49
• /
• 1991

The coherence properties of electromagnetic fields are reviewed, based on both the classical and quantum theories. The elementary concepts, employed frequently in the discussion of interference phenomena, are summarized. The well-known interference phenomena are described in terms of second-order coherences. The coherence theory in space-frequency domain is introduced and the coherent mode representation is presented. The generation and propagation of coherence of light are analysed and it is shown that the coherence of light is developed as light propagates. The quantum theory goes parallel with the classical theory, via the optical equivalence theorem. There are, however, certain nonclassical characteristics of light, which may not be easily understood in classical therms. These nonclassical phenomena are believed to originate from the particle aspects of light. The quantum effect on the interfernce phenomena is analysed and finally the outlook of the future research is briefly mentioned.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.21 no.11
• /
• pp.1809-1818
• /
• 1997

Mathematical models of industrial robots or manipulators are highly nonlinear equations with nonlinear coupling between the variables of motion. As the working speed has been fast, the effects of nonlinear terms have become serious. So the control algorithm based on approximately linearized equation looses the efficiency. In order to design the control law for the nonlinear models, Hunt-Su's nonlinear transformation method and Marino's feedback equivalence condition are used with linear quadratic regulator(LQR) theory in this study. Nonlinear terms of the system are eliminated and coupled terms are decoupled by this feedback law. This method is applied to a 3-D.O.F. vertical articulated manipulator by both experiments and simulations and compared with PID control which is widely used in the industry.

• Journal of applied mathematics & informatics
• /
• v.41 no.4
• /
• pp.861-868
• /
• 2023

Nonlinear network creates complex homotopy structural communication in wireless network medium because of complex distribution approach. Due to this multicast topological connection structure, the queuing probability was non regular principles to create routing structures. To resolve this problem, we propose a Co-cluster homotopy queuing model (Co-CHQT) for Nonlinear Algebraic Topological Structure (NLTS-) for improving poison distribution network communication. Initially this collects the routing propagation based on Nonlinear Distance Theory (NLDT) to estimate the nearest neighbor network nodes undernon linear at x_(a,b)→ax²+bx² = c. Then Quillen Network Decomposition Theorem (QNDT) was applied to sustain the non-regular routing propagation to create cluster path. Each cluster be form with co variance structure based on Two unicast 2(n+1)-Z2(n+1)-Z network. Based on the poison distribution theory X_(a,b) ≠ µ(C), at number of distribution routing strategies weights are estimated based on node response rate. Deriving shorte;'l/st path from behavioral of the node response, Hilbert -Krylov subspace clustering estimates the Cluster Head (CH) to the routing head. This solves the approximation routing strategy from the nonlinear communication depending on Max- equivalence theory (Max-T). This proposed system improves communication to construction topological cluster based on optimized level to produce better performance in distance theory, throughput latency in non-variation delay tolerant.

• Journal of applied mathematics & informatics
• /
• v.9 no.1
• /
• pp.213-230
• /
• 2002

We deal with the approximate controllability for semilinear systems with time delay in a Hilbert space. First, we show the existence and uniqueness of solutions of the given systems with the mere general Lipschitz continuity of nonlinear operator f from $R\;\times\;V$ to H. Thereafter, it is shown that the equivalence between the reachable set of the semilinear system and that of its corresponding linear system. Finally, we make a practical application of the conditions to the system with only discrete delay.

• Journal of the Korean Mathematical Society
• /
• v.58 no.3
• /
• pp.741-760
• /
• 2021

In this paper, we exhibit the equivalence between different notions of unique range sets, namely, unique range sets, weighted unique range sets and weak-weighted unique range sets under certain conditions. Also, we present some uniqueness theorems which show how two meromorphic functions are uniquely determined by their two finite shared sets. Moreover, in the last section, we make some observations that help us to construct other new classes of unique range sets.