• 한국항해항만학회지
• /
• 제33권2호
• /
• pp.143-151
• /
• 2009

The field of vehicle routing is currently growing rapidly because of many actual applications in truckload and less than truckload trucking, courier services, door to door services, and many other problems that generally hinder the optimization of transportation costs in a logistics network. The rapidly increasing number of customers in such a network has caused problems such as difficulty in cost optimization in terms of getting a global optimum solution in an acceptable time. Fast algorithms are needed to find sufficient solutions in a limited time that can be used for real time scheduling. In this paper, the nearest L-method (NLNM) is proposed to obtain a vehicle routing solution. String neighbors of different lengths were chosen, tested and compared. The applied de crossing procedure is meant to solve the routes by NLNM by giving a better solution and shorter computation time than that of NLNM with long string neighbors.

• Journal of Electrical Engineering and Technology
• /
• 제8권2호
• /
• pp.359-363
• /
• 2013

The 765kV transmission line will be maintained by live-line works for efficient operation. In order to maintain the 765kV transmission lines safely by live-line works, lineman has to know switching impulse flashover characteristics of the jumper V-strings with damaged insulators in advance. In order to know the flashover characteristics this paper carried out experimental flashover mockup tests for jumper V-string with damaged insulators in the outdoors. And it suggests flashover characteristics of the 765kV jumper V-strings also. The results will be used in estimating the safety of live working for 765kV transmission lines.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2001년도 봄 학술발표논문집 Vol.28 No.1 (A)
• /
• pp.748-750
• /
• 2001

최근 Human Genome Project(HGP)에서 사람의 염기 서열의 초안이 발표되었다. 생물체의 염기 서열을 분석하는 방법은 매우 많은데, 그 중 하나가 k-mer 분석이다. k-mer는 유전자의 염기 서열내의 길이가 k인 연속된 염기 서열이다. k-mer 분석은 염기서열이 가진 k-mer들의 빈도의 분포나 대칭성 등을 탐색하는 것이다. 그런데 유전자의 염기 서열은 대용량 텍스트이고 k가 줄 때 기존의 온메모리 알고리즘으로는 처리가 불가능하므로 효율적인 자료구조와 알고리즘이 필요하다. 본 논문에서는 패턴 일치(pattern matching)에 적합하고 외부 메모리를 지원하는 스트링 B-트리(string B-tree)를 이용한 k-mer 분석 방법을 제시하고, 그것을 구현하였으며 몇 가지 실험 결과에 대하여 기술한다.

• Nuclear Engineering and Technology
• /
• 제28권3호
• /
• pp.280-289
• /
• 1996

The pressure drop of twelve fuel bundle string in the CANDU-6 fuel channel is equal to the sum of the eleven junction pressure losses, the bundle string entrance and exit pressure losses, the skin friction pressure loss, and other appendage pressure losses, where the junction loss is dependent on the bundle end faces and angular alignments of the junctions. The results of the single junction pressure drop tests in a short rig show that the most probable pressure drop of the eleven junctions was analytically equal to the eleven times of average pressure drop of all the possible single junction pressure drops, and also that the largest and smallest junction pressure drops across the eleven junctions probably occurred only with BA and BB type junctions, respectively, where A and B denote the bundle end sides with an end-plates on which a company monogram is stamped and unstamped, respectively.

• 한국멀티미디어학회논문지
• /
• 제11권6호
• /
• pp.796-806
• /
• 2008

This paper presents a blind video watermarking algorithm that has the robustness against spatial, temporal, and SNR scalability and transcoding for the copyright protection of video contents in heterogeneous multimedia service. The proposed process of watermark embedding and detecting is accomplished on base layer for considering spatial scalability. The watermark consists of the string and the ordering number of string for considering temporal scalability. Thus, each of frames has the bitstream of one character and a ordering number of its character. To robust against FGS, the proposed algorithm quantizes low and middle frequency coefficients in ROI region of each of frames and embeds its watermark bitstream into the specific bits of the quantized coefficients. Experimental results verified that the proposed algorithm satisfies the invisibility of watermark and also has the robustness against spatial scalability, temporal scalability and FGS.

• 대한전자공학회논문지
• /
• 제23권4호
• /
• pp.557-564
• /
• 1986

This paper describes a standard cell placement strategy which consists of three kconsecutive steps` initial placement, iterative placement improvement, and string placement. In the initial placement step, cell placement was done by solving the linear ordering problem for a one-dimensional layout of standard cells and then zigzaging the resultant linear order width in the chip plane. The iterative placement improvement step is based on the iterative pairwise interchange using the estimated total routing length as a figure-or -merit. The string placement is used to reorder cells and terminals in each etandard cell row such that channel routing in the adjacent channels is not blocked by cyclic constraints and needs fewer routing tracks. The placement program is coded in PASCAL and kimplemented on a VAX-11/750 computer. Experimental results for several examples are included.

• Kyungpook Mathematical Journal
• /
• 제43권4호
• /
• pp.567-577
• /
• 2003

In this paper, we classify the Steinhaus graphs with minimum degree two.

• 천문학회보
• /
• 제33권1호
• /
• pp.85.1-85.1
• /
• 2008

• 한국언어정보학회:학술대회논문집
• /
• 한국언어정보학회 1995년도 Language, Information and Computation = Proceedings of the 10th Pacific Asia Conference, Hong Kong
• /
• pp.261-266
• /
• 1995

• 한국전산유체공학회:학술대회논문집
• /
• 한국전산유체공학회 2008년도 12th Asian Congress of Fluid Mechanics
• /
• pp.73.2-73.2
• /
• 2008