• East Asian mathematical journal
• /
• v.27 no.3
• /
• pp.339-348
• /
• 2011

B. C. Berndt [6] has evaluated the transformation formula for a large class of functions that includes and generalizes the classical Dedekind eta-function. In this paper, we consider a twisted version of his formula. Using this transformation formula, we derive modular trans-formation formulas for the generating functions for cranks which were central to deduce K. Mahlburg's results in [11].

• Honam Mathematical Journal
• /
• v.38 no.3
• /
• pp.479-494
• /
• 2016

In this paper, using a transformation formula for a certain series which comes from the generalized non-analytic Eisenstein series, we obtained some infinite series identities which contain Ramanujan's formula and author's previous results.

• Korean Journal of Mathematics
• /
• v.20 no.4
• /
• pp.451-461
• /
• 2012

B.C. Berndt has established many relations between various infinite series using a transformation formula for a large class of functions, which comes from a more general class of Eisenstein series. In this paper, continuing his study, we find some infinite series identities.

• Korean Journal of Mathematics
• /
• v.30 no.1
• /
• pp.25-42
• /
• 2022

In this paper, we derive analogues of a couple of classes of infinite series identities with the confluent hypergeometric functions involving Dirichlet characters.

• Journal of the Korea Society for Simulation
• /
• v.11 no.2
• /
• pp.77-88
• /
• 2002

Petri nets is a widely used formalism for specification and analysis of concurrent systems which is a subclass of discrete event systems. The DEVS (Discrete Event System Specification) formalism provides a general framework for specification of discrete event systems in a hierarchical, modular form. Often, modeling a discrete event system may employ both Petri Nets and DEVS formalism. In such a case low-level operational logics are modeled by Petri Nets and high-level managements by the DEVS formalism. Analysis of the system requires simulation of the overall system. This paper presents an algorithm for transformation of Petri Nets to DEVS formalism. The transformation enables modelers to simulate an overall system, which consists of DEVS models and Petri Nets models, in a unified DEVS simulation environment such as DEVSim++. An example for such transformation will be given.

• Honam Mathematical Journal
• /
• v.39 no.4
• /
• pp.561-568
• /
• 2017

Hurwitz zeta function occurs in various parts of mathematics. In particular, it plays an important role in some area of number theory. In this paper, using a certain transformation formula, we find some identities of relations between ${\zeta}(2n+1)$ and ${\zeta}(2n+1,{\alpha})$ for special values of ${\alpha}$.

• Korean Journal of Construction Engineering and Management
• /
• v.18 no.3
• /
• pp.33-41
• /
• 2017

A modular specification is a contract document that specifies the requirements of production, transformation and installation in a modular construction. A problem of the currently used specification is that it does not guarantee the level of performance required by the modular construction and fails to accommodate unique characteristics of each construction because it widely uses the standard specification as it is. This study proposes a specification that reflects the unique feature of modular construction in order to improve the quality of modular construction. Research focuses on the leakage in waterproof and mechanical equipment because it is the area with the highest rate of defects. This study suggests ways to improve the modular specification as follows: 1)Descriptive specifying (following MasterFormat) 2)Propose leakage verification method and test clause 3) Reflect characteristic of modular construction. Proposed modifications to modular specification are reviewed by experts for validation and their opinion verifies suggested improvements as a way to secure the quality of modular construction and to promise characteristics of the modular specification. This improvement will be used for reference when writing construction project specification, which can be an important contract document, so that it could lower occurrence rate of the modular defects.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.10a
• /
• pp.732-735
• /
• 2008

In order for fast calculation for the modular multiplication which plays an essential role in RSA cryptography algorithm, the Montgomery algorithm has been studed and developed in varous ways. Since there is no division operation in the algorithm, it is able to perform a fast modular multiplication. However, the Montgomery algorithm requires a few extra operations in the progress of which transformation from/to ordinary modular form to/from Montgomery form should be made. Concept of high radix operation can be considered by splitting the key size into word-defined units in the RSA cryptosystems which use longer than 1024 key bits. In this paper, We adopted the concept of operand scanning methods to enhance the traditional Montgomery algorithm. The methods consider issues of optimization, memory usage, and calculation time.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.25 no.8
• /
• pp.122-131
• /
• 2011

In this paper, the design and analysis of a reconfigurable modular structure, which reforms itself according to the change of the environment and realize appropriate forms and motions, are dealt with. This modular is a free structure from the restrictions with constraints about fixed environment and has various forms and motions by combining units. The form of this unit has a shape of a square with 7 centimeters side each, and has a structure which can be combined in a chain-shape or a lattice-shape. Additionally, The structure has a mobility by being equipped with wheels so that it can be combined for itself. In this paper, all the wireless controllers, sensor system, and communicating method between modules according to module structures were suggested and transformation method to be transformed to shape of snakes, caterpillars were presented. Moreover, simulations for each method were performed to show the validity of the motions including motor torque analysis. All the motions suggested were realized and experimented, whereby the availability of the designed mechanism and algorithm was verified with the result of experiments.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.18 no.1
• /
• pp.41-47
• /
• 2008

This paper presents a new digit level LSB-first multiplier for computing a modular multiplication and a modular squaring simultaneously over finite field GF($2^m$). To derive $L{\times}L$ digit level architecture when digit size is set to L, the previous algorithm is used and index transformation and merging the cell of the architecture are proposed. The proposed architecture can be utilized for the basic architecture for the crypto-processor and it is well suited to VLSI implementation because of its simplicity, regularity, and concurrency.