• Journal of the Korean Society for Precision Engineering
• /
• v.20 no.6
• /
• pp.62-70
• /
• 2003

This paper deals with a approximation and tracking control of hydraulic servo system using a real time recurrent neural networks (RTRN) with 2-dimensional iterative learning rule. And it was driven that 2-dimensional iterative learning rule in discrete time. In order to control the trajectory of position, two RTRN with same network architecture were used. Simulation results show that two RTRN using 2-D learning algorithm is able to approximate the plant output and desired trajectory to a very high degree of a accuracy respectively and the control algorithm using two same RTRN was very effective to control trajectory tracking of electro-hydraulic servo system.

• Design & Manufacturing
• /
• v.16 no.3
• /
• pp.34-38
• /
• 2022

Regular expression pattern matching is widely used in applications such as computer virus vaccine, NIDS and DNA sequencing analysis. Hardware-based pattern matching is used when high-performance processing is required due to time constraints. ReCPU, SMPU, and REMP, which are processor-based regular expression matching processors, have been proposed to solve the problem of the hardware-based method that requires resynthesis whenever a pattern is updated. However, these processor-based regular expression matching processors inefficiently handle repetitive operations of regular expressions. In this paper, we propose a new instruction set to improve the inefficient repetitive operations of ReCPU and SMPU. We propose REMPi, a regular expression matching processor that enables efficient iterative operations based on the REMP instruction set. REMPi improves the inefficient method of processing a particularly short sub-pattern as a repeat operation OR, and enables processing with a single instruction. In addition, by using a down counter and a counter stack, nested iterative operations are also efficiently processed. REMPi was described with Verilog and synthesized on Intel Stratix IV FPGA.

• Structural Engineering and Mechanics
• /
• v.30 no.2
• /
• pp.165-176
• /
• 2008

In this paper, a new iterative method for solving vehicle-bridge interaction problems is proposed. Iterative methods have advantages over the non-iterative methods in that it is not necessary to update the system matrix for a given wheel location, and the method can be applied for a new type of car or bridge with few or no modifications. In the proposed method, the necessity of system matrices update is eliminated using the equivalent interaction force acting on the bridge, which is obtained iteratively. Ballast stiffness is included in the interaction forces and the geometric compatibility at the contact points are used as convergence criteria. The bridge is considered as an elastic Bernoulli-Euler beam with surface irregularity and ballast stiffness. The moving vehicle is modeled as a multi-axle mass-spring-damper system having many degrees of freedom depending on the number of axles. The pitching effect, which is the interaction effect between the rear and front wheels when a vehicle begins to enter or leave the bridge, is also considered in the formulation including extended ground boundaries having surface irregularity and ballast stiffness. The applicability of the proposed method is illustrated in the numerical studies.

• Macromolecular Research
• /
• v.14 no.3
• /
• pp.287-299
• /
• 2006

To successively synthesize star-branched polymers, we developed a new iterative methodology which involves only two sets of the reactions in each iterative process: (a) an addition reaction of DPE or DPE-functionalized polymer to a living anionic polymer, and (b) an in-situ reaction of 1-(4-(4-bromobutyl)phenyl)-1-phenylethylene with the generated 1,1-diphenylalkyl anion to introduce one DPE functionality. With this methodology, 3-, 4-, and 5-arm, regular star-branched polystyrenes, as well as 3-arm ABC, 4-arm ABCD, and a new 5-arm ABCDE, asymmetric star-branched polymers, were successively synthesized. The A, B, C, D, and E arm segments were poly(4-trimethylsilylstyrene), poly(4-methoxystyrene), poly(4-methylstyrene), polystyrene, and poly(4-tert-butyldimethylsilyloxystyrene), respectively. All of the resulting star-branched polymers were well-defined in architecture and precisely controlled in chain length, as confirmed by SEC, $^1H$ NMR, VPO, and SLS analyses. Furthermore, we extended the iterative methodology by the use of a new functionalized DPE derivative, 1-(3-chloromethylphenyl)-1-((3-(1-phonyletheny1)phenyl) ethylene, capable of introducing two DPE functionalities via one DPE anion reaction site in the reaction (b). The number of arm segments of the star-branched polymer synthesized by the methodology could be dramatically increased to 2, 6, and up to 14 by repeating the iterative process.

• The KIPS Transactions:PartC
• /
• v.17C no.2
• /
• pp.145-152
• /
• 2010

In this paper, we first propose a fast division algorithm in GF($2^{163}$) using standard basis representation, and then it is mapped into divider for GF($2^{163}$) with iterative hardware structure. The proposed algorithm is based on the binary ExtendedGCD algorithm, and the arithmetic operations for modular reduction are performed within only one "while-statement" unlike conventional approach which uses two "while-statement". In this paper, we use reduction polynomial $f(x)=x^{163}+x^7+x^6+x^3+1$ that is recommended in SEC2(Standards for Efficient Cryptography) using standard basis representation, where degree m = 163. We also have implemented the proposed iterative architecture in FPGA using Verilog HDL, and it operates at a clock frequency of 85 MHz on Xilinx-VirtexII XC2V8000 FPGA device. From implementation results, we will show that computation speed of the proposed scheme is significantly improved than the existing two approaches.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.7
• /
• pp.140-148
• /
• 2013

This paper presents a iterative Bose-Chaudhuri-hocquenghem (i-BCH) code and its high-speed decoder architecture for 100 Gb/s optical communications. The proposed architecture features a very high data processing rate as well as excellent error correction capability. The proposed 6-iteration i-BCH code structure with interleaving method allows the decoder to achieve 9.34 dB net coding gain performance at $10^{-15}$ decoder output bit error rate to compensate for serious transmission quality degradation. The proposed high-speed i-BCH decoder architecture is synthesized using a 90-nm CMOS technology. It can operate at a clock frequency of 430 MHz and achieve a data processing rate of 100 Gb/s. Thus, it has potential applications in next generation forward error correction (FEC) schemes for 100 Gb/s optical communications.

• Structural Engineering and Mechanics
• /
• v.56 no.4
• /
• pp.549-567
• /
• 2015

A first-order moment method (FORM) reliability analysis is commonly used for structural stability analysis. It requires the values and partial derivatives of the performance to function with respect to the random variables for the design. These calculations can be cumbersome when the performance functions are implicit. A Gaussian process (GP)-based response surface is adopted in this study to approximate the limit state function. By using a trained GP model, a large number of values and partial derivatives of the performance functions can be obtained for conventional reliability analysis with a FORM, thereby reducing the number of stability analysis calculations. This dynamic renewed knowledge source can provide great assistance in improving the predictive capacity of GP during the iterative process, particularly from the view of machine learning. An iterative algorithm is therefore proposed to improve the precision of GP approximation around the design point by constantly adding new design points to the initial training set. Examples are provided to illustrate the GP-based response surface for both structural and non-structural reliability analyses. The results show that the proposed approach is applicable to structural reliability analyses that involve implicit performance functions and structural response evaluations that entail time-consuming finite element analyses.

• Macromolecular Research
• /
• v.14 no.3
• /
• pp.272-286
• /
• 2006

Dendritic hyperbranched poly(methyl methacrylate)s (PMMA)s, whose branched architectures resemble the 'dendron' part(s) of dendrimer, were synthesized by an iterative methodology consisting of two reactions in each iteration process: (a) a coupling reaction of u-functionalized, living, anionic PMMA having two tert-butyldimethylsilyloxymethylphenyl(SMP) groups with benzyl bromide(BnBr)-chain-end-functionalized PMMA, and (b) a transformation reaction of the introduced SMP groups into BnBr functionalities. These two reactions, (a) and (b), were repeated three times to afford a series of dendron-like, hyperbranched (PMMA)s up to third generation. Three dendron-like, hyperbranched (PMMA)s different in branched architecture were also synthesized by the same iterative methodology using a low molecular weight, functionalized 1,1-diphenylalkyl anion prepared from sec-BuLi and 1,1-bis(3-tert-butyldime-thylsilyloxymethylphenyl)ethylene in the reaction step (b) in each iterative process. Furthermore, structurally similar, dendron-like, hyperbranched block copolymers could be successfully synthesized by the iterative methodology using $\alpha$-functionalized, living, anionic poly(2-(perfluorobutyl) ethyl methacrylate) (PRfMA) in addition to $\alpha$-functionalized, living PMMA. Accordingly, the resulting block copolymers were comprised of both PMMA and PRfMA segments with different sequential orders. After the block copolymers were cast into films and annealed, their surface structures were characterized by angle-dependent XPS and contact angle measurements. All three samples showed significant segregation and enrichment of PRfMA segments at the surfaces.

• Journal of Ship and Ocean Technology
• /
• v.11 no.2
• /
• pp.10-25
• /
• 2007

With the sharp increase of the oil price, the issue of the energy saving requires even higher propulsive efficiency of the propellers. Traditionally the propellers have been designed with the criteria such as that of Lerbs optimum based on the lifting line theory and the empirical formulae of Lerbs and van Manen giving relations of the wake pitch with the wake non-uniformity. With the aid of the high speed computer, it is now possible to apply the time-consuming iterative approaches for the solution of the lifting surface problems. In this paper we formulate the variational problem to optimize the efficiency of the propeller operating in the given ship wake using the lifting surface method. The variational formulation relating the spanwise circulation distribution with the propulsive efficiency to be maximized is however non-linear in circulation distribution functions, thus the iterative method is applied to the quasi-linearized equations. The blade shape design also requires the iterative procedures, because the shape of the blade which is represented by the lifting surface is unknown a priori. The numerical code was validated with the DTNSRDC propeller 4119 which is well-known to be optimum in uniform inflow condition. In addition existing (well-designed) commercial propellers were selected and compared with the results of the open water tests and the self-propulsion tests.

• Journal of Information Technology and Architecture
• /
• v.9 no.4
• /
• pp.455-464
• /
• 2012

Due to the recent data explosion, methods which can meet the requirement of large data analysis has been studying. This paper proposes MRIterativeBUC algorithm which enables efficient computation of large data cube by distributed parallel processing with MapReduce framework. MRIterativeBUC algorithm is developed for efficient iterative operation of the BUC method with MapReduce, and overcomes the limitations about the storage size and processing ability caused by large data cube computation. It employs the idea from the iceberg cube which computes only the interesting aspect of analysts and the distributed parallel process of cube computation by partitioning and sorting. Thus, it reduces data emission so that it can reduce network overload, processing amount on each node, and eventually the cube computation cost. The bottom-up cube computation and iterative algorithm using MapReduce, proposed in this paper, can be expanded in various way, and will make full use of many applications.