• International Journal of Computer Science & Network Security
• /
• v.21 no.3
• /
• pp.304-310
• /
• 2021

The paper presents problems of optimization of the synthesis of embedded systems, in particular Pareto optimization. The model of such a system for its design for high-level of abstract is based on the classic approach known from the theory of task scheduling, but it is significantly extended, among others, by the characteristics of tasks and resources as well as additional criteria of optimal system in scope structure and operation. The metaheuristic algorithm operating according to this model introduces a new approach to system synthesis, in which parallelism of task scheduling and resources partition is applied. An algorithm based on a genetic approach with simulated annealing and Boltzmann tournaments, avoids local minima and generates optimized solutions. Such a synthesis is based on the implementation of task scheduling, resources identification and partition, allocation of tasks and resources and ultimately on the optimization of the designed system in accordance with the optimization criteria regarding cost of implementation, execution speed of processes and energy consumption by the system during operation. This paper presents examples and results for multi-criteria optimization, based on calculations for specifying non-dominated solutions and indicating a subset of Pareto solutions in the space of all solutions.

• Journal of the Korean Institute of Landscape Architecture
• /
• v.20 no.2
• /
• pp.27-42
• /
• 1992

IN urban areas, public outdoor recreation opportunities are limited, traditional funding sources are being eraded, and crowding as well as ecological damage appear inevitable, these developments may require new analysis on the prospective policy of park, with the evaluation of the trend of amenity resources and recreation values, 16 parks were taken as informants in Deagu city area, the data for this research were collected 2,942 samples by the on-site-interview. The abstracted results of amenity elements were revealed as institutions and resource types, the attraction of resources was about twice as much as that of institutions. The resources is to be classified into two items ; national resources and human resources. The former is about five times as mcuh atractive as the latter. The attraction of natural resources consists in the atmospheric factors(35%), the biological factors(28%), the topographical factors(19%), and the scenery factors(18%). While, the attraction of human resources consists in the cultural factors(54%), the social factors(46%). The attraction of the base institutions is very low. The attraction of the static institution is three times as much as that of that of the dynamic institution. The above tendency is a general trend in Daegu city. But when we are taking into consideration in datail, we find that there is great difference among the green tract of land of the park. When the amenity resources of one's destination was used for the value of recreation, the pattern of attraction variables as a physical characteristics could explain 58%. Based on those result, this study is a small but important guidence for decision makings concerning to the allocation of scarce amenity resources.

• Journal of Korean Society of Forest Science
• /
• v.86 no.2
• /
• pp.208-213
• /
• 1997

Tree form characteristics and biomass distribution and volume increment for Quercus spp., Larix leptolepis and Pinus koraiensis growing in Kwangju-Gun, Kyunggi-Do were investigated. P. koraiensis showed higher crown percentage than L. leptolepis, indicating that P. koraiensis maybe shade-tolerant species. Biomass allocation by tree height showed significant difference among three species. Stem biomass distributed more dimminishing along tree height with Quercus spp. and P. koraiensis than L. leptolepis. The allometric pattern of leaf-and branch biomass appeared as normal distribution. Present biomass was highest in L. leptolepis showing 171.1tons/ha and followed by P. koraiensis and Quercus spp, with 75.3tons/ha and 61.6tons/ha, respectively.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.4
• /
• pp.1638-1654
• /
• 2018

The heterogeneous network (HetNet) has been one of the key technologies in Long Term Evolution-Advanced (LTE-A) with growing capacity and coverage demands. However, the introduction of femtocells has brought serious co-layer interference and cross-layer interference, which has been a major factor affecting system throughput. It is generally acknowledged that the resource allocation has significant impact on suppressing interference and improving the system performance. In this paper, we propose a hybrid-clustering algorithm based on the $Mat{\acute{e}}rn$ hard-core process (MHP) to restrain two kinds of co-channel interference in the HetNet. As the impracticality of the hexagonal grid model and the homogeneous Poisson point process model whose points distribute completely randomly to establish the system model. The HetNet model based on the MHP is adopted to satisfy the negative correlation distribution of base stations in this paper. Base on the system model, the spectrum sharing problem with restricted spectrum resources is further analyzed. On the basis of location information and the interference relation of base stations, a hybrid clustering method, which takes into accounts the fairness of two types of base stations is firstly proposed. Then, auction mechanism is discussed to achieve the spectrum sharing inside each cluster, avoiding the spectrum resource waste. Through combining the clustering theory and auction mechanism, the proposed novel algorithm can be applied to restrain the cross-layer interference and co-layer interference of HetNet, which has a high density of base stations. Simulation results show that spectral efficiency and system throughput increase to a certain degree.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.1
• /
• pp.237-243
• /
• 2015

In this paper, we consider a cascaded type of control architecture for a multi motor-based feedback control system and propose an ADC (Analog to Digital Converter) resource allocation method to efficiently utilize the limited ADC resources. The purpose of the resource allocation method is to minimize both the motor position measurement error and the d-q current measurement error. The cascaded type of control architecture is applied in parallel to each motor to independently control the speed of a motor in the multi motor control system. All the control algorithms are implemented by software using a single microcontroller without using additional microcontrollers. It is illustrated by experiments that the speed and the torque of each motor are controlled precisely by the proposed control architecture with the efficient ADC allocation method.

• Journal of Communications and Networks
• /
• v.18 no.5
• /
• pp.744-761
• /
• 2016

For about the past decade and a half research efforts into cognitive radio networks (CRNs) have increased dramatically. This is because CRN is recognized as a technology that has the potential to squeeze the most out of the existing spectrum and hence virtually increase the effective capacity of a wireless communication system. The resulting increased capacity is still a limited resource and its optimal allocation is a critical requirement in order to realize its full benefits. Allocating these additional resources to the secondary users (SUs) in a CRN is an extremely challenging task and integer programming based optimization tools have to be employed to achieve the goals which include, among several aspects, increasing SUs throughput without interfering with the activities of primary users. The theory of the optimization tools that can be used for resource allocations (RA) in CRN have been well established in the literature; convex programming is one of them, in fact the major one. However when it comes to application and implementation, it is noticed that the practical problems do not fit exactly into the format of well established tools and researchers have to apply approximations of different forms to assist in the process. In this survey paper, the optimization tools that have been applied to RA in CRNs are reviewed. In some instances the limitations of techniques used are pointed out and creative tools developed by researchers to solve the problems are identified. Some ideas of tools to be considered by researchers are suggested, and direction for future research in this area in order to improve on the existing tools are presented.

• Journal of KIISE:Computing Practices and Letters
• /
• v.9 no.4
• /
• pp.410-419
• /
• 2003

The buffer cache of general operating systems such as Linux manages file data by using global block replacement policy and read ahead. As a result, multimedia data with a low locality of reference and various consumption rate have low cache hit ratio and consume additional buffers because of read ahead. In this paper we have designed and implemented a new buffer allocation algorithm for multimedia data on Linux. Our approach keeps one read-ahead cache per every opened multimedia file and dynamically changes the read-ahead group size based on the buffer consumption rate of the file. This distributes resources fairly and optimizes the buffer consumption. This paper compares the system performance with that of Linux 2.4.17 in terms of buffer consumption and buffer hit ratio.

• Journal of Internet Computing and Services
• /
• v.7 no.3
• /
• pp.41-51
• /
• 2006

In the case of CDMA-based packet data systems such as 1xEV-DO which are designed to support high rate services, BSs transmit data packets with a maximum power based on time multiplexing mode such that only one user can be serviced at a time. In this paper, we propose a joint power allocation and scheduling algorithm for 1xEV-DO-like systems in which we adopt a code division multiplexing (CDM) transmission method in the downlink common channel in order to utilize channel orthogonality such that we can serve more than one user at a time slot especially when there exist remaining resources after serving the firstly selected user by the scheduler. Simulation results demonstrate that the proposed scheme can improve the performances of conventional schemes such as the maximum rate and the proportional fair algorithms.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.3
• /
• pp.264-276
• /
• 2000

Recent advances of technologies make easy sharing various information and utilizing system resources on the Internet. Especially, code migration using applets of Java supports the distribution of programs on the web environment, and also browsers executing the applets guarantee the reliability of a migrated codes. In this paper, we describe the design and implementation of a web-based parallel processing system, which distributes migratable codes of a large job, makes the distributed codes to execute in parallel, and controls and gathers the results of each execution. The hosts participate in the computation reside on the Internet, spreaded out geographically, and the heterogeneity and the variability among them are severe. Thus, task allocation considering the performance differences and the adaptability to the severe variability are necessary. We present an adaptive task allocation algorithm applied to our system and the performance evaluation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39A no.9
• /
• pp.557-559
• /
• 2014

We propose an efficient resource allocation scheme based on interference awareness for D2D (Device-to-Device) communication in cellular networks. Recently, many researchers have studied how to allocate frequency resources to DUE (D2D User Equipment) with full interference channel information. However, it is difficult to assume a scenario where instantaneous interference information between the CUE (Cellular UE) and DUE is known to the BS (Base Station). To tackle this problem, we proposed in this paper a new scheme in which the BS allocates a resource to CUE and DUE without a full channel information and can aware interference based on only transmit power and distance between UEs. Simulation results show effectiveness of the proposed scheme.