• Journal of the Korea Computer Industry Society
• /
• v.4 no.12
• /
• pp.901-910
• /
• 2003

Generally, most commercial retrieval engines adopt boolean query as user's query type. Although boolean query is useful to retrieval engines that need fast retrieval, it is not easy for user to express his demands with boolean operators. So, many researches have been studied for decades about information retrieval systems using natural language query that is convenient for user. To retrieve documents that are suitable for user's demands, they have to express their demands correctly, So, this thesis proposes interactive query process agent using natural language. This agent expresses demands concrete through gradual interaction with user, When users input a natural language Query, this agent analyzes the query and generates boolean query by selecting proper keyword and feedbacks the state of the keyword selected. If the keyword is a synonymy or a polysemy, the agent expands or limits the keyword through interaction with user. It makes user express demands more concrete and improve system performance. So, this agent can improve the precision of Information Retrieval.

• Proceedings of the Korean Society of Machine Tool Engineers Conference
• /
• 2004.10a
• /
• pp.382-387
• /
• 2004

As the increasing needs in the industrial filed, many studies for the 3D CAD system are carried out. There are two types of 3D CAD system. One is manifold modeler, the other is non-manifold modeler. In the manifold modeler only 3D objects can be modeled. In the non-manifold modeler 3D, 2D, 1D, and 0D objects can be modeled in a unified data structure. Recently there are many studies on the non-manifold modeler. Most of them are focused on finding unknown topological entities and representing all kinds of topological entities found. In this paper, efficient data structure is selected. The boundary information on a face and an edge is included in this data structure. The boundary information on a vertex is excluded considering the frequency of usage. Because the disk cycle information is not required in most case of modeling. It is compact. It stores essential non-manifold information such as loop cycle and radial cycle. A suitable Euler-Poincare equation is studied and selected. Using the efficient data structure and the selected Euler-Poincare equation, 18 basic Euler operators are implemented. Several 3D models are created using the implemented modeler. A non-manifold modeling can be carried out using the implemented 3D CAD system. The results of this paper could be used in the further studies such as an implementation of Boolean operators, and a translation of 2D CAD drawings to 3D models.

• Journal of the Korean Society for information Management
• /
• v.13 no.1
• /
• pp.173-185
• /
• 1996

In this paper, we propose four optimizing methods for effectively processing queries in the Booleam information retrieval system ; (i) the short-circuit evaluation scheme used for optimizing logical expressions in programming lan-guages is applied to Boolean queries.(II) use the difference of the number of index word frequencies appearing in the related documents. (IIi) reduce the number of operators in the queries by applying the distribution law in the set theory. (iv) evaluate only once for the repeated expressions in the query. These methods have been implemented and tested in KRISTAL-II system on the UNIX workstation environment.

• Korean Journal of Cognitive Science
• /
• v.2 no.1
• /
• pp.193-204
• /
• 1990

This paper discusses a reasoning model of information retrieval with a hierarchical thesaurus.The model computes the conceptual distance between a query and an object,both are indexed with weighted terms from a hierarchical thesaurus. The proposed model allows Boolean operators for user queries and edge weights for a hierarchical thesaurus. Experimental results have shown that the proposed model simulates, with surprising accuracy, people in the assessment of conceptual closeness between queries objects.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.7 no.7
• /
• pp.1556-1562
• /
• 2003

In this paper, a new representations of extended threshold Boolean filter(ETBF), called SA filter, is introduced. The structure of this representations is a one of multistage filters. The first stage is subfilters of nonlinear filters such as maximum, minimum, or exclusive-OR operators. The second stage is linear combination of Int stage outputs. Although the structure of this representations is very similar to SAM filters, SA filters encampass all ETBF not subset of ETBF.

• Journal of the Korean Society for Library and Information Science
• /
• v.32 no.3
• /
• pp.5-22
• /
• 1998

This study compared whether there are significant differences of searching characteristics between the subject specialists and professional searchers in education in terms of internet search engines. The major findings and conclusions from the study are as follows. Subject specialists used more search terms and Boolean operators and spent more times on the computers than professional searchers. However, professional searchers retrieved more relevant documents and had higher precision ratios than subject specialists.

• Journal of Korean Library and Information Science Society
• /
• v.21
• /
• pp.253-289
• /
• 1994

The purpose of this study is about the search pattern of LINNET (Library Information Network System) OPAC users by transaction log, maintained by POSTECH(Pohang University of Science and Technology) Central Library, to provide feedback information of OPAC system design. The results of this study are as follows. First, for the period of this analysis, there were totally 11, 218 log-ins, 40, 627 transaction logs and 3.62 retrievals per a log-in. Title keyword was the most frequently used, but accession number, bibliographic control number or call number was very infrequently used. Second, 47.02% of OPAC, searches resulted in zero retrievals. Bibliographic control number was the least successful search. User displayed 2.01% full information and 64.27% local information per full information. Third, special or advanced retrieval features are very infrequently used. Only 22.67% of the searches used right truncation and 0.71% used the qualifier. Only 1 boolean operator was used in every 22 retrievals. The most frequently used operator is 'and (&)' with title keywords. But 'bibliographical control number (N) and accessionnumber (R) are not used at all with any operators. The causes of search failure are as follows. 1. The item was not used in the database. (15, 764 times : 79.42%). 2. The wrong search key was used. (3, 761 times : 18.95%) 3. The senseless string (garbage) was entered. (324 times : 1.63%) On the basis of these results, some recommendations are suggested to improve the search success rate as follows. First, a n.0, ppropriate user education and online help function let users retrieve LINNET OPAC more efficiently. Second, several corrections of retrieval software will decrease the search failure rate. Third, system offers right truncation by default to every search term. This methods will increase success rate but should considered carefully. By a n.0, pplying this method, the number of hit can be overnumbered, and system overhead can be occurred. Fourth, system offers special boolean operator by default to every keyword retrieval when user enters more than two words at a time. Fifth, system assists searchers to overcome the wrong typing of selecting key by automatic korean/english mode change.

• Journal of the Korean Society for Library and Information Science
• /
• v.32 no.4
• /
• pp.209-225
• /
• 1998

This research focuses on how users behave when they search by subject using online public access catalog(OPAC). Major findings are as follows. 1)Main access poults are subject field$(55.2\%)$and title field$(42.2\%)$. 2) The search failure rate in subject searching is $59.3\%$. 3) Ma]or reasons for subject search failures are two-fold : use of inappropriate search terms $(48.5\%)$ and non-use of Boolean Operators$(42.5\%)$. 4) In order to overcome search failures users tend to change originally used search terms$(42.0\%)$ and search fields$(33.8\%) into different ones.

• Journal of the Korean Society for Precision Engineering
• /
• v.13 no.7
• /
• pp.100-114
• /
• 1996

In order to create a solid model more efficiently for a plastic or sheet metal product with a thin and constant thickness, various methods have been proposed up to now. One of the most typical approaches is to create a sheet model initially and then transform it into a solid model automatically for a given thickness. The sheet model as well as the transitive model in sheet modeling procedure is a non-manifold model. However, the previous methods adopted the boundary representations for a solid model as their topological framework. Thus, it is difficult to represent the exact adjacency relationship between topological entities and to implement the topological operations for sheet modeling and the transformation procedure of a sheet into a solid. In this paper, we proposed a sheet modeling system based on a non-manifold topological representation which can represent solids, sheets, wireframes, and their mixture. A set of generalized Euler operators for non-manifold topology as well as the sheet modeling capabilities including adding, bending, and punching functions are provided for easy modeling of sheet objects, and they are perfomed interactively with a two dimensional curve editor. Once a sheet model is completed, it can be transformed into a solid automatically. The transformation procedure is composed of the offset functions and the Boolean operations of sheet models, and it is even more comprehensive and easier to be implemented than the precious methods.

• Journal of the Korean Society for information Management
• /
• v.1 no.1
• /
• pp.25-42
• /
• 1984

The intellectual organization of information for storage and retrieval is one of the problem areas of information science. But the most of the methods have been developed are based on the coordination of keywords by Boolean logic or traditional classification systems. It is necessary to include in indexing process not just concepts or keywords, but also to express explicitly the relationship between them. Farradane believed that such a system should be founded on the psychology of thinking and developed an outline structure for concept organization and a series of explicit relations. The system of relational operators provides nine symbols which enable the semantic relationship between any two concepts to be explicitly specified in a analet. With the addition of the permutations of such analets, formed according to simple rules, alphabetical arrangement of the first term provides a complete logical subject index. Relational indexing as the basis of an indexing language has the potential to offer improved retrieval performance.