• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.9 no.1
• /
• pp.19-24
• /
• 2009

In these days, security threat is ever increasing as computer systems and networking is everywhere. This paper is on the development of security scanner using search engine, with which site managers can easily check security vulnerability on their systems. Our security server automatically collects security-related information on the Internet, and indexes them in the database. To check the vulnerability of a customer server, the client system collects various system-specific information, and sends necessary queries to our security server for vulnerability checking. Up-to-date and site-specific vulnerability information is retrieved through the viewer, which allows the customer effectively to check and respond to security threat on client systems.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2000.10a
• /
• pp.355-359
• /
• 2000

This paper presents design of an advertising E-commerce (electronic commerce) serve. using push technology which provides clients with multimedia information such as text, audio and video according to their setting information. In the most of existing E-commerce system, users visit the web site in person, see and buy goods. In this paper we show the new E-commerce format: Clients select a field of advertisement of what they want to see on the browser, then EC server sends the clients moving advertisements at regular intervals. Subsequently, the users see advertisements and buy goods. The server of this system was designed using push server that saves moving advertisements in the database and sends the user-specific advertisements to users. The system designed in this study is very an active system contrary to existing passive E-commerce systems.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.12 no.1
• /
• pp.81-87
• /
• 2013

In this paper, we propose a music search algorithm for automotive infotainment system. The proposed method extracts fingerprints using the high peaks based on log-spectrum of the music signal, and the extracted music fingerprints store in cloud server applying a hash value. In the cloud server, the most similar music is retrieved by comparing the user's query music with the fingerprints stored in hash table of cloud server. To evaluate the performance of the proposed music search algorithm, we measure an accuracy of the retrieved results according to various length of the query music and measure a retrieval time according to the number of stored music database in hash table.

• The Journal of Korean Association of Computer Education
• /
• v.3 no.1
• /
• pp.1-12
• /
• 2000

Recently, Linux operating system is used for web server environment, but to build web server applications need to be operated many related softwares, such as installing web server, web and database system integration and programming for script language. Most of schools in korea do not have computer specialist for building web server or cyber school. In this paper, we describe design and implementation of an automated building system(AnyBuilder) for cyber school. AnyBuilder build web-based cyber school system, just clicking a few of button and some commands. Especially, it has two phases to build cyber school, one is to generate empty web-based cyber school and the other is to upload contents of lecture.

• ETRI Journal
• /
• v.31 no.2
• /
• pp.173-181
• /
• 2009

The growth of the World Wide Web and web-based applications is creating demand for high performance web servers to offer better throughput and shorter user-perceived latency. This demand leads to widely used cluster-based web servers in the Internet infrastructure. Load balancing algorithms play an important role in boosting the performance of cluster web servers. Previous load balancing algorithms suffer a significant performance drop under dynamic and database-driven workloads. We propose an estimation-based load balancing algorithm with admission control for cluster-based web servers. Because it is difficult to accurately determine the load of web servers, we propose an approximate policy. The algorithm classifies requests based on their service times and tracks the number of outstanding requests from each class in each web server node to dynamically estimate each web server load state. The available capacity of each web server is then computed and used for the load balancing and admission control decisions. The implementation results confirm that the proposed scheme improves both the mean response time and the throughput of clusters compared to rival load balancing algorithms and prevents clusters being overloaded even when request rates are beyond the cluster capacity.

• Journal of Institute of Control, Robotics and Systems
• /
• v.18 no.8
• /
• pp.738-743
• /
• 2012

This paper describes analysis of long-term experiments on a monitoring system to assess the daily activities of the elderly who live alone. The developed system is composed of an in-house sensing system and a server system. The in-house sensing system installed in their own houses is a typical wireless sensor network system including three kinds of wireless sensors. The server system has a database server and an assessment server. We have installed the system into an elderly house, collected data during over two years continuously, then analyze the data. From the analysis, we could measure the energy consumption profile of three kinds of sensor nodes. The experiment shows all kinds of nodes can operate over one year with two AA-size alkaline batteries. Using a measure of reliability of the monitoring system called 'deadzone', the system has showed the failure operation for 842 hours (4.66 %) during over 18,000 hours total operation period.

• Convergence Security Journal
• /
• v.19 no.3
• /
• pp.21-28
• /
• 2019

As the number of websites managed by organizations or organizations increases, so does the number of web application servers and containers. In checking the status of the web service of the web application server and the container, it is very difficult for the person to check the status of the web service after accessing the physical server at the remote site through the terminal or using other accessible software It. Previous research on crawler-related research is hard to find any reference to the processing of data from crawling. Data loss occurs when the crawler accesses the database and stores the data. In this paper, we propose a method to store the inspection data according to crawl - based web application server management without losing data.

• The Journal of Society for e-Business Studies
• /
• v.8 no.3
• /
• pp.17-36
• /
• 2003

ebXML is a global electronic business standard that is sponsored by UN/CEFACT and OASIS. ebXML is an open XML-based infrastructure enabling the global use of electronic business information in an interoperable, secure and consistent manner by all parties. ebXML Registry provides a stable store where the business information submitted by partners is made persistent and a set of registry services that enable clients of the Registry to access them. These services are tied to the structures defined in ebXML Registry Information Model(ebRIM), so we need a way to process them according to underlying database systems. In this paper, we present the result of developing the ebXML Registry Server based on Relational Database Systems.

• Journal of KIISE:Computing Practices and Letters
• /
• v.8 no.2
• /
• pp.231-239
• /
• 2002

This paper gives a comprehensive overview of the SSO solution design on the intranet. SSO described in this paper is based on LDAP, PKI and CA. We designed the data structure to hold many various application services by changing the attribute and DN of LDAP DB. We built LDAP DB using the employee records stored in our organization database. LDAP DB is routinely updated from the database. CA Server that depends on PKI is used to issue the certificates. SHTTP based on SSL is used to protect the data between certificate server and the intranet users.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.3
• /
• pp.43-49
• /
• 2012

Personalized message syndication is an important process for maximizing the effect of mobile marketing. This paper proposes an algorithm for determining clients satisfying target conditions in real-time. The proxy server as an intermediate node stores client profiles (gender, age, location, etc) and their respective summaries into a database. When a company syndicates messages at run time, the proxy server maps target conditions expressed by boolean expressions to integer value and determines target clients by comparing target value with profile summary. Thus, this approach provides efficient personalized message syndication in very large systems with millions of clients because it can determine target clients in real-time and work with a traditional database easily.