• International Journal of Control, Automation, and Systems
• /
• v.2 no.3
• /
• pp.279-288
• /
• 2004

This paper presents a novel design for a tubular linear brushless permanent-magnet motor. In this design, the magnets in the moving part are oriented in an NS-NS―SN-SN fashion which leads to higher magnetic force near the like-pole region. An analytical methodology to calculate the motor force and to size the actuator was developed. The linear motor is operated in conjunction with a position sensor, three power amplifiers, and a controller to form a complete solution for controlled precision actuation. Real-time digital controllers enhanced the dynamic performance of the motor, and gain scheduling reduced the effects of a nonlinear dead band. In its current state, the motor has a rise time of 30 ms, a settling time of 60 ms, and 25% overshoot to a 5-mm step command. The motor has a maximum speed of 1.5 m/s and acceleration up to 10 g. It has a 10-cm travel range and 26-N maximum pull-out force. The compact size of the motor suggests it could be used in robotic applications requiring moderate force and precision, such as robotic-gripper positioning or actuation. The moving part of the motor can extend significantly beyond its fixed support base. This reaching ability makes it useful in applications requiring a small, direct-drive actuator, which is required to extend into a spatially constrained environment.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.9
• /
• pp.2320-2331
• /
• 1999

Over the Internet, in order to utilize a collection of idle computers as a parallel computing platform, we propose a new scheme called GICE(Global Internet Computing Environment). GICE is motivated to obtain high programmability, efficient support for heterogeneous computing resources, system scalability, and finally high performance. The programming model of GICE is based on a single address space. GICE is featured with a Java based programming environment, a dynamic resource management scheme, and efficient parallel task scheduling and execution mechanisms. Based on a prototype implementation of GICE, we address the concept, feasibility, complexity and performance of Internet computing.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.9
• /
• pp.1573-1595
• /
• 2011

In this paper, the outage performance of multiuser multiple-input single-output (MISO) systems exploiting joint spatial and multiuser diversities is investigated for Rayleigh fading channels with outdated feedback. First, we derive closed-form exact outage probabilities for the joint diversity schemes that combine user scheduling with different spatial diversity techniques, including: 1) transmit maximum-ratio combining (TMRC); 2) transmit antenna selection (TAS); and 3) orthogonal space-time block coding (OSTBC). Then the asymptotic outage probabilities are analyzed to gain more insights into the effect of feedback delay. It is observed that with outdated feedback, the asymptotic diversity order of the multiuser OSTBC (M-OSTBC) scheme is equal to the number of transmit antennas at the base station, while that of the multiuser TMRC (M-TMRC) and the multiuser TAS (M-TAS) schemes reduce to one. Further by comparing the asymptotic outage probabilities, it is found that the M-TMRC scheme outperforms the M-TAS scheme, and the M-OSTBC scheme can perform best in the outage regime of practical interest when the feedback delay is large. Theoretical analysis is verified by simulation results.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.21 no.2
• /
• pp.1-6
• /
• 2021

In this paper, an efficient implementation of AES encryption algorithm is presented for CCTV image security using C# language. In this approach, an efficient S-Box is first designed for reducing the computation time which is required in each round process of AES algorithm, and then an CCTV image security system is implemented on the basis of this algorithm on a composite field GF(((22)2)2). In addition, the shared S-Box structure is designed for realizing the minimized memory space, which is used in each round transformation and key scheduling processes. Through performance evaluation, it was confirmed that the proposed method is more efficient than the existing method. The proposed CCTV system in C# language using Visual studio 2010.

• The Journal of the Korea Contents Association
• /
• v.18 no.12
• /
• pp.229-237
• /
• 2018

This paper considers effective timetable modules in order to easily satisfy various user requirements during scheduling timetables in universities. Noticing that the methods for allocating time blocks change according to the timetable modules, we suggest six models of symmetric timetable modules composed of 4 blocks, and show that our models have more benefits without any loss from the viewpoint of customers, if the suppliers consider the decreasing upper bound of ratio utilizing space resources. By adapting a concept of potentially determined blocks and suggesting their management strategies, finally, we accomplish a method for supporting flexibility and controllability when the universities timetables are scheduled.

• International conference on construction engineering and project management
• /
• 2015.10a
• /
• pp.328-332
• /
• 2015

By logging position data from GPS-equipped construction machines, we re-create daily activities as 3D animations to analyze performance and facilitate look-ahead scheduling. The 3D animation enables going back to any point in time and space to observe the activities as they took place. By segmenting data into a set of activities, it is possible to obtain actual measures of performance such as cycle times, production, speed profiles and idle times. The measures of performance can then be compared to those expected (e.g., theoretical speed profiles vs. observed profiles), and instances of significant difference can be flagged for further investigation. Idle times and queues that exceed prescribed thresholds can also be identified. In general, many of the traditional real-time performance analyses can be performed after the fact. Situations of interest can be identified automatically and the events in this manner enhances effective performance improvement in construction. The proposed research is explained and demonstrated using a real push-loaded earthmoving operation.

• International conference on construction engineering and project management
• /
• 2013.01a
• /
• pp.1-6
• /
• 2013

Concrete construction requires utilization of many temporary facilities such as formwork, shoring, and scaffolding. Appropriate use of these temporary facilities greatly impacts the quality, cost, schedule, and safety of concrete construction. The current practice in design and planning of temporary facilities is often manual, error-prone, and re-active based on construction site layout, status, and progress in the field. Early design and planning of temporary facilities for concrete construction using Building Information Modeling (BIM) technology offers a potential solution. Although some commercially-available software exists that assists in the generation of temporary facility designs, the construction industry lacks tools that support detailed planning and design of many other temporary facilities. This research presents our early work in automating the design and planning of temporary facilities utilizing BIM. Algorithms were developed to automatically assess geometric conditions of work space to detect required temporary facilities and design them. The proposed methodology was implemented in a test model. By automatically incorporating temporary facilities into BIM, more realistic construction models can be created with less effort and errors. Temporary facilities-loaded models can finally be used for communication, bill of materials, scheduling, etc. and as a benchmark for field installation of temporary formwork, shoring, and scaffolding systems.

• The KIPS Transactions:PartD
• /
• v.16D no.1
• /
• pp.113-122
• /
• 2009

Since the traditional pattern mining methods only probe unspecified moving patterns that seem to satisfy users' requests among diverse patterns within the limited scopes of time and space, they are not applicable to problems involving the mining of optimal moving patterns, which contain complex time and space constraints, such as 1) searching the optimal path between two specific points, and 2) scheduling a path within the specified time. Therefore, in this paper, we illustrate some problems on mining the optimal moving patterns with complex time and space constraints from a vast set of historical data of numerous moving objects, and suggest a new moving pattern mining method that can be used to search patterns of an optimal moving path as a location-based service. The proposed method, which determines the optimal path(most frequently used path) using pattern frequency retrieved from historical data of moving objects between two specific points, can efficiently carry out pattern mining tasks using by space generalization at the minimum level on the moving object's location attribute in consideration of topological relationship between the object's location and spatial scope. Testing the efficiency of this algorithm was done by comparing the operation processing time with Dijkstra algorithm and $A^*$ algorithm which are generally used for searching the optimal path. As a result, although there were some differences according to heuristic weight on $A^*$ algorithm, it showed that the proposed method is more efficient than the other methods mentioned.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.2 s.46
• /
• pp.231-242
• /
• 2007

The existing pattern mining methods[1,2,3,4,5,6,11,12,13] do not use location generalization method on the set of location history data of moving object, but even so they simply do extract only frequent patterns which have no spatio-temporal constraint in moving patterns on specific space. Therefore, it is difficult for those methods to apply to frequent pattern mining which has spatio-temporal constraint such as optimal moving or scheduling paths among the specific points. And also, those methods are required more large memory space due to using pattern tree on memory for reducing repeated scan database. Therefore, more effective pattern mining technique is required for solving these problems. In this paper, in order to develop more effective pattern mining technique, we propose new location generalization method that converts data of detailed level into meaningful spatial information for reducing the processing time for pattern mining of a massive history data set of moving object and space saving. The proposed method can lead the efficient spatial moving pattern mining of moving object using by creating moving sequences through generalizing the location attributes of moving object into 2D spatial area based on $R^*$-Tree and Area Grid Hash Table(AGHT) in preprocessing stage of pattern mining.

• Journal of Positioning, Navigation, and Timing
• /
• v.5 no.4
• /
• pp.193-202
• /
• 2016

The Korea Augmentation Satellite System (KASS), which is under development in Korea as a Satellite Based Augmentation System (SBAS) is expected to broadcast SBAS messages to air space in Korea according to the international standards defined by the International Civil Aviation Organization (ICAO) and the Radio Technical Commission for Aeronautics (RTCA). Around 13 SBAS messages are broadcast in every second to transmit augmentation information which can be applicable to a wide area in common. Each of the messages requires a different update interval and time-out according to the characteristics, purpose, and importance of transmitted information, and users should receive and combine multiple SBAS messages to calculate SBAS augmented information. Thus, a time to take acquiring first SBAS position by users differs depending on broadcasting various SBAS messages with which order and intervals. The present paper analyzes the considerations on message scheduling for broadcasting of KASS augmentation information and proposes a design of KASS message scheduler using the considerations. Compared to existing SBAS systems, which have a wide range of service area, a service area of the KASS is limited to Korea only. Thus, the numbers of ionosphere grid points and satellites to be augmented are expected to be smaller than those of existing SBAS. By reflecting this characteristic to the proposed design, shortening of broadcast interval of KASS message is verified compared to existing SBAS and a measure to increase a speed of acquisition of user navigation solution is proposed utilizing remaining message slots. The simulation result according to the proposed measure showed that the maximum broadcast interval can be reduced by up to 20% compared to that of existing SBAS, and users can acquire KASS position solution faster than existing SBAS.