• Journal of Digital Convergence
• /
• v.14 no.10
• /
• pp.415-421
• /
• 2016

There has been an enormous increase not only in the international economic exchanges but also in the cultural exchanges. However, studies to settle the cultural differences have been studied a lot with in economic and business partial but research of eliminating cultural differences for travelers has not been studied. Therefore, in this study, we tried to develop the service design to eliminate the cultural differences. To set the spatial range, we choose airport which can be the hub and the door of the travelers at the same time. Moreover, we tried to understand the meaning of communication and sharing to resolve differences in culture through literature studies. Further, we analyzed the airport application and examples of Wi-Fi linked services, so can be applied to the proposal. Travelers share the cultural differences by themselves; through the Wi-Fi service in the airport, and the existing airport application. We expect to be able to resolve the cultural differences between nations and develop not only their prosperity but also the national image by this service.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.3
• /
• pp.161-168
• /
• 2002

A secret sharing scheme is a cryptographic protocol to share a secret among a set of participants P in the way that only qualified subsets of P can reconstruct the secret whereas any other subset of P, non-qualified to know the secret, cannot determine anything about the secret. In this paper, we propose a new secret sharing scheme in hierarchical groups, whose hierarchy can be represented as a tree structure. In the tree structure, participants of higher levels have priorities to reconstruct the secret over participants of lower levels. In the absence of the participant of a higher level, it is possible for this participant to delegate the ability to reconstruct the secret to the child nodes of the next lower level through the transfer of his delegation ticket. This scheme has a dynamic access structure through the recursive delegation process from the root to lower levels where participants aren't absent.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.11
• /
• pp.5464-5488
• /
• 2019

The multi-population genetic algorithm in multi-target paths coverage has become a top choice for many test engineers. Also, information sharing strategy can improve the efficiency of multi-population genetic algorithm to generate multi-target test data; however, there is still space for some improvements in several aspects, which will affect the effectiveness of covering the target path set. Therefore, a multi-target paths coverage strategy is proposed by improving multi-population genetic algorithm based on individual information sharing among populations. It primarily contains three aspects. Firstly, the behavior of the sub-population covering corresponding target path is improved, so that it can continue to try to cover other sub-paths after covering the current target path, so as to take full advantage of population resources; Secondly, the populations initialized are prioritized according to the matching process, so that those sub-populations with better path coverage rate are executed firstly. Thirdly, for difficultly-covered paths, the individual chromosome features which can cover the difficultly-covered paths are extracted by utilizing the data generated, so as to screen those individuals who can cover the difficultly-covered paths. In the experiments, several benchmark programs were employed to verify the accuracy of the method from different aspects and also compare with similar methods. The experimental results show that it takes less time to cover target paths by our approach than the similar ones, and achieves more efficient test case generation process. Finally, a plug-in prototype is given to implement the approach proposed.

• Journal of KIISE
• /
• v.43 no.6
• /
• pp.686-691
• /
• 2016

In this paper, we introduced the adaptive spectral co-clustering, a spectral clustering for multiview data, especially data with more than three views. In the adaptive spectral co-clustering, the performance is improved by sharing information from diverse views. For the efficiency in information sharing, a co-training approach is adopted. In the co-training step, a set of parameters are estimated to make all views in data maximally independent, and then, information is shared with respect to estimated parameters. This co-training step increases the efficiency of information sharing comparing with ordinary feature concatenation and co-training methods that assume the independence among views. The adaptive spectral co-clustering was evaluated with synthetic dataset and multi lingual document dataset. The experimental results indicated the efficiency of the adaptive spectral co-clustering with the performances in every iterations and similarity matrix generated with information sharing.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.709-713
• /
• 2009

Recently, a lot of research that applies data acquired from devices such as cameras and RFIDs to context aware services is being performed in the field on Life-Log and the sensor network. A variety of analytical techniques has been proposed to recognize various information from the raw data because video and audio data include a larger volume of information than other sensor data. However, manually watching a huge amount of media data again has been necessary to create supervised data for the update of a class or the addition of a new class because these techniques generally use supervised learning. Therefore, the problem was that applications were able to use only recognition function based on fixed supervised data in most cases. Then, we proposed a method of acquiring supervised data from a video sharing site where users give comments on any video scene because those sites are remarkably popular and, therefore, many comments are generated. In the first step of this method, words with a high utility value are extracted by filtering the comment about the video. Second, the set of feature data in the time series is calculated by applying functions, which extract various feature data, to media data. Finally, our learning system calculates the correlation coefficient by using the above-mentioned two kinds of data, and the correlation coefficient is stored in the DB of the system. Various other applications contain a recognition function that is used to generate collective intelligence based on Web comments, by applying this correlation coefficient to new media data. In addition, flexible recognition that adjusts to a new object becomes possible by regularly acquiring and learning both media data and comments from a video sharing site while reducing work by manual operation. As a result, recognition of not only the name of the seen object but also indirect information, e.g. the impression or the action toward the object, was enabled.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.5
• /
• pp.197-203
• /
• 2012

This paper studies network recovery method using logical multiple ring architecture embedded in WDM optical Internet environment. The multiple ring-based recovery method provides fast and simple network restoration operation, and performs local recovery that is detouring the failed link. The multiple ring architecture can provide higher resource efficiency by sharing the backup routes and reducing the number of spare wavelengths. This paper calculates the required spare capacity ratio using Cut-Sets in the given network topology and performs simulation for comparative analysis.

• Journal of Distribution Science
• /
• v.22 no.7
• /
• pp.73-82
• /
• 2024

Purpose: This study aims to identify the assessment criteria on textile and apparel supply chain management performance. Research design, data, and methodology: An integrated method of Delphi, quantitative survey, and ANP, in which Delphi with Kamet principle was applied to define the set of criteria, quantitative survey with reliability and validity test was utilized to ensure the match between the set of criteria and the whole textile and apparel industry, and ANP was used to derive weights of these criteria. Results: The set of supply chain management performance evaluation criteria composes of seven criteria namely order fulfillment quality, agility, costs, asset management, information sharing, innovation, and product development and 19 sub-criteria. Conclusions: This study theoretical contribution is the proposition of the set of evaluation criteria on supply chain performance. Regarding practical contribution, the study findings are guidelines for T&A companies in assessing and improving their supply chain capability. However, the findings are only for Vietnamese T&A context. Future research, therefore, may be expanded to other regions or countries' T&A industry. Additionally, future step to this study may be the utilization of other techniques of MCDM or methodological approaches like multiple regression, PLSSEM in defining weights of criteria or performance evaluation.

• Journal of Korea Technology Innovation Society
• /
• v.6 no.1
• /
• pp.60-73
• /
• 2003

There are many studies on spin-offs from college, but there is little concern on start-ups, which are set up by college and operated by professors. We call this type of start-up as college start-up. We check the problems and solutions of this type of start-ups. We propose three factors for success; prior checking of profitability of the business, preparation of relevant school policies and profit sharing with school and professors participated.

• Bulletin of the Korean Mathematical Society
• /
• v.55 no.3
• /
• pp.717-734
• /
• 2018

By choosing defining set properly, several classes of linear codes with a few weights over the finite field ${\mathbb{F}}_p$ are constructed for an odd prime p, and the complete weight enumerators of these classes of codes are determined.

• Journal of Korea Multimedia Society
• /
• v.2 no.2
• /
• pp.195-199
• /
• 1999

While object-oriented models are effective in achieving sharing and code reusability, they unfortunately lack a mechanism for giving scope to objects. We propose an object-oriented model in which each object can be given a scope, i.e., an object becomes available only when it is needed. Thus, the set of currently available objects is dynamically changing and only the needed set of objects is maintained in this model. We illustrate the usefulness of this model through some examples.