• Title/Summary/Keyword: Weight graph

Search Result 177, Processing Time 0.033 seconds

Automatic Generation of Character-Specific Roadmaps for Path Planning in Computer Games (컴퓨터 게임에서의 경로 계획을 위한 캐릭터별 로드맵의 자동 생성)

  • Yu, Kyeon-Ah
    • Journal of Korea Multimedia Society
    • /
    • v.11 no.5
    • /
    • pp.692-702
    • /
    • 2008
  • Path planning is gaining more weight in computer games and virtual reality as the number of self-moving characters increases. In the roadmap approach, the map of possible paths is built in advance to plan paths for a character, whose advantage is to provide high-quality paths. On the other hand, a disadvantage is that the road map doesn't reflect properties of characters such as their sizes because they move on the same map once the road map is constructed. In this paper we propose an efficient method to build a different road map for each character so that it can use its own map for path-planning. This method is efficient because the whole map is built once by applying the Visibility Graph regardless of the number of characters and walkable paths are incrementally inserted according to the sizes of characters. The effects of using separate roadmaps are demonstrated through simulations and the trade-offs accompanied with these effects are analyzed.

  • PDF

MRF Particle filter-based Multi-Touch Tracking and Gesture Likelihood Estimation (MRF 입자필터 멀티터치 추적 및 제스처 우도 측정)

  • Oh, Chi-Min;Shin, Bok-Suk;Klette, Reinhard;Lee, Chil-Woo
    • Smart Media Journal
    • /
    • v.4 no.1
    • /
    • pp.16-24
    • /
    • 2015
  • In this paper, we propose a method for multi-touch tracking using MRF-based particle filters and gesture likelihood estimation Each touch (of one finger) is considered to be one object. One of frequently occurring issues is the hijacking problem which means that an object tracker can be hijacked by neighboring object. If a predicted particle is close to an adjacent object then the particle's weight should be lowered by analysing the influence of neighboring objects for avoiding hijacking problem. We define a penalty function to lower the weights of those particles. MRF is a graph representation where a node is the location of a target object and an edge describes the adjacent relation of target object. It is easy to utilize MRF as data structure of adjacent objects. Moreover, since MRF graph representation is helpful to analyze multi-touch gestures, we describe how to define gesture likelihoods based on MRF. The experimental results show that the proposed method can avoid the occurrence of hijacking problems and is able to estimate gesture likelihoods with high accuracy.

(Task Creation and Allocation for Static Load Balancing in Parallel Spatial Join (병렬 공간 조인 시 정적 부하 균등화를 위한 작업 생성 및 할당 방법)

  • Park, Yun-Phil;Yeom, Keun-Hyuk
    • Journal of KIISE:Databases
    • /
    • v.28 no.3
    • /
    • pp.418-429
    • /
    • 2001
  • Recently, a GIS has been applicable to the most important computer applications such as urban information systems and transportation information systems. These applications require spatial operations for an efficient management of a large volume of data. In particular, a spatial join among basic operations has the property that its response time is increased exponentially according to the number of spatial objects included in the operation. Therefore, it is not proper to the systems demanding the fast response time. To satisfy these requirements, the efficient parallel processing of spatial joins has been required. In this paper, the efficient method for creating and allocating tasks to balance statically the load of each processor in a parallel spatial join is presented. A task graph is developed in which a vertex weight is calculated by the cost model I have proposed. Then, it is partitioned through a graph partitioning algorithm. According to the experiments in CC16 parallel machine, our method made an improvement in the static load balance by decreasing the variance of a task execution time on each processor.

  • PDF

Genetic Analysis for Weight of Matured Silkworm and Number of Eggs Laid in Hybrid Population of the Silkwom, Bombyx mori (누에의 숙잠체중과 산란성에 대한 유전분석)

  • 정원복
    • Journal of Sericultural and Entomological Science
    • /
    • v.35 no.2
    • /
    • pp.100-104
    • /
    • 1993
  • The genetics analysis for weight of matured silkworm(WMS) and number of eggs produced per moth(NEM) was studied by the seven parents diallel. Mean squares of additive effect, dominant effect, maternal effect and reciprocal effect were significant for two characters observed. The component of genetic variance analysis for WMS and NEM showed that dominant effect was higher than additive effect. Narrow sense heritability(h2ns) estimates were 0.773 and 0.228, in the WMS and NEM. The estimate of broad sense heritability(h2bs) value was higher than that of h2ns because of the low importance of dominance effect. Incomplete dominance was shown by Vr-Wr graphic analysis in the weight of matured silkworm and overdominance in the number of eggs produced per moth. In general combining ability effect, Jam 107 and Jam 124 was showed positively high for WMS and Jam 107 and S1 was expressed positively high for NEM. In specific combining ability effect, hybrids in S1XC51, S1XJam124 and Jam 107XJam 108 were exhibited positively high for WMS and Jam 107XN63, S1XC51, N74XJam 108 and Jam 107XJam 108 were found positively high for NEM.

  • PDF

Scenic Image Research Based on Big Data Analysis - Take China's Four Ancient Cities as an Example

  • Liang, Rui;Guo, Hanwen;Liu, Jiayu;Liu, Ziyang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.7
    • /
    • pp.2769-2784
    • /
    • 2020
  • This paper aims to compare the scenic images of four ancient Chinese cities including Lijiang, Pingyao, Huizhou and Langzhong, so as to provide specific development strategies for the ancient cities. In this paper, the ancient cities' scenic images are divided into three sub-indexes and eight evaluation dimensions. Based on this, the study first uses Python software to collect tourists' online comments on the four ancient cities. Then, the social network analysis method is used to build a high-frequency keywords matrix of tourist comments and the R language is used to generate a visual network graph. After this, the entropy weight method is used to determine the weights and values of eight evaluation dimensions. Finally, the tourists' overall satisfaction indexes of the four ancient cities are calculated accordingly. The results show that (1) the overall satisfaction of Lijiang is the highest, while that of Huizhou is the lowest; (2) from the weight of each evaluation dimension, it can be seen that tourists care more about the national culture and historical culture; (3) from tourists' satisfaction index on each evaluation dimension of the four ancient cities, we can find that the four ancient cities has their own advantages and disadvantages in tourism development. (4) local tourism-related institutions should strengthen their advantages and improve their deficiencies so as to enhance tourists' overall image of the ancient city.

A Point-to-Point Shortest Path Search Algorithm for Digraph (방향그래프의 점대점 최단경로 탐색 알고리즘)

  • Lee, Sang-Un
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.17 no.7
    • /
    • pp.893-900
    • /
    • 2007
  • This paper suggests an algorithm that improves the disadvantages of the Dijkstra algorithm that is commonly used in GPS navigation system, searching for the shortest path. Dijkstra algorithm, first of all, requires much memory for the performance of the algorithm. It has to carry out number of node minus 1, since it determines the shortest path from all the nodes in the graph, starting from the first node. Therefore, Dijkstra algorithm might not be able to provide the information on every second, searching for the shortest path between the roads of the congested city and the destination. In order to solve these problems, this paper chooses a method of searching a number of nodes at once by means of choosing the shortest path of all the path nodes (select of minimum weight arc in-degree and out-degree), excluding the departure and destination nodes, and of choosing all the arcs that coincide with the shortest path of the path nodes, from all the node outgoing arcs starting from the departure node. On applying the suggested algorithm to 14 various digraphs, we succeeded to search the shortest path. In addition, the result was obtained at the speed of 2 to 3 times faster than that of Dijkstra algorithm, and the memory required was less than that of Dijkstra algorithm.

Breast Radiotherapy with Mixed Energy Photons; a Model for Optimal Beam Weighting

  • Birgani, Mohammadjavad Tahmasebi;Fatahiasl, Jafar;Hosseini, Seyed Mohammad;Bagheri, Ali;Behrooz, Mohammad Ali;Zabiehzadeh, Mansour;meskani, Reza;Gomari, Maryam Talaei
    • Asian Pacific Journal of Cancer Prevention
    • /
    • v.16 no.17
    • /
    • pp.7785-7788
    • /
    • 2015
  • Utilization of high energy photons (>10MV) with an optimal weight using a mixed energy technique is a practical way to generate a homogenous dose distribution while maintaining adequate target coverage in intact breast radiotherapy. This study represents a model for estimation of this optimal weight for day to day clinical usage. For this purpose, treatment planning computed tomography scans of thirty-three consecutive early stage breast cancer patients following breast conservation surgery were analyzed. After delineation of the breast clinical target volume (CTV) and placing opposed wedge paired isocenteric tangential portals, dosimeteric calculations were conducted and dose volume histograms (DVHs) were generated, first with pure 6MV photons and then these calculations were repeated ten times with incorporating 18MV photons (ten percent increase in weight per step) in each individual patient. For each calculation two indexes including maximum dose in the breast CTV ($D_{max}$) and the volume of CTV which covered with 95% Isodose line ($V_{CTV,95%IDL}$) were measured according to the DVH data and then normalized values were plotted in a graph. The optimal weight of 18MV photons was defined as the intersection point of $D_{max}$ and $V_{CTV,95%IDL}$ graphs. For creating a model to predict this optimal weight multiple linear regression analysis was used based on some of the breast and tangential field parameters. The best fitting model for prediction of 18MV photons optimal weight in breast radiotherapy using mixed energy technique, incorporated chest wall separation plus central lung distance (Adjusted R2=0.776). In conclusion, this study represents a model for the estimation of optimal beam weighting in breast radiotherapy using mixed photon energy technique for routine day to day clinical usage.

Genetic Analyses on Quantitative Characters of F1 Generation in Malting Barley (맥주맥 F1세대의 양적형질에 대한 유전분석)

  • 정원복;오주성;황필성
    • Journal of Life Science
    • /
    • v.13 no.1
    • /
    • pp.29-33
    • /
    • 2003
  • The study was conducted to get genetic information on quantitative characters of $F_1$ in barley through diallel crosses using seven malting barley. The results obtained were summarized as follows. Additive, dominant, maternal, and reciprocal effort were observed in culm length, spike length, awn length, culm diameter, grain length, grain width, ]lumber of grains per spike, and 1000 grain weight. Based on the Vr-Wr graphical analysis, culm length, spike length, awn length, grain length, and number of grains per spike were found to be inherited over dominance. Dominant effects were higher than additive effects in culm length, spike length, awn length, culm diameter, grain length, grain width, number of grains per spike, and 1000 grain weight. The narrow- sense heritability showed high value as 40.06% for spike length.

Design of an Automatic Titration System for Caustic Soda Treatment System Using the Equivalent Point Estimation Algorithm (당량점 예측 알고리듬에 의한 가성소다 처리 섬유감량 시스템용 자동적정 장치 설계)

  • Cho, Jin-Ho;Jin, Kyoung-Chan;You, Byoung-Heui;Koo, Sung-Mo;Kim, Myoung-Nam;Lee, Jong-Hyun;Lee, Heung-Lark
    • Journal of Sensor Science and Technology
    • /
    • v.3 no.3
    • /
    • pp.28-35
    • /
    • 1994
  • Caustic Soda Treatment Systems need a concentration measurement device in order to monitor the weight reduction amount of polyester fabrics. Since the reduction process requires several concentration measurements, we have to do the unit titration fast and exactly. Therefore, a proposition of estimation algorithm for finding the equivalent point in the titration process is needed. In this paper, we used the cardinal spline algorithm, to estimate the proper curve with the measured pH-values after each injection of titration sdution, to predict the equivalent point. While the processing time is elapsed, several equivalent points are estimated and drawed the line graph of fabrics weight reduction automatically. Finally, we designed the hardware and the software of an automatic titration system that can generate the reduction ending signal of Caustic Soda Treatment System.

  • PDF

An Experimental Study on the Punching Shear of Slab with Polystyrene Form (폴리스티렌 폼을 사용한 슬래브의 뚫림전단에 관한 실험적 연구)

  • Lee, Hwan-Gu;Kim, Seung-Hun;Kang, In-Suk;Lee, Han-Seung;Lee, Ki-Jang
    • Proceedings of the Korea Concrete Institute Conference
    • /
    • 2008.04a
    • /
    • pp.213-216
    • /
    • 2008
  • When using the light-weight form with polystyrene on slab, as a result of reducing the weight of slab, the span was increased or size of supporting member for slab was decreased. But capacity of punching shear resistance on the slab using the polystyrene form with plat plate system was deteriorated at critical section around the column. But standard for estimate of internal force did not exist, and established study was insufficient. This study performed the experiment on the punching shear for understanding punching shear force at the slab-column connection using the slab with polystyrene form. The principal variable was size of column, arrangement of polystyrene form and existence of shear reinforcement, and we planned four specimens. From the test, we analysed the crack, failure mode, road-displacement graph and punching shear strength, and capacity of punching shear resistance for slab using the polystyrene form was understood.

  • PDF