• Journal of Computing Science and Engineering
• /
• v.6 no.2
• /
• pp.161-167
• /
• 2012

Query reformulation is an interactive process of revising user queries according to the query results. To assist biomedical researchers in this process, we present novel methods for automatically generating query reformulation suggestions. While previous work on query reformulation focused on addition of words to user queries, our method can deal with three types of query reformulation (i.e., addition, removal and replacement). The accuracy of the method for the addition type is ten times better than PubMed's "Also try", while the execution time is short enough for practical use.

• Communications of Mathematical Education
• /
• v.29 no.3
• /
• pp.533-551
• /
• 2015

Problem posing in school mathematics is generally regarded to make a new problem from contexts, information, and experiences relevant to realistic or mathematical situations. Also, it is to reconstruct a similar or more complicated new problem based on an original problem. The former is called as problem generation and the latter is as problem reformulation. The purpose of this study was to explore the co-relation between problem generation and problem reformulation, and the educational effectiveness of each problem posing. For this purpose, on the subject of 33 pre-service secondary school teachers, this study developed two types of problem posing activities. The one was executed as the procedures of [problem generation${\rightarrow}$solving a self-generated problem${\rightarrow}$reformulation of the problem], and the other was done as the procedures of [problem generation${\rightarrow}$solving the most often generated problem${\rightarrow}$reformulation of the problem]. The intent of the former activity was to lead students' maintaining the ability to deal with the problem generation and reformulation for themselves. Furthermore, through the latter one, they were led to have peers' thinking patterns and typical tendency on problem generation and reformulation according to the instructor(the researcher)'s guidance. After these activities, the subject(33 pre-service teachers) was responded in the survey. The information on the survey is consisted of mathematical difficulties and interests, cognitive and affective domains, merits and demerits, and application to the instruction and assessment situations in math class. According to the results of this study, problem generation would be geared to understand mathematical concepts and also problem reformulation would enhance problem solving ability. And it is shown that accomplishing the second activity of problem posing be more efficient than doing the first activity in math class.

• Journal of the Korean Society for information Management
• /
• v.27 no.2
• /
• pp.37-60
• /
• 2010

The purpose of this study is to investigate image search query reformulation patterns in relation to image attribute categories. A total of 592 sessions and 2,445 queries from the Excite Web search engine log data were analyzed by utilizing Batley's visual information types and two facets and seven sub-facets of query reformulation patterns. The results of this study are organized with two folds: query reformulation and categorical transition. As the most dominant categories of queries are specific and general/nameable, this tendency stays over various search stages. From the perspective of reformulation patterns, while the Parallel movement is the most dominant, there are slight differences depending on initial or preceding query categories. In examining categorical transitions, it was found that 60-80% of search queries were reformulated within the same categories of image attributes. These findings may be applied to practice and implementation of image retrieval systems in terms of assisting users' query term selection and effective thesauri development.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.4
• /
• pp.963-972
• /
• 1997

In imformation retrival, query reformulation algorithms construct querise from a set of intial input and feedback documents, and retrieval performance cna be varied by different sets of input documents. In this study, we developed a criterion for measuring the performance sensitivity of query reformulation algorithms to unput sets. In addition, we also propose a way of mesuring the changes in retrived area, (CIRA) during qucry reformulation. We cimpared CIRAs of query refromulation algorithms (i.e., query tree, DNF method, and Dillon's method) using three test sets:the CACM, CISI, and Medlars. In the experiments, the query tree showed the highest decreasing CIRA during refirmulations, which means the fastest convergence rate to an output set. For sensitivity analysis, the query tree sored the highest sensitivity to different input sets even though its differences to the tther algorithms are very small.

• Korean System Dynamics Review
• /
• v.14 no.3
• /
• pp.5-23
• /
• 2013

This paper explores a structural mechanism underlying governmental reformulation. Studying cases of governmental reorganizations occurred during past 60 years, this paper constructs a causal map containing a principle of small government, an integrative organization of the government, and a committee organization. A positive feedback loop linking these factors produces an increase in the number of the committee organization in the government. Also, this paper points out that there might be a hidden self fullfilling prophecy that reinforces the principle of small government. Open experiment toward a big government is proposed to overcome the vicious circle of small government curse.

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

The purpose of this study is to identify how users react with the search options and bibliographic information during search reformulation on the online catalog. Two online catalogs(N0TIS system and Dynix system) were selected and undergraduate students were recruited as the participants for this study. The study shows that the search options and bibliographic information affected the type of the query reformulation and the re-choice of the search options during search.

• Korean Journal of Mathematics
• /
• v.22 no.2
• /
• pp.325-337
• /
• 2014

In 1911 Schur[6] derived degree and character formulas for projective representations of the symmetric groups remarkably similar to the corresponding formulas for ordinary representations. Morris[3] derived a recurrence for evaluation of spin characters and Stembridge[8] gave a combinatorial reformulation for Morris' recurrence. In this paper we give combinatorial interpretations for the orthogonality relations of spin characters based on Stembridge's combinatorial reformulation for Morris' rule.

• Bulletin of the Korean Chemical Society
• /
• v.23 no.7
• /
• pp.971-984
• /
• 2002

The multichannel quantum defect theory (MQDT) is reformulated into the form of the configuration mixing (CM) method using the geometrical construction of the S matrix developed for the system involving two open and one closed channels. The reformulation is done by the phase renormalization method of Giusti-Suzor and Fano. The rather unconventional short-range reactance matrix K whose diagonal elements are not zero is obtained though the Lu-Fano plot becomes symmetrical. The reformulation of MQDT yields the partial cross section formulas analogous to Fano's resonance formula, which has not easily been available in other's work.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1992.04b
• /
• pp.232-232
• /
• 1992

• Journal of the Korean Operations Research and Management Science Society
• /
• v.23 no.4
• /
• pp.141-149
• /
• 1998

One of the difficulties in using the current Boolean-based information retrieval systems is that it is hard for a user, especially a novice, to formulate an effective Boolean query. One solution to this problem is to let the system formulate a query for a user from his relevance feedback documents in this research, an intelligent query reformulation mechanism based on ID3 is proposed and the sensitivity of its retrieval effectiveness, i.e., recall, precision, and E-measure, to various input settings is analyzed. The parameters in the input settings is the number of relevant documents. Experiments conducted on the test set of Medlars revealed that the effectiveness of the proposed system is in fact sensitive to the number of the initial relevant documents. The case with two or more initial relevant documents outperformed the case with one initial relevant document with statistical significances. It is our conclusion that formulation of an effective query in the proposed system requires at least two relevant documents in its initial input set.