• Title/Summary/Keyword: Internet Information

Search Result 20,636, Processing Time 0.052 seconds

Spatial Location Modeling for the Efficient Placements of the Super WiFi Facilities Utilizing White Spaces (화이트 스페이스를 활용한 슈퍼 와이파이 시설의 효율적 배치를 위한 공간 입지 모델링)

  • Lee, Gunhak;Kim, Kamyoung
    • Journal of the Korean Geographical Society
    • /
    • v.48 no.2
    • /
    • pp.259-271
    • /
    • 2013
  • This paper addresses the efficient facility placements to adopt a super WiFi network, taking significant considerations as the next generation 'information highway'. Since the super WiFi has a wider geographic coverage by utilizing the white spaces of TV broadcasting which are empty and available frequencies for the wireless communications, it would play an important role in releasing digital divide of the internet access for low populated or mountainous areas. The purpose of this paper is to explore systematic and efficient spatial plans for the super WiFi. For doing this, we applied optimal location covering models to Gurye-gun, Jeonlanamdo. From the application, we presented optimal locations for super WiFi facilities and significant analytical results, such as the tradeoff between the number of facilities and coverage and marginal coverage for establishing super WiFi network. The results of this research would be usefully utilized for decision makers who wish to adopt a super WiFi, to extend wireless networks in a city or build a regional infrastructure of wireless facilities.

  • PDF

Security Analysis and Implementation of Fast Inter-LMA domain Handover Scheme in Proxy Mobile IPv6 Networks (프록시 모바일 IPv6 네트워크에서 LMA도메인 간 핸드오버 기법의 보안성 분석 및 구현)

  • Chai, Hyun-Suk;Jeong, Jong-Pil
    • The KIPS Transactions:PartC
    • /
    • v.19C no.2
    • /
    • pp.99-118
    • /
    • 2012
  • In PMIPv6-based network, mobile nodes can be made smaller and lighter because the network nodes perform the mobility management-related functions on behalf of the mobile nodes. The one of the protocols, Fast Handovers for Proxy Mobile IPv6(FPMIPv6)[1] has studied by the Internet Engineering Task Force(IETF). Since FPMIPv6 adopts the entities and the concepts of Fast Handovers for Mobile IPv6(FMIPv6) in Proxy Mobile IPv6(PMIPv6), it reduces the packet loss. Conventional scheme has proposed that it cooperated with an Authentication, Authorization and Accounting(AAA) infrastructure for authentication of a mobile node in PMIPv6, Despite the best efficiency, without begin secured of signaling messages, PMIPv6 is vulnerable to various security threats such as the DoS or redirect attAcks and it can not support global mobility between PMIPv. In this paper, we analyze Kang-Park & ESS-FH scheme, and then propose an Enhanced Security scheme for FPMIPv6(ESS-FP). Based on the CGA method and the pubilc key Cryptography, ESS-FP provides the strong key exchange and the key independence in addition to improving the weaknesses for FPMIPv6. The proposed scheme is formally verified based on Ban-logic, and its handover latency is analyzed and compared with that of Kang-Park scheme[3] & ESS-FH and this paper propose inter-domain fast handover sheme for PMIPv6 using proxy-based FMIPv6(FPMIPv6).

Dynamic Management of Equi-Join Results for Multi-Keyword Searches (다중 키워드 검색에 적합한 동등조인 연산 결과의 동적 관리 기법)

  • Lim, Sung-Chae
    • The KIPS Transactions:PartA
    • /
    • v.17A no.5
    • /
    • pp.229-236
    • /
    • 2010
  • With an increasing number of documents in the Internet or enterprises, it becomes crucial to efficiently support users' queries on those documents. In that situation, the full-text search technique is accepted in general, because it can answer uncontrolled ad-hoc queries by automatically indexing all the keywords found in the documents. The size of index files made for full-text searches grows with the increasing number of indexed documents, and thus the disk cost may be too large to process multi-keyword queries against those enlarged index files. To solve the problem, we propose both of the index file structure and its management scheme suitable to the processing of multi-keyword queries against a large volume of index files. For this, we adopt the structure of inverted-files, which are widely used in the multi-keyword searches, as a basic index structure and modify it to a hierarchical structure for join operations and ranking operations performed during the query processing. In order to save disk costs based on that index structure, we dynamically store in the main memory the results of join operations between two keywords, if they are highly expected to be entered in users' queries. We also do performance comparisons using a cost model of the disk to show the performance advantage of the proposed scheme.

Overlay Multicast Tree Building Algorithm for MDST and MST in Complete Network (완전 연결된 네트워크에서 MDST와 MST 목적을 갖는 오버레이 멀티캐스트 트리구현 알고리즘)

  • Cho, Myeong-Rai
    • 한국벤처창업학회:학술대회논문집
    • /
    • 2010.08a
    • /
    • pp.71-89
    • /
    • 2010
  • It is strongly believed that multicast will become one of the most promising services on internet for the next generation. Multicast service can be deployed either on network-layer or application-layer. IP multicast (network-layer multicast) is implemented by network nodes (i.e., routers) and avoids multiple copies of the same datagram on the same link. Despite the conceptual simplicity of IP multicast and its obvious benefits, it has not been widely deployed since there remain many unresolved issues. As an alternative to IP multicast, overlay multicast (application-layer multicast) implements the multicast functionality at end hosts rather than routers. This may require more overall bandwidth than IP multicast because duplicate packets travel the same physical links multiple times, but it provides an inexpensive, deployable method of providing point-to-multipoint group communication. In this paper we develop an efficient method applied greedy algorithm for solving two models of overlay multicast tree building problem that is aimed to construct MDST (Minimum Diameter Spanning Tree : minimum cost path from a source node to all its receivers) and MST (Minimum Spanning Tree : minimum total cost spanning all the members). We also simulate and analyze MDST and MST.

  • PDF

Long-term Monitoring System for Ship's Engine Performance Analysis Based on the Web (선박엔진성능분석용 웹기반 장기모니터링시스템 구현)

  • Kwon, Hyuk-Joo;Yang, Hyun-Suk;Kim, Min-Kwon;Lee, Sung-Geun
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.39 no.4
    • /
    • pp.483-488
    • /
    • 2015
  • This paper implements a long-term monitoring system (LMS) for ship's engine performance analysis (SEPA) based on the web, for the purpose of the communication speed and engine maintenance. This system is composed of a simulator, monitoring module with a multi channel A/D converter, monitoring computer, network attached storage (NAS), RS485 serial and wireless internet communication system. The existing products monitor the information transmitted from pressure sensors installed in the upper parts of each of engines in the local or web computer, but have a delay in the communication speed and errors in long-term monitoring due to the large volume of sampling pressure data. To improve these problems, the monitoring computer saves the sampling pressure data received from the pressure sensors in NAS, monitors the long-term sampling data generated by the sectional down sampling method on a local computer, and transmits them to the web for long-term monitoring. Because this method has one tenth of the original sampling data, it will use memory with small capacity, save communication cost, monitor the long-term sampling data for 30 days, and as a result, make a great contribution to engine maintenance.

A Design of AES-based WiBro Security Processor (AES 기반 와이브로 보안 프로세서 설계)

  • Kim, Jong-Hwan;Shin, Kyung-Wook
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.44 no.7 s.361
    • /
    • pp.71-80
    • /
    • 2007
  • This paper describes an efficient hardware design of WiBro security processor (WBSec) supporting for the security sub-layer of WiBro wireless internet system. The WBSec processor, which is based on AES (Advanced Encryption Standard) block cipher algorithm, performs data oncryption/decryption, authentication/integrity, and key encryption/decryption for packet data protection of wireless network. It carries out the modes of ECB, CTR, CBC, CCM and key wrap/unwrap with two AES cores working in parallel. In order to achieve an area-efficient implementation, two design techniques are considered; First, round transformation block within AES core is designed using a shared structure for encryption/decryption. Secondly, SubByte/InvSubByte blocks that require the largest hardware in AES core are implemented using field transformation technique. It results that the gate count of WBSec is reduced by about 25% compared with conventional LUT (Look-Up Table)-based design. The WBSec processor designed in Verilog-HDL has about 22,350 gates, and the estimated throughput is about 16-Mbps at key wrap mode and maximum 213-Mbps at CCM mode, thus it can be used for hardware design of WiBro security system.

The Cell Resequencing Buffer for the Cell Sequence Integrity Guarantee for the Cyclic Banyan Network (사이클릭 벤얀 망의 셀 순서 무결성 보장을 위한 셀 재배열 버퍼)

  • 박재현
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.41 no.9
    • /
    • pp.73-80
    • /
    • 2004
  • In this paper, we present the cell resequencing buffer to solve the cell sequence integrity problem of the Cyclic banyan network that is a high-performance fault-tolerant cell switch. By offering multiple paths between input ports and output ports, using the deflection self-routing, the Cyclic banyan switch offer high reliability, and it also solves congestion problem for the internal links of the switch. By the way, these multiple paths can be different lengths for each other. Therefore, the cells departing from an identical source port and arriving at an identical destination port can reach to the output port as the order that is different from the order arriving at input port. The proposed cell resequencing buffer is a hardware sliding window mechanism. to solve such cell sequence integrity problem. To calculate the size of sliding window that cause the prime cost of the presented device, we analyzed the distribution of the cell delay through the simulation analyses under traffic load that have a nonuniform address distribution that express tile Property of traffic of the Internet. Through these analyses, we found out that we can make a cell resequencing buffer by which the cell sequence integrity is to be secured, by using a, few of ordinary memory and control logic. The cell resequencing buffer presented in this paper can be used for other multiple paths switching networks.

Grieving among Adolescent Survivors of Childhood Cancer: A Situational Analysis (청소년 소아암 생존자의 슬픔: 상황분석)

  • Jin, Juhye
    • Child Health Nursing Research
    • /
    • v.20 no.1
    • /
    • pp.49-57
    • /
    • 2014
  • Purpose: The purpose of this qualitative study was to explore how adolescent survivors of childhood cancer grieve the death of cancer peers. Methods: Data were obtained from Korean adolescents with cancer between the ages of 13 and 18 (N=12) through semi-structured interviews (face-to-face, telephone, and Internet chatting), observations of the social dynamics of participants in self-help groups, and retrieval of personal Web journals. Based on the grounded theory methodology, data collection and analysis were conducted simultaneously, and constant comparative methods were used. Clarke's situational analysis was adopted, and this paper focused on presenting "how to" and "what we can learn" from this analytic strategy. Results: Mapping examples were visualized using of three modes of maps. Adolescent cancer survivors coped with reminders of the "darkness" that ultimately featured their overall grief. Additionally, adolescents' encounters and avoidance of grief were triggered by introspection and interactions with family and friends. Conclusion: Situational analysis provided an efficient way to analyze the experiences of adolescent survivors of childhood cancer by systematizing possible information within the relational social contexts of the research phenomenon.

Investigation of Factors Affecting the Effects of Online Consumer Reviews (온라인 소비자 리뷰의 효과에 영향을 미치는 요인에 대한 고찰)

  • Lee, Ho Geun;Kwak, Hyun
    • Informatization Policy
    • /
    • v.20 no.3
    • /
    • pp.3-17
    • /
    • 2013
  • As electronic marketplaces grow and a large number of consumers exchange their opinions on products and services on the Internet, many studies have been conducted in the area of online consumer reviews. This paper analyzes the research trend of the online consumer reviews by investigating those studies in an attempt to provide future research directions. Many researchers have focused on the effects of online reviews on consumer behaviors as well as the usefulness of the online reviews. In particular, review contents, characteristics of reviewers/consumers and features of products/services have been identified as influencing factors on the effects of the online consumer reviews. For the review contents, the number and the volume of the contents have increasing effects on the online reviews, while the direction (positive vs. negative) of the contents has resulted in conflicting effects of the review. The reputation and trustfulness of reviewers, consumers' prior knowledge on the products, consumers' product involvement, and types of the products were investigated as these factors influence the effectiveness of the online consumer reviews. Social media (such as Facebook and Twitter) nowadays play an important role to disseminate online reviews among consumers. Thus, it is necessary to study how social media influence the effects of online reviews on consumers. Since some firms abuse the online reviews for their own sakes, we recognize the necessity for empirical studies on the side effects of the online reviews.

  • PDF

The educational models using enhanced mathematics ICT in the Korean IT environments (21세기 선진형 ICT 수학 교육 방법론 모델)

  • Kim, Duk-Sun;Park, Jin-Young;Lee, Sang-Gu
    • Communications of Mathematical Education
    • /
    • v.22 no.4
    • /
    • pp.533-543
    • /
    • 2008
  • Recently, many advanced countries have used original ICT tools in their educational courses. But Korea didn't have any effective origin ICT tools in our mathematical education, compared with other countries which have developed various tools, for examples, Web-Mathematica and HP Calculator. Although we have the advanced IT environment, the educational environments in mathematics using ICT seems to be not promising. In this paper, we suggest a new mathematics education tools in ICT and the internet environments in Korea, and a teaching and studyingmodel for the teachers, students and classrooms. It is based on the Sage-Math and RPG. Sage-Math which is the software based on the web and RPG(Random Problem Generator) will give a good answer for the future of Korean mathematics ICT education.

  • PDF