• Textile Coloration and Finishing
• /
• v.18 no.4
• /
• pp.43-48
• /
• 2006

A phthalocyanine reactive dye was applied to nylon fibers to study the effects of the temperature and pH on % exhaustion and fixation. In addition, appropriate predictable empirical models, relatively new approaches in dyeing process, were developed incorporating interactions effects of temperature and pH for predicting the both % exhaustion and fixation. The significance of the mathematical model developed was ascertained using Excel regression (solver) analysis module. A very high correlation coefficient was obtained ($R^2=0.9895$ for % exhaustion, $R^2=0.9932$ for fixation) for the model which shows prominent prediction capacity of the model for the unknown conditions. The predictable polynomial equations developed from the Experimental results were thoroughly analyzed by ANOVA (Analysis of Variance) statistical concepts.

• Textile Coloration and Finishing
• /
• v.21 no.5
• /
• pp.41-50
• /
• 2009

Design of experiments (DoE) concept was successfully applied to determine the optimum processing conditions that yield maximum % exhaustion for berberine interaction with synthetic tanning agent pretreated polyamide substrates. The potential of synthetic tanning agent to provide anionic sites on the polyamide for berberine interaction which is cationic in nature was tested to increase the % exhaustion of berberine in this article. Experiments were designed according to Central Composite Rotatable Design (CCRD). The three factors for synthetic tanning agent pretreatment and two factors for berberine interaction each at five different levels, including central and axial points were considered. Experiments were conducted in a laboratory scale infra-red treatment instrument according to CCRD. For each response, second order polynomial models were developed using multiple linear regression analysis incorporating linear, interactions and squared effects of all variables and then optimized. The significance of the mathematical model developed was ascertained using Excel regression (solver) analysis module. Analysis of variance (ANOVA) was performed to check the adequacy and accuracy of the fitted models. The response surfaces and contour maps showing the interaction of process variables were constructed. Applying Monte Carlo simulation, response surface and contour plots, optimum operating conditions were found and at this optimum point, % exhaustion of 81% and 74% respectively for synthetic tanning agent pretreatment and berberine interaction were observed and subsequently the results were experimentally investigated.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.1
• /
• pp.225-231
• /
• 2013

In this study, we propose the design of optimized pRBFNNs-based night vision face recognition system using PCA algorithm. It is difficalt to obtain images using CCD camera due to low brightness under surround condition without lighting. The quality of the images distorted by low illuminance is improved by using night vision camera and histogram equalization. Ada-Boost algorithm also is used for the detection of face image between face and non-face image area. The dimension of the obtained image data is reduced to low dimension using PCA method. Also we introduce the pRBFNNs as recognition module. The proposed pRBFNNs consists of three functional modules such as the condition part, the conclusion part, and the inference part. In the condition part of fuzzy rules, input space is partitioned by using Fuzzy C-Means clustering. In the conclusion part of rules, the connection weights of pRBFNNs is represented as three kinds of polynomials such as linear, quadratic, and modified quadratic. The essential design parameters of the networks are optimized by means of Differential Evolution.

• Textile Coloration and Finishing
• /
• v.19 no.2
• /
• pp.14-23
• /
• 2007

This research article explores the use of phthalocyanine reactive dye on nylon substrate. The effect of factors such as pH, temperature, liquor ratio and alkali addition on level of dye exhaustion, fixation and total fixation efficiency. Low pH, high temperature and low liquor ratio were found to be suitable conditions for maximum % exhaustion values. The effect of sulphatoethylsulphone(SES) and vinylsulphone(VS) form of the dyes on level of dye fixation was also discussed. The optimized exhaustion (%E), fixation(%F) and total fixation efficiency were determined. Modification of the dyeing process with alkali addition displayed that dye fixation(%) increased by alkali addition. Vinylsulphone(VS) moiety of the dye was found to be superior to. maximum fixation (%F). Appropriate predictable empirical models, relatively a new approach in dyeing processes, were developed incorporating interactions effects of temperature, pH and liquor ratio for predicting % exhaustion, fixation and total fixation efficiency. The significance of the mathematical model developed was ascertained using microsoft excel regression(solver) analysis module. High correlation coefficient was obtained (R2=0.9895 for % exhaustion, R2=0.9932 for fixation, R2=0.9965 for total fixation efficiency) for the model which shows prominent prediction capacity of the model for my conditions. The predictable polynomial equations developed from tile experimental results were thoroughly analyzed by ANOVA (Analysis of Variance) statistical concepts.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.2
• /
• pp.504-521
• /
• 2016

Recently, energy harvesting technology has been integrated into wireless sensor networks to ameliorate the nodes' energy limitation problem. In theory, the wireless sensor node equipped with an energy harvesting module can work permanently until hardware failures happen. However, due to the change of power supply, the traditional hierarchical network routing protocol can not be effectively adopted in energy harvesting wireless sensor networks. In this paper, we improve the Low-Energy Adaptive Clustering Hierarchy (LEACH) protocol to make it suitable for the energy harvesting wireless sensor networks. Specifically, the cluster heads are selected according to the estimation of nodes' harvested energy and consumed energy. Preference is given to the nodes with high harvested energy while taking the energy consumption rate into account. The utilization of harvested energy is mathematically formulated as a max-min optimization problem which maximizes the minimum energy conservation of each node. We have proved that maximizing the minimum energy conservation is an NP-hard problem theoretically. Thus, a polynomial time algorithm has been proposed to derive the near-optimal performance. Extensive simulation results show that our proposed routing scheme outperforms previous works in terms of energy conservation and balanced distribution.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.24 no.6
• /
• pp.586-591
• /
• 2014

In this study, we introduce Radial Basis Function Neural Networks(RBFNNs) classifier using Artificial Bee Colony(ABC) algorithm in order to classify between precipitation event and non-precipitation event from given radar data. Input information data is rebuilt up through feature analysis of meteorological radar data used in Korea Meteorological Administration. In the condition phase of the proposed classifier, the values of fitness are obtained by using Fuzzy C-Mean clustering method, and the coefficients of polynomial function used in the conclusion phase are estimated by least square method. In the aggregation phase, the final output is obtained by using fuzzy inference method. The performance results of the proposed classifier are compared and analyzed by considering both QC(Quality control) data and CZ(corrected reflectivity) data being used in Korea Meteorological Administration.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.3
• /
• pp.510-520
• /
• 2011

In this paper, we propose a new multiplication algorithm for primitive polynomial with all 1 of coefficient in case that m is odd and even on finite fields $GF(3^m)$, and compose the multiplier with parallel input-output module structure using the presented multiplication algorithm. The proposed multiplier is designed $(m+1)^2$ same basic cells that have a mod(3) addition gate and a mod(3) multiplication gate. Since the basic cells have no a latch circuit, the multiplicative circuit is very simple and is short the delay time $T_A+T_X$ per cell unit. The proposed multiplier is easy to extend the circuit with large m having regularity and modularity by cell array, and is suitable to the implementation of VLSI circuit.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.28 no.1
• /
• pp.73-83
• /
• 2018

There has been increasing interest from NIST and other companies in studying post-quantum cryptography in order to resist against quantum computers. Multivariate polynomial based, code based, lattice based, hash based digital signature, and isogeny based cryptosystems are one of the main categories in post quantum cryptography. Among these categories, isogeny based cryptosystem is known to have shortest key length. In this paper, we implemented Supersingular Isogeny Diffie-Hellman (SIDH) protocol efficiently on low-end mobile device. Considering the device's specification, we select supersingular curve on 523 bit prime field, and generate efficient isogeny computation tree. Our implementation of SIDH module is targeted for 32bit environment.

• Journal of the Korean Mathematical Society
• /
• v.58 no.3
• /
• pp.643-702
• /
• 2021

Fix ℤ/2 is the prime field of two elements and write 𝒜₂ for the mod 2 Steenrod algebra. Denote by GL_d := GL(d, ℤ/2) the general linear group of rank d over ℤ/2 and by ${\mathfrak{P}}_d$ the polynomial algebra ℤ/2[x₁, x₂, …, x_d] as a connected unstable 𝒜₂-module on d generators of degree one. We study the Peterson "hit problem" of finding the minimal set of 𝒜₂-generators for ${\mathfrak{P}}_d$. Equivalently, we need to determine a basis for the ℤ/2-vector space $$Q{\mathfrak{P}}_d:={\mathbb{Z}}/2{\otimes}_{\mathcal{A}_2}\;{\mathfrak{P}}_d{\sim_=}{\mathfrak{P}}_d/{\mathcal{A}}^+_2{\mathfrak{P}}_d$$ in each degree n ≥ 1. Note that this space is a representation of GL_d over ℤ/2. The problem for d = 5 is not yet completely solved, and unknown in general. In this work, we give an explicit solution to the hit problem of five variables in the generic degree n = r(2^t - 1) + 2^ts with r = d = 5, s = 8 and t an arbitrary non-negative integer. An application of this study to the cases t = 0 and t = 1 shows that the Singer algebraic transfer of rank 5 is an isomorphism in the bidegrees (5, 5 + (13.2⁰ - 5)) and (5, 5 + (13.2¹ - 5)). Moreover, the result when t ≥ 2 was also discussed. Here, the Singer transfer of rank d is a ℤ/2-algebra homomorphism from GL_d-coinvariants of certain subspaces of $Q{\mathfrak{P}}_d$ to the cohomology groups of the Steenrod algebra, $Ext^{d,d+*}_{\mathcal{A}_2}$ (ℤ/2, ℤ/2). It is one of the useful tools for studying these mysterious Ext groups.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.3
• /
• pp.59-67
• /
• 2013

Reed-Solomon (RS) codes are powerful error-correcting codes used in diverse applications. Recently, algebraic soft-decision decoding algorithm for RS codes that can correct the errors beyond the error correcting bound has been proposed. The algorithm requires very intensive computations for interpolation, therefore an efficient VLSI architecture, which is realizable in hardware with a moderate hardware complexity, is mandatory for various applications. In this paper, we propose an efficient architecture with low hardware complexity for interpolation in soft-decision list decoding of Reed-Solomon codes. The proposed architecture processes the candidate polynomial in such a way that the terms of X degrees are processed in serial and the terms of Y degrees are processed in parallel. The processing order of candidate polynomials adaptively changes to increase the efficiency of memory access for coefficients; this minimizes the internal registers and the number of memory accesses and simplifies the memory structure by combining and storing data in memory. Also, the proposed architecture shows high hardware efficiency, since each module is balanced in terms of latency and the modules are maximally overlapped in schedule. The proposed interpolation architecture for the (255, 239) RS list decoder is designed and synthesized using the DongbuHitek $0.18{\mu}m$ standard cell library, the number of gate counts is 25.1K and the maximum operating frequency is 200 MHz.