• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.3
• /
• pp.1684-1699
• /
• 2017

The deblocking filter (DF) reduces blocking artifacts in encoded video sequences, and thereby significantly improves the subjective and objective quality of videos. Statistics show that the DF accounts for 5-18% of the total decoding time in high-efficiency video coding. Therefore, speeding up the DF will improve codec performance, especially for the decoder. In view of the rapid development of multicore technology, we propose a parallel DF scheme based on a modified order of accessing the coding tree units (CTUs) by analyzing the data dependencies between adjacent CTUs. This enables the DF to run in parallel, providing accelerated performance and more flexibility in the degree of parallelism, as well as finer parallel granularity. We additionally solve the problems of variable privatization and thread synchronization in the parallelization of the DF. Finally, the DF module is parallelized based on the HM16.1 reference software using OpenMP technology. The acceleration performance is experimentally tested under various numbers of cores, and the results show that the proposed scheme is very effective at speeding up the DF.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.4
• /
• pp.1975-1988
• /
• 2019

Short-term traffic flow prediction plays an important role in intelligent transportation systems (ITS) in areas such as transportation management, traffic control and guidance. For short-term traffic flow regression predictions, the main challenge stems from the non-stationary property of traffic flow data. In this paper, we design an ensemble cascading prediction framework based on extremely randomized trees (extra-trees) using a boosting technique called EET to predict the short-term traffic flow under non-stationary environments. Extra-trees is a tree-based ensemble method. It essentially consists of strongly randomizing both the attribute and cut-point choices while splitting a tree node. This mechanism reduces the variance of the model and is, therefore, more suitable for traffic flow regression prediction in non-stationary environments. Moreover, the extra-trees algorithm uses boosting ensemble technique averaging to improve the predictive accuracy and control overfitting. To the best of our knowledge, this is the first time that extra-trees have been used as fundamental building blocks in boosting committee machines. The proposed approach involves predicting 5 min in advance using real-time traffic flow data in the context of inherently considering temporal and spatial correlations. Experiments demonstrate that the proposed method achieves higher accuracy and lower variance and computational complexity when compared to the existing methods.

• Mycobiology
• /
• v.47 no.1
• /
• pp.66-75
• /
• 2019

A new species of Alternaria causing leaf spots on the rubber tree (Hevea brasiliensis) in Yunnan, China, was isolated, examined, and illustrated. Morphologically, it belongs to the section Porri of Alternaria, which produces relatively large conidia and a simple or branched, filamentous long beak. It is, however, characterized by conidiophores gradually enlarging near the apex into a clavate conidiogenous cell and long ellipsoid to obclavate, smoothwalled conidia with a long filamentous beak. Molecular phylogenetic analyses based on ITS rDNA, GAPDH, and TEF1-alpha sequences demonstrate that the phytopathogen falls in the clade of the section Porri, being most closely related to A. sidae, A. sennae, A. deseriticola, A. cyamopsidis, A. rostellata, A. nitrimali, A. crassa, and A. thunbergiae.

• Journal of the Korean Institute of Landscape Architecture
• /
• v.33 no.1 s.108
• /
• pp.71-80
• /
• 2005

In order to search for ecologically indicative characteristics on the street tree plots in Daegu area, plant communities and their floras were investigated. A total of 105 plots were collected and numerically analyzed by PCoA(Principal Coordinates Analysis). These plots were classified into 4 types containing 139 species, 97 genera, 42 families(including 37 exotic species): urban-dry type, urban-wet type, rural-dry type, rural-wet type. Habitat connectivity to the surrounding vegetation cover, extent and frequency of human impacts, and soil moisture recognizably were the main factors to allow the plots differentiation. Indicative species composition to these four types was generated as Eleusine indica-Eragrostis multicaulis-Oxalis corniculata to the urban-wet, Digitaria ciliaris-Eleusine indica-Eragrostis multicaulis to the urban-dry, Setaria viri-dis-Artemisia-Lactuca indica var. laciniata to the rural-wet, and Setaria viridis-Digitaria ciliaris-Erigeron canadensis to the rural-dry, respectively. Mean species number per plot for rural type was 2.5 times higher than for urban types. Street tree species representative to the rural-wet type is Zelkova serrata, which is a key species of potential natural vegetation in the alluvial land of Daegu area. Street tree plots were characterized by Eleusine indica showing the highest r-NCD value and also C4-assimilation grass plants. Views on the efficacy of the rural-wet type and the reinforcement of vegetation connectivity and soil moisture in rehabilitating street tree plots, are discussed.

• Journal of the Korean Society of Environmental Restoration Technology
• /
• v.6 no.2
• /
• pp.27-38
• /
• 2003

This study aimed to provide basic data for future management of roadside trees by analyzing problems associated with plantation and management of roadside trees through categorization of functions and organizational structure, plantation and management, and management regulations and generating improvement opportunities based on the result of a survey on the awareness of government officials who are directly in charge of managing roadside trees in 31 cities & counties within Kyonggi province. The summary of key results of this study is as follows. First, "roadside tree-related function" is still not considered to be independent. About a half of government officials in charge did not majored in this field and they spent only about "2.09hours", in average, in the roadside tree-related function out of 8 working hours per day. Second, regarding problems and improvement opportunities in roadside tree-related function, lack of time was considered to be the biggest problem in overall management of roadside trees. As for improvement opportunities, "increase of dedicated manpower" and "system development" to facilitate efficient processing were suggested. Third, an annual budget for roadside tree-related affairs was merely 92 million won per city/county. A registry for management of roadside trees was kept manually. As for the roles of roadside trees, improvement of landscape and securing of green area itself were valued highly. Fourth, Ginkgo biloba, Zelkova serrata, and Prunus yedoensis were suggested to be the most appropriate species for roadside tree and Platanus occidentalis, Populus albaglandulosa, Populus euramericana, and Robinia pseudo-acacia were mentioned to be the least appropriate species.

• Journal of KIISE
• /
• v.43 no.2
• /
• pp.152-162
• /
• 2016

Most traditional garbage collectors commonly use the language level metadata, which is designed for pointer type searching. However, because it is difficult to use this metadata in non-volatile memory allocation platforms, a new garbage collection technique is essential for non-volatile memory utilization. In this paper, we design new metadata for managing information regarding non-volatile memory allocation called "Allocation Tree". This metadata is comprised of tree data structure for fast information lookup and a node that holds an allocation address and an object ID pair in key-value form. The Garbage Collector starts collecting when there are insufficient non-volatile memory spaces, and it compares user data and the allocation tree for garbage detection. We develop this algorithm in a persistent heap based non-volatile memory allocation platform called "HEAPO" for demonstration.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.11
• /
• pp.2479-2487
• /
• 2009

Earlier researches on Sensor Networks preferred symmetric key-based authentication schemes in consideration of limitations in network resources. However, recent advancements in cryptographic algorithms and sensor-node manufacturing techniques have opened suggestion to public key-based solutions such as Merkle tree-based schemes. This paper proposes a new concept of public key-based authentication using Polynomial Secret Sharing that can be effectively applied to sensor networks and a detection of malicious node using the hash function. This scheme is based on exponential distributed data concept, a derivative from Shamir's (t,n) threshold scheme, in which the authentication of neighbouring nodes are done simultaneously while minimising resources of sensor nodes and providing network scalability.

• Asian Journal of Turfgrass Science
• /
• v.23 no.2
• /
• pp.331-344
• /
• 2009

Buffalograss is an important turfgrass species with excellent cold, heat, and drought tolerance. Understanding the physiological integration of buffalograss under heterogeneous conditions helps to develop cultural practices that better use limited resources for uniform turf quality. The objective of this study was to evaluate physiological integration of buffalograss under water deficit stress and the involvement of lipid peroxidation and antioxidants in the process. In one experiment, buffalograss was planted in the center of a four-compartment growth unit. Watering frequencies, once a week(+) and once in two weeks(-), were combined with the sand(S) or peat(P) in each unit to generate five total treatments(P+S-P-S+, P+P+P+P+, S-S-S-S-, P-P-P-P-, and S+S+S+S+). The average number of shoot established from the heterogeneous root-zone medium was higher than the average of four possible homogeneous media. In second experiment, single ramet in Hoagland solution($S_0$) or single ramet in Hoagland solution with 20% PEG-6000($S_s$) were compared with two connectedramets under different treatments. Treatments for connected ramets were young ramet in Hoagland solution($Y_{os}$) and old ramet in Hoagland solution with 20% PEG-6000($O_{os}$), and old ramet in Hoagland solution($O_{ys}$) and young ramet in Hoagland solution with 20% PEG-6000($Y_{ys}$). Lipid peroxidation, antioxidants, and proline showedphysiological integration between ramets subjected to different levels of water stress. Superoxide dismutase(SOD), Guaiacol peroxidase(G-POD), malondialdehyde(MDA), and free proline also showed different time courses and relative activities during the physiological integration.

• Journal of KIISE:Information Networking
• /
• v.30 no.6
• /
• pp.705-713
• /
• 2003

For group security to protect group data or to charge, group keys should be updated via key update messages when the membership of group changes. If we lose these messages, it is not possible to decrypt the group data and so this is why the recovery of lost keys is very significant. Any message lost during a certain member is logged off can not be recovered in real-time. Saving all messages and resending them by KDC (Key Distribution Center) not only requests large saving spaces, but also causes to transmit and decrypt unnecessary keys. This paper analyzes the problem of the loss of key update messages along with other problems that may arise during member login procedure, and also gives an efficient method for recovering group keys and auxiliary keys. This method provides that group keys and auxiliary keys can be recovered and sent effectively using information stored in key-tree. The group key generation method presented in this paper is simple and enable us to recover any group key without storing. It also eliminates the transmissions and decryptions of useless auxiliary keys.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.43 no.2 s.308
• /
• pp.1-11
• /
• 2006

In this paper, we propose the novel video retrieval algorithm using non-parametric based motion classification in the shot-based video indexing structure. The proposed system firstly gets the key frame and motion information from each shot segmented by scene change detection method, and then extracts visual features and non-parametric based motion information from them. Finally, we construct real-time retrieval system supporting similarity comparison of these spatio-temporal features. After the normalized motion vector fields is created from MPEG compressed stream, the extraction of non-parametric based motion feature is effectively achieved by discretizing each normalized motion vectors into various angle bins, and considering a mean, a variance, and a direction of these bins. We use the edge-based spatial descriptor to extract the visual feature in key frames. Experimental evidence shows that our algorithm outperforms other video retrieval methods for image indexing and retrieval. To index the feature vectors, we use R*-tree structures.