• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.11
• /
• pp.3565-3583
• /
• 2022

The task scheduling problem has received a lot of attention in recent years as a crucial area for research in the cloud environment. However, due to the difference in objectives considered by service providers and users, it has become a major challenge to resolve the conflicting interests of service providers and users while both can still take into account their respective objectives. Therefore, the task scheduling problem as a bi-objective game problem is formulated first, and then a task scheduling model based on the bi-objective game (TSBOG) is constructed. In this model, energy consumption and resource utilization, which are of concern to the service provider, and cost and task completion rate, which are of concern to the user, are calculated simultaneously. Furthermore, a many-objective evolutionary algorithm based on a partitioned collaborative selection strategy (MaOEA-PCS) has been developed to solve the TSBOG. The MaOEA-PCS can find a balance between population convergence and diversity by partitioning the objective space and selecting the best converging individuals from each region into the next generation. To balance the players' multiple objectives, a crossover and mutation operator based on dynamic games is proposed and applied to MaPEA-PCS as a player's strategy update mechanism. Finally, through a series of experiments, not only the effectiveness of the model compared to a normal many-objective model is demonstrated, but also the performance of MaOEA-PCS and the validity of DGame.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2011.04a
• /
• pp.871-874
• /
• 2011

The fast emerging of network technology and the high demand of computing resources have prompted many organizations to outsource their storage and computing needs. Cloud based storage services such as Microsoft's Azure and Amazon's S3 allow customers to store and retrieve any amount of data, at anytime from anywhere via internet. The scalable and dynamic of the cloud storage services help their customer to reduce IT administration and maintenance costs. No doubt, cloud based storage services brought a lot of benefits to its customer by significantly reducing cost through optimization increased operating and economic efficiencies. However without appropriate security and privacy solution in place, it could become major issues to the organization. As data get produced, transferred and stored at off premise and multi tenant cloud based storage, it becomes vulnerable to unauthorized disclosure and unauthorized modification. An attacker able to change or modify data while data inflight or when data is stored on disk, so it is very important to secure data during its entire life-cycle. The traditional cryptography primitives for the purpose of data security protection cannot be directly adopted due to user's lose control of data under off premises cloud server. Secondly cloud based storage is not just a third party data warehouse, the data stored in cloud are frequently update by the users and lastly cloud computing is running in a simultaneous, cooperated and distributed manner. In our proposed mechanism we protect the integrity, authentication and confidentiality of cloud based data with the encrypt- then-upload concept. We modified and applied proxy re-encryption protocol in our proposed scheme. The whole process does not reveal the clear data to any third party including the cloud provider at any stage, this helps to make sure only the authorized user who own corresponding token able to access the data as well as preventing data from being shared without any permission from data owner. Besides, preventing the cloud storage providers from unauthorized access and making illegal authorization to access the data, our scheme also protect the data integrity by using hash function.

• Molecules and Cells
• /
• v.46 no.9
• /
• pp.527-534
• /
• 2023

Liver ischemia-reperfusion injury (IRI) is the main cause of organ dysfunction and failure after liver surgeries including organ transplantation. The mechanism of liver IRI is complex and numerous signals are involved but cellular metabolic disturbances, oxidative stress, and inflammation are considered the major contributors to liver IRI. In addition, the activation of inflammatory signals exacerbates liver IRI by recruiting macrophages, dendritic cells, and neutrophils, and activating NK cells, NKT cells, and cytotoxic T cells. Technological advances enable us to understand the role of specific immune cells during liver IRI. Accordingly, therapeutic strategies to prevent or treat liver IRI have been proposed but no definitive and effective therapies exist yet. This review summarizes the current update on the immune cell functions and discusses therapeutic potentials in liver IRI. A better understanding of this complex and highly dynamic process may allow for the development of innovative therapeutic approaches and optimize patient outcomes.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.46 no.8
• /
• pp.22-30
• /
• 2009

Due to high levels of integration and complexity, the Network-on-Chip (NoC) approach has emerged as a new design paradigm to overcome on-chip communication issues and data bandwidth limits in conventional SoC(System-on-Chip) design. In particular, exponentially growing of energy consumption caused by high frequency, synchronization and distributing a single global clock signal throughout the chip have become major design bottlenecks. To deal with these issues, a globally asynchronous, locally synchronous (GALS) design combined with low power techniques is considered. Such a design style fits nicely with the concept of voltage-frequency-islands (VFI) which has been recently introduced for achieving fine-grain system-level power management. In this paper, we propose an efficient design methodology that minimizes energy consumption by VFI partitioning on an NoC architecture as well as assigning supply and threshold voltage levels to each VFI. The proposed algorithm which find VFI and appropriate core (or processing element) supply voltage consists of traffic-aware core graph partitioning, communication contention delay-aware tile mapping, power variation-aware core dynamic voltage scaling (DVS), power efficient VFI merging and voltage update on the VFIs Simulation results show that average 10.3% improvement in energy consumption compared to other existing works.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.999-1004
• /
• 2005

An algorithm for a hybrid controller consists of a sliding mode control part and a fuzzy logic part which ar purposely for nonlinear systems. The sliding mode part of the solution is based on "eigenvalue/vector"-type controller is used as the backstepping approach for tracking errors. The fuzzy logic part is a Mamdani fuzzy model. This is designed by applying sliding mode control (SMC) method to the dynamic model. The main objective is to keep the update dynamics in a stable region by used SMC. After that the plant behavior is presented to train procedure of adaptive neuro-fuzzy inference systems (ANFIS). ANFIS architecture is determined and the relevant formulation for the approach is given. Using the error (e) and rate of error (de), occur due to the difference between the desired output value (yd) and the actual output value (y) of the system. A dynamic adaptation law is proposed and proved the particularly chosen form of the adaptation strategy. Subsequently VSC creates a sliding mode in the plant behavior while the parameters of the controller are also in a sliding mode (stable trainer). This study considers the ANFIS structure with first order Sugeno model containing nine rules. Bell shaped membership functions with product inference rule are used at the fuzzification level. Finally the Mamdani fuzzy logic which is depends on adaptive neuro-fuzzy inference systems structure designed. At the transferable stage from ANFIS to Mamdani fuzzy model is adjusted for the membership function of the input value (e, de) and the actual output value (y) of the system could be changed to trapezoidal and triangular functions through tuning the parameters of the membership functions and rules base. These help adjust the contributions of both fuzzy control and variable structure control to the entire control value. The application example, control of a mass-damper system is considered. The simulation has been done using MATLAB. Three cases of the controller will be considered: for backstepping sliding-mode controller, for hybrid controller, and for adaptive backstepping sliding-mode controller. A numerical example is simulated to verify the performances of the proposed control strategy, and the simulation results show that the controller designed is more effective than the adaptive backstepping sliding mode controller.

• Journal of Korea Spatial Information System Society
• /
• v.2 no.2 s.4
• /
• pp.25-37
• /
• 2000

As computer systems of high capacity and high performance recently emerged, various researches about GISs(Geographic Information Systems) have been in progress and many GIS applications have also been developed. From the domestic situation where many people are using mobile devices, because of the recent advances in the mobile technology, we can infer that the time will come when every individual will carry a mobile device with a GPS(Global Positioning System) module resulting from the development of a miniature GPS Module. Therefore, a mobile GIS that can allows users to deal with dynamic GIS data management and perform their tasks while moving will be required. This paper discusses the design and implementation of a mobile GIS using the shareware DBMS, called postgresSQL. The Mobile GIS in which a mobile concept is utilized at the GIS data server makes it possible to insert, delete, update GIS data, to zoom in and zoom out displayed maps, and to locate the user's position on the client device. Therefore, It is possible to manage dynamic GIS data in order to deal with GIS data on the maps while moving, connect various GIS data servers through the middleware, and connected with ITS (Intelligent Transport System) which is one of applications of the Mobile GIS developed in this paper.

• Journal of the Korea Computer Graphics Society
• /
• v.26 no.3
• /
• pp.123-131
• /
• 2020

This study proposes a real-time rendering algorithm for lighting when each of more than 100,000 moving particles exists as a light source. Two 3D textures are used to dynamically determine the range of influence of each light, and the first 3D texture has light color and the second 3D texture has light direction information. Each frame goes through two steps. The first step is to update the particle information required for 3D texture initialization and rendering based on the Compute shader. Convert the particle position to the sampling coordinates of the 3D texture, and based on this coordinate, update the colour sum of the particle lights affecting the corresponding voxels for the first 3D texture and the sum of the directional vectors from the corresponding voxels to the particle lights for the second 3D texture. The second stage operates on a general rendering pipeline. Based on the polygon world position to be rendered first, the exact sampling coordinates of the 3D texture updated in the first step are calculated. Since the sample coordinates correspond 1:1 to the size of the 3D texture and the size of the game world, use the world coordinates of the pixel as the sampling coordinates. Lighting process is carried out based on the color of the sampled pixel and the direction vector of the light. The 3D texture corresponds 1:1 to the actual game world and assumes a minimum unit of 1m, but in areas smaller than 1m, problems such as stairs caused by resolution restrictions occur. Interpolation and super sampling are performed during texture sampling to improve these problems. Measurements of the time taken to render a frame showed that 146 ms was spent on the forward lighting pipeline, 46 ms on the defered lighting pipeline when the number of particles was 262144, and 214 ms on the forward lighting pipeline and 104 ms on the deferred lighting pipeline when the number of particle lights was 1,024766.

• The KIPS Transactions:PartC
• /
• v.10C no.2
• /
• pp.217-232
• /
• 2003

QoS routing can improve network performance while providing support for QoS guarantees. These benefits, however, comes with additional routing costs such as more complex and frequent route computation and the protocol overheads to exchange dynamic network state information. Moreover, little has been done to mininize the impact of the QoS traffic to the best effort traffic or to enhance the routine Performance of the best effort traffic when QoS routing is deployed. In this paper, it is proposed that a sewer based routing mechanism, which supports the QoS routing without incurring the QoS routing protocol overhead for the network state update exchanges and enhances the performance of the best effort traffic without affecting the performance of QoS routing. Simulation results show that the proposed scheme enhances the routing performance for the QoS traffic while reducing the routing protocol overhead. The routing performance of the best traffic is also improved with virtually no impact to the routine performance of the QoS traffic. The proposed scheme is shown to be especially effective when the ratio of QoS traffic is high, that is, when the impact of the QoS traffic to the performance of best effort traffic is significant.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.26 no.2
• /
• pp.139-146
• /
• 2013

This study is to update of vibration power generating model and to analyze electromotive force on subway. Analysis of electromotive force using power generation depending on classification of locations which are ballast bed and concrete bed. As the section between Seocho and Bangbae in the line 2 subway was changed from ballast bed to concrete bed, it could be analyzed at same condition, train, section. Induced electromotive force equation by Faraday's law was updated using Bayesian regression and correlation analysis with calculate value and experiment value. Using the updated model, it could get 40mV per one power generation in ballast bed, and it also could get 4mV per one power generation in concrete bed. If the updated model apply to subway or any train, it will be more effective to get electric power. In addition to that, it will be good to reduce greenhouse gas and to build a green traffic network.

• The KIPS Transactions:PartD
• /
• v.9D no.5
• /
• pp.801-812
• /
• 2002

On-line reorganization in a shared nothing database cluster is crucial to the performance of the database system in a dynamic environment like WWW where the number of users grows rapidly and changing access patterns may exhibit high skew. In the existing method of on-line reorganization have a drawback that needs excessive data migrations in case more than two nodes within a cluster have overload at the same time. In this paper, we propose an advanced B$^{+}$ tree based on-line reorganization method that solves data skew on multi-nodes. Our method facilitates fast and efficient data migration by including spare nodes that are added to cluster through on-line scaling. Also we apply CSB$^{+}$ tree (Cache Sensitive B$^{+}$ tree) to our method instead of B$^{+}$ tree for fast select and update queries. We conducted performance study and implemented the method on Ultra Fault-Tolerant Database Cluster developed for high scalability and availability. Empirical results demonstrate that our proposed method is indeed effective and fast than the existing method. method.