• The Journal of the Acoustical Society of Korea
• /
• 제20권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
• /
• 제6권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.

• 한국지반공학회:학술대회논문집
• /
• 한국지반공학회 2006년도 춘계 학술발표회 논문집
• /
• 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
• /
• 제21권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
• /
• 제21권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.

• 산업경영시스템학회지
• /
• 제25권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.

• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2010년도 추계학술대회
• /
• pp.352-354
• /
• 2010

최근 센서 네트워크의 구축이 증가하면서 대규모의 센서 데이터를 효율적으로 관리하는 시스템이 요구되고 있다. 기존의 연구는 단일 서버 또는 그리드로 구축된 다수의 서버에 분산 데이터베이스 시스템을 이용하여 센서 데이터를 관리하므로 시스템 확장이 용이하지 않으며 시스템 구축 및 관리 비용이 많이 드는 단점이 있다. 본 논문에서는 저비용, 높은 확장성과 효율성을 지닌 클라우드 기반의 센서 데이터 관리 시스템을 제안한다. 제안된 시스템은 REST 기반의 웹서비스를 통해 제공되므로 다양한 응용프로그램과 연동이 가능하다.

• 정보처리학회논문지D
• /
• 제13D권7호
• /
• pp.1027-1038
• /
• 2006

대용량 데이터베이스에서의 추천시스템은 많은 문제점들을 지니고 있으므로, 대규모 인터넷 쇼핑몰에 적합한 추천 시스템 구조와 데이터 마이닝 기법의 필요성이 요구되고 있다. 따라서 본 논문에서는 k-mean 클러스터링과 순차 패턴 기법을 이용한 VLDB(very large database) 기반의 상품 추천 시스템을 설계 및 구현한다. 본 논문에서는 사용자의 정보를 일괄처리하고 다양한 카테고리를 계층적으로 정의하며, 탐색엔진에 순차 패턴 마이닝 기법을 이용한다. 예측 모델을 만들기 위하여 사용자의 로그 데이터 중에서 카테고리에 대한 사용자의 선호도를 추출하여 이용한다. 본 논문에서는 실험과 성능 평가를 위하여 국내 인터넷 쇼핑몰에서 30일 동안 수집한 실제 데이터를 이용한다. 또한 성능평가를 위하여 추천 예측 정확율(PRP: Predictive Recommend Precision), 추천 예측 재현율(PRR: Predictive Recommend Recall), 정확도 인수(PF1 : Predictive Factor One-measure)를 제안하여 사용한다. 성능평가 결과 가장 빠른 추천시간 및 학습시간은 O(N)이었고, 다양한 실험에서의 측도들의 값이 상당히 우수하였다.

• 한국정보통신학회논문지
• /
• 제6권5호
• /
• pp.653-660
• /
• 2002

본 논문은 관계형 데이터베이스 기반하여 그래프를 저장하고 그래프 알고리즘을 정의할 수 있는 방법을 제안한다. 이 방법에서 그래프는 릴레이션으로 표현되며, 그래프의 각 정점과 간선은 이 릴레이션의 튜플로서 데이터베이스에 저장된다. 이를 위해 그래프의 저장 및 관리뿐만 아니라 다양한 응용프로그램 개발에도 사용될 수 있는 기본적인 그래프 함수들을 라이브러리로 개발하였다. 또한, 그래프에 대한 알고리즘을 추출, 선택, 죠인과 같은 관계대수 연산을 이용하여 정의하였으며, SQL과 같은 데이터베이스 언어를 사용하여 구현하였다. 이와 같은 데이터베이스에 기반한 방법은 메모리에 수용되지 않는 크기의 그래프를 효과적으로 처리할 수 있을 뿐만 아니라 다양한 응용프로그램 개발을 용이하게 할 것이다.

• International Journal of Computer Science & Network Security
• /
• 제22권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.