• Title/Summary/Keyword: Number of Users

Search Result 3,054, Processing Time 0.028 seconds

Enhanced WMAN System based on Region and Time Partitioning D-TDD OFDM Architecture (영역/시간 세분화 D-TDD OFDM 구조에 기반한 새로운 WMAN 시스템 구조 설계)

  • Kim, Mee-Ran;Cheong, Hee-Jeong;Kim, Nak-Myeong
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.43 no.11 s.353
    • /
    • pp.68-77
    • /
    • 2006
  • In accommodating the asymmetric traffic for future wireless multimedia services, the dynamic time division duplexing (D-TDD) scheme is considered as one of the key solutions. With the D-TDD mode, however, the inter-BS and inter-MS interference is inevitable during the cross time slot (CTS) period, and this interference seriously degrades the system performance. To mitigate such interference, we propose a region and time partitioning D-TDD architecture for OFDM systems. Each time slot in the CTS period is split into several minislots, and then each cell is divided into as many regions as the number of minislots per time slot. We then assign the minislots only to the users in its predefined corresponding region. On top of such architecture which inherently separates the interfering entities farther from each other, we design a robust time slot allocation scheme so that the inter-cell interference can be minimized. By the computer simulation, it has been verified that the proposed scheme outperforms the conventional time slot allocation methods in both the outage probability and the bandwidth efficiency.

A Study on Integration of Healthcare Information Systems based on P2P in Distributed Environment (분산환경에서의 P2P기반 보건의료분야 정보시스템 통합에 관한 연구)

  • Park, Yong-Min;Oh, Young-Hwan
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.48 no.2
    • /
    • pp.36-42
    • /
    • 2011
  • The current healthcare information systems field to meet the growing demand for healthcare for a variety of building systems and operation, and subsequent information on the budget continues to increase, but the current system, although the association link between the various systems made does not, with organizations with information about each of the standardization and real-time network status data do not consist of various materials, such as insufficient to provide real-time issues have been raised. This paper proposes a Integrated information system on Healthcare based on JXTA to solve problems mentioned above. Until now, in a network environment for data storage and management is the most widely used server-intensive structure, while an increase in users and traffic difficulties in data management and communications services to handle the growing number of servers increase faster than information associated with the cost savings, P2P model in terms of efficient data management has emerged as a new solution. Therefore this paper designs a platform for Integrated information system on Healthcare based on JXTA as a method to integrate health information data and services, and then proves that the new information system on healthcare based on JXTA is the suitable model.

A Scheme that Transcodes from Dynamic Object of PC Web Page to Mobile Web Contents with DOM (DOM을 이용하여 PC 웹 페이지의 다이나믹 오브젝트를 모바일 웹 컨텐츠로 변환하는 기법)

  • Kim, Jong-Keun;Ko, Hee-Ae;Sim, Kun-Ho;Kang, Eui-Sun;Lim, Young-Hwan
    • 한국HCI학회:학술대회논문집
    • /
    • 2008.02a
    • /
    • pp.648-653
    • /
    • 2008
  • With development of mobile communications terminal and expansion of mobile Internet, a large number of users can use mobile web contents at anytime and anywhere and will demand service of greater contents. Due to such demand, many studies are being carried out on transcoding contents so that wired web contents can be used in mobile web. However, transcoding and creation of mobile web contents involve difficulties because specifications available from telecommunications companies and mobile terminals have not been standardized. Especially, in order for serving dynamic object of wired web page contents to dynamically change according to time or user, it is required not only to program scripts to suit each terminal, but also to transcode the resources used in advance. For solution to this problem, this study uses the hierarchy structure of DOM (document object model) to display structural characteristics of wired web page. In other words, this study proposes the following technique Wired web pages are analyzed and the results are established as data structure. Then, dynamic object is extracted and the domain is indexed so that, when serving mobile web page, information can be extracted at the indexed position to create mobile web contents for service on real-time basis.

  • PDF

Collaborative Filtering using Co-Occurrence and Similarity information (상품 동시 발생 정보와 유사도 정보를 이용한 협업적 필터링)

  • Na, Kwang Tek;Lee, Ju Hong
    • Journal of Internet Computing and Services
    • /
    • v.18 no.3
    • /
    • pp.19-28
    • /
    • 2017
  • Collaborative filtering (CF) is a system that interprets the relationship between a user and a product and recommends the product to a specific user. The CF model is advantageous in that it can recommend products to users with only rating data without any additional information such as contents. However, there are many cases where a user does not give a rating even after consuming the product as well as consuming only a small portion of the total product. This means that the number of ratings observed is very small and the user rating matrix is very sparse. The sparsity of this rating data poses a problem in raising CF performance. In this paper, we concentrate on raising the performance of latent factor model (especially SVD). We propose a new model that includes product similarity information and co occurrence information in SVD. The similarity and concurrence information obtained from the rating data increased the expressiveness of the latent space in terms of latent factors. Thus, Recall increased by 16% and Precision and NDCG increased by 8% and 7%, respectively. The proposed method of the paper will show better performance than the existing method when combined with other recommender systems in the future.

Low Cost and Acceptable Delay Unicast Routing Algorithm Based on Interval Estimation (구간 추정 기반의 지연시간을 고려한 저비용 유니캐스트 라우팅 방식)

  • Kim, Moon-Seong;Bang, Young-Cheol;Choo, Hyun-Seung
    • The KIPS Transactions:PartC
    • /
    • v.11C no.2
    • /
    • pp.263-268
    • /
    • 2004
  • The end-to-end characteristic Is an important factor for QoS support. Since network users and required bandwidths for applications increase, the efficient usage of networks has been intensively investigated for the better utilization of network resources. The distributed adaptive routing is the typical routing algorithm that is used in the current Internet. The DCLC(Delay Constrained 1.east Cost) path problem has been shown to be NP-hard problem. The path cost of LD path is relatively more expensive than that of LC path, and the path delay of LC path is relatively higher than that of LD path in DCLC problem. In this paper, we investigate the performance of heuristic algorithm for the DCLC problem with new factor which is probabilistic combination of cost and delay. Recently Dr. Salama proposed a polynomial time algorithm called DCUR. The algorithm always computes a path, where the cost of the path is always within 10% from the optimal CBF. Our evaluation showed that heuristic we propose is more than 38% better than DCUR with cost when number of nodes is more than 200. The new factor takes in account both cost and delay at the same time.

A Study on Platform Strategies of Korean First Mobile Instant Messenger KakaoTalk (주식회사 카카오의 플랫폼 전략에 대한 연구)

  • Jang, Kyoung Young;Oh, Jung Suk
    • Asia-Pacific Journal of Business Venturing and Entrepreneurship
    • /
    • v.8 no.4
    • /
    • pp.49-56
    • /
    • 2013
  • KakaoTalk, a Korean mobile instant messenger service launched by KAKAO Inc., has grown remarkably popular in a short period of time, with its number of subscribers exceeding 100 million as of July 2013. Today, KakaoTalk is an everyday communication tool among most Korean mobile users. Although KAKAO has been the subject of many business and consumer studies, the KakaoTalk platform strategy has not been studied thoroughly. In this study, we analyze its platform strategy through the lens of several widely utilized frameworks such as Platform Leadership (Gawer & Cusumano 2002, 2008), Winner-take-all dynamics (Eisenmann et al. 2006), and Open Service Innovation (Chesbrough 2011). Our results show that Eisenmann et al (2006)'s "Winner-Take-All" platform best explains how KakaoTalk dominated its rivals, Mypeople by Daum Communications and Line by Naver Corporation. In surpassing its rivals, KAKAO delivered a solution to the 'essential problem' that mobile social communication should be upgraded from mobile companies' paid "Short Message Service" (SMS). By doing so, KakaoTalk fulfilled the first requirement of Gawer & Cusumano (2008)'s "Coring" strategy, which explains how a new platform is created. KakaoTalk also satisfied the second requirement of "Coring" by providing economic incentives for KakaoTalk members to interact through its Games and Items store. Actively accepting its customers' ideas and upgrading its services, KAKAO reinforced its platform leadership to its customers and put Chesbrough (2011)'s "Outside In - Open Service" innovation strategy into practice.

  • PDF

Smart meter data transmission device and power IT system using LTE and IoT technologies (LTE와 IoT 기술을 이용한 스마트미터 데이터 전송장치와 전력 IT 시스템)

  • Kang, Ki-Beom;Kim, Hong-Su;Jwa, Jeong-Woo;Kim, Ho-Chan;Kang, Min-Jae
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.18 no.10
    • /
    • pp.117-124
    • /
    • 2017
  • A Smart Grid is a system that can efficiently use energy by exchanging real-time information in both directions between a consumer and a power supplier using ICT technology on an existing power network. DR(Demand response) is an arrangement in which electricity users can sell the electricity they save to the electricity market when the price of electricity is high or the power system is crisis. In this study, we developed a power meter data transmission device and power IT system that measure the demand information in real-time using a smart meter and transmit it to a cloud server. The power meter data transmission device developed in this study uses alight sensor connected to a Raspberry Pi 3 to measure the number of blinking lamps on the KEPCO meter per unit of power, in order to provide reliable data without any measurement errors with respect to the KEPCO power data. The power measurement data transmission device uses the standard communication protocol, OpenADR 2.0b. The measured data is transmitted to the power IT system, which consists of the VEN, VTN, and calculation program, via the LTE WiFi communication network and stored in its MySQL DB. The developed power measurement data transmission device issues a power supply instruction and performs a peak reduction DR when a power system crisis occurs. The developed power meter data transmission device has the advantage of allowing the user to adjust it every 1 minute, where as the existing smart metering time is fixed at once every 15 minutes.

An Incremental Elimination Method of EEG Samples Collected by Single-Channel EEG Measurement Device for Practical Brainwave-Based User Authentication (실용적 뇌파 기반 사용자 인증을 위한 단일 채널 EEG 측정 장비를 통해 수집된 EEG 샘플의 점진적 제거 방법)

  • Ko, Han-Gyu;Cho, Jin-Man;Choi, Daeseon
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.27 no.2
    • /
    • pp.383-395
    • /
    • 2017
  • Brainwave-based user authentication technology has advantages such as changeability, shoulder-surfing resistance, and etc. comparing with conventional biometric authentications, fingerprint recognition for instance which are widely used for smart phone and finance user authentication. Despite these advantages, brainwave-based authentication technology has not been used in practice because of the price for EEG (electroencephalography) collecting devices and inconvenience to use those devices. However, according to the development of simple and convenient EEG collecting devices which are portable and communicative by the recent advances in hardware technology, relevant researches have been actively performed. However, according to the experiment based on EEG samples collected by using a single-channel EEG measurement device which is the most simplified one, the authentication accuracy decreases as the number of channels to measure and collect EEG decreases. Therefore, in this paper, we analyze technical problems that need to be solved for practical use of brainwave-based use authentication and propose an incremental elimination method of collected EEG samples for each user to consist a set of EEG samples which are effective to authentication users.

Solution Algorithms for Logit Stochastic User Equilibrium Assignment Model (확률적 로짓 통행배정모형의 해석 알고리듬)

  • 임용택
    • Journal of Korean Society of Transportation
    • /
    • v.21 no.2
    • /
    • pp.95-105
    • /
    • 2003
  • Because the basic assumptions of deterministic user equilibrium assignment that all network users have perfect information of network condition and determine their routes without errors are known to be unrealistic, several stochastic assignment models have been proposed to relax this assumption. However. it is not easy to solve such stochastic assignment models due to the probability distribution they assume. Also. in order to avoid all path enumeration they restrict the number of feasible path set, thereby they can not preciously explain the travel behavior when the travel cost is varied in a network loading step. Another problem of the stochastic assignment models is stemmed from that they use heuristic approach in attaining optimal moving size, due to the difficulty for evaluation of their objective function. This paper presents a logit-based stochastic assignment model and its solution algorithm to cope with the problems above. We also provide a stochastic user equilibrium condition of the model. The model is based on path where all feasible paths are enumerated in advance. This kind of method needs a more computing demand for running the model compared to the link-based one. However, there are same advantages. It could describe the travel behavior more exactly, and too much computing time does not require than we expect, because we calculate the path set only one time in initial step Two numerical examples are also given in order to assess the model and to compare it with other methods.

Improvement of Computational Complexity of Device-to-Device (D2D) Resource Allocation Algorithm in LTE-Advanced Networks (LTE-Advanced 환경에서 D2D 자원 할당 알고리즘의 계산 복잡도 개선)

  • Lee, Han Na;Kim, Hyang-Mi;Kim, SangKyung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.40 no.4
    • /
    • pp.762-768
    • /
    • 2015
  • D2D communication as an underlaying LTE-Advanced network has proven to be efficient in improving the network performance and decreasing the traffic load of eNodeB(enhanced NodeB). However large amount of interference can be caused by sharing the resources between the cellular users and D2D pairs. So, a resource allocation for D2D communication to coordinate the interference is necessary. Related works for resource allocation that D2D can reuse the resources of more than one cellular user with best CQI(Channel Quality Indicator) have been proposed. D2D communications may still cause interference to the primary cellular network when radio resource are shared between them. To avoid this problem, we propose a radio resource allocation algorithm with low computational complexity for D2D communication in OFDM-based wireless cellular networks. Unlike the previous works, the proposed algorithm utilizes unused ones of the whole resource. The unused resource allocate to on D2D pair can be shared only with other D2D pairs. In other words, if the distance between the D2D pairs is sufficient, we allowed more than two D2D pairs to share the same resources. The simulation results have proven that the proposed algorithm has up to 11 times lower computational complexity than the compared one according to the number of D2D.