• Journal of the Semiconductor & Display Technology
• /
• v.2 no.3
• /
• pp.13-18
• /
• 2003

A remote monitoring system of the semiconductor equipment is used to monitor or control operations of the equipment. Most of the conventional monitoring systems are based on the client-server model with the general purpose PC. Basically, it implies the difficulties in the system reliability and cost down due to its size and complexity. To overcome these difficulties, we suggest an embedded web server which is based on the low-cost microprocessor. It is designed for the monitoring or controlling a dedicated equipment only. To evaluate the feasibility of the suggested embedded web server, we have implemented a test-board with ATMega103 and programmed the basic modules using the AVR-GCC. Finally, we have tested its operations on the MS Explorer 6.0 environment.

• The KIPS Transactions:PartD
• /
• v.9D no.6
• /
• pp.981-990
• /
• 2002

Over the past few years, a number of studies have been made on web map services which enable the GIS user to access spatial data through the web. They, however. have focused on only implementation techniques separately, such at map client implementation map server implementation, communication between client and server, and the map data representation. Therefore, it is hard to share and practical use the spatial data, because they does not ensure interoperability in heterogeneous map servers. In this paper, In this paper, we have designed and implemented the web map server with open architecture. which complies with the standard interfaces proposed by OpenGIS Consortium (OGC). In particular, we have extended the OGC's Interfaces for a map server to support one or more data sources. This paper has contributed to construction and practical use of web map services by newly proposing the method of implementation of a map server. which could be reused regardless of the types of data sources.

• 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 KIPS Transactions:PartC
• /
• v.13C no.2 s.105
• /
• pp.249-258
• /
• 2006

WebDAV is an IETF standard protocol, which is an extended version of HTTP 1.1, supporting asynchronous collaborative authoring of various contents on the web. Recently, to precisely control access to the resources on a WebDAY server, the WebDAV Access Control Protocol was published. This protocol helps developers to implement advanced server functionalities in a convenient way by providing various control methods to the resources on the WebDAV server. Based on the WebDAV access control protocol, we developed Open Workspaces, which systematically support exchanging and sharing data for general visitors. An Open Workspace can be supplied as a Download-Only Open Workspace, an Upload-Only Open Workspace, or an Upload-Download Open Workspace. Any registered user can create these workspaces without bothering the system administrator. To support the Open Workspaces, we extended the Slide WebDAV server and the DAVExplorer WebDAV client, which are being used popularly.

• Proceedings of the Korean Information Science Society Conference
• /
• 2012.06a
• /
• pp.305-307
• /
• 2012

World Wide Web (WWW)의 지속적인 성장으로 인해 Web Service의 Response Time을 수집하는 방식에 관한 연구가 진행되고 있다. 현재 Client Response Time을 수집하는 방식은 sniffer[1] 를 이용한 Agent 방식을 사용하고 있다. 하지만, 기존의 방식은 클라이언트 PC에 설치되어 수집하게 되므로 Agent의 설치가 쉽지 않고, 관리 또한 어려운 문제점을 갖고 있다. 이러한 문제점을 개선하기 위하여, 본 논문에서는 Web Application Server (WAS)[2] 에서의 Dynamic HTML 변경을 통해 Client에 추가적인 Application을 설치하지 않고도 Client의 Response Time을 Collection하는 방식에 대하여 제안하였다. 이를 통해, 사용자 (End-User)에게 추가적인 응용 프로그램을 설치하지 않고도 Dynamic HTML 을 이용하여 Client Response Time을 수집함과 동시에 Server에 Feedback할 수 있다.

• The Journal of Information Systems
• /
• v.10 no.1
• /
• pp.127-146
• /
• 2001

The area of business applications in the internet are extended enormously in result of fast development of computing and communication technologies, increase of internet use, and use of intranet/extranet in enterprise information system. Widely spread the use of the internet, there are various applications for Business to Business (B to B) or Business to Customer(B to C) model that are based on the intranet or extranet. This paper designed and implemented the Web-based Electronic Bidding System for Business to Business (B to B) model. The technical issues of electronic bidding system in the internet are involved in the connection between web client and server, electronic data interchange for the contract document, and security solution during the bidding and contracting processes. The web-based electronic bidding system in this paper is implemented using Java applet and servlet as a connection interface for web client and server, XML/EDI-based documents for a bid and a contract, and bidding server and notary server for enhancing the security using PKI(Public Key Infrastructure)-based public key cryptography, digital signature and Certification Authority(CA).

• The KIPS Transactions:PartD
• /
• v.15D no.1
• /
• pp.147-154
• /
• 2008

Along with the trend of internet use, various web application developments have been performed to provide information that was managed in the internal database on the web by making a web server page. However, in most cases, a direct program was made without a systematic developmental methodology or with the application of a huge developmental methodology that is inappropriate and decreased the efficiency of the development. A web application that fails to follow a systematic developmental methodology and uses a script language can decrease the productivity of the program development, maintenance, and reuse. In this thesis, the auto writing tool for a dynamic web server page was designed and established by using a database for web application development based on a fast and effective script. It suggests a regularized script model and makes a standardized script for the data bound control tag creator by analyzing a dynamic web server page pattern with the database in order to contribute to productivity by being used in the web application development and maintenance.

• Journal of KIISE:Information Networking
• /
• v.32 no.1
• /
• pp.60-67
• /
• 2005

A cluster consists of a collection of interconnected stand-alone computers working together and provides a high-availability solution in application area such as web services or information systems. Content-based load distribution for web server clusters uses the detailed data found in the application layer to intelligently route user requests among web servers. In this paper, we propose a content-based load distribution algorithm that considers cache hit and load information of the web servers under the web server clusters. In addition, we expand this algorithm in order to manage user requests for dynamic file. Specially, our algorithm does not keep track of any frequency of access information or try to model the contents of the caches of the web servers.

• Journal of Internet Computing and Services
• /
• v.5 no.6
• /
• pp.1-10
• /
• 2004

A web robot is a software that has abilities of tracking and collecting web documents on the Internet(l), The performance scalability of recent web robots reached the limit CIS the number of web documents on the internet has increased sharply as the rapid growth of the Internet continues, Accordingly, it is strongly demanded to study on the performance scalability in searching and collecting documents on the web. 'Design of web robot based on Multi-Agent to speed up documents collection ' rather than 'Sequentially executing Web Robot based on the existing Fork-Join method' and the results of analysis on its performance scalability is presented in the thesis, For collection speedup, a Multi-Agent based web robot performs the independent process for inactive URL ('Dead-links' URL), which is caused by overloaded web documents, temporary network or web-server disturbance, after dividing them into each agent. The agents consist of four component; Loader, Extractor, Active URL Scanner and inactive URL Scanner. The thesis models a Multi-Agent based web robot based on 'Amdahl's Law' to speed up documents collection, introduces a numerical formula for collection speedup, and verifies its performance improvement by comparing data from the formula with data from experiments based on the formula. Moreover, 'Dynamic URL Partition algorithm' is introduced and realized to minimize the workload of the web server by maximizing a interval of the web server which can be a collection target.

• Journal of KIISE:Information Networking
• /
• v.28 no.2
• /
• pp.229-235
• /
• 2001

With the explosive popularity of the World Wide Web, the low penonnance of network often leads web clients to wait a long time for web server's response. To resolve this problem, web caching (proxy) has been considered as the most efficient technique for web server to handle this problem. The placement of web proxy is critical to the overall penonnance, and Li et al. showed the optimal placement of proxies for a web server in the internet with the linear and tree topology when the number of proxies, ]M, is given [4, 5]. They focused on minimizing the over all access time. However, it is also considerable for target web server to minimize the total number of proxies while each proxy server guarantees not to exceed certain res(Xlnse time for each request from its clients. In this paper, we consider the problem of finding the optimal number and placement of web proxies with the lin~ar and tree topology under the given threshold cost for delay time.