• Proceedings of the Korea Concrete Institute Conference
• /
• 2000.10a
• /
• pp.253-258
• /
• 2000

Recently, the area of design optimization, especially structural optimization, has been and to be a continuous active area of research. And the design optimizations of port facilities have been achieved by many other civil engineers. But the design optimization of port facilities were limited to the design optimization of the breasting dolphin. This paper invested the design optimization of mooring pier and the foundations of mooring pier was suggested considering the convenience of repair and reinforcement work. The mooring pier devised with prestressed precast concrete panel and rigid frame welded wide flange beam to steel pipe pile. To accomplish the design optimization of mooring pier, the Augmented Lagrangian Multiplier Method(ALM) of ADS(Garret N. Vanderplaats) optimization routine, BFGS method as optimizer and Golden Section Method as one dimensional search were utilized. As a result, thirty percent of material cost for construction was reduced by design optimization. The tensile stress of concrete panel and bottom flage was critical constraints under service load. So, using high strength concrete and steel will be economical. And lots of initial values must be invested to accomplish the design optimization in design procedures.

• The Bulletin of The Korean Astronomical Society
• /
• v.35 no.2
• /
• pp.37.2-37.2
• /
• 2010

The IMS (Infrared or Intermediate-wide, Medium-deep Survey) program for the search of z~7 quasars has been running since last year. In order to discover enough number of quasars at z~7, a strategy sufficing both survey area (~150 square deg.) and image depth (23 AB mag in J filter), together with using existing multi-wavelength data is chosen. We have been carrying imaging observations with the UKIRT 4m telescope, now covering ~50 square deg. (including UKIDSS survey area) of J-band data. We then used selection in color-color space to choose high-z quasar candidates having the rest-frame Ly-alpha break, and to exclude contamination from stars and galaxies at low-z. We show quasar candidates of redshift z~7 and z~6, out of 25 square deg. data analyzed, and note implications and future plans.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.6
• /
• pp.13-27
• /
• 2012

Integer programming-based local search(IPbLS) is a kind of local search based on simple hill-climbing search and adopts integer programming for neighbor generation unlike general local search. According to an existing research [1], IPbLS is known as an effective method for the multidimensional knapsack problem(MKP) which has received wide attention in operations research and artificial intelligence area. However, the existing research has a shortcoming that it verified the superiority of IPbLS targeting only largest-scale problems among MKP test problems in the OR-Library. In this paper, I verify the superiority of IPbLS more objectively by applying it to other problems. In addition, unlike the existing IPbLS that combines simple hill-climbing search and integer programming, I propose methods combining other local search algorithms like hill-climbing search, tabu search, simulated annealing with integer programming. Through the experimental results, I confirmed that IPbLS shows comparable or better performance than the best known heuristic search also for mid or small-scale MKP test problems.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.3
• /
• pp.491-498
• /
• 2016

The software defined networks implement a software network control plane, which is physically separated from the data plane. For wide area software defined network deployments, multiple controllers are required, and the placement of these controllers influences importantly the performance of the software defined networks. This paper proposes a Tabu search algorithm, which is one of the meta heuristic algorithms, for an efficient controller placement in software defined networks. In order to efficiently obtain better results, we propose new neighborhood generating operations, which are called the neighbor position move and the neighbor number move, of the Tabu search algorithm. We evaluate the performances of the proposed algorithm through some experiments in terms of the minimum latency and the execution time of the proposed algorithm. The comparison results show that the proposed algorithm outperforms the existing genetic algorithm and random method under various conditions.

• The Bulletin of The Korean Astronomical Society
• /
• v.35 no.2
• /
• pp.52.2-52.2
• /
• 2010

107P/(4015) Wilson-Harrington is one of possible candidates of the dormant or inactive comet nuclei. It was discovered on a photographic plate exposed with the 48-inch Schmidt at Palomar Observatory on 1949 November 19 UT, displaying the faint extended cometary tail. No comet activity has not been after 1949 apparition. Here we present the optical observations of 107P/(4015) Wilson - Harrington during 2009/2010 apparition taken in search of low-level comet activity. Our photometric and spectroscopic data were collected 28 - 86 days after the perihelion passage on 2009 October 22 in a wide range of solar phase angle of 39-68 degree. A disk-integrated phase function was constructed, giving a geometric albedo of 0.055+/-0.012, phase integral of q=0.34, and Bond albedo of A_B=0.019. The photometric property shows profile similar to low albedo asteroids and comet nuclei. Any emission lines were found in our spectrum, giving a flat reflectance similar to low albedo asteroids. Although we could not find any evidence for the comet activity in our photometric and spectroscopic data, we found an upper limit of the fractional active area of 0.001%. We derived the upper limit of the optical depth of the dust trail and tail 7x10^{-10}. We conclude that 107P/(4015)Wilson-Harrington became completely dormant or inactive in 2009/2010 return.

• Journal of Intelligence and Information Systems
• /
• v.17 no.3
• /
• pp.63-77
• /
• 2011

The World Wide Web is a very large distributed digital information space. From its origins in 1991, the web has grown to encompass diverse information resources as personal home pasges, online digital libraries and virtual museums. Some estimates suggest that the web currently includes over 500 billion pages in the deep web. The ability to search and retrieve information from the web efficiently and effectively is an enabling technology for realizing its full potential. With powerful workstations and parallel processing technology, efficiency is not a bottleneck. In fact, some existing search tools sift through gigabyte.syze precompiled web indexes in a fraction of a second. But retrieval effectiveness is a different matter. Current search tools retrieve too many documents, of which only a small fraction are relevant to the user query. Furthermore, the most relevant documents do not nessarily appear at the top of the query output order. Also, current search tools can not retrieve the documents related with retrieved document from gigantic amount of documents. The most important problem for lots of current searching systems is to increase the quality of search. It means to provide related documents or decrease the number of unrelated documents as low as possible in the results of search. For this problem, CiteSeer proposed the ACI (Autonomous Citation Indexing) of the articles on the World Wide Web. A "citation index" indexes the links between articles that researchers make when they cite other articles. Citation indexes are very useful for a number of purposes, including literature search and analysis of the academic literature. For details of this work, references contained in academic articles are used to give credit to previous work in the literature and provide a link between the "citing" and "cited" articles. A citation index indexes the citations that an article makes, linking the articleswith the cited works. Citation indexes were originally designed mainly for information retrieval. The citation links allow navigating the literature in unique ways. Papers can be located independent of language, and words in thetitle, keywords or document. A citation index allows navigation backward in time (the list of cited articles) and forwardin time (which subsequent articles cite the current article?) But CiteSeer can not indexes the links between articles that researchers doesn't make. Because it indexes the links between articles that only researchers make when they cite other articles. Also, CiteSeer is not easy to scalability. Because CiteSeer can not indexes the links between articles that researchers doesn't make. All these problems make us orient for designing more effective search system. This paper shows a method that extracts subject and predicate per each sentence in documents. A document will be changed into the tabular form that extracted predicate checked value of possible subject and object. We make a hierarchical graph of a document using the table and then integrate graphs of documents. The graph of entire documents calculates the area of document as compared with integrated documents. We mark relation among the documents as compared with the area of documents. Also it proposes a method for structural integration of documents that retrieves documents from the graph. It makes that the user can find information easier. We compared the performance of the proposed approaches with lucene search engine using the formulas for ranking. As a result, the F.measure is about 60% and it is better as about 15%.

• Proceedings of the Korea Electromagnetic Engineering Society Conference
• /
• 2005.11a
• /
• pp.131-136
• /
• 2005

UWB is the most spotlighted wireless technology that transmits data at very high rates using low power over a wide spectrum of frequency band. UWB technology makes it possible to transmit data at rate over 100Mbps within 10 meters. To preserve important header information, MB-OFDM UWB adopts Reed-Solomon(23,17) code. In receiver, RS decoder needs high speed and low latency using efficient hardware. In this paper, we suggest the architecture of RS decoder for MB-OFDM UWB. We adopts Modified-Euclidean algorithm for key equation solver block which is most complex in area. We suggest pipelined processing cell for this block and show the detailed architecture of syndrome, Chien search and Forney algorithm block. At last, we show the hardware implementation results of RS decoder for ASIC implementation.

• Proceedings of the Korea Society of Information Technology Applications Conference
• /
• 2005.11a
• /
• pp.195-198
• /
• 2005

UWB is the most spotlighted wireless technology that transmits data at very high rates using low power over a wide spectrum of frequency band. UWB technology makes it possible to transmit data at rate over 100Mbps within 10 meters. To preserve important header information, MBOFDM UWB adopts Reed-Solomon(23,17) code. In receiver, RS decoder needs high speed and low latency using efficient hardware. In this paper, we suggest the architecture of RS decoder for MBOFDM UWB. We adopts Modified-Euclidean algorithm for key equation solver block which is most complex in area. We suggest pipelined processing cell for this block and show the detailed architecture of syndrome, Chien search and Forney algorithm block. At last, we show the hardware implementation results of RS decoder for ASIC implementation.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.8
• /
• pp.1110-1118
• /
• 1995

Over the past few years, a wide variety of techniques have been developed which make a reliable recognition of speech signal. Multi-layer perceptron(MLP) which has excellent pattern recognition properties is one of the most versatile networks in the area of speech recognition. This paper describes an automatic speech recognition system which use both MLP and lexicon. In this system., the recognition is performed by a network search algorithm which matches words in lexicon to MLP output scores. We also suggest a recognition algorithm which incorperat durational information of each phone, whose performance is comparable to that of conventional continuous HMM(CHMM). Performance of the system is evaluated on the database of 26 vocabulary size from 9 speakers. The experimental results show that the proposed algorithm achieves error rate of 7.3% which is 5.3% lower rate than 12.6% of CHMM.

• The Journal of the Convergence on Culture Technology
• /
• v.2 no.3
• /
• pp.29-34
• /
• 2016

This study is about developing an app that offers tourist information and it was made to search festivals, camping, and glamping regions near the area. Also, by providing cooking recipe, it was made to provide convenience at the tour site. While searching recommended regions, it offers help in searching accommodations and checking in and checking out process. If the service is expanded nation-wide from the Gyeonggido area that this study was applied to, it will be more convenient for users and if the service is expanded and coupled with local coupons, quality services will be provided.