• Title/Summary/Keyword: computer-based

Search Result 33,638, Processing Time 0.05 seconds

Design of Heuristics Using Vertex Information in a Grid-based Map (그리드 기반 맵에서 꼭지점 정보를 이용한 휴리스틱의 설계)

  • Kim, Ji-Hyui;Jung, Ye-Won;Yu, Kyeon-Ah
    • Journal of the Korea Society of Computer and Information
    • /
    • v.20 no.1
    • /
    • pp.85-92
    • /
    • 2015
  • As computer game maps get more elaborate, path-finding by using $A^*$ algorithm in grid-based game maps becomes bottlenecks of the overall game performance. It is because the search space becomes large as the number of nodes increases with detailed representation in cells. In this paper we propose an efficient pathfinding method in which the computer game maps in a regular grid is converted into the polygon-based representation of the list of vertices and then the visibility information about vertices of polygons can be utilized. The conversion to the polygon-based map does not give any effect to the real-time query process because it is preprocessed offline. The number of visited nodes during search can be reduced dramatically by designing heuristics using visibility information of vertices that make the accuracy of the estimation enhanced. Through simulations, we show that the proposed methods reduce the search space and the search time effectively while maintaining the advantages of the grid-based method.

Model Development of Unit-care Welfare Facility for a Traditional Korean House Using Computer Graphics (컴퓨터 그래픽을 이용한 한옥 유니트형 노인복지시설 모델 제시)

  • Nam, Yun-Cheol
    • Journal of The Korean Digital Architecture Interior Association
    • /
    • v.13 no.1
    • /
    • pp.23-31
    • /
    • 2013
  • This paper presents computer graphics applying the traditional Korean house(Hanok) style interior to unit-care space of Welfare Facility and proposes the possibility as interior design and construction materials. In this paper, the proposed computer graphic-based model is a single-story building that provides convenient traffic between rooms. Computer graphic-based model is presented by Auto CAD, 3D program (Sketch-UP v.8), rendering program (Podium v.2) based on the traditional Korean house and related work of unit-care welfare facility. Computer graphic-based model that combined unit-care and the traditional Korean house has the following characteristics. In each room of living space, wallpaper and flooring Korean paper(Hnaji) is considered and windows, door, furniture of traditional pattern were placed. The living room(Daechung) that is representative of the traditional Korean house and the corridor (toenmaru) are the elements to save the image of the traditional Korean house as much as possible. Especially, the corridor (toenmaru) is placed to conveniently use in nursing-care facility and home-care support facility. A public space is placed around the inside court (An-madang), while the living space (unit-care) has a sense of independence by separation. Bathroom and kitchen have a modern design for functionality than aesthetic elements.

Target Prediction Based On PPI Network

  • Lee, Taekeon;Hwang, Youhyeon;Oh, Min;Yoon, Youngmi
    • Journal of the Korea Society of Computer and Information
    • /
    • v.21 no.3
    • /
    • pp.65-71
    • /
    • 2016
  • To reduce the expenses for development a novel drug, systems biology has been studied actively. Target prediction, a part of systems biology, contributes to finding a new purpose for FDA(Food and Drug Administration) approved drugs and development novel drugs. In this paper, we propose a classification model for predicting novel target genes based on relation between target genes and disease related genes. After collecting known target genes from TTD(Therapeutic Target Database) and disease related genes from OMIM(Online Mendelian Inheritance in Man), we analyzed the effect of target genes on disease related genes based on PPI(Protein-Protein Interactions) network. We focused on the distinguishing characteristics between known target genes and random target genes, and used the characteristics as features for building a classifier. Because our model is constructed using information about only a disease and its known targets, the model can be applied to unusual diseases without similar drugs and diseases, while existing models for finding new drug-disease associations are based on drug-drug similarity and disease-disease similarity. We validated accuracy of the model using LOOCV of ten times and the AUCs were 0.74 on Alzheimer's disease and 0.71 on Breast cancer.

Blocking Artifact Reduction in Block-Coded Image Using Interpolation and SAF Based on Edge Map

  • Park, Kyung-Nam;Lee, Gun-Woo;Kwon, Kee-Koo;Kim, Bong-Seok;Lee, Kuhn-Il
    • Proceedings of the IEEK Conference
    • /
    • 2002.07b
    • /
    • pp.1007-1010
    • /
    • 2002
  • In this paper, we present a new blocking artifact reduction algorithm using interpolation and signal adaptive filter (SAF) based on the edge map. Generally, block-based coding, such as JPEG and MPEG, is the most popular image compression method. However, for high compression it produces noticeable blocking and ringing artifacts in the decoded image. In proposed method, all the block is classified into low and high frequency blocks in block classification procedure. And edge map is obtained by using Sobel operator on decoded image. And according to the block property we applied blocking artifacts reduction algorithm. Namely, four neighbor low frequency block is participated in interpolation based on edge map. And ringing artifacts is removed by applying a signal adaptive filter around the edge using edge map in high frequency block. The computer simulation results confirmed a better performance by the proposed method in both the subjective and objective image qualities.

  • PDF

Next Location Prediction with a Graph Convolutional Network Based on a Seq2seq Framework

  • Chen, Jianwei;Li, Jianbo;Ahmed, Manzoor;Pang, Junjie;Lu, Minchao;Sun, Xiufang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.5
    • /
    • pp.1909-1928
    • /
    • 2020
  • Predicting human mobility has always been an important task in Location-based Social Network. Previous efforts fail to capture spatial dependence effectively, mainly reflected in weakening the location topology information. In this paper, we propose a neural network-based method which can capture spatial-temporal dependence to predict the next location of a person. Specifically, we involve a graph convolutional network (GCN) based on a seq2seq framework to capture the location topology information and temporal dependence, respectively. The encoder of the seq2seq framework first generates the hidden state and cell state of the historical trajectories. The GCN is then used to generate graph embeddings of the location topology graph. Finally, we predict future trajectories by aggregated temporal dependence and graph embeddings in the decoder. For evaluation, we leverage two real-world datasets, Foursquare and Gowalla. The experimental results demonstrate that our model has a better performance than the compared models.

Mobile geolocation techniques for indoor environment monitoring

  • Ouni, Ridha;Zaidi, Monji;Alsabaan, Maazen;Abdul, Wadood;Alasaad, Amr
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.3
    • /
    • pp.1337-1362
    • /
    • 2020
  • Advances in localization-based technologies and the increase in ubiquitous computing have led to a growing interest in location-based applications and services. High accuracy of the position of a wireless device is still a crucial requirement to be satisfied. Firstly, the rapid development of wireless communication technologies has affected the location accuracy of radio monitoring systems employed locally and globally. Secondly, the location is determined using standard complex computing methods and needs a relatively long execution time. In this paper, two geolocalization techniques, based on trigonometric and CORDIC computing processes, are proposed and implemented for Bluetooth-based indoor monitoring applications. Theoretical analysis and simulation results are investigated in terms of accuracy, scalability, and responsiveness. They show that the proposed techniques can locate a target wireless device accurately and are well suited for timing estimation.

A Study on Selection of Effective Engineering Design Problem based on LEGO Mindstorm NXT for Basic Design Education (레고 마인드스톰 NXT를 활용한 기초설계 교과목에서의 효과적인 공학설계과제 선정방안 연구)

  • Shin, Youn-Soon;Sohn, Dai-Geun;Lee, Kyung-Ho;Hong, Sung-Ho;Lee, Kangwoo;Jung, Jin-Woo
    • Journal of Engineering Education Research
    • /
    • v.19 no.2
    • /
    • pp.60-69
    • /
    • 2016
  • This paper deals with the selection method of effective engineering design problem based on LEGO Mindstorm NXT for basic design education. By YouTube case study of various LEGO-based engineering designs for olympic sports, performance criteria have been developed including programming complexity, structural complexity, sensor/actuator complexity and variety of game operation. Programming complexity includes range of programming code length and possible program variety. Structural complexity includes variety of structural elements such as length, shape, weight, and volume to overcome design restrictions. Sensor/actuator complexity includes variety of sensor used and number of possible actuator assemblies. Variety of game operation includes game complexity and required creativity to make LEGO robots. Based on these performance criteria, four representative sports were selected as the candidates for effective engineering design problem. Finally, feasibility and attributes of each candidate were verified by real implementation examples.

Neighbor Gradient-based Multicast Routing for Service-Oriented Applications

  • Wang, Hui;Mao, Jianbiao;Li, Tao;Sun, Zhigang;Gong, Zhenghu;Lv, Gaofeng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.9
    • /
    • pp.2231-2252
    • /
    • 2012
  • With the prevalence of diverse services-oriented applications, such as IPTV systems and on-line games, the current underlying communication networks face more and more challenges on the aspects of flexibility and adaptability. Therefore, an effective and efficient multicast routing mechanism, which can fulfill different requirements of different personalized services, is critical and significant. In this paper, we first define the neighbor gradient, which is calculated based on the weighted sum of attributes such as residual link capacity, normalized hop count, etc. Then two distributed multicast routing algorithms which are neighbor Gradient-based Multicast Routing for Static multicast membership (GMR-S) and neighbor Gradient-based Multicast Routing for Dynamic multicast membership (GMR-D), are proposed. GMR-S is suitable for static membership situation, while GMR-D can be used for the dynamic membership network environment. Experimental results demonstrate the effectiveness and efficiency of our proposed methods.

Digital Twin based Household Water Consumption Forecasting using Agent Based Modeling

  • Sultan Alamri;Muhammad Saad Qaisar Alvi;Imran Usman;Adnan Idris
    • International Journal of Computer Science & Network Security
    • /
    • v.24 no.4
    • /
    • pp.147-154
    • /
    • 2024
  • The continuous increase in urban population due to migration of mases from rural areas to big cities has set urban water supply under serious stress. Urban water resources face scarcity of available water quantity, which ultimately effects the water supply. It is high time to address this challenging problem by taking appropriate measures for the improvement of water utility services linked with better understanding of demand side management (DSM), which leads to an effective state of water supply governance. We propose a dynamic framework for preventive DSM that results in optimization of water resource management. This paper uses Agent Based Modeling (ABM) with Digital Twin (DT) to model water consumption behavior of a population and consequently forecast water demand. DT creates a digital clone of the system using physical model, sensors, and data analytics to integrate multi-physical quantities. By doing so, the proposed model replicates the physical settings to perform the remote monitoring and controlling jobs on the digital format, whilst offering support in decision making to the relevant authorities.

Connection Frequency Buffer Aware Routing Protocol for Delay Tolerant Network

  • Ayub, Qaisar;Mohd Zahid, M. Soperi;Abdullah, Abdul Hanan;Rashid, Sulma
    • Journal of Electrical Engineering and Technology
    • /
    • v.8 no.3
    • /
    • pp.649-657
    • /
    • 2013
  • DTN flooding based routing protocol replicate the message copy to increase the delivery like hood that overloads the network resources. The probabilistic routing protocols reduce replication cost by forwarding the message to a node that holds high predictability value to meet its destination. However, the network traffic converges to high probable nodes and produce congestion that triggers the drop of previously stored messages. In this paper, we have proposed a routing protocol called as Connection frequency Buffer Aware Routing Protocol (CFBARP) that uses an adaptive method to maintain the information about the available buffer space at the receiver before message transmission. Furthermore, a frequency based method has been employed to determine the connection recurrence among nodes. The proposed strategy has performed well in terms of reducing message drop, message relay while increases the delivery probability.