• Korean Journal of Plant Taxonomy
• /
• v.52 no.3
• /
• pp.127-143
• /
• 2022

This study was conducted to clarify the phylogenetic position and relationships of Korean Poaceae taxa. A total of 438 taxa including 155 accessions of Korean Poaceae (representing 92% and 72% of Korean Poaceous genera and species, respectively) were employed for phylogeny reconstruction. Sequence data of eight chloroplast DNA markers were used for molecular phylogenetic analyses. The resulted phylogeny was mostly concordant with previous phylogenetic hypotheses, especially in terms of subfamilial and tribal relationships. Several taxa-specific indels were detected in the molecular phylogeny, including a 45 bp deletion in rps3 (PACMAD [Panicoideae, Arundinoideae, Chloridoideae, Micrairoideae, Aristidoideae, Danthonioideae] clade), a 15 bp deletion in ndhF (Oryzeae + Phyllorachideae), a 6 bp deletion in trnLF (Poeae s.l.), and two (17 bp and 378 bp) deletions in atpF-H (Pooideae). The Korean Poaceae members were classified into 23 tribes, representing eight subfamilies. The subfamilial and tribal classifications of the Korean taxa were generally congruent with a recently published system, whereas some subtribes and genera were found to be non-monophyletic. The taxa included in the PACMAD clade (especially Andropogoneae) showed very weak and uncertain phylogenetic relationships, presumably to be due to evolutionary radiation and polyploidization. The reconstructed phylogeny can be utilized to update the taxonomic positions of the newly examined grass accessions.

• Journal of the Korea Computer Industry Society
• /
• v.3 no.7
• /
• pp.921-926
• /
• 2002

B+-Tree is the most popular indexing method in DBMS to manage large size data in more efficiency. However the existing B+-Tree has shortcomings in there is overhead on DISK/IO when the first time of constructing DB or of making Index, and it lessens the concurrency if there are frequent delete operations so that the index structure also should be changed frequently. To solve these problems almost DBMS is using batch construction method and lazy deletion method. But to apply B+-Tree, which is using batch construction method and lazy deletion method, into DBMS the technique for controlling and recovering concurrency is necessary, but its researching is still unsatisfactory so that there is a problem on applying it into actual systems. On this paper I suggest the technique for controlling and recovering concurrency how to implement the batch construction method and the lazy deletion method in actual DBMS. Through the suggested technique there is no cascade rollback by using Pending list, it enhances the concurrency by enabling insertion and deletion for base table on every reconstruction, and it shortens transaction response time for user by using system queue which makes the batch constructing operation is processed not in user's transaction level but in system transaction level.

• International Journal of Computer Science & Network Security
• /
• v.23 no.9
• /
• pp.134-140
• /
• 2023

The distributed system is playing a vital role in storing and processing big data and data generation is speedily increasing from various sources every second. Hadoop has a scalable, and efficient distributed system supporting commodity hardware by combining different networks in the topographical locality. Node support in the Hadoop cluster is rapidly increasing in different versions which are facing difficulty to manage clusters. Hadoop does not provide Node management, adding and deletion node futures. Node identification in a cluster completely depends on DHCP servers which managing IP addresses, hostname based on the physical address (MAC) address of each Node. There is a scope to the hacker to theft the data using IP or Hostname and creating a disturbance in a distributed system by adding a malicious node, assigning duplicate IP. This paper proposing novel node management for the distributed system using DNA hiding and generating a unique key using a unique physical address (MAC) of each node and hostname. The proposed mechanism is providing better node management for the Hadoop cluster providing adding and deletion node mechanism by using limited computations and providing better node security from hackers. The main target of this paper is to propose an algorithm to implement Node information hiding in DNA sequences to increase and provide security to the node from hackers.

• Korean Journal of Computational Design and Engineering
• /
• v.19 no.4
• /
• pp.390-401
• /
• 2014

ISO 15926 is an international standard for integration of lifecycle data for process plants including oil and gas facilities. From the viewpoint of information modeling, ISO 15926 Parts 2 provides the general data model that is designed to be used in conjunction with reference data. Reference data are standard instances that represent classes, objects, properties, and templates common to a number of users, process plants, or both. ISO 15926 Parts 4 and 7 provide the initial set of classes, objects, properties and the initial set of templates, respectively. User-defined reference data specific to companies or organizations are defined by inheriting from the initial reference data and the initial set of templates. In order to support the extension of reference data and templates, an editor that provides creation, deletion and modification functions of user-defined reference data is needed. In this study, an editor for reference data based on ISO 15926 was developed. Sample reference data were encoded in OWL (web ontology language) according to the specification of ISO 15926 Part 8. iRINGTools and dot15926Editor were benchmarked for the design of GUI (graphical user interface). Reference data search, creation, modification, and deletion functions were implemented with XML (extensible markup language) DOM (document object model), and SPARQL (SPARQL protocol and RDF query language).

• Communications for Statistical Applications and Methods
• /
• v.10 no.1
• /
• pp.225-232
• /
• 2003

The support vector machine (SVM) is becoming increasingly popular in classification. The import vector machine (IVM) has been introduced for its advantages over SMV. This paper tries to improve the IVM. The proposed method, which is referred to as the polychotomous machine (PM), uses the Newton-Raphson method to find estimates of coefficients, and the Rao and Wald tests, respectively, for addition and deletion of import points. Because the PM basically follows the same addition step and adopts the deletion step, it uses, typically, less import vectors than the IVM without loosing accuracy. Simulated and real data sets are used to illustrate the performance of the proposed method.

• Communications for Statistical Applications and Methods
• /
• v.24 no.2
• /
• pp.155-162
• /
• 2017

In this paper we propose influence measures for two basic goodness-of-fit statistics, the coefficient of determination $R^2$ and test statistic F in the linear regression model using the deletion method. Some useful lemmas are provided. We also express the influence measures in terms of basic building blocks such as residual, leverage, and deviation that showed them as increasing function of residuals and a decreasing function of deviation. Further, the proposed measure reduces computational burden from O(n) to O(1). As illustrative examples, we applied the proposed measures to the stackloss data sets. We verified that deletion of one or few influential observations may result in big change in $R^2$ and F-statistic.

• Journal of Internet Computing and Services
• /
• v.25 no.3
• /
• pp.35-41
• /
• 2024

As online activities have rapidly increased due to recent digital changes and the impact of COVID-19, the importance of large-scale data processing and maintenance is increasing. This study compares the performance of the two main types of databases widely used for data storage and management: Relational Database Management Systems (RDBMS) and Non-Relational Databases (NoSQL). Specifically, we measured and evaluated the execution time of data insertion, query, and deletion functions using MySQL, a representative example of RDBMS, and Redis, a representative example of NoSQL. The experimental results showed that Redis showed performance about 5.84 times faster in data insertion, 6.61 times faster in query, and 12.33 times faster in deletion than MySQL. These results demonstrate that Redis provides superior performance, especially in environments requiring large-scale data processing and maintenance. Therefore, companies and online service providers can choose NoSQL databases such as Redis to ensure more efficient data management solutions. We hope this study will be an essential reference when selecting a database based on data processing performance.

• Korean Linguistics
• /
• v.72
• /
• pp.257-282
• /
• 2016

The aim of this paper is to research phonological and morphological features in Korean Voices from Berlin. The Korean Voices from Berlin was recorded in 1917 at Berlin by 5 Korean prisoners engaged in World War I, some of them came from North Hamgyeong Province, the others came from Pyeongan Province, therefore these data show a North Korean regional dialect. The data are composed of three materials, counting numbers, reciting scriptures and singing folksongs. The results of this research are as follows. 1) The consonant system of Korean voices is similar to standard Korean. The 19 consonants are classified according to 5 manners of articulations and 5 points of articulations. 2) The liquid /l/ has three allophones, [ɾ] appeared in an onset position, [l] in a word medial coda position or preceded by [l], [ɹ] in a word final coda position. 3) The vowel system of Korean voices is similar to early 20th Korean's. It has 8 monophthongs, /a, ʌ, o, u, ɯ, i, e, ${\varepsilon}$/. 4) The 1 to 10 numbers in Korean voices are similar to Middle-Korean numerals. 5) The genitive particle '/ɯi/의' is pronounced [i], [ɯ], [${\varepsilon}$], especially [ɯ] is appeared in Sino Korean. 6) The /l/-deletion of conjugations are similar to Middle-Korean, /l/ deletion always occurred, if [+cor] consonants are followed.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.27 no.2
• /
• pp.223-232
• /
• 2017

Previous research on data recovery in Microsoft SQL Server has focused on restoring data based on in the transaction log that might have deleted records exist. However, there was a limit that was not applicable if the related transaction log did not exist or the physical database file was not connected to Server. Since the suspect in the crime scene may delete the data records using a different deletion statements besides "delete", we need to check the remaining data and a recovery possibility of the deleted record. In this paper, we examined the changes "Page Allocation information" of the table, "Unallocation deleted data", "Row Offset Array" in the page according to "delete", "truncate" and "drop" events. Finally it confirmed the possibility of data recovery and availability of management tools in Microsoft SQL Server digital forensic investigation.

• Communications for Statistical Applications and Methods
• /
• v.14 no.1
• /
• pp.229-239
• /
• 2007

We present a diagnostic method for the quasi-likelihood estimators in generalized linear models. Since these estimators can be usually obtained by iteratively reweighted least squares which are well known to be very sensitive to unusual data, a diagnostic step is indispensable to analysis of data. We extend the local influence approach based on the maximum likelihood function to that on the quasi-likelihood function. Under several perturbation schemes local influence diagnostics are derived. An illustrative example is given and we compare the results provided by local influence and deletion.