• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.9
• /
• pp.2202-2217
• /
• 2012

The transmission opportunities between nodes in Delay Tolerant Network (DTNs) are uncertain, and routing algorithms in DTNs often need nodes serving as relays for others to carry and forward messages. Due to selfishness, nodes may ask the source to pay a certain reward, and the reward may be varying with time. Moreover, the reward that the source obtains from the destination may also be varying with time. For example, the sooner the destination gets the message, the more rewards the source may obtain. The goal of this paper is to explore efficient ways for the source to maximize its total reward in such complex applications when it uses the probabilistic two-hop routing policy. We first propose a theoretical framework, which can be used to evaluate the total reward that the source can obtain. Then based on the model, we prove that the optimal forwarding policy confirms to the threshold form by the Pontryagin's Maximum Principle. Simulations based on both synthetic and real motion traces show the accuracy of our theoretical framework. Furthermore, we demonstrate that the performance of the optimal forwarding policy with threshold form is better through extensive numerical results, which conforms to the result obtained by the Maximum Principle.

• International Journal of Computer Science & Network Security
• /
• v.23 no.9
• /
• pp.166-176
• /
• 2023

A scenario known as conflict in face recognition may arise as a result of some disparity-related issues (such as expression, distortion, occlusion and others) leading to a compromise of someone's identity or contradiction of the intended message. However, addressing this requires the determination and application of appropriate procedures among the various conflict theories both in terms of concepts as well as resolution strategies. Theories such as Marxist, Game theory (Prisoner's dilemma, Penny matching, Chicken problem), Lanchester theory and Information theory were analyzed in relation to facial images conflict and these were made possible by trying to provide answers to selected questions as far as resolving facial conflict is concerned. It has been observed that the scenarios presented in the Marxist theory agree with the form of resolution expected in the analysis of conflict and its related issues as they relate to face recognition. The study observed that the issue of conflict in facial images can better be analyzed using the concept introduced by the Marxist theory in relation to the Information theory. This is as a result of its resolution strategy which tends to seek a form of balance as result as opposed to the win or lose case scenarios applied in other concepts. This was also consolidated by making reference to the main mechanisms and result scenario applicable in Information theory.

• Journal of Korea Multimedia Society
• /
• v.18 no.4
• /
• pp.533-540
• /
• 2015

We study relay selection in decode-and-forward (DF)-based relay networks consisting of a source, a destination, an eavesdropper, and multiple relays, where each terminal has a single antenna and operates in a half-duplex mode. In these networks, it is desirable to protect the confidential message from the source to the destination against the eavesdropper with the help of a single selected relay. Specifically, we begin by investigating DF-based networks for the scenario instantaneous signal-to-noise ratios (SNRs) related to the eavesdropper are available. For the scenario, we propose relay selection to maximize the secrecy rate of DF-based networks with and without direct-paths, and we derive the exact secrecy outage probabilities in closed-form.

• English Language & Literature Teaching
• /
• v.12 no.3
• /
• pp.227-242
• /
• 2006

In a post-modern society where things exist and events happen in the form of Baudrillardian simulation, alterity of the other is erased and transcendence is denied. Don DeLillo's White Noise depicts what may happen in a society where alterity and transcendence are experienced in the neutral and safe forms. It will be argued in this paper that such phenomena reflect the desire of the self to conquer the others and neutralize the existence of them for the self's enduring safety and accomplishment. However, the attempt must fail due to inevitable death. The invincibility of death reminds one of the limit of his ability and the existence of uncontrollable part of the other. This paper will focus on DeLillo's critique of such a society, the affect of the existence of death as an invincible force, and his message about the way to live under these conditions.

• Proceedings of the Korean Institute of Interior Design Conference
• /
• 2003.05a
• /
• pp.44-49
• /
• 2003

Exhibition can be a type of mass-communication since it should contains some 'meaning' or 'message' that is to be delivered. The purpose of visiting museum is to view exhibits. Thus, factors, such as exhibits, exhibition media, show-case, direction signs, and gates, form visual perception, which means there exists homogeneity between visual perception and action. Visitors acquire knowledge by the space interaction when one can acknowledge the consecutive time flow while moving along the exhibition space. Visitors' movements can be formed by visual and perceptive experience that follows environmental stimulus and individual desire. Therefore, museum visitors experience certain shift flow with visual perception caused by the continuity of space. Thus, the research on development of focus in continuity is required. In addition, if the quality of exhibition space and organized continuity with visual diversity can be improved in exhibition design, it would expand the function of communication in exhibitions.

• Korea-Australia Rheology Journal
• /
• v.21 no.1
• /
• pp.1-12
• /
• 2009

This paper reports the suitability of a domain decomposition technique for the hybrid simulation of dilute polymer solution flows using Eulerian Brownian dynamics and Radial Basis Function Networks (RBFN) based methods. The Brownian Configuration Fields (BCF) and RBFN method incorporates the features of the BCF scheme (which render both closed form constitutive equations and a particle tracking process unnecessary) and a mesh-less method (which eliminates element-based discretisation of domains). However, when dealing with large scale problems, there appear several difficulties: the high computational time associated with the Stochastic Simulation Technique (SST), and the ill-condition of the system matrix associated with the RBFN. One way to overcome these disadvantages is to use parallel domain decomposition (DD) techniques. This approach makes the BCF-RBFN method more suitable for large scale problems.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.9 no.4
• /
• pp.153-156
• /
• 1984

A local area network(LAN) controller is designed according to non-persistent CSMA protocols. By meas of a buffer register, a microcomputer interfaces with the LAN controller. To keep bus utilization near the optimal efficiencies, the transmission intervals are adjusted as a function of $2^n$. A message in the form of a packet consisting of 128bytes is transitted to the bus. The maximum transmission rate of 19.2Kbps is obtained at layer 1.

• Proceedings of the KIEE Conference
• /
• 2004.07d
• /
• pp.2400-2402
• /
• 2004

The Controller Area Network (CAN) is being widely used in real-time control applications such as automobiles, aircraft, and automated factories. Unfortunately, CAN, in its current form, is not able to either share out the system bandwidth among the different devices fairly or to grant an upper bound on the transmission times experienced by the nodes connected to the communication medium as it happens, for instance, in the token-based networks. In this paper, we present the message scheduling for CAN, based on the distributed control scheme to integrate actuators and sensors in a humanoid robot. Besides introducing the new algorithm, this paper also presents some performance figures obtained using a specially developed software simulator, while the behavior of the new algorithm is compared with the traditional CAN systems, in order to see how effective they are.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2000.11a
• /
• pp.233-238
• /
• 2000

CNC machine tool is assembled by central processor, PLC(Programmable Logic Controller), and actuator. The sequential control of machine generally controlled by a PLC. The main fault occured at PLC in 3 control parts. In LC faults, operational fault is charged over 70%. This paper describes diagnosis model and data processing for remote monitoring and diagnosis system in machine tools with open architecture controller. Two diagnostic models based on the ladder diagram. Logical Diagnosis Model(LDM), Sequential Diagnosis Model(SDM), are proposed. Data processing structure is proposed ST(Structured Text) based on IEC1131-3. The faults from CNC are received message form open architecture controller and faults from PLC are gathered by sequential data.. To do this, CNC and PLC's logical and sequential data is constructed database.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.30A no.9
• /
• pp.71-79
• /
• 1993

This paper proposes a new test pattern generation methodology for combinational logic circuits using neural networks based on a modular structure. The CUT (Circuit Under Test) is described in our gate level hardware description language. By conferring neural database, the CUT is compiled to an ATPG (Automatic Test Pattern Generation) neural network. Each logic gate in CUT is represented as a discrete Hopfield network. Such a neual network is called a gate module in this paper. All the gate modules for a CUT form an ATPG neural network by connecting each module through message passing paths by which the states of modules are transferred to their adjacent modules. A fault is injected by setting the activation values of some neurons at given values and by invalidating connections between some gate modules. A test pattern for an injected fault is obtained when all gate modules in the ATPG neural network are stabilized through evolution and mutual interactions. The proposed methodology is efficient for test generation, known to be NP-complete, through its massive paralelism. Some results on combinational logic circuits confirm the feasibility of the proposed methodology.