• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.30B no.1
• /
• pp.29-37
• /
• 1993

The purpose of this paper is to estimate the attitude and the position of SPOT satellite which are needed in producing DEM(Digital Elevation Model) using SPOT satellite image pairs. DEM extraction is consists of three parts. First part is the modeling of satellite position and atitude, second part is the matching of two images to find corresponding point of them and third part is to calculate the elevation of each point by using the result of the first and second part. For modeling inaccessible area, extended modeling algorithm which removes the GCP(Ground Control Point) most errorneous from the GCPs extracted from map iteratively is proposed According to the experiments using a collinearity equation, the second order polynomials are shown to the optimal for .omega.(pitch), and Zs parameters while the first order ones for .kappa.(yaw) .PHI.(roll), Xs, and Ys parameters. The input images used in this paper are 6000*6000 level 1A panchromatic digital SPOT images of Chungchong-do, Korea. With 30 GCPs, experiments on SPOT images show that the planimetric and altimetric RMS errors are 7.11m and 7.10m, respectively, for test points.

• Journal of applied mathematics & informatics
• /
• v.4 no.2
• /
• pp.513-528
• /
• 1997

A sort sequence $S_n$ is a sequence of all unordered pairs of indices in $I_n\;=\;{1,\;2,v...,\;n}$. With a sort sequence Sn we assicuate a sorting algorithm ($AS_n$) to sort input set $X\;=\;{x_1,\;x_2,\;...,\;x_n}$ as follows. An execution of the algorithm performs pairwise comparisons of elements in the input set X as defined by the sort sequence $S_n$, except that the comparisons whose outcomes can be inferred from the outcomes of the previous comparisons are not performed. Let $X(S_n)$ denote the acverage number of comparisons required by the algorithm $AS_n$ assuming all input orderings are equally likely. Let $X^{\ast}(n)\;and\;X^{\circ}(n)$ denote the minimum and maximum value respectively of $X(S_n)$ over all sort sequences $S_n$. Exact determination of $X^{\ast}(n),\;X^{\circ}(n)$ and associated extremal sort sequenes seems difficult. Here, we obtain bounds on $X^{\ast}(n)\;and\;X^{\circ}(n)$.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.2
• /
• pp.566-578
• /
• 2018

In this paper, we design a segment training based individual channel estimation (STICE) scheme for the classical two-way relay network (TWRN) with multi-pair sources (MPS) and amplify-and-forward (AF). We adopt the linear minimum mean square error (LMMSE) channel estimator to minimize the mean square error (MSE) without channel estimation error, where the optimal power allocation strategy from the relay for different sources is obtained. Then the MSE gains are given with different source pairs among the proposed power allocation scheme and the existing power allocation schemes. Numerical results show that the proposed method outperforms the existing ones.

• Korean Journal of Microbiology
• /
• v.29 no.2
• /
• pp.80-84
• /
• 1991

We cloned and expressed hepatitis B viral core antigen (HBcAg) gene in E. coli using $P_{L}$ promoter system. For optimal expression of the gene, we undertook the studies on the effects of the distance between Shine-Dalgarno (SD) sequence and start codon, copy number of repressor gene, induction temperature, and the stability of the core antigen. The results demonstrated that the induction at 37.deg.C was more efficient than at 42.deg.C, and the 11 base pairs (bp) distance between SD sequence and start codon of HBcAg gene was more efficient than the 15 bp distance in E. coli. The copy number of cI857 repressor gene did not influence on the expression of HBcAg, and the expression level of HBcAg in mutant type (low protease activity) and wild type strains was almost the same. The produced core antigen appeared to be HBcAg not HBeAg judged by two different radioimmunoassat (RIA) kits. This result suggested that the antigen was stable in E. coli.i.

• Korean Institute of Interior Design Journal
• /
• no.17
• /
• pp.60-64
• /
• 1998

The results of simulation on greenery ratio using CG are as follows: arrangement type of optimal condition and greenery ratio were summarized as below as dispersion type and 5% ratio greenery for 20 pairs of assessment items and these assessment items were classified into 5 factors as a result of factor analysis,. These factors were Harmony Animation Atmosphere texture Peculiarity. Verification results of factors differences according to each condition can be. there was no apparent difference among factors in accordance with gender, In case of arrangement type dispersion type was higher than concentration type in all factors. Based on the above results dispersion type was assessed higher than concentration type the most suitable condition of Harmony Factor was 5% dispersion type Animation Factor was 5% dispersion type Animation Factor was 7% dispersion type Atmosphere Factor was 10% dispersion type Texture Factor was 5% concentration type and $\ulcorner$Peculiarity Factor$\lrcorner$was 7% concentration type.

• Journal of Korean Institute of Industrial Engineers
• /
• v.32 no.3
• /
• pp.219-225
• /
• 2006

We consider a routing and wavelength assignment (RWA) for the efficient operation of WDM networks. For a given physical network, a set of selected pairs of nodes, the number of required connections for each selected pair of nodes, and a set of available wavelengths, the RWA is to realize as many connections as possible without wavelength collision. We give an integer programming formulation and an algorithm based on column generation. Though the proposed algorithm does not guarantee optimal solutions, test results show that the algorithm gives probably good solutions.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.5 no.1
• /
• pp.39-51
• /
• 1980

This paper deals with the problem of determining the capacity expansion timing and sizes of conduits and feeder cables for a given cable network configuration of a single exchange ares, which minimizes the present worth of total costs. The planning horizon is infinite and the demand of line pairs at each cabinet is assumed to be determininstically growing. As a solution method, the heuristic branch-and-bound algorithm of Freidenfelds and Mclaughlin is elaborated by adding details and some minor modifications, which generates a good near-optimal solution with far less computation than would otherwise be possible. We also develop a computer program, which is shown to be effective and efficient through the test run of an illustrative example.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.26 no.1
• /
• pp.33-44
• /
• 2001

In this paper, we address a problem of traffic grooming and wavelength routing in all optical WDM ring networks. Given a traffic demand for each node pair, we should aggregate the traffic onto lightpaths between pairs of nodes to transport the demand, and set up the routing path for each lightpath with minimum number of wavelengths to be assigned to lightpaths. In this paper, we formulate our problem as a mixed Integer Programming model. Owing to the problem complexity, it is hard to find an optimal solution for our problem. hence, we develop a heuristic algorithm to solve our problem efficiently. From the computational experiments, we can find the proposed heuristic is very satisfactory in both the computation time and the solution quality generated.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.13 no.2
• /
• pp.268-274
• /
• 2010

A steganographic method using three directional data embedding for gray images is presented in this paper. Cover image is divided into non-overlapping $2\times2$ sub-blocks and the basis pixel is selected to calculate the three different values of each sub-block. Difference values are replaced by embedding the number of secret bits that is referenced by the range table. For the three pixel pairs in the sub-block, the optimal pixel adjustment is preceded to reduce the distortion of visual quality. The experimental results show that the proposed method achieves a good visual quality and high capacity.

• Journal of the Korean Institute of Electrical and Electronic Material Engineers
• /
• v.17 no.12
• /
• pp.1341-1346
• /
• 2004

The OLED research is gone for two directions. One is material development research, and another one is structural improvement part. All two are thing to heighten luminescence efficiency of OLED. n other to improve luminescence efficiency of OLED Electron - hole pairs must consist much more in the device Their profiles are sensitive to mobility velocity of electrons and holes. In this paper, we demonstrate the difference of velocity between hole and electron by experiments, and compare with a data of simulation and experiment changing hole carrier transport layer thickness, so we get the optimal we improve luminescence efficiency. We suggest improving the efficiency of OLEDS would be to balance the injection of electrons and holes into light emission layer of the device. And, we improve understanding of the various luminescence efficiency through experiments and numerical analysis of luminescence efficiency in variable hole carrier transport layer's thickness.