• 한국비블리아학회지
• /
• 제13권1호
• /
• pp.43-57
• /
• 2002

정보와 지식이 생산요소로서 인식되는 지식경영 환경에서 기업이 필요로 하는 많은 지식과 정보를 인터넷에서 쉽고 효과적으로 수집하기 위한 방법을 찾고자 하였다. 연구결과 인터넷에서 일반 검색엔진에 의한 경쟁정보 수집은 매우 부정적으로 나타났다. 이를 대처하기 방안으로 특정사이트를 집중 검색하거나 혹은 맞춤 정보서비스를 받거나 혹은 검색엔진의 제한기능을 활용하는 방법을 제시하였다.

• 보건행정학회지
• /
• 제23권3호
• /
• pp.266-280
• /
• 2013

Background: Information asymmetry between physicians and patients is one of the most unique characteristics of health care. But as consumerism spreads in health care sector, health care consumers are searching comparative information about quality and cost of providers from many information sources. Providing comparative information to health care consumers not only makes consumers choose hospital rationally, but also invigorates the health care market by providers' competition. However there are few studies regarding information searching behavior of health care consumers, then this study is carried out. Methods: The purpose of this study is to understand the information searching behavior of health care consumers based on their characteristics and the types of medical institutions. For this purpose, 313 spinal patients' data of 11 medical institutions (university hospital, spine specialized hospital, clinic) located in Seoul were collected by self-administered surveys. Results: The results of this study are as follows: 1) t-test/analysis of variance analysis showed that according to various characteristics of health care consumers and the types of medical institutions, the level of information searching of each source and the amount of information searching and searching outcomes are statistically different. 2) Regression analysis showed that influence on searching outcomes are statistically different according to the level of information searching of each source and searching content and the amount of information searching has positive effects on searching outcomes. Conclusion: The significance of this study is to provide empirical basis for establishment of health care policy reflecting information needs and preference of health care consumers.

• 전자공학회논문지CI
• /
• 제38권4호
• /
• pp.50-58
• /
• 2001

영상정보는 시각적이며, 공간적인 정보로 멀티미디어에서 가장 많이 사용되고, 저장과 출력 방식의 다양성, 대용량, 공간관계 표현 및 비정형적이라는 특징을 갖는다. 따라서 이러한 영상데이터의 효율적인 저장, 관리 및 검색기법에 대한 다양한 연구가 진행 중에 있고 최근 멀티미디어 환경에서의 내용기반의 검색에 관한 MPEG-7이라는 국제적인 표준화 움직임이 일어나고 있다. 특히 다량의 영상정보를 데이터베이스에 저장하고 효율적으로 질의.검색할 수 있는 실용화된 영상검색 시스템이 아직 일반화되어 있지 않으므로 보다 효과적인 영상 데이터베이스 검색 시스템의 구현에 대한 연구가 중요한 과제이다. 현재 텍스트기반의 영상 검색시스템은 상당히 연구가 진행되어 있으나, 많은 단점으로 인하여 최근에는 내용기반의 검색시스템에 대한 많은 연구가 진행중이다. 본 연구에서는 기존의 시스템에서 많이 사용하던 DCT기법 대신 영상처리에서 많이 사용하고 있는 wavelet변환을 사용하여 영상의 압축과 특징벡터를 추출하여 기존의 방법과 같고 정확한 결과를 얻을 수 있었다.

• 대한기계학회논문집A
• /
• 제27권5호
• /
• pp.681-687
• /
• 2003

Terrain surfaces have to be modeled in very detail and wheel-surface contacting geometry must be well defined in order to obtain proper ground-reaction and friction forces fur realistic simulation of off-road vehicles. Delaunay triangulation is one of the most widely used methods in modeling 3-dimensional terrain surfaces, and the T-search is a relevant algorithm for searching resulting triangular polygons. The T-search method searches polygons in a successive order and may not allow real-time computation of off-road vehicle dynamics if the terrain is modeled with many polygons, depending on the computer performance used in the simulation. The dynamic T-search, which is proposed in this paper, combines conventional T-search and the concept of the dynmaic-window search which uses reduced searching windows or sets of triangular surface polygons at each frame by taking advantage of the information regarding dynamic charactereistics of a simulated vehicle. Numerical tests show improvement of searching speeds by about 5% for randomly distributed triangles. For continuous search following a vehicle path, which occurs in actual vehicle simulation, the searching speed becomes 4 times faster.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2007년도 하계종합학술대회 논문집
• /
• pp.383-384
• /
• 2007

In this paper, we propose the new and simple method for sub-pixel block search algorithm by only using integer-pixel for motion estimation and compensation. In many papers, the fast search block match algorithms based on TSS have been proposed. However, these methods could be achieved a little reduction of the computational complexity. All of searching points by 1/4-pixel have own predicted integer-pixel SAD array. Therefor, if we know initial nine SAD values by integer, which is on the searching area of the reference frame, then we can find optimal searching point by 1/4-pixel, directly.

• 전자공학회논문지S
• /
• 제34S권5호
• /
• pp.52-65
• /
• 1997

For the degradation of severe noise and ill-conditioned blur the optimization function has the solution spaces which have many local optima around global solution. General restoration methods such as inverse filtering or gradient methods are mainly dependent on the properties of degradation model and tend to be isolated into a local optima because their convergences are determined in the convex space. Hence we introduce genetic algorithm as a searching method which will search solutions beyond the convex spaces including local solutins. In this paper we introudce improved evaluation square error) and fitness value for gray scaled images. Finally we also proposed the local fine tunign of window size and visit number for delicate searching mechanism in the vicinity of th global solution. Through the experiental results we verified the effectiveness of the proposed genetic operators and evaluation function on noise reduction over the conventional ones, as well as the improved performance of local fine tuning.

• 한국도서관정보학회지
• /
• 제9권
• /
• pp.1-31
• /
• 1982

A library catalog is most important finding tool to a library collection. This tool should be so designed as to enable users to handle with ease and convenience. Library catalog use study is necessary in order to identify the demands made on the catalog by its actual users and to measure the adequacy with which the catalog is meeting these demands. Many major catalog use surveys were performed by means of questionnaire and interview, but these methods are so difficult and perverse that the results of catalog use studies might often be far from scientific precision. The aim of this paper is to seek the guidelines with which one might assist the catalogers in providing an effective library catalog for their patrons. In order to get the first-hand information an actual survey was undertaken on searching behavior at the catalog of Jeonbug National University Library from November 30 to December 5, 1981 and from May 17 to May 22, 1982. The results of the survey can be summarized as follows: 1. Most of the students (79.77%) use the library. 2. Most of the library patrons (74.52%) use the public catalog as the searching tool to the library collection. 3. 67.85% of the catalog users are interested in searching materials written in Korean, Japanese, and Chinese. 4. 72.86% of the catalog users are interested in searching known items at catalog. 5. In known item searching, 49.44% of the catalog users choose title entry. 6. 20.17% of the catalog users are interested subject searching at the catalog. 7. Reference card is not utilized in searching. 8. For the translated items users want double entries in both vernacular and Korean. 9. At current catalog description, author, title, call number, translator, publisher and joint author are useful entry. Edition, author's date of birth and death, illustrative, size of book and bibliographical notes are not much utilized. 10. 55.39% of the catalog user need systematic guidance on how to use the library catalog and collection.

• 소음진동
• /
• 제10권5호
• /
• pp.783-791
• /
• 2000

This describes a study on the support location optimizations of the beams using the genetic algorithm and the sensitivity analysis. The genetic algorithm is a probabilistic method searching the optimum at several points simultaneously and requiring only the values of the object and constraint functions. It has therefore more chances to find the global solution and can be applied to the various problems. Nevertheless, it has such a shortcoming that it takes too many calculations, because it is ineffective in local search. While the traditional method using sensitivity analysis is of great advantage in searching the near optimum. thus the combination of the two techniques will make use of the individual advantages, that is, the superiority in global searching form the genetic algorithm and that in local searching form the sensitivity analysis. In this thesis, for the practical applications, the analysis is conducted by FEB ; and as the shapes of structures are taken as the design variation, it requires re-meshing for every analysis. So if it is not properly controlled, the result of the analysis is affected and the optimized solution amy not be the real one. the method is efficiently applied to the problems which the traditional methods are not working properly.

• International Journal of Computer Science & Network Security
• /
• 제24권5호
• /
• pp.79-88
• /
• 2024

The information retrieval domain deals with the retrieval of unstructured data such as text documents. Searching documents is a main component of the modern information retrieval system. Locality Sensitive Hashing (LSH) is one of the most popular methods used in searching for documents in a high-dimensional space. The main benefit of LSH is its theoretical guarantee of query accuracy in a multi-dimensional space. More enhancement can be achieved to LSH by adding a bit to its steps. In this paper, a new Dynamic Locality Sensitive Hashing (DLSH) algorithm is proposed as an improved version of the LSH algorithm, which relies on employing the hierarchal selection of LSH parameters (number of bands, number of shingles, and number of permutation lists) based on the similarity achieved by the algorithm to optimize searching accuracy and increasing its score. Using several tampered file structures, the technique was applied, and the performance is evaluated. In some circumstances, the accuracy of matching with DLSH exceeds 95% with the optimal parameter value selected for the number of bands, the number of shingles, and the number of permutations lists of the DLSH algorithm. The result makes DLSH algorithm suitable to be applied in many critical applications that depend on accurate searching such as forensics technology.

• 대순사상논총
• /
• 제18권
• /
• pp.123-134
• /
• 2004

The aim on this paper is to explain the present state and circumstance in the course of arranging historic classical books in China. In order to approach its purpose, it should make it clear to define the word of "The present"(當代). Furthermore, we need to take a deep notice on the arrangements itself of historic classical books, its influences and contributions, reflecting this process carefully with those historical, cultual and social points of view due to the meaning of "The present" in China. Starting from this considerate view, first of all, I would like to determine the accurate time of "The present" to be the period of time from October, 1949 to December, 2003. It can be described very suitably well as "bamboo sprouts grow fast after a rainfall"(雨後春荀). This tremendous works in the arrangements of Classics have gone through sweets and bitters of times during 50 and several years. However, this work in process has overcome so much troubles and exclude obstacles in doing so, gradually begun to bear tasteful fruit of many publications, about 10,000 works so far. Although it has gone far with very little amount of works in comparison with the remains that would be put in order in the incoming future, it succeed effectively to the spirit and soul in Chinese culture and people. Illuminating the development in its historical steps and analyzing elaborately flows in cultural and ideal elements, it is known that this work of arrangements not only give a very firm basis for excellent Chinese cultural tradition, but also extend high level of idea and thoughts in their thoughts so that build up the spirit in socialism on the solid foundation. This paper will give a explanation and analysis on this works and its contributions. At the same time, it examine and give a good, careful, and close look on the arrangement of historic classical books in China by various means of classifying into various types and style, searching for many methods, and showing indication and directions that might be right in "the present".