• Title/Summary/Keyword: User Simulation

Search Result 2,263, Processing Time 0.044 seconds

A Study on the Comparison of the Capacity of Waiting Anchorage Design according to the Port Operation Method - Focusing on Busan New Port -

  • Park, Jun-mo;Yang, Hyoung-Seon
    • Journal of the Korean Society of Marine Environment & Safety
    • /
    • v.25 no.3
    • /
    • pp.251-258
    • /
    • 2019
  • This study was conducted to propose an effective port operation method in terms of the design capacity of waiting anchorage by comparing the ratio and the number of waiting anchorage according to the port operation method of Busan New Port. For this, the Arena simulation program compared the rates of waiting vessels according to the application of the multi-user terminal, liner terminal and hybrid liner terminal operation methods. As a result, analysis suggested the necessary anchorage space can be reduced to about 18 % when using the multi-user terminal operation method and about 15.6 % when using the hybrid liner terminal operation method, as compared with the liner terminal operation method. Specifically, it was effective to apply the multi-user terminal operation method in terms of the anchorage capacity to be designated to Busan New Port. This study can apply to the designation of the new anchorage in the Busan New Port by reflecting the contents of the design of the anchorage in accordance with the port operation method.

A Study for Algorithm of Safe Transmission in Distributed Network (분산 네트워크에서 안전한 전송을 위한 알고리즘에 관한 연구)

  • Kim, Tae-Kyung;Seo, Hee-Suk;Lee, Dong-Young
    • Journal of the Korea Society for Simulation
    • /
    • v.18 no.1
    • /
    • pp.35-40
    • /
    • 2009
  • The reliability of processing the distributed application becomes more and more important issues in distributed network as the usage of distributed network increases. Because the distributed network applications are processed in the available resources of Internet. It is important factors that the user can efficiently access the available resources and processed results can be delivered to the user of job request. Therefore in this paper, we suggested the survivability factor for sending data safely whether it can be efficiently accessed between the user and available resource which processes the distributed application. And evaluated the performance of the suggested factor using the data transmission time. Also we suggested the transmission algorithm for safe transmission using the survivability factor.

Gradient-Search Based CDMA Multiuser Detection with Estimation of User Powers (Gradient 탐색에 기초한 CDMA 다중사용자 검출과 전력 추정)

  • Choi Yang-Ho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.9C
    • /
    • pp.882-888
    • /
    • 2006
  • Multiuser detection can significantly increase system capacity and improve service quality compared with the existing matched filter. In this paper, we introduce an method which efficiently calculates the maximum likelihood (ML) metric based on the gradient search (GS). The ML detection needs user powers as well as their spreading codes. A method is also proposed that allows us to detect data bits with the estimation of user powers when they are unknown. Computer simulation shows that the proposed method can nearly achieve the same performance as the GS with perfectly hewn user powers.

A PROPOSAL OF SEMI-AUTOMATIC INDEXING ALGORITHM FOR MULTI-MEDIA DATABASE WITH USERS' SENSIBILITY

  • Mitsuishi, Takashi;Sasaki, Jun;Funyu, Yutaka
    • Proceedings of the Korean Society for Emotion and Sensibility Conference
    • /
    • 2000.04a
    • /
    • pp.120-125
    • /
    • 2000
  • We propose a semi-automatic and dynamic indexing algorithm for multi-media database(e.g. movie files, audio files), which are difficult to create indexes expressing their emotional or abstract contents, according to user's sensitivity by using user's histories of access to database. In this algorithm, we simply categorize data at first, create a vector space of each user's interest(user model) from the history of which categories the data belong to, and create vector space of each data(title model) from the history of which users the data had been accessed from. By continuing the above method, we could create suitable indexes, which show emotional content of each data. In this paper, we define the recurrence formulas based on the proposed algorithm. We also show the effectiveness of the algorithm by simulation result.

  • PDF

Remote Dynamic Control of AMl Robot Using Network (네트워크를 이용한 AM1 로봇의 원격 동적 제어)

  • 김성일;배길호;김원일;한성현
    • Proceedings of the Korean Society of Machine Tool Engineers Conference
    • /
    • 2001.04a
    • /
    • pp.229-233
    • /
    • 2001
  • In this paper, we propose a remote controller for robot manipulator using local area network(LAN) and internet. To do this, we develope a server-client system as used in the network field. The client system is in any computer in remote place for the user to log-in the server and manage the remote factory. the server system is a computer which controls the manipulator and waits for a access from client. The server system consists of several control algorithms which is needed to drive the manipulator and networking system to transfer images that shows states of the work place, and to receive a Tmp data to run the manipulator. The client system consists of 3D(dimension) graphic user interface for teaching and off-line task like simulation, external hardware interface which makes it easier for the user to teach. Using this server-client system, the user who is on remote place can edit the work schedule of manipulator, then run the machine after it is transferred and monitor the results of the task.

  • PDF

Packet Scheduling for Cellular Relay Networks by Considering Relay Selection, Channel Quality, and Packet Utility

  • Zhou, Rui;Nguyen, Hoang Nam;Sasase, Iwao
    • Journal of Communications and Networks
    • /
    • v.11 no.5
    • /
    • pp.464-472
    • /
    • 2009
  • In this paper, we propose a packet scheduling algorithm for cellular relay networks by considering relay selection, variation of channel quality, and packet delay. In the networks, mobile users are equipped with not only cellular but also user relaying radio interfaces, where base station exploits adaptive high speed downlink channel. Our proposed algorithm selects a user with good cellular channel condition as a relay station for other users with bad cellular channel condition but can get access to relay link with good quality. This can achieve flexible packet scheduling by adjusting transmission rates of cellular link. Packets are scheduled for transmission depending on scheduling indexes which are calculated based on user's achieved transmission rate, packet utility, and proportional fairness of their throughput. The performance results obtained by using computer simulation show that the proposed scheduling algorithm is able to achieve high network capacity, low packet loss, and good fairness in terms of received throughput of mobile users.

Simple Energy Detection Algorithm for Spectrum Sensing in Cognitive Radio

  • Lee, So-Young;Kim, Eun-Cheol;Kim, Jin-Young
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.9 no.1
    • /
    • pp.19-26
    • /
    • 2010
  • In this paper, we propose an efficient decision rule in order to get better chance to detect the unused spectrum assigned to a licensed user and improve reliability of spectrum sensing performance. Each secondary user receives the signals from the licensed user. And the resulting signals input to an energy detector. Then, each sensing result is combined and used to make a decision whether the primary user is present at the licensed spectrum band or not. In order to make the reliable decision, we apply an efficient decision rule that is called as a majority rule in this paper. The simulation results show that spectrum sensing performance with the proposed decision rule is more reasonable and efficient than that with conventional decision rules.

A Multi-Agent MicroBlog Behavior based User Preference Profile Construction Approach

  • Kim, Jee-Hyun;Cho, Young-Im
    • Journal of the Korea Society of Computer and Information
    • /
    • v.20 no.1
    • /
    • pp.29-37
    • /
    • 2015
  • Nowadays, the user-centric application based web 2.0 has replaced the web 1.0. The users gain and provide information by interactive network applications. As a result, traditional approaches that only extract and analyze users' local document operating behavior and network browsing behavior to build the users' preference profile cannot fully reflect their interests. Therefore this paper proposed a preference analysis and indicating approach based on the users' communication information from MicroBlog, such as reading, forwarding and @ behavior, and using the improved PersonalRank method to analyze the importance of a user to other users in the network and based on the users' communication behavior to update the weight of the items in the user preference. Simulation result shows that our proposed method outperforms the ontology model, TREC model, and the category model in terms of 11SPR value.

A Trajectory Substitution Privacy Protection Scheme in location-based services

  • Song, Cheng;Zhang, Yadong;Gu, Xinan;Wang, Lei;Liu, Zhizhong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.9
    • /
    • pp.4771-4787
    • /
    • 2019
  • Aimed at the disclosure risk of mobile terminal user's location privacy in location-based services, a location-privacy protection scheme based on similar trajectory substitution is proposed. On the basis of the anonymized identities of users and candidates who request LBS, this scheme adopts trajectory similarity function to select the candidate whose trajectory is the most similar to user's at certain time intervals, then the selected candidate substitutes user to send LBS request, so as to protect user's privacy like identity, query and trajectory. Security analyses prove that this scheme is able to guarantee such security features as anonymity, non-forgeability, resistance to continuous query tracing attack and wiretapping attack. And the results of simulation experiment demonstrate that this scheme remarkably improve the optimal candidate' trajectory similarity and selection efficiency.

A Reinforcement learning-based for Multi-user Task Offloading and Resource Allocation in MEC

  • Xiang, Tiange;Joe, Inwhee
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2022.05a
    • /
    • pp.45-47
    • /
    • 2022
  • Mobile edge computing (MEC), which enables mobile terminals to offload computational tasks to a server located at the user's edge, is considered an effective way to reduce the heavy computational burden and achieve efficient computational offloading. In this paper, we study a multi-user MEC system in which multiple user devices (UEs) can offload computation to the MEC server via a wireless channel. To solve the resource allocation and task offloading problem, we take the total cost of latency and energy consumption of all UEs as our optimization objective. To minimize the total cost of the considered MEC system, we propose an DRL-based method to solve the resource allocation problem in wireless MEC. Specifically, we propose a Asynchronous Advantage Actor-Critic (A3C)-based scheme. Asynchronous Advantage Actor-Critic (A3C) is applied to this framework and compared with DQN, and Double Q-Learning simulation results show that this scheme significantly reduces the total cost compared to other resource allocation schemes