• The Transactions of the Korea Information Processing Society
• /
• v.3 no.7
• /
• pp.1880-1893
• /
• 1996

In this paper, we propose the fuzzy traffic control method in ABR service for the effective use of ATM link. This method, a modified version of EPRCA which is one of rate control methods in ABR service, controls the values of the transmission rates of source by using the fuzzy traffic inference based on switch buffer size and buffer variate rate. For this method, we developed a model and algorithm of the fuzzy traffic control method and a fuzzy traffic controller, after studying fuzzy and neural networks which applied to ATM traffic control and EPRCA. For the fuzzy traffic controller, we also designed a membership function, fuzzy control rules and a max-min inferencing method. We conducted a simulation and compared the link utilization of the fuzzy traffic control method with that of the EPRCA method. The results of the simulation indicated that, compared to EPRCA, the fuzzy traffic control method improves the link utilization by 2.3% in a normal distribution model and by 2.7% in the MMPP model of the source.

• The KIPS Transactions:PartA
• /
• v.17A no.3
• /
• pp.113-120
• /
• 2010

Even networks were introduced as a class of fault-tolerant multiprocessor networks and analyzed so many useful properties and algorithms such as simple routing algorithms, maximal fault tolerance, node disjoint path. Introduced routing algorithms and node disjoint path algorithms are proven to be optimal. However, it has not been introduced to constructing scheme for edge-disjoint spanning trees in even networks. The design of edge-disjoint spanning trees is a useful scheme to analyze for measuring the efficiency of fault tolerant of interconnection network and effective broadcasting. Introduced routing algorithm or node disjoint path algorithm are for the purpose of routing or node disjoint path hence they are not applicable to constitute edge disjoint spanning tree. In this paper, we show a construction algorithm of edge-disjoint spanning trees in even network $E_d$.

• The KIPS Transactions:PartD
• /
• v.14D no.3 s.113
• /
• pp.293-302
• /
• 2007

The study of the web graph yields valuable insight into web algorithms for crawling, searching and community discovery, and the sociological phenomena which characterize its evolution, also it is useful for understanding the evolution process of web graph and predicting the scale of the Web. In this paper, we report experimental results on properties of the Korea web graph with over 116 million pages and 2.7 billion links. We indicate to study the Korea web properties such as the power law phenomenon and then to analyze the similarity and difference between the global and Korea web graph. Our analysis reveals the Korea web graph have different properties compared with the global web graph from the structure to the evolution of the Web. Finally, a number of measurements of the evolution of the Korea web graph ill be represented.

• The KIPS Transactions:PartA
• /
• v.10A no.5
• /
• pp.571-578
• /
• 2003

The appearnace of web technology has accelerated the development of the multimedia technology, the computer communication technology and the multimedia application contents. Researches on WBI(Web-based Instruction) system have combined the technology of the digital library and LOD,. REcently WBI(Web-based Instruction) model which is based on web has been proposed in the part of the new activity model of teaching-learning. As the demand of the customized coursewares from the lwarners is increased, the needs of the efficient and automated education agents in the web-based instruction are recognized. In this paper we propose a system monitors learner's behaviors constantly, evaluates them, and calculates his accomplishment. And the system offers suitable course to learner applying this accomplishment degree to agent's schedules. Therefore, the learner achieves an active and complete learning from the repeated and suitable course semantic-based retrieval.

• The KIPS Transactions:PartD
• /
• v.13D no.2 s.105
• /
• pp.279-286
• /
• 2006

One of the widely used methods for product recommendation in Internet storefronts is matching product features against target customer profiles. When using this method, it's very important to choose a suitable subset of features for recommendation efficiency and performance, which, however, has not been rigorously researched so far. In this paper, we utilize a dataset collected from a virtual shopping experiment in a Korean Internet book shopping mall to compare several popular methods from other disciplines for selecting features for product recommendation: the vector-space model, TFIDF(Term Frequency-Inverse Document Frequency), the mutual information method, and the singular value decomposition(SVD). The application of SVD showed the best performance in the analysis results.

• The KIPS Transactions:PartB
• /
• v.8B no.6
• /
• pp.595-600
• /
• 2001

Recently, WBI model which is based on web has been proposed in the part of the new activity model of teaching-learning. The demand for the customized coursewares which is required from the learners is increased, the needs of the efficient and automated education agents in the web-based instruction are recognized. But many education systems that had been studied recently did not service fluently the courses which learners had been wanting and could not provide the way for the learners to study the learning weakness which is observed in the continuous feedback of the course. In this paper we propose design of multi-agent system for course scheduling of learner-oriented using weakness analysis algorithm. First, proposed system monitors learner's behaviors constantly, evaluates them, and calculates his accomplishment. From this accomplishment, the multi-agent schedules the suitable course for the learner. The learner achieves an active and complete learning from the repeated and suitable course.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.5
• /
• pp.733-745
• /
• 1995

This study is aimed at construction of a translator for a functional programming language. For this goal we define a functional programming language which has lazy semantics and develop a translator for it. The execution model selected is the G-machine-based combinator graph reduction. The translator is composed of 4 phases and translates a source program to a C program. The first phase of the translator translates a source program to a enriched lambda- calculus graph, the second phase transforms a lambda-calculus graph into supercombinators, the third phase translates supercombiantors to a G program and the last phase translates the G program to a C program. The final result of the translator, a C program, is compiled to an executable program by C compiler. The translator is implemented in C using compiler development tools such as TACC and Lex, under the UNIX environments. In this paper we present the design and implementation techniques for developing the translator and show results by executing some test problems.

• The KIPS Transactions:PartA
• /
• v.10A no.2
• /
• pp.149-156
• /
• 2003

In the latest medical world, the attempt of reconstructing anatomical human body system using computer graphics technology awakes people's interests. Actually, this trial has been made in dentistry too. There are a lot of practicable technology fields using computer graphics in dentistry For example, 3D visualization and measurement of dental data, detection of implant location, surface reconstruction for restoring artificial teeth in prostheses and relocation of teeth in orthodontics can be applied. In this paper, we propose methods for definitely detecting the geometric features of teeth such as cusp, ridge, fissure and pit, which have been used as most important characteristics in dental applications. The proposed methods are based on the approximate curvatures that are measured on a 3D tooth model made by scanning an impression. We also give examples of the geometric features detected by using the proposed methods. Comparing to other traditional methods visually, the methods are very useful in detecting more accurate geometric features.

• The KIPS Transactions:PartB
• /
• v.8B no.6
• /
• pp.633-640
• /
• 2001

Mobile agent is a software program that provides autonomy and mobility for the users in the networked computers by deciding its own movement place. Since mobile agent does not keep up the network connection and migrate its executable code under its own control, it can be often used in the unstable network conditions such as the wireless network and the heavy traffic network. In this paper, we show that the electronic commerce system can be developed efficiently to retrieve and trade the goods in the mobile computing environment by using the mobile agent paradigm. Multiple mobile agents migrate into the market directly, then negotiate and trade autonomously relevant goods and services. The execution result and executable code of the mobile agent are returned to the home place and reported to the users. We show that the mobile agent paradigm is suitable to build the mobile electronic commerce system by designing and prototyping the mobile market system.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.5
• /
• pp.619-625
• /
• 1995

This paper constructs a feed-forward learning complex algorithm which replaced by the backpropagation learning. This algorithm first attempts to organize the pattern vectors into clusters by Generalized Learning Vector Quantization(GLVQ) clustering algorithm(Nikhil R. Pal et al, 1993), second, regroup the pattern vectors belonging to different clusters, and the last, recognize into regrouping pattern vectors by single layer perceptron. Because this algorithm is feed-forward learning algorithm, time is less than backpropagation algorithm and the recognition rate is increased. We use 250 ASCII code bit patterns that is normalized to 16$\times$8. As experimental results, when 250 patterns devide by 10 clusters, average iteration of each cluster is 94.7, and recognition rate is 100%.