- Log In/Sign Up
- P-ISSN1738-6764
- E-ISSN2093-7504
- KCI
ISSN : 1738-6764
Vol.3 No.1
Abstract
The distributions of the minimum correlated F-variable arises in many applied statistical problems including simultaneous analysis of variance (SANOVA), equality of variance, selection and ranking populations, and reliability analysis. In this paper, negative binomial sampling technique is employed to derive the distributions of the minimum of chi-square variables and hence the distributions of the minimum correlated F-variables. The work presented in this paper is divided in two parts. The first part is devoted to develop some combinatorial identities arised from the negative binomial sampling. These identities are constructed and justified to serve important purpose, when we deal with these distributions or their characteristics. Other important results including cumulants and moments of these distributions are also given in somewhat simple forms. Second, the distributions of minimum, chisquare variable and hence the distribution of the minimum correlated F-variables are then derived within the negative binomial sampling framework. Although, multinomial theory applied to order statistics and standard transformation techniques can be used to derive these distributions, the negative binomial sampling approach provides more information regarding the nature of the relationship between the sampling vehicle and the probability distributions of these functions of chi-square variables. We also provide an algorithm to compute the percentage points of the distributions. The computation methods we adopted are exact and no interpolations are involved.
Abstract
This paper proposes a policy on efficient load balancing that can reduce the network game server load burdened by surging number of users. The study adopted a contents-based clustering technique. Recently, skyrocketing number of clients in on-line games causes overloads on specific game servers, and the consequent server-instability brings the worst situation: a server failure. To cope with this problem, one can install more high-powered servers or be equipped with back-up servers, which is often inefficient in terms of cost performance. To solve this problem, the present study examined the technology enhancing the performance and efficiency of game servers by reducing the loads of specific game servers. In doing this, this study used the clustering technology to compose game servers classified by their contents and carried out appropriate load balancing to numerous clients with load balancers in each region.
Abstract
General replacement policy includes document-based LRU or LFU technique and other various replacement policies are used to replace the documents within cache effectively. But, these replacement policies function only with regard to the time and frequency of document request, not considering the popularity of each web site. In this paper, we present the document replacement policies with regard to the popularity of each web site, which are suitable for modern network environments to enhance the hit-ratio and efficiently manage the contents of cache by effectively replacing documents on intermittent requests by new ones.
Abstract
Recently, several main-memory index structures have been proposed to reduce the impact of secondary cache misses. In mainmemory storage systems, secondary cache misses have a substantial effect on the performance of index structures. However, recent studies still stiffer from secondary cache misses when visiting each level of index tree. In this paper, we propose a new index structure that minimizes the total amount of cache miss latency. The proposed index structure prefetched grandchildren of a current node. The basic structure of the proposed index structure is based on that of the CSB+-Tree, which uses the concept of a node group to increase fan-out. However, the insert algorithm of the proposed index structure significantly reduces the cost of a split. The superiority of our algorithm is shown through performance evaluation.
Abstract
This paper embodies the agent based cinder monitoring system which supports PDA(Personal Digital Assistant). Monitoring system automatically manages data by using data managing agents such as a state managing agent, a location managing agent, a badness managing agent, a circumstances managing agent, etc, and uses a massive data processing agent to manage massive data. The development of agent based data monitoring system for the stable cinder reuse will be an epoch-making method to develop the process mechanized or manual-labored that widely spreads into the real-time automated process.
Abstract
Anime is very popular in Japan, it has also gained a following in America and is beginning to hit the mainstream. Anime is gaining popularity in the United States as it is shown more on television, most noticeably on the Sci-Fi Channel with shows such as Saturday Anime and during Anime Week and on Cartoon Network with shows such as Sailor Moon and Dragon Ball Z being shown every weekday during the Toonami block. In this paper, I present the key factors behind the success of anime in USA. To find out the factors, I research literature and simple survey. The differences of anime from us animation make anime popular. Anime-related goods such as video games, trading cards, and characters' jewelry aid the anime growing popularity. A booming trend in admiration for Japan is one of the key factors behind anime's success. In spite of disputing about Japanese animation, anime is starting to have some influence on US animation and also young American. Anime's success factors in USA could suggest that Korean Manhwa and Korean animation have to prepare strategies for rising popularity in oversea.
Abstract
Load redistribution is a critical resource in computer system. In sender-initiated load redistribution algorithms, the sender continues to send unnecessary request messages for load transfer until a receiver is found while the system load is heavy. These unnecessary request messages result in inefficient communications, low CPU utilization, and low system throughput in distributed systems. To solve these problems, we propose a genetic algorithm based approach for improved sender-initiated load redistribution in distributed systems. Compared with the conventional sender-initiated algorithms, the proposed algorithm decreases the response time and task processing time.