• Journal of the Chungcheong Mathematical Society
• /
• v.26 no.2
• /
• pp.315-321
• /
• 2013

Let $D_0$, $D_1{\subset}\bar{R}^n$ be non-empty sets and let ${\Gamma}$ be the family of all closed curves which join $D_0$ to $D_1$. In this note, we introduce the concept of the mathematical conductance $C({\Gamma})$ of a curve family ${\Gamma}$ and examine some basic properties of mathematical conductance. And we obtain the inequalities in connection with capacity of condensers.

• Journal of the Chungcheong Mathematical Society
• /
• v.15 no.1
• /
• pp.1-6
• /
• 2002

David Gavid [3] proved that in many familiar cases the upper semi-finite topology on the set of closed subsets of a space is the largest topology making the coincidence function continuous, when the collection of functions is given the graph topology. Considering G-spaces and taking the coincidence set to consist of points where orbits coincidence, we obtain G-version of many of his results.

• Korean Journal of Mathematics
• /
• v.12 no.1
• /
• pp.33-40
• /
• 2004

Let $E,F{\subset}(R^*)^n$ be non-empty sets and let ${\Gamma}$ be this family of all closed curves which join E to F in $(R^*)^n$. In this paper, we shall study the problems of finding properties for the conductance $C({\Gamma})$. And we obtain the inequalities in connection with capacity of condensers.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.2 no.3
• /
• pp.17-21
• /
• 1992

In this paper we consider the notion of fuzzy relation as a generalization of that of fuzzy set. For a complete Heyting algebra L. the category set(L) of all L-fuzzy sets is shown to be a bireflective subcategory of the category Rel(L) of all L-fuzzy relations and L-fuzzy relation preserving maps. We investigate categorical structures of subcategories of Rel(L) in view of quasitopos. Among those categories, we include the category L-fuzzy similarity relations with respect to both max-min and max-product compositions, respectively, as a cartesian closed topological category. Moreover, we describe exponential objects explicitly in terms of function space.

• Journal of Internet Computing and Services
• /
• v.16 no.2
• /
• pp.77-83
• /
• 2015

Frequent pattern mining, which is one of the major areas actively studied in data mining, is a method for extracting useful pattern information hidden from large data sets or databases. Moreover, frequent pattern mining approaches have been actively employed in a variety of application fields because the results obtained from them can allow us to analyze various, important characteristics within databases more easily and automatically. However, traditional frequent pattern mining methods, which simply extract all of the possible frequent patterns such that each of their support values is not smaller than a user-given minimum support threshold, have the following problems. First, traditional approaches have to generate a numerous number of patterns according to the features of a given database and the degree of threshold settings, and the number can also increase in geometrical progression. In addition, such works also cause waste of runtime and memory resources. Furthermore, the pattern results excessively generated from the methods also lead to troubles of pattern analysis for the mining results. In order to solve such issues of previous traditional frequent pattern mining approaches, the concept of representative pattern mining and its various related works have been proposed. In contrast to the traditional ones that find all the possible frequent patterns from databases, representative pattern mining approaches selectively extract a smaller number of patterns that represent general frequent patterns. In this paper, we describe details and characteristics of pattern condensing techniques that consider the maximality or closure property of generated frequent patterns, and conduct comparison and analysis for the techniques. Given a frequent pattern, satisfying the maximality for the pattern signifies that all of the possible super sets of the pattern must have smaller support values than a user-specific minimum support threshold; meanwhile, satisfying the closure property for the pattern means that there is no superset of which the support is equal to that of the pattern with respect to all the possible super sets. By mining maximal frequent patterns or closed frequent ones, we can achieve effective pattern compression and also perform mining operations with much smaller time and space resources. In addition, compressed patterns can be converted into the original frequent pattern forms again if necessary; especially, the closed frequent pattern notation has the ability to convert representative patterns into the original ones again without any information loss. That is, we can obtain a complete set of original frequent patterns from closed frequent ones. Although the maximal frequent pattern notation does not guarantee a complete recovery rate in the process of pattern conversion, it has an advantage that can extract a smaller number of representative patterns more quickly compared to the closed frequent pattern notation. In this paper, we show the performance results and characteristics of the aforementioned techniques in terms of pattern generation, runtime, and memory usage by conducting performance evaluation with respect to various real data sets collected from the real world. For more exact comparison, we also employ the algorithms implementing these techniques on the same platform and Implementation level.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.43 no.2 s.308
• /
• pp.81-92
• /
• 2006

This paper proposes a robustness watermarking for 3D mesh model based on projection onto convex sets (POCS). After designing the convex sets for robustness and invisibility among some requirements for watermarking system, a 3D-mesh model is projected alternatively onto two constraints convex sets until the convergence condition is satisfied. The robustness convex set are designed for embedding the watermark into the distance distribution of the vertices to robust against the attacks, such as mesh simplification, cropping, rotation, translation, scaling, and vertex randomization. The invisibility convex set are designed for the embedded watermark to be invisible. The decision values and index that the watermark was embedded with are used to extract the watermark without the original model. Experimental results verify that the watermarked mesh model has invisibility and robustness against the attacks, such as translation, scaling, mesh simplification, cropping, and vertex randomization.

• Journal of applied mathematics & informatics
• /
• v.42 no.3
• /
• pp.635-646
• /
• 2024

In this research work, we introduce and investigate four innovative types of soft spaces, pushing the boundaries of traditional spatial concepts. These new types of soft spaces are named as soft T_b space, soft T^#_b space, soft T^##_b space and soft_αT^#_b space. Through rigorous analysis and experimentation, we uncover and propose distinct characteristics that define and differentiate these spaces. In this research work, we have established that every soft $T_{\frac{1}{2}}$ space is a soft _αT^#_b space, every soft T_b space is a soft _αT^#_b space, every soft T^#_b space is a soft _αT^#_b space, every soft T_b space is a soft T^#_b space, every soft T^#_b space is a soft T^##_b space, every soft $T_{\frac{1}{2}}$ space is a soft ^#T_b space and every soft T_b space is a soft #T_b space.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.25 no.11
• /
• pp.1854-1862
• /
• 2001

In this paper, power flow characteristics of a hydromechanical transmission(HMT) are investigated using network analysis. The HMT used in this study consist of a hydrostatic unit(HSU), planetary gear sets, clutches and brakes providing forward 4 speeds and backward 2 speeds. Since the HMT power flows showing a closed loop and the HSU efficiency varies depending on the pressure and speed, a systematic approach is required to analyze the power transmission characteristics of the HMT. In order to analyze the closed loop power flow and the HSU power loss which changes depending on the pressure and speed, network model is constructed fur each speed range. In addition, an algorithm is proposed to calculate an accurate HSU loss corresponding to the experimental results. It is found from the network analysis that the torque and speed of each transmission element including the HSU can be obtained as well as direction of the power flow by the proposed algorithm. It is expected that the network analysis can be used in the design of relatively complicated transmission system such as HMT.

• Computers and Concrete
• /
• v.18 no.6
• /
• pp.1113-1134
• /
• 2016

A methodology using neural networks has been proposed for rapid prediction of inelastic bending moments in reinforced concrete continuous beams subjected to service load. The closed form expressions obtained from the trained neural networks take into account cracking in concrete at in-span and at near the internal supports and tension stiffening effect. The expressions predict the inelastic moments (considering the concrete cracking) from the elastic moments (neglecting the concrete cracking) at supports. Three separate neural networks are trained since these have been postulated to represent all the beams having any number of spans. The training, validating, and testing data sets for the neural networks are generated using an analytical-numerical procedure of analysis. The proposed expressions are verified for example beams of different number of spans and cross-section properties and the errors are found to be small. The proposed expressions, at minimal input data and computation effort, yield results that are close to FEM results. The expressions can be used in preliminary every day design as they enable a rapid prediction of inelastic moments and require a computational effort that is a fraction of that required for the available methods in literature.

• Journal of the Korean Geotechnical Society
• /
• v.18 no.6
• /
• pp.33-42
• /
• 2002

Ground reaction curve is a very important information for evaluating the side wall displacements and installation time of the tunnle support. The ground reaction curve can be estimated by analytical closed form solutions derived on the supposition of circular section and isotropic stress condition. The conditions of stress field and tunnel configurations, however, are quite different in practice. Therefore, it is necessary to investigate the effects of stress anisotropy and tunnel configurations in order to use simply in practical design. This paper describes a study of influence factors in the ground reaction curve. In order to evaluate the applicability of analytical closed form solution in practical design, two sets of parametric studies were carried out by numerical analysis in elastic tunnel behaviour: one set of studies investigated the influence of the K and the other set investigated the influence of the tunnel configurations such as circular and horse-shoe shape. In the studies, K value varies between 0.5 and 3.0, initial ground vertical stress varies between 5～30MPa far each K values. The results indicated that the self-supportability of ground is larger in the ground having lower K value. However, it is suggested that the applicability of closed form solution may not be adequate to determine directly the installation time of the support and self-supportability of ground. It is necessary to consider stress anisotropy and tunnel configurations.