• Kyungpook Mathematical Journal
• /
• v.58 no.4
• /
• pp.711-732
• /
• 2018

In this paper, we give a new approach to solving the 2-variable subnormal completion problem (SCP for short). To this aim, we extend the notion of recursively generated weighted shifts, introduced by R. Curto and L. Fialkow, to 2-variable case. We next provide "concrete" necessary and sufficient conditions for the existence of solutions to the 2-variable SCP with minimal Berger measure. Furthermore, a short alternative proof to the propagation phenomena, for the subnormal weighted shifts in 2-variable, is given.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.2
• /
• pp.146-156
• /
• 1998

Thispapr proposes hybrid navigation parameter estimation using sequential aerial images. The proposed navigation parameter estimation system is composed of two parts: relative position estimation and absolute position estimation. the relative position estimation recursively computes the current velocity and absolute position estimation. The relative position estimation recursively computes the current velocity and position of an aircraft by accumulating navigation parameters extracted from two succesive aerial images. Simple accumulation of parameter values decreases reliability of the extracted parameters as an aircraft goes on navigating. therefore absolute position estimation is required to compensate for position error generated in the relative position step. The absolute position estimation algorithm combining image matching and digital elevation model(DEM) matching is presented. Computer simulation with real aerial image sequences shows the efficiency of the proposed hybrial algorithm.

• East Asian mathematical journal
• /
• v.40 no.1
• /
• pp.25-36
• /
• 2024

Full univariate moment problems have been studied using continued fractions, orthogonal polynomials, spectral measures, and so on. On the other hand, the truncated moment problem has been mainly studied through confirming the existence of the extension of the moment matrix. A few articles on the multivariate moment problem implicitly presented about some results of this note, but we would like to rearrange the important results for the existence of a representing measure of a moment sequence. In addition, new techniques with orthogonal polynomials will be introduced to expand the means of studying truncated moment problems.

• Korean Journal of Computational Design and Engineering
• /
• v.1 no.3
• /
• pp.224-233
• /
• 1996

An automatic mesh generation scheme with triangular finite elements on three-dimensional surfaces has been developed. The surface triangulation process is performed as follows. To begin, surfaces with key nodes are transformed to two-dimensional planes and the meshes with triangular elements are constructed in these planes. Finally, the constructed meshes are transformed back to the original 3D surfaces. For the mesh generation, an irregular mesh generation scheme is employed in which local mesh densities are assigned by the user along the boundaries of the analysis domain. For this purpose a looping algorithm combined with an advancing front technique using basic operators has been developed, in which the loops are recursively subdivided into subloops with the use of the best split lines and then the basic operators generate elements. Using the split lines, the original boundaries are split recursively until each loop contains a certain number of key nodes, and then using the basic operators such as type-1 and type-2, one or two triangular elements are generated at each operation. After the triangulation process has been completed for each meshing domain, the resulting meshes are finally improved by smoothing process. Sample meshes are presented to demonstrate the versatility of the algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.5C
• /
• pp.403-412
• /
• 2008

This paper presents the methods which obtain the solution of Wiener-Hopf equation by LMS algorithm and get the coefficient of TDL filter in lattice filter directly. For this result, we apply an orthogonal input signal generated by lattice filter into an equivalent Wiener-Hopf equation and shows the scheme that can obtain the solution by using the MMSE algorithm. Conventionally, the method like aforementioned scheme can get an error and regression coefficient recursively. However, in this paper, we can obtain an error and the coefficients of TDL filter recursively. And, we make an theoretical analysis on the convergence characteristics of the proposed algorithm. Then we can see that the result is similar to conventional analysis. Also, by computer simulation, we can make sure that the proposed algorithm has an excellent performance.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.5 no.1
• /
• pp.3-16
• /
• 1995

In this paper, we deal with the cryptographic properties of Boolean functions generated by recursively extended methods from the points of balancedness, nonlinearity and correlation properties. First, we propose a new concept 'Strict Uncorrelated Criterion(SUC)' for two Boolean functions as a necessary condition for constructing Boolean functions of S-box which can be guaranteed to be resistant against Differential cryptanalysis, then we show that the recurively extended Boolean functions with particular form preserve the SUC. We also examine the correlation properties of Boolean functions using Walsh-Hadamard transformations and apply them to discuss nonlinearity, correlation properties and SUC of semi-bent function which is defined over odd dimensional vector space. Finally, we compare semi-bent function with Boolean functions which are generated by other similar recursive methods.

• 한국생물공학회:학술대회논문집
• /
• 2005.04a
• /
• pp.82-85
• /
• 2005

Doxorubicin is a highly-valuable anthracycline-family polyketide drug with a very potent anticancer activity, typically produced by a Gram-positive soil bacterium called Streptomyces peucetius. Thanks to the recent development of Streptomyces genomics-based technologies, the random mutagenesis approach for Streptomyces strain improvement has been switched toward the genomics-based technologies including the application of DNA microarray systems. In order to identify and characterize the genomics-driven potential target genes critical for doxorubincin overproduction, three different types of doxorubicin overproducing strains, a dnrI(doxorubicin-specific positive regulatory gene)-overexpressor, a doxA (gene involved in the conversion from daunorubicin to doxorubicin)-overexpressor, and a recursively-mutated industrial strain, were generated and examined their genomic transcription profiles using Streptomyces DNA microarray systems. The DNA microarray results revealed several potential target genes in S. peucetius genome, whose expressions were significantly either up- or down-regulated comparing with the wild-type strain. A systematic understanding of doxorubicin overproduction at the genomic level presented in this research should lead us a rational design of molecular genetic strain improvement strategy.

• Journal of applied mathematics & informatics
• /
• v.26 no.3_4
• /
• pp.673-678
• /
• 2008

Let $W_{\alpha}$, be a recursively generated quadratically hyponormal weighted shift with a weight sequence ${\alpha}$ : 1, (1, $\sqrt{x}$, $\sqrt{y}$)$^{\wedge}$. In [4] Curto-Jung showed that R = {(x,y) : $W_{1,\;(1,\;{\sqrt{x}},\;{\sqrt{y}})^{\wedge}}$ is quadratically hyponormal} is a closed convex with nonempty interior, which guarantees that there are a lot of quadratically hyponormal weighted shifts with first two equal weights. They suggested a problem computing expressions of certain extremal points of R. In this note we obtain a partial answer of their extremal problem.

• Industrial Engineering and Management Systems
• /
• v.10 no.1
• /
• pp.15-23
• /
• 2011

This research considers scheduling problems with jobs which can be divided into sub-jobs and do not required to be processed immediately following one another. Heuristic algorithms considering how to divide jobs are proposed in an attempt to find near-optimal solutions within reasonable run time. The algorithms contain two phases which are executed recursively. Phase 1 of the algorithm determines how jobs should be divided while phase 2 solves the scheduling problem given the sub-jobs established in phase 1. Simulated annealing and genetic algorithms are applied for the two phases and four heuristic algorithms are established. Numerical experiment is conducted to determine the best parameter values for the heuristic algorithms. Examples with different sizes and levels of complexity are generated. Performance of the proposed algorithms is evaluated. It is shown that the proposed algorithms are able to efficiently and effectively solve the considered problems.

• Journal of Mechanical Science and Technology
• /
• v.18 no.4
• /
• pp.550-559
• /
• 2004

In this paper, a recursive formulation for generating the equations of motion of spatial mechanical systems is presented. The rigid bodies are replaced by a dynamically equivalent constrained system of particles which avoids introducing any rotational coordinates. For the open-chain system, the equations of motion are generated recursively along the serial chains using the concepts of linear and angular momenta Closed-chain systems are transformed to open-chain systems by cutting suitable kinematic joints and introducing cut-joint constraints. The formulation is used to carry out the dynamic analysis of multi-link five-point suspension. The results of the simulation demonstrate the generality and simplicity of the proposed dynamic formulation.