• Title/Summary/Keyword: 데이타통신

Search Result 742, Processing Time 0.026 seconds

Implementation of Data Integrity Module in Wireless Internet Terminal for Mobile Customer Relationship Management(m-CRM) (m-CRM을 위한 무선인터넷단말기의 데이터무결성 모듈의 구현)

  • Park, Hyun-Cheol;Kim, Dong-Gyu
    • The KIPS Transactions:PartD
    • /
    • v.11D no.2
    • /
    • pp.485-494
    • /
    • 2004
  • Recently, the wireless internet terminals like mobile phones or PDAs prevail in the management of customers. With such terminals, businessmen can get business data and information of customers in real time, in connection with mobile group wares. By the wireless terminals, customers can conveniently get information of goods, search purchase sites, and give orders and do settlement. This paper aims to present the safe data integrity modules of the wireless internet terminal, for service providing correct real-time promotion information, by using users' disposition, situation, Purchase information. This study aims to suggest an implementation methodology of security module for data integrity of mobile internet terminal. This is based on the WTLS of WAP Protocol. This security module is expected to achieve central role in conversion of wireless internet environment and emphasis of encryption technology and safe and calculable wireless communication environment construction

Status of Document Delivery, Interlibrary Loan Services and Use of Information Technology in Korean Special Libraries (국내 특수 도서관에서의 원문제공과 상호대차 서비스 및 정보기술의 활용 현황)

  • Rieh Hae-young
    • Journal of the Korean Society for Library and Information Science
    • /
    • v.31 no.3
    • /
    • pp.53-73
    • /
    • 1997
  • To find out the status of document delivery and interlibrary loan services and the use of information technology in special libraries, questionnaires were sent to 328 special Libraries nation wide with at least 1 librarian, listed In the Korean Libraries Statistics 1994-1995(1996). $46.6\%$ were returned and 152 Questionnaires were analyzed. For document delivery, $61.3\%$ use BLDSC$47.5\%$ use KINITI. 87 libararies $(57.2\%)$ participate In interlibrary loan activities. To send requests, FAX and telephone is used the most, while FAX and print copy is used the most to receive the requested documents. $45-75\%$ use various information technology including online databases, Internet, e-mail, etc., and the use of information technology was related to the budget of the libraries. The costs, budgets, and slowness was the problems raised by the most. To improve the document delivery services, the most urgent thing is establishing cooperative system using BBS or Internet. Network systems to facilitate interlibrary loan should be established ultimately.

  • PDF

An Optimization Technique in Memory System Performance for RealTime Embedded Systems (실시간 임베디드 시스템을 위한 메모리 시스템 성능 최적화 기법)

  • Yongin Kwon;Doosan Cho;Jongwon Lee;Yongjoo Kim;Jonghee Youn;Sanghyun Park;Yunheung Paek
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2008.11a
    • /
    • pp.882-884
    • /
    • 2008
  • 통상 하드웨어 캐시의 크기보다 수십에서 수백배 큰 크기의 데이타를 랜덤하게 접근하는 경우 낮은 메모리 접근 지역성(locality)에 기인하여 캐시 메모리 성능이 급격히 저하되는 문제를 야기한다. 예를 들면, 현재 보편적으로 사용되고 있는 차량용 General Positioning System (GPS) 프로그램의 경우 최대 32개의 위성으로부터 데이터를 받아 수신단의 위치를 계산하는 부분이 핵심 모듈중의 하나 이며, 이는 전체 성능의 50% 이상을 차지한다. 이러한 모듈에서는 위성 신호를 실시간으로 받아 버퍼 메모리에 저장하며, 이때 필요한 데이터가 순차적으로 저장되지 못하기 때문에 랜덤하게 데이터를 읽어 사용하게 된다. 결과적으로 낮은 지역성에 기인하여 실시간 (realtime)안에 데이터 처리를 하기 어려운 문제에 직면하게 된다. 통상의 통신 응용의 알고리즘 상에 내재된(inherited) 낮은 메모리 접근 지역성을 개선하는 것은 알고리즘 상에서의 접근을 요구한다. 이는 높은 비용이 필요함으로 본 연구에서는 사용되는 데이터 구조를 변환하여 지역성을 높이는 방향으로 접근하였다. 결과적으로 핵심 모듈에서 2배, 전체 시스템 성능에서 14%를 개선할 수 있었다.

An Efficient Spatial Index Structure for Main Memory (메인 메모리를 위한 효율적인 공간 인덱스 구조)

  • Lee, Ki-Young;Lim, Myung-Jae;Kang, Jeong-Jin;Kim, Joung-Joon
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.9 no.2
    • /
    • pp.13-20
    • /
    • 2009
  • Recently there is growing interest in LBS requiring real-time services and the spatial main memory DBMS for efficient Telematics services. In order to optimize existing disk-based spatial indexes of the spatial main memory DBMS in the main memory, spatial index structures have been proposed, which minimize failures in cache access by reducing the entry size. However, because the reduction of entry size requires compression based on the MBR of the parent node or the removal of redundant MBR, the cost of MBR reconstruction increases in index update and the efficiency of search is lowered in index search. Thus, to reduce the cost of MBR reconstruction, this paper proposed the RSMB (relative-sized MBR)compression technique, which applies the base point of compression differently in case of broad distribution and narrow distribution. In case of broad distribution, compression is made based on the left-bottom point of the extended MBR of the parent node, and in case of narrow distribution, the whole MBR is divided into cells of the same size and compression is made based on the left-bottom point of each cell. In addition, MBR was compressed using a relative coordinate and size to reduce the cost of search in index search. Lastly, we evaluated the performance of the proposed RSMBR compression technique using real data, and proved its superiority.

  • PDF

Group Key Management Scheme for Access Control with Reactive Approach (접근 제어를 위한 반응적 방식의 그룹키 관리 기법)

  • Kim, Hee-Youl;Lee, Youn-Ho;Park, Yong-Su;Yoon, Hyun-Soo
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.34 no.11
    • /
    • pp.589-598
    • /
    • 2007
  • In the group communication which has multiple data streams and various access privileges, it is necessary to provide group access control. The group members having the same access privilege are classified into one class, and the classes form a hierarchy based on the access relations. Then each class is assigned to a secret key. In the previous schemes, a single logical key graph is constructed from the hierarchy and each member always holds all secret keys of the classes he can access in the proactive manner. Thus, higher-privileged members hold more keys then lower-privileged members. However, if the hierarchy is large, each member manages too many keys and the size of multicast message in rekeying increases in proportion to the size of the hierarchy. Moreover, most of the members access a small portion of multiple data streams simultaneously. Therefore, it is redundant to receive rekeying message and update the keys in which he is not currently interested. In this paper, we present a new key management scheme that takes a reactive approach in which each member obtains the key of a data stream only when he wants to access the stream. Each member holds and updates only the key of the class he belongs. If he wants to get the key of other class, he derives it from his key and the public parameter. Proposed scheme considerable reduces the costs for rekeying, especially in the group where access relations are very complex and the hierarchy is large. Moreover, the scheme has another advantage that it easily reflects the change of access relations.

A Bottom up Filtering Tuple Selection Method for Continuous Skyline Query Processing in Sensor Networks (센서 네트워크에서 연속 스카이라인 질의 처리를 위한 상향식 필터링 투플 선정 방법)

  • Sun, Jin-Ho;Chung, Chin-Wan
    • Journal of KIISE:Databases
    • /
    • v.36 no.4
    • /
    • pp.280-291
    • /
    • 2009
  • Skyline Query processing is important to wireless sensor applications in order to process multi-dimensional data efficiently. Most skyline researches about sensor network focus on minimizing the energy consumption due to the battery powered constraints. In order to reduce energy consumption, Filtering Method is proposed. Most existing researches have assumed a snapshot skyline query processing and do not consider continuous queries and use data generated in ancestor node. In this paper, we propose an energy efficient method called Bottom up filtering tuple selection for continuous skyline query processing. Past skyline data generated in child nodes are stored in each sensor node and is used when choosing filtering tuple. We also extend the algorithms, called Support filtering tuple(SFT) that is used when we choose the additional filtering tuple. There is a temporal correlation between previous sensing data and recent sensing data. Thus, Based on past data, we estimate current data. By considering this point, we reduce the unnecessary communication cost. The experimental results show that our method outperforms the existing methods in terms of both data reduction rate(DRR) and total communication cost.

Performance Analysis of Multicarrier Code Selection CDMA System for PAPR Reduction in Multipath Fading Channel (PAPR을 줄이기 위한 Multicarrier Code Select CDMA시스템의 다중 경로 페이딩 채널에서 성능 분석)

  • Ryu Kwan Woong;Park Yong Wan;Hong Een Kee;Kim Myovng Jin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.12A
    • /
    • pp.1319-1332
    • /
    • 2004
  • Multicarrier direct sequence code-division multiple access CDMA(MC DS-CDMA) is an attractive technique for achieving high data rate transmission even if the potentially large peak-to-average power ratio(PAPR) is an important factor for its application. On the other hand, code select CDMA(CS-CDMA) is an attractive technique with constant amplitude transmission of multicode signal irregardless of subchannels by introducing code selection method. In this paper we propose a new multiple access scheme based on the combination of MC DS-CDMA and CS-CDMA. Proposed scheme, which we called MC CS-CDMA, includes the sutclasses of MC DS-CDMA and CS-CDMA as special cases. The performance of this system is investigated for multipath Sequency selective fading channel and maximal ratio combining with rake receiver. In addition the PAPR of proposed system is compare with that of both MC BS-CDMA and CS-CDMA. Simulation results show that proposed system improves PAPR reduction than MC DS-CDMA at the expense of the complexity of receiver and the number of available non. Also, the numerical result shows that the proposed system is better performance than MC DS-CDMA due to the increasing processing gain and the number of time diversity gain.

Efficient security solution structure design for enterprise security management system (통합 보안 관리 시스템 구축을 위한 효율적인 보안 솔루션 구조 설계)

  • Kang Min-gyun;Han Kun-Hee;Ha Kyung-Jae;Kim Seok-soo
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.9 no.4
    • /
    • pp.824-831
    • /
    • 2005
  • Past corporaion's network security system is single security solution, or mixed several ways, but there was inefficient system because doing not get into organic link But, constructed more strong security system by ESM enterance on. ESM uses way to integrate of each agent to manage easily various kinds security solution. That is, it is system that connect system of existent VPN, FireWall, IDS and so on configurationally depending on security policy and manage. ESM is security system that is developed more than existent security system. But, practical use of network and the development speed of technology being increasing with the mon faster speed, is heightening the level more as well as dysfunction of information crime and so on. Many improvements are required at ESM system, this research wished to make up for the weak-point in the ESM system about interior security. Studied on structure of security solution that is basis of security policy. VPN, Firewall, IDS's link that is main composition of existing security system analysis, reconstructed. And supplemented security of ESM system itself. Establish imaginary intrusion and comparative analysis access data that apply each Telnet Log analysys IDS existent ESM system and proposed ESM system comparative analysis. Confirm the importance of interior security and inspected security of proposed system.

A Study of EEG Analysis for the Moxibustion Stimulation (간접 뜸 자극에 관한 EEG 분석)

  • Park, Dong-Hee;Yoon, Dong-Eop;Jo, Bong-Kwan;Song, Hong-Bock;Kim, Young-Jin
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2007.10a
    • /
    • pp.170-174
    • /
    • 2007
  • Although research efforts for brain waves have prospered in medicine and engineering, acupuncture still has a long way to go regarding researches on brain waves analysis. Thus this study set out to analyze brain waves stimulated by indirect mugwort moxibustion, which was part of acupuncture techniques, and to investigate their correlations with the automatic nervous system. For the experiments, stimulation was given to Jungwan, Shingwol and Gwanwon, which were some of the spots on the body suitable for acupuncture, through indirect mugwort moxibustion. The subjects' brain waves were measured before the stimulation, during the stimulation, and one hour and two hours after the stimulation. The measurements were analyzed with Matlab 7.0 for FFT and frequency power spectrum. Then the ${\alpha}$, ${\beta}$, ${\delta}$, and ${\theta}$ waves were analyzed and examined for changes to the percentage of each frequency and to the amplitude of vibration according to the stages of stimulation. The EEG data of the entire brain were translated into FFT to analyze the percentage of the ${\alpha}$, ${\beta}$, ${\delta}$, and ${\theta}$ waves. As a result, the ${\alpha}$ waves recorded a double increase after the stimulation. The power spectrum analysis results of the entire brain decreased the ${\alpha}$ and ${\beta}$ waves dropping in the energy level, which suggested that the parasympathetic nerves were activated. When the results of the study were compared with those of the previous study, it's confirmed that indirect moxibustion stimulation could cause changes to the automatic nervous system and bring stability to those who were nervous or under stress due to the proportionate increase of the ${\alpha}$ waves.

  • PDF

Performance Analysis of The CCITT X.25 Protocol (X. 25 Protocol의 성능 분석)

  • 최준균;은종관
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.11 no.1
    • /
    • pp.25-39
    • /
    • 1986
  • In this paper, we analyze the performance, particularly the flow control mechanism, of the CCITT X.25 protocol in a packet-switched network. In this analysis, we consider the link and packet layers separately, and investigate the performance in three measures; normalized channel throughput, mean transmission time, and transmission efficiency. Each of these measures is formulated in terms of given protocol parameters such as windos size, $T_1$ and $T_2$ values, message length, and so forth. We model the service procedure of the inpur traffic based on the flow control mechanism of the X.25 protocol, and investigate the mechanism of the sliding window flow control with the piggybacked acknowlodgment scheme using a discrete-time Markov chain model. With this model, we study the effect of variation of the protoccol parameters on the performance of the X.25 protocol. From the numerical results of this analysis one can select the optimal valuse of the protocol parameters for different channel environments. it has been found that to maintain the trasnmission capacity satisfactorily, the window size must be greater than or equal to 7 in a high-speed channel. The time-out value, $T_1$, must carefully be selected in a noisy channel. In a normal condition, it should be in the order of ls. The value of $T_2$ has some effect on the transmission efficiency, but is not critical.

  • PDF