• Title/Summary/Keyword: 베이스주소

Search Result 21, Processing Time 0.027 seconds

A Design and Implementation of BukitList Location Share Applications Based on Android Platform (안드로이드 플랫폼 기반의 버킷리스트 장소 공유 어플리케이션 설계 및 개발)

  • Lee, Won Joo;Seo, Jung Hwan;Cha, Dae Yun
    • Proceedings of the Korean Society of Computer Information Conference
    • /
    • 2019.07a
    • /
    • pp.119-120
    • /
    • 2019
  • 본 논문에서는 안드로이드 플랫폼 기반의 사용자 버킷리스트를 등록하고 다른 사용자들과 공유할 수 있는 어플리케이션을 설계하고 구현한다. 이 어플리케이션은 사용자 정보와 사용자 버킷리스트를 SQLite 데이터 베이스에 저장하고, 버킷리스트 등록 시 업로드 하는 이미지 파일은 FireBase에 별도로 저장한다. 그리고 지오코더를 이용하여 버킷리스트 장소 이름 혹은 주소에 해당하는 위도와 경도를 데이터베이스에 저장하고 다음 지도에 마커로 표시한다. 또한 카카오톡으로 지인들과 공유하며 버킷리스트를 실천할 장소를 다른 사용자들과 공유하도록 서비스 한다.

  • PDF

Web-based Medical Information System supporting DICOM Specification (DICOM 표준을 지원하는 웹 기반 의료 정보 시스템)

  • Kwon, Gi-Beom;Kim, Il-Kon
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.7 no.4
    • /
    • pp.317-323
    • /
    • 2001
  • DICOM(Digital Imaging and Communications in MediCine), standard of medical image operation, present the methods for communications and Storage of Medical Image. medical image acquired from patient in hospital made DICOM files. this paper purposes design and implementation methodologies of a web-based medical information system that consists of DICOM (Digital Imaging and Communications in Medicine) databases and functional components of a web server in order to support the access of medical information with Intemet web browser. we store the patient and image information to database using reading the group and element oJ DICOM file. we made file transfer module by implementing DICOM Store service, in result, we can transfer DICOM file to IF based host or computer. We compose web component of communications and Storage service, user be used DICOM Service by web Browser.

  • PDF

A Junk Mail Checking Model using Fuzzy Relational Products (퍼지관계곱을 이용한 내용기반 정크메일 분류 모델)

  • Park, Jeong-Seon;Kim, Chang-Min;Kim, Yong-Gi
    • Journal of KIISE:Software and Applications
    • /
    • v.29 no.10
    • /
    • pp.726-735
    • /
    • 2002
  • E-mail service has been a general method for communication as internet is widely used instead of post mails. Many companies have invested in e-mail advertisement as e-mail service is spread. E-mail advertisement has an advantage that it can consider personal characters. A lot of e-mail users have been given e-mails that they did not want to receive because their e-mail addresses were opened out to companies on internet. Therefore, they need junk mail checking systems and several e-mail service providers have supported junk mail filters. However, the junk mail filters can check the junk mail with constraint because they don't check the junk degree of mails by the contents of e-mail. This paper suggests a content-based junk mail checking model using fuzzy relational products. The process of the junk mail checking model using fuzzy relational products is as following: (1) analyzes semantic relation between junk words-base and e-mails, (2) checks the junk degree of the e-mail using the semantic relation, (3) checks the mails with SVJ(Standard Value of Junk) if those are junk mail or non-junk mail. The efficiency of the proposed technique is proved by comparing the junk degree of the e-mail and the number of junk mails that was checked by e-mail users and checked by the proposed junk mail checking model.

Rule-base Expert System for Privacy Violation Certainty Estimation (개인정보유출 확신도 도출을 위한 전문가시스템개발)

  • Kim, Jin-Hyung;Lee, Alexander;Kim, Hyung-Jong;Hwang, Jun
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.19 no.4
    • /
    • pp.125-135
    • /
    • 2009
  • Logs from various security system can reveal the attack trials for accessing private data without authorization. The logs can be a kind of confidence deriving factors that a certain IP address is involved in the trial. This paper presents a rule-based expert system for derivation of privacy violation confidence using various security systems. Generally, security manager analyzes and synthesizes the log information from various security systems about a certain IP address to find the relevance with privacy violation cases. The security managers' knowledge handling various log information can be transformed into rules for automation of the log analysis and synthesis. Especially, the coverage of log analysis for personal information leakage is not too broad when we compare with the analysis of various intrusion trials. Thus, the number of rules that we should author is relatively small. In this paper, we have derived correlation among logs from IDS, Firewall and Webserver in the view point of privacy protection and implemented a rule-based expert system based on the derived correlation. Consequently, we defined a method for calculating the score which represents the relevance between IP address and privacy violation. The UI(User Interface) expert system has a capability of managing the rule set such as insertion, deletion and update.

An Adaptive Frequency Hopping Method in the Bluetooth Baseband (블루투스 베이스밴드에서의 적응 주파수 호핑 방식)

  • Moon Sangook
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.9 no.2
    • /
    • pp.237-241
    • /
    • 2005
  • In Bluetooth version 1.0, the frequency hopping algorithm was such that there was one piconet, using a specific frequency, resolving the frequency depending on the part of the digits of the device clock and the Bluetooth address. Basic pattern was a kind of a round-robin using 79 frequencies in the ISM band. At this point, a problem occurs if there were more than two devices using the same frequency within specific range. In this paper, we proposed a software-based adaptive frequency hopping method so that more than two wireless devices can stay connected without frequency crash. Suggested method was implemented with HDL(Hardware Description Language) and automatically synthesized and laid out. Implemented adaptive frequency hopping circuit operated well in 24MHz correctly.

Anomaly Detection Method Using Entropy of Network Traffic Distributions (네트워크 트래픽 분포 엔트로피를 이용한 비정상행위 탐지 방법)

  • Kang Koo-Hong;Oh Jin-Tae;Jang Jong-Soo
    • The KIPS Transactions:PartC
    • /
    • v.13C no.3 s.106
    • /
    • pp.283-294
    • /
    • 2006
  • Hostile network traffic is often different from normal traffic in ways that can be distinguished without knowing the exact nature of the attack. In this paper, we propose a new anomaly detection method using inbound network traffic distributions. For this purpose, we first characterize the traffic of a real campus network by the distributions of IP protocols, packet length, destination IP/port addresses, TTL value, TCP SYN packet, and fragment packet. And then we introduce the concept of entropy to transform the obtained baseline traffic distributions into manageable values. Finally, we can detect the anomalies by the difference of entropies between the current and baseline distributions. In particular, we apply the well-known denial-of-service attacks to a real campus network and show the experimental results.

Dynamic Data Distribution for Multi-dimensional Range Queries in Data-Centric Sensor Networks (데이타 기반 센서 네트워크에서 다차원 영역 질의를 위한 동적 데이타 분산)

  • Lim, Yong-Hun;Chung, Yon-Dohn;Kim, Myoung-Ho
    • Journal of KIISE:Databases
    • /
    • v.33 no.1
    • /
    • pp.32-41
    • /
    • 2006
  • In data-centric networks, various data items, such as temperature, humidity, etc. are sensed and stored in sensor nodes. As these attributes are mostly scalar values and inter-related, multi-dimensional range queries are useful. To process multi-dimensional range queries efficiently in data-centric storage, data addressing is essential. The Previous work focused on efficient query processing without considering overall network lifetime. To prolong network lifetime and support multi-dimensional range queries, we propose a dynamic data distribution method for multi-dimensional data, where data space is divided into equal-sized regions and linearized by using Hilbert space filling curve.

Energy-efficient Broadcasting of XML Data in Mobile Computing Environments (이동 컴퓨팅 환경에서 XML 데이타의 에너지 효율적인 방송)

  • Kim Chung Soo;Park Chang-Sup;Chung Yon Dohn
    • Journal of KIISE:Databases
    • /
    • v.33 no.1
    • /
    • pp.117-128
    • /
    • 2006
  • In this paper, we propose a streaming method for XML data that supports energy-efficient processing of queries over the stream in mobile clients. We propose new stream organizations for XML data which have different kinds of addresses to related data in a stream. We describe event-driven stream generation algorithms for the proposed stream structures and provide search algorithms for simple XML path queries which leverage the access mechanisms incorporated in the stream. Experimental results show that our approaches can effectively improve the tuning time performance of user queries in a wireless broadcasting environment.

Enhanced Cross-Layering Mobile IPv6 Fast Handover over IEEE 802.16e Networks in Mobile Cloud Computing Environment (모바일 클라우드 컴퓨팅 환경에서 IEEE 802.16e 네트워크에서의 향상된 교차계층 Mobile IPv6 빠른 핸드오버 기법)

  • Lee, Kyu-Jin;Seo, Dae-Hee;Nah, Jae-Hoon;Mun, Young-Song
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.47 no.12
    • /
    • pp.45-51
    • /
    • 2010
  • The main issue in mobile cloud computing is how to support a seamless service to a mobile mode. Mobile IPv6 (MIPv6) is a mobility supporting protocol which is standardized by the Internet Engineering Task Force (IETF). Mobile IPv6 fast handovers (FMIPv6) is the extension of MIPv6 which is proposed to overcome shortcomings of MIPv6. Recently, fast handovers for Mobile IPv6 over IEEE 802.16e which is one of broadband wireless access systems has been proposed by the IETF. It was designed for supporting cross-layer fast handover. In this paper, we propose an enhanced cross-layering mobile IPv6 fast handover over IEEE 802.16e networks. In our scheme, a new access router generates a new address for the mobile node by using a layer 2 trigger. We utilize a layer 2 message which is sent from a new base station to the new access router in order to inform the new access router of information of the mobile node. A previous access router sends a binding update message to the mobile node's home agent when it acquires the new address of the mobile node. We evaluate the performance of the proposed scheme compared with the existing schemes in terms of the signaling cost and the handover latency. From the results, we observe that the proposed scheme can support fast handover effectively over IEEE 802.16e networks than existing schemes.

A Point-Of-Interest Allomorph Database Construction System (POI 이형태 데이타베이스 구축 시스템)

  • Yang, Seung-Weon;Lee, Hyun-Young;Wang, Ji-Hyun
    • Journal of KIISE:Software and Applications
    • /
    • v.36 no.3
    • /
    • pp.226-235
    • /
    • 2009
  • People use various information for searching POI in the navigation system such as name, category, address, phone number. Most of users use name and category to search their POT. They don't know exact name in POI DB provided by Maker. They use abbreviated or generalized name as key word for searching POI. Because of these reasons, the hit ratio has been very low. In this paper, We suggest a extra DB_construction system for raising the hit ratio. It generates allomorphes DB link to the POI name in original DB. We classified the POI names in original DB into seven types of allomorph by analyzing the gathered patterns from the POI DB which has over 650,000 entries. For auto_generating the allomorphes, we made 577 rules based on the classified types. And we generated the allomorphes manually for the entries which are difficult to make the rule and has low frequency The generated allomorphes account for 35.8% of all original DB. The hit ratio is 89% under suggested system.