• Journal of the Korea Society of Computer and Information
• /
• v.5 no.3
• /
• pp.9-15
• /
• 2000

We call WBI the educational program of this new teaching method which uses the web system. The instruction in WBI settings can make students feel more excited and interested in learning activities because it combined various sorts of multimedia materials such as moving pictures, graphics, and sound.. The diverse learning contents of this program not only supplement student's needs but also stimulate their creativities and application abilities. Based on the internet web courseware, this paper attempts to suggest the new program. This design implements the text, image and sound by using Explorer 5.0 in HTML, Javascript, Photoshop 5.0, Flash 4.0, and finally Gif Construction.

• 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.

• The Journal of Society for e-Business Studies
• /
• v.20 no.3
• /
• pp.79-87
• /
• 2015

With recent emergence of Web 2.0 technology, many services are encouraging the user participation. Then, many approaches dealing with multimedia contents focused on the personalized information provisioning. The proposed approach analyzes the user requirements and previous methodology for personalized information provisioning. Furthermore, we propose the user participation based multimedia services with collaborative tagging.

• Journal of Korean Society for Geospatial Information Science
• /
• v.16 no.2
• /
• pp.77-86
• /
• 2008

The information of university entrance examination is important information to examinees as well as each universities. And this information can be used various fields. By using this information, examinees can choose the university which is most suitable regions through oneself's grade, and universities can decide the entrance policy and public relations of university. Furthermore, this information can be used important data to promote student's welfare. Therefore the introduction of College Matriculation System which can share between examinees and universities is keenly required. This study has developed the College Matriculation System which is Web2.0- based by using Naver Map API. By using this system, the information about candidates, and successful candidates and registrants for admission can be analysed, also the ratio of successful candidates in comparison with candidates and the change ratio of candidates during these three years can be analyzed. Besides, it can be supported the entrance public relations policy of universities by managing the public relations history, and it can be provided the information of university by grade to examinees on matriculation information based. Therefore, it was possible that manage and practical use of various data through connected with map based on web 2.0 which is opened. And it is considered possible to express more various information based on map constructing GIS system of user center that is not GIS system of existent offerer center.

• Asia-pacific Journal of Multimedia Services Convergent with Art, Humanities, and Sociology
• /
• v.9 no.4
• /
• pp.745-754
• /
• 2019

As GeoWeb 2.0 technologies are widely used, various kinds of services that mashup spatial data and user data are being developed. In particular, various spatial information platforms such as Google Maps, OpenStreetMap, Daum Map, Naver Map, olleh Map, and VWorld based on GeoWeb 2.0 technologies support mashup service. The mashup service which is supported through the Open APIs of the platforms, provides various kinds of spatial data such as 2D map, 3D map, and aerial image. Also, application fields using the mashup service are greatly expanded. Recently, as user data for mashup have been greatly increased, there was a problem in mashup performance. However, the research on the mashup performance improvement is currently insufficient, even the research on the mashup performance comparison of various platforms has not been performed. In this paper, we perform comparative analysis of the mashup performance for large amounts of user data and spatial data using various spatial information platforms available in Korea. Specifically, we propose two performance analysis indexes of mashup time and user interaction time in order to analyze the mashup performance efficiently. Also, we implement a system for the performance analysis. Finally, from the performance analysis result, we propose a spatial information platform that can be efficiently applied to cases when user data increases greatly and user interaction occurs frequently.

• Smart Media Journal
• /
• v.12 no.2
• /
• pp.66-75
• /
• 2023

Recently, the number of cloud web applications is increasing owing to the accelerated migration of enterprises and public sector information systems to the cloud. Traditional network attacks on cloud web applications are characterized by Denial of Service (DoS) attacks, which consume network resources with a large number of packets. However, HTTP DoS attacks, which consume application resources, are also increasing recently; as such, developing security technologies to prevent them is necessary. In particular, since low-bandwidth HTTP DoS attacks do not consume network resources, they are difficult to identify using traditional security solutions that monitor network metrics. In this paper, we propose a new detection model for detecting HTTP DoS attacks on cloud web applications by collecting the application metrics of web servers and learning them using machine learning. We collected 18 types of application metrics from an Apache web server and used five machine learning and two deep learning models to train the collected data. Further, we confirmed the superiority of the application metrics-based machine learning model by collecting and training 6 additional network metrics and comparing their performance with the proposed models. Among HTTP DoS attacks, we injected the RUDY and HULK attacks, which are low- and high-bandwidth attacks, respectively. As a result of detecting these two attacks using the proposed model, we found out that the F1 scores of the application metrics-based machine learning model were about 0.3 and 0.1 higher than that of the network metrics-based model, respectively.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2009.05a
• /
• pp.1417-1421
• /
• 2009

최근 들어 유역의 정확한 수문현상을 파악하기 위하여 유역의 유출량 자료를 직접 유출과 기저유출로 분리한 후 수문 모형의 직접유출 및 기저유출의 수문컴포넌트 검증에 활용하는 연구가 많이 이루어지고 있다. 미국 국립지리국 (USGS) 에서 개발한 HYSEP 모형이 지난 수 년 동안 유출 컴포넌트 분리에 널리 이용되어 오고 있다. 그러나 USGS 기반의 HYSEP의 경우 능숙한 컴퓨터 사용자가 아닌 비전문가들이 HYSEP을 운영하기에는 여러 가지 많은 제한점이 있어 왔다. 그리하여 본 연구에서는 고해상도 위성영상 Google Map 기반의 기저유출분리 프로그램인 Web-based HYSEP 인터페이스를 개발하였다. 이 시스템에는 HYSEP에서 제공하는 3가지 방법인 Fixed Interval / Sliding Interval / Local Minimum 방법이 제공되고 있다. 본 연구에서 개발된 Google Map 기반의 HYSEP 시스템은 USGS 유량 관측지점들에 대해 XML 데이터 포맷으로 DB를 구축하여 Google Map 과 연계하였으며 이를 통해 사용자가 원하는 관측소의 실시간 유량자료를 다운로드 할 수 있도록 개발되어졌다. Google Map 기반의 HYSEP 기저유출 분리 시스템(http://www.EnvSys.co.kr/${\sim}$hysep)은 Perl/CGI 및 자바스크립트, Google Map script 등을 이용하여 개발되었다. 현재 개발된 Google Map 기반의 USGS HYSEP 시스템은 한 곳의 유량관측지점에 대해서 총 3가지 기저유출 모듈을 적용하여 결과를 제공하고 있으며, 그 결과를 테이블이나 그래프 형태로 제공하도록 되어 있다. 본 연구에서는 Google Map 기반의 USGS HYSEP 시스템을 이용하여 미국 인디애나 주의 Little Eagle Creek 유역의 유량자료와 Fixed Interval / Sliding Interval / Local Minimum 방법을 이용하여 기저유출을 분리하였으며, 기존에 널리 활용되는 기저유출 분리 프로그램인 Web 기반의 WHAT 시스템 (http://www.EnvSys.co.k.r/~what) 산정 기저유출량과 비교분석하였다. 분석결과 HYSEP 예측 기저유출치가 전반적으로 WHAT 예측치보다 크게 산정되었다. WHAT 시스템과 본 연구에서 개발한 Web 기반의 HYSEP 일단위 기저유출량을 비교해 본 결과 $R^{2}$가 0.56, EI는 0.52로 어느 정도 비슷한 경향을 나타냈으나, 유역의 특성을 반영하는 WHAT 시스템과는 달리 주어진 유량자료만을 이용하여 기저유출을 분리하는 Web 기반의 HYSEP 기저유출 분리모듈을 개선할 필요가 있는 것으로 판단된다.

• Journal of the Korean Society for Library and Information Science
• /
• v.42 no.2
• /
• pp.29-49
• /
• 2008

Library 2.0 stands for the term which suggests the changes in library's services. Library 2.0, the term, was first appeared in 2005 and have studied as a meaningful model for library services. The majority was related to the definition of basic concepts, overview of best practices, and case study for individual implementation. There are three goals of this study which is distinguished from other library 2.0 studies. First, I have surveyed various types of services and classified into three groups. Second, I have examined the properties viewed in this light of content, user, and manager. Third, I have propose a new conceptual model of a information ecosystem which thinks the library 2.0 collectively.

• KIPS Transactions on Software and Data Engineering
• /
• v.1 no.3
• /
• pp.159-168
• /
• 2012

Relation in the new IT environment, such as the SNS, Cloud, Web3.0, has become an important factor. And these relations generate a transaction. However, existing relational database and graph database does not processe graph structure representing the relationships and transactions. This paper, we propose the technique that can be processed concurrently graph structures and transactions in a scalable complex network system. The proposed technique simultaneously save and navigate graph structures and transactions using the Topic Maps data model. Topic Maps is one of ontology language to implement the semantic web(Web 3.0). It has been used as the navigator of the information through the association of the information resources. In this paper, the architecture of the proposed technique was implemented and design using Cassandra - one of column type NoSQL. It is to ensure that can handle up to Big Data-level data using distributed processing. Finally, the experiments showed about the process of storage and query about typical RDBMS Oracle and the proposed technique to the same data source and the same questions. It can show that is expressed by the relationship without the 'join' enough alternative to the role of the RDBMS.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.9 no.3
• /
• pp.31-38
• /
• 2013

The evolution of the Web from Web 1.0 to Web 2.0 has brought up new platforms as SNSs(Social Network Service) that are used by users to articulate and manage their relationships. SNSs are an online phenomenon which has become extremely popular. A SNS essentially consists of a representation of each user, his/her social links, and a variety of additional services. SNSs are increasingly attracting the attention of academic and industry researchers. What makes SNS unique is that they have a relationship with friends. The friend recommendation is one important feature of social networking services. People tend to trust the opinions of friends they know rather than the opinions of strangers. In this paper, we propose an efficient data processing method for social data. We study previous researches about social score in social network service. Our ESS(Efficient Social Score) is computed by both friendship weight and score of a document that was tagged by a user's friends. Our experimental results also confirm that our method has good performance.