• Journal of Multimedia Information System
• /
• v.8 no.3
• /
• pp.147-158
• /
• 2021

Versatile Video Coding (VVC) is the latest video coding standard developed by Joint Video Exploration Team (JVET). In VVC, the quadtree plus multi-type tree (QT+MTT) structure of coding unit (CU) partition is adopted, and its computational complexity is considerably high due to the brute-force search for recursive rate-distortion (RD) optimization. In this paper, we aim to reduce the time complexity of inter-picture prediction mode since the inter prediction accounts for a large portion of the total encoding time. The problem can be defined as classifying the split mode of each CU. To classify the split mode effectively, a novel convolutional neural network (CNN) called multi-level tree (MLT-CNN) architecture is introduced. For boosting classification performance, we utilize additional information including inter-picture information while training the CNN. The overall algorithm including the MLT-CNN inference process is implemented on VVC Test Model (VTM) 11.0. The CUs of size 128×128 can be the inputs of the CNN. The sequences are encoded at the random access (RA) configuration with five QP values {22, 27, 32, 37, 42}. The experimental results show that the proposed algorithm can reduce the computational complexity by 11.53% on average, and 26.14% for the maximum with an average 1.01% of the increase in Bjøntegaard delta bit rate (BDBR). Especially, the proposed method shows higher performance on the sequences of the A and B classes, reducing 9.81%~26.14% of encoding time with 0.95%~3.28% of the BDBR increase.

• Asia pacific journal of information systems
• /
• v.16 no.3
• /
• pp.229-241
• /
• 2006

In this paper, we develop three stage non-cooperative game models to analyze the alliance strategies of companies in internet markets where network effects are present. Regardless of its market share, an internet company's strategic alliance appears to be a superior strategy. The analysis also identifies profit sharing structures in the internet market where a smaller and unknown company is enforced to split its own profits with a larger and well-known company. It is shown that the amount of profit sharing grows as the size of network effects becomes larger.

• Journal of Korea Spatial Information System Society
• /
• v.9 no.3
• /
• pp.35-50
• /
• 2007

In a data centric sensor network, a sensor node to store data is determined by the measured data value of each sensor node. Therefore, if the same data occur frequently, the energy of the sensor node to store the data is exhausted quickly due to the concentration of loads. And if the sensor network is extended, the communication cost for storing data and processing queries is increased, since the length of the routing path for them is usually in the distance. However, the existing researches that generally focus on the efficient management of data storing can not solve these problems efficiently. In this paper, we propose a NUNS(Non-Uniform Network Split) method that can distribute loads of sensor nodes and decrease the communication cost caused by the sensor network extension. By dividing the sensor network into non-uniform partitions that have the minimum difference in the number of sensor nodes and the splitted area size and storing the data which is occurred in a partition at the sensor nodes within the partition, the NUNS can distribute loads of sensor nodes and decrease the communication cost efficiently. In addition, by dividing each partition into non-uniform zones that have the minimum difference in the splitted area size as many as the number of the sensor nodes in the partition and allocating each of them as the processing area of each sensor node, the NUNS can protect a specific sensor node from the load concentration and decrease the unnecessary routing cost.

• Journal of Korea Spatial Information System Society
• /
• v.8 no.3
• /
• pp.105-115
• /
• 2006

A sensor network which uses DCS(Data-Centric Storage) stores the same data into the same sensor node. Thus it has a hot spot problem when the sensor network grows and the same data arise frequently. In the past researches of the sensor network using DCS, the hot spot problem caused by growing the sensor network was ignored because they only concentrated on managing stored sensor data efficiently. In this paper, we proposed a non-equal region split method that supports efficient scalability on storing multi-dimensional sensor data. This method can reduce the storing cost, as the sensor network is growing, by dividing whole space into regions which have the same number of sensor nodes according to the distribution of sensor nodes, and storing and managing sensor data within each region. Moreover, this method can distribute the energy consumption of sensor nodes by increasing the number of regions according to the size of the sensor network, the number of sensor nodes within the sensor network, and the quantity of sensor data. Therefore it can help to increase the life time and the scalability of the sensor network.

• Advances in Computational Design
• /
• v.5 no.2
• /
• pp.195-207
• /
• 2020

The present study focuses on the application of artificial neural network (ANN) and Multiple linear Regression (MLR) analysis for developing a model to predict the unconfined compressive strength (UCS) and split tensile strength (STS) of the fiber reinforced clay stabilized with grass ash, fly ash and lime. Unconfined compressive strength and Split tensile strength are the nonlinear functions and becomes difficult for developing a predicting model. Artificial neural networks are the efficient tools for predicting models possessing non linearity and are used in the present study along with regression analysis for predicting both UCS and STS. The data required for the model was obtained by systematic experiments performed on only Kaolin clay, clay mixed with varying percentages of fly ash, grass ash, polypropylene fibers and lime as between 10-20%, 1-4%, 0-1.5% and 0-8% respectively. Further, the optimum values of the various stabilizing materials were determined from the experiments. The effect of stabilization is observed by performing compaction tests, split tensile tests and unconfined compression tests. ANN models are trained using the inputs and targets obtained from the experiments. Performance of ANN and Regression analysis is checked with statistical error of correlation coefficient (R) and both the methods predict the UCS and STS values quite well; but it is observed that ANN can predict both the values of UCS as well as STS simultaneously whereas MLR predicts the values separately. It is also observed that only STS values can be predicted efficiently by MLR.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.9
• /
• pp.2057-2064
• /
• 2010

With the development of wireless network technology, the location information of a spatiotemporal object which changes their location is used in various application. Each spatiotemporal object has many location information, hence it is inefficient to search all trajectory information of spatiotemporal objects for a range query. In this paper, we propose an efficient method which divides a trajectory and stores its division data on restricted storage space. Using suboptimal split algorithm, an extended split algorithm that minimizes the volume of EMBRs(Extended Minimum Bounding Box) is designed and simulated. Our experimental evaluation confirms the effectiveness and efficiency of our proposed splitting policy

• Journal of Korea Multimedia Society
• /
• v.13 no.10
• /
• pp.1534-1546
• /
• 2010

In sensor network systems, various hierarchical clustering schemes have been proposed in order to efficiently maintain the energy consumption of sensor nodes. Most of these schemes, however, are hardly applicable in practice since these schemes might produce unbalanced clusters or randomly distributed clusters without taking into account of the distribution of sensor nodes. To overcome the limitations of such hierarchical clustering schemes, we propose a novel scheme called CSM(Clustering using Split & Merge algorithm), which exploits node split and merge algorithm of tree-based indexing structures to efficiently construct clusters. Our extensive performance studies show that the CSM constructs highly balanced clustering in a energy efficient way and achieves higher performance up to 1.6 times than the previous clustering schemes, under various operational conditions.

• Journal of Communications and Networks
• /
• v.13 no.2
• /
• pp.187-200
• /
• 2011

We present the design and implementation of a novel anti-malware system called SplitScreen. SplitScreen performs an additional screening step prior to the signature matching phase found in existing approaches. The screening step filters out most non-infected files (90%) and also identifiesmalware signatures that are not of interest (99%). The screening step significantly improves end-to-end performance because safe files are quickly identified and are not processed further, and malware files can subsequently be scanned using only the signatures that are necessary. Our approach naturally leads to a network-based anti-malware solution in which clients only receive signatures they needed, not every malware signature ever created as with current approaches. We have implemented SplitScreen as an extension to ClamAV, the most popular open source anti-malware software. For the current number of signatures, our implementation is $2{\times}$ faster and requires $2{\times}$ less memory than the original ClamAV. These gaps widen as the number of signatures grows.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.1
• /
• pp.110-116
• /
• 2013

With the recent development of wireless network technologies, there have been increasing usage of variouse position base servies. Position based services basically collect position information of moving object for the utilization of them in real life. Accordingly, new index structures are required to efficiently retrieve the consecutive positions of moving objects. In the paper, we consider volume of Extended Minimum Bounding Rectangles(EMBR) to be determined by average size of range queries. We proposed the methode that split efficiently moving object with long distance between location, and split moving object for decrease searching space an Estimated-Split algorithm that minimizes the volume of MBRs is designed and simulated. Our experimental evaluation confirms the effectiveness and efficiency of our proposed splitting policy.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.18 no.1
• /
• pp.11-24
• /
• 2022

Open Radio Access Network (O-RAN) standard has been proposed to separate the baseband signal processing unit from the Radio Frequency (RF) unit at base station system mainly for reducing the cost of base station systems through open-source interfaces between the two units. To satisfy the performance metrics in various scenarios, several fronthaul functional split options were presented by O-RAN. Amongst these options, the split option 7-2x is widely adopted in practical applications due to its excellent trade-off between the required bandwidth and RU overhead. In this paper, we present a hardware implementation of a base station system that is compliant with the Category B of O-RAN split option 7-2x. It consists of O-DU and O-RU implemented with a commercial off-the-shelf Digital Signal Processor and RF transceiver, respectively. The performance of the proposed base station system is evaluated in terms of Bit Error Rate and received signal power as well as the required fronthaul bandwidth. Through various experimental tests, we have observed that the proposed system reduces the fronthaul bandwidth nearly by 89.7% compared to the conventional system that dose not employ the O-RAN standard.