• Informatization Policy
• /
• v.21 no.1
• /
• pp.35-56
• /
• 2014

Information and communication technologies(ICT) allow and force people to work anywhere, anytime using remote databases and application systems available in real-time twenty four hours a day and seven days a week. With the real time nature of ICT, individual work is becoming more and more fragmented. Instead of working on a similar task repeatedly, individuals are required to respond to e-mails and inquiries through social networks, work on planning documents, work on presentation documents, work on spreadsheets, input necessary data on company databases, generate necessary reports from the database, run teleconference, etc., all maybe in a day's work. Work fragmentation may impact negatively on productivity as the flow is interrupted, but it may increase the productivity by allowing people to handle multiple tasks in a shorter time period. This study explores the types of work fragmentation and their characteristics. An online survey was administered to collect data about work fragmentation and work characteristics including autonomy, complexity, flexibility, usage of ICT, etc. 300 cases were used in the analysis. Analysis of k-mean cluster indicated four different types of work fragmentation: concentrated, temporally distributed, spatially distributed, and fully fragmented.

• Journal of Information Management
• /
• v.26 no.1
• /
• pp.80-98
• /
• 1995

Search strategies is a means to make an efficient search. Among several studies of search strategy, Bates' $\ulcorner$Search Tactics$\lrcorner$ has been often cited and introduced, but their studies have been superficial. In this paper, the contents of Bates' $\ulcorner$Search Tactics$\lrcorner$ are examined in detail, and we try to represent the actual online search process based upon Bates' $\ulcorner$Search Tactics$\lrcorner$. The following three kinds of survey are made in order to clarify which and how tactics are used: (1) Interview with 7 searchers who belong to different types of organizations, and use different kinds of databases (2) Analysis of some online search records. (3) Analysis of written applications for a newspaper database during one year. In conclusion, Bates' tactics falls into categories and new several tactics which often used are added. The following five factors affect online search activities, search strategy, and search tactics. (1) the difficulty of search requests (2) the kinds of databases (3) the charging policy for each online search (4) the presence of the user during the search (5) the searcher' online experience In the limited condition, typical tactics are suggested, but in order to generalize the pattern of using tactics, further investigation is necessary.

• Journal of Information Management
• /
• v.29 no.4
• /
• pp.1-22
• /
• 1998

The domain of database standardization can be divided into three fields; general database, data, and database by basic reference model. The international activities for the database standardization are currently being proceeded variously and actively. This article analyzes the status of the activities of ISO/TC46 in the information & documentation and ISO/IEC JTC1/SC32 in the data management and interchange, and proposes a plan for strenthening the activities of the domestic technical committees related to these activities. This also presents the status of the legislative organizations of the domestic databases standardization and the directions of promoting their activities.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.8B
• /
• pp.947-953
• /
• 2011

These days, a consistent and fatal attack attribute toward a database has proportionally evolved in the similar development form to that of security policy. Because of access control-based defensive techniques regarding information created in closed networks and attacks on a limited access pathway, cases of infringement of many systems and databases based on accumulated and learned attack patterns from the past are increasing. Therefore, the paper aims to separate attack information by its types based on a virtual infringement pattern system loaded with dualistic VM in order to ensure stability to limited certification and authority to access, to propose a system that blocks infringement through the intensive management of infringement pattern concerning attack networks, and to improve the mechanism for implementing a test that defends the final database, the optimal defensive techniques, and the security policies, through research.

• Journal of Digital Convergence
• /
• v.12 no.12
• /
• pp.293-301
• /
• 2014

In this paper, we propose a new measure based on the confidence of Bayesian posterior probability so as to reduce unimportant information in the clustering process. Because the performance of clustering is up to selecting the important degree of attributes within the databases, the concept of information entropy is added to posterior probability for attributes discernibility. Hence, The same value of attributes in the confidence of the proposed measure is considerably much less due to the natural logarithm. Therefore posterior probability-based clustering algorithm selects the minimum of attribute reducts and improves the efficiency of clustering. Analysis of the validation of the proposed algorithms compared with others shows their discernibility as well as ability of clustering to handle uncertainty with ACME categorical data.

• International Journal of Knowledge Content Development & Technology
• /
• v.11 no.3
• /
• pp.63-79
• /
• 2021

The KJC and KCI services operated by the National Research Foundation of Korea (NRF) need to refer to the global citation index database to set the service direction that researchers want and develop new functions. Therefore, in this study, the usability of Korea's KJC and KCI web databases was evaluated. In addition, FGI verification was performed for a group of experts on KJC and KCI improvement measures derived by academic information experts. The evaluation committee consisted of the researcher group, the society related group, the publisher (academic information distribution organization) group, and the policy-making organization group. A total of 16 experts performed usability evaluation and service improvement proposals for KJC and KCI services. As a result of usability evaluation of KJC and KCI web database using SUS measurement tool, KJC service was evaluated as 73.44, and KCI service was evaluated as good as 64.38. KJC improvement proposals were evaluated positively with 4 points or more for all improvement items, and KCI improvement proposals were positively evaluated with 3.5 points or more for all improvement items. Overall, KJC and KCI error improvements were evaluated with a score of 4 or more, showing strong affirmations. In the future, it is hoped that the improvement proposals and improvements proposed in this study will be applied to the development of KJC and KCI services, so that more quality services will be used by domestic researchers.

• Journal of KIISE:Databases
• /
• v.30 no.3
• /
• pp.320-335
• /
• 2003

Location-Based Services(LBS) give rise to location-based queries of which results depend on the locations of moving objects. One of important applications of LBS is to examine tracks of continuously moving objects. Moving objects databases need to provide 3-dimensional indexing for efficiently processing range queries on the movement of continuously changing positions. An extension of the 2-dimensional R-tree to include time dimension shows low space utilization and poor search performance, because of high overlap of index nodes and their dead space. To solve these problems, we propose a new R-tree based indexing technique, namely TR-tree. To increase storage utilization, we assign more entries to the past node by using the unbalanced splitting policy. If two nodes are highly overlapped, these nodes are forcibly merged. It is the forced merging policy that reduces the dead space and the overlap of nodes. Since big line segments can also affect the overlap of index nodes to be increased, big line segments should be clipped by the clipping policy when splitting overfull nodes. The TR-tree outperforms the 3DR-tree and TB-tree in all experiments. Particularly, the storage utilization of the TR-tree is higher than the R-tree and R*-tree.

• Journal of KIISE:Databases
• /
• v.29 no.2
• /
• pp.119-127
• /
• 2002

Video server which stores video streams should serve more users with the requested streams rapidly, satisfying their time constraints. However, the number of users supported and the response times for the requested services in video server are in the oppositional relationship with viewpoint of disk throughput. In this paper, we propose new policy that can provide not only rapid responses for the service requests but also increase the number of users supported in the storage system of video server. The policy admits the random movements of disk heads for urgent service requests but maintains the sequential or restricted movements of disk heads and eliminates rewind time of disk heads for less-urgent service requests in storage system of multiple disks environment so that it can not satisfy only the QoS of users but also support more users.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.6
• /
• pp.2078-2094
• /
• 2015

Now a days, Efficient processing of Broadcast Queries is of critical importance with the ever-increasing deployment and use of mobile technologies. BQs have certain unique characteristics that the traditional spatial query processing in centralized databases does not address. In novel query processing technique, by maintaining high scalability and accuracy, latency is reduced considerably in answering BQs. Novel approach is based on peer-to-peer sharing, which enables us to process queries without delay at a mobile host by using query results cached in its neighboring mobile peers. We design and evaluate cooperative caching techniques to efficiently support data access in ad hoc networks. We first propose two schemes: Cache Data, which caches the data, and Cache Path, which caches the data path. After analyzing the performance of those two schemes, we propose a hybrid approach (Hybrid Cache), which can further improve the performance by taking advantage of Cache Data and Cache Path while avoiding their weaknesses. Cache replacement policies are also studied to further improve the performance. Simulation results show that the proposed schemes can significantly reduce the query delay and message complexity when compared to other caching schemes.

• Agribusiness and Information Management
• /
• v.11 no.1
• /
• pp.1-9
• /
• 2019

This research intends to propose the methodology for analyzing the current trends of agriculture, which directly connects to the survival of the nation, and through this methodology, identify the agricultural trend of Korea. Based on the relationship between three types of data - policy reports, academic articles, and news articles - the research deducts the major issues stored by each data through LDA, the representative topic modeling method. By comparing and analyzing the LDA results deducted from each data source, this study intends to identify the implications regarding the current agricultural trends of Korea. This methodology can be utilized in analyzing industrial trends other than agricultural ones. To go on further, it can also be used as a basic resource for contemplation on potential areas in the future through insight on the current situation. database of the profitability of a total of 180 crop types by analyzing Rural Development Administration's survey of agricultural products income of 115 crop types, small land profitability index survey of 53 crop types, and Statistics Korea's survey of production costs of 12 crop types. Furthermore, this research presents the result and developmental process of a web-based crop introduction decision support system that provides overseas cases of new crop introduction support programs, as well as databases of outstanding business success cases of each crop type researched by agricultural institutions.