• The KIPS Transactions:PartA
• /
• v.10A no.2
• /
• pp.93-100
• /
• 2003

With the advent of distributed computing and Web service technologies, lots of users have been requiring services that can conveniently obtain and/or support well-assembled information based on Web. For this reason, we are to construct Automatic Linking Support Systems for generating Web-based integrated information and supporting retrieval information according to user's various requirements. Our system organization is based on client/server system. A server environment consisted of automatic linking engine that can provide lexical analyzing, query processing and integrated document generating functions, and databases that are made of dictionaries, image and URL contents. Also, client environments consisted of Web editor that can generate integrated documents and Web helper that can retrieve them via automatic linking engine and databases. For client's user-friendly interfaces, web editor and helper programs can directly execute by down leading from a server without setup them before inside clients. For reducing server's overheads, Parts of server's executing modules are distributed to clients on which they can be executing. As an implementation of our system, we use the JDK 1.3, SWING for user interfaces like Web editor and helper, RMI mechanism for interaction between clients and a server, and SQL server 7.0 for database development, respectively. Finally, we showed the access procedures of automatic document linking engine and databases from Web editor or Web helper, and results appearing on their screens.

• Journal of Internet Computing and Services
• /
• v.4 no.1
• /
• pp.27-37
• /
• 2003

This paper presents the Web service generation system using virtual environments and databases. Main features include that the environments and databases are generated and maintained correspondingly. It means that the virtual environments are changed automatically if the databases are updated, and also that the databases are maintained accordingly as the information about the environments are modified at the scene End users can modify the property of the virtual environments in the scene directly using the VRML edit interface, which visualizes the structures of virtual environments. Each object can be accessed through the VRML editor, its property be modified directly, and the information is updated in the database automatically. Web service pages are maintained accordingly. In addition, we define a texture mapping method based on weighted view interpolation using 2 photo images for a scene. A texture mapping interface Is also provided for end users to generate realistic images themselves.

• Journal of information and communication convergence engineering
• /
• v.17 no.2
• /
• pp.149-160
• /
• 2019

Web applications typically interact with databases. Therefore, it is very crucial to understand which web components access which database resources when maintaining web apps. Existing research identifies interactions between Java web components, such as JavaServer Pages and servlets but does not extract dependencies between the web components and database resources, such as tables and attributes. This paper proposes a dynamic analysis of Java web apps, which extracts such dependencies from a Java web app and represents them as a graph. The key responsibility of our analysis method is to identify when web components access database resources. To fulfill this responsibility, our method dynamically observes the database-related objects provided in the Java standard library using the proxy pattern, which can be applied to control access to a desired object. This study also experiments with open source web apps to verify the feasibility of the proposed method.

• Journal of KIISE:Databases
• /
• v.33 no.7
• /
• pp.708-714
• /
• 2006

The World Wide Web has become an entrenched global medium for storing and searching information. Most people begin at a Web search engine to find information, but the user's pertinent search results are often greatly diluted by irrelevant data or sometimes appear on target but still mislead the user in an unwanted direction. One of the intentional, sometimes vicious manipulations of Web databases is Web spamming as Google bombing that is based on the PageRank algorithm, one of the most famous Web structuring techniques. In this paper, we regard the Web as a directed labeled graph that Web pages represent nodes and the corresponding hyperlinks edges. In the present work, we define the label of an edge as having a link context and a similarity measure between link context and the target page. With this similarity, we can modify the transition matrix of the PageRank algorithm. A motivating example is investigated in terms of the Singular Value Decomposition with which our algorithm can outperform to filter the Web spamming pages effectively.

• Proceedings of the Korean Society for Information Management Conference
• /
• 1998.08a
• /
• pp.51-54
• /
• 1998

정보봉사기관에서 이용자 인터페이스가 좋은 인터넷의 WWW서비스와 데이터베이스를 연동한 웹 데이터베이스를 이용한 정보봉사가 늘고 있다. 본 고에서는 정보봉사기관에서 웹 데이터베이스의 도입, 선정, 활용에 이르는 전반적이고 실무적인 내용으로 고찰하고자 한다.

• Proceedings of the KSRS Conference
• /
• 2008.10a
• /
• pp.45-48
• /
• 2008

Since the mid-2000, so-called Web 2.0 paradigm was emerged and has been widely extended to actual Web markets with supporting Web technologies. Among Web 2.0 services, mashups with Open APIs is regarded as one of core technologies. Web mapping is also the most dominant mashup application in Open API-based applications, so that various mashups with Google Map API and other Open APIs are developing. In this paper, current technological status is explained with web GIS file formats of KML. While, a prototype is web-based GIS layer authoring system for general users, without any kinds of GIS tools and external spatial databases. This mashup application will be used web-based feature extraction for geo-spatial web for public users.

• Journal of the Korean Society for Library and Information Science
• /
• v.40 no.2
• /
• pp.299-314
• /
• 2006

This study suggests evaluation criteria for the web-based question-answer databases provided by major Korean search portals. In particular, this study suggests evaluation criteria for the relevance of question titles, entire questions, and answer's. The evaluation criteria for the qualify of answers are also developed. Based on these criteria. evaluation of documents from Naver Knowledge-in are performed. The results of this study can be implemented to the development of test collection of question-answer databases. The implications for system designers and web content providers are discussed.

• Publications of The Korean Astronomical Society
• /
• v.20 no.1 s.24
• /
• pp.85-95
• /
• 2005

We collected eleven large astronomical catalogues, which include 2MASS, USNO B1.0, GSC 2 catalogues and so on. Most of these catalogues are the frequently used by astronomers for all sorts of applications. But the researches are faced with the problem of accessing these databases because these catalogues contain from tens millions up to thousands of millions of records. So we developed a web application system to manage these large catalogues, the main purpose of the web application is to allow a powerful and efficient querying activity on these catalogues through internet by using a simple web interface. User could retrieve the query result in variety of formats including plain text, HTML, Microsoft Excel format (XLS), and VOTable. Furthermore, user also could display and analyze result graphically by using a powerful interactive visualization tools named VOPlot which was developed by the Virtual Observatory-India (VOI) project.

• Molecular & Cellular Toxicology
• /
• v.3 no.3
• /
• pp.208-213
• /
• 2007

With the help of a development and popularization of microarray technology that enable to us to simultaneously investigate the expression pattern of thousands of genes, the toxicogenomics experimenters can interpret the genome-scale interaction between genes exposed in toxicant or toxicant-related environment. The ultimate and primary goal of toxicogenomics identifies functional context among the group of genes that are differentially or similarly coexpressed under the specific toxic substance. On the other side, public reference databases with transcriptom, proteom, and biological pathway information are needed for the analysis of these complex omics data. However, due to the heterogeneous and independent nature of these databases, it is hard to individually analyze a large omics annotations and their pathway information. Fortunately, several web sites of the public database provide information linked to other. Nevertheless it involves not only approriate information but also unnecessary information to users. Therefore, the systematically integrated database that is suitable to a demand of experimenters is needed. For these reasons, we propose SOP (Search of Omics Pathway) database system which is constructed as the integrated biological database converting heterogeneous feature of public databases into combined feature. In addition, SOP offers user-friendly web interfaces which enable users to submit gene queries for biological interpretation of gene lists derived from omics experiments. Outputs of SOP web interface are supported as the omics annotation table and the visualized pathway maps of KEGG PATHWAY database. We believe that SOP will appear as a helpful tool to perform biological interpretation of genes or proteins traced to omics experiments, lead to new discoveries from their pathway analysis, and design new hypothesis for a next toxicogenomics experiments.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.7
• /
• pp.35-47
• /
• 2011

This paper proposes a set of rules to automatically generate OWL ontologies from relational databases. The purpose of the rules is to allow semantic access to existing RDB data without any database schema transformation and data migration process. In other words, the rules help a RDBMS play as a web ontology repository as well. However, the use of the mapping rules between RDB and OWL proposed by other studies for the objective causes troubles as follows. First, databases including the tables with a specific structure can't be translated into OWL. Second, the process for extracting an OWL individual unnecessarily lead to database join operations, or several SQL queries. On the other hand, our rules is designed to prevent these problems, can generate OWL classes and properties from database schemas and can generate OWL individuals from the database instances. In addition, an ontology generated by our rules is an OWL 2 DL ontology.