• Title/Summary/Keyword: 메시지보냄

Search Result 573, Processing Time 0.028 seconds

The Effect of Message Framing on Personal Relevance and Social Value Orientation - Focusing on Privatization - (개인 관련성과 사회적 가치 지향성이 광고 메시지 프레이밍에 미치는 효과 - 공기업 민영화를 중심으로 -)

  • Ju, Tae-Wook;Kim, Hyun-Seok
    • Management & Information Systems Review
    • /
    • v.37 no.2
    • /
    • pp.109-123
    • /
    • 2018
  • This research presented the privatization of pubic corporations in terms of communication dimension rather than political and ideological dimension. Concretely, we examined how the message framing of privatization affects consumer's advertising attitude. At the same time, this study also examined the moderating factors which make a difference of the message framing, such as personal relevance(high/low) and social value orientation(proself/prosocial). The results showed that the interaction effect between type of message framing and personal relevance. Positive message framing showed a higher effect than negative message in the case of low personal relevance. Also, There was the interaction effect between type of message framing and social value orientation. Positive message framing showed a higher effect than negative message in the case of proself. However, there was no difference in message framing effect when there was high personal relevance and prosocial. Lastly, the implications of this study was presented. First, this study expanded the scope of research related to message framing. Second, the use of moderating variables such as personal relevance and social value orientation increased the possibility of practical application. In addition, limitation and further study directions was discussed.

Clustering based Routing Algorithm for Efficient Emergency Messages Transmission in VANET (차량 통신 네트워크에서 효율적인 긴급 메시지 전파를 위한 클러스터링 기반의 라우팅 알고리즘)

  • Kim, Jun-Su;Ryu, Min-Woo;Cha, Si-Ho;Lee, Jong-Eon;Cho, Kuk-Hyun
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.13 no.8
    • /
    • pp.3672-3679
    • /
    • 2012
  • Vehicle Ad hoc Network (VANET) is next-generation network technology to provide various services using V2V (Vehicle-to-Vehicle) and V2I (Vehicle-to-Infrastructure). In VANET, many researchers proposed various studies for the safety of drivers. In particular, using the emergency message to increase the efficiency of traffic safety have been actively studied. In order to efficiently transmit to moving vehicle, to send a quick message to as many nodes is very important via broadcasting belong to communication range of vehicle nodes. However, existing studies have suggested a message for transmission to the communication node through indiscriminate broadcasting and broadcast storm problems, thereby decreasing the overall performance has caused the problem. In addition, theses problems has decreasing performance of overall network in various form of road and high density of vehicle node as urban area. Therefore, this paper proposed Clustering based Routing Algorithm (CBRA) to efficiently transmit emergency message in high density of vehicle as urban area. The CBRA managed moving vehicle via clustering when vehicle transmit emergency messages. In addition, we resolve linkage problem between vehicles according to various form of road. The CBRA resolve link brokage problem according to various form of road as urban using clustering. In addition, we resolve broadcasting storm problem and improving efficacy using selection flooding method. simulation results using ns-2 revealed that the proposed CBRA performs much better than the existing routing protocols.

Development of Message Define & Management System based on Distributed Processing Environment for Naval Combat Systems (함정 전투체계를 위한 분산처리 환경 기반 메시지 정의 및 관리 시스템의 개발)

  • Lee, Juwon
    • KIISE Transactions on Computing Practices
    • /
    • v.23 no.12
    • /
    • pp.670-676
    • /
    • 2017
  • Naval combat systems use real-time processing and compositing of collected information to provide the optimal combat capabilities that maximize survival and ensure mission effectiveness. The software for a combat system has dozens to thousands of components depending on the size of the system, and the communication between the components is achieved via DDS. Although the message interface of the combat system is managed through MDMS, an increase in the system size can result in problems such as the deterioration of the development efficiency. In this paper, we implement XMDMS to operate a distributed processing environment and then solve the problem of the reduction in the development efficiency caused by a load at the server. The experimental results shows that XMDMS improves the processing delay and network performance compared to MDMS.

Asynchronous and Adaptive Massage Passing Scheme for Wireless Sensor Networks (무선 센서 네트워크를 위한 비동기 적응형 메시지 전달 기법)

  • Jeong, Jong-Kyun;Ra, In-Ho
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.23 no.3
    • /
    • pp.196-201
    • /
    • 2013
  • In this paper, we propose an asynchronous and adaptive message passing scheme based on S-MAC for handling with the problem on energy efficiency in wireless sensor networks. The proposed scheme consists of a policy that differentiate transmission errors caused by packet collision or radio interference from congestion errors caused by buffer overflow and a method that adaptively controls the size of a fragment according to the variance of traffic loads. Especially, it presents a method that highly reduce the energy consumption by keeping the size of fragment not being excessively smaller than the one that may result in rapid increment of the total transfer time. Finally, with the simulation results we show that network throughput and delay are improved by using the proposed message passing scheme.

Network structure for Shared Virtual Environments (가상 공유 공간을 위한 네트워크 구조)

  • Choi, Hwal-Ian;Lee, Arthur
    • Journal of the Korea Computer Graphics Society
    • /
    • v.4 no.1
    • /
    • pp.89-100
    • /
    • 1998
  • A multi-user virtual reality system supports shared environments for concurrent accesses by multiple users. The performance of these systems depends heavily on the network environments. This paper experiments an effective network model for shared virtual environments. This model has a middle layer called groups placed between the server and its clients, and the tasks of server are distributed to these groups. Using groups solves some of the problems of existing systems such as lack of scalability, message overheads, and latency due to message passing among locally communicating entities in the virtual environment. Some experiments show lower overhead than existing distributed virtual environment systems in WAN as well as LAN environments. This model also supports a method that can be used to construct application specific network environments using message handler which allows user-defined message formats.

  • PDF

An Implementation of Fault-Tolerant Message Passing Interface on Parallel Computers (병렬 컴퓨터에서의 결함 허용 메시지 전달 인터페이스 구현)

  • Song, Dae-Ki;Lee, Cheol-Hoon
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.6 no.3
    • /
    • pp.319-328
    • /
    • 2000
  • The Message-Passing Interface(MPI) is a standard interface for parallel programming environment, based on that application programs run on the processors of a parallel computer. Processor nodes execute processes consisting the program by passing messages to one another. During executing, however, if a fault occurs on a processor node or a process, this will result an inconsistent state, and consequently, the whole program will have to be stopped. To solve this problem, in this paper, we propose a fault-tolerant message passing interface(FT-MPI) by adding a fault manager module to MPI. The proposed FT-MPI does not need any hardware support, and each application program based on MPI can run on the FT-MPI without any modification. The proposed fault tolerance scheme uses the so-called hot-spare process duplication method, and verified by simulations that application programs run despite of any fault with less than 5% overhead on execution time.

  • PDF

TAILWIND: Mobility information based Routing for Delay Tolerant Network (이동 방향 정보를 이용한 DTN 라우팅: TAILWIND)

  • Cho, Seoik;Kim, Sunhyun;Moon, Soohoon;Han, Seungjae
    • Journal of KIISE
    • /
    • v.42 no.3
    • /
    • pp.408-412
    • /
    • 2015
  • In base station based networks, traffic overload at the base station is inevitable. Peer-to-peer DTN which disperses the traffic overhead to each node can relieve the traffic overload at the base station. To increase the message delivery ratio and reduce the message overhead, we present novel routing using mobility information which can be obtained from each node, unlike the existing flooding based routings. In the proposed routing scheme, the routing decision metric, which is defined based on the node mobility information, is computed by using the expected distance between each node to the destination. The message is copied to other nodes that have lower expected distance to the destination than the value for the node willing to copy the message. We conducted simulations by using both a random mobility model and a real mobility trace to compare the performance of the proposed routing scheme to the existing routing scheme that does not utilize the mobility information. The performance evaluation showed the proposed routing successfully delivers messages with 10% to 30% less copies compared to previously proposed routing schemes.

A Techniques for Information Hiding in the Steganography using LSB and Genetic Algorithm (유전적 알고리즘과 LSB를 이용한 스테가노그래피의 정보은닉 기법)

  • Ji, Seon-Su
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.11 no.3
    • /
    • pp.277-282
    • /
    • 2018
  • The goal of the secret message communication on the internet is to maintain invisibility and confidentiality. Digital steganography is a technique in which a secret message is inserted in a cover medium and transmitted to a destination so that a third party can not perceive the existence of the message itself. Steganography is an efficient method for ensuring confidentiality and integrity together with encryption techniques. In order to insert a secret (Hangul) message, I propose a image steganography method that the secret character is separated and converted into binary code with reference to the encryption table, the cover image is divided into two areas, and the secret message and the right l-LSB information of the second area are encrypted and crossed, concealing the k-LSB of the first region. The experimental results of the proposed method show that the PSNR value is 52.62 and the acceptable image quality level.

Agent Communication with Multiple Ontologies (다중온톨로지의 에이전트 통신)

  • 임동주;오창윤;배상현
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.5 no.1
    • /
    • pp.173-182
    • /
    • 2001
  • In this paper, we discuss how ontology Plays roles in building a distributed and heterogeneous knowledge-base system. First, we discuss relationship between ontology and agent in the Knowledgeable Community which is a framework of knowledge sharing and reuse based on a multi-agent architecture. Ontology is a minimum requirement for each agent to join the Knowledgeable Community. Second we explain mediation by ontology to show how ontology is used in the Knowledgeable Community. A special agent called mediation analyzes undirected messages and infer candidates of recipient agents by consulting ontology and relationship between ontology and agents. Third we model ontology as combination of aspects each of which can represent a way of conceptualization. Aspects are combined either as combination aspect which means integration of aspects or category aspect which means choice of aspects. Since ontology by aspect allows heterogeneous and multiple descriptions for phenomenon in the world, it is appropriate for heterogeneous knowledge-base systems. We also show translation of messages as a wave of interpreting multiple aspects. A translation agent can translate a message with some aspect to one with another aspect by analyzing dependency of aspects. Mediation and translation of messages are important to build agents easily and naturally because less knowledge on other agents is requested for each agent.

  • PDF

Cryptanalysis of an Identity-Based Message Authentication Scheme in VANETs (신원기반의 차량통신망 메시지 인증 스킴에 대한 안전성 분석)

  • Ryu, Eun-Kyung;Lee, Sung-Woon;Yoo, Kee-Young
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.50 no.6
    • /
    • pp.167-172
    • /
    • 2013
  • In a paper recently published in the International Journal of Parallel, Emergent and Distributed Systems, Biswas et al. proposed a VANET message authentication scheme which uses an identity-based proxy signature mechanism as an underlying primitive. The authors claimed that their scheme supports various security features including the security of proxy-key, the security against message forgery and the security against replay attack, with non-repudiation and resistance to proxy-key compromise. Here, we show how an active attacker, who has no knowledge of an original message sender's private key, can compute the proxy-signature key of the corresponding message sender, meaning that the scheme is completely insecure. We also suggest an enhanced version of the protocol capable of solving such serious security holes.