• Title/Summary/Keyword: User's path

Search Result 301, Processing Time 0.024 seconds

A Maximum A Posterior Probability based Multiuser Detection Method in Space based Constellation Network

  • Kenan, Zhang;Xingqian, Li;Kai, Ding;Li, Li
    • International Journal of Computer Science & Network Security
    • /
    • v.22 no.12
    • /
    • pp.51-56
    • /
    • 2022
  • In space based constellation network, users are allowed to enter or leave the network arbitrarily. Hence, the number, identities and transmitted data of active users vary with time and have considerable impacts on the receiver's performance. The so-called problem of multiuser detection means identifying the identity of each active user and detecting the data transmitted by each active user. Traditional methods assume that the number of active users is equal to the maximum number of users that the network can hold. The model of traditional methods are simple and the performance are suboptimal. In this paper a Maximum A Posteriori Probability (MAP) based multiuser detection method is proposed. The proposed method models the activity state of users as Markov chain and transforms multiuser detection into searching optimal path in grid map with BCJR algorithm. Simulation results indicate that the proposed method obtains 2.6dB and 1dB Eb/N0 gains respectively when activity detection error rate and symbol error rate reach 10-3, comparing with reference methods.

QoS guaranteed IP multicast admission control mechanism (품질 보장형 IP 멀티캐스트 수락 제어 메커니즘)

  • Song, kang-ho;Rhee, wooo-Seop
    • Proceedings of the Korea Contents Association Conference
    • /
    • 2008.05a
    • /
    • pp.51-55
    • /
    • 2008
  • Request High-Images, High-quality, duplex transmission, BcN Voice telephone, Broadcast, Data internet service came to be all possible and demolished original communication service area. Also, The quality is guaranteed stablely to new business and ISP the requirement comes to become a multicasting quality guarantee mechanism which there is the reliability for a information communication and High-quality multimedia service. Like this, a multicast mechanism to be guaranteed must become air control End-to-End QoS for a service supply, a transmission delay a packet loss or requirement which the user requests guarantee and multicast Path-NET which there is the reliability must be provided. Therefor, we proposed IP base multicast new join the present the multicast mechanism of Probing packet foundation which there is the efficiently a linking acceptance, we used ns-2 simulator for the performance evaluation of the proposed.

  • PDF

A Routing Algorithm based on Deep Reinforcement Learning in SDN (SDN에서 심층강화학습 기반 라우팅 알고리즘)

  • Lee, Sung-Keun
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.16 no.6
    • /
    • pp.1153-1160
    • /
    • 2021
  • This paper proposes a routing algorithm that determines the optimal path using deep reinforcement learning in software-defined networks. The deep reinforcement learning model for learning is based on DQN, the inputs are the current network state, source, and destination nodes, and the output returns a list of routes from source to destination. The routing task is defined as a discrete control problem, and the quality of service parameters for routing consider delay, bandwidth, and loss rate. The routing agent classifies the appropriate service class according to the user's quality of service profile, and converts the service class that can be provided for each link from the current network state collected from the SDN. Based on this converted information, it learns to select a route that satisfies the required service level from the source to the destination. The simulation results indicated that if the proposed algorithm proceeds with a certain episode, the correct path is selected and the learning is successfully performed.

An Agent-based System for Character Motion Animation Control (캐릭터 동작 애니메이션 제어를 위한 에이전트 시스템)

  • Kim, Ki-Hyun;Kim, Sang-Wook
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.7 no.5
    • /
    • pp.467-474
    • /
    • 2001
  • When user wants to animate more than one character, some unexpected motion animation like a collision between characters may occur. Therefore, this problem must be resolved using a proper control mechanism. Therefore, this problem must be resolved using a proper control mechanism. This paper proposes an agent-based system that controls the motion animation of the character for representing animation scenario reflecting user\`s intention. This system provides a method that coordinates a type of motion and avoids collision between characters according to the moving path of a character in three-dimensional space. Agent communicates with others for motion synchronization. Agent is extended into several intelligent agents that coordinate character\`s motion. Agent system enables not only an intended motion animation, but also the scheduling of motion to an entire character animation. It designs automata model using Petri-net analysis tool for the agent\`s interaction as a method that passes the agent\`s information and infers the current state of agents. We implement this agent system to control the motion of character using agent technology and show an example of controlling the motion of human character model to prove the possiblity of motion control.

  • PDF

Design and Implementation of a Web-based Public Transportation Guidance System (웹기반 대중교통 안내시스템 설계 및 구현)

  • Bae, Su-Gang;Lee, Seung-Ryong;Choe, Dae-Sun;Jeong, Tae-Chung;Seung, Hyeon-U
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.5 no.4
    • /
    • pp.426-439
    • /
    • 1999
  • 본 논문에서는 웹(World Wide Web)에서 사용자가 손쉽고 편리하게 이용할 수 있는 멀티미디어 대중교통 안내시스템 개발 경험을 소개한다. 개발된 시스템은 클라이언트와 서버 시스템, 경로탐색 시스템, 교통정보 저장 시스템, 노선 및 정류장 관리 시스템으로 구성되어 있다. 클라이언트에서 작동되는 사용자 인터페이스는 직관적으로 이해가 쉽고, 사용이 편리하며 인터액티브한 멀티미디어 대중 교통안내 서비스를 제공한다. 서버 시스템은 교통정보 수집 시스템으로부터 입력되는 데이타와, 경로탐색 시스템, 교통정보 저장 시스템과 연동되어 클라이언트의 요구사항을 처리하고 그 결과를 사용자에게 돌려준다. 수정된 A* 알고리즘을 이용하는 경로탐색 시스템은 최적경로를 탐색하며, 교통정보 저장 시스템은 현재 교통상황, 정류장, 노선, 지도 등의 정보를 저장한다. 노선 및 정류장 관리시스템은 시스템 관리자가 노선 또는 정류장 관리를 서버 화면의 지도상에서 효율적으로 수행할 수 있는 도구이다. 본 논문에서 다루는 대중교통 안내시스템은 Java로 구현하였기 때문에 확장과 이식이 용이하며, 시스템 유지보수 비용이 적게 드는 장점을 가지고 있다. 그리고, 웹 브라우저가 동작되는 환경에서는 어디서나 쉽게 접근이 가능하며 향후 구축될 Intelligent Transportation Systems(ITS)의 한 모듈로써 바로 작동될 수 있을 뿐만 아니라, 현재 인터넷상에서 제공되는 다양한 서비스와도 연동이 가능하다.Abstract This paper introduces our experience for developing a public transportation guidance system, which facilitates the World-Wide Web(WWW) to provide users with easier access and use. The proposed system is composed of four subsystems: client/server system, path search system, traffic data storage system, and traffic raw-data management system. The user interface in clients utilizes Java to furnish users with multimedia data accessibility and interactivity. The server processes clients' requests based on the traffic data coming from remote sensing devices and interacts with the path search system and traffic data storage system to provide users with the results. The path search system, which uses a modified A* algorithm, produces optimal solutions based on dynamic traffic data. The traffic data storage system stores the current traffic information together with the geographical information about the b$us_way routes. The traffic raw-data management system is a graphical user interface which enables the system manager to handle the traffic information easily on the map in the terminal screen. The system has considerable benefits such as portability, scalability, and flexibility since it is implemented using Java. Also, it can be extended to an integrated Intelligent Transportation Systems(ITS) which includes a variety of information on the Internet as well as traffic information.n.

A Study on the Embodying the Sense of Place in Children's Libraries (어린이 도서관에 있어서 장소성 구현에 관한 연구)

  • Lee, Jeong-Mi;Kwack, Dong-Wha;Cheon, Hye-Sun
    • Korean Institute of Interior Design Journal
    • /
    • v.19 no.5
    • /
    • pp.198-208
    • /
    • 2010
  • The purpose of this study is to elicit the planning factors for the embodiment of sense of place in public library. This study analyzes qualitatively the good places where the children seek for and evaluate in children's library. The primary method of survey in this study is the caption evaluation. The survey is conducted in libraries of three types. In the caption evaluation, children take good places into photograph by themselves and are asked for reasons, features and physical characteristics for the pictures on good places. Through the study of the preceding studies, this study takes four analysis frames, Path, Occupancy Place, Edge and Mark. According to four analysis frames, the principal features, physical characteristics and the examples in libraries of domestic and foreign country are put in order. The meanings of this study are summarized as followings; presenting the method of user's positive evaluation, studying the sense of place in children's view point, and presenting the interrelation pattern for embodiment of the rich sense of place.

Improved Social Network Analysis Method in SNS (SNS에서의 개선된 소셜 네트워크 분석 방법)

  • Sohn, Jong-Soo;Cho, Soo-Whan;Kwon, Kyung-Lag;Chung, In-Jeong
    • Journal of Intelligence and Information Systems
    • /
    • v.18 no.4
    • /
    • pp.117-127
    • /
    • 2012
  • Due to the recent expansion of the Web 2.0 -based services, along with the widespread of smartphones, online social network services are being popularized among users. Online social network services are the online community services which enable users to communicate each other, share information and expand human relationships. In the social network services, each relation between users is represented by a graph consisting of nodes and links. As the users of online social network services are increasing rapidly, the SNS are actively utilized in enterprise marketing, analysis of social phenomenon and so on. Social Network Analysis (SNA) is the systematic way to analyze social relationships among the members of the social network using the network theory. In general social network theory consists of nodes and arcs, and it is often depicted in a social network diagram. In a social network diagram, nodes represent individual actors within the network and arcs represent relationships between the nodes. With SNA, we can measure relationships among the people such as degree of intimacy, intensity of connection and classification of the groups. Ever since Social Networking Services (SNS) have drawn increasing attention from millions of users, numerous researches have made to analyze their user relationships and messages. There are typical representative SNA methods: degree centrality, betweenness centrality and closeness centrality. In the degree of centrality analysis, the shortest path between nodes is not considered. However, it is used as a crucial factor in betweenness centrality, closeness centrality and other SNA methods. In previous researches in SNA, the computation time was not too expensive since the size of social network was small. Unfortunately, most SNA methods require significant time to process relevant data, and it makes difficult to apply the ever increasing SNS data in social network studies. For instance, if the number of nodes in online social network is n, the maximum number of link in social network is n(n-1)/2. It means that it is too expensive to analyze the social network, for example, if the number of nodes is 10,000 the number of links is 49,995,000. Therefore, we propose a heuristic-based method for finding the shortest path among users in the SNS user graph. Through the shortest path finding method, we will show how efficient our proposed approach may be by conducting betweenness centrality analysis and closeness centrality analysis, both of which are widely used in social network studies. Moreover, we devised an enhanced method with addition of best-first-search method and preprocessing step for the reduction of computation time and rapid search of the shortest paths in a huge size of online social network. Best-first-search method finds the shortest path heuristically, which generalizes human experiences. As large number of links is shared by only a few nodes in online social networks, most nods have relatively few connections. As a result, a node with multiple connections functions as a hub node. When searching for a particular node, looking for users with numerous links instead of searching all users indiscriminately has a better chance of finding the desired node more quickly. In this paper, we employ the degree of user node vn as heuristic evaluation function in a graph G = (N, E), where N is a set of vertices, and E is a set of links between two different nodes. As the heuristic evaluation function is used, the worst case could happen when the target node is situated in the bottom of skewed tree. In order to remove such a target node, the preprocessing step is conducted. Next, we find the shortest path between two nodes in social network efficiently and then analyze the social network. For the verification of the proposed method, we crawled 160,000 people from online and then constructed social network. Then we compared with previous methods, which are best-first-search and breath-first-search, in time for searching and analyzing. The suggested method takes 240 seconds to search nodes where breath-first-search based method takes 1,781 seconds (7.4 times faster). Moreover, for social network analysis, the suggested method is 6.8 times and 1.8 times faster than betweenness centrality analysis and closeness centrality analysis, respectively. The proposed method in this paper shows the possibility to analyze a large size of social network with the better performance in time. As a result, our method would improve the efficiency of social network analysis, making it particularly useful in studying social trends or phenomena.

The Development of EMG-based Powered Wheelchair Controller for Users with High-level Spinal Cord Injury using a Proportional Control Scheme (중증 장애인을 위한 근전도 기반 비례제어 방식의 전동 휠체어 제어기 개발)

  • Song, Jae-Hoon;Han, Jeong-Su;Oh, Young-Joon;Lee, He-Young;Bien, Zeung-Nam
    • Proceedings of the KIEE Conference
    • /
    • 2004.11c
    • /
    • pp.6-8
    • /
    • 2004
  • The objective of this paper is to develop a powered wheelchair controller based on EMG for users with high-level spinal cord injury using a proportional control scheme. An advantage of EMG is relative convenience of acquisition by a surface electrode to users. Direction information can be easily extracted from two EMG channels and force information can be acquired by proportional relationship between the amplitude of EMG and user's power, respectively. Pattern classification algorithm is a threshold method with a supervised learning process. Furthermore, the emergency situation can be avoided using an interrupt function. We evaluated the performance of powered wheelchair controller by navigating a pre-defined path with three non-handicapped people. The results show the feasibility of EMG as an input interface for powered wheelchair and other devices for the seriously disabled.

  • PDF

Prediction of Mobile Phone Menu Selection with Markov Chains (Markov Chain을 이용한 핸드폰 메뉴 선택 예측)

  • Lee, Suk Won;Myung, Rohae
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.33 no.4
    • /
    • pp.402-409
    • /
    • 2007
  • Markov Chains has proven to be effective in predicting human behaviors in the areas of web site assess, multimedia educational system, and driving environment. In order to extend an application area of predicting human behaviors using Markov Chains, this study was conducted to investigate whether Markov Chains could be used to predict human behavior in selecting mobile phone menu item. Compared to the aforementioned application areas, this study has different aspects in using Markov Chains : m-order 1-step Markov Model and the concept of Power Law of Learning. The results showed that human behaviors in predicting mobile phone menu selection were well fitted into with m-order 1-step Markov Model and Power Law of Learning in allocating history path vector weights. In other words, prediction of mobile phone menu selection with Markov Chains was capable of user's actual menu selection.

Fast Motion Synthesis of Quadrupedal Animals Using a Minimum Amount of Motion Capture Data

  • Sung, Mankyu
    • ETRI Journal
    • /
    • v.35 no.6
    • /
    • pp.1029-1037
    • /
    • 2013
  • This paper introduces a novel and fast synthesizing method for 3D motions of quadrupedal animals that uses only a small set of motion capture data. Unlike human motions, animal motions are relatively difficult to capture. Also, it is a challenge to synthesize continuously changing animal motions in real time because animals have various gait types according to their speed. The algorithm proposed herein, however, is able to synthesize continuously varying motions with proper limb configuration by using only one single cyclic animal motion per gait type based on the biologically driven Froude number. During the synthesis process, each gait type is automatically determined by its speed parameter, and the transition motions, which have not been entered as input, are synthesized accordingly by the optimized asynchronous motion blending technique. At the start time, given the user's control input, the motion path and spinal joints for turning are adjusted first and then the motion is stitched at any speed with proper transition motions to synthesize a long stream of motions.