• Current Research on Agriculture and Life Sciences
• /
• v.6
• /
• pp.163-169
• /
• 1988

This study was conducted to predict the density changes according to concentration and temperature changes under freezing point. This information is needed for the design of freezing equipment and for the efficient utilization of refrigerating system. Orange juice, Apple juice, Grape juice and Sucrose solution were used for the measurement of density in this study at the temperature range from $-5^{\circ}C$ to $-40^{\circ}C$ and at the concentration range from 10 to 40%. The unfrozen water fraction of samples was determined by Heldman's method. The density values were determined by measuring the weight of a frozen solution at each temperature with a known volume. Solutions were placed in the thick-walled aluminum tubes. When the solution was frozen the excess ice was removed with a razor until the surface of the ice was flush with the top of the aluminum tube. The tube and ice were weighted immediately. Knowing the volume, tare weight, and final weight, the density could be determined. With this procedure, the data of density and unfrozen water fraction for fruit juices and sucrose solution were collected. The density prediction models of fruit juices and sucrose solution under freezing point were established by the optimization computer program with measured experimental data.

• Journal of KIISE:Information Networking
• /
• v.29 no.1
• /
• pp.65-76
• /
• 2002

QoS routing is a routing technique for finding feasible path that satisfies QoS requirements required by application programs. Since QoS routing determines such paths in terms of dynamic network state, it satisfies the requirement of applications and increases the utilization of the network. The overhead is, however, generated by routers to exchange the information of the dynamic state of network. In order to reduce this protocol overhead, a timer based update mechanism is proposed in which router checks the change of the network status periodically and network state information is exchanged if the change is greater than a certain value. Using large update period makes, though, routing performance irresponsive to the parameters which determine the update of the network state of the router. In addition to this, large update period may result in inaccurate network state information at routers and cause resource reservation failure. The resource reservation failure generates additional overhead to cancel the resource reservation of the part of the path. In this paper, we propose mechanisms enhancing the existing network state update policy with respect to these two problems. Performance of the proposed schemes are evaluated through a course of simulation.

• Journal of Information Management
• /
• v.43 no.4
• /
• pp.191-210
• /
• 2012

Scholarly science citation data is typically of large volume and consists of a variety of data. Moreover, the volume of data is increasing more and more. Therefore, there are some requirements to store and manage the data efficiently and Korea Institute of Science and Technology Information (KISTI) develops Korea Science Citation Database (KSCD) which manage and serve very large-volume of korea science technique information including citation data. However, current services based on KSCD are not enough for various users. Thus, it is important issue to offer a variety of services using KSCD. For example, if a user searches articles described by a specific author, then a user may want to find not only the articles cited by a certain author but also those articles that study similar topics. However, it is not always easy to provide these services with citation data. Therefore, this paper surveys studies about services using citation data in order to find approaches for better utilizing KSCD. Especially, this paper considers data mining techniques, because data mining is one of the main techniques to extracting semantic information from big data. Therefore, this paper discusses methods for utilizing large volume of KSCD based on data mining technique.

• Journal of Digital Convergence
• /
• v.14 no.5
• /
• pp.263-271
• /
• 2016

Localizing an object in image is a common task in the field of computer vision. As the existing methods provide a detection for the single object in an image, they have an utilization limit for the use of the application, due to similar objects are in the actual picture. This paper proposes an efficient method of object localization for image recognition. The new proposed method uses color correlation back-projection in the YCbCr chromaticity color space to deal with the object localization problem. Using the proposed algorithm enables users to detect and locate primary location of object within the image, as well as candidate regions can be detected accurately without any information about object counts. To evaluate performance of the proposed algorithm, we estimate success rate of locating object with common used image database. Experimental results reveal that improvement of 21% success ratio was observed. This study builds on spatially localized color features and correlation-based localization, and the main contribution of this paper is that a different way of using correlogram is applied in object localization.

• KIPS Transactions on Computer and Communication Systems
• /
• v.9 no.10
• /
• pp.221-230
• /
• 2020

Supercomputer that shares limited resources to multiple users needs a way to optimize the execution of application. For this, it is useful for system administrators to get prior information and hint about the applications to be executed. In most high-performance computing system operations, system administrators strive to increase system productivity by receiving information about execution duration and resource requirements from users when executing tasks. They are also using profiling techniques that generates the necessary information using statistics such as system usage to increase system utilization. In a previous study, we have proposed a scheduling optimization technique by developing a hardware performance counter-based profiling technique that enables characterization of applications without further understanding of the source code. In this paper, we constructed a profiling testbed cluster to support optimal execution of the supercomputer and experimented with the scalability of the profiling method to analyze application characteristics in the built cluster environment. Also, we experimented that the profiling method can be utilized in actual scheduling optimization with scalability even if the application class is reduced or the number of nodes for profiling is minimized. Even though the number of nodes used for profiling was reduced to 1/4, the execution time of the application increased by 1.08% compared to profiling using all nodes, and the scheduling optimization performance improved by up to 37% compared to sequential execution. In addition, profiling by reducing the size of the problem resulted in a quarter of the cost of collecting profiling data and a performance improvement of up to 35%.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.11
• /
• pp.45-52
• /
• 1994

In recent days low cost, high performance microprocessors have led to construction of medium scale shared memory multiprocessor systems with shared bus. Such multiprocessor systems are heavily influenced by the structures of memory systems and memory systems become more important factor in design space as microprocessors are getting faster. Even though local cache memories are very common for such systems, the latency on access to the shared memory limits throughput and scalability. There have been many researches on the memory structure for multiprocessor systems. In this paper, an asynchronous memory architecture is proposed to utilize the bandwith of system bus effectively as well as to provide flexibility of implementation. The effect of the proposed architecture if shown by simulation. We choose, as our model of the shared bus is HiPi+Bus which is designed by ETRI to meet the requirements of the High-Speed Midrange Computer System. The simulation is done by using Verilog hardware decription language. With this simulation, it is explored that the proposed asynchronous memory architecture keeps the utilization of system bus low enough to provide better throughput and scalibility. The implementation trade-offs are also described in this paper. The asynchronous memory is implemented and tested under the prototype testing environment by using test program. This intensive test has validated the operation of the proposed architecture.

• Journal of KIISE:Computer Systems and Theory
• /
• v.34 no.9
• /
• pp.425-434
• /
• 2007

Even though Internet backbone speeds have increased in the last few years due to projects like Internet 2 and NGI, many high performance distributed applications are able to achieve only a small fraction of the available bandwidth. The cause of such problem is due to a character of TCP/IP. The primary goal of this protocol is reliable data transmission. Therefore high speed data transmission didn't be considered when TCP/IP is designed. Hence several researchers have been studied in order to solve the problem of TCP/IP. One of these research results, parallel transfer technique, solves this problem to use parallel TCP connections on application level. Additionally, this technique is compatibility. Recently, these researchers have been studied a mechanism to decide the number of parallel TCP connections. However, some researchers reported the number of parallel TCP connection base on only empirical results. Although hardware performance of host affects transmission rate, the hardware performance didn't be considered in their works. Hence, we collect all data related to transmission rate, such as hardware state information (cpu utilization, interrupt, context switch). Then, we analyzed collected data. And, we suggest a new mechanism determining number of parallel TCP connections for maximization of performance based on our analysis.

• Journal of the Korea Convergence Society
• /
• v.9 no.9
• /
• pp.191-197
• /
• 2018

With a population of more than 10 million people worldwide, MegaCity was only three in 1975, but it is expected to grow to 24 in 2013 and more than 30 in 2025 and more than 3 billion worldwide by 2050 It is expected to be absorbed into smart city. Especially in Asia and Africa, urbanization is expected to proceed rapidly. As the urbanization progresses and the population living in the cities increases, there are various problems such as rapid increase of energy consumption, congestion of traffic, various aging of the infrastructure and the like. As a result, smart city is emerging as a new alternative for solving urban problems. Smart City is rapidly expanding with the development of related technologies and can improve costs, improve urban services, improve quality of life, productivity and sustainability. Therefore, this paper analyzes the size and trend of the domestic and overseas smart city market, and analyzes the smart city related policies, trends and case studies of major countries to see the development status and market of smart city related industries, Present a business utilization model.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.5
• /
• pp.40-52
• /
• 2010

A mobile ad hoc network is instant and heuristic, and it is also vulnerable and volatile. Since topology and route changes are frequent, no single routing protocol designed for a conventional network performs well. Some protocols suffer from significant performance degradation when the number of nodes increases, or when nodes become highly mobile. In this paper we investigate a way to adaptively select a routing protocol that fits to the real-time network conditions. The first phase of our study is to analyze the performances of two classes of routing protocols under various network scenarios. The second phase consists of constructing a routing protocol selection reference. All nodes continue to monitor the status of neighbor nodes and control packets exchanged. Then, the aggregated information is periodically compared against the protocol selection reference. The selected routing protocol is maintained throughout the network until the network property changes substantially. The performance of the proposed algorithm is verified by a set of computer simulations using the OPNET modeler. The experimental results show that selectively changing routing protocol adaptive to the network conditions greatly improves the efficacy of bandwidth utilization.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.6
• /
• pp.11-18
• /
• 2009

In this paper, a hierarchical link allocation algorithm between mobile stations (MSs) and the corresponding base station (BS) by an optimal utilization of relay stations (RSs) is proposed to improve throughput of RS systems. In the proposed hierarchical algorithm, each RS operates cognitive radio functions to sense the degree of satisfaction in the quality of services (QoSs) and then selects the candidate set of MSs to have links with the RS. Such information is reported to the BS, where an auction process is performed to get an optimal allocation of communication links between the MSs and the BS. To maximize system throughput, the proposed auction algorithm is conducted upon bidding prices of communication links, considering both the co-channel interference (CCI) information shared among adjacent cells and the QoS enhancement information for each MS collected from RSs. The BS then switches the communication links of the auction winner MSs through the corresponding RS. The computer simulation shows that the proposed algorithm enhances the user QoS more than the conventional algorithm, especially for RS systems with more users requiring higher QoS. The proposed algorithm has also been proved to have more robust performance than the conventional one when the traffic load is higher and the CCI becomes stronger.