• International Journal of Advanced Culture Technology
• /
• 제11권2호
• /
• pp.315-322
• /
• 2023

Intelligent IoT environments that accommodate a very large number of clients require technologies that provide secure information service regardless of the number of clients. Wireless data broadcast is an information service technique that ensures scalability to deliver data to all clients simultaneously regardless of the number of clients. In wireless data broadcasting, clients access the wireless channel linearly to explore the data, so the access time of clients is greatly affected by the broadcast cycle. Data compression-based data broadcasting can reduce the broadcast cycle and thus reduce client access time. Therefore, a simulation framework that can evaluate the performance of data broadcasting by applying different data compression algorithms is essential and important. In this paper, we propose a simulation framework to evaluate the performance of data broadcasting that can adopt data compression. We design the framework that enables to apply different data compression algorithms according to the data characteristics. In addition to evaluating the performance according to the data, the proposed framework can also evaluate the performance according to the data scheduling technique and the kind of queries the client wants to process. We implement the proposed framework and evaluate the performance of data broadcasting using the framework applying data compression algorithms to demonstrate the performances of data compression broadcasting.

• International Journal of Knowledge Content Development & Technology
• /
• 제8권1호
• /
• pp.25-36
• /
• 2018

Research data must be testable. Science is all about verification and testing. To make data testable, tools used to produce, collect, and examine data during the research must be available. Quite often, however, these data become inaccessible once the work is over and the results being published. Hence, information and the related context must be provided on how research data are preserved and how they can be reproduced. Open Science is the international movement for making scientific research data properly accessible for research community. One of its major goals is building data repositories to foster wide dissemination of open data. The objectives of this research are to examine the features of research data, common repository platforms, and community requests for the purpose of designing functional requirements for research data repositories. To analyze the features of the research data, we use data curation profiles available from the Data Curation Center of the Purdue University, USA. For common repository platforms we examine Fedora Commons, iRODS, DataONE, Dataverse, Open Science Data Cloud (OSDC), and Figshare. We also analyze the requests from research community. To design a technical solution that would meet public needs for data accessibility and sharing, we take the requirements of RDA Repository Interest Group and the requests for the DataNest Community Platform developed by the Korea Institute of Science and Technology Information (KISTI). As a result, we particularize 75 requirement items grouped into 13 categories (metadata; identifiers; authentication and permission management; data access, policy support; publication; submission/ingest/management, data configuration, location; integration, preservation and sustainability, user interface; data and product quality). We hope that functional requirements set down in this study will be of help to organizations that consider deploying or designing data repositories.

• 한국농촌건축학회논문집
• /
• 제24권3호
• /
• pp.39-46
• /
• 2022

This study aims to derive basic living service facility items in rural areas and construct related spatial data. To do this, a literature review on the laws and systems related to the residential environment and services in rural areas, rural spatial planning, and the 'Rural Convention' strategic plan reports for the Jeolla and Gyeongsang Region in 2021 was conducted. Primary data collection and review on the list of basic living service items in rural areas derived from the analysis were conducted. After data collection, 12 sectors and 44 types of rural basic living service items were derived; the data selection was carried out based on the clarity of the subject of data management, whether it was established nationwide, whether it was disclosed and provided, whether it was periodically updated, and whether it was an underlying law. Afterwards, data on the derived rural basic living service items were constructed. Afterwards, spatial data on the derived rural basic living service items were constructed. Because open data provided through various institutions were employed, data structure unification such as data attribute values and code names was needed, and abnormal data such as address errors and omissions were refined. After that, the data provided in text form was converted into spatial data through geocoding, and through comparative review of the distribution status of the converted data and the provided address, spatial data related to rural basic living services were finally constructed for about 540,000 cases. Finally, implications for data construction for diagnosing rural living areas were derived through the data collection and construction process. The derived implications include data unification, data update system establishment, the establishment of attribute values necessary for rural living area diagnosis and spatial planning, data establishment plan for facilities that provide various services, rural living area analysis method, and diagnostic index development. This study is meaningful in that it laid the foundation for data-based rural area diagnosis and rural planning, by selecting the basic rural living service items, and constructing spatial data on the selected items.

• Journal of Information Processing Systems
• /
• 제12권2호
• /
• pp.234-248
• /
• 2016

Due to the proliferation of data being exchanged and the increase of dependency on this data for critical decision-making, it has become imperative to ensure the trustworthiness of the data at the receiving end in order to obtain reliable results. Data provenance, the derivation history of data, is a useful tool for evaluating the trustworthiness of data. Various frameworks have been proposed to evaluate the trustworthiness of data based on data provenance. In this paper, we briefly review a history of these frameworks for evaluating the trustworthiness of data and present an overview of some prominent state-of-the-art evaluation frameworks. Moreover, we provide a comparative analysis of two key frameworks by evaluating various aspects in an executional environment. Our analysis points to various open research issues and provides an understanding of the functionalities of the frameworks that are used to evaluate the trustworthiness of data.

• Journal of Computing Science and Engineering
• /
• 제10권1호
• /
• pp.21-31
• /
• 2016

With the application and development of biomedical techniques such as next-generation sequencing, mass spectrometry, and medical imaging, the amount of biomedical data have been growing explosively. In terms of processing such data, we face the problems surrounding big data, highly intensive computation, and high dimensionality data. Fortunately, cloud computing represents significant advantages of resource allocation, data storage, computation, and sharing and offers a solution to solve big data problems of biomedical research. In order to improve the efficiency of resource management in cloud computing, this paper proposes a clustering method and adopts Radial Basis Function in order to compress comprehensive data sets found in biology and medicine in high quality, and stores these data with resource management in cloud computing. Experiments have validated that with such a data-compression-based resource management in cloud computing, one can store large data sets from biology and medicine in fewer capacities. Furthermore, with reverse operation of the Radial Basis Function, these compressed data can be reconstructed with high accuracy.

• 대한기계학회논문집A
• /
• 제21권2호
• /
• pp.209-216
• /
• 1997

A feature is well known as a medium to integrate CAD, CAPP and CAM systems. For a part drawing including both simple geometry and compound geometry, a process plan such as the selection of process, machine tool, cutting tool etc. normally needs simple geometry data and non-geometry data of the feature as the input. However, a extended process plan such as the generation of process sequence, operation sequence, jig & fixture, NC program etc. necessarily needs the compound geometry data as well as the simple geometry data and non-geometry data. In this paper, we propose a feature data model according to the result of analyzing necessary data, including the compound geometry data, the simple geometry data and the non-geometry data. Also, an example of the feature data model in milling process planning is described.

• 한국융합학회논문지
• /
• 제4권1호
• /
• pp.43-48
• /
• 2013

Designing of similarity on high dimensional data was done. Similarity measure between high dimensional data was considered by analysing neighbor information with respect to data sets. Obtained result could be applied to big data, because big data has multiple characteristics compared to simple data set. Definitely, analysis of high dimensional data could be the pre-study of big data. High dimensional data analysis was also compared with the conventional similarity. Traditional similarity measure on overlapped data was illustrated, and application to non-overlapped data was carried out. Its usefulness was proved by way of mathematical proof, and verified by calculation of similarity for artificial data example.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제14권10호
• /
• pp.4198-4213
• /
• 2020

Data encryption, particularly application-level data encryption, is a common solution to protect data confidentiality and deal with security threats. Application-level encryption is a process in which data is encrypted before being sent to the database. However, cryptography transforms data and makes the query difficult to execute. Various studies have been carried out to find ways in order to implement a searchable encrypted database. In the current paper, we provide a new encrypting method and querying on encrypted data (ZSDB) for different data types. It is worth mentioning that the proposed method is based on secret sharing. ZSDB provides data confidentiality by dividing sensitive data into two parts and using the additional server as Dictionary Server. In addition, it supports required operations on various types of data, especially LIKE operator functioning on string data type. ZSDB dedicates the largest volume of execution tasks on queries to the server. Therefore, the data owner only needs to encrypt and decrypt data.

• Journal of the Korean Data and Information Science Society
• /
• 제17권1호
• /
• pp.53-62
• /
• 2006

DNA microarray data analysis is a new technology to investigate the expression levels of thousands of genes simultaneously. Since DNA microarray data structures are various and complicative, the data are generally stored in databases for approaching to and controlling the data effectively. But we have some difficulties to analyze and control the data when the data are stored in the several database management systems or that the data are stored to the file format. The existing analysis tools for DNA microarray data have many difficult problems by complicated instructions, and dependency on data types and operating system. In this paper, we design and implement network-based analysis tool for obtaining to useful information from DNA microarray data. When we use this tool, we can analyze effectively DNA microarray data without special knowledge and education for data types and analytical methods.

• 지능정보연구
• /
• 제3권2호
• /
• pp.33-55
• /
• 1997

A data model is a diagram that describes the properties of different categories of data and the associations among them within a business or information system. In spite of its importance and usefulness, data modeling activity requires not only a lot of time and effort but also extensive experience and expertise. The data models for similar business areas are analogous to one another. Therefore, it is reasonable to reuse the already-developed data models if the target business area is similar to what we have already analyzed before. In this research, we develop a case-based reasoning system for data model reuse, which we shall call CB-DM Reuser (Case-Based Data Model Reuser). CB-DM Reuse consists of four subsystems : the graphic user interface to interact with end user, the data model management system to build new data model, the case base to store the past data models, and the knowledge base to store data modeling and data model reusing knowledge. We present the functionality of CB-DM Reuser and show how it works on real-life a, pp.ication.