• Title/Summary/Keyword: Database technology

Search Result 3,426, Processing Time 0.031 seconds

Development of flavonoid database for commonly consumed foods by Koreans (한국인 상용식품의 플라보노이드 데이터베이스 구축)

  • Yang, Yoon-Kyoung;Kim, Ji-Yeon;Kwon, O-Ran
    • Journal of Nutrition and Health
    • /
    • v.45 no.3
    • /
    • pp.283-292
    • /
    • 2012
  • Flavonoids have been hypothesized to reduce the risk of chronic diseases, but the lack of a flavonoid database hampered epidemiological studies addressing this issue in Korea. In this study, we developed a flavonoid database, based on a systematic review. A total of 1549 food items containing flavonoids were selected using the Korean Nutrient Database. Among them, flavonoid contents for only 649 food items were evaluated with analytical values and the remaining 900 items were replaced with adaptations or calculations from similar items. The developed flavonoid database covered 93.2% of fruits and fruit juices, 76.1% of vegetables, 98.4% of legumes and legume products, and 85.0% of all plant foods overall (1,549 items) as reported by the 24-hr dietary recall method regarding the 2008 Korean National Health and Nutrition Examination Survey. We found that this flavonoid database, overall, included 95.6% of all mainly consumed plant foods by Koreans. This flavonoid database is expected to be useful in regards to the correlation study of flavonoid intake and chronic diseases.

A Study on Development of SGML Repository System Based on DTD-dependent Schema (DTD 의존 스키마에 기반한 SGML 문서 저장 시스템 개발에 관한 연구)

  • Kim, Hyeon-Gi;No, Dae-Sik;Gang, Hyeon-Gyu
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.5
    • /
    • pp.1153-1165
    • /
    • 1999
  • In various fields of information technology, it is growing up the needs about dynamic content management systems to store and manage SGML(Standard Generalized Markup language) documents in a database system. In this paper, we consider the issue of storing SGML documents that having complex hierarchical structure into a database system, and then propose a data model based on ODMG(Object Database Management Group) object model in order to store SGML documents without loss of information. Because the proposed data model reflects physical element structure and logical entity structure of SGML documents, it is able to store the SGML document in a database system at the system at the element- level granularity without any information loss. And also the proposed data model can be adapted among ODMG-compliant object database management systems. Finally, we will discuss on the implementation details of SGML repository system supports the functionality of automatic database schema creation for any DTD(Document Type Definition0, the functionality of storing the SGML document, the functionality of dynamic document assembly from stored database objects to SGML document, and the functionality of indexing and searching for database objects.

  • PDF

Construction the Full-Text Database and Development a Integrated Management System of Research Output at a Research Library (전문도서관의 연구산출물 원문데이터베이스 구축 및 통합관리시스템 구현)

  • Yoo, An-Na;Oh, Jeong-Hoon
    • Journal of Information Management
    • /
    • v.34 no.1
    • /
    • pp.59-75
    • /
    • 2003
  • This study described about development the integrated management system for research reports and construction full text database of KAERI reports. This system enables centralization of various information related to reports by connecting with management information system. The advantages of this study are consistency of database between digital library and MIS, reduction of budget and manpower and increase of research productivity.

Performance Study of the Index-based Parallel Join

  • Jeong, Byeong-Soo;Edward Omiecinski
    • The Journal of Information Technology and Database
    • /
    • v.2 no.2
    • /
    • pp.87-109
    • /
    • 1995
  • The index file has been used a access database records effectively. The join operation in a relational database system requires a large execution time, especially in the case of handling large size tables. If the indexes are available on the joining attributes for both relations involved in the join and the join selectivity is relatively small, we can improve the execution time of the join operation. In this paper. we investigate the performance trade-offs of parallel index-based join algorithms where different indexing schemes are used. We also present a comparison of our index-based parallel join algorithms with the hash-based parallel join algorithm.

  • PDF

A Study on Retrieval of Article and Making Database in Radio Technology with Personal Computer (개인용 컴퓨터에 의한 방사선기술학 논문의 검색 및 데이터베이스 구축에 관한 고찰)

  • Kim, Sung-Hwan
    • Journal of radiological science and technology
    • /
    • v.20 no.1
    • /
    • pp.85-90
    • /
    • 1997
  • Although many useful arfticles appear in the journals published in Korea, they are not always cited by researchers mainly due to absence of efficient searching system. The author made a program with 4 predefined filtering forms to detect published articles rapidly and accurately. The program was coded using database management system CA-Clipper VER 5.2. I used 486DX-II (8 Mbyte Ram, VGA, 560 Mbyte Hard Disk), desk-jet printer(HP-560k), and MS-DOS VER 5.0. I inputed twenty articles in the journal of Korean Society Radiotechnological Technology. And this program test for retrive article and made database.

  • PDF

COLLABORATIVE PROCESS PLANNING AND FLOW ANALYSIS FOR AUTOMOTIVE ASSEMBLY SHOPS

  • Noh, S.D.;Kim, G.
    • International Journal of Automotive Technology
    • /
    • v.7 no.2
    • /
    • pp.217-226
    • /
    • 2006
  • To maintain competitiveness in the modern automotive market, it is important to carry out process planning concurrently with new car development processes. Process planners need to make decisions concurrently and collaboratively in order to reduce manufacturing preparation time for developing a new car. Automated generation of a simulation model by using the integrated process plan database can reduce time consumed for carrying out a simulation and allow a consistent model to be used throughout. In this research, we developed a web-based system for concurrent and collaborative process planning and flow analysis for an automotive general assembly using web, database, and simulation technology. A single integrated database is designed to automatically generate simulation models from process plans without having to rework the data. This system enables process planners to evaluate their decisions quickly, considering various factors, and easily share their opinions with others. By using this collaborative system, time and cost put into the assembly process planning can be reduced and the reliability of the process plan would be improved.

Human Face Recognition Based on improved CNN Model with Multi-layers

  • Zhang, Ruyang;Lee, Eung-Joo
    • Journal of Korea Multimedia Society
    • /
    • v.24 no.5
    • /
    • pp.701-708
    • /
    • 2021
  • As one of the most widely used technology in the world right now, Face recognition has already received widespread attention by all the researcher and institutes. It has been used in many fields such as safety protection, surveillance system, crime control and even in our ordinary life such as home security and so on. This technology with today's technology has advantages such as high connectivity and real time transformation. But we still need to improve its recognition rate, reaction time and also reduce impact of different environmental status to the whole system. So in this paper we proposed a face recognition system model with improved CNN which combining the characteristics of flat network and residual network, integrated learning, simplify network structure and enhance portability and also improve the recognition accuracy. We also used AR and ORL database to do the experiment and result shows higher recognition rate, efficiency and robustness for different image conditions.

ON THE PROPERTIES OF POSITIVE BOOLEAN DEPENDENCIES BY GROUPS IN THE DATABASE MODEL OF BLOCK FORM

  • TRUC, TRINH NGOC;THANG, TRINH DINH;TUYEN, TRAN MINH
    • Journal of applied mathematics & informatics
    • /
    • v.40 no.3_4
    • /
    • pp.531-543
    • /
    • 2022
  • The article proposed a new type of data relationship: Positive Boolean dependencies by groups on block and slice in the database model of block form, where instead of considering value pairs, we consider a group of p values (p ≥ 2). From this new concept, the article stated and demonstrated the equivalence of the three types of deduction, namely: deduction by logic, deduction by block with groups, deduction by block has no more than p elements with groups. Operations on blocks or slices performed for index attributes on blocks, the properties related to this new concept as theorem the equivalen of the three types of deduction, closure of set positive Boolean dependencies by groups and representation and tight representation set of positive Boolean dependencies by groups when the block degenerated into relation are true in the relational database model and also stated and proven in this paper.

The Scalability and the Strategy for EMR Database Encryption Techniques

  • Shin, David;Sahama, Tony;Kim, Steve Jung-Tae;Kim, Ji-Hong
    • Journal of information and communication convergence engineering
    • /
    • v.9 no.5
    • /
    • pp.577-582
    • /
    • 2011
  • EMR(Electronic Medical Record) is an emerging technology that is highly-blended between non-IT and IT area. One of methodology to link non-IT and IT area is to construct databases. Nowadays, it supports before and after-treatment for patients and should satisfy all stakeholders such as practitioners, nurses, researchers, administrators and financial department and so on. In accordance with the database maintenance, DAS (Data as Service) model is one solution for outsourcing. However, there are some scalability and strategy issues when we need to plan to use DAS model properly. We constructed three kinds of databases such as plain-text, MS built-in encryption which is in-house model and custom AES (Advanced Encryption Standard) - DAS model scaling from 5K to 2560K records. To perform custom AES-DAS better, we also devised Bucket Index using Bloom Filter. The simulation showed the response times arithmetically increased in the beginning but after a certain threshold, exponentially increased in the end. In conclusion, if the database model is close to in-house model, then vendor technology is a good way to perform and get query response times in a consistent manner. If the model is DAS model, it is easy to outsource the database, however, some technique like Bucket Index enhances its utilization. To get faster query response times, designing database such as consideration of the field type is also important. This study suggests cloud computing would be a next DAS model to satisfy the scalability and the security issues.

Indoor 3D Dynamic Reconstruction Fingerprint Matching Algorithm in 5G Ultra-Dense Network

  • Zhang, Yuexia;Jin, Jiacheng;Liu, Chong;Jia, Pengfei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.1
    • /
    • pp.343-364
    • /
    • 2021
  • In the 5G era, the communication networks tend to be ultra-densified, which will improve the accuracy of indoor positioning and further improve the quality of positioning service. In this study, we propose an indoor three-dimensional (3D) dynamic reconstruction fingerprint matching algorithm (DSR-FP) in a 5G ultra-dense network. The first step of the algorithm is to construct a local fingerprint matrix having low-rank characteristics using partial fingerprint data, and then reconstruct the local matrix as a complete fingerprint library using the FPCA reconstruction algorithm. In the second step of the algorithm, a dynamic base station matching strategy is used to screen out the best quality service base stations and multiple sub-optimal service base stations. Then, the fingerprints of the other base station numbers are eliminated from the fingerprint database to simplify the fingerprint database. Finally, the 3D estimated coordinates of the point to be located are obtained through the K-nearest neighbor matching algorithm. The analysis of the simulation results demonstrates that the average relative error between the reconstructed fingerprint database by the DSR-FP algorithm and the original fingerprint database is 1.21%, indicating that the accuracy of the reconstruction fingerprint database is high, and the influence of the location error can be ignored. The positioning error of the DSR-FP algorithm is less than 0.31 m. Furthermore, at the same signal-to-noise ratio, the positioning error of the DSR-FP algorithm is lesser than that of the traditional fingerprint matching algorithm, while its positioning accuracy is higher.