• Journal of Korean Ophthalmic Optics Society
• /
• v.9 no.1
• /
• pp.1-9
• /
• 2004

In this study, we presented a research about the development of the phoropter simulation program for education using the 3-D virtual reality in order to study the ophthalmic optics rather efficiently. Especially, by putting the facility such as the refractive error analysis of the eyeball in the cyber tutor inside, we have made the learner to learn and confirm the present situation of refractive correction through refractive power of principal meridians. By organizing the system which induces the active involvement of the learner and showing the result of the execution to the learner intuitively, the implementation of the more efficient education-environment can be possible. Consequently, it is expected that this program will be greatly helpful for the optician training as well as the ophthalmic optics education. As a next phase of study, we will develope the development technique of this simulator more and extend the cyber tutor contents more and make the web service version of this program to be provided through the internet network in order to inspire the learning desire of the learner more and more.

• Journal of KIISE:Computing Practices and Letters
• /
• v.8 no.2
• /
• pp.183-194
• /
• 2002

The clustering environment with heterogeneous workstations provides the cost effectiveness and usability for executing applications in parallel. Load balancing is considered a necessary feature for a cluster of heterogeneous workstations to minimize the turnaround time. Previously, static load balancing that assigns a predetermined weight for the processing capability of each workstation, or dynamic approaches which execute a benchmark program to get relative processing capability of each workstation were proposed. The execution of the benchmark program, which has nothing to do with the application being executed, consumes the computation time and the overall turnaround time is delayed. In this paper, we present efficient methods for task distribution and task migration, based on the relative load index. We designed and implemented a load balancing system for the clustering environment with heterogeneous workstations. Turnaround times of our methods and the round-robin approach, as well as the load balancing method using a benchmark program, were compared. The experimental results show that our methods outperform all the other methods that we compared.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.7
• /
• pp.775-787
• /
• 2010

Unlike general-purpose CPUs, the GPUs have been specialized as many-core streaming processors, and are frequently replacing the CPUs in an increasing range of computations thanks to their outstanding parallel computing capacity. In order to respond to such trend, NVIDIA has recently issued a new parallel computing architecture called CUDA(Compute Unified Device Architecture), offering a flexible GPU programming environment for GPGPU(General Purpose GPU) computing. In general, when programmers use the CUDA API, they should clearly understand many aspects of GPU's computing architecture to produce efficient parallel software. In this article, we explain several optimization techniques for CUDA programming that we have verified through a lot of experiment and trial and error, and review how those techniques affect the performance of code execution. In particular, we use a specific problem as an example to analyze several elements that affect performances, such as effective accesses to hierarchical memory system, processor occupancy, and latency hiding. In conclusion, we present several directions that may be utilized effectively in CUDA-based parallel programming.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.42 no.4
• /
• pp.183-193
• /
• 2019

Process mining is an analytical technique aimed at obtaining useful information about a process by extracting a process model from events log. However, most existing process models are deterministic because they do not include stochastic elements such as the occurrence probabilities or execution times of activities. Therefore, available information is limited, resulting in the limitations on analyzing and understanding the process. Furthermore, it is also important to develop an efficient methodology to discover the process model. Although genetic process mining algorithm is one of the methods that can handle data with noises, it has a limitation of large computation time when it is applied to data with large capacity. To resolve these issues, in this paper, we define a stochastic process tree and propose a tabu search-genetic process mining (TS-GPM) algorithm for a stochastic process tree. Specifically, we define a two-dimensional array as a chromosome to represent a stochastic process tree, fitness function, a procedure for generating stochastic process tree and a model trace as a string of activities generated from the process tree. Furthermore, by storing and comparing model traces with low fitness values in the tabu list, we can prevent duplicated searches for process trees with low fitness value being performed. In order to verify the performance of the proposed algorithm, we performed a numerical experiment by using two kinds of event log data used in the previous research. The results showed that the suggested TS-GPM algorithm outperformed the GPM algorithm in terms of fitness and computation time.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.6
• /
• pp.2422-2443
• /
• 2020

This paper studies a single-user Mobile Edge Computing (MEC) system where mobile device (MD) includes an application consisting of multiple computation components or tasks with dependencies. MD can offload part of each computation-intensive latency-sensitive task to the AP integrated with MEC server. In order to accomplish the application faultlessly, we calculate out the optimal task offloading strategy in a time-division manner for a predetermined execution order under the constraints of limited computation and communication resources. The problem is formulated as an optimization problem that can minimize the energy consumption of mobile device while satisfying the constraints of computation tasks and mobile device resources. The optimization problem is equivalently transformed into solving a nonlinear equation with a linear inequality constraint by leveraging the Lagrange Multiplier method. And the proposed dual Bi-Section Search algorithm Bi-JOTD can efficiently solve the nonlinear equation. In the outer Bi-Section Search, the proposed algorithm searches for the optimal Lagrangian multiplier variable between the lower and upper boundaries. The inner Bi-Section Search achieves the Lagrangian multiplier vector corresponding to a given variable receiving from the outer layer. Numerical results demonstrate that the proposed algorithm has significant performance improvement than other baselines. The novel scheme not only reduces the difficulty of problem solving, but also obtains less energy consumption and better performance.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.4
• /
• pp.119-130
• /
• 2012

Recently, the software system is getting complicating and the customers are requiring faster development. For the traditional sequential approach can't against this problem iterative approach is used instead. For the representative iterative approach, there is RUP (Rational's Unified Process). However, RUP standard practical methods are phase, iteration, and disciplines, sequentially. As a result, there's some waste of manpower when a discipline is executed in an iteration, it has to wait till the next same discipline is executed. There are linear approach, sequential approach, overlapped iteration approach, and time-boxed iteration for the efficient execution of RUP. However, they have some problems such as waste of manpower or difficulty in the project management. This paper suggests a method about how to execute the disciplines as a concurrent type. The concurrent approach prevents the waste of manpower and solves the difficulty of project management.

• Journal of KIISE:Software and Applications
• /
• v.35 no.5
• /
• pp.281-287
• /
• 2008

Data transfers occur during the execution time of a Java program, from constant to variable, from variable to other variable and so on. Data are located in memory and hence data transfer requires access to memory. As memory access generates both time delay and energy consumption it is absolutely necessary to know the data transfer overheads incurred among different paths not only to write an efficient program but also to build a high-performance Java virtual machine. In this paper we classify Java memory into three different regions, constant, local variable, and field, and then investigate data transfer overheads among these regions. The result says that the transfer between local variables incur the least overhead usually, while the transfer between fields incur the most. The difference of overheads reaches up to a double. Optimization techniques like JIT reduces the data transfer overhead dramatically. It is observed that the overhead is reduced from 14 to 27 times for the case of Hotspot JVM.

• The Journal of Society for e-Business Studies
• /
• v.9 no.2
• /
• pp.183-201
• /
• 2004

Not only Enterprise Application Integration (EAI) within a company but also business-to-business integration (B2Bi) should be achieved for companies to collaborate seamlessly through the Internet. There have been great efforts in this area of EAI and B2Bi, resulting in lots of solutions in the market. However, EAI and B2Bi systems have been designed and operated in independent platforms and environments causing a serious problem of integrating EAI and B2Bi systems. In this paper we have proposed a business integration platform for connecting EAI and B2Bi systems in a uniform architecture and also coping with changes in business environments. In the integration platform proposed in this work, collaboration processes between B2B companies can be performed using Web Services technology widely considered as B2B integration platform. Especially, we have defined basic business execution elements based on a thorough analysis of various business integration standards and developed an efficient and extensible business process engine for B2B collaboration process management. A Web-based order processing system is developed for validation of our integration platform. It is expected that the level of B2B collaboration can be enhanced using the integration platform and furthermore it will contribute to more collaborative B2B commerce.

• International Journal of Naval Architecture and Ocean Engineering
• /
• v.11 no.2
• /
• pp.699-722
• /
• 2019

It is difficult to observe the potential risks of lifting or turn-over operations in the early stages before a real operation. Therefore, many dynamic simulations have been designed to predict the risks and to reduce the possibility of accidents. These simulations, however, have usually been performed for predetermined and fixed scenarios, so they do not reflect the real-time control of an operator that is one of the most important influential factors in an operation; additionally, lifting or turn-over operations should be a collaboration involving more than two operators. Therefore, this study presents an integrated method for a collaborative simulation that allows multiple workers to operate together in the virtual world. The proposed method is composed of four components. The first component is a dynamic analysis that is based on multibody-system dynamics. The second component is VR (virtual reality) for the generation of realistic views for the operators. The third component comprises the control devices and the scenario generator to handle the crane in the virtual environment. Lastly, the fourth component is the HLA (high-level architecture)-based integrated simulation interface for the convenient and efficient exchange of the data through the middleware. To show the applicability of the proposed method, it has been applied to a block turn-over simulation for which one floating crane and two crawler cranes were used, and an offshore module installation for which a DCR (dual-crane rig) was used. In conclusion, the execution of the proposed method of this study is successful regarding the above two applications for which multiple workers were involved.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.5 s.43
• /
• pp.127-137
• /
• 2006

We propose two phase filtering scheme to develop an efficient mechanism for XML databases to control query-based access. An access control environment for XML documents and some techniques to deal with fine-grained authorization priorities and conflict resolution issues are proposed. Despite this, relatively little work has been done to enforce access controls particularly for XML databases in the case of query-based access. The basic idea utilized is that a user query interaction with only necessary access control rules is modified to an alternative form through a query optimization technique, which is guaranteed to have no access violations using tree-aware metadata of XML schemas. The scheme can be applied to any XML database management system and has several advantages such as small execution time overhead, fine-grained controls, and safe and correct query modification. The experimental results clearly demonstrate the efficiency of the approach.