• Journal of Korea Entertainment Industry Association
• /
• v.13 no.8
• /
• pp.117-130
• /
• 2019

After Marx, the issues regarding human labour have been the alienation towards production means and the distributive justice. Fourth industrial revolution and development of AI(Artificial Intelligence) opened the possibility of a independent production and economy system absolutely excluding against human nature and labour. Using robots and AI will deepen demarcation between living things and one not having life, separating the intelligence from the consciousness. At present, so called pre-stage of post human, seeking interests for life, new social relationship and new community will be increased as well. We can understand that interests for small community, self-sufficiency, dailiness, food and body in this context is increasing too. Representative trend towards this cultural phenomena is called as the 'Kinfolk culture.' Work-life balance, 'Aucalme', 'Hygge', 'So-Hwak-Haeng'(a small but reliable happiness) are the similar culture trends as. Vital capitalism, presented by O-Yong Lee, seeks focusing onto living things principles, e.g. 'topophilia', 'neophilia', and 'biophilia' as the dynamics looking for the history substructure, not class struggle and conflicts. He also argues the 'Vital Capitalism' be regarded as a new methodology to anticipate a social system after post human era. G. Deleuze said "arts is another expression method for existential philosophy. It gives a vitality onto philosophy and gives a role to letting abstract concept into definite image." We can find a lot cases arts' imagination overcomes critical point of scientific prediction power in the future prediction. This paper reviews ideas and issues of 'vital capitalism' in detail and explorers imaginating initial ideas of vital capitalism in the film 'Little Forest.'

• Asia-pacific Journal of Multimedia Services Convergent with Art, Humanities, and Sociology
• /
• v.7 no.12
• /
• pp.937-946
• /
• 2017

Recently, urban structures including buildings are becoming increasingly large and super high-rise in order to make human life more convenient. As the number of super high-rise buildings increases, however, the risk of fire and other disasters is increasing. Especially, it is expected that deaths and injuries will be tremendous than imagined if the evacuation guidance is not provided promptly and precisely for the occupants in case of a fire in super high-rise buildings. Therefore, rapid rescue should be done for those who are in need of residence or rescue in the building. To do this, identification of the size and location of people inside the building should be preceded. To do this, first, we conduct a preliminary study on existing location tracking technologies to identify occupants. Based on this, in this paper, we will study how to improve evacuation time in case of a fire in super high-rise buildings. For this purpose, we utilize the location tracking technology to identify the number of people in real time and improve the density when a disaster such as a fire occurs.

• Asia-pacific Journal of Multimedia Services Convergent with Art, Humanities, and Sociology
• /
• v.9 no.6
• /
• pp.443-450
• /
• 2019

Vicia amoena has traditionally been used to treat disease of rheumatism, arthralgia, muscular paralysis, abscess and eczema, and it has anti-inflammatory properties. However, validity of the anti-inflammatory activity has not been scientifically in vestige acted so far. Therefore, the aim of this study was to investigate the anti-inflammatory potential of V. amoena using the ethanolic extract. To evaluate the anti-inflammatory effects, we examined the inflammatory mediators such as nitric oxide (NO) and prostaglandin E₂ (PGE₂) on RAW264.7 cells. Our results indicated that ethanolic extract of V. amoena significantly inhibited the LPS-induced NO and PGE₂ production in RAW264.7 cells. The ethanolic extract of V. amoena has inhibited the PGE₂ production by 88.0±0.8 % at the concentration of 40㎍/ml. This results showed that ethanol extract of V. amoena is expected to be a good candidate for development into source of inflammation inhibitor

• Asia-pacific Journal of Multimedia Services Convergent with Art, Humanities, and Sociology
• /
• v.9 no.5
• /
• pp.811-821
• /
• 2019

Image making for a person is a way to improve various factors that can express oneself, such as appearance, impression, and confidence. In general, people use mirror or camera as a traditional method to make their own image or perform presentation exercises. Recently, as smart mirrors are widely used in various fields, attempts to use smart mirrors as image making tools instead of mirrors have been frequently made. Smart Mirror is considered as a suitable tool to provide image making service because it can attach various devices such as a camera and a microphone in addition to the main advantage of a mirror that it is easily accessible. In this paper, we present BuddyMirror - a smart mirror software that provides image-making service to users, and a dedicated mobile app for flexibly running the mirror software. BuddyMirror provides functions for presentation, mock interview, and styling service at the request of users, interworking with the dedicated mobile app. We also describe the techniques developed for implementing and activating each of the new services as a module of MagicMirror, a widely used smart mirror development platform. The developed mobile app enables users to deliver presentations to BuddyMirror or to download the recorded video for image-making services.

• Asia-pacific Journal of Multimedia Services Convergent with Art, Humanities, and Sociology
• /
• v.7 no.6
• /
• pp.719-729
• /
• 2017

Recently, the field of agriculture has been gaining a new leap with the integration of ICT technology in agriculture. In particular, smart farms, which incorporate the Internet of Things (IoT) technology in agriculture, are in the spotlight. Smart farm technology collects and analyzes information such as temperature and humidity of the environment where crops are cultivated in real time using sensors to automatically control the devices necessary for harvesting crops in the control device, Environment. Although smart farm technology is paying attention as if it can solve everything, most of the research focuses only on increasing crop yields. This paper focuses on the development of a system architecture that can harvest high quality crops at the optimum stage rather than increase crop yields. In this paper, we have developed an architecture using apple trees as a sample and used the color information and weight information to predict the harvest time of apple trees. The simple board that collects color information and weight information and transmits it to the server side uses Arduino and adopts model-driven development (MDD) as development methodology. We have developed an architecture to provide services to PC users in the form of Web and to provide Smart Phone users with services in the form of hybrid apps. We also developed an architecture that uses beacon technology to provide orchestration information to users in real time.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.23 no.6
• /
• pp.55-60
• /
• 2023

When performing the multiplication m×r=p of two binary numbers m and r on a computer, there is a shift-and-add(SA) method in which no time-consuming multiplication is performed, but only addition and shift-right(SR). SA is a very simple method in which when the value of the multiplier r_i is 0, the result p is only SR with m×0=0, and when r_i is 1, the result p=p+m is performed with m×1=m, and p is SR. In SA, the number of SRs can no longer be shortened, and the improvement part is whether the number of additions is shortened. This paper proposes an SA method to minimize addition based on the fact that setting a smaller number to r when converted to a binary number to be processed by a computer can significantly reduce the number of additions compared to the case of setting a smaller number to r based on the decimals that humans perform. The number of additions to the proposed algorithm was compared for four cases with signs (-,-), (-,+), (+,-), and (+,+) for some numbers in the range [-127,128]. The conclusion obtained from the experiment showed that when determining m and r, it should be determined as a binary number rather than a decimal number.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.23 no.5
• /
• pp.151-158
• /
• 2023

The researchers entirely focused on meta-heuristic method for generalized assignment problem(GAP) that is known as NP-hard problem because of the optimal solution within polynomial time algorithm is unknown yet. On the other hand, this paper proposes a heuristic greedy algorithm with rules for finding solutions. Firstly, this paper reduces the weight matrix of original data to w_ij ≤ b_i/l in order to n jobs(items) pack m machines(bins) with l = n/m. The maximum profit of each job was assigned to the machine for the reduced data. Secondly, the allocation was adjusted so that the sum of the weights assigned to each machine did not exceed the machine capacity. Finally, the k-opt swap optimization was performed to maximize the profit. The proposed algorithm is applied to 50 benchmarking data, and the best known solution for about 1/3 data is to solve the problem. The remaining 2/3 data showed comparable results to metaheuristic techniques. Therefore, the proposed algorithm shows the possibility that rules for finding solutions in polynomial time exist for GAP. Experiments demonstrate that it can be a P-problem from an NP-hard.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.24 no.2
• /
• pp.99-104
• /
• 2024

In the deficiency of an exact solution yielding algorithm, approximate algorithms remain as a solely viable option to the Minimum Linear Arrangement(MinLA) problem of Binary tree. Despite repeated attempts by a number of algorithm on k = 10, only two of them have been successful in yielding the optimal solution of 3,696. This paper therefore proposes an algorithm of O(n) complexity that delivers the exact solution to the binary tree. The proposed algorithm firstly employs an In-order search method by which n = 2^k - 1 number of nodes are assigned with a distinct number. Then it reassigns the number of all nodes that occur on level 2 ≤ 𝑙 ≤ k-2, (k = 5) and 2 ≤ 𝑙 ≤ k-3, (k = 6), including that of child of leaf node. When applied to k=5,6,7, the proposed algorithm has proven Chung[14]'s S^(k)_min=2^k-1+4+S^(k-1)_min+2S^(k-2)_min conjecture and obtained a superior result. Moreover, on the contrary to existing algorithms, the proposed algorithm illustrates a detailed assignment method. Capable of expeditiously obtaining the optimal solution for the binary tree of k > 10, the proposed algorithm could replace the existing approximate algorithms.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.24 no.2
• /
• pp.105-111
• /
• 2024

This paper deals with the minimum linear arrangement(MinLA) of a lattice graph, to which an approximate algorithm of linear complexity O(n) remains as a viable solution, deriving the optimal MinLA of 31,680 for 33×33 lattice. This paper proposes a partitioning arrangement algorithm of complexity O(1) that delivers exact solution to the minimum linear arrangement. The proposed partitioning arrangement algorithm could be seen as loading boxes into a container. It firstly partitions m rows into r₁,r₂,r₃ and n columns into c₁,c₂,c₃, only to obtain 7 containers. Containers are partitioning with a rule. It finally assigns numbers to vertices in each of the partitioned boxes location-wise so as to obtain the MinLA. Given m,n≥11, the size of boxes C₂,C₄,C₆ is increased by 2 until an increase in the MinLA is detected. This process repeats itself 4 times at maximum given m,n≤100. When tested to lattice in the range of 2≤n≤100, the proposed algorithm has proved its universal applicability to lattices of both m=n and m≠n. It has also obtained optimal results for 33×33 and 100×100 lattices superior to those obtained by existing algorithms. The minimum linear arrangement algorithm proposed in this paper, with its simplicity and outstanding performance, could therefore be also applied to the field of Very Large Scale Integration circuit where m,n are infinitely large.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.24 no.1
• /
• pp.37-42
• /
• 2024

This paper suggests polynomial time algorithm for cutwidth minimization problem that classified as NP-complete because the polynomial time algorithm to find the optimal solution has been unknown yet. To find the minimum cutwidth CW_f(G)=max_𝜈∈_VCW_f(𝜈)for given graph G=(V,E),m=｜V｜, n=｜E｜, the proposed algorithm divides neighborhood N_G[𝜈_i] of the maximum degree vertex 𝜈_i in graph G into left and right and decides the vertical cut plane with minimum number of edges pass through the vertex 𝜈_i firstly. Then, we split the left and right N_G[𝜈_i] into horizontal sections with minimum pass through edges. Secondly, the inner-section vertices are connected into line graph and the inter-section lines are connected by one line layout. Finally, we perform the optimization process in order to obtain the minimum cutwidth using vertex moving method. Though the proposed algorithm requires O(n²) time complexity, that can be obtains the optimal solutions for all of various experimental data