• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.24 no.8
• /
• pp.1095-1101
• /
• 2020

Vessels or aircraft should be loaded with containers or cargo to maintain weight balance in order to be stable when navigating the route. The container loading algorithm is known as the NP problem and several heuristic methods have been studied. Containers can be characterized by the uniform volume and weight, which makes it easier to find an optimal loading method. In this paper, we propose an algorithm for weight balance when the volume and weight of an object are uniform. It is assumed that the loading space has a special structure of m * n mesh (where m and n are both odd). In this case, we designed a greedy algorithm and proved that the algorithm is optimal in that it can always find a loading position that maintains a weight balance regardless of the number of objects. Our algorithm can be used in many engineering problems, such as loading algorithms and load balancing problems.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.24 no.11
• /
• pp.1457-1462
• /
• 2020

There are dozens of applications on the smartphone. The service application that manages the loading, deletion, and deployment of these applications is called a smartphone launcher, and various launchers are used. Some of the existing launchers provide a function to automatically place icons by analyzing user application usage patterns. In this paper, we present a method of automatically arranging icons so that the icons are balanced on the smartphone screen. The usefulness of our method is illustrated by some exaples. In this case, it is proved that in an m × n screen layout with a height of m and a width of n, if n is an odd number, the entire screen can always be arranged in a balanced manner regardless of the n value by mathematical induction method.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.7
• /
• pp.2610-2630
• /
• 2021

The aim of this paper is to propose the alternative algorithm to finish the process in public key cryptography. In general, the proposed method can be selected to finish both of modular exponentiation and point multiplication. Although this method is not the best method in all cases, it may be the most efficient method when the condition responds well to this approach. Assuming that the binary system of the exponent or the multiplier is considered and it is divided into groups, the binary system is in excellent condition when the number of groups is small. Each group is generated from a number of 0 that is adjacent to each other. The main idea behind the proposed method is to convert the exponent or the multiplier as the subtraction between two integers. For these integers, it is impossible that the bit which is equal to 1 will be assigned in the same position. The experiment is split into two sections. The first section is an experiment to examine the modular exponentiation. The results demonstrate that the cost of completing the modular multiplication is decreased if the number of groups is very small. In tables 7 - 9, four modular multiplications are required when there is one group, although number of bits which are equal to 0 in each table is different. The second component is the experiment to examine the point multiplication process in Elliptic Curves Cryptography. The findings demonstrate that if the number of groups is small, the costs to compute point additions are low. In tables 10 - 12, assigning one group is appeared, number of point addition is one when the multiplier of a point is an even number. However, three-point additions are required when the multiplier is an odd number. As a result, the proposed method is an alternative way that should be used when the number of groups is minimal in order to save the costs.

• Bulletin of the Korean Chemical Society
• /
• v.14 no.2
• /
• pp.195-200
• /
• 1993

The neutral, reduced, and oxidized 2,2-trans isomers of $Rh_2(ap)_4$ (ap=2-anilinopyridinate) were investigated with respect to dioxygen binding in $CH_2Cl_2$ containing 0.1 M tetrabutyl-ammonium perchlorate. $Rh_2(ap)_4$ binds dioxygen in nonaqueous media and forms a $Rh^{II}Rh^{III}$ superoxide complex, $Rh_2(ap)_4(O_2)$. This neutral species was isolated and is characterized by UV-visible and IR spectroscopy, mass spectrometry and cyclic voltammetry. It can be reduced by one electron at $E_{1/2}$ = -0.45 V vs. SCE in $CH_2Cl_2$ and gives ${[Rh_2(ap)_4(O_2)]}^-$ as demonstrated by the ESR spectrum of a frozen solution taken after controlled potential reduction. The superoxide ion in ${[Rh_2(ap)_4(O_2)]}^-$ is axially bound to one of the two rhodium ions, both of which are in a +2 oxidation state. $Rh_2(ap)_4(O_2)$ can also be stepwise oxidized in two one-electron transfer steps at $E_{1/2}$ = 0.21 V and 0.85 V vs. SCE in $CH_2Cl_2$ and gives ${[Rh_2(ap)_4(O_2)]}^+$ followed by ${[Rh_2(ap)_4(O_2)]}^{2+}$. ESR spectra demonstrate that the singly oxidized complex is best described as ${[Rh^{II}Rh^{III}(ap)_4(O_2)]}^+$ where the odd electron is delocalized on both of the two rhodium ions and the axial ligand is molecular oxygen.

• Journal of English Language & Literature
• /
• v.64 no.4
• /
• pp.565-584
• /
• 2018

The pedagogical dynamic dramatized in Shaw's Pygmalion, which sets man as a distinct pedagogical authority and woman his subject spawning similarly patterned plays many decades later, has been relatively overlooked in the play's criticism clouded by its predominantly mythical theme. Shaw stages Eliza's pedagogical subordination to Higgins followed by her Nora-esque exit with the declaration, "I'll go and be a teacher." The central premise of this article is that the pioneering modern playwright and feminist's pedagogical rewriting of A Doll's House sets out a historical dialogue between Eliza, a new woman who repositions herself as a teacher renouncing her earlier subordinate pedagogical position that is culturally ascribed to women while threatening to replace her paternal teacher, and her immediate precursors, that is, Victorian women teachers whose professional career was socially "anathematized." Through a historical probe into the social status of Victorian women teachers, the article attempts to align their abortive career with Eliza's new womanly re-appropriation of the profession of teaching. With Pygmalion as the starting point of its query, this article conducts a historical survey on the literary representation of pedagogical women from the mid to late Victorian era to the turn of the century. Reading a wide selection of novels and plays alongside of Pygmalion (1912), such as Jane Eyre (1847), A Doll's House (1879), An Enemy of the People (1882), The Odd Women (1893), and The Importance of Being Earnest (1895), it contextualizes Eliza's resolution to be a teacher within the history of female pedagogy. This historical contextualization of the career choice of one of the earliest new women characters in modern drama helps appraise the historical significance of such choice.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.5 no.1
• /
• pp.3-16
• /
• 1995

In this paper, we deal with the cryptographic properties of Boolean functions generated by recursively extended methods from the points of balancedness, nonlinearity and correlation properties. First, we propose a new concept 'Strict Uncorrelated Criterion(SUC)' for two Boolean functions as a necessary condition for constructing Boolean functions of S-box which can be guaranteed to be resistant against Differential cryptanalysis, then we show that the recurively extended Boolean functions with particular form preserve the SUC. We also examine the correlation properties of Boolean functions using Walsh-Hadamard transformations and apply them to discuss nonlinearity, correlation properties and SUC of semi-bent function which is defined over odd dimensional vector space. Finally, we compare semi-bent function with Boolean functions which are generated by other similar recursive methods.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.18 no.3
• /
• pp.155-162
• /
• 2008

In this paper we proposed a video watermarking algorithm based on a three dimension discrete wavelet transform (3D DWT) and direct spread spectrum (DSS). In the proposed method, the information watermark is embedded into followed frames, after sync watermark is embedded into the first frame. Input frames are divided into sub frames which are located odd row and even row. The sub frames are arranged as 3D frames, and transformed into 3D wavelet domain. In this domain the watermark is embedded using DSS. Existing video watermarking using 3D DWT is non-blind method but, proposed algorithm uses blind method. The experimental results show that the proposed algorithm is robust against frame cropping, noise addition, compression, etc. acquiring BER of 10% or below and sustains level of 40dB or above on the average.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.18 no.6A
• /
• pp.3-15
• /
• 2008

In this paper we study exponentiation in finite fields $F{_p}{^{k}}$(k is odd) with very special exponents such as they occur in algorithms for computing square roots. Our algorithmic approach improves the corresponding exponentiation independent of the characteristic of $F{_p}{^{k}}$. To the best of our knowledge, it is the first major improvement to the Tonelli-Shanks algorithm, for example, the number of multiplications can be reduced to at least 60% on average when $p{\equiv}1$ (mod 16). Several numerical examples are given that show the speed-up of the proposed methods.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.11 no.6
• /
• pp.15-26
• /
• 2001

Visual cryptography is a simple method in which secret information can be directly decoded in human visual system without any cryptographic computations. When the secret image is scattered to n random shares(slides), this scheme has some week point such as pixel expansion and contrast degradation. Therefore, it is necessary to reduce the pixel expansion and improve the contrast in recovered image. In this paper, we propose a new construction method for (k, n) visual cryptography using the cumulative matrix. In case k is odd, we can construct the cumulative matrix perfectly. For even k, the contrast of special pair in decoded image can be achieved best by permitting multiple contract. The proposed method is more simple than that of S. Droste\`s in construction and the average contrast of decoded image is improved for the most part. Also, we show that the basis matrices depending on the cumulative matrix are able to be applied for the general access structure.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.25 no.2
• /
• pp.314-319
• /
• 2021

Problems that satisfy various constraints while maintaining weight balance in ships or aircraft were studied. In addition, a study was conducted to solve the problem with a mathematical method under the condition that the shape and weight of the load are the same and the m×n (m and n are all odd) mesh structures. The problem is that the existing mathematical weight balancing method is not suitable for circular structures. In this paper, we studied the load stowing problem in a circular space where objects are loaded at the vertices of N equilateral polygons. Assuming that all N conformal polygons have an even number of angles, it was proved that a loading method that always maintains weight balance regardless of the variety of number of loads. By providing the structure and loading method of the drone loading ship, we showed that our method was appropriate.