• ETRI Journal
• /
• v.27 no.6
• /
• pp.747-758
• /
• 2005

The problem of selection among competing models has been a fundamental issue in statistical data analysis. Good fits to data can be misleading since they can result from properties of the model that have nothing to do with it being a close approximation to the source distribution of interest (for example, overfitting). In this study we focus on the preference among models from a family of polynomial regressors. Three decades of research has spawned a number of plausible techniques for the selection of models, namely, Akaike's Finite Prediction Error (FPE) and Information Criterion (AIC), Schwartz's criterion (SCH), Generalized Cross Validation (GCV), Wallace's Minimum Message Length (MML), Minimum Description Length (MDL), and Vapnik's Structural Risk Minimization (SRM). The fundamental similarity between all these principles is their attempt to define an appropriate balance between the complexity of models and their ability to explain the data. This paper presents an empirical study of the above principles in the context of model selection, where the models under consideration are univariate polynomials. The paper includes a detailed empirical evaluation of the model selection methods on six target functions, with varying sample sizes and added Gaussian noise. The results from the study appear to provide strong evidence in support of the MML- and SRM- based methods over the other standard approaches (FPE, AIC, SCH and GCV).

• Journal of the Korea Computer Industry Society
• /
• v.2 no.2
• /
• pp.131-140
• /
• 2001

In this paper file transfer efficiencies of satellite and terrestrial links are analyzed, and a simulator that satellite links are supplementarily expanded to SARA(System ARchitect’ Apprentice) model, a terrestrial model of CSDN interface, is constructed. And in satellite transmission an interpretative method and a simulator of file transfer are proposed to evaluate the efficiency of file transfer. The parameters used are the message length and transmission time, and the optimum message length by transmission speed of satellite links. From the results of evaluation, in satellite transfer, it is found that when the length of message is shorter than 512 byte, the file transfer time becomes extremely long and when the length of message is set at 1,024 byte the file transfer time becomes minimum, and if the length of message is set more longer, the file transfer time abruptly increases from 2,048 byte. Therefore, from the results of file transfer simulation in the case of utilizing satellite transmission, it is found that the optimum massage length in the minimum transfer time is present closely at 1,024 byte.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.2
• /
• pp.724-737
• /
• 2020

Corrected Block TEA(or XXTEA) is a block cipher designed to correct security weakness in the original block TEA in 1998. In this paper, XXTEA cipher hardware which can encrypt or decrypt between 64-bit and 256-bit messages using 128-bit master key is implemented. Minimum message block size is 64-bit wide and maximal message block size is 256-bit wide. The designed XXTEA can encrypt and decrypt variable-length message blocks which are some arbitrary multiple of 32 bits in message block sizes. XXTEA core of this paper is described using Verilog-HDL and downloaded on Vertex4. The operation frequency is 177MHz. The maximum throughput for 64-bit message blocks is 174Mbps and that of 256-bit message blocks is 467Mbps. The cryptographic IP of this paper is applicable as security module of the mobile areas such as smart card, internet banking, e-commerce and IoT.

• Journal of Communications and Networks
• /
• v.6 no.2
• /
• pp.147-155
• /
• 2004

In this paper, we propose an efficient sequencing technique, namely minimum Row time scheduling (MFTS), to manage variable-Iength message transmissions for single-hop passive starcoupled WDM optical networks. By considering not only the message length but also the state of the receivers and the tuning latency, the proposed protocol can reduce the average delay of the network greatly. This paper also introduces a new channel assignment technique latency minimizing scheduling (LMS), which aims to reduce the scheduling latency. We evaluate the proposed algorithm, using extensive discrete-event simulations, by comparing its performance with shortest job first (SJF) algorithm. We find that significant improvement in average delay could be achieved by MFTS algorithm. By combining the proposed message sequencing technique with the channel selection technique, the performance of the optical network could be further improved.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.7 no.3
• /
• pp.130-134
• /
• 1982

In computer communication network, it is assumed that blocks are served at a rate of u messages per sec. The message blocks will be stayed in the buffer during the service time. In this case, the probability density distribution of the number of message blocks in the buffer space has been studied. When the average buffer space needed is minimum, the average block size will be specified by the relation between the input data and link infromation length. This relation proves to be perfect. The random number generator for this probability distribution is designed. The test result by making use of the random number generator has shown that is has little difference from the theoretical one.

• International Journal of Computer Science & Network Security
• /
• v.21 no.1
• /
• pp.143-151
• /
• 2021

The enormous prevalence of transferring official confidential digital documents via the Internet shows the urgent need to deliver confidential messages to the recipient without letting any unauthorized person to know contents of the secret messages or detect there existence . Several Steganography techniques such as the least significant Bit (LSB), Secure Cover Selection (SCS), Discrete Cosine Transform (DCT) and Palette Based (PB) were applied to prevent any intruder from analyzing and getting the secret transferred message. The utilized steganography methods should defiance the challenges of Steganalysis techniques in term of analysis and detection. This paper presents a novel and robust framework for color image steganography that combines Linear Congruential Generator (LCG), simulated annealing (SA), Cesar cryptography and LSB substitution method in one system in order to reduce the objection of Steganalysis and deliver data securely to their destination. SA with the support of LCG finds out the optimal minimum sniffing path inside a cover color image (RGB) then the confidential message will be encrypt and embedded within the RGB image path as a host medium by using Cesar and LSB procedures. Embedding and extraction processes of secret message require a common knowledge between sender and receiver; that knowledge are represented by SA initialization parameters, LCG seed, Cesar key agreement and secret message length. Steganalysis intruder will not understand or detect the secret message inside the host image without the correct knowledge about the manipulation process. The constructed system satisfies the main requirements of image steganography in term of robustness against confidential message extraction, high quality visual appearance, little mean square error (MSE) and high peak signal noise ratio (PSNR).

• Journal of Electrical Engineering and Technology
• /
• v.11 no.4
• /
• pp.974-986
• /
• 2016

Reversible image watermarking, a type of digital data hiding, is capable of recovering the original image and extracting the hidden message with precision. A number of reversible algorithms have been proposed to achieve a high embedding capacity and a low distortion. While numerous algorithms for the achievement of a favorable performance regarding a small embedding capacity exist, the main goal of this paper is the achievement of a more favorable performance regarding a larger embedding capacity and a lower distortion. This paper therefore proposes a reversible data hiding algorithm for which a novel piecewise 2D auto-regression (P2AR) predictor that is based on a rhombus-embedding scheme is used. In addition, a minimum description length (MDL) approach is applied to remove the outlier pixels from a training set so that the effect of a multiple linear regression can be maximized. The experiment results demonstrate that the performance of the proposed method is superior to those of previous methods.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.5 no.5
• /
• pp.892-901
• /
• 2001

Despite of many advantages over conventional radio paths, application of the Meteor Burst Path in commercial communication system is so far limited to a few extent because of its low duty rate, which is, less than several percent at best. In order to get through maximum number of data bits during the short interval of each burst, which normally lives a fractions of a second, a sophisticated communication protocol is called for. In this paper, author introduces a communication protocol which can effectively locate and fetch burst signal by sending out periodic detection signal from master station and, with minimal delay, switch over to transmission states so as to put as many data bits through the detected burst as the burst length permits. By analyzing time period required for each transaction steps, the author derives optimal packet length for various bursts which assures to get a message string through in minimum delay. According to the analysis, the author proposes a protocol including a routine which automatically accesses average length of bursts at each environment and automatically adapt length of data packet so as to maximize data throughput under Riven burst conditions.

• Journal of Korea Multimedia Society
• /
• v.13 no.6
• /
• pp.849-864
• /
• 2010

This paper proposes a multipath routing protocol called cross-layer multipath AODV (CM-AODV) for wireless ad hoc networks, which selects multiple routes on demand based on the signal-to-interference plus noise ratio (SINR) measured at the physical layer. Note that AODV (Ad hoc On-demand Distance Vector) is one of the most popular routing protocols for mobile ad hoc networks. Each time a route request (RREQ) message is forwarded hop by hop, each forwarding node updates the route quality which is defined as the minimum SINR of serialized links in a route and is contained in the RREQ header. While achieving robust packet delivery, the proposed CM-AODV is amenable to immediate implementation using existing technology by neither defining additional packet types nor increasing packet length. Compared to the conventional multipath version of AODV (which is called AOMDV), CM-AODV assigns the construction of multiple paths to the destination node and makes it algorithmically simple, resulting in the improved performance of packet delivery and the less overhead incurred at intermediate nodes. Our performance study shows that CM-AODV significantly outperforms AOMDV in terms of packet delivery ratio and average end-to-end delay, and results in less routing overhead.

• Journal of Korea Multimedia Society
• /
• v.16 no.7
• /
• pp.897-904
• /
• 2013

The recursive circulant network G(N,d) can be widely used in the design and implementation of parallel processing architectures. It consists of N identical nodes, each node is connected through bidirectional, point-to-point communication channels to different neighbors by jumping $d^i$, where $0{\leq}i{\leq}{\lceil}{\log}_dN{\rceil}$ - 1. In this paper, we investigate the routing of a message on $G(2^m,4)$, a special kind of RCN, that is key to the performance of this network. On $G(2^m,4)$ we would like to transmit k packets from a source node to k destination nodes simultaneously along paths on this network, the $i^{th}$ packet will be transmitted along the $i^{th}$ path, where $1{\leq}k{\leq}m-1$, $0{{\leq}}i{{\leq}}m-1$. In order for all packets to arrive at a destination node quickly and securely, we present an $O(m^4)$ routing algorithm on $G(2^m,4)$ for generating a set of one-to-many node-disjoint and nearly shortest paths, where each path is either shortest or nearly shortest and the total length of these paths is nearly minimum since the path is mainly determined by employing the Hungarian method.