• Title/Summary/Keyword: Mobile Search

Search Result 766, Processing Time 0.024 seconds

Sequential Paging under Delay Bound for Next Generation Mobile Systems (차세대 이동통신에서의 지연을 고려한 순차적 페이징)

  • Lee, Chae-Yong;Ku, Sang-Hoon
    • Korean Management Science Review
    • /
    • v.23 no.3
    • /
    • pp.13-25
    • /
    • 2006
  • To reduce the signaling tost of paging in mobile communication, sequential paging schemes are proposed by partitioning a location area into several paging areas such that each area is paged sequentially. Necessary conditions for the optimal partition of cells with delay bound are examined by considering the mobiles location probability at each cell. The Optimal Cell Partitioning (OCP) is proposed based on the necessary conditions and the fathoming rule which trims off the unnecessary solution space and expedite the search process. Two Heuristics, BSG and BNC are also presented to further increase the computational efficiency in real-world paging scheme for the next generation mobile systems. The effectiveness of the 1)reposed paging schemes is illustrated with computational results. The Heuristic BSG that performs the search in the most promising solution group outperforms the best existing procedure with the 6-69% gain in paging cost in problems with 100 cells.

Optimal Path Planning of Mobile Robot for Multiple Moving Obstacles (복수의 동적 장애물에 대한 이동로봇의 최적경로설계)

  • Kim, Dae-Gwang;Kang, Dong-Joong
    • The Journal of Korea Robotics Society
    • /
    • v.2 no.2
    • /
    • pp.183-190
    • /
    • 2007
  • The most important thing for navigation of a mobile robot is to find the most suitable path and avoid the obstacles in the static and dynamic environment. This paper presents a method to search the optimal path in start space extended to time domain with considering a velocity and a direction of moving obstacles. A modified version of $A^*$ algorithm has been applied for path planning in this work and proposed a method of path search to avoid a collision with moving obstacle in space-tim domain with a velocity and an orientation of obstacles. The velocity and the direction for moving obstacle are assumed as linear form. The simulation result shows that a mobile robot navigates safely among moving obstacles of constant linear velocity. This work can be applied for not only a moving robot but also a legged humanoid robot and all fields where the path planning is required.

  • PDF

The effect of image search, social influence characteristics and anthropomorphism on purchase intention in mobile shopping

  • KIM, Won-Gu;PARK, Hyeonsuk
    • The Journal of Industrial Distribution & Business
    • /
    • v.11 no.6
    • /
    • pp.41-53
    • /
    • 2020
  • Purpose: The purpose of this study is to review the previous studies on the characteristics of the image search service provided by using artificial intelligence, the social impact characteristics, and the moderating effect of perceived anthropomorphism, and conduct empirical analysis to identify the constituent factors affecting purchase intention. To clarify. Through this, I tried to present theoretical and practical implications. Research design, data, and methodology: Research design was that characteristics of image search service (ubiquity and information quality) and social impact characteristics (subjective norms, electronic word of mouth marketing) are affected by mediation of satisfaction and flow, therefore, control of perceived anthropomorphism have an effect on purchase intention to increase. For analysis, research conducted literature review, and developed questionnaires, so that EM firm which is a specialized research institute has collected data. This was conducted on 410 people between the 20s and 50s who have mobile shopping experiences. SPSS Statistics 23 and AMOS 23 had been used to perform necessary analysis such as exploratory factor analysis, reliability analysis, feasibility analysis, and structural equation modeling based on this data. Results: first, ubiquity, information quality and subjective norms were found to have a positive effect on purchase intention through satisfaction and flow parameters. Second, satisfaction and flow were found to have a mediating effect between ubiquity, information quality, and subjective norms and purchase intentions. However, there was no mediating effect between eWOM information and purchase intention. Third, perceived anthropomorphism was found to have a moderating effect between information quality and satisfaction, and it was found that there was no moderating effect on the relationship between information quality and flow. Conclusions: The information quality of image search services using artificial intelligence has a positive effect on satisfaction, and it has been found that there is a positive moderate effect of perceived anthropomorphism in this relationship, which may be an academic contribution to the distribution science utilizing artificial intelligence. Therefore, it is possible to propose a distribution strategy that improves purchase intention by utilizing image search service and anthropomorphism in practical business and providing a more enjoyable immersive experience to customers.

AMR-WB Algebraic Codebook Search Method Using the Re-examination of Pulses Position (펄스위치 재검색 방법을 이용한 AMR-WB 여기 코드북 검색)

  • Hur, Seok;Lee, In-Sung;Jee, Deock-Gu;Yoon, Byung-Sik;Choi, Song-In
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.40 no.4
    • /
    • pp.292-302
    • /
    • 2003
  • We propose a new method to reduce the complexity of excitation codebook search. The preselected excitation pulses by the coarse search method can be updated to pulses with higher quality performance measure. The excitation pulses can arbitrarily be deleted and inserted among the searched pulses until the overall performance achieves. If we use this excitation pulse search method in AMR-WB, the complexity required for excitation codebook search can be reduced to half the original method while the output speech maintains equal speech quality to a conventional method.

Optimal Path Search Algorithm for Urban Applying Received Signal Strength on Satellite Communication Environment (위성통신 환경에서 전파수신감도를 활용한 도심지 최적경로탐색 알고리즘)

  • Park, No-Uk;Kim, Joo-Seok;Lim, Joo-Yoeng;Lim, Tae-Hyuk;Yoo, Chang-Hyun;Kwon, Kun-Sup;Kim, Kyung-Seok
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.12 no.6
    • /
    • pp.189-197
    • /
    • 2012
  • In this paper, we propose an optimal path search algorithm that applies the received signal strength between a mobile device and a satellite. Because the common path search algorithm is only based on the shortest path search, it is difficult to provide stable multimedia services for the satellite mobile devices. The proposed algorithm provides the stable communication environment for the satellite mobile devices based on received signal strength. In Satellite communications, changes in the radio quality are severe depending on the receiving environment. Therefore, an accurate analysis of the receiving environment characteristics is very important for providing stable multimedia services of satellite communications. The causes of radio attenuation are atmosphere attenuation, vegetation attenuation and buildings attenuation. These factors were applied to analyze the received signal strength. The proposed algorithm can search the optimal path in urban for stable satellite multimedia services.

Design of Mobile Agent Model Supporting the Intelligent Path Search (지능형 경로 탐색 이동 에아전트 모델 설계)

  • Ko, Hyun;Kim, Kwang-Jong;Lee, Yon-Sik
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.6 no.7
    • /
    • pp.993-1000
    • /
    • 2002
  • In this paper, we design the CORBA-based Mobile Agent Model (CMAM) which has the capability of the efficient work processing in distributed environment through sensing network traffic and searching the optimal path for migration nodes of mobile agent. In case existing mobile agent model is given various works from user, the network overhead and traffic are increased by increasing of execution module size. Also, if it happens a large quantity of traffics due to migration of nodes according to appointment of the passive host(below node) routing schedule by user, it needs much cost for node search time by traffic. Therefore, in this paper, we design a new mobile agent m()del that assures the reliability of agent's migration through dynamic act on the specific situation according to appointment of the active routing schedule and can minimize agent's work processing time through optimal path search. The proposed model assigns routing schedule of the migration nodes actively using an extended MAFFinder. Also, for decreasing overhead of network by agent's size, it separates the existing mobile agent object by mobile agent including only agent calling module and push agent with work executing module based on distributed object type of CORBA. Also, it reduces the required time for round works of mobile agent through the optimal path search of migration nodes.

Energy-Efficient Resource Allocation for Application Including Dependent Tasks in Mobile Edge Computing

  • Li, Yang;Xu, Gaochao;Ge, Jiaqi;Liu, Peng;Fu, Xiaodong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.6
    • /
    • pp.2422-2443
    • /
    • 2020
  • This paper studies a single-user Mobile Edge Computing (MEC) system where mobile device (MD) includes an application consisting of multiple computation components or tasks with dependencies. MD can offload part of each computation-intensive latency-sensitive task to the AP integrated with MEC server. In order to accomplish the application faultlessly, we calculate out the optimal task offloading strategy in a time-division manner for a predetermined execution order under the constraints of limited computation and communication resources. The problem is formulated as an optimization problem that can minimize the energy consumption of mobile device while satisfying the constraints of computation tasks and mobile device resources. The optimization problem is equivalently transformed into solving a nonlinear equation with a linear inequality constraint by leveraging the Lagrange Multiplier method. And the proposed dual Bi-Section Search algorithm Bi-JOTD can efficiently solve the nonlinear equation. In the outer Bi-Section Search, the proposed algorithm searches for the optimal Lagrangian multiplier variable between the lower and upper boundaries. The inner Bi-Section Search achieves the Lagrangian multiplier vector corresponding to a given variable receiving from the outer layer. Numerical results demonstrate that the proposed algorithm has significant performance improvement than other baselines. The novel scheme not only reduces the difficulty of problem solving, but also obtains less energy consumption and better performance.

Tabu Search based Optimization Algorithm for Reporting Cell Planning in Mobile Communication (이동통신에서 리포팅 셀 계획을 위한 타부서치 기반 최적화 알고리즘)

  • Jang, Kil-woong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.24 no.9
    • /
    • pp.1193-1201
    • /
    • 2020
  • Cell planning, which determines the cell structure for location management of mobile terminals in mobile communications, has been dealt with as an important research task to determine network performance. Among the factors influencing the cell structure planning in mobile communication, the signal cost for location management plays the most important role. In this paper, we propose an optimization algorithm that minimizes the location management cost of all the cells used to plan the cell structure in the network with reporting cell structure in mobile communication. The proposed algorithm uses a Tabu search algorithm, which is a meta-heuristic algorithm, and the proposed algorithm proposes a new neighborhood generation method to obtain a result close to the optimal solution. In order to evaluate the performance of the proposed algorithm, the simulation was performed in terms of location management cost and algorithm execution time. The evaluation results show that the proposed algorithm outperforms the existing genetic algorithm and simulated annealing.

Implementation of Jini-Agent System for Mobile Environments (모바일 환경을 위한 Jini-Agent 시스템 구현)

  • Kim Sang-Tae;Yun Byoung-Ju;Park Won-Bae;Kim Hyun-Deok
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.42 no.2 s.332
    • /
    • pp.1-8
    • /
    • 2005
  • We have implemented a Jini-Agent system which enables resource-limited mobile devices to utilize the Jini connection service. The Jini-Agent system supports Jini connection technologies to mobile devices without additional client program installation in it. It also supports a dynamic service list which helps the mobile devices to search and to utilize the services through web browser in real time. A couple of examples such as a file search service and a print service with mobile devices have been demonstrated by using the Jini-Agent system.

Device Description Repository System Based on DDR Simple API

  • Cho, Yong-Soon;Lee, Young-Il;Jung, Hoe-Kyung
    • Journal of information and communication convergence engineering
    • /
    • v.7 no.2
    • /
    • pp.203-208
    • /
    • 2009
  • Recently, improved capabilities of the mobile device is represented in a demand for same level services with the desktop device services but the service that is developed for desktop device is not compatible with mobile devices. To fulfill these demands, it is needed to provide services with considering features of mobile devices. This means that CP(Contents Provider) must do contents transformation in order to make suitable contents on mobile device. For managing some information that is required to do contents transformation, we need the DDR(Device Description Repository) which can store and search a variety of device information to grasp the constraints on the mobile device as compared with desktop devices. Also, defining standard API is required to offer a service regardless of platforms. Hereupon W3C(World Wide Web Consortium) introduced DDR Simple API. However that specifies the limited functions of DDR, which is inevitable to be added for more precise search services. In this paper, we expanded DDR Simple API and implemented DDR that supports DDL(Device Description Language) conversion and storing and searching device information.