• Journal of Korea Multimedia Society
• /
• v.13 no.11
• /
• pp.1643-1656
• /
• 2010

It is necessary to develop a system to judge inferiority of goods to minimize the loss at small factories in which produces various kinds of goods with small amounts. That system can be developed based on HTM theory. HTM is a model to apply the operation principles of the neocortex in human brain to the machine learning. We have to build the trained HTM network to use the HTM-based machine learning system. It requires the knowledge for the HTM theory. This paper presents the design and implementation of the training system to support the development of HTM networks which recognize the molding parts to judge its badness. This training system allows field technicians to train the HTM network with high accuracy without the knowledge of the HTM theory. It also can be applied to any kind of the HTM-based judging systems for molding parts.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.6
• /
• pp.583-591
• /
• 2000

Caching mechanisms have been studied extensively to buffer the speed gap of hierarchical storages in the context of cache memory, paging system, and buffer management system. As the wide-area distributed environments such as the WWW extend broadly, caching of remote objects becomes more and more important. In the wide-area distributed environments, the cost and the benefit of caching an object is not uniform due to the location of the object; which should be considered in the cache replacement algorithms. For online operation, the time complexity of the replacement algorithm should not be excessive. To date, most replacement algorithms for the wide-area distributed environments do not meet both the non-uniformity of objects and the time complexity constraint. This paper proposes a replacement algorithm which considers the non-uniformity of objects properly; it also allows for an efficient implementation. Trace-driven simulations show that proposed algorithm outperforms existing replacement algorithms.

• Journal of KIISE
• /
• v.42 no.4
• /
• pp.427-433
• /
• 2015

The rapid advancement of computing technology has triggered the need for fast data I/O processing and high-performance storage technology. Next generation memory technology, which we refer to as new memory, is anticipated to be used for high-performance storage as they have excellent characteristics as a storage device with non-volatility and latency close to DRAM. This research proposes NTL (New memory Translation layer) as a technology to make use of new memory as storage. With the addition of NTL, conventional I/O is served with existing mature disk-based file systems providing compatibility, while new memory I/O is serviced through the NTL to take advantage of the byte-addressability feature of new memory. In this paper, we describe the design of NTL and provide experiment measurement results that show that our design will bring performance benefits.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.30 no.7
• /
• pp.144-149
• /
• 2002

This paper presents a technique for real time multiprocessor parallel processing to develop an avionic system computer(ASC) which integrates the avionics control, navigation and fire control, cursive and raster graphic symbol generation into one line replaceable unit. The proposed method has optimal performance by adopting a logically asymmetric structure between four 32bit RISC processors based on the master-slave multiprocessing, a tightly coupled interaction level with the time shared common bus and global memory, and an efficient bus arbitration algorithm. The ASC has been verified through a series of flight tests. The relevant tests also have been rigorously conducted on the prototype ASC such as electrical test, environmental test, and electromagnetic interference test.

• The Journal of the Korea Contents Association
• /
• v.12 no.2
• /
• pp.30-39
• /
• 2012

In these day, some of IT venders already were going to cloud computing market, as well they are going to expand their territory for the cloud computing market through that based on their hardware and software technology, making collaboration between hardware and software vender. Distributed file system is very mainly technology for the cloud computing that must be protect performance and safety for high levels service requests as well data store. This paper introduced distributed file system for cloud computing and how to use this theory such as memory database, Hadoop file system, high availability database system. now In the market, this paper define a very large distributed processing architect as a reference by kind of distributed file systems through using technology in cloud computing market.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.2 s.40
• /
• pp.7-13
• /
• 2006

The advent of Semantic Web has generated several methods that can access the data on the web. Thus, it is necessary to handle the data by accessing the current web ontology as well as the existing knowledge base system. Web ontology languages are RDF(Resource Description Framework), DAML-OIL, OWL(Web Ontology Language), and so on. This paper presents the creation and the method of the ontology object model that can access, represent, and process the web ontology and the existing knowledge base. Unlike the existing access approach of web ontology using the model on memory constructed by each parser, we divide the model of web ontology into three layers such as frame-based ontology layer, generic ontology layer, and functional ontology layer. Generic ontology layer represents the common vocabulary among several domains and functional ontology layer contains the dependent vocabulary to each ontology respectively. Our model gets rid of the redundancy of the representation and enhances the reusability. Moreover, it can provide the easy representation of knowledge and the fast access of the model in the application.

• Journal of the Korea Computer Graphics Society
• /
• v.19 no.1
• /
• pp.11-20
• /
• 2013

This paper introduces a user interface for large 3D meshes in mobile systems, which have limited memory, screen size and battery power. A large 3D mesh is divided into partitions and simplified in multi-resolutions so a large file is transformed into a number of small data files and saved in a PC server. Only selected small files specified by the user are hierarchically transmitted to the mobile system for 3D browsing and rendering. A 3D preview in a pop-up shows a simplified mesh in the lowest resolution. The next step displays simplified meshes whose resolutions are automatically controlled by the user interactions. The last step is to render a set of detailed original partitions in a selected range. As a result, while minimizing using mobile system resources, our interface enables us to browse and display 3D meshes in mobile systems through real-time interactions. A mobile 3D viewer and a 3D app are also presented to show the utility of the proposed user interface.

• Journal of KIISE:Computing Practices and Letters
• /
• v.5 no.5
• /
• pp.639-650
• /
• 1999

Generally, a performance management consists of the iterative process of performance monitoring, performance analysis, and performance tuning. In this paper, we describe the design and implementation of performance monitor and performance tuner which can be used on the top of SPAX, also known as TICOM IV. SPAX has a hierarchical structure. All nodes, each of which has a local memory, are connected to the interconnection network and constructed to form clusters. Therefore, it is necessary to develop a new performance monitor reflecting the underlying hierarchical structure of SPAX, to implement performance monitoring more effectively. Implemented performance monitor can monitor the state of nodes, clusters, and total system of SPAX at realtime. And, implemented performance tuner can change the value of variables related to the performance of SPAX. System manager can perform an effective performance management by using the proposed performance management tools.

• Journal of Korea Multimedia Society
• /
• v.10 no.11
• /
• pp.1367-1383
• /
• 2007

A sensor network consists of a network of sensors that can perform computation and also communicate with each other through wireless communication. Some important characteristics of sensor networks are that the network should be self administered and the power efficiency should be greatly considered due to the fact that it uses battery power. In sensor networks, when large amounts of various stream data is produced and multiple queries need to be processed simultaneously, the power efficiency should be maximized. This work proposes a technique to create an index on multiple monitoring queries so that the multi-query processing performance could be increased and the memory and power could be efficiently used. The proposed SMILE tree modifies and combines the ideas of spatial indexing techniques such as k-d trees and R+-trees. The k-d tree can divide the dimensions at each level, while the R+-tree improves the R-tree by dividing the space into a hierarchical manner and reduces the overlapping areas. By applying the SMILE tree on multiple queries and using it on stream data in sensor networks, the response time for finding an indexed query takes in some cases 50% of the time taken for a linear search to find the query.

• Journal of the Korea Computer Graphics Society
• /
• v.15 no.3
• /
• pp.19-26
• /
• 2009

In this paper, a new adaptive vertex clustering using a KD-tree is presented for 3D mesh partitioning. A vertex clustering is used to divide a huge 3D mesh into several partitions for various mesh processing. An octree-based clustering and K-means clustering are currently leading techniques. However, the octree-based methods practice uniform space divisions and so each partitioned mesh has non-uniformly distributed number of vertices and the difference in its size. The K-means clustering produces uniformly partitioned meshes but takes much time due to many repetitions and optimizations. Therefore, we propose to use a KD-tree to efficiently partition meshes with uniform number of vertices. The bounding box region of the given mesh is adaptively subdivided according to the number of vertices included and dynamically determined axis. As a result, the partitioned meshes have a property of compactness with uniformly distributed vertices.