• The Journal of the Acoustical Society of Korea
• /
• v.20 no.4E
• /
• pp.31-38
• /
• 2001

A large-scale synthesis database for a unit selection based synthesis method usually retains redundant synthesis unit instances, which are useless to the synthetic speech quality. In this paper, to eliminate those instances from the synthesis database, we proposed a new pruning method called weighted vector quantization (WVQ). The WVQ reflects relative importance of each synthesis unit instance when clustering the similar instances using vector quantization (VQ) technique. The proposed method was compared with two conventional pruning methods through the objective and subjective evaluations of the synthetic speech quality: one to simply limit maximum number of instance, and the other based on normal VQ-based clustering. The proposed method showed the best performance under 50% reduction rates. Over 50% of reduction rates, the synthetic speech quality is not seriously but perceptibly degraded. Using the proposed method, the synthesis database can be efficiently reduced without serious degradation of the synthetic speech quality.

• IEIE Transactions on Smart Processing and Computing
• /
• v.6 no.4
• /
• pp.262-268
• /
• 2017

Intelligent video surveillance systems have been developed to monitor global areas and find specific target objects using a large-scale database. However, person re-identification presents some challenges, such as pose change and occlusions. To solve the problems, this paper presents an improved person re-identification method using sparse representation and saliency-based dictionary construction. The proposed method consists of three parts: i) feature description based on salient colors and textures for dictionary elements, ii) orthogonal atom selection using cosine similarity to deal with pose and viewpoint change, and iii) measurement of reconstruction error to rank the gallery corresponding a probe object. The proposed method provides good performance, since robust descriptors used as a dictionary atom are generated by weighting some salient features, and dictionary atoms are selected by reducing excessive redundancy causing low accuracy. Therefore, the proposed method can be applied in a large scale-database surveillance system to search for a specific object.

• Proceedings of the Korean Geotechical Society Conference
• /
• 2006.03a
• /
• pp.1046-1053
• /
• 2006

In the large scale recent reclaiming works performed within the wide spatial boundary, evaluation of long-term consolidation settlement and residual settlement of the whole construction area is sometimes made with the results of the limited ground investigation and measurement. Then the reliability of evaluation has limitations due to the spatial uncertainty. Additionally, in case of large scale deep excavation works such as urban subway construction, there are a lot of hazardous elements to threaten the safety of underground pipes or adjacent structures. Therefore it is necessary to introduce a damage prediction system of adjacent structures and others. For the more accurate analysis of monitoring information in the wide spatial boundary works and large scale urban deep excavations, it is necessary to perform statistical and spatial analysis considering the geographical spatial effect of ground and monitoring information in stead of using diagrammatization method based on a time-series data expression that is traditionally used. And also it is necessary that enormous ground information and measurement data, digital maps are accumulated in a database, and they are controlled in a integrating system. On the abovementioned point of view, we developed Geomonitor 2.0, an Internet based real time monitoring program with a new concept by adding GIS and geo-statistical analysis method to the existing real time integrated measurement system that is already developed and under useful use. The new program enables the spatial analysis and database of monitoring data and ground information, and helps the construction- related persons make a quick and accurate decision for the economical and safe construction.

• International Journal of Computer Science & Network Security
• /
• v.21 no.12
• /
• pp.280-292
• /
• 2021

Enterprise Resource Planning (ERP) is a software that manages and automate the internal processes of an organization. Process speed and quality can be increased, and cost reduced by process automation. Odoo is an open source ERP platform including more than 15000 apps. ERP systems such as Odoo are all-in-one management systems. Odoo can be suitable for small and medium organizations, but duo to efficiency limitations, Odoo is not suitable for the large ones. Furthermore, Odoo can be implemented on both local or public servers in which each has some advantages and disadvantages such as; the speed of internet, synced data or anywhere access. In many cases, there is a persistent need to have more than one synchronized Odoo instance in several physical places. We modified Odoo to support this kind of requirements and improve its efficiency by replacing its standard database with a distributed one, namely CockroachDB.

• Journal of information and communication convergence engineering
• /
• v.21 no.1
• /
• pp.54-61
• /
• 2023

The family tree is one of the key elements of humanities classics research and is very important for accurately understanding people or families. In this paper, we introduce a method for automatically generating a family tree using information on interpersonal relationships (IIPR) from the Korean Classics Database (KCDB) and visualize interpersonal searches within a family tree using data-driven document JavaScript (d3.js). To date, researchers of humanities classics have wasted considerable time manually drawing family trees to understand people's influence relationships. An automatic family tree builder analyzes a database that visually expresses the desired family tree. Because a family tree contains a large amount of data, we analyze the performance and bottlenecks according to the amount of data for visualization and propose an optimal way to construct a family tree. To this end, we create an n-ary tree with fake data, visualize it, and analyze its performance using simulation results.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.25 no.4
• /
• pp.22-31
• /
• 2002

A high-speed rail system represents a typical example of large-scale multi-disciplinary systems, consisting of subsystems such as train, electrical hardware, electronics, control, information, communication, civil technology etc. The system design and acquisition data of the large-scale system must be the subject under strict configuration control and management. Not only the requirements of the large-scale system dictate the contracts with the suppliers but also become the basis for the development process, project execution, system integration, and testing. The requirements database provide the system design specification of all development activities. Using the RDD-100, a systems engineering tool, the Korea next-generation high-speed rail program can establish requirements traceability and development process management in performing the enabling train technology development projects. This paper presents the results from a computer-aided systems engineering application to the Korea next-generation high-speed railway project. Especially, the focus of the study was on requirement management and PBS(Product Breakdown Structure) management.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2010.10a
• /
• pp.352-354
• /
• 2010

Recently, the efficient management system for large-scale sensor data has been required due to the increasing deployment of large-scale sensor networks. In previous studies, sensor data was managed by distributed database system which built in a single server or a grid server. Thus, it has disadvantages such as low scalability, and high cost of building or managing the system. In this paper, we propose a cloud-based sensor data management system with low cast, high scalability, and efficiency. The proposed system can be work with the application of a variety of platforms, because processed results are provided through REST-based web service.

• The KIPS Transactions:PartD
• /
• v.13D no.7 s.110
• /
• pp.1027-1038
• /
• 2006

There are many technical problems in the recommendation system based on very large database(VLDB). So, it is necessary to study the recommendation system' structure and the data-mining technique suitable for the large scale Internet shopping mail. Thus we design and implement the product recommendation system using k-means clustering algorithm and sequential pattern technique which can be used in large scale Internet shopping mall. This paper processes user information by batch processing, defines the various categories by hierarchical structure, and uses a sequential pattern mining technique for the search engine. For predictive modeling and experiment, we use the real data(user's interest and preference of given category) extracted from log file of the major Internet shopping mall in Korea during 30 days. And we define PRP(Predictive Recommend Precision), PRR(Predictive Recommend Recall), and PF1(Predictive Factor One-measure) for evaluation. In the result of experiments, the best recommendation time and the best learning time of our system are much as O(N) and the values of measures are very excellent.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.6 no.5
• /
• pp.653-660
• /
• 2002

This paper proposes a method for storing graphs and defining graph algorithms based on the well-developed relational database. In this method, graphs are represented in the form of relations. Each vertex and edge of a graph is represented as tuples of the table and saved in a database. We developed a library of graph operations for the storage and management of graphs and the development of graph applications. Furthermore, we defined graph algorithms in terms of relational algebraic operations such as projection, selection, and join. They can be implemented with the database language such as SQL. This database approach provides an efficient methodology to deal with very large-scale graphs and to support the development of graph applications.

• International Journal of Computer Science & Network Security
• /
• v.22 no.12
• /
• pp.107-115
• /
• 2022

Recently, big data applications need another database different from the Relation database. NoSQL databases are used to save and handle massive amounts of data. NoSQL databases have many advantages over traditional databases like flexibility, efficiently processing data, scalability, and dynamic schemas. Most of the current applications are based on the web, and the size of data is in increasing. NoSQL databases are expected to be used on a more and large scale in the future. However, NoSQL suffers from many security issues, and one of them is access control. Many recent applications need Fine-Grained Access control (FGAC). The integration of the NoSQL databases with FGAC will increase their usability in various fields. It will offer customized data protection levels and enhance security in NoSQL databases. There are different NoSQL database models, and a document-based database is one type of them. In this research, we choose the CouchDB NoSQL document database and develop an access control mechanism that works at a fain-grained level. The proposed mechanism uses role-based access control of CouchDB and restricts read access to work at the document level. The experiment shows that our mechanism effectively works at the document level in CouchDB with good execution time.