• Communications of the Korean Mathematical Society
• /
• v.26 no.4
• /
• pp.611-622
• /
• 2011

The present paper deals with generalization of several families of bilinear and bilateral generating functions for the heat type polynomials suggested by Jacobi polynomials with different argument.

• Journal of the Chungcheong Mathematical Society
• /
• v.13 no.1
• /
• pp.87-94
• /
• 2000

In this paper we shall de ne a concept of ${\pi}_1$-category for a map relative to a subset which is a generalization of both the category for a map and the ${\pi}_1$-category of a space, and study some properties of the ${\pi}_1$-category for a map relative to a subset.

• Communications of the Korean Mathematical Society
• /
• v.20 no.4
• /
• pp.685-693
• /
• 2005

An aperiodic perfect map(APM) is an array with the property that every array of certain size, called a window, arises exactly once as a contiguous subarray in the array. In this article, we deal with the generalization of APM in higher dimensional arrays. First, we reframe all known definitions onto the generalized n-dimensional arrays. Next, some elementary known results on arrays are generalized to propositions on n-dimensional arrays. Finally, with some devised integer representations, two constructions of infinite family of n-dimensional APMs are generalized from known 2-dimensional constructions in [7].

• Journal of the Korean Mathematical Society
• /
• v.59 no.5
• /
• pp.1015-1045
• /
• 2022

Zagier introduced the term "strange identity" to describe an asymptotic relation between a certain q-hypergeometric series and a partial theta function at roots of unity. We show that behind Zagier's strange identity lies a statement about Bailey pairs. Using the iterative machinery of Bailey pairs then leads to many families of multisum strange identities, including Hikami's generalization of Zagier's identity.

• Kyungpook Mathematical Journal
• /
• v.63 no.4
• /
• pp.639-645
• /
• 2023

An almost Yamabe soliton is a generalization of the Yamabe soliton. In this article, we deduce some results regarding almost gradient Yamabe solitons. More specifically, we show that a compact almost gradient Yamabe soliton having non-negative Ricci curvature is trivial. Again, we prove that an almost gradient Yamabe soliton with a non-negative potential function and scalar curvature bound admitting an integral condition is trivial. Moreover, we give a characterization of a compact almost gradient Yamabe solitons.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.12
• /
• pp.4927-4945
• /
• 2020

A newfangled family of Nyquist-I pulses is proposed and named improved dual sinc pulse (IDSP). The IDSP is designed to improve performance in orthogonal frequency division multiplexing (OFDM)-based systems. The IDSP is a generalization of the dual sinc pulse (DSPP). This is because the DSP was formulated for α = 1 whereas the IDSPP is valid for 0 ≤ α ≤ 1. The behavior of the IDSP is promising in terms of its frequency and time domain responses. Theoretical and numerical outcomes indicate that the IDSP outperformed other existing pulses applied in OFDM-based systems for various key evaluation metrics.

• Computers and Concrete
• /
• v.12 no.2
• /
• pp.187-209
• /
• 2013

This paper presents a study on the prediction of transfer length of 13 mm seven-wire prestressing steel strand in pretensioned prestressed concrete members with rectangular cross-section including several material properties and design and manufacture parameters. To this end, a carefully selected database consisting of 207 different cases coming from 18 different sources spanning a variety of practical transfer length prediction situations was compiled. 16 single input features and 5 combined input features are analyzed. A widely used feedforward neural regression model was considered as a representative of several machine learning methods that have already been used in the engineering field. Classical multiple linear regression was also considered in order to comparatively assess performance and robustness in this context. The results show that the implemented model has good prediction and generalization capacity when it is used on large input data sets of practical interest from the engineering point of view. In particular, a neural model is proposed -using only 4 hidden units and 10 input variables-which significantly reduces in 30% and 60% the errors in transfer length prediction when using standard linear regression or fixed formulas, respectively.

• 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.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2015.04a
• /
• pp.351-353
• /
• 2015

공공정보 공유 및 개방, 소셜네트워크서비스의 활성화 그리고 사용자 간의 공유 데이터 증가 등의 이유로 인터넷상에 노출되는 사용자의 개인 정보가 증가하고 있다. 인터넷상에 노출된 사용자들의 개인정보들은 연결공격(linkage attack), 배경지식 공격(background attack)으로 프라이버시를 침해할 수 있다. 이를 막기 위해 관계형 데이터베이스에서는 대표적으로 k-익명성(k-anonymity)을 시작으로 l-다양성(l-diversity), t-밀집성(t-closeness)이라는 익명화 모델이 제안되었으며 계속해서 익명화 알고리즘의 성능은 개선되고 있다. 하지만 k-익명성, l-다양성, t-밀집성 모델의 조건을 만족하기 위해서는 준식별자(quasi-identifier)를 일반화(generalization)처리 해주어야 하는데 이 과정에서 준식별자의 가치를 손실된다는 단점이 있다. 본 논문에서 준식별자의 정보 손실을 최소화하기 위해 k-익명성 모델을 만족시키는 과정에서 일반화와 데이터를 삽입을 사용하는 익명화 처리하는 방법을 제안한다.

• Honam Mathematical Journal
• /
• v.26 no.1
• /
• pp.119-132
• /
• 2004

In 1965, Bhatt and Pandey have obtained an analogue of the Whipple's theorem for double series by using Watson's theorem on the sum of a $_3F_2$. The aim of this paper is to derive twenty five results for double series closely related to the analogue of the Whipple's theorem for double series obtained by Bhatt and Pandey. The results are derived with the help of twenty five summation formulas closely related to the Watson's theorem on the sum of a $_3F_2$ obtained recently by Lavoie, Grondin, and Rathie.