• Korean Institute of Interior Design Journal
• /
• v.25 no.5
• /
• pp.71-81
• /
• 2016

This research has been carried out with the objects of sporting goods shops to find out what structure of those shops raises more interest from customers. The tracking eyes on the objects which are the same but seen to have different structures has revealed the followings. Customers' visual appreciation of Reverse left/right Images (11.1) was found to be higher than that of Original Images (10.6). Furthermore, the reverse left/right image of the space also was found to attract more interest from customers, which led them to have longer observation. The below is about the interpretation of the spatial exploration by observation time and the appreciation of its visual content in line with the experiment objects of selling spaces. The longer the space was observed, (1)the higher the expansive searching of space was, (2)the more spots were observed as if they did not know what to see after they first observed at early hours, (3)later (in the time range of 64~73 seconds) they came to look at the spots in which they got interested, (4)and then again they suddenly got lost what to see. When the change of observation characteristics by time range is reviewed, it can be seen that the searching of original images is changed from Divergent Feature to Convergent Feature when the observation time increases from the early stage of observation to the later. On the contrary, the reverse left/right images were found to have the opposite searching features, that is, from convergent exploration to divergent exploration. These findings show that the reverse left/right images of the sporting goods shops, which were the experiment objects, have more factors attracting customers' attention and interest and that it is the very shop-structure which makes customers have better visual appreciation of those shops.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.12 no.1
• /
• pp.451-458
• /
• 2011

In order to provide the optimal location based services such as the optimal moving path search or the scheduling pattern prediction, the extraction of significant moving pattern which is considered the temporal and spatial properties of the location-based historical data of the moving objects is essential. In this paper, for the extraction of significant moving pattern we propose the location generalization method which translates the location attributes of moving object into the spatial scope information based on $R^*$-tree for more efficient patterning the continuous changes of the location of moving objects and for indexing to the 2-dimensional spatial scope. The proposed method generates the moving sequences which is satisfied the constraints of the time interval between the spatial scopes using the generalized spatial data, and extracts the significant moving patterns using them. And it can be an efficient method for the temporal pattern mining or the analysis of moving transition of the moving objects to provide the optimal location based services.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.33 no.4
• /
• pp.217-224
• /
• 2020

In this study, a framework for optimizing the opening in an outrigger wall is proposed. To solve a constrained bounded optimization problem, an in-house finite element program and SQP algorithm in Python SciPy library are utilized. The openings of the outrigger wall are located according to the strut-tie behavior of the outrigger wall deep beam. A linear interpolation method is used to obtain differentiable continuous functions required for optimization, whereas a database is used for the efficiency of the optimization program. By comparing the result of the two-variable optimization through the moving path of the search algorithm, it is confirmed that the algorithm efficiently determines the optimized result. When the size of each opening is set to individual variables rather than the same width of all openings, the value of the objective function is minimized to obtain better optimization results. It was confirmed that the optimization time can be effectively reduced when using the database in the optimization process.

• Journal of Information Technology Applications and Management
• /
• v.26 no.5
• /
• pp.41-56
• /
• 2019

Recently great loss of life and property is occurring because of fire, natural disaster, earth quake, tsunami and so on. People spend 80~90% of their time indoor environment like office, supermarket, campus. Therefore Indoor navigation and guidelines system became so essential for most of all. Incase of emergency we must be careful earlier, in such a cases 5G kind of new technology may also cannot work. So immediate action and quick routing notification for guidelines and protection is the most. Considering this issue We proposed indoor evacuating guidance system based on microcontroller Wi-Fi board for Indoor APP using mobile. Focusing various kind of technology like, ok google, voice search APP we purposed node architecture based system. When we listen fire alarm while living inside the room. Then to be safe we connect with server and start Arduino UNO+IoT ESP8266 Wi-Fi shield version1-IoT module to store data in MySQL DB server. We make application to escape out from the building up-to the three exits giving information from source point to destination. Our program can send information to the users emergency location and situations. For this when the user get sound or vibration in their mobile device it indicate fire out near by. At that time we update message from Arduino to DB server for the fixed current position inside the building which give routing signal for that fire out location by changing values from 0 to 1. We have user in point 10 where user is near by. Later we detect Wi-Fi signal form Nodemcu as room of each floor and try to connect with user. Main purpose of this paper is to save life of people in short time and find out the shortest path up to nearest exits in the time of emergencies and rescue them.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.6
• /
• pp.661-667
• /
• 2005

In this paper, we propose a new hybrid genetic algorithm for sequential ordering problem (SOP). In the proposed genetic algorithm, the Voronoi quantized crossover (VQX) is used as a crossover operator and the path-preserving 3-Opt is used as a local search heuristic. VQX is a crossotver operator that uses the epistasis information of given problem instance. Since it is a crossover proposed originally for the traveling salesman problem (TSP), its application to SOP requires considerable modification. In this study, we appropriately modify VQX for SOP, and develop three algorithms, required in the modified VQX, named Feasible solution Generation Algorithm, Precedence Cycle Decomposition Algorithm, and Genic Distance Assignment Method. The results of the tests on SOP instances obtained from TSPLIB and ZIB-MP-Testdata show that the proposed genetic algorithm outperforms other genetic algorithms in stability and solution quality.

• The KIPS Transactions:PartA
• /
• v.10A no.5
• /
• pp.439-452
• /
• 2003

Mobile agent is one of the good technologies for overcoming network load and latency in distributed applications, and it may be a promising way of base technology of distributed applications because of its high adaptability for various network environments. In this paper, a mobile agent programming system, called HUMAN, is designed and implemented efficient use in various distributed applications based on mobile agents. HUMAN supports such high level utilities as file searhing, addressing by groups of nodes, storing path information, storing search information, and thus it gives us high easiness in agent-based programming. And it provides various itinerary modes and flexible reply modes for easy adaptation to given network environment. It also provides a management server for registering and active agents. Thus it can be efficiently applied for such varous distributed applications as searching distributed information, remote control, and file sharing in networks. A simple electronic commerce system is designed is designed and implemented as a HUMAN based illustrative application.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39C no.8
• /
• pp.660-666
• /
• 2014

In this paper, we consider a classification criteria of sensor nodes based on equipment function, and propose a routing search algorithm between node when an IP-USN is applied inside a ship. whereas a tree-type routing algorithm is applied to the limited mobile enviroment, such as engine room or machine room, a mesh-type routing alogrithm is to free mobile enviroment, such as passager corridor liviing quarters or restanrats areas. For mesh-type routing, it is necessary to maintain a seamless route path between a sink node and sensor nodes for which we consider a novel message exchange periodically. We proposed a new message, RDES message, which is issued periodically to update the topology of sensor node and check a connectivity between nodes.

• Journal of Internet Computing and Services
• /
• v.11 no.2
• /
• pp.17-30
• /
• 2010

Many applications in Wireless Sensor Networks require collecting all data without loss from nodes. End-to-End data retransmission, which is used in the Internet for reliable transport, becomes very inefficient in Wireless Sensor Networks, since wireless communication, and constrained resources pose new challenges. We look at factors affecting reliability, and search for efficient combinations of the possible options. This paper proposes an efficient Overhearing based reliable transfer protocol in Wireless Sensor Networks by introducing Selective and implicit Acknowledgement. Finally, it is clarified that the proposed scheme is efficient for reliable data transfer in WSN.

• Journal of Korea Game Society
• /
• v.16 no.6
• /
• pp.59-68
• /
• 2016

Many researchers have paid attention to contents generation within the area of game artificial intelligence these days with various reasons. Efforts on automatic contents generation without game level designers' help were continuously progressed in various game contents. This study suggests an automatic map generation without an isolated cave using cellular automation enhanced by binary space partitioning(BSP). In other words, BSP makes it possible to specify the number of desired area and cellular automation reduces the time to search a path. Based upon our preliminary simulation results, we show the usefulness of our automatic map generation by applying the contents generation using cell automation, which is enhanced by BSP to games.

• Journal of KIISE:Software and Applications
• /
• v.32 no.5
• /
• pp.416-427
• /
• 2005

Web navigation mining is a method of discovering Web navigation patterns by analyzing the Web access log data. However, it is admitted that the log data contains noisy information that leads to the incorrect recognition of user navigation path on the Web's hyperlink structure. As a result, previous Web navigation mining systems that exploited solely the log data have not shown good performance in discovering correct Web navigation patterns efficiently, mainly due to the complex pre-processing procedure. To resolve this problem, this paper proposes a technique of amalgamating the Web's hyperlink structure information with the Web access log data to discover navigation patterns correctly and efficiently. Our implemented Web navigation mining system called SPMiner produces a WebTree from the hyperlink structure of a Web site that is used trl eliminate the possible noises in the Web log data caused by the user's abnormal navigational activities. SPMiner remarkably reduces the pre-processing overhead by using the structure of the Web, and as a result, it could analyze the user's search patterns efficiently.