• Title/Summary/Keyword: Mobile Searching

Search Result 284, Processing Time 0.028 seconds

A Study on UMPC's Role in u-Learning (U-러닝에서 UMPC의 역할에 대한 연구)

  • Yi, Mun-Ho;Kim, Mi-Ryang
    • Journal of Internet Computing and Services
    • /
    • v.9 no.6
    • /
    • pp.127-139
    • /
    • 2008
  • The value of up-to-date Mobile PC such as UMPC (Ultra Mobile Personal Computer) is recognized greatly in learning environment that busywork such as characteristic of transfer easy and real time communication possibility etc. and conversation with a colleague student, free sending of studying data and public ownership etc. is required. Wish to recognize whether is acting relevant role in u - unfold learning that inflect UMPC in integration research model, and UMPC is u searching for relevant element at studying activity unfolding process u - integration Inquiry-Based Learning that present in Korean education & research information service (KERIS) at fifth-year student science time In primary school in this research. This research result could take charge role of UMPCs' studying-activity though there is persistent feedback with teacher among studying-activity although UMPC's role is utilized on constituent that can be related with studying-activity in learning process.

  • PDF

Automatic Edge Detection Method for Mobile Robot Application (이동로봇을 위한 영상의 자동 엣지 검출 방법)

  • Kim Dongsu;Kweon Inso;Lee Wangheon
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.11 no.5
    • /
    • pp.423-428
    • /
    • 2005
  • This paper proposes a new edge detection method using a $3{\times}3$ ideal binary pattern and lookup table (LUT) for the mobile robot localization without any parameter adjustments. We take the mean of the pixels within the $3{\times}3$ block as a threshold by which the pixels are divided into two groups. The edge magnitude and orientation are calculated by taking the difference of average intensities of the two groups and by searching directional code in the LUT, respectively. And also the input image is not only partitioned into multiple groups according to their intensity similarities by the histogram, but also the threshold of each group is determined by fuzzy reasoning automatically. Finally, the edges are determined through non-maximum suppression using edge confidence measure and edge linking. Applying this edge detection method to the mobile robot localization using projective invariance of the cross ratio. we demonstrate the robustness of the proposed method to the illumination changes in a corridor environment.

Routing Mechanism using Mobility Prediction of Node for QoS in Mobile Ad-hoc Network (모바일 애드-혹 네트워크에서 QoS를 위한 노드의 이동성 예측 라우팅 기법)

  • Cha, Hyun-Jong;Han, In-Sung;Yang, Ho-Kyung;Cho, Yong-Gun;Ryou, Hwang-Bin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.7B
    • /
    • pp.659-667
    • /
    • 2009
  • Mobile Ad-hoc Network consists of mobile nodes without immobile base station. In mobile ad-hoc network, network cutting has occurred frequently in node because of energy restriction and frequent transfer of node. Therefore, it requires research for certain techniques that react softly in topology alteration in order to improve reliability of transmission path. This paper proposes path selection techniques to consider mobility of node that respond when search path using AOMDV routing protocol. As applying proposed techniques, We can improve reliability and reduce re-searching number of times caused by path cutting.

Effective identification of dominant fully absorbing sets for Raptor-like LDPC codes

  • Woncheol Cho;Chanho Yoon;Kapseok Chang;Young-Jo Ko
    • ETRI Journal
    • /
    • v.45 no.1
    • /
    • pp.7-17
    • /
    • 2023
  • The error-rate floor of low-density parity-check (LDPC) codes is attributed to the trapping sets of their Tanner graphs. Among them, fully absorbing sets dominantly affect the error-rate performance, especially for short blocklengths. Efficient methods to identify the dominant trapping sets of LDPC codes were thoroughly researched as exhaustively searching them is NP-hard. However, the existing methods are ineffective for Raptor-like LDPC codes, which have many types of trapping sets. An effective method to identify dominant fully absorbing sets of Raptor-like LDPC codes is proposed. The search space of the proposed algorithm is optimized into the Tanner subgraphs of the codes to afford time-efficiency and search-effectiveness. For 5G New Radio (NR) base graph (BG) 2 LDPC codes for short blocklengths, the proposed algorithm finds more dominant fully absorbing sets within one seventh of the computation time of the existing search algorithm, and its search-effectiveness is verified using importance sampling. The proposed method is also applied to 5G NR BG1 LDPC code and Advanced Television Systems Committee 3.0 type A LDPC code for large blocklengths.

Extending UML Interaction Diagrams For Mobile Agents Including Agent Platforms (플랫폼을 포함한 이동 에이전트를 위한 UML 상호작용 다이어그램의 확장)

  • Yoo, Moon-Sung
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.11 no.2
    • /
    • pp.261-267
    • /
    • 2011
  • One of powerful software paradigms for distributed systems is a mobile agent system. Since the usage of mobile agent systems is increased, a software development model to construct softwares efficiently for these systems is needed. Currently, UML is a widely used software development model. However, existing UML can not describe the necessary mobility of the mobile agent based software systems in explicit way. In this paper, the interaction diagrams of UML(sequence diagrams and communication diagrams) are extended and used to express the mobility of the mobile agents including the functions of platforms of mobile agent systems in three ways. For a case study, we applied the extended diagrams to a distributed file searching using mobile agents, and we confirmed these diagrams can describe the function and mobility of mobile agents very well.

Energy conserving routing algorithm based on the direction for Mobile Ad-hoc network (모바일 에드 혹 네트워크에서 노드의 방향성을 고려한 에너지 효율적 라우팅 알고리즘 연구)

  • Oh, Young-Jun;Lee, Kong-Whan
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.11
    • /
    • pp.2699-2707
    • /
    • 2013
  • We proposed the context-awareness routing algorithm DDV (Dynamic Direction Vector)-hop algorithm at Mobile Ad-hoc Network(MANET). MANET has problem about dynamic topology, the lack of scalability of the network by mobile of node. By mobile of node, energy consumption rate is different. So it is important choosing routing algorithms for the minium of energy consumption rate. DDV-hop algorithms considers of the attribute of mobile node, create a cluster and maintain. And it provides a path by searching a route more energy efficient. We apply mobile of node by direction and time, the alogorighm of routning path and energy efficiency clustering is provided, it is shown the result of enery consumption that is optimized for the network.

Channel Sorting Based Transmission Scheme For D2D Caching Networks (채널 정렬을 활용한 D2D 캐싱 네트워크용 전송 기법)

  • Jeong, Moo-Woong;Ryu, Jong Yeol;Kim, Seong Hwan;Lee, Woongsup;Ban, Tae-Won
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.22 no.11
    • /
    • pp.1511-1517
    • /
    • 2018
  • Mobile Device-to-Device (D2D) caching networks can transmit multimedia data to users directly without passing through any network infrastructure by storing popular multimedia contents in advance that are popular among many mobile users at caching server devices (CSDs) in distributed manners. Thus, mobile D2D caching networks can significantly reduce backhaul traffic in wired networks and service latency time of mobile users. In this paper, we propose an efficient transmission scheme that can enhance the transmission efficiency of mobile D2D caching networks by using multiple CSDs that are caching the contents that are popular among mobile users. By sorting the multiple CSDs that are caching a content that mobile users want to receive according to their channel gains, the proposed scheme can reduce the complexity of algorithm significantly, compared to an optimal scheme based on Brute-force searching, and can also obtain much higher network transmission efficiency than the existing Blanket and Opportunistic transmission schemes.

A Low-Cost RFID Tag Search Protocol Preventing the Reuse of Mobile Reader's Tag-List (모바일 리더의 태그 리스트 재사용을 방지하는 저비용 RFID 태그 검색 프로토콜)

  • Yeo, Don-Gu;Lee, Sang-Rae;Choi, Hyun-Woo;Jang, Jae-Hoon;Youm, Heung-Youl
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.21 no.1
    • /
    • pp.143-151
    • /
    • 2011
  • When a real-time data transfer is not possible between a reader and a back-end server in the mobile environment, the reader should support a capability to search a certain tag without communicating with a back-end server. Some recent papers related to the mobile reader-based tag search protocol have addressed privacy concerns for the reader and the tags. However, to our best knowledge, there are no papers addressing the problem arising from reusing tag lists existed in the mobile reader. In other words, there arise a problem that a mobile reader which has lost an right to access to a specific tag is able to search that tag by reusing a tag list for searching a particular tag. If mobile reader having an unauthorized tag list, the mobile reader can reuse a particular tag list. Our protocol provides the enhanced secure tag lists preventing the reuse of the tag lists and an efficient tag search protocol based on dynamic identity in the mobile reader-based RFID environments.

Improved initial cell searching algorithm for 3GPP W-CDMA systems (3GPP W-CDMA 시스템에서 개선된 초기 셀 탐색 알고리즘)

  • Jeong, Hong-Jae;Kim, Tae-Jung;Gwon, Dong-Seong;Yang, Hun-Gi
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.37 no.10
    • /
    • pp.9-17
    • /
    • 2000
  • In this paper, the improved initial cell searching algorithm is proposed for 3GPP(The third Generation Partnership Project) W-CDMA system. The key objective of the proposed algorithm is to reduce searching slot and to increase the reliability in the first stage of cell searching algorithm in order to accomplish the second stage. So the proposed algorithm makes the mobile station transfers to the second stage from the first stage, just after the slot synchronization is declared successively at the same time-offset. In order to compare the proposed algorithm with the conventional one, the simulations are accomplished for cell search algorithm for 3GPP W-CDMA systems in the multipath Rayleigh fading channel. The first stage of conventional algorithm is also analyzed in a Rayleigh fading channel in order to prove simulation to be reasonable. In this paper, the proposed algorithm presents the better performance than conventional one. We also propose some parameters for optimal performance.

  • PDF

Fashion consumers' information search and sharing in new media age (뉴 미디어 시대 패션소비자의 정보 탐색과 공유)

  • Shin, HyunJu;Lee, Kyu-Hye
    • The Research Journal of the Costume Culture
    • /
    • v.26 no.2
    • /
    • pp.251-263
    • /
    • 2018
  • As mobile shopping has increased in the new media age, fashion consumers' decision making and product consumption processes have changed. The volume of consumer-driven information has expanded since media and social networking sites have enabled consumers to share information they obtain. The purpose of this study was to determine the factors affecting information searching strategies and information sharing about fashion products. An online survey collected data from 466 respondents, relating to the influence of product price level and consumer SNS commitment level on information search and information sharing. Experimental design of three product price level and two consumer SNS commitment level was used. Analysis of the data identified factors in fashion information searching as ongoing searching, prepurchase web portal information search, and prepurchase marketing information search. For low-price fashion products, prepurchase product-detail influenced intention to share information. For mid-priced products, ongoing search significantly affected intention to share information. Both ongoing search and prepurchase marketing information search showed significant effects for high-price products. Consumers who are more committed to SNS engaged in significantly more searching in all aspects of information search factors. Significant interaction effect was detected for consumer SNS commitment level and product price level. When consumers with low consumer SNS commitment search for information on lower-priced fashion products, they are less likely do a prepurchase web portal information search.