• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.771-774
• /
• 1998

In this paper proposes a new bit-parallel structure for a multiplier over GF((Pn)m), with k-nm. Mastrovito Multiplier, Karatsuba-ofman algorithm are applied to the multiplication of polynomials over GF(2n). This operation has a complexity of order O(k log p3) under certain constrains regardig k. A complete set of primitive field polynomials for composite fields is provided which perform modulo reduction with low complexity. As a result, multiplier for fields GF(Pk) with low gate counts and low delays are constructed. The architectures are highly modular and thus well suited for VLSI implementation.

• Microbiology and Biotechnology Letters
• /
• v.17 no.2
• /
• pp.121-125
• /
• 1989

Actinomycetes GF 155-2, which produced an extracellular pepsin inhibitor, was isolated from soil samples. Optimal conditions of inhibitor production by flask-shacking culture were 2% glucose, 0.7% polypeptone, initial pH 1.0, culture time 60 hours and temperature 30%. Effect of in-organic salts was not observed. About 5mg of colorless crystalline inhibitor was obtained from 5L culture broth in jar tormentor by means of ammonium sulfate precipitation, methanol extraction, and column chromatographies on Amberlite IR-120, XAD-2 and silicagel 60.

• Proceedings of the KIEE Conference
• /
• 1987.07b
• /
• pp.1191-1194
• /
• 1987

This paper presents a method for computing the powers and inverse of an element in GF($2^m$). This method is based on the squaring algorithm $A^2=\sum\limits_{i=0}^{2m-2}P_i$, where $Pi={\alpha}_{i/2}$ if i is even, Pi=0 otherwise, derived from the multiplication algorithm for two elements in GF($2^m$). The powers and inverses in GF($2^m$) for m=2, 3, 4,5 were obtained using computer program, and used in circuit realization of Galois switching function. The squaring and inverse generating circuits are also shown.

• The KIPS Transactions:PartA
• /
• v.9A no.3
• /
• pp.271-280
• /
• 2002

In this paper, the input-output interconnection method of the multiple-valued signal processing circuit using Perfect Shuffle technique and Kronecker product is discussed. Using this method, the circuit design method of the multiple-valued Reed-Muller Expansions (MRME) which can process the multiple-valued signal easily on finite fields GF$(p^m)$ is presented. The proposed input-output interconnection methods show that the matrix transform is an efficient and the structures are modular. The circuits of multiple-valued signal processing of MRME on GF$(p^m)$ design the basic cells to implement the transform and inverse transform matrix of MRME by using two basic gates on GF(3) and interconnect these cells by the input-output interconnection technique of the multiple-valued signal processing circuits. The proposed multiple-valued signal processing circuits that are simple and regular for wire routing and possess the properties of concurrency and modularity are suitable for VLSI.

• Journal of the Microelectronics and Packaging Society
• /
• v.24 no.2
• /
• pp.69-74
• /
• 2017

Effect of post-annealing treatment times at $200^{\circ}C$ on the peel strength of screen-printed Ag film/polyimide substrate were systematically investigated by $180^{\circ}$ peel test for thermal reliability assessment of printed interconnect. Initial peel strength around 16.7 gf/mm increased up to 29.4 gf/mm after annealing for 24hours, and then sharply decreased to 22.3, 3.6, 0.6, and 0.1 gf/mm after 48, 100, 250, and 500 hours, respectively. Ag-O-C chemical bonding as well as binder organic bridges formations seemed to be responsible for interfacial adhesion improvement after the initial annealing treatment, while excessive Cu oxide formation at Cu/Ag interface seems to be closely related to sharp decrease in peel strength for longer annealing times.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.3
• /
• pp.628-636
• /
• 2010

In this paper, we present a new type high speed parallel multiplier for performing the multiplication of two polynomials using standard basis in the finite fields GF($2^m$). Prior to construct the multiplier circuits, we design the basic cell of vector code generator(VCG) to perform the parallel multiplication of a multiplicand polynomial with a irreducible polynomial and design the partial product result cell(PPC) to generate the result of bit-parallel multiplication with one coefficient of a multiplicative polynomial with VCG circuits. The presented multiplier performs high speed parallel multiplication to connect PPC with VCG. The basic cell of VCG and PPC consists of one AND gate and one XOR gate respectively. Extending this process, we show the design of the generalized circuits for degree m and a simple example of constructing the multiplier circuit over finite fields GF($2^4$). Also, the presented multiplier is simulated by PSpice. The multiplier presented in this paper uses the VCGs and PPCS repeatedly, and is easy to extend the multiplication of two polynomials in the finite fields with very large degree m, and is suitable to VLSL.

• Journal of Environmental Health Sciences
• /
• v.45 no.3
• /
• pp.258-266
• /
• 2019

Objectives: In this study, blood lead was analyzed using graphite furnace atomic absorption spectrometry (GF-AAs) and inductively coupled plasma mass spectrometry (ICP-MS). We tried to examine the difference and consistency of the analytical values and the applicability of the analytical method. Methods: We selected 57 people who agreed to participate in this study. After confirming the linearity of the calibration standard curves in GF-AAs and ICP-MS, the concentrations of lead in quality control material and samples were measured, and the degree of agreement was compared. Results: The detection limit of the ICP-MS was lower than that of GF-AAs. The coefficient of variation of reference materials was shown to be stable in the ICP-MS and GF-AAs. When the correspondence between the two equipments was verified by bias of the analysis values, a concordance was shown, and approximately 98% of the ideal reference lines were present within ${\pm}40%$ of the deflection. Conclusion: GF-AAs showed high sensitivity to single heavy metal analysis, but it took much time and showed higher detection limit than ICP-MS. Therefore, it would be considered necessary to switch to ICP-MS analysis method, considering that the level of lead exposure is gradually decreasing.

• Journal of the Korean Society of Fisheries and Ocean Technology
• /
• v.47 no.3
• /
• pp.267-272
• /
• 2011

The behavior of abrasive wear on counterpart roughness of glass fiber reinforcement polyurethane resin (GF/PUR) composites were investigated at ambient temperature by pin-on-disc friction test. The friction coefficient, cumulative wear volume and surface roughness of these materials against SiC abrasive paper were determined experimentally. The major failure mechanisms were lapping layers, ploughing, delamination, deformation of resin and cracking by scanning electric microscopy (SEM) photograph of the tested surface. As increasing the counterpart roughness the GF/PUR composites indicated higher friction coefficient. The surface roughness of the GF/PUR composites was increased as the sliding velocity was higher and the counterpart roughness was rougher in wear test.

• Proceedings of the PSK Conference
• /
• 2003.10b
• /
• pp.129.2-129.2
• /
• 2003

Antitumor and immunomodulatory activities of an aqueous extract (GF100) of Acanthopanax senticosus was examined. In experimental lung metastasis of colon26-M3.l carcinoma cells, intravenous (i.v.) administration of GF100 2 days before tumor inoculation significantly inhibited lung metastasis in a dose-dependant manner. The i.v. administration of GF100 also exhibited the therapeutic effect on tumor metastasis of colon26-M3.1 cells, when it was injected 1 day after tumor inoculation. In an in vitro cytotoxicity analysis, GF100 enhanced the responsiveness to a mitogen, concanavalin A (ConA), of splenocytes in a dose-dependent manner. (omitted)

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.40 no.3
• /
• pp.145-151
• /
• 2003

This study focuses on the hardware implementation of fast and low-complexity multiplier over GF(2$^{m}$ ). Finite field multiplication can be realized in two steps: polynomial multiplication and modular reduction using the irreducible polynomial and we will treat both operation, separately. Polynomial multiplicative operation in this Paper is based on the Permestzi's algorithm, and irreducible polynomial is defined AOP. The realization of the proposed GF(2$^{m}$ ) multipleker-based multiplier scheme is compared to existing multiplier designs in terms of circuit complexity and operation delay time. Proposed multiplier obtained have low circuit complexity and delay time, and the interconnections of the circuit are regular, well-suited for VLSI realization.