• Journal of Institute of Control, Robotics and Systems
• /
• v.12 no.10
• /
• pp.968-974
• /
• 2006

We are moving into the era of ubiquitous computing. Ubiquitous Sensor Network (USN) is a base of such computing paradigm, where recognizing the identification and the position of objects is important. For the object identification, RFID tags are commonly used. For the object positioning, use of sensors such as laser and ultrasonic scanners is popular. Recently, there have been a few attempts to apply RFID technology in robot localization by replacing the sensors with RFID readers to achieve simpler and unified USN settings. However, RFID does not provide enough sensing accuracy for some USN applications such as robot navigation, mainly because of its inaccuracy in distance measurements. In this paper, we describe our approach on achieving accurate navigation using RFID. We solely rely on RFID mechanism for the localization by providing coordinate information through RFID tag installed floors. With the accurate positional information stored in the RFID tag, we complement coordinate errors accumulated during the wheel based robot navigation. We especially focus on how to distribute RFID tags (tag pattern) and how many to place (tag granularity) on the RFID tag-floor. To determine efficient tag granularities and tag patterns, we developed a simulation program. We define the error in navigation and use it to compare the effectiveness of the navigation. We analyze the simulation results to determine the efficient granularities and tag arrangement patterns that can improve the effectiveness of RFID navigation in general.

• International journal of advanced smart convergence
• /
• v.5 no.4
• /
• pp.26-31
• /
• 2016

In a cloud computing environment, a cryptographic service allows an information owner to encrypt the information and send it to a cloud server as well as to receive and decode encrypted data from the server which guarantees the confidentiality of shared information. However, if an attacker gains a coded data and has access to an encryption key via cloud server, then the server will be unable to prevent data leaks by a cloud service provider. In this paper, we proposed a key management server which does not allow an attacker to access to a coded key of the owners and prevents data leaks by a cloud service provider. A key management server provides a service where a server receives a coded public key of an information user from an owner and delivers a coded key to a user. Using a key management server proposed in this paper, we validated that the server can secure the confidentiality of an encryption key of data owners and efficiently distribute keys to data users.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.2
• /
• pp.315-320
• /
• 2006

This paper describes access control, user authentication, and User Security and Encryption technology for the construction of database security system from network users. We propose model of network encrypted database security system for combining these elements through the analysis of operational and technological elements. Systematic combination of operational and technological elements with proposed model can construct encrypted database security system secured from unauthorized users in distributed computing environment.

• ETRI Journal
• /
• v.43 no.5
• /
• pp.825-834
• /
• 2021

Based on its simplicity and user-friendly characteristics, OpenMP has become the standard model for programming on shared-memory architectures. Checkpointing-aided parallel execution (CAPE) is an approach that utilizes the discontinuous incremental checkpointing technique (DICKPT) to translate and execute OpenMP programs on distributed-memory architectures automatically. Currently, CAPE implements the OpenMP execution model by utilizing the DICKPT to distribute parallel jobs and their data to slave machines, and then collects the results after executing these distributed jobs. Although this model has been proven to be effective in terms of performance and compatibility with OpenMP on distributed-memory systems, it cannot fully exploit the capabilities of multicore processors. This paper presents a novel execution model for CAPE that utilizes two levels of parallelism. In the proposed model, we add another level of parallelism in the form of multithreaded processes on slave machines with the goal of better exploiting their multicore CPUs. Initial experimental results presented near the end of this paper demonstrate that this model provides significantly enhanced CAPE performance.

• Journal of the military operations research society of Korea
• /
• v.11 no.1
• /
• pp.8-32
• /
• 1985

The objective of this study is to develop the Transportation Model of Linear Programming in which optimal transportation pattern by regions (origins and destinations) to minimize the total transportation costs can be obtained for handling government-held grains. As a result of computing the Transportation Model, the total transportation costs of transporting 1,058,507 metric tons from origins to destinations are 7,234 million won. So, the transporation cost is 6,834 won per ton in this model. But actual transportation cost in 1983 is 11,498 won per ton. Therefore when we distribute and transport the government-held grains from production factories to consumption warehouses, using this Transportation Model of Linear Programming is benefitable. Especially excluding the cost of computer, we could save more than two billion won of Government budget per year.

• Journal of Digital Contents Society
• /
• v.8 no.3
• /
• pp.393-401
• /
• 2007

P2P systems have gained a lot of research interests and popularity over the years and have the capability to unleash and distribute awesome amounts of computing power, storage and bandwidths currently languishing - often underutilized - within corporate enterprises and every Internet connected home in the world. Since there is no central control over resources or devices and no before hand information about the resources or devices, device discovery remains a substantial problem in P2P environment. In this paper, we cover some of the current solutions to this problem and then propose our feed forward neural network (FFNN) based solution for device discovery in mobile P2P environment. We implements feed forward neural network (FFNN) trained with back propagation (BP) algorithm for device discovery and show, how large computation task can be distributed among such devices using agent technology. It also shows the possibility to use our architecture in home networking where devices have less storage capacity.

• 한국정보통신설비학회:학술대회논문집
• /
• 2005.08a
• /
• pp.382-387
• /
• 2005

There are many studies on arbitrarily divisible load scheduling problem in a distributed computing network consisting of processors interconnected through communication links. It is not efficient to arbitrarily distribute the load that comes into the system. In this paper, how to schedule in case that arbitrarily indivisible load comes into the system is studied. Also, the cases of the divisible load mixed with the indivisible load that come into network were dealt with optimal load distribution in parallel processing system by scheduling applied to linear programming.

• Journal of Information Processing Systems
• /
• v.10 no.2
• /
• pp.240-255
• /
• 2014

Cloud computing has increasingly been drawing attention these days. Each big company in IT hurries to get a chunk of meat that promises to be a whopping market in the future. At the same time, information is always associated with security and risk problems. Nowadays, the handling of these risks is no longer just a technology problem, with a good deal of literature focusing on risk or security management and framework in the information system. In this paper, we find the specific business meaning of the BMIS model and try to apply and leverage this model to cloud risk. Through a previous study, we select and determine the causal risk factors in cloud service, which are also known as CSFs (Critical Success Factors) in information management. Subsequently, we distribute all selected CSFs into the BMIS model by mapping with ten principles in cloud risk. Finally, by using the leverage points, we try to leverage the model factors and aim to make a resource-optimized, dynamic, general risk control business model for cloud service providers.

• Annual Conference of KIPS
• /
• 2009.11a
• /
• pp.109-110
• /
• 2009

최근 IT산업의 화두인 클라우드 컴퓨팅에서, HDFS는 널리 사용되고 있는 분산 파일 시스템이다. HDFS는 분산된 데이터의 저장과 검색의 장점이 있는 반면, 대용량 파일처리를 목적으로 설계되었기 때문에 실시간 파일처리와 저용량 데이터 처리에 비효율적이다. 본 논문에서는 이러한 문제를 해결하기 위해 HDFS의 파일 처리 과정을 개선하여 저용량 파일 처리를 향상시키는 방법을 제안한다. 본 기법은 데이터 블록에 저용량 파일들을 병합함으로써 데이터 처리의 효율성을 높이는 결과를 보였다.

• Journal of information and communication convergence engineering
• /
• v.21 no.4
• /
• pp.261-267
• /
• 2023

Public research, which requires large computational resources, utilizes the supercomputers of the National Supercomputing Center in the Republic of Korea. The average utilization rate of resources over the past three years reached 80%. Therefore, to ensure the operational stability of this national infrastructure, specialized centers have been established to distribute the computational demand concentrated in the national centers. It is necessary to predict the computational demand accurately to build an appropriate resource scale. Therefore, it is important to estimate the inflow and outflow of computational demand between the national and specialized centers to size the resources required to construct specialized centers. We conducted a logit model analysis using the probabilistic utility theory to derive the preferences of individual users for future supercomputer resources. This analysis shows that the computational demand share of specialized centers is 59.5%, which exceeds the resource utilization plan of existing specialized centers.