• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.24 no.2
• /
• pp.99-104
• /
• 2024

In the deficiency of an exact solution yielding algorithm, approximate algorithms remain as a solely viable option to the Minimum Linear Arrangement(MinLA) problem of Binary tree. Despite repeated attempts by a number of algorithm on k = 10, only two of them have been successful in yielding the optimal solution of 3,696. This paper therefore proposes an algorithm of O(n) complexity that delivers the exact solution to the binary tree. The proposed algorithm firstly employs an In-order search method by which n = 2^k - 1 number of nodes are assigned with a distinct number. Then it reassigns the number of all nodes that occur on level 2 ≤ 𝑙 ≤ k-2, (k = 5) and 2 ≤ 𝑙 ≤ k-3, (k = 6), including that of child of leaf node. When applied to k=5,6,7, the proposed algorithm has proven Chung[14]'s S^(k)_min=2^k-1+4+S^(k-1)_min+2S^(k-2)_min conjecture and obtained a superior result. Moreover, on the contrary to existing algorithms, the proposed algorithm illustrates a detailed assignment method. Capable of expeditiously obtaining the optimal solution for the binary tree of k > 10, the proposed algorithm could replace the existing approximate algorithms.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.24 no.2
• /
• pp.105-111
• /
• 2024

This paper deals with the minimum linear arrangement(MinLA) of a lattice graph, to which an approximate algorithm of linear complexity O(n) remains as a viable solution, deriving the optimal MinLA of 31,680 for 33×33 lattice. This paper proposes a partitioning arrangement algorithm of complexity O(1) that delivers exact solution to the minimum linear arrangement. The proposed partitioning arrangement algorithm could be seen as loading boxes into a container. It firstly partitions m rows into r₁,r₂,r₃ and n columns into c₁,c₂,c₃, only to obtain 7 containers. Containers are partitioning with a rule. It finally assigns numbers to vertices in each of the partitioned boxes location-wise so as to obtain the MinLA. Given m,n≥11, the size of boxes C₂,C₄,C₆ is increased by 2 until an increase in the MinLA is detected. This process repeats itself 4 times at maximum given m,n≤100. When tested to lattice in the range of 2≤n≤100, the proposed algorithm has proved its universal applicability to lattices of both m=n and m≠n. It has also obtained optimal results for 33×33 and 100×100 lattices superior to those obtained by existing algorithms. The minimum linear arrangement algorithm proposed in this paper, with its simplicity and outstanding performance, could therefore be also applied to the field of Very Large Scale Integration circuit where m,n are infinitely large.

• International journal of advanced smart convergence
• /
• v.2 no.2
• /
• pp.19-22
• /
• 2013

As the demand of the LED for lighting that emits light by p-n junction is increasing, studies on heatproof plate technology is being conducted to minimize the temperature of the LED lighting. As for the temperature of the LED devices, their light emitting efficiency decreases and the maximum lifespan drops down to 1/5. Therefore there are heat dissipation studies going on to minimize the heat. For LED heat dissipation, aluminum heat sink plates are mostly used. For this paper, we designed heat sink that fits residential 20W COB LED Down Light; packaged the heat sink and 20W COB and analyzed and evaluated the thermal properties through a Solidworks flow simulation. We are planning to design the optimal heat sink plate to solve the thermal agglomeration considering TIM(Thermal Interface material).

• Journal of Broadcast Engineering
• /
• v.15 no.6
• /
• pp.845-852
• /
• 2010

Collecting statistics from client requests, the broadcast server partitions data items into hot and cold-item sets with the optimal cut-off point. Hot items are broadcast periodically with periods based on their access probabilities. In a time slot with no hot items scheduled, the server broadcasts a proper cold item considering the waiting time and the number of outstanding requests. We analyze the optimal the cut-off point by calculating average response time as a function of the cut-off point. Simulation results show that our proposed algorithm outperforms existing methods in various circumstances.

• International journal of advanced smart convergence
• /
• v.9 no.1
• /
• pp.132-140
• /
• 2020

It is very important to use appropriate nutrition water for crop growth in hydroponic farming facilities. However, in many cases, the supply of nutrition water is not designed with a precise plan, but is performed in a conventional manner. We proposes a forecasting technique for nutrition water requirements based on a data analysis for optimal strawberry production. To do this, the proposed forecasting technique uses linear regression for correlating strawberry production, soil condition, and environmental parameters with nutrition water demand for the actual two-stage strawberry production soil. Also, it includes predicting the optimal amount of nutrition water requires according to the heterogeneous cultivation environment and variety by comparing the amount of nutrition water needed for the growth and production of different kinds of strawberries. We suggested study uses two types of section beds that are compared to find out the best section bed production of strawberry growth. The dataset includes 233 samples collected from a real strawberry greenhouse, and the four predicted variables consist of the total amounts of nutrition water, average temperature, humidity, and CO₂ in the greenhouse.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.8B
• /
• pp.712-721
• /
• 2012

In this paper, we propose an Enhanced cross-layer Geographic Forwarding (EGF) protocol for wireless sensor networks (WSNs). EGF uses an optimal back-off time to make the packet forwarding decisions using only source and destination's location information and energy cost without information about neighbor nodes' location or the number of one hop neighbor nodes. EGF is also a cross-layer protocol by combining efficient asynchronous MAC and geographic routing protocol. The proposed protocol can find optimal next hop location quickly without broadcasting node's location update and with minimizing overhead. In our performance evaluation, EGF has better performance in terms of packet success ratio, energy efficiency and end-to-end delay in wireless sensor networks.

• ETRI Journal
• /
• v.27 no.4
• /
• pp.341-354
• /
• 2005

The adaptation of video according to the heterogeneous and dynamic resource constraints on networks and devices, as well as on user preferences, is a promising approach for universal access and consumption of video content. For optimal adaptation that satisfies the constraints while maximizing the utility that results from the adapted video, it is necessary to devise a systematic way of selecting an appropriate adaptation operation among multiple feasible choices. This paper presents a general conceptual framework that allows the formulation of various adaptations as constrained optimization problems by modeling the relations among feasible adaptation operations, constraints, and utilities. In particular, we present the feasibility of the framework by applying it to a use case of rate adaptation of MPEG-4 video with an explicit modeling of adaptation employing a combination of frame dropping and discrete cosine transform coefficient dropping, constraint, utility, and their mapping relations. Furthermore, we provide a description tool that describes the adaptation-constraint-utility relations as a functional form referred to as a utility function, which has been accepted as a part of the terminal and network quality of service tool in MPEG-21 Digital Item Adaptation (DIA).

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.29 no.11
• /
• pp.96-101
• /
• 2015

In recent years, researches regarding optimal placement of CCTV(Closed-circuit Television) cameras via architecture modeling has been conducted. However, for analyzing surveillance coverage through actual human movement, the application of VA(Video Analytics) function of IP(Internet Protocol) cameras has not been studied. This paper compares two methods using data captured from real-world cameras and data acquired from a virtual environment. In using real cameras, we develop GUI(Graphical User Interface) to be used as a logfile which is stored hourly and daily through VA functions and to be used commercially for placement of products inside a shop. The virtual environment was constructed to emulate an real world such as the building structure and the camera with its specifications. Moreover, suitable placement of the camera is done by recognizing obstacles and the number of people counted within the camera's range of view. This research aims to solve time and economic constraints of actual installation of surveillance cameras in real-world environment and to do feasibility study of virtual environment.

• International journal of advanced smart convergence
• /
• v.8 no.2
• /
• pp.132-139
• /
• 2019

We address the problem about forecasting the direction of stock price movement in the Korea market. Recently, the deep neural network is popularly applied in this area of research. In deep neural network systems, proper parameter initialization reduces training time and improves the performance of the model. Therefore, in our study, we propose a novel parameter initialization technique and apply this technique for the stock price movement prediction model. Specifically, we design a framework which consists of two models: a base model and a main prediction model. The base model constructed with LSTM is trained by using the large data which is generated by a large amount of the stock data to achieve optimal parameters. The main prediction model with the same architecture as the base model uses the optimal parameter initialization. Thus, the main prediction model is trained by only using the data of the given stock. Moreover, the stock price movements can be affected by other related information in the stock market. For this reason, we conducted our research with two types of inputs. The first type is the stock features, and the second type is a combination of the stock features and the Korea Composite Stock Price Index (KOSPI) features. Empirical results conducted on the top five stocks in the KOSPI list in terms of market capitalization indicate that our approaches achieve better predictive accuracy and F1-score comparing to other baseline models.

• International journal of advanced smart convergence
• /
• v.8 no.1
• /
• pp.159-165
• /
• 2019

'4th Industrial Revolution' is accelerating as a core part of creating new growth engines and enhancing competitiveness of businesses. The fourth industrial revolution means the transformation of society and industries that are brought by IoT (Internet of Things), big data analysis, AI (Artificial Intelligence), and robot technology. Information and Communication Technology (ICT), which is a major factor, is affecting production and manufacturing systems and as ICT technologies become more advanced, intelligent information technology is generally utilized in all areas of society, leading to hyper-connected society where new values are created and developed. ICT technology is not just about connecting devices and systems and making smart, it is about constantly converging and harmonizing new technologies in a number of fields and driving innovation and change. It is no exception to the agro-fisheries trade. In particular, ICT technology is applied to the agricultural sector, reducing labor, providing optimal environment for crops, and increasing productivity. Due to the nature of agriculture, which is a labor-intensive industry, it is predicted that the ripple effects of ICT technologies will become bigger. We are expected to use the Smart Concentration using ICT convergence technology as a useful resource for changing smart farms, and to help develop new service markets.