• 한국도서관정보학회지
• /
• 제28권
• /
• pp.263-286
• /
• 1998

To investigate how the online searching was taught in the departments of Library and Information Science, a survey was done to the professors teaching information retrieval course. Questionnaires were mailed to 32 professors and 26 returned. Information retrieval course, one of the central course attended by almost all of the students, covers online searching in depth. Lecture, hard-on practice, and homework were three favored methods of teaching. Among the 22 topics to be covered in online teaching, respondents showed substantially higher consensus except for sections of information technology and service management. However, respondents showed big differences in hours of hand-on practice and the systems used. Free databases through Internet used dominantly. The chronic problem of terminal and communication is solved by using campus-wide facilities. But the problem of teaching assistance is serious. Based on the results, recommendations to improve online searching education are provided.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2005년도 춘계종합학술대회
• /
• pp.117-121
• /
• 2005

In this work, we first present our study on the decoding schemes for space-time block code as well as our comments on their complexity. Then, we propose a new modified complex sphere decoding scheme, which has lower computational load than that of conventional complex sphere decoders. In the proposed scheme, the boundary for searching is defined by the intersection of an approximate polygon of searching circle and disk of lattice constellation. Therefore, the proposed scheme can reduce the searching boundary and it can avoid missing searching points as well. The performance of the proposed scheme, which is verified by computer simulations, consolidates our scheme.

• Journal of information and communication convergence engineering
• /
• 제3권2호
• /
• pp.72-75
• /
• 2005

In this work, we first present our study on the decoding schemes for space-time block code as well as our comments on their complexity. Then, we propose a new modified complex sphere decoding scheme, which has lower computational load than that of conventional complex sphere decoders. In the proposed scheme, the boundary for searching is aided with the intersection of approximate polygon of searching circle and disk of constellation. Therefore, the proposed scheme can reduce the searching boundary while can avoid missing searching points. The performance of the proposed scheme is verified by computer simulation that consolidates our scheme.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1998년도 하계종합학술대회논문집
• /
• pp.781-784
• /
• 1998

An image segmentation approach based on the fuzzy worm searching and MIN-MAx clusterng algorithm is proposed in this paper. This algorithm deals with fuzzy worm value and min-max node at a gross scene level, which investigates the edge information including fuzzy worm action. But current segmentation methods based edge extraction methods generally need the mask information for the algebraic model, and take long run times at mask operation, wheras the proposed algorithm has single operation ccording to active searching of fuzzy worms. In addition, we also genetic min-max clustering using genetic algorithm to complete clustering and fuzyz searching on grey-histogram of image for the optimum solution, which can automatically determine the size of rnages and has both strong robust and speedy calculation. The simulation results showed that the proposed algorithm adaptively divided the quantized images in histogram region and performed single searching methods, significantly alleviating the increase of the computational load and the memory requirements.

• Asia pacific journal of information systems
• /
• 제12권1호
• /
• pp.1-16
• /
• 2002

Most of searching systems used by shopping-mall provide too much information for user requirements or fail to provide appropriate items reflecting customer's preference. This paper aims to design and implement the product searching systems based on customer preference which will enable efficient product selection in the internet shopping-mall. The proposed system consists of user/provider interface, searching and model agent, data management system, and model management system. Especially, we construct the searching pattern database to support fast search using association mining method. And this system includes the customer-oriented decision model which shows the highly preferred products. Input weight value per attribute and preference level should be needed to compute priority grade of preference.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2006년도 심포지엄 논문집 정보 및 제어부문
• /
• pp.111-113
• /
• 2006

DEAS is an direct searching and optimization method that based on the binary code space. It can be classified as an direct hill climbing searching. However, because of binary code space based searching, the searching in low resolution has random property. As the resolution of code increases during the search, its property of searching changes like that of hill climbing search. This paper propose a method for improving the performance of minimum seeking ability of DEAS with history information. The cost evaluation is increased. However the minimum searching ability of DEAS is improved along the same starting resolution.

• 한국문헌정보학회지
• /
• 제26권
• /
• pp.167-185
• /
• 1994

The purpose of this study is to develop the optimal user/librarian interface in information searching. In order to achive the purpose, the 150 unskilled students as subjects have participated in the study. According to the change of the subjects' psychological information states by the access points within the library system, the subjects have been classified into the five types of model: the initial information state, the accepted identification information state, the bibliographic information state, the stack information state, and the location information state. Librarian's searching support is done for 10 minutes at the each access points. To develop the optimal user/librarian interface, the expected values of the models are calculated. The resultants are as follows: 1) The expected value of the initial information states model is 18.94: 2) The expected value of the accepted identification information model is 27.06: 3) The expected value of the bibliographic information state model is 27.06: 4) The expected value of the stack information state model is 22.38: 5) The expected value of the location information state model is 22.38. Those expected values are compared with each other. The model with the lowest expected value is chosen as the optimal user/librarian interface model. In the result, the user's initial information state model of the optimal user/librarian interface in information searching is developed. In order to search the information with the most effect, user must be interfaced with the librarian at his/her own initial information state.

• 정보관리연구
• /
• 제27권2호
• /
• pp.1-32
• /
• 1996

1990년대에 들어오면서 도서관에 데이터베이스 온라인탐색 및 CD-ROM탐색이 보편화되고 이러한 뉴미디어들은 이용자의 편의성 면에서, 도서관 경영적인 측면에서, 또는 소장공간의 효율적인 측면에서 볼 때 기존의 책자형 자료보다 도입효과가 있을 것으로 기대된다. 그러나 새로운 자료를 도입하거나, 시스템을 설계할 때 비용 대 효과를 객관적으로 평가하여야 하고, 구체적인 평가지침에 근거하여 일관성 있는 장서구성을 하여야 하므로 본 연구에서는 대외경제정책연구원 정보자료실을 모델로 하여 기존문헌, CD-ROM, 온라인탐색을 비교 평가하고자 한다.

• 한국병원경영학회지
• /
• 제8권1호
• /
• pp.95-111
• /
• 2003

The purpose of this study was to evaluate the information searching behavior of consumer by type of medical institution. A questionnaire survey was conducted of 1,507 persons who were selected through a multi-stage stratified area cluster sampling in nationwide level, excluding Jeju-Do. Personal survey was conducted through door-to door survey from 27 July to 10 August 1999. The main results of this research was as following; 1. The proportion of information searching of respondents ranged from 91.5-95.2%. Even though the proportion of user in university hospital was slightly high, there was not significant statistically by type of medical institution. In terms of information source, personal informer was most common information source in all type of medical institution. Public informers were more frequently used in university hospital visitors and professional informer in general and university hospital visitors. 2. Comparing to searching intensity, user informer and professional informer's influences were more powerful, but not statistically significant. In analysis of unit influence for information source, written informer or public informer was more powerful in clinic visitor, professional informer and written informer in university hospital visitor. 3. Information which consumer want to know mostly were about on special potential and career of physician. The clinic visitor wanted to know about institutional location and kindness of medical personnel. The university hospital visitor also wanted to know about facilities and convenience of process. Comparing to institution selection criteria of consumers at 1991, quality related criteria were recognized more importantly in outpatient and dental services. But in case of inpatient services, convenience factor was recognized more importantly. In conclusion, the effort for specific marketing plan by type of medical institution should be needed. And more concern on information searching behavior of consumer will be needed.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1996년도 Proceedings of the Korea Automatic Control Conference, 11th (KACC); Pohang, Korea; 24-26 Oct. 1996
• /
• pp.235-238
• /
• 1996

In this paper, a new optimization method which is a kind of random searching is presented. The proposed method is called RasVal which is an abbreviation of Random Search Method with Variable Seaxch Length and it can search for a global minimum based on the probability density functions of searching, which can be modified using informations on success or failure of the past searching in order to execute intensified and diversified searching. By applying the proposed method to a nonlinear crane control system which can be controlled by the Universal Learning Network with radial basis function(R.B.P.), it has been proved that RasVal is superior in performance to the commonly used back propagation learning algorithm.