• Journal of applied mathematics & informatics
• /
• v.27 no.1_2
• /
• pp.105-121
• /
• 2009

In this paper we will be interested in characterizing and computing matrices $X\;{\in}\;C^{n{\times}n}$ that satisfy $e^X$ = A, that is logarithms of A. The study in this work goes through two lines. The first is concerned with a theoretical study of the solution set, S(A), of $e^X$ = A. Along the second line computational approaches are considered to compute the principal logarithm of A, LogA.

• Journal of the Korean Mathematical Society
• /
• v.52 no.4
• /
• pp.797-819
• /
• 2015

A trapdoor discrete logarithm group is a cryptographic primitive with many applications, and an algorithm that allows discrete logarithm problems to be solved faster using a pre-computed table increases the practicality of using this primitive. Currently, the distinguished point method and one extension to this algorithm are the only pre-computation aided discrete logarithm problem solving algorithms appearing in the related literature. This work investigates the possibility of adopting other pre-computation matrix structures that were originally designed for used with cryptanalytic time memory tradeoff algorithms to work as pre-computation aided discrete logarithm problem solving algorithms. We find that the classical Hellman matrix structure leads to an algorithm that has performance advantages over the two existing algorithms.

• Journal of Multimedia Information System
• /
• v.8 no.1
• /
• pp.45-56
• /
• 2021

This document traces the new technologies development based on a deep classical Hill method improvement. Based on the chaos, this improvement begins with the 256 element body construction, which is to replace the classic ring used by all encryption systems. In order to facilitate the application of algebraic operators on the pixels, two substitution tables will be created, the first represents the discrete logarithm, while the second represents the discrete exponential. At the same time, a large invertible matrix whose structure will be explained in detail will be the subject of the advanced classical Hill technique improvement. To eliminate any linearity, this matrix will be accompanied by dynamic vectors to install an affine transformation. The simulation of a large number of images of different sizes and formats checked by our algorithm ensures the robustness of our method.

• Korea-Australia Rheology Journal
• /
• v.16 no.4
• /
• pp.183-191
• /
• 2004

High Deborah or Weissenberg number problems in viscoelastic flow modeling have been known formidably difficult even in the inertialess limit. There exists almost no result that shows satisfactory accuracy and proper mesh convergence at the same time. However recently, quite a breakthrough seems to have been made in this field of computational rheology. So called matrix-logarithm (here we name it tensor-logarithm) formulation of the viscoelastic constitutive equations originally written in terms of the conformation tensor has been suggested by Fattal and Kupferman (2004) and its finite element implementation has been first presented by Hulsen (2004). Both the works have reported almost unbounded convergence limit in solving two benchmark problems. This new formulation incorporates proper polynomial interpolations of the log­arithm for the variables that exhibit steep exponential dependence near stagnation points, and it also strictly preserves the positive definiteness of the conformation tensor. In this study, we present an alternative pro­cedure for deriving the tensor-logarithmic representation of the differential constitutive equations and pro­vide a numerical example with the Leonov model in 4:1 planar contraction flows. Dramatic improvement of the computational algorithm with stable convergence has been demonstrated and it seems that there exists appropriate mesh convergence even though this conclusion requires further study. It is thought that this new formalism will work only for a few differential constitutive equations proven globally stable. Thus the math­ematical stability criteria perhaps play an important role on the choice and development of the suitable con­stitutive equations. In this respect, the Leonov viscoelastic model is quite feasible and becomes more essential since it has been proven globally stable and it offers the simplest form in the tensor-logarithmic formulation.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.16 no.6
• /
• pp.319-327
• /
• 2016

In this paper we investigate that most of plants and animals have the symmetric property, such as a tree or a sheep's horn. In addition, the human body is also symmetric and contains the DNA. We can see the logarithm helices in Fibonacci series and animals, and helices of plants. The sunflower has a shape of circle. A circle is circular symmetric because the shapes are same when it is shifted on the center. Einstein's spatial relativity is the relation of time and space conversion by the symmetrically generalization of time and space conversion over the spacial. The left and right helices of plants and animals are the symmetric and have element-wise inverse relationships each other. The weight of center weight Hadamard matrix is 2 and is same as the base 2 of natural logarithm. The helix matrices are symmetric and have element-wise inverses.

• Korean Journal of Materials Research
• /
• v.21 no.9
• /
• pp.477-481
• /
• 2011

Composites of insulating polyethylene and carbon black are widely used in switching elements, conductive paint, and other applications due to the large gap of resistance value. This research addresses the critical exponent of dielectric breakdown strength of polymer matrix composites (PMC) made with carbon black and polyethylene below the percolation threshold (Pt) for the first time. Here, Pt means the volume fraction of carbon black of which the resistance of the PMC is transferred from its sharp decrease to gradual decrease in accordance with the increase of carbon-black-filled content. First, the Pt is determined based on the critical exponents of resistivity and relative permittivity. Although huge cohesive bodies of carbon black are formed in case of being less than the Pt, a percolation path connecting the conducting phases is not formed. The dielectric breakdown strength (Dbs) of the PMC below Pt is measured by using an impulse voltage in the range from 10 kV to 40 kV to avoid the effect of joule heating. Although the observed Dbs data seems to be well fitted to a straight line with a slope of 0.9 on a double logarithm of (Pt-$V_{CB}$) and Dbs, the least squares method gives a slope of 0.97 for the PMC. It has been found that finite carbon-black clusters play an important role in dielectric breakdown.

• Wind and Structures
• /
• v.10 no.1
• /
• pp.61-82
• /
• 2007

This paper presents a novel finite element (FE) model for analyzing coupled flutter of long-span bridges using the commercial FE package ANSYS. This model utilizes a specific user-defined element Matrix27 in ANSYS to model the aeroelastic forces acting on the bridge, wherein the stiffness and damping matrices are expressed in terms of the reduced wind velocity and flutter derivatives. Making use of this FE model, damped complex eigenvalue analysis is carried out to determine the complex eigenvalues, of which the real part is the logarithm decay rate and the imaginary part is the damped vibration frequency. The condition for onset of flutter instability becomes that, at a certain wind velocity, the structural system incorporating fictitious Matrix27 elements has a complex eigenvalue with zero or near-zero real part, with the imaginary part of this eigenvalue being the flutter frequency. Case studies are provided to validate the developed procedure as well as to demonstrate the flutter analysis of cable-supported bridges using ANSYS. The proposed method enables the bridge designers and engineering practitioners to analyze flutter instability by using the commercial FE package ANSYS.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.6
• /
• pp.1627-1648
• /
• 2012

We propose an adaptive method for detecting plagiarized pairs from a large set of source code. This method is adaptive in that it uses an adaptive algorithm and it provides an adaptive threshold for determining plagiarism. Conventional algorithms are based on greedy string tiling or on local alignments of two code strings. However, most of them are not adaptive; they do not consider the characteristics of the program set, thereby causing a problem for a program set in which all the programs are inherently similar. We propose adaptive local alignment-a variant of local alignment that uses an adaptive similarity matrix. Each entry of this matrix is the logarithm of the probabilities of the keywords based on their frequency in a given program set. We also propose an adaptive threshold based on the local outlier factor (LOF), which represents the likelihood of an entity being an outlier. Experimental results indicate that our method is more sensitive than JPlag, which uses greedy string tiling for detecting plagiarism-suspected code pairs. Further, the adaptive threshold based on the LOF is shown to be effective, and the detection performance shows high sensitivity with negligible loss of specificity, compared with that using a fixed threshold.

• Journal of KIISE:Software and Applications
• /
• v.33 no.12
• /
• pp.1090-1102
• /
• 2006

This paper suggests a new algorithm for detecting the plagiarism among a set of source codes, constrained to be functionally equivalent, such are submitted for a programming assignment or for a programming contest problem. The typical algorithms largely exploited up to now are based on Greedy-String Tiling, which seeks for a perfect match of substrings, and analysis of similarity between strings based on the local alignment of the two strings. This paper introduces a new method for detecting the similar interval of the given programs based on an adaptive similarity matrix, each entry of which is the logarithm of the probabilities of the keywords based on the frequencies of them in the given set of programs. We experimented this method using a set of programs submitted for more than 10 real programming contests. According to the experimental results, we can find several advantages of this method compared to the previous one which uses fixed similarity matrix(+1 for match, -1 for mismatch, -2 for gap) and also can find that the adaptive similarity matrix can be used for detecting various plagiarism cases.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.12
• /
• pp.6116-6132
• /
• 2017

The proxy re-encryption allows an intermediate proxy to convert a ciphertext for Alice into a ciphertext for Bob without seeing the original message and leaking out relevant information. Unlike many prior identity based proxy re-encryption schemes which are based on the number theoretic assumptions such as large integer factorization and discrete logarithm problem. In this paper, we first propose a novel identity based proxy re-encryption scheme which is based on the hardness of standard Learning With Error(LWE) problem and is CPA secure in the standard model. This scheme can be reduced to the worst-case lattice hard problem that is able to resist attacks from quantum algorithm. The key step in our construction is that the challenger how to answer the private query under a known trapdoor matrix. Our scheme enjoys properties of the non-interactivity, unidirectionality, anonymous and so on. In this paper, we utilize primitives include G-trapdoor for lattice and sample algorithms to realize simple and efficient re-encryption.