• Title/Summary/Keyword: Programming method

Search Result 2,564, Processing Time 0.032 seconds

Implementation of Parallel Local Alignment Method for DNA Sequence using Apache Spark (Apache Spark을 이용한 병렬 DNA 시퀀스 지역 정렬 기법 구현)

  • Kim, Bosung;Kim, Jinsu;Choi, Dojin;Kim, Sangsoo;Song, Seokil
    • The Journal of the Korea Contents Association
    • /
    • v.16 no.10
    • /
    • pp.608-616
    • /
    • 2016
  • The Smith-Watrman (SW) algorithm is a local alignment algorithm which is one of important operations in DNA sequence analysis. The SW algorithm finds the optimal local alignment with respect to the scoring system being used, but it has a problem to demand long execution time. To solve the problem of SW, some methods to perform SW in distributed and parallel manner have been proposed. The ADAM which is a distributed and parallel processing framework for DNA sequence has parallel SW. However, the parallel SW of the ADAM does not consider that the SW is a dynamic programming method, so the parallel SW of the ADAM has the limit of its performance. In this paper, we propose a method to enhance the parallel SW of ADAM. The proposed parallel SW (PSW) is performed in two phases. In the first phase, the PSW splits a DNA sequence into the number of partitions and assigns them to multiple nodes. Then, the original Smith-Waterman algorithm is performed in parallel at each node. In the second phase, the PSW estimates the portion of data sequence that should be recalculated, and the recalculation is performed on the portions in parallel at each node. In the experiment, we compare the proposed PSW to the parallel SW of the ADAM to show the superiority of the PSW.

In-Plane Extensional Buckling Analysis of Curved Beams under Uniformly Distributed Radial Loads Using DQM (등분포하중 하에서 미분구적법(DQM)을 이용한 곡선 보의 내평면 신장 좌굴해석)

  • Kang, Ki-Jun
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.19 no.7
    • /
    • pp.265-274
    • /
    • 2018
  • The increasing use of curved beams in buildings, vehicles, ships, and aircraft has prompted studies directed toward the development of an accurate method for analyzing the dynamic behavior of such structures. The stability behavior of elastic curved beams has been the subject of a large number of investigations. Solutions of the relevant differential equations have been obtained traditionally using standard finite difference or finite element methods. These techniques require a great deal of computer time as the number of discrete nodes becomes relatively large under the conditions of complex geometry and loading. One of the efficient procedures for the solution of partial differential equations is the method of differential quadrature. The differential quadrature method (DQM) has been applied to a large number of cases to overcome the difficulties of the complex algorithms of programming for the computer, as well as the excessive use of storage due to the conditions of complex geometry and loading. The in-plane buckling of curved beams considering the extensibility of the arch axis was analyzed under uniformly distributed radial loads using the DQM. The critical loads were calculated for the member with various parameter ratios, boundary conditions, and opening angles. The results were compared with the precise results by other methods for cases, in which they were available. The DQM, using only a limited number of grid points, provided results that agreed very well (less than 0.3%) with the exact ones. New results according to diverse variations were obtained, showing the important roles in the buckling behavior of curved beams, and can be used in comparisons with other numerical solutions or with experimental test data.

The Effect of C Language Output Method to the Performance of CGI Gateway in the UNIX Systems (유닉스 시스템에서 C 언어 출력 방법이 CGI 게이트웨이 성능에 미치는 영향)

  • Lee Hyung-Bong;Jeong Yeon-Chul;Kweon Ki-Hyeon
    • The KIPS Transactions:PartC
    • /
    • v.12C no.1 s.97
    • /
    • pp.147-156
    • /
    • 2005
  • CGI is a standard interface rule between web server and gateway devised for the gateway's standard output to replace a static web document in UNIX environment. So, it is common to use standard I/O statements provided by the programming language for the CGI gateway. But the standard I/O mechanism is one of buffer strategies that are designed transparently to operating system and optimized for generic cases. This means that it nay be useful to apply another optimization to the standard I/O environment in CGI gateway. In this paper, we introduced standard output method and file output method as the two output optimization areas for CGI gateways written in C language in the UNIX/LINUX systems, and applied the proposed methods of each area to Debian LINUX, IBM AIX, SUN Solaris, Digital UNIX respectively. Then we analyzed the effect of them focused on execution time. The results were different from operating system to operating system. Compared to normal situation, the best case of standard output area showed about $10{\%}$ improvement and the worst case showed $60{\%}$ degradation in file output area where some performance improvements were expected.

Intensity Based Stereo Matching Algorithm Including Boundary Information (경계선 영역 정보를 이용한 밝기값 기반 스테레오 정합)

  • Choi, Dong-Jun;Kim, Do-Hyun;Yang, Yeong-Yil
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.35S no.12
    • /
    • pp.84-92
    • /
    • 1998
  • In this paper, we propose the novel cost functions for finding the disparity between the left and the right images in the stereo matching problem. The dynamic programming method is used in solving the stereo matching problem by Cox et al[10]. In the reference[10], only the intensity of the pixels in the epipolar line is used as the cost functions to find the corresponding pixels. We propose the two new cost functions. The information of the slope of the pixel is introduced to the constraints in determining the weights of intensity and direction(the historical information). The pixels with the higher slope are matched mainly by the intensity of pixels. As the slope becomes lower, the matching is performed mainly by the direction. Secondly, the disparity information of the previous epipolar line the pixel is used to find the disparity of the current epipolar line. If the pixel in the left epipolar line, $p-i$ and the pixel in the right epipolar line, $p-j$ satisfy the following conditions, the higher matching probability is given to the pixels, $p-i$ and $p-j$. i) The pixels, $p-i$ and $p-j$ are the pixles on the edges in the left and the right images, respectively. ⅱ) For the pixels $p-k$ and $p-l$ in the previous epipolar line, $p-k$and $p-l$ are matched and are the pixels on the same edge with $p-i$ and $p-j$, respectively. The proposed method compared with the original method[10] finds the better matching results for the test images.

  • PDF

Animation Generation for Chinese Character Learning on Mobile Devices (모바일 한자 학습 애니메이션 생성)

  • Koo, Sang-Ok;Jang, Hyun-Gyu;Jung, Soon-Ki
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.33 no.12
    • /
    • pp.894-906
    • /
    • 2006
  • There are many difficulties to develop a mobile contents due to many constraints on mobile environments. It is difficult to make a good mobile contents with only visual reduction of existing contents on wire Internet. Therefore, it is essential to devise the data representation and to develop the authoring tool to meet the needs of the mobile contents market. We suggest the compact mobile contents to learn Chinese characters and developed its authoring tool. The animation which our system produces is realistic as if someone writes letters with pen or brush. Moreover, our authoring tool makes a user generate a Chinese character animation easily and rapidly although she or he has not many knowledge in computer graphics, mobile programming or Chinese characters. The method to generate the stroke animation is following: We take basic character shape information represented with several contours from TTF(TrueType Font) and get the information for the stroke segmentation and stroke ordering from simple user input. And then, we decompose whole character shape into some strokes by using polygonal approximation technique. Next, the stroke animation for each stroke is automatically generated by the scan line algorithm ordered by the stroke direction. Finally, the ordered scan lines are compressed into some integers by reducing coordinate redundancy As a result, the stroke animation of our system is even smaller than GIF animation. Our method can be extended to rendering and animation of Hangul or general 2D shape based on vector graphics. We have the plan to find the method to automate the stroke segmentation and ordering without user input.

Coping with Climage Change through Coordinated Operations of the Andong & Imha Dams (안동-임하댐 연계운영을 통한 미래 기후변화 대응)

  • Park, Junehyeong;Kim, Young-Oh
    • Journal of Korea Water Resources Association
    • /
    • v.46 no.12
    • /
    • pp.1141-1155
    • /
    • 2013
  • A number of studies have been performed to analyze climate change impacts of water resources system. In this study, a coordinated dam operation is compared with an existing operation strategy for coping with projected future runoff scenarios. GCMs (Global Circulation Models) and the LARS-WG downscaling method was used to project future climate scenarios. The water balance model called abcd was employed to estimate future runoff scenarios. The existing dam operation comes from the national dam construction guideline, which is called the "level-operation method." The alternative coordinated dam operation are constructed as a linear programming using New York City rule for refill and drawdown seasons. The results of annual total inflow in future is projected to decrease to 72.81% for Andong dam basin and 65.65% for Imha dam basin. As a result of applying future runoff scenarios into the dam operation model, the reliability of coordinated dam operation, 62.22%, is higher than the reliability of single dam operation, 46.55%. Especially, the difference gets larger as the reliability is low because of lack of water. Therefore, the coordinated operation in the Andong & Imha dams are identified as more appropriate alternative than the existing single operation to respond to water-level change caused by climate change.

Disclosure of Digitalized Information by Public Agencies (정보공개의 새로운 지향 - 전자정보공개제도(電子情報公開制度)를 중심으로 -)

  • Kyoung, Keon
    • The Korean Journal of Archival Studies
    • /
    • no.5
    • /
    • pp.111-148
    • /
    • 2002
  • Digitalization of public administration information shall be accelerated more. When information exists both in the form of electronic and paper record, even the disclosure of paper record make it possible the access to public administration information itself, but there may some needs for the disclosure of electronic record in applicant's situation. Similarly, when only electronic record exists, there may be some problem about whether to disclose the record as print-out or as being electronic format itself. Thus, the method and format of disclose are very sensitive issues, and it is very important to clarify who has the competence to decide the method and format of disclosure, applicant or the public agency. In making any record available to an applicant under the EFOIA in America, the public agency shall provide the record in any form or format requested by the applicant, if the record is readily reproducible by the agency in that form or format. And for the convenience of the applicant with sensory disability, the AIA in Canada also permits the right to access to information in an alternative format. It is desirable also in our country that disclosure of information is done by public agencies in the format that applicant wants, as possible. In the meantime, we should consider the costs and technological restrictions corresponding to the change of format of information to the format that applicant specifies. In the case of electronic record, efforts required for searching cause some hard problems. Information disclosure system requires disclosure of record that exists at the demand point, and creation of new record that does not exist at that them is not required on the public agency. For the search of electronic information, we need some code or program. So, if we evaluate that act of coding or programming as creation of new record, demand on disclosure of electronic record becomes impossible, in fact. Therefore, when we include electronic record as the object of information disclosure system, we need to clarify the degree of reasonable efforts for searching the information included in that record, as long as possible, although it is very difficult problem. Also, we should consider the way to make it permitted to demand the disclosure of electronic record by FAX or E-mail. Disclosure of electronic record itself by E-mail is not generalized yet, even in America or Canada. There are many technological and legal problems to solve, before permitting or enforcing the disclosure of electronic record by E-mail. But, it is desirable to expand the method of disclosure to including disclosure by E-mail in possible spheres. Also, as well as disclosure on demands, we need to expand electronic access to information, so far as possible, in the process of information offer.

In-Plane Extensional Vibration Analysis of Asymmetric Curved Beams with Linearly Varying Cross-Section Using DQM (미분구적법(DQM)을 이용한 단면적이 선형적으로 변하는 비대칭 곡선보의 내평면 신장 진동해석)

  • Kang, Ki-Jun
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.20 no.5
    • /
    • pp.612-620
    • /
    • 2019
  • The increasing use of curved beams in buildings, vehicles, ships, and aircraft has results in considerable effort being directed toward developing an accurate method for analyzing the dynamic behavior of such structures. The stability behavior of elastic curved beams has been the subject of a large number of investigations. Solutions of the relevant differential equations have traditionally been obtained by the standard finite difference. These techniques require a great deal of computer time as the number of discrete nodes becomes relatively large under conditions of complex geometry and loading. One of the efficient procedures for the solution of partial differential equations is the method of differential quadrature. The differential quadrature method(DQM) has been applied to a large number of cases to overcome the difficulties of the complex algorithms of programming for the computer, as well as excessive use of storage due to conditions of complex geometry and loading. In this study, the in-plane extensional vibration for asymmetric curved beams with linearly varying cross-section is analyzed using the DQM. Fundamental frequency parameters are calculated for the member with various parameter ratios, boundary conditions, and opening angles. The results are compared with the result by other methods for cases in which they are available. According to the analysis of the solutions, the DQM, used only a limited number of grid points, gives results which agree very well with the exact ones.

A Mathematical Programming Method for Minimization of Carbon Debt of Bioenergy (바이오에너지의 탄소부채 최소화를 위한 수학적 계획법)

  • Choi, Soo Hyoung
    • Clean Technology
    • /
    • v.27 no.3
    • /
    • pp.269-274
    • /
    • 2021
  • Bioenergy is generally considered to be one of the options for pursuing carbon neutrality. However, for a period of time, combustion of harvested plant biomass inevitably causes more carbon dioxide in the atmosphere than combustion of fossil fuels. This paper proposes a method that predicts and minimizes the total amount and payback period of this carbon debt. As a case study, a carbon cycle impact assessment was performed for immediate switching of the currently used fossil fuels to biomass. This work points out a fundamental vulnerability in the concept of carbon neutrality. As an action plan for the sustainability of bioenergy, formulas for afforestation proportional to the decrease in the forest area and surplus harvest proportional to the increase in the forest mass are proposed. The results of optimization indicate that the carbon debt payback period is about 70 years, and the carbon dioxide in the atmosphere increases by more than 50% at a maximum and 3% at a steady state. These are theoretically predicted best results, which are expected to be worse in reality. Therefore, biomass is not truly carbon neutral, and it is inappropriate as an energy source alternative to fossil fuels. The method proposed in this work is expected to be able to contribute to the approach to carbon neutrality by minimizing present and future carbon debt of the bioenergy that is already in use.

Scheduling of Parallel Offset Printing Process for Packaging Printing (패키징 인쇄를 위한 병렬 오프셋 인쇄 공정의 스케줄링)

  • Jaekyeong, Moon;Hyunchul, Tae
    • KOREAN JOURNAL OF PACKAGING SCIENCE & TECHNOLOGY
    • /
    • v.28 no.3
    • /
    • pp.183-192
    • /
    • 2022
  • With the growth of the packaging industry, demand on the packaging printing comes in various forms. Customers' orders are diversifying and the standards for quality are increasing. Offset printing is mainly used in the packaging printing since it is easy to print in large quantities. However, productivity of the offset printing decreases when printing various order. This is because it takes time to change colors for each printing unit. Therefore, scheduling that minimizes the color replacement time and shortens the overall makespan is required. By the existing manual method based on workers' experience or intuition, scheduling results may vary for workers and this uncertainty increase the production cost. In this study, we propose an automated scheduling method of parallel offset printing process for packaging printing. We decompose the original problem into assigning and sequencing orders, and ink arrangement for printing problems. Vehicle routing problem and assignment problem are applied to each part. Mixed integer programming is used to model the problem mathematically. But it needs a lot of computational time to solve as the size of the problem grows. So guided local search algorithm is used to solve the problem. Through actual data experiments, we reviewed our method's applicability and role in the field.