• Journal of The Korean Association For Science Education
• /
• v.37 no.6
• /
• pp.1037-1049
• /
• 2017

The purpose of this study is to explore how the flow of discourse move and their reasoning process in dialogic argumentation during group modeling on excretion. Five groups of three to four students in the second grade of a middle school participated in the modeling practice of a Gifted Center. Analysis was conducted on argumentation during the modeling activity in which students should explain how the waste product (ammonia) leaves the body. It was found that there was a sequential argumentative process-tentative consensus, solving the uncertainty, and consensus. There were several discourse moves - 'claim' and 'counterclaim' in the stage of tentative consensus, 'query' and 'clarification of meaning' in the stage of solving the uncertainty, and 'change of claim' in the stage of consensus. Students participated in the dialogic argumentation by constructing argument collaboratively for reaching a consensus. Critical questioning in the stage of solving the uncertainty and reasoning in the stage of consensus were the impact factors of dialogic argumentation. By answering the critical questions, students changed their claims or suggested new claims by defending or rebutting previous claims. Students justified group claims with diverse argumentation scheme and scientific reasoning to reach a group consensus. These findings have implication for science educators who want to adopt dialogic argumentation in science classes.

• The KIPS Transactions:PartB
• /
• v.11B no.3
• /
• pp.369-380
• /
• 2004

In this paper, we propose a web page weighting scheme based on WordNet-based collaborative evaluation and hyperlink to improve the precision of web search engine. Generally search engines use keyword matching to decide web page ranking. In the information retrieval from huge data such as the Web, simple word comparison cannot distinguish important documents because there exist too many documents with similar relevancy. In this paper, we implement a WordNet-based user interface that helps to distinguish different senses of query word, and constructed a search engine in which the implicit evaluations by multiple users are reflected in ranking by accumulating the number of clicks. In accumulating click counts, they are stored separately according to lenses, so that more accurate search is possible. Weighting of each web page by using collaborative evaluation and hyperlink is reflected in ranking. The experimental results with several keywords show that the precision of proposed system is improved compared to conventional search engines.

• Spatial Information Research
• /
• v.9 no.1
• /
• pp.51-72
• /
• 2001

It is frequently pointed out that the conventional field survey for natural environment has may limitations in terms of positional accuracy, real-time GIS data acquisition, and economic efficiency. The aim of this research was to develop an on site real-time mapping technique that enables the surveyor to input data in the field. The idea is based upon the recent trends in the field of Telecommunication and Information Technology that uses a GPS, wireless network computing, moving computing, etc. A virtual office approach has been adopted, in which a portable computer is linked to a GPS and field workers record data on the computer at the site and analyse data on site. This field mapping system has shown to be much less susceptible to the positional accuracy than that of th conventional approach. The Graphic User Interface, in particular, were ideally suited to combining positional information with attribute data which changes with every survey points. This interface allows users to interactively display and query GIS layers reproduced from the past survey results. The GIS database stored in the virtual office will serve to carry out a highly reliable survey since it could play a crucial role in identifying temporal and spatial changes occurred in the site. It is expected that integrated utilization of field data among the related agencies would be increased much more than before since the virtual office survey would be a powerful tool to ensure geometric fidelity in GIS database creation process. This paper also discusses the limitations and future direction of the present prototype research.

• Spatial Information Research
• /
• v.21 no.3
• /
• pp.45-53
• /
• 2013

Web GIS, based on the latest web-technology, has evolved to provide efficient and accurate spatial information to users. Furthermore, Web GIS Server has improved the performance constantly to respond user web requests and to offer spatial information service. This research aims to create a designed and implemented Web GIS Server that is named as Nodemap which uses the emergent technology, Node.js, which has been issued for an event-oriented, non-blocking I/O model framework for coding JavaScript on the server development. Basically, NodeMap is Web GIS Server that supports OGC implementation specification. It is designed to process GIS data by using DBMS, which supports spatial index and standard spatial query function. And NodeMap uses Node-Canvas module supported HTML5 canvas to render spatial information on tile map. Lastly, NodeMap uses Express module based connect module framework. NodaMap performance demonstration confirmed a possibility of applying Node.js as a (next/future) Web GIS Server development technology through the benchmarking. Having completed its quality test of NodeMap, this study has shown the compatibility and potential for Node.js as a Web GIS server development technology, and has shown the bright future of internet GIS service.

• Journal of Korean Society for Geospatial Information Science
• /
• v.25 no.1
• /
• pp.29-36
• /
• 2017

In this paper, we implement a spatial big data analysis prototype based on Spark which is an in-memory system and compares the performance by the spatial split algorithm on this basis. In cluster computing environments, big data is divided into blocks of a certain size order to balance the computing load of big data. Existing research showed that in the case of the Hadoop based spatial big data system, the split method by spatial is more effective than the general sequential split method. Hadoop based spatial data system stores raw data as it is in spatial-divided blocks. However, in the proposed Spark-based spatial analysis system, there is a difference that spatial data is converted into a memory data structure and stored in a spatial block for search efficiency. Therefore, in this paper, we propose an in-memory spatial big data prototype and a spatial split block storage method. Also, we compare the performance of existing spatial split algorithms in the proposed prototype. We presented an appropriate spatial split strategy with the Spark based big data system. In the experiment, we compared the query execution time of the spatial split algorithm, and confirmed that the BSP algorithm shows the best performance.

• Journal of Korea Spatial Information System Society
• /
• v.11 no.3
• /
• pp.55-62
• /
• 2009

Location based Services in the ubiquitous computing environment, namely u-LBS, use very large and skewed spatial objects that are closely related to locational information. It is especially essential to achieve fast search, which is looking for POI(Point of Interest) related to the location of users. This paper examines how to search large and skewed POI efficiently in the u-LBS environment. We propose the Dynamic-level Grid based R-Tree(DGR-Tree), which is an index for point data that can reduce the cost of stationary POI search. DGR-Tree uses both R-Tree as a primary index and Dynamic-level Grid as a secondary index. DGR-Tree is optimized to be suitable for point data and solves the overlapping problem among leaf nodes. Dynamic-level Grid of DGR-Tree is created dynamically according to the density of POI. Each cell in Dynamic-level Grid has a leaf node pointer for direct access with the leaf node of the primary index. Therefore, the index access performance is improved greatly by accessing the leaf node directly through Dynamic-level Grid. We also propose a K-Nearest Neighbor(KNN) algorithm for DGR-Tree, which utilizes Dynamic-level Grid for fast access to candidate cells. The KNN algorithm for DGR-Tree provides the mechanism, which can access directly to cells enclosing given query point and adjacent cells without tree traversal. The KNN algorithm minimizes sorting cost about candidate lists with minimum distance and provides NEB(Non Extensible Boundary), which need not consider the extension of candidate nodes for KNN search.

• Proceedings of the Korean Society of Crop Science Conference
• /
• 2017.06a
• /
• pp.135-135
• /
• 2017

The Gramene database (http://www.gramene.org) is a powerful online resource for agricultural researchers, plant breeders and educators that provides easy access to reference data, visualizations and analytical tools for conducting cross-species comparisons. Learn the benefits of using Gramene to enrich your lectures, accelerate your research goals, and respond to your organismal community needs. Gramene's genomes portal hosts browsers for 44 complete reference genomes, including crops and model organisms, each displaying functional annotations, gene-trees with orthologous and paralogous gene classification, and whole-genome alignments. SNP and structural diversity data, available for 11 species, are displayed in the context of gene annotation, protein domains and functional consequences on transcript structure (e.g., missense variant). Browsers from multiple species can be viewed simultaneously with links to community-driven organismal databases. Thus, while hosting the underlying data for comparative studies, the portal also provides unified access to diverse plant community resources, and the ability for communities to upload and display private data sets in multiple standard formats. Our BioMart data mining interface enable complex queries and bulk download of sequence, annotation, homology and variation data. Gramene's pathway portal, the Plant Reactome, hosts over 240 pathways curated in rice and inferred in 66 additional plant species by orthology projection. Users may compare pathways across species, query and visualize curated expression data from EMBL-EBI's Expression Atlas in the context of pathways, analyze genome-scale expression data, and conduct pathway enrichment analysis. Our integrated search database and modern user interface leverage these diverse annotations to facilitate finding genes through selecting auto-suggested filters with interactive views of the results.

• Journal of Korea Spatial Information System Society
• /
• v.8 no.2 s.17
• /
• pp.91-107
• /
• 2006

To handling the extreme situation that must manage positional information of a very large volume, at least millions of moving objects. A cluster-based sealable distributed computing system architecture, called the GALIS which consists of multiple data processors, each dedicated to keeping records relevant to a different geographical zone and a different time zone, was proposed. In this paper, we proposed a valid time management and time-zone shifting scheme, which are essential in realizing the long-term location data subsystem of GALIS, but missed in our previous prototype development. We explain how to manage valid time of moving objects to avoid ambiguity of location information. We also describe time-zone shifting algorithm with three variations, such as Real Time-Time Zone Shifting, Batch-Time Zone Shifting, Table Partitioned Batch-Time Zone Shifting, Through experiments related with query processing time and CPU utilization, we show the efficiency of the proposed time-zone shifting schemes.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.8 no.5
• /
• pp.159-166
• /
• 2008

Recently, according to the rapid development of location positioning technology and wireless communications technology and increasement of usage of moving object data, many researches and developments on the real-time locating systems which provides real time service of moving object data stream are under proceeding. However, MO (Moving Object) DBMS used based system in the in these systems is the inefficient management of moving object data streams, and the existing DSMS (Data Stream Management System) has problems that spatio-temporal data are not handled efficiently. Therefore, in this thesis, we designed and implemented spatio-temporal DSMS for efficient real-time management of moving object data stream. This thesis implemented spatio-temporal DSMS based STREAM (STanford stREam dAta Manager) of Stanford University is supporting real-time management of moving object data stream and spatio-temproal query processing and filtering for reduce the input loading. Specifically, spatio-temporal operators of the spatio-temporal DSMS support standard interface of SQL form which extended "Simple Feature Specification for SQL" standard specifications presented by OGC for compatibility. Finally, implemented spatio-temporal DSMS in this thesis, proved the effectiveness of the system that as applied real-time monitoring areas that require real-time locating of object data stream DSMS.

• Journal of Arbitration Studies
• /
• v.8 no.1
• /
• pp.293-322
• /
• 1998

General Administrative Procedures of the Preshipment Inspection 1. Initial notification Preshipment Inspection is initiated by Agency when it receives notice either from the importing country, or the seller, that an export needs to be imspected 1.1 Notice from the importing country 1.2 Notice from the seller 2. Preliminary price verification After receipt of initial notification, Agency undertakes, Where possible, a preliminary price verification, based upon the Inspection Order and other contractual documents received. 3. Customs classification When required by the Government of the importing country. Agency forms an opinion of the Customs Classification Code based upon the Customs Tariff Book and Rules of Classification of the country of importation. The Customs Classification Code determines the tariff rate on the basis of which the importer will be required to pay import duties. 4. Import eligibility 5. Arrangements for physical inspection 5.1 Inspection request from seller 5.2 Place of inspection 5.3 Date of inspection 5.4 Physical inspection procedures 6. Physical inspection results When the physical inspection is completed, the inspector submits his report to the Agency office and the result of inspection will be communicated to the seller and, where applicable, the place of inspection. The result will state: satisfactory or conditional of unsatisfactory. The seller is welcome to present his views in writting to Agency in the event there is any query regarding the issuance of a conditional of unsatisfactory inspection result. 6.1 Satisfactory 6.2 Conditional 6.3 Unsatisfactory 7. Shipment of the goods The seller is advised to check with Agency prior to shipment if the physical inspection result has not been received or there are any doubts concerning whether a Clean Report of Findings will be issued. 8. Final price verification and classification Based on the results of physical inspection and appropriate final documents, Agency finalises the price verification and the Agency opinion of Customs classification code. When the preliminary price verification has not resulted in any unresolved questions and the inspection result and other documents received are consistent with the preliminary documentation, Agency will not normally require any additional information. The main exception would be if the terms of sale require reference to prices at the date of shipment. 9. The Report of Findings 9.1 Types of Reports of Findings - Clean Reports of Findings(CRF) The Agency will issue a Clean Reports of Findings(CRF), or equivalent document, normally within two working days after receipt of the necessary correct final documents and a satisfactory result in all aspects of the inspection. - Discrepancy Report.