• Journal of the Korean Mathematical Society
• /
• v.39 no.6
• /
• pp.881-898
• /
• 2002

Our aim in this paper is to introduce a generalization of some notions in homological algebra. We define the concepts of chain U-complex, U-homology, chain (U, U')-map, chain (U, U')-homotopy and $\mu$-functor. We also obtain some interesting results. We use these results to find a generalization of Lambek Lemma, Snake Lemma, Connecting Homomorphism and Exact Triangle.

• Honam Mathematical Journal
• /
• v.33 no.2
• /
• pp.187-206
• /
• 2011

The main object of this paper is to present generalization of extended beta function, extended hypergeometric and confluent hypergeometric function introduced by Chaudhry et al. and obtained various integral representations, properties of beta function, Mellin transform, beta distribution, differentiation formulas transform formulas, recurrence relations, summation formula for these new generalization.

• Honam Mathematical Journal
• /
• v.39 no.1
• /
• pp.49-59
• /
• 2017

In this paper, a generalization of the exponential integral is given. As a consequence, several inequalities involving the generalized function are derived. Among other analytical techniques, the procedure utilizes the $H{\ddot{o}}lder^{\prime}s$ and Minkowskis inequalities for integrals.

• Journal of Advanced Marine Engineering and Technology
• /
• v.21 no.1
• /
• pp.66-70
• /
• 1997

In this paper a new learning algorithm for curvature smoothing and improved generalization for multi-layer neural networks is proposed. To enhance the generalization ability a constraint term of hidden neuron activations is added to the conventional output error, which gives the curvature smoothing characteristics to multi-layer neural networks. When the total cost consisted of the output error and hidden error is minimized by gradient-descent methods, the additional descent term gives not only the Hebbian learning but also the synaptic weight decay. Therefore it incorporates error back-propagation, Hebbian, and weight decay, and additional computational requirements to the standard error back-propagation is negligible. From the computer simulation of the time series prediction with Santafe competition data it is shown that the proposed learning algorithm gives much better generalization performance.

• Journal for History of Mathematics
• /
• v.26 no.4
• /
• pp.245-257
• /
• 2013

Hermann Grassmann classified mathematics and extended the dimension of vector spaces by using dialectics of contrasts. In this paper, we investigate his mathematical idea and its background, and the process of the classification of mathematics. He made a synthetic concept of mathematics based on his idea of 'equal' and 'inequal', 'discrete' and 'indiscrete' mathematics. Also, he showed a creation of new mathematics and a process of generalization using a dialectic of contrast of 'special' and 'general', 'real' and 'formal'. In addition, we examine his unique development in using 'real' and 'formal' in a process of generalization of basis and dimension of a vector space. This research on Grassmann will give meaningful suggestion to an effective teaching and learning of linear algebra.

• Proceedings of the Korean Society of Surveying, Geodesy, Photogrammetry, and Cartography Conference
• /
• 2010.04a
• /
• pp.5-6
• /
• 2010

Needs for the methodology of segmentation of linear feature according to the shape characteristics of line feature are increasing in cartographic linear generalization. In this study, the line segmentation method using expansible moving window is presented. This method analyzes the generalization effect of line simplification algorithms depend on the line characters of linear feature and extracts the sections which show exclusively low positional error due to a specific algorithm. The description measurements of these segments are calculated and the target line data are segmented based on the measurements. For segmenting the linear feature to a homogeneous section, expansible moving window is applied. This segmentation method is expected to be used in the cartographic map generalization considering the shape characteristics of linear feature.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.25 no.6
• /
• pp.17-22
• /
• 2002

In this paper, We consider some generalization of these five basic indices to cover non-normal distribution. The proposed generalizations are compared with the five basic indices. The results show that the proposed generalizations are more accurate than those basic indices and other generalization in measuring process capability. We compared an estimation methods by Clements with based on sample percentiles WVM to calculate the proposed generalization as an example The results indicated that Clements method is more accurate than percentile method, WVM in measuring process capability But the calculations of percentile method are easy to understand, straightforward to apply, and show be valuable used for applications.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.37 no.2
• /
• pp.91-97
• /
• 2019

In automatic map generalization, the formalization of cartographic principles is important. This study proposes and evaluates the selection method for road network generalization that analyzes existing maps using reverse engineering and formalizes the selection rules for the road network. Existing maps with a 1:5,000 scale and a 1:25,000 scale are compared, and the criteria for selection of the road network data and the relative importance of each network object are determined and analyzed using $T{\ddot{o}}pfer^{\prime}s$ Radical Law as well as the logistic regression model. The selection model derived from the analysis result is applied to the test data, and road network data for the 1:25,000 scale map are generated from the digital topographic map on a 1:5,000 scale. The selected road network is compared with the existing road network data on the 1:25,000 scale for a qualitative and quantitative evaluation. The result indicates that more than 80% of road objects are matched to existing data.

• East Asian mathematical journal
• /
• v.16 no.2
• /
• pp.401-407
• /
• 2000

We give a generalization of the Bateman's polynomial $F_n(x)$ and also give two generating functions for the generalized polynomial.

• Journal of the Korean Geographical Society
• /
• v.39 no.4
• /
• pp.633-642
• /
• 2004

This study tries to generalize the stream network by constructing rule-based modelling. A study on the map generalization tends to be concentrated on development of algorithms for modification of linear features and evaluations to the limited cartographic elements. Rule-based modelling can help to improve previous algorithms by application of generalization process with the results that analyzing mapping principles and spatial distribution patterns of geographical phenomena. Rule-based modelling can be applied to generalize various cartographic elements, and make an effective on multi-scaling mapping in the digital environments. In this research, nile-based modelling for stream network is composed of generalization rule, algorithm for centerline extraction and linear features. Before generalization, drainage pattern was analyzed by the connectivity with lake to minimize logical errors. As a result, 17 streams with centerline are extracted from 108 double-lined streams. Total length of stream networks is reduced as 17% in 1:25,000 scale, and as 29% in 1:50,000. Simoo algorithm, which is developed to generalize linear features, is compared to Douglas-Peucker(D-P) algorithm. D-P made linear features rough due to the increase of data point distance and widening of external angle. But in Simoo, linear features are smoothed with the decrease of scale.