• Journal of the Korea Society for Simulation
• /
• v.32 no.1
• /
• pp.23-34
• /
• 2023

The purpose of this paper is to review global stochastic optimization algorithms(GSOA) in case binary response experimentation is used and to compare the performances of them. GSOAs utilise estimator of probability of success $\^p$ instead of population probability of success p, since p is unknown and only known by its estimator which has stochastic characteristics. Hill climbing algorithm algorithm, simple random search, random search with random restart, random optimization, simulated annealing and particle swarm algorithm as a population based algorithm are considered as global stochastic optimization algorithms. For the purpose of comparing the algorithms, two types of test functions(one is simple uni-modal the other is complex multi-modal) are proposed and Monte Carlo simulation study is done to measure the performances of the algorithms. All algorithms show similar performances for simple test function. Less greedy algorithms such as Random optimization with Random Restart and Simulated Annealing, Particle Swarm Optimization(PSO) based on population show much better performances for complex multi-modal function.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.7
• /
• pp.1823-1840
• /
• 2023

In order to improve spectral efficiency and reduce power consumption for reconfigurable intelligent surface (RIS) assisted wireless communication systems, a joint design considering irregular RIS topology, RIS on-off switch, power allocation and phase adjustment is investigated in this paper. Firstly, a multi-dimensional variable joint optimization problem is established under multiple constraints, such as the minimum data requirement and power constraints, with the goal of maximizing the system energy efficiency. However, the proposed optimization problem is hard to be resolved due to its property of nonlinear nonconvex integer programming. Then, to tackle this issue, the problem is decomposed into four sub-problems: topology design, phase shift adjustment, power allocation and switch selection. In terms of topology design, Tabu search algorithm is introduced to select the components that play the main role. For RIS switch selection, greedy algorithm is used to turn off the RISs that play the secondary role. Finally, an iterative optimization algorithm with high data-rate and low power consumption is proposed. The simulation results show that the performance of the irregular RIS aided system with topology design and RIS selection is better than that of the fixed topology and the fix number of RISs. In addition, the proposed joint optimization algorithm can effectively improve the data rate and energy efficiency by changing the propagation environment.

• Journal of English Language & Literature
• /
• v.58 no.5
• /
• pp.943-974
• /
• 2012

This paper aims to suggest the compromising vision of nature and technology as the solution to get out of the globally accelerated technology environment in Don DeLillo's Cosmopolis. This novel intends to emphasize on the importance of physical environment as a precondition for the survival of human. Eric wants to be a posthuman with the cybernetic idea, pursuing to be the digital self in a vast biosphere that integrates both the nature and the technology. His obsessive worship of technology through his quest for the futurity results in the effacement of the humanity and the insulation from the nature. Cosmopolis is DeLillo's first 9/11 novel, which describes a young-billionaire asset manager Eric's one-day life in New York in April 2000. Eric can be the third Twin Tower as a symbol of global economic hegemony. By the allusion of the 9/11 catastrophic event, it can be said that Eric's fall is caused by his hubris and avarice as a global capitalist. Crossing the 47th Street toward the West in his limousine, his journey is revealed as the environmental reflections on his desires to attain the futurity and transcendence by technology. This novel cautions that the abuse of technology can bring out the obsolescence and erasure of the humanity and the nature. DeLillo suggests that the best hope for the evolutionary possibility of posthuman can be realized through the correlation with nature and technology. This future-oriented novel warns that the excessive technology should not lead to the disappearance of community and humanity, and the separation of self and nature. It admonishes that they should not follow pseudo-cosmopolitanism as the greedy world citizens, devoting on the velocity of newest technology. This novel recommends that humans should be the world citizen of global ecosystem, making the ameliorative environment through the correlation with self/environment and technology/nature, and gardening the restorative biosphere and the younger planet.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.18 no.5
• /
• pp.895-900
• /
• 2023

We study low-complexity graph sampling which selects a subset of nodes from graph nodes so as to reconstruct the original signal from the sampled one. To achieve complexity reduction, we propose a graph sampling algorithm with thresholding which selects a node with a cost lower than a given threshold at each step without fully searching all of the remaining nodes to find one with the minimum cost. Since it is important to find the threshold as close to a minimum cost as possible to avoid degradation of the reconstruction performance, we present a mathematical expression to compute the threshold at each step. We investigate the performance of the different sampling methods for various graphs, showing that the proposed algorithm runs 1.3 times faster than the previous method while maintaining the reconstruction performance.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.11
• /
• pp.1373-1381
• /
• 1999

이 논문에서는 통신망 설계 응용분야의 문제를 그래프 이론 문제로써 고려해 보았다. 개별 기업체가 서로 떨어진 두 곳을 연결하고자 할 때 공용통신망의 회선을 빌려 통신망을 구축하게 되는데 많은 경우 여러 종류의 회선들이 공급됨으로 어떤 회선을 선택하느냐의 문제가 생긴다. 일반적으로 빠른 회선(low delay)은 느린 회선(high delay)에 비해 비싸다. 그러나 서비스의 질(Quality of Service)이라는 요구사항이 종종 종단지연(end-to-end delay)시간에 의해 결정되므로, 무조건 낮은 가격의 회선만을 사용할 수는 없다. 결국 개별 기업체의 통신망을 위한 통로를 공용 통신망 위에 덮어씌워(overlaying) 구축하는 것의 여부는 두 개의 상반된 인자인 가격과 속도의 조절에 달려 있다. 따라서 일반적인 최소경로 찾기의 변형이라 할 수 있는 다음의 문제가 본 논문의 관심사이다. 두 개의 지점을 연결하는데 종단지연시간의 한계를 만족하면서 최소경비를 갖는 경로에 대한 해결을 위하여, 그래프 채색(coloring) 문제와 최단경로문제를 함께 포함하는 그래프 이론의 문제로 정형화시켜 살펴본다. 배낭문제로의 변환을 통해 이 문제는 {{{{NP-complete임을 증명하였고 {{{{O($\mid$E$\mid$D_0 )시간에 최적값을 주는 의사선형 알고리즘과O($\mid$E$\mid$)시간의 근사 알고리즘을 보였다. 특별한 경우에 대한 {{{{O($\mid$V$\mid$ + $\mid$E$\mid$)시간과 {{{{O($\mid$E$\mid$^2 + $\mid$E$\mid$$\mid$V$\mid$log$\mid$V$\mid$)시간 알고리즘을 보였으며 배낭 문제의 해결책과 유사한 그리디 휴리스틱(greedy heuristic) 알고리즘이 그물 구조(mesh) 그래프 상에서 좋은 결과를 보여주고 있음을 실험을 통해 확인해 보았다.Abstract This paper considers a graph-theoretic problem motivated by a telecommunication network optimization. When a private organization wishes to connect two sites by leasing physical lines from a public telecommunications network, it is often the cases that several categories of lines are available, at different costs. Typically a faster (low delay) lines costs more than a slower (high delay) line. However, low cost lines cannot be used exclusively because the Quality of Service (QoS) requirements often impose a bound on the end-to-end delay. Therefore, overlaying a path on the public network involves two diametrically opposing factors: cost and delay. The following variation of the standard shortest path problem is thus of interest: the shortest route between the two sites that meets a given bound on the end-to-end delay. For this problem we formulate a graph-theoretical problem that has both a shortest path component as well as coloring component. Interestingly, the problem could be formulated as a knapsack problem. We have shown that the general problem is NP-complete. The optimal polynomial-time algorithms for some special cases and one heuristic algorithm for the general problem are described.

• Cartoon and Animation Studies
• /
• s.38
• /
• pp.115-132
• /
• 2015

An animation is a tool to represent the consciousness of an author. It is a medium that converts his/her consciousness to time by the means of spaces. Image is the most inherent element among the elements of an animation. Character is the element that has the very core function among the elements of an image because a character is a shape that can deliver a story through various actions and facial expressions. In this context, is a representative satire animation that describes a ranked and unequal human society and selfishness and absurdity of human beings existed in the human society, based on the original work of George Orwell. Therefore, this study aims to study what the work tries to satirize through the meanings and symbols that the characters, animals, and spaces in the work. As a result of the study, it was found that the characters appeared in the work are metaphoric symbols that imply the meanings of each character, not just simple characters or spaces. In the work, the farm is a symbolic space that symbolizes a human world. John, a human being, is described as a dictator in an absolute Russian monarchy who suppresses people. Old Major, a pig, is described as an old pioneer that preaches the appropriation of a revolution while Snow Ball, a pig that follows the Major is described as a naive leader that dreams to establish a real socialist state where everybody lives equal, through successful revolution. Another pig, Napoleon is described as the more greedy dictator than human being. He killed Snow Ball for his private ambition and suppresses and exploits the same race, animals. That is, setting man and various animals in the relation of dominant class and subordinated class, the author generates conflicts among characters. Although the characters pursue an ideal society through revolution, it requires another revolution in the process, which expresses repetitive contradiction of human history in a symbolic and strong way.

• The Journal of the Korea Contents Association
• /
• v.16 no.5
• /
• pp.463-476
• /
• 2016

Western countries came to Asia aggressively in the early 1900s. Westerners who came to Korea at that time also had a various jobs with diplomats, missionaries, doctors, and so on. Korean diet was curious and shocking to foreigners in the early 1990s, so they made a record of the Korean diet. They thought Korea was peaceful, attractive and rich to eat. Koreans ate mainly rice and kimchi, a variety of grains, vegetables and bibimbap. Korea had a variety of meat and fish, seaweed, and herbs(ginseng). Foreigners said Koreans were greedy for food and ate a lot. Koreans ate basically a bowl of rice(bap), a bowl of soup(kuk), kimchi, soy sauce and other dishes. If Koreans wanted to set a table in abundance, they have meat soup(kuk) with meat and additional fish like as raw fish, dried fish, and boiled or fried fish. Korean people had a jangdokdae with Ongki(Earthen jar) where soy sauce(kanjang), soybean paste(doenjang), red pepper paste(kochujang), pickles (jang-achi) have been fermented. Foreigners felt the smell of lacquer tree and kimchi hung in the air from Korean people. While they were compared it to the smell of western rim cheese burger, they said Korea was a country with nasty smell in the feet. By the records of foreigners in the early 1900s, Korean's diets and image were appeared objectively.

• Journal of KIISE:Software and Applications
• /
• v.30 no.7_8
• /
• pp.672-680
• /
• 2003

A shopbot is a software agent whose goal is to maximize buyer´s satisfaction through automatically gathering the price and quality information of goods as well as the services from on-line sellers. In the response to shopbots´ activities, sellers on the Internet need the agents called pricebots that can help them maximize their own profits. In this paper we adopts Q-learning, one of the model-free reinforcement learning methods as a price-setting algorithm of pricebots. A Q-learned agent increases profitability and eliminates the cyclic price wars when compared with the agents using the myoptimal (myopically optimal) pricing strategy Q-teaming needs to select a sequence of state-action fairs for the convergence of Q-teaming. When the uniform random method in selecting state-action pairs is used, the number of accesses to the Q-tables to obtain the optimal Q-values is quite large. Therefore, it is not appropriate for universal on-line learning in a real world environment. This phenomenon occurs because the uniform random selection reflects the uncertainty of exploitation for the optimal policy. In this paper, we propose a Mixed Nonstationary Policy (MNP), which consists of both the auxiliary Markov process and the original Markov process. MNP tries to keep balance of exploration and exploitation in reinforcement learning. Our experiment results show that the Q-learning agent using MNP converges to the optimal Q-values about 2.6 time faster than the uniform random selection on the average.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.12
• /
• pp.239-246
• /
• 2014

In this paper, we propose a method to decide the additional edges in order to integrate two communitites A,B($${\mid}A{\mid}{\geq_-}{\mid}B{\mid}$$, ${\mid}{\cdot}{\mid}$ is the size of the set). The proposed algorithm uses a fitness function that shows the property of a community and the fitness function is defined by the number of edges which exist in the community and connect two nodes, one is in the community and the other is out of the community. The community has a strong property when the function has a large value. The proposed algorithm is a kind of greedy method and when a node of B is merged to A, the minimum number of additional edges is decided to increase the fitness function value of A. After determining the number of additional edges, we define the community connectivity measures using the node centrality to determine the edges locations. The connections of the new edges are fixed to maximize the connectivity measure of the combined community. The procedure is applied for all nodes in B to integrate A and B. The effectiveness of the proposed algorithm is shown by solving the Zachary Karate Club network.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.7
• /
• pp.1557-1564
• /
• 2014

In this paper, we propose a signal detection technique based on the parallel orthogonal matching pursuit (POMP) is proposed for generalized shift space keying (GSSK) systems, which is a modified version of the orthogonal matching pursuit (OMP) that is widely used as a greedy algorithm for sparse signal recovery. The signal recovery problem in the GSSK systems is similar to that in the compressed sensing (CS). In the proposed POMP technique, multiple indexes which have the maximum correlation between the received signal and the channel matrix are selected at the first iteration, while a single index is selected in the OMP algorithm. Finally, the index yielding the minimum residual between the received signal and the M recovered signals is selected as an estimate of the original transmitted signal. POMP with Quantization (POMP-Q) is also proposed, which combines the POMP technique with the signal quantization at each iteration. The proposed POMP technique induces the computational complexity M times, compared with the OMP, but the performance of the signal recovery significantly outperform the conventional OMP algorithm.