• Proceedings of the Korean Society for Technology of Plasticity Conference
• /
• 2003.10b
• /
• pp.115-122
• /
• 2003

This paper presents the development of a virtual forging factory framework. The technologies of virtual reality and relational database had been integrated in the developed framework using Microsoft $Windows^{(R)}$ programming as the main technique so as to emulate a physical forging factory. The developed virtual forging factory consists of forging cells and a forging cell is comprised of forging machine, forging die, and forging operations forming a forging production line. The technology of virtual reality had been successfully adopted in the production simulation of manufacturing such as CNC and robotics. However, the application in virtual forging factory seems to have not been studied yet. Potential application of a virtual forging factory can be beneficial to (1) computer aided instruction, (2) shorten the learning curve of a novice, (3) remote diagnosis and monitoring when remote monitoring and control technology and signal inspection is considered, (4) improve adverse forging environment when remote forging technology is applied, and (5) virtual reality application.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.6
• /
• pp.1-9
• /
• 2007

We propose a novel framework for distributed resource management. The framework has the following novel features. First, the resource management system is distributed using resource content information that is characterized by system properties. We argue that a distributed system based on resource content is sufficient to satisfy specific scheduling requests for Quality of Service(QoS) considering workload balance across a grid. Second, the distributed system constructs a hierarchical peer-to-peer network. This peered network provides an efficient message routing mechanism. The simulation results demonstrate that the proposed framework is proficient to satisfy QoS in distributed environment.

• Journal of the Korea Society of Computer and Information
• /
• v.22 no.12
• /
• pp.69-77
• /
• 2017

This paper represents a novel framework for multi-scale image fusion. Multi-scale Kalman Smoothing (MKS) algorithm with quad-tree structure can provide a powerful multi-resolution image fusion scheme by employing Markov property. In general, such approach provides outstanding image fusion performance in terms of accuracy and efficiency, however, quad-tree based method is often limited to be applied in certain applications due to its stair-like covariance structure, resulting in unrealistic blocky artifacts at the fusion result where finest scale data are void or missed. To mitigate this structural artifact, in this paper, a new scheme of multi-scale fusion framework is proposed. By employing Super Resolution (SR) technique on MKS algorithm, fine resolved measurement is generated and blended through the tree structure such that missed detail information at data missing region in fine scale image is properly inferred and the blocky artifact can be successfully suppressed at fusion result. Simulation results show that the proposed method provides significantly improved fusion results in the senses of both Root Mean Square Error (RMSE) performance and visual improvement over conventional MKS algorithm.

• Advances in concrete construction
• /
• v.9 no.5
• /
• pp.469-478
• /
• 2020

This study aims to establish a new methodological framework for the evaluation of the evolution of the reliability of plain concrete for pavement vs number of cycles under flexural fatigue loading. According to the framework, a new method calculating the reliability was proposed through probability simulation in order to describe a random accumulation of fatigue damage, which combines reliability theory, one-to-one probability density functions transformation technique, cumulative fatigue damage theory and Weibull distribution theory. Then the statistical analysis of flexural fatigue performance of cement concrete tested was carried out utilizing Weibull distribution. Ultimately, the reliability for the tested cement concrete was obtained by the proposed method. Results indicate that the stochastic evolution behavior of concrete materials under fatigue loading can be captured by the established framework. The flexural fatigue life data of concrete at different stress levels is well described utilizing the two-parameter Weibull distribution. The evolution of reliability for concrete materials tested in this study develops by three stages and may corresponds to develop stages of cracking. The proposed method may also be available for the analysis of degradation behaviors under non-fatigue conditions.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.12
• /
• pp.5805-5825
• /
• 2019

Smartphones are important platforms because of their sophisticated computation, communication, and sensing capabilities, which enable a variety of applications in the Internet of Things (IoT) systems. Moreover, advancements in hardware have enabled sensors on smartphones such as environmental and chemical sensors that make sensor data collection readily accessible for a wide range of applications. However, dynamic, opportunistic, and heterogeneous mobility patterns of smartphone users that vary throughout the day, which greatly affects the efficacy of sensor data collection. Therefore, it is necessary to consider phone users mobility patterns to design data collection schedules that can reduce the loss of sensor data. In this paper, we propose a mobility-based weighted adaptive opportunistic scheduling framework that can adaptively adjust to the dynamic, opportunistic, and heterogeneous mobility patterns of smartphone users and provide prioritized scheduling based on various application scenarios, such as velocity, region of interest, and sensor type. The performance of the proposed framework is compared with other scheduling frameworks in various heterogeneous smartphone user mobility scenarios. Simulation results show that the proposed scheduling improves the transmission rate by 8 percent and can also improve the collection of higher-priority sensor data compared with other scheduling approaches.

• ETRI Journal
• /
• v.34 no.3
• /
• pp.341-351
• /
• 2012

We deal with a resource allocation problem for multimedia service discrimination in wireless networks. We assume that a service provider allocates network resources to users who can choose and access one of the discriminated services. To express the rational service selection of users, the utility function of users is devised to reflect both service quality and cost. Regarding the utility function of a service provider, total profit and efficiency of resource usage have been considered. The proposed service discrimination framework is composed of two game models. An outer model is a repeated Stackelberg game between a service provider and a user group, while an inner model is a service selection game among users, which is solved by adopting the Kalai-Smorodinsky bargaining solution. Through simulation experiments, we compare the proposed framework with existing resource allocation methods according to user cost sensitivity. The proposed framework performed better than existing frameworks in terms of total profit and fairness.

• Journal of Communications and Networks
• /
• v.9 no.3
• /
• pp.319-329
• /
• 2007

This paper presents a price-based quality-of-service (QoS) control framework for two-class network services, in which circuit-switched and packet-switched services are defined as "premium service class" and "best-effort service class," respectively. Given the service model, a customer may decide to use the other class as a perfect or an imperfect substitute when he or she perceives the higher utility of the class. Given the framework, fixed-point problems are solved numerically to investigate how static pricing can be used to control the demand and the QoS of each class. The rationale behind this is as follows: For a network service provider to determine the optimal prices that maximize its total revenue, the interactions between the QoS-dependent demand and the demand-dependent QoS should be thoroughly analyzed. To test the robustness of the proposed model, simulations were performed with gradually increasing customer demands or network workloads. The simulation results show that even with substantial demands or workloads, self-adjustment mechanism of the model works and it is feasible to obtain fixed points in equilibrium. This paper also presents a numerical example of guaranteeing the QoS statistically in the short term-that is, through the implementation of pricing strategies.

• The KIPS Transactions:PartC
• /
• v.12C no.2 s.98
• /
• pp.289-300
• /
• 2005

This paper proposed an analytical framework to compare and model the policy-based network management; centralized and distributed typed model. Policy-based network is introduced in various application fields, and a policy framework can offer different processing performance according to application. Therefore, we evaluated the performance and extensibility of each PBNM model when we apply the policy process to the models. The evaluated measurement metrics are policy provisioning time, traffic occurrence amount, PDP processing rate, and global conflict detection in qualitative simulation. The results show that the suitable structure is required according to the analysis for the careful application characteristics, when PBNM is adopted. The modeling framework presented in this paper is intended to quantify the merits and demerits among the currently suggested PBNM models.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.14 no.5
• /
• pp.69-78
• /
• 2004

The change of attack techniques paradigm was begun by fast extension of the latest Internet and new attack form appearing. But, Most intrusion detection systems detect only known attack type as IDS is doing based on misuse detection, and active correspondence is difficult in new attack. Therefore, to heighten detection rate for new attack pattern, the experiments to apply various techniques of anomaly detection are appearing. In this paper, we propose an behavior profiling method using Bayesian framework based on graphics from audit data and visualize behavior profile to detect/analyze anomaly behavior. We achieve simulation to translate host/network audit data into BF-XML which is behavior profile of semi-structured data type for anomaly detection and to visualize BF-XML as SVG.

• Journal of Information Processing Systems
• /
• v.19 no.2
• /
• pp.240-257
• /
• 2023

The industrial Internet of Things (IIoT) is characterized by intelligent connection, real-time data processing, collaborative monitoring, and automatic information processing. The heterogeneous IIoT devices require a high data rate, high reliability, high coverage, and low delay, thus posing a significant challenge to information security. High-performance edge and cloud servers are a good backup solution for IIoT devices with limited capabilities. However, privacy leakage and network attack cases may occur in heterogeneous IIoT environments. Cloud-based multi-party computing is a reliable privacy-protecting technology that encourages multiparty participation in joint computing without privacy disclosure. However, the default cloud selection method does not meet the heterogeneous IIoT requirements. The server can be dishonest, significantly increasing the probability of multi-party computation failure or inefficiency. This paper proposes a blockchain and smart contract-based optimized cloud node selection framework. Different participants choose the best server that meets their performance demands, considering the communication delay. Smart contracts provide a progressive request mechanism to increase participation. The simulation results show that our framework improves overall multi-party computing efficiency by up to 44.73%.