• Title/Summary/Keyword: Information message

Search Result 3,325, Processing Time 0.027 seconds

Transient Alert Message Processing System for the LSST era

  • Shin, Min-Su
    • The Bulletin of The Korean Astronomical Society
    • /
    • v.44 no.1
    • /
    • pp.71.2-71.2
    • /
    • 2019
  • We have developed and tested a prototype system to process transient alert messages from the currently working facilities such as Gaia and GCN notices. Our experiments with the prototype focus on developing a platform that can be used in the LSST era with about 10 million alerts per night and helping Korean community members with the automated processing environment to provide auxiliary information for every alert message. The system consists of a message broker implemented by Redis and multiple message subscribers specialized for specific scientific interests. The current implementation of the entire system allows new Korean members to adopt their own processing chains receiving the messages from our local broker. We welcome experimental ideas and opinions from the Korean community about the current message processing system. We plan to test the current system with the ZTF alerts in the near future.

  • PDF

A Model for VMS Message Reading Time Using Driving Simulator (Driving Simulator를 이용한 VMS 메시지 판독시간모형 개발)

  • Kim, Tae-Hyung;Kim, Sung-Min;Oh, Cheol;Kim, Jeong-Wan
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.6 no.3
    • /
    • pp.24-32
    • /
    • 2007
  • Variable message sign (VMS), which is used for providing real-time information on traffic conditions and accident occurrences, is one of the important components of intelligent transportation systems. It is essential that the scheme of VMS message phase and duration should be designed with the consideration of drivers' message reading time that will be depended on various causal factors, such as the amount of VMS messages, drivers' travel speed, and geometric conditions. However, there have been not much efforts to explore the relationships between the drivers' message reading time and the above causal factors. Driving simulator experiments were conducted to obtain drivers' message reading time with respect to the amount of VMS messages, drivers' travel speed, and different geometric conditions. Regression modeling techniques were applied to develop an estimation model for drivers' message reading time. Probabilistic outcomes of the proposed model would be greatly utilized to design proper VMS message phase and duration.

  • PDF

Secure Broadcasting Using Multiple Antennas

  • Ekrem, Ersen;Ulukus, Sennur
    • Journal of Communications and Networks
    • /
    • v.12 no.5
    • /
    • pp.411-432
    • /
    • 2010
  • We consider three different secure broadcasting scenarios: i) Broadcast channels with common and confidential messages (BCC), ii) multi-receiver wiretap channels with public and confidential messages, and iii) compound wiretap channels. The BCC is a broadcast channel with two users, where in addition to the common message sent to both users, a private message, which needs to be kept hidden as much as possible from the other user, is sent to each user. In this model, each user treats the other user as an eavesdropper. The multi-receiver wiretap channel is a broadcast channel with two legitimate users and an external eavesdropper, where the transmitter sends a pair of public and confidential messages to each legitimate user. Although there is no secrecy concern about the public messages, the confidential messages need to be kept perfectly secret from the eavesdropper. The compound wiretap channel is a compound broadcast channel with a group of legitimate users and a group of eavesdroppers. In this model, the transmitter sends a common confidential message to the legitimate users, and this confidential message needs to be kept perfectly secret from all eavesdroppers. In this paper, we provide a survey of the existing information-theoretic results for these three forms of secure broadcasting problems, with a closer look at the Gaussian multiple-input multiple-output (MIMO) channel models. We also present the existing results for the more general discrete memoryless channel models, as they are often the first step in obtaining the capacity results for the corresponding Gaussian MIMO channel models.

An Enhanced SOAP Message Processing System for Mobile Web Services

  • Kim Seok-Soo;Park Gil-Cheol
    • Journal of information and communication convergence engineering
    • /
    • v.3 no.3
    • /
    • pp.157-162
    • /
    • 2005
  • Web services are key applications in business­to-business, business-to-customer, and enterprise applications integration solutions. As the mobile internet becomes one of the main methods for information delivery, mobile Web Services are regarded as a critical aspect of e-business architecture. In this paper, we proposed a mobile Web Services middleware that converts conventional internet services into mobile Web services. We implemented a WSDL (Web Service Description Language) builder that converts HTML/XML into WSDL and a SAOP (Simple Object Access Protocol) message processor that performs SOAP message handling, chain and handling of server requests. The former minimizes the overhead cost of rebuilding mobile Web Services and enables seamless services between wired and wireless internet services. The latter enhances SOAP processing performance by eliminating the Servlet container (Tomcat), a required component of typical Web services implementation. Our main contributions are to overcome the latency problem of current Web Services and to provide an easy mobile Web service implementation. Our system can completely support standard Web Services protocol, minimizing communication overhead, message processing time, and server overload. Finally we compare our empirical results with those of typical Web Services.

A New NTFS Anti-Forensic Technique for NTFS Index Entry (새로운 NTFS 디렉토리 인덱스 안티포렌식 기법)

  • Cho, Gyu-Sang
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.8 no.4
    • /
    • pp.327-337
    • /
    • 2015
  • This work provides new forensic techinque to a hide message on a directory index in Windows NTFS file system. Behavior characteristics of B-tree, which is apoted to manage an index entry, is utilized for hiding message in slack space of an index record. For hidden message not to be exposured, we use a disguised file in order not to be left in a file name attribute of a MFT entry. To understand of key idea of the proposed technique, we describe B-tree indexing method and the proposed of this work. We show the proposed technique is practical for anti-forensic usage with a real message hiding case using a developed software tool.

A Novel Route Discovery Scheme Equipped with Two Augmented Functions for Ad Hoc Networks

  • Lee Hae-Ryong;Shin Jae-Wook;Na Jee-Hyeon;Jeong Youn-Kwae;Park Kwang-Roh;Kim Sang-Ha
    • Journal of The Institute of Information and Telecommunication Facilities Engineering
    • /
    • v.3 no.1
    • /
    • pp.15-24
    • /
    • 2004
  • 'The delay and control overhead during route discovery for destinations outside ad hoc networks are major obstacle to achieving scalability in the Internet. To solve this issue, we propose a novel route discovery scheme equipped with two augmented functions. In this paper, the Internet gateway maintains an address cache of Internet nodes frequently accessed from the ad hoc network and replies with an extended Route Response (RREP) message to the Route Request (RREQ) message based on its routing table and the address cache called EXIT(EXternal node Information Table). These augmented functions make the source node determine the location of the destination as fast as possible. Through simulations, the proposed route discovery scheme using both EXIT and extended RREP message shows considerable' reduction in both route discovery time and control message overhead.

  • PDF

The Implementation of Vital Sign Information Parsing Module using TMO(Time Triggered and Message Triggered Method) (TMO를 이용한 생체정보 수신모듈 구현)

  • Cho, Eui-Joo;Kim, Chun-Suk;Kim, Gwang-Gun
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.3 no.4
    • /
    • pp.247-253
    • /
    • 2008
  • The TMO may contain two types of methods, time-triggered methods(also called the spontaneous methods of SpMs) which are clearly separated from the conventional service methods (SvMs). The SpM executions are triggered upon design time whereas the SvM executions are triggered by service request message from clients. In this paper, we describes the application environment as the patient monitor telemedicine system with TMO structure. Vital sign information web viewer systems is also the standard protocol for medical image and transfer. In order to embrace new technologies as telemedicine service, it is important to develope the standard protocol between different systems in the hospital, as well as the communication with external hospital systems.

  • PDF

Development of a Information Delivery System between School and Parents Using Homepage and Mobile Message Services (홈페이지와 휴대폰 메시지 서비스를 이용한 학교-학부모의 정보전달 시스템 개발)

  • Lee, Wan Kwon
    • The Journal of Korean Association of Computer Education
    • /
    • v.8 no.4
    • /
    • pp.71-77
    • /
    • 2005
  • Effective information delivery between school and parents is very important in preschool and the lower classes of elementary school. It is because by the fact that the traditional method of information delivery relies on kids to deliver school information but they are not sufficiently matured enough to deliver information correctly. In this point of view, this paper proposes a new information delivery method combining internet homepage and mobile message services and develops a information delivery system to support that method. Proposed method and developed system are able to correctly deliver information within the desired time and they do not increase the burden of communication costs and teacher's works.

  • PDF

PROMISE: A QR Code PROjection Matrix Based Framework for Information Hiding Using Image SEgmentation

  • Yixiang Fang;Kai Tu;Kai Wu;Yi Peng;Yunqing Shi
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.17 no.2
    • /
    • pp.471-485
    • /
    • 2023
  • As data sharing increases explosively, such information encoded in QR code is completely public as private messages are not securely protected. This paper proposes a new 'PROMISE' framework for hiding information based on the QR code projection matrix by using image segmentation without modifying the essential QR code characteristics. Projection matrix mapping, matrix scrambling, fusion image segmentation and steganography with SEL(secret embedding logic) are part of the PROMISE framework. The QR code could be mapped to determine the segmentation site of the fusion image as a binary information matrix. To further protect the site information, matrix scrambling could be adopted after the mapping phase. Image segmentation is then performed on the fusion image and the SEL module is applied to embed the secret message into the fusion image. Matrix transformation and SEL parameters should be uploaded to the server as the secret key for authorized users to decode the private message. And it was possible to further obtain the private message hidden by the framework we proposed. Experimental findings show that when compared to some traditional information hiding methods, better anti-detection performance, greater secret key space and lower complexity could be obtained in our work.

An Emergency Message Propagation Method with Stem and Branch Structure for Vehicle Safety Communication (차량안전통신을 위한 줄기와 가지 구조를 이용한 긴급 메시지 전파 방법)

  • Yu, Suk-Dea;Cho, Gi-Hwan
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.2A
    • /
    • pp.203-212
    • /
    • 2007
  • An advanced vehicle safety system can be constructed by exchanging danger-related information ,such as urgency stop, traffic accident, obstacle, and car trouble, among the vehicles. However, because network topology changes rapidly and frequently due to the mobility of vehicles, it is impossible to configure the network for information forwarding in this environment. In the most of vehicle safety communication applications, an emergency message is propagated in a form of broadcasting. The simple broadcasting causes a lot of problems in terms of efficiency due to multi-hop area and radio collision problem. This paper proposes a method of selective message forwarding with stem and branch structure for propagating the emergency messages. However, the proposed method raise the efficiency of message transmission with the selective forwarding based on the priority assignment as its location. We analyze and evaluate the performance by comparing the proposed scheme with other schemes that are presented in the paper.