• Nonlinear Functional Analysis and Applications
• /
• v.29 no.1
• /
• pp.99-111
• /
• 2024

In this paper, a new seven-parameter Mittag-Leffler function of a single complex variable is proposed as a generalization of the standard Mittag-Leffler function, certain generalizations of Mittag-Leffler function, hypergeometric function and confluent hypergeometric function. Certain essential analytic properties are mainly discussed, such as radius of convergence, order, type, differentiation, Mellin-Barnes integral representation and Euler transform in the complex plane. Its relation to Fox-Wright function and H-function is also developed.

• Journal of Korean Elementary Science Education
• /
• v.23 no.3
• /
• pp.251-265
• /
• 2004

Conceptual teaming has been one of the important issue in science education, and its theory and method has been interacted with the studies of philosophy of science, cognitive science, and cognitive psychology. The last two decades have witnessed a remarkable growth of the study on brain-style computation, i.e. connectionism. This study aimed to investigate the properties of the connectionist views of the concept and its implications in the conceptual learning of science. In connectionist views, a concept was represented as a pattern of activity distributed over many connected units, and a kind of network composed of many sub-concept units. And the ＇distributed representation＇ had the features of the constructivity, the automatically generalization, and the tunability. On the base of these views, it was suggested that (ⅰ) ＇Typically-Perceived-Situation＇, a kind of mental representation rising spontaneously in an individual mind when someone is thinking about any object, should be highlighted, and (ⅱ) the roles of the sub-concept units in formation of concept and the resolution of concept into the sub-concept units should be highlighted. Finally the meanings of these implications in conceptual teaming of science are discussed.

• East Asian mathematical journal
• /
• v.25 no.2
• /
• pp.171-177
• /
• 2009

Throughout this paper, we denote that R is a near-ring and G an R-group. We initiate a study of R-substructures of G, monogenic R-groups, faithful R-groups and faithful D.G. representations of near-rings. Next, we investigate some properties of monogenic R-groups, faithful monogenic R-groups and a generalization of annihilator concepts in R-groups.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.15 no.1
• /
• pp.33-42
• /
• 2002

A method of automatic 3D tunnel modeling is proposed. The proposed method used the parametric representation of geometry and a hierarchical and relational data structure. These two bases provide the generalization and extension for 3D tunnel modeling. Especially, these two fundamentals ion the basis iota representing the characteristics of the tunnel structure for analysis. The constant-curvature characteristic is exploited to generate 3D mesh on the tunnel surface. This is attributed to the advantage that any 2D automatic mesh generation algorithm can be applied to 3D mesh modeling.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.19 no.3
• /
• pp.245-251
• /
• 2001

Nowadays, the first design elements of horizontal alignment are very important things to extension or improvement of highway. When the design elements ale lost or damaged, it is necessary to recalculation. In this paper, an investigation is made on the method of representation of horizontal alignment as a result of design element using generalization method. The results show that northing calculated about 0.2∼5 meters and easting calculated about 1∼40 meters between calculated and design data. Because the maximum value is a very small compared to total horizontal alignment length. calculated data have been fined to presentation of observed highway.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.2
• /
• pp.149-155
• /
• 2013

In these days, Entity-Relationship Model is the most popular modeling tool for designing databases, and XML is a de facto standard language for representing and exchanging data. But, because of many commercial products supporting Entity-Relationship Model use their's own representation formats, and thus it gives rise to difficulties the inter-operability between these products. In this paper, we propose an ERX, a generation tool of XML Schema from Entity-Relationship Model. ERX receives an Entity-Relationship Diagram as an input, transforms it based on transformation rules, and generates a XML Schema Definition as an output. Transformation rules contain entity set, relationship set, mapping cardinalities, and generalization.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.12 no.1
• /
• pp.43-52
• /
• 1994

This paper outlines a new approach to the line generalization when preparing small scale map on the basis of existing large scale digital map. Line generalizations are conducted based on Douglas algorithm using 1/25,000 scale topographic maps of southeastern JEJU island which produced by National Geographic Institute to analyze the fitness to the original and problems of graphical representation. Compare to the same scale map which was generated by manual method, a verity of small, but sometimes significant errors ＆ modification of topological relationship have been detected. The research gives full details of three algorithms that operationalize the smallest visible object method, together with some empirical results. A comparison of the results produced by the new algorithms with those produced by manual generalization and Douglas method of data reduction is provided. Also this paper presents the preliminary results of an relationships between the size of smallest visual object and requiring data storages for each algorithms.

• KIPS Transactions on Software and Data Engineering
• /
• v.6 no.12
• /
• pp.573-580
• /
• 2017

Deep Neural Network (DNN) is a large layered neural network which is consisted of a number of layers of non-linear units. Deep Learning which represented as DNN has been applied very successfully in various applications. However, many issues in DNN have been identified through past researches. Among these issues, generalization is the most well-known problem. A Recent study, Dropout, successfully addressed this problem. Also, Dropout plays a role as noise, and so it helps to learn robust feature during learning in DNN such as Denoising AutoEncoder. However, because of a large computations required in Dropout, training takes a lot of time. Since Dropout keeps changing an inter-layer representation during the training session, the learning rates should be small, which makes training time longer. In this paper, using mutation operation, we reduce computation and improve generalization performance compared with Dropout. Also, we experimented proposed method to compare with Dropout method and showed that our method is superior to the Dropout one.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.10 no.2
• /
• pp.63-71
• /
• 1992

The digital map database is often produced for multiple purposes, including mapping at multiple scales; it is increasingly rare that a base map is digitized for mapping at a single scale. The most important problems in process of line simplification in map generalization and multiple representation is that tolerance value selected for simplifying base map information must be modified as feature geometry varies within the digital file to ensure both accuracy and recognizability of graphic details on a generalized map. In this study, we explored various algorithms regarding to line simplication at many scales from a single digital file, and presents a rule by which to determine those scale at which line feature geometry might be expected to change in map representation. By applying two measured of displacement between a digitized line and its simplification, five algorithms have been evaluated. The results indicate that, of the five, the Douglas-Peucker routine produced less displacement between a line and its simplification. The research has proved to automating map simplification, incorporating numeric guidelines into digital environment about what magnitude and variation in geometric detail should be preserved as the digital data is simplified for representation at reduced map scales.

• Journal of the Korean Mathematical Society
• /
• v.50 no.1
• /
• pp.61-80
• /
• 2013

In this paper, we study ${\alpha}$-completely positive maps between locally $C^*$-algebras. As a generalization of a completely positive map, an ${\alpha}$-completely positive map produces a Krein space with indefinite metric, which is useful for the study of massless or gauge fields. We construct a KSGNS type representation associated to an ${\alpha}$-completely positive map of a locally $C^*$-algebra on a Krein locally $C^*$-module. Using this construction, we establish the Radon-Nikod$\acute{y}$m type theorem for ${\alpha}$-completely positive maps on locally $C^*$-algebras. As an application, we study an extremal problem in the partially ordered cone of ${\alpha}$-completely positive maps on a locally $C^*$-algebra.