• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.11_12
• /
• pp.587-597
• /
• 2005

Flash memory based embedded computing systems are becoming increasingly prevalent.These systems typically have to provide an instant start-up time. However, we observe that mounting a file system toy flash memory takes 1 to 25 seconds mainly depending on the flash capacity. Since the flash chip capacity is doubled in every year, this mounting time will soon become the most dominant reason of the delay of system start-up time Therefore, in this paper, we present instant mounting techniques for flash file systems by storing the In-memory file system metadata to flash memory when unmounting the file system and reloading the stored metadata quickly when mounting the file system. These metadata snapshot techniques are specifically developed for NOR- and NAND-type flash memories, while at the same time, overcoming their physical constraints. The proposed techniques check the validity of the stored snapshot and use the proposed fast trash recovery techniques when the snapshot is Invalid. Based on the experimental results, the proposed techniques can reduce the flash mounting time by about two orders of magnitude over the existing de facto standard flash file system, JFFS2.

• Molecules and Cells
• /
• v.39 no.2
• /
• pp.149-155
• /
• 2016

In the heart, excitation-contraction (E-C) coupling is mediated by $Ca^{2+}$ release from sarcoplasmic reticulum (SR) through the interactions of proteins forming the $Ca^{2+}$ release unit (CRU). Among them, calsequestrin (CSQ) and histidine-rich $Ca^{2+}$ binding protein (HRC) are known to bind the charged luminal region of triadin (TRN) and thus directly or indirectly regulate ryanodine receptor 2 (RyR2) activity. However, the mechanisms of CSQ and HRC mediated regulation of RyR2 activity through TRN have remained unclear. We first examined the minimal KEKE motif of TRN involved in the interactions with CSQ2, HRC and RyR2 using TRN deletion mutants and in vitro binding assays. The results showed that CSQ2, HRC and RyR2 share the same KEKE motif region on the distal part of TRN (aa 202-231). Second, in vitro binding assays were conducted to examine the $Ca^{2+}$ dependence of protein-protein interactions (PPI). The results showed that TRN-HRC interaction had a bell-shaped $Ca^{2+}$ dependence, which peaked at pCa4, whereas TRN-CSQ2 or TRN-RyR2 interaction did not show such $Ca^{2+}$ dependence pattern. Third, competitive binding was conducted to examine whether CSQ2, HRC, or RyR2 affects the TRN-HRC or TRN-CSQ2 binding at pCa4. Among them, only CSQ2 or RyR2 competitively inhibited TRN-HRC binding, suggesting that HRC can confer functional refractoriness to CRU, which could be beneficial for reloading of $Ca^{2+}$ into SR at intermediate $Ca^{2+}$ concentrations.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.16 no.4
• /
• pp.353-367
• /
• 2003

This paper describes the extension of the numerical model, which was developed to simulate the nonlinear behavior of reinforced concrete (RC) structures subjected to monotonic in plane shear and introduced in the companion paper, to simulate effectively the behavior of RE structures under cyclic loadings. While maintaining all the basic assumptions adopted in defining the constitutive relations of concrete under monotonic loadings, a hysteretic stress strain relation of concrete, which across the tension compression region, is defined. In addition, unlike previous simplified stress strain relations, curved unloading and reloading branches inferred from the stress strain relation of steel considering the Bauschinger effect we used. The modifications of the stress strain relation of steel are also introduced to reflect pinching effect depending on the shear span ratio and an average stress distribution in a cracked RC element. Finally, correlation studies between analytical results and experimental studies are conducted to establish the validity of the proposed model.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.27 no.1
• /
• pp.1-7
• /
• 2023

Deep web collection means entering a query in a search form and collecting response results. It is estimated that the information possessed by the deep web has about 450 to 550 times more information than the statically constructed surface web. The static method does not show the changed information until the web page is refreshed, but the dynamic web page method updates the necessary information in real time and provides real-time information without reloading the web page, but crawler has difficulty accessing the updated information. Therefore, there is a need for a way to automatically collect information on these deep webs using a crawler. Therefore, this paper proposes a method of utilizing scripts as general links, and for this purpose, an algorithm that can utilize client scripts like regular URLs is proposed and experimented. The proposed algorithm focused on collecting web information by menu navigation and script execution instead of the usual method of entering data into search forms.

• Journal of The Korean Society of Agricultural Engineers
• /
• v.64 no.3
• /
• pp.45-52
• /
• 2022

Prediction of soil behavior should be interpreted based on the level of axial strain in the actual ground. Recently numerical methods have been carried out focus on the state of soil failure. However considered the deformation of soil the prior to failure, mostly the small strain occurring in the elastic range is considered. As a result of calculating the deformation modulus to 50% of the maximum unconfined compression strength, Deformation modulus (E50) showed a tendency to increase according to the degree of compaction by region. The Poisson's ratio during loading-unloading was 0.63, which was higher than the literature value of 0.5. For the unconfined compression test under cyclic loading for the measurement of permanent strain, the maximum compression strength was divided into four step and the test was performed by load step. Changes in permanent strain and deformation modulus were checked by the loading-unloading test for each stage. At 90% compaction, the permanent deformation of the SM sample was 0.21 mm, 0.37 mm, 0.6 mm, and 1.35 mm. The SC samples were 0.1 mm, 0.17 mm, 0.42 mm, and 1.66 mm, and the ML samples were 0.48 mm, 0.95 mm, 1.30 mm, and 1.68 mm.

• Nuclear Engineering and Technology
• /
• v.25 no.2
• /
• pp.193-203
• /
• 1993

A new heuristic method for loading pattern search has been developed to overcome short-comings of the algorithmic approach. To reduce the size of vast solution space, general shuffling rules, a regionwise shuffling method, and a pattern grouping method were introduced. The entropy theory was applied to classify possible loading patterns into groups with similarity between them. The pattern search program was implemented with use of the PROLOG language. A two-group nodal code MEDIUM-2D was used for analysis of power distribution in the core. The above mentioned methodology has been tested to show effectiveness in reducing of solution space down to a few hundred pattern groups. Burnable poison rods were then arranged in each pattern group in accordance with burnable poison distribution rules, which led to further reduction of the solution space to several scores of acceptable pattern groups. The method of maximizing cycle length(MCL) and minimizing power-peaking factor(MPF) were applied to search for specific useful loading patterns from the acceptable pattern groups. Thus, several specific loading patterns that have low power-peaking factor and large cycle length were successfully searched from the selected pattern groups.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.28 no.4A
• /
• pp.517-528
• /
• 2008

This paper presents a hysteretic damage model for reinforced concrete (RC) joints that explicitly accounts for the bond-slip between the reinforcing bars and the surrounding concrete. A frame element whose displacement fields for the concrete and the reinforcing bars are different to permit slip is developed. From the fiber section concept, compatibility equations for concrete, rebar, and bond are defined. Modification of the hysteretic stress-strain curve of steel is conducted for partial unloading and reloading conditions. Local bond stress-slip relations for monotonic loads are updated at each slip reversal according to the damage factor. The numerical applications of the reinforcing bar embedded in the confined concrete block, the RC column anchored in the foundation, and the RC beam-column subassemblage validate the model accuracy and show how including the effects of bond-slip leads to a good assessment of the amount of energy dissipation during loading histories.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.6
• /
• pp.1163-1170
• /
• 2016

A hardware implementation of ultra-lightweight block cipher algorithm PRESENT which was specified as a standard for lightweight cryptography ISO/IEC 29192-2 is described. The PRESENT crypto-processor supports two key lengths of 80 and 128 bits, as well as four modes of operation including ECB, CBC, OFB, and CTR. The PRESENT crypto-processor has on-the-fly key scheduler with master key register, and it can process consecutive blocks of plaintext/ciphertext without reloading master key. In order to achieve a lightweight implementation, the key scheduler was optimized to share circuits for key lengths of 80 bits and 128 bits. The round block was designed with a data-path of 64 bits, so that one round transformation for encryption/decryption is processed in a clock cycle. The PRESENT crypto-processor was verified using Virtex5 FPGA device. The crypto-processor that was synthesized using a $0.18{\mu}m$ CMOS cell library has 8,100 gate equivalents(GE), and the estimated throughput is about 908 Mbps with a maximum operating clock frequency of 454 MHz.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.7
• /
• pp.1296-1302
• /
• 2016

A hardware implementation of ultra-lightweight block cipher algorithm PRESENT that was specified as a block cipher standard for lightweight cryptography ISO/IEC 29192-2 is described in this paper. Two types of crypto-core that support master key size of 80-bit are designed, one is for encryption-only function, and the other is for encryption and decryption functions. The designed PR80 crypto-cores implement the basic cipher mode of operation ECB (electronic code book), and it can process consecutive blocks of plaintext/ciphertext without reloading master key. The PR80 crypto-cores were designed in soft IP with Verilog HDL, and they were verified using Virtex5 FPGA device. The synthesis results using $0.18{\mu}m$ CMOS cell library show that the encryption-only core has 2,990 GE and the encryption/decryption core has 3,687 GE, so they are very suitable for IoT security applications requiring small gate count. The estimated maximum clock frequency is 500 MHz for the encryption-only core and 444 MHz for the encryption/decryption core.

• The KIPS Transactions:PartD
• /
• v.11D no.1
• /
• pp.11-22
• /
• 2004

As random access memory chip gets cheaper, it becomes affordable to realize main memory-based database systems. Consequently, reducing cache misses emerges as the most important issue in current main memory databases, in which CPU speeds have been increasing at 60% per year, compared to the memory speeds at 10% per you. In this paper, we design and implement a main-memory database system for real-time mobile GIS. Our system is composed of 5 modules： the interface manager provides the interface for PDA users； the memory data manager controls spatial and non-spatial data in main-memory using virtual memory techniques； the query manager processes spatial and non-spatial query : the index manager manages the MR-tree index for spatial data and the T-tree index for non-spatial index : the GIS server interface provides the interface with disk-based GIS. The MR-tree proposed propagates node splits upward only if one of the internal nodes on the insertion path has empty space. Thus, the internal nodes of the MR-tree are almost 100% full. Our experimental study shows that the two-dimensional MR-tree performs search up to 2.4 times faster than the ordinary R-tree. To use virtual memory techniques, the memory data manager uses page tables for spatial data, non- spatial data, T-tree and MR-tree. And, it uses indirect addressing techniques for fast reloading from disk.