• Title/Summary/Keyword: Historical query

Search Result 31, Processing Time 0.022 seconds

Automated Essay Grading: An Application For Historical Malay Text

  • Syed Mustapha, S.M.F.D;Idris, N.
    • Proceedings of the Korea Inteligent Information System Society Conference
    • /
    • 2001.01a
    • /
    • pp.237-245
    • /
    • 2001
  • Automated essay grading has been proposed for over thirty years. Only recently have practical implementations been constructed and tested. This paper investigated the role of the nearest-neighbour algorithm within the information retrieval as a way of grading the essay automatically called Automated Essay Grading System. It intended to offer teachers an individualized assistance in grading the student\`s essay. The system involved several processes, which are the indexing, the structuring of the model answer and the grade processing. The indexing process comprised the document indexing and query processing which are mainly used for representing the documents and the query. Structuring the model answer is actually preparing the marking scheme and the grade processing is the process of assessing the essay. To test the effectiveness of the developed algorithms, the algorithms are tested against the History text in Malay. The result showed that th information retrieval and the nearest-neighbour algorithm are practical combination that offer acceptable performance for grading the essay.

  • PDF

Ontology Versions Management on the Semantic Web

  • Yun, Hong-Won
    • Journal of information and communication convergence engineering
    • /
    • v.2 no.1
    • /
    • pp.26-31
    • /
    • 2004
  • In the last few years, The Semantic Web has increased the interest in ontologies. Ontology is an essential component of the semantic web. Ontologies continue to change and evolve. We consider the management of versions in ontology. We study a set of changes based on domain changes, changes in conceptualization, metadata changes, and temporal dimension. In many cases, we want to be able to search in historical versions, query changes in versions, retrieve versions on the temporal dimension. In order to support an ontology query language that supports temporal operations, we consider temporal dimension includes transaction time and valid time. Ontology versioning brings about massive amount of versions to be stored and maintained. We present the storage policies that are storing all the versions, all the sequence of changed element, all the change sets, the aggregation of change sets periodically, and the aggregation of change sets using a criterion. We conduct a set of experiments to compare the performance of each storage policies. We present the experimental results for evaluating the performance of different storage policies from scheme 1 to scheme 5.

A Network-based Indexing Method for Trajectories of Moving Objects on Roads (도로 위에 존재하는 이동객체의 궤적에 대한 네트워크 기반의 색인 방법)

  • Kim, Kyoung-Sook;Li, Ki-Joune
    • The KIPS Transactions:PartD
    • /
    • v.13D no.7 s.110
    • /
    • pp.879-888
    • /
    • 2006
  • Recently many researchers have focused on management of Historical trajectories of moving objects in Euclidean spaces due to numerous sizes of accumulated data over time. However, the movement of moving objects in real applications generally has some constraints, for example vehicles on roads can only travel along connected road networks. In this paper, we propose an indexing method for trajectories of moving objects on road networks in order to process the network-based spatiotemporal range query. Our method contains the connect information of road networks to use the network distance for query processing, deals with trajectories which are represented by road segments in road networks, and manages them using multiple R-trees assigned per each road segment. Furthermore, it has a structure to be able to share R-tree among several road segments in large road networks. Consequently, we show that our method takes about 30% less in node accesses for the network-based spatiotemporal range query processing than other methods based on the Euclidean distance by experiments.

From Jane Eyre to Eliza Doolittle: Women as Teachers

  • Noh, Aegyung
    • Journal of English Language & Literature
    • /
    • v.64 no.4
    • /
    • pp.565-584
    • /
    • 2018
  • The pedagogical dynamic dramatized in Shaw's Pygmalion, which sets man as a distinct pedagogical authority and woman his subject spawning similarly patterned plays many decades later, has been relatively overlooked in the play's criticism clouded by its predominantly mythical theme. Shaw stages Eliza's pedagogical subordination to Higgins followed by her Nora-esque exit with the declaration, "I'll go and be a teacher." The central premise of this article is that the pioneering modern playwright and feminist's pedagogical rewriting of A Doll's House sets out a historical dialogue between Eliza, a new woman who repositions herself as a teacher renouncing her earlier subordinate pedagogical position that is culturally ascribed to women while threatening to replace her paternal teacher, and her immediate precursors, that is, Victorian women teachers whose professional career was socially "anathematized." Through a historical probe into the social status of Victorian women teachers, the article attempts to align their abortive career with Eliza's new womanly re-appropriation of the profession of teaching. With Pygmalion as the starting point of its query, this article conducts a historical survey on the literary representation of pedagogical women from the mid to late Victorian era to the turn of the century. Reading a wide selection of novels and plays alongside of Pygmalion (1912), such as Jane Eyre (1847), A Doll's House (1879), An Enemy of the People (1882), The Odd Women (1893), and The Importance of Being Earnest (1895), it contextualizes Eliza's resolution to be a teacher within the history of female pedagogy. This historical contextualization of the career choice of one of the earliest new women characters in modern drama helps appraise the historical significance of such choice.

$SR^2DBS$: 시간 지원 데이터베이스 시스팀에 관한 연구

  • Kim, Gwang-Hun;Gang, Tae-Gyu;Kim, In-Su
    • ETRI Journal
    • /
    • v.11 no.2
    • /
    • pp.120-136
    • /
    • 1989
  • 최근의 데이터 베이스 응용분야에 있어서 시간에 따른 정보의 변화를 유지관리할 필요성이 대두되고 대용량의 기억장치 가격의 급속한 감소와 함께 이의 이용 기술이 향상되면서 시간주기에 따라 실세계의 상태에 대한 변경과정을 표현하는 시간 즉, 데이터의 변경이력을 지원하는 데이터베이스(Terporal Database)에 관심이 집중되고 있으며, 이러한 요구를 만족시키기 위한 여러 방법들이 연구되고 있다. 일반적으로 시간 지원 데이터베이스 모델은 지원되는 시간의 형태에 따라 Static, Static Rollback, Historical, Temporal, Revision 데이터베이스 모델로 나뉘어진다. 본 논문에서는 시간 및 변경이력을 지원하기 위한 데이터베이스 모델과 이를 위한 데이터베이스 시스템의 주요 설계 Issue들에 관하여 조사분석한 다음, Static Rollback 데이터베이스 모델을 기본으로 하는 "$SR^2DBS$: 시간 지원 데이터베이스 시스팀"의 설계 및 구현에 관하여 기술하였다. $SR^2DBS$은 기존의 관계형 데이터 베이스 시스팀"의 모델을 시간 애트리뷰트를 추가시킴으로서 데이터 베이스의 변경이력관리를 가능케 한 Direct Manipulation Database Processing System으로 데이터베이스의 현상태 뿐만 아니라 시간에 따른 변경이력에 대해서 Screenoriented Relation Browsing & Editing 기능을 제공하며, 다음과 같은 특징을 갖는다. - Screen oriented Processing - Directi-Manipulation of Objects - Object & Revision History of Interest Visibility - Rapid Reversible Actions - Transaction Time & Revision Number Supporting - Roll-back Query Supporting - Han-gul Data Supporting - Two level Storage Structure(Current Version & History Versions)

  • PDF

An Efficient Real Time Processing Method for Frequently Updated Data (빈번한 변경이 요구되는 데이터의 효율적인 실시간 처리 기법)

  • Kim Jin-Deog;Jin Kyo-Hong;Lee Sung-Jin;Jung Hae-Won
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2006.05a
    • /
    • pp.461-465
    • /
    • 2006
  • Recently, the operator modules to control external devices are concerned about automatic management system to process continuously changed signals. They need a efficient data management with high reliability and real time processing. The characteristics of these data are a large volume, a short report interval and asynchronous report time. The typical queries of these systems consist of the current query to search the latest signal value, the snapshot query to search the signal value of a past time, the historical query to search the signal value of a past tine to current. In this paper, we propose the efficient method to manage the above signals by using a file structured database in QNX operating systems. The data communications among the devices are done by Profibus-FMS protocol and the file databases are used for adjusting monitoring frequency and storing signals. The file database adopts a delta version and a periodical back up in due consideration of the resource limit of a small storage and a low computing power in QNX COM(Cabinet Operator Module).

  • PDF

Extension of Aggregate Functions for Spatiotemporal Data Analysis (데이타 분석을 위한 시공간 집계 함수의 확장)

  • Chi Jeong Hee;Shin Hyun Ho;Kim Sang Ho;Ryu Keun Ho
    • Journal of KIISE:Databases
    • /
    • v.32 no.1
    • /
    • pp.43-55
    • /
    • 2005
  • Spatiotemporal databases support methods of recording and querying for spatiotemporal data to user by offering both spatial management and historical information on various types of objects in the real world. We can answer to the following query in real world: 'What is the average of volume of pesticide sprayed for cach farm land from April to August on 2001, within some query window' Such aggregation queries have both temporal and spatial constraint. However, previous works for aggregation are attached only to temporal aggregation or spatial aggregation. So they have problems that are difficult to apply for spatiotemporal data directly which have both spatial and temporal constraint. Therefore, in this paper, we propose spatiotemporal aggregate functions for analysis of spatiotemporal data which have spatiotemporal characteristic, such as stCOUNT, stSUM, stAVG, stMAX, stMIN. We also show that our proposal resulted in the convenience and improvement of query in application systems, and facility of analysis on spatiotemporal data which the previous temporal or spatial aggregate functions are not able to analyze, by applying to the estate management system. Then, we show the validity of our algorithm performance through the evaluation of spatiotemporal aggregate functions.

A Proposal of Methods for Extracting Temporal Information of History-related Web Document based on Historical Objects Using Machine Learning Techniques (역사객체 기반의 기계학습 기법을 활용한 웹 문서의 시간정보 추출 방안 제안)

  • Lee, Jun;KWON, YongJin
    • Journal of Internet Computing and Services
    • /
    • v.16 no.4
    • /
    • pp.39-50
    • /
    • 2015
  • In information retrieval process through search engine, some users want to retrieve several documents that are corresponding with specific time period situation. For example, if user wants to search a document that contains the situation before 'Japanese invasions of Korea era', he may use the keyword 'Japanese invasions of Korea' by using searching query. Then, search engine gives all of documents about 'Japanese invasions of Korea' disregarding time period in order. It makes user to do an additional work. In addition, a large percentage of cases which is related to historical documents have different time period between generation date of a document and record time of contents. If time period in document contents can be extracted, it may facilitate effective information for retrieval and various applications. Consequently, we pursue a research extracting time period of Joseon era's historical documents by using historic literature for Joseon era in order to deduct the time period corresponding with document content in this paper. We define historical objects based on historic literature that was collected from web and confirm a possibility of extracting time period of web document by machine learning techniques. In addition to the machine learning techniques, we propose and apply the similarity filtering based on the comparison between the historical objects. Finally, we'll evaluate the result of temporal indexing accuracy and improvement.

A Study on Integration of Internal Information Retrieval Systems using Mashup; National Institute of Korean History Information Systems (매쉬업을 적용한 기관 내 정보검색시스템 통합 방안 연구 - 국사편찬위원회 정보시스템을 중심으로 -)

  • Lee, Hye-Won;Yoon, So-Young
    • Journal of Information Management
    • /
    • v.42 no.1
    • /
    • pp.63-83
    • /
    • 2011
  • Mashup service provides results by query in real time and responds to users' request in dynamic. In terms of size, each of NIKH(National Institute of Korean History)'s internal Information Systems is equal to individual library system. As adapting mashup for information convergence with external resources, it was accepted for internal integrated search in the same context. This study designated NIKH OpenAPI and proposed metadata format for internal integrated search of historical contents.

A Study on the Effective Spatial Data Warehouse (효율적인 공간 데이타 웨어하우스에 관한 연구)

  • 이기영
    • Journal of the Korea Society of Computer and Information
    • /
    • v.3 no.4
    • /
    • pp.126-131
    • /
    • 1998
  • Spatial data warehouse, whose importance is being increased, is composed of huge amounts of historical spatial data for organizational decision making and it also allows users to obtain useful geospatial information through analyzing and summmarizing spatial data. In this paper, we survey effective spatial multidimensional model which is based on virtual scenario for spatial data warehouse modelling. Therefore, we describe spatial multidimensional analytical query which provide multiple analytical functions according tom user's requests.

  • PDF