• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.4
• /
• pp.878-894
• /
• 2013

Secure multimedia multicast applications involve group communications where group membership requires secured dynamic key generation and updating operations. Such operations usually consume high computation time and therefore designing a key distribution protocol with reduced computation time is necessary for multicast applications. In this paper, we propose a new key distribution protocol that focuses on two aspects. The first one aims at the reduction of computation complexity by performing lesser numbers of multiplication operations using a ternary-tree approach during key updating. Moreover, it aims to optimize the number of multiplication operations by using the existing Karatsuba divide and conquer approach for fast multiplication. The second aspect aims at reducing the amount of information communicated to the group members during the update operations in the key content. The proposed algorithm has been evaluated based on computation and communication complexity and a comparative performance analysis of various key distribution protocols is provided. Moreover, it has been observed that the proposed algorithm reduces the computation and communication time significantly.

• Journal of the Korean Institute of Landscape Architecture
• /
• v.35 no.3
• /
• pp.50-61
• /
• 2007

The purpose of this study is to establish design guidelines for waterscape facilities of healing gardens in psychiatric hospitals. Data were collected through simulation and interview. The subjects included schizophrenic (n=42) and alcoholic (n=41) inpatients as well as medical staff personnel (n=40) at Maeumsarang Hospital. The results of this study are as follows: It was revealed that for all three groups the first preference was a natural flowing waterscape, and the second preference was a natural descending waterscape. The schizophrenic subjects had a greater preference for a static artificial waterscape and a descending artificial multistory waterscape than the other two groups. The alcoholic subjects preferred an ascending natural multistory waterscape. The analysis on the preference towards an ascending type and a descending type from the perspective of naturalness and complexity. Complexity had a greater influence than naturalness in the ascending waterscapes, and naturalness had more influence than complexity in the descending style waterscapes. Therefore, these factors need to be taken into consideration when designing either ascending or descending waterscape facilities. In general, the subjects preferred natural, dynamic and descending waterscapes to the artificial, static and ascending variety.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.38 no.2
• /
• pp.16-26
• /
• 2001

This paper develops the fast dynamic programming technique to construct the subband structure yielding the maximum coding gain for given filter bases and a given limit of implementation complexity. We first derive the unified coding gain which can be applied to non-orthogonal filter basis as well as orthogonal filter basis and to arbitrary subband decompositions. Then, we verify that the unified coding gains in real systems are monotonically increasing function for the implementation complexities which are proportional to the number of subbands. By using this phenomenon, the implementation complexity and the coding gain are treated in the same way as the rate and distortion function. This makes it possible to use the Lagrangian multiplier method for finding the optimal subband decomposition producing the maximum coding gain [or a given limit of implementation complexity.

• Journal of Broadcast Engineering
• /
• v.20 no.6
• /
• pp.880-887
• /
• 2015

In this paper, frame rate up conversion (FRUC) algorithm considering the direction and magnitude of identical motion vectors is proposed. extended bilateral motion estimation (EBME) has higher complexity than bilateral motion estimation (BME). By using average magnitude of motion vector with x and y direction respectively, dynamic frame and static frame are decided. We reduce complexity to decide EBME. also, After we compare the direction and magnitude of identical motion vectors, We reduce complexity to decide motion vector smoothing(MVS). Experimental results show that this proposed algorithm has fast computation and better peak singnal to noise ratio(PSNR) results compared with EBME.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.39 no.2
• /
• pp.131-140
• /
• 2014

Customer networks go through constant changes. They may expand or shrink once they are formed. In dynamic environments, it is a critical corporate challenge to identify and manage influential customer groups in a cost effective way. In this context, we apply inverse optimization theory to suggest an efficient method to manage customer networks. In this paper, we assume that there exists a subset of nodes that might have a large effect on the network and that the network can be modified via some strategic actions. Rather than making efforts to find influential nodes whenever the network changes, we focus on a subset of selective nodes and perturb as little as possible the interaction between nodes in order to make the selected nodes influential in the given network. We define the following problem based on the inverse optimization. Given a graph and a prescribed node subset, the objective is to modify the structure of the given graph so that the fixed subset of nodes becomes a minimum dominating set in the modified graph and the cost for modification is minimum under a fixed norm. We call this problem the inverse dominating set problem and investigate its computational complexity.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.6C
• /
• pp.571-577
• /
• 2009

This paper proposes some new improved versions of node-wise VCRBP algorithm for low-density parity-check (LDPC) codes, called forced-convergence node-wise VCRBP algorithm and sign based node-wise VCRBP, both of which significantly reduce the decoding complexity and latency, with only negligible deterioration in error correcting performance.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1994.04a
• /
• pp.328-338
• /
• 1994

TSP(Traveling Salesman Problem) is a famous problem in Operations Research fields due to its applicability to various problems. It is also well-known that the problem is hard to solve in reasonable time, since it is in the NP-Complete class. Hence it is desired to develop heuristics which have polynominal complexity and also solve the problem to near-optimality. This paper presents a heuristic algorithm for TSP using the concept of dynamic programming. The proposed method has the complexity of O(N$\^$3/), and gives improved solutions than other well-known algorithms in our extensive computational experiments.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.05a
• /
• pp.1609-1615
• /
• 2006

Overlay multicast technique is an effective way as an alternative to IP multicast. Traditional IP multicast is not widely deployed because of the complexity of IP multicast technology and lack of application. But overlay multicast can be easily deployed by effectively reducing complexity of network routers. Because overlay multicast resides on top of densely connected IP network, In case of multimedia streaming service over overlay multicast tree, real-time data is sensitive to end-to-end delay. Therefore, moderate algorithm's development to this network environment is very important. In this paper, we are interested in minimizing maximum end-to-end delay in overlay multicast tree. The problem is formulated as a degree-bounded minimum delay spanning tree, which is a problem well-known as NP-hard. We develop tabu search heuristic with intensification and diversification strategies. Robust experimental results show that is comparable to the optimal solution and applicable in real time

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.27 no.8
• /
• pp.42-50
• /
• 2013

The reactionary responses to control human standing dynamics were estimated under the assumption that postural complexity mainly occurs in the mid-sagittal plane. During the experiment, the subject was exposed to continuous horizontal perturbation. The ankle and hip joint rotations of the subject mainly contributed to maintaining standing postural control. The designed mobile platform generated anterior/posterior (AP) motion. Non-predictive random translation was used as input for the system. The mean acceleration generated by the platform was measured as $0.44m/s^2$. The measured data were analyzed in the frequency domain by the coherence function and the frequency response function to estimate its dynamic responses. The significant correlation found between the input and output of the postural control system. The frequency response function revealed prominent resonant peaks within its frequency spectrum and magnitude. Subjects behaved as a non-rigid two link inverted pendulum. The analyzed data are consistent with the outcome hypothesized for this study.

• Journal of Information Technology Applications and Management
• /
• v.17 no.3
• /
• pp.191-211
• /
• 2010

Existing models of knowledge processing do not feature a systemic meaning of knowledge management and ignore the role of leadership and social energy in the knowledge processing system (KPS). This conceptual paper introduces the Leadership Invigorating Flows of Energies, (LIFE) Model as an attempt to remedy that situation and provide a more useful description of the KPS. The LIFE Model highlights the role of emergent leadership and flows of social energies as forces encouraging knowledge creation and dynamic diffusion within an organization through the Knowledge Processing Cycle in eight activities interacting with its social knowledge base in a self-organizing system.