• 호남수학학술지
• /
• 제35권2호
• /
• pp.179-200
• /
• 2013

Let $C[0,t]$ denote the function space of all real-valued continuous paths on $[0,t]$. Define $X_n:C[0,t]{\rightarrow}\mathbb{R}^{n+1}$ by $Xn(x)=(x(t_0),x(t_1),{\cdots},x(t_n))$, where $0=t_0$ < $t_1$ < ${\cdots}$ < $t_n$ < $t$ is a partition of $[0,t]$. In the present paper, using a simple formula for the conditional expectation given the conditioning function $X_n$, we evaluate the $L_p(1{\leq}p{\leq}{\infty})$-analytic conditional Fourier-Feynman transform and the conditional convolution product of the cylinder functions which have the form $$f((v_1,x),{\cdots},(v_r,x))\;for\;x{\in}C[0,t]$$, where {$v_1,{\cdots},v_r$} is an orthonormal subset of $L_2[0,t]$ and $f{\in}L_p(\mathbb{R}^r)$. We then investigate several relationships between the conditional Fourier-Feynman transform and the conditional convolution product of the cylinder functions.

• 한국멀티미디어학회논문지
• /
• 제7권6호
• /
• pp.841-850
• /
• 2004

This paper proposes a GA and GDM-based method for removing unnecessary rules and generating relevant rules from the fuzzy rules corresponding to several fuzzy partitions. The aim of proposed method is to find a minimum set of fuzzy rules that can correctly classify all the training patterns. When the fine fuzzy partition is used with conventional methods, the number of fuzzy rules has been enormous and the performance of fuzzy inference system became low. This paper presents the application of GA as a means of finding optimal solutions over fuzzy partitions. In each rule, the antecedent part is made up the membership functions of a fuzzy set, and the consequent part is made up of a real number. The membership functions and the number of fuzzy inference rules are tuned by means of the GA, while the real numbers in the consequent parts of the rules are tuned by means of the gradient descent method. It is shown that the proposed method has improved than the performance of conventional method in formulating and solving a combinatorial optimization problem that has two objectives: to maximize the number of correctly classified patterns and to minimize the number of fuzzy rules.

• Korean Journal of Mathematics
• /
• 제30권4호
• /
• pp.593-601
• /
• 2022

Let C(Q) denote Yeh-Wiener space, the space of all real-valued continuous functions x(s, t) on Q ≡ [0, S] × [0, T] with x(s, 0) = x(0, t) = 0 for every (s, t) ∈ Q. For each partition τ = τ_m,n = {(s_i, t_j)|i = 1, . . . , m, j = 1, . . . , n} of Q with 0 = s₀ < s₁ < . . . < s_m = S and 0 = t₀ < t₁ < . . . < t_n = T, define a random vector X_τ : C(Q) → ℝ^mn by X_τ (x) = (x(s₁, t₁), . . . , x(s_m, t_n)). In this paper we study the conditional integral transform and the conditional convolution product for a class of cylinder type functionals defined on K(Q) with a given conditioning function X_τ above, where K(Q)is the space of all complex valued continuous functions of two variables on Q which satify x(s, 0) = x(0, t) = 0 for every (s, t) ∈ Q. In particular we derive a useful equation which allows to calculate the conditional integral transform of the conditional convolution product without ever actually calculating convolution product or conditional convolution product.

• 대한화학회지
• /
• 제11권3호
• /
• pp.105-110
• /
• 1967

액체구조의 천이상태이론을 아산화질소($N_2O$)와 사산화질소($N_2O_4$)에 적용하여 이 액체들의 상태합을 유도하였다. 이상태합들을 써서 각 액체의 몰부피, 증기압, 증발엔트로피, 임계점에서의 성질 등, 여러가지 열역학적양들을 계산한 결과 모두 실험치와 좋은 일치를 얻었다.

• 정보교육학회논문지
• /
• 제3권2호
• /
• pp.72-84
• /
• 2000

정보검색시스템은 전자문서를 효율적으로 저장하고, 정보수요자들이 요구하는 자료를 검색을 통해 빠르게 제공하기 위한 시스템으로 정보화사회에 있어서 매우 중요한 역할을 하고 있다. 특히 색인은 데이터 베이스에 저장된 문서를 효과적으로 검색하기 위한 정보검색시스템의 필수 기능이다. 본 논문에서는 교육용 문서를 적은 자원으로 짧은 시간에 색인할 수 있는 텍스트분할에 의한 색인기법을 제안한다. 제안한 색인기법은 실제 검색시스템에 적용하고, 실험을 통해 우수성을 증명한다.

• 한국정밀공학회지
• /
• 제21권4호
• /
• pp.202-209
• /
• 2004

Quality control is essential to the final product in BGA-type PCB fabrication. So, many automatic vision systems have been developed to achieve speedy, low cost and high quality inspection. A multiple threshold selection algorithm is a very important technique for machine vision based inspection. In this paper, an inspected image is modeled by using fuzzy sets and then the parameters of specified membership functions are estimated to be in maximum fuzzy entropy with the probability of the fuzzy sets, using the exhausted search method. Fuzzy c-partitions with the estimated parameters are automatically generated, and then multiple thresholds are selected as the crossover points of the fuzzy sets that form the estimated fuzzy partitions. Several experiments related to flip chip BGA images show that the proposed algorithm outperforms previous ones using both entropy and variance, and also can be successfully applied to AVI systems.

• Interaction and multiscale mechanics
• /
• 제1권1호
• /
• pp.83-101
• /
• 2008

A derivation is given of two-scale models that are able to describe deformation and flow in a fluid-saturated and progressively fracturing porous medium. From the micromechanics of the flow in the cavity, identities are derived that couple the local momentum and the mass balances to the governing equations for a fluid-saturated porous medium, which are assumed to hold on the macroscopic scale. By exploiting the partition-of-unity property of the finite element shape functions, the position and direction of the fractures are independent from the underlying discretization. The finite element equations are derived for this two-scale approach and integrated over time. The resulting discrete equations are nonlinear due to the cohesive crack model and the nonlinearity of the coupling terms. A consistent linearization is given for use within a Newton-Raphson iterative procedure. Finally, examples are given to show the versatility and the efficiency of the approach.

• Korean Journal of Mathematics
• /
• 제23권3호
• /
• pp.427-438
• /
• 2015

The Schensted algorithm first described by Robinson [5] is a remarkable combinatorial correspondence associated with the theory of symmetric functions. $Sch{\ddot{u}}tzenberger's$ jeu de taquin[10] can be used to give alternative descriptions of both P- and Q-tableaux of the Schensted algorithm as well as the ordinary and dual Knuth relations. In this paper we describe the jeu de taquin on shifted rim hook tableaux using the switching rule, which shows that the sum of the weights of the shifted rim hook tableaux of a given shape and content does not depend on the order of the content if content parts are all odd.

• 대한수학회보
• /
• 제45권4호
• /
• pp.763-780
• /
• 2008

An Ostrowski type inequality is developed for estimating the deviation of the integral mean of an absolutely continuous function, and the linear combination of its values at k + 1 partition points, on a segment of (real) linear spaces. Several particular cases are provided which recapture some earlier results, along with the results for trapezoidal type inequalities and the classical Ostrowski inequality. Some inequalities are obtained by applying these results for semi-inner products; and some of these inequalities are proven to be sharp.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권1호
• /
• pp.50-67
• /
• 2015

The Cognitive Radio (CR) paradigm in tactical ad hoc networks is an important element of future military communications for network-centric warfare. This paper presents a novel Cognitive Link State Routing protocol for CR-based tactical ad hoc networks. The proposed scheme provides prompt and reliable routes for Primary User (PU) activity through procedures that incorporate two main functions: PU-aware power adaptation and channel switching. For the PU-aware power adaptation, closer multipoint relay nodes are selected to prevent network partition and ensure successful PU communication. The PU-aware channel switching is proactively conducted using control messages to switch to a new available channel based on a common channel list. Our simulation study based on the ns-3 simulator demonstrates that the proposed routing scheme delivers significantly improved performance in terms of average end-to-end delay, jitter, and packet delivery ratio.