• Journal of KIISE:Computing Practices and Letters
• /
• v.5 no.4
• /
• pp.479-488
• /
• 1999

인터넷의 성장과 더불어 수많은 응용시스템들이 인터넷 기반 시스템으로 바뀌고 있다. 특히, 인터넷 기반 전문가시스템은 다양한 구조와 방법으로 설계될 수 있고 이미 제작되었던 수많은 인터넷 기반 전문가시스템들은 그 나름대로의 장단점을 가지고 있다. 본 연구는 특정 전문가시스템의 개발이 아니라 WWW(World Wide Web)을 사용자 인터페이스로 이용할 수 있는 전문가시스템 쉘에 관한 연구이다. 본 시스템은 WWW 하부구조에 대한 의존성을 제거, 클라이언트와 네크워크에 부담 격감, HTML과 부합하는 텍스트에 기초한 통신과 같은 장점 외에 중앙 집중적 다중 사용자 접근 관리 기능을 제공한다. 본 시스템은 다중사용자를 위한 서버/클라이언트 환경 구축을 위해 소켓을 이용하여 큐잉(queueing)과 직렬화(serialization)를 해결하고 비연결 지향적인 WWW의 특성으로 인한 사용자 관리의 어려움은 사용자의 IP 주소와 Timer를 이용한 휴무기간 검사를 이용하여 해결한다.Abstract The growth of internet drives many applications into internet-based systems. Internet-based expert systems can be designed with various concepts and methodologies, and they have their own merits and demerits. This papers is a study on a development of not expert system itself but expert system shell which is able to use WWW(World Wide Web) as user interface. The suggested system supports functions on multiuser management controlled by a server system as well as independence on development environments, minimization of the load for clients and network, and text-based communications such as HTML. The system uses socket, which solves problems of queuing and serialization, in order to construct multiuser server/client environmen and also the system solves the non-connective property of WWW which makes it difficult to control users and processes by using IP address and idle time which is supported by the timer.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.1
• /
• pp.99-106
• /
• 2011

The emerging of ubiquitous computing and healthcare technologies provides us a strong platform to build sustainable healthcare applications especially those that require real-time information related to personal healthcare regardless of place. We realize that system stability, reliability and data protection are also important requirements for u-healthcare services. Therefore, in this paper, we designed a u-healthcare system which can be attached to the patient's body to measure vital signals, enhanced with USN secure sensor module. Our proposed u-healthcare system is using wireless sensor modules embedded with NLM-128 algorithm. In addition, PS-LFSR technique is applied to the NLM-128 algorithm to enable faster and more efficient computation. We included some performance statistical results in term of CPU cycles spent on NLM-128 algorithm with and without the PS-LFSR optimization for performance evaluation.

• Journal of Internet Computing and Services
• /
• v.7 no.1
• /
• pp.75-89
• /
• 2006

This paper is concerned with analysing the bankruptcy prediction power of three models: Multivariate Discriminant Analysis(MDA), Logit Analysis, Neural Network. The research targeted the bankrupted companies after the foreign exchange crisis in 1997 to differentiate from previous research efforts, and all participating companies were randomly selected from the KSE listed companies belonging to manufacturing industry to improve prediction accuracy and validity of the model. In order to assure meaningful bankruptcy prediction, training data and testing data were not extracted within the corresponding period. The result is that prediction accuracy of neural networks is more excellent than that of logit analysis and MDA model when considering that execution of testing data was followed by execution of training data.

• Journal of Internet Computing and Services
• /
• v.7 no.6
• /
• pp.63-77
• /
• 2006

Nowadays as many Grid communities appear, the requirement of singlepoint-to-multipoint data transfer in Grid environment is growing. In a typical LAN or a special purpose network environment, a multicasting technology was used in such a data dissemination transfer case. However, compared with unicasting fouler performance transfer performance the multicating transfer is worse, and the obligation of a special hardware setting makes it difficult to implement in common Grid environment. Therefore, in this paper we propose on effective data dissemination mechanism for Grid environment named DDMG(Data Dissemination Mechanism for Grid), DDMG uses P2P(Peer-to-Peer) mechanism and Globus XIO library to improve the performance in a data dissemination process and to support heterogeneous protocols in Grid environment. We also evaluate the performance of DDMG mechanism in LAN and WAN environment by comparing with unicast transfer.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.5
• /
• pp.1807-1824
• /
• 2015

As the technologies advance, mobile peer-to-peer (MP2P) networks or systems become one of the major ways to share resources and information. On such a system, the information retrieval (IR), including the development of scalable infrastructures for indexing, becomes more complicated due to a huge increase on the amount of information and rapid information change. To keep the systems on MP2P networks more reliable and consistent, the index structures need to be updated frequently. For a semantic IR system, the index structure is even more complicated than a classic IR system and generally has higher update cost. The most well-known indexing technique used in semantic IR systems is Latent Semantic Indexing (LSI), of which the index structure is generated by singular value decomposition (SVD). Although LSI performs well, updating the index structure is not easy and time consuming. In an MP2P environment, which is fully distributed and dynamic, the update becomes more challenging. In this work, we consider how to update the sematic index generated by LSI and keep the index consistent in the whole MP2P network. The proposed Concept Space Update (CSU) protocol, based on distributed 2-Phase locking strategy, can effectively achieve the objectives in terms of two measurements: coverage speed and update cost. Using the proposed effective synchronization mechanism with the efficient updates on the SVD, re-computing the whole index on the P2P overlay can be avoided and the consistency can be achieved. Simulated experiments are also performed to validate our analysis on the proposed CSU protocol. The experimental results indicate that CSU is effective on updating the concept space with LSI/SVD index structure in MP2P semantic IR systems.

• Journal of Internet Computing and Services
• /
• v.16 no.2
• /
• pp.27-40
• /
• 2015

Inferring firewall policy is to discover firewall policy by analyzing response packets as results of active probing without any prior information. However, a brute-force approach for generating probing packets is unavailable because the probing packets may be regarded as attack traffic and blocked by attack detection threshold of a firewall. In this paper, we propose a firewall policy inference method using an efficient probing algorithm which considers the number of source IP addresses, maximum probing packets per second and interval size of adjacent sweep lines as inference parameters to avoid detection. We then verify whether the generated probing packets are classified as network attack patterns by a firewall, and present the result of evaluation of the correctness by comparing original firewall policy with inferred firewall policy.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.2
• /
• pp.504-521
• /
• 2016

Recently, energy harvesting technology has been integrated into wireless sensor networks to ameliorate the nodes' energy limitation problem. In theory, the wireless sensor node equipped with an energy harvesting module can work permanently until hardware failures happen. However, due to the change of power supply, the traditional hierarchical network routing protocol can not be effectively adopted in energy harvesting wireless sensor networks. In this paper, we improve the Low-Energy Adaptive Clustering Hierarchy (LEACH) protocol to make it suitable for the energy harvesting wireless sensor networks. Specifically, the cluster heads are selected according to the estimation of nodes' harvested energy and consumed energy. Preference is given to the nodes with high harvested energy while taking the energy consumption rate into account. The utilization of harvested energy is mathematically formulated as a max-min optimization problem which maximizes the minimum energy conservation of each node. We have proved that maximizing the minimum energy conservation is an NP-hard problem theoretically. Thus, a polynomial time algorithm has been proposed to derive the near-optimal performance. Extensive simulation results show that our proposed routing scheme outperforms previous works in terms of energy conservation and balanced distribution.

• Journal of Internet Computing and Services
• /
• v.12 no.2
• /
• pp.47-53
• /
• 2011

When some sensors under Wireless Sensor Networks fail or become energy-exhausted, redundant mobile sensors might be moved to recover the sensing holes. Within rugged terrain where wheeled sensors are unsuitable, other type of mobile sensors, such as hopping sensors, are needed. In this paper, we address the problem of relocating hopping sensors to the detected sensing holes. Recent study for this work considered the relocation using the shortest path between clusters; however, the shortest path might be used repeatedly and create other sensing holes. In order to overcome the mentioned problem, we propose relocation schemes using the most disjointed paths or multi-paths. Simulation results show that the proposed schemes guarantee more balanced migration distributions of efficient sensors and higher movement success ratios of required sensors than those of the shortest path-based scheme.

• Journal of Internet Computing and Services
• /
• v.12 no.2
• /
• pp.37-46
• /
• 2011

The importance of data service with mobile is becoming more and more significant with the development of wireless network. However, due to the several type of mobile devices and contents, there is a problem that mobile contents should be edited according to the features of the mobile devices and the service providers. Fortunately, there is some solutions that convert mobile contents automatically according to mobile operator. Nevertheless, it has some issues that the response time of content service is delayed when converting mobile contents in real-time. In this paper, we propose an image cache replacement algorithm for minizing the volume of the real-time image transformation. Also, using both of the pre-conversion method and the real-time conversion method to improve storage space and response time.

• Journal of Internet Computing and Services
• /
• v.15 no.5
• /
• pp.123-132
• /
• 2014

Internet is composed of many independent networks referred to as Internet Service Providers (ISPs) and each provider is generally interconnected based on a commercial agreement. Though many countries are engaged in deregulation in internet interconnection, there is still debate whether the large ISPs are unwilling to peer with small providers, have incentives to lower the quality of data transmission of transit operators or set the interconnection charge regarding the actual costs incurred by the interconnection. Korean government introduced regulations in internet interconnection after observing noticeable anti-competitive behaviors from 2005. This paper analyzes whether there is margin squeeze problem/market concentration, and suggests political proposals in Korean regulation status.