• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2000.11a
• /
• pp.285-288
• /
• 2000

This paper deals with the theoretical estimation and its experimental verification of grinding wheel wear in surface grinding process. A theoretical formulation is provided to predict the grinding wheel wear in surface grinding. The associated surface roughness and grinding force are also investigated both theoretically and experimentally. Through a series of simulations and experiments, it is shown that the predictions are in good agreement with the experimental results.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.10
• /
• pp.4703-4723
• /
• 2016

The verification of data integrity is an urgent topic in remote data storage environments with the wide deployment of cloud data storage services. Many traditional verification algorithms focus on the block-oriented verification to resolve the dispute of dynamic data integrity between the data owners and the storage service providers. However, these algorithms scarcely pay attention to the data verification charge and the users' verification experience. The users more concern about the availability of accessed files rather than data blocks. Moreover, the data verification charge limits the number of checked data in each verification. Therefore, we propose a mixed verification protocol to verify the data integrity, which rapidly locates the corrupted files by the file-oriented verification, and then identifies the corrupted blocks in these files by the block-oriented verification. Theoretical analysis and simulation results demonstrate that the protocol reduces the cost of the metadata computation and transmission relative to the traditional block-oriented verification at the expense of little cost of additional file-oriented metadata computation and storage at the data owner. Both the opportunity of data extracted and the scope of suspicious data are optimized to improve the verification efficiency under the same verification cost.

• Journal of the Korean Society for Precision Engineering
• /
• v.18 no.8
• /
• pp.150-156
• /
• 2001

This paper deals with the theoretical estimation and its experimental verification of grinding wheel wear in surface grinding process. A theoretical formulation is provided to predict the grinding wheel wear in surface grinding. To validate the theoretical prediction, the grinding wheel wear is measured by using a laser scanning micrometer. The associated surface roughness and grinding farce are also investigated both theoretically and experimentally. Through a series of simulations and experiments, it is shown that the predictions are in good agreement with the experimental results.

• Proceedings of the Korean Society for Technology of Plasticity Conference
• /
• 2008.10a
• /
• pp.367-369
• /
• 2008

A theoretical model of equivalent drawbead for sheet metal forming analysis is experimentally verified in this paper. After the theoretical drawbead models improved a material description for the accurate calculation of drawbead forces are briefly introduced, they are verified by showing the good agreement of their drawbead forces with experimental measurements. Furthermore, the excellence of theoretical models is demonstrated by the comparison with those of commercial codes.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.1
• /
• pp.1-17
• /
• 2017

Mobile Cloud Computing has become a promising computing platform. It moves users' data to the centralized large data centers for users' mobile devices to conveniently access. Since the data storage service may not be fully trusted, many public verification algorithms are proposed to check the data integrity. However, these algorithms hardly consider the huge computational burden for the verifiers with resource-constrained mobile devices to execute the verification tasks. We propose an energy-efficient algorithm for assigning verification tasks (EEAVT) to optimize the energy consumption and assign the verification tasks by elastic and customizable ways. The algorithm prioritizes verification tasks according to the expected finish time of the verification, and assigns the number of checked blocks referring to devices' residual energy and available operation time. Theoretical analysis and experiment evaluation show that our algorithm not only shortens the verification finish time, but also decreases energy consumption, thus improving the efficiency and reliability of the verification.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.2
• /
• pp.558-579
• /
• 2021

The cloud storage provides flexible data storage services for data owners to remotely outsource their data, and reduces data storage operations and management costs for data owners. These outsourced data bring data security concerns to the data owner due to malicious deletion or corruption by the cloud service provider. Data integrity verification is an important way to check outsourced data integrity. However, the existing data verification schemes only consider the case that a verifier launches multiple data verification challenges, and neglect the verification overhead of multiple data verification challenges launched by multiple verifiers at a similar time. In this case, the duplicate data in multiple challenges are verified repeatedly so that verification resources are consumed in vain. We propose a duplicate data verification algorithm based on multiple verifiers and multiple challenges to reduce the verification overhead. The algorithm dynamically schedules the multiple verifiers' challenges based on verification time and the frequent itemsets of duplicate verification data in challenge sets by applying FP-Growth algorithm, and computes the batch proofs of frequent itemsets. Then the challenges are split into two parts, i.e., duplicate data and unique data according to the results of data extraction. Finally, the proofs of duplicate data and unique data are computed and combined to generate a complete proof of every original challenge. Theoretical analysis and experiment evaluation show that the algorithm reduces the verification cost and ensures the correctness of the data integrity verification by flexible batch data verification.

• Transactions of the Korean Society for Noise and Vibration Engineering
• /
• v.11 no.6
• /
• pp.208-215
• /
• 2001

The paper presents both theoretical and experimental study fur dynamic instabilities of a vortical cantilevered pipe with two attached lumped masses conveying fluid. The two attached lumped masses can be considered as valves or some mechanical paras in real pipe systems. Eigenvalue behaviors depending on the flow velocity are investigated for the change of Positions and magnitudes of an attached lumped mass and a tip mass. In order to verify appropriate of numerical solutions, experiments were accomplished. Theoretical predictions have a good agreement with experimental ones.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.2
• /
• pp.565-586
• /
• 2022

Cloud storage's elastic expansibility not only provides flexible services for data owners to store their data remotely, but also reduces storage operation and management costs of their data sharing. The data outsourced remotely in the storage space of cloud service provider also brings data security concerns about data integrity. Data integrity verification has become an important technology for detecting the integrity of remote shared data. However, users without data access rights to verify the data integrity will cause unnecessary overhead to data owner and cloud service provider. Especially malicious users who constantly launch data integrity verification will greatly waste service resources. Since data owner is a consumer purchasing cloud services, he needs to bear both the cost of data storage and that of data verification. This paper proposes a verification control algorithm in data integrity verification for remotely outsourced data. It designs an attribute-based encryption verification control algorithm for multiple verifiers. Moreover, data owner and cloud service provider construct a common access structure together and generate a verification sentinel to verify the authority of verifiers according to the access structure. Finally, since cloud service provider cannot know the access structure and the sentry generation operation, it can only authenticate verifiers with satisfying access policy to verify the data integrity for the corresponding outsourced data. Theoretical analysis and experimental results show that the proposed algorithm achieves fine-grained access control to multiple verifiers for the data integrity verification.

• Journal of Korea Multimedia Society
• /
• v.9 no.12
• /
• pp.1607-1616
• /
• 2006

The growing market of multimedia and digital signal processing requires significant data-path portions of SoCs. However, the common models for verification are not suitable for SoCs. A novel model--WGL (Weighted Generalized List) is proposed, which is based on the general-list decomposition of polynomials, with three different weights and manipulation rules introduced to effect node sharing and the canonicity. Timing parameters and operations on them are also considered. Examples show the word-level WGL is the only model to linearly represent the common word-level functions and the bit-level WGL is especially suitable for arithmetic intensive circuits. The model is proved to be a uniform and efficient model for both bit-level and word-level functions. Then Based on the WGL model, a backward-construction logic-verification approach is presented, which reduces time and space complexity for multipliers to polynomial complexity(time complexity is less than $O(n^{3.6})$ and space complexity is less than $O(n^{1.5})$) without hierarchical partitioning. Finally, a construction methodology of word-level polynomials is also presented in order to implement complex high-level verification, which combines order computation and coefficient solving, and adopts an efficient backward approach. The construction complexity is much less than the existing ones, e.g. the construction time for multipliers grows at the power of less than 1.6 in the size of the input word without increasing the maximal space required. The WGL model and the verification methods based on WGL show their theoretical and applicable significance in SoC design.

• Bulletin of the Korean Chemical Society
• /
• v.21 no.1
• /
• pp.93-96
• /
• 2000

A diffusion-influenced pseudo-first order reversible reaction A + B ⇔C + B is investigated by the molecular dynamics (MD) simulation method. Theoretical finding that the temporal evolution of reactants [conditional probabilities] in the reversible system can be expressed by the irreversible survival probability with an effective rate parameter is confirmed even in the presence of solvent particles. We carry out molecular dynamics simulations for both the irreversible and the reversible cases to evaluate the survival and the conditional probabilities for each cases. When the resultant irreversible survival probability is inserted into the proposed relation, the conditional probabilities given by the simulation are exactly reproduced.