• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.11 no.6
• /
• pp.724-731
• /
• 2018

Code obfuscation is a technology that makes programs difficult to understand for the purpose of interpreting programs or preventing forgery or tampering. Inverse reading is a technology that analyzes the meaning of origin through reverse engineering technology by receiving obfuscated programs as input. This paper is an analysis of obfuscation and reverse-toxicization technologies for binary code in a virtualized-based environment. Based on VMAttack, a detailed analysis of static code analysis, dynamic code analysis, and optimization techniques were analyzed specifically for obfuscation and reverse-dipidization techniques before obfuscating and reverse-dipulation techniques. Through this thesis, we expect to be able to carry out various research on virtualization and obfuscation. In particular, it is expected that research from stack-based virtual machines can be attempted by adding capabilities to enable them to run on register-based virtual machines.

• Journal of the Korean Academy of Esthetic Dentistry
• /
• v.30 no.2
• /
• pp.71-90
• /
• 2021

The virtual patient dataset is a collection of diagnostic data from various sources acquired from a single patient into a coordinate system of three-dimensional visualization. Virtual patient dataset makes it possible to establish a treatment plan, simulate various treatment procedures, and create a treatment planning delivery device. Clinicians can design and simulate a patient's smile on the virtual patient dataset and select the optimal result from the diagnostic process. The selected treatment plan can be delivered identically to the patient using manufacturing techniques such as 3D printing, milling, and injection molding. The delivery of this treatment plan can be linked to the final prosthesis through mockup confirmation through provisional restoration fabrication and delivery in the patient's mouth. In this way, if the diagnostic data superimposition and processing accuracy during the manufacturing process are guaranteed, 3D digital smile design simulated in 3D visualization can be accurately delivered to the real patient. As a clinical application method of the virtual patient dataset, we suggest a decision-making method that can exclude occlusal adjustment treatment from the treatment plan through the digital occlusal pressure analysis. A comparative analysis of whole-body scans before and after temporomandibular joint treatment was suggested for adolescent idiopathic scoliosis patients with temporomandibular joint disease. Occlusal plane and smile aesthetic analysis based on the virtual patient dataset was presented when treating patients with complete dentures.

• KIISE Transactions on Computing Practices
• /
• v.22 no.10
• /
• pp.488-496
• /
• 2016

In this paper, we introduce a virtual reality interface for scientific visualization applications. Our VR interface is based on an open-source framework called VR Juggler. Although VR Juggler has its own advantages, it lacks some of the important functionalities needed for practical applications - event handling, synchronization and data sharing among cluster nodes, to name a few. We explain how these issues are resolved while developing the VR interface. Also, a new interface with a smart device, which replaces the virtual reality input device, is introduced. Finally, system usability test results are provided to prove the effectiveness of the proposed interfaces.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.2
• /
• pp.288-293
• /
• 2022

Recently, metaverse is becoming increasingly important in coding education. One of the most important elements in metaverse is interaction in 3D virtual space. However, most existing education methods still utilize metaverse for unidirectional education without making use of interaction. This paper proposes a new method of using metaverse for bidirectional coding education. In the metaverse virtual space, a professor and students are able to share their PC screens for monitoring purposes. Also, once a student sends a request to the professor, the professor can immediately provide proper feedback (such as source codes correction) through access control. This metaverse virtual space is able to include more than two professors that allows for a many-to-many coding education. This paper presents a way of constructing the metaverse environment and teaching scenario, followed by the descriptions of the advantages and requirements for the proposed method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.3A
• /
• pp.287-295
• /
• 2010

In wireless sensor networks(WSNs), the studies that support sink mobility without global position information exploit a Backbone-based Virtual Infrastructure (BVI) which considers one-hop clusters and a backbone-based tree. Since the clusters of a sink and a source node are connected via flooding into the infrastructure, it causes high routing cost. Although the network could reduce the number of clusters via multi-level clusters, if the source nodes exist at nearest clusters from the cluster attached by the sink and they are in different branches of the tree, the data should be delivered via detour paths on the tree. Therefore, to reduce the number of clusters, we propose a novel multi-hop cluster based communication protocol supporting sink mobility without global position information. We exploit a rendezvous cluster head for sink location service and data dissemination but the proposed protocol effectively reduces data detour via comparing cluster hops from the source. Simulation shows that the proposed protocol is superior to the existing protocols in terms of the data delivery hop counts.

• Smart Media Journal
• /
• v.6 no.3
• /
• pp.15-20
• /
• 2017

Recently, the automotive industry has been studied about driver assistance systems for helping drivers to drive their cars easily by integrating them with the IT technology. This study suggests a method of detecting lanes, robust to road condition changes and applicable to lane departure warning and autonomous vehicles mode. The proposed method uses the method of detecting candidate areas by using the Gaussian filter and by determining the Otsu threshold value and edge. Moreover, the proposed method uses lane gradient and width information through the Hough transform to detect lanes. The method uses road lane information detected before to detect dashed lines as well as solid lines, calculates routes in which the lanes will be located in the next frame to draw virtual lanes. The proposed algorithm was identified to be able to detect lanes in both dashed- and solid-line situations, and implement real-time processing where applied to Raspberry Pi 2 which is open source hardware.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.5
• /
• pp.103-112
• /
• 2007

In this paper, we implement a hypervisor that runs multiple uC/OS-II real-time kernels on one microprocessor. The hypervisor virtualizes microprocessor and memory that are main resources managed by uC/OS-II kernel. Microprocessor is virtualized by controlling interrupts that uC/OS-II real-time kernel handles and memory is virtualized by partitioning physical memory. The hypervisor consists of three components: interrupt control routines that virtualize timer interrupt and software interrupt, a startup code that initializes the hypervisor and uC/OS-II kernels, and an API that provides communication between two kernels. The original uC/OS-II kernel needs to be modified slightly in source-code level to run on the hypervisor. We performed a real-time test and an independent computation test on Jupiter 32-bit EISC microprocessor and showed that the virtualized kernels run without problem. The result of our research can reduce the hardware cost, the system space and weight, and system power consumption when the hypervisor is applied in embedded applications that require many embedded microprocessors.

• The KIPS Transactions:PartA
• /
• v.16A no.6
• /
• pp.453-462
• /
• 2009

Studies on software plagiarism detection, prevention and judgement have become widespread due to the growing of interest and importance for the protection and authentication of software intellectual property. Many previous studies focused on comparing all pairs of submitted codes by using attribute counting, token pattern, program parse tree, and similarity measuring algorithm. It is important to provide a clear-cut model for distinguishing plagiarism and collaboration. This paper proposes a source code clustering algorithm using a probability model on extreme value distribution. First, we propose an asymmetric distance measure pdist($P_a$, $P_b$) to measure the similarity of $P_a$ and $P_b$ Then, we construct the Plagiarism Direction Graph (PDG) for a given program set using pdist($P_a$, $P_b$) as edge weights. And, we transform the PDG into a Gumbel Distance Graph (GDG) model, since we found that the pdist($P_a$, $P_b$) score distribution is similar to a well-known Gumbel distribution. Second, we newly define pseudo-plagiarism which is a sort of virtual plagiarism forced by a very strong functional requirement in the specification. We conducted experiments with 18 groups of programs (more than 700 source codes) collected from the ICPC (International Collegiate Programming Contest) and KOI (Korean Olympiad for Informatics) programming contests. The experiments showed that most plagiarized codes could be detected with high sensitivity and that our algorithm successfully separated real plagiarism from pseudo plagiarism.

• Journal of Korea Multimedia Society
• /
• v.14 no.1
• /
• pp.33-43
• /
• 2011

Routing technologies considering QoS-based hypermedia services have been seen as a crucial network property in next generation optical Internet (NGOI) networks based on IP/dense-wavelength division multiplexing (DWDM). The huge potential capacity of one single fiber. which is in Tb/s range, can be exploited by applying DWDM technology which transfers multiple data streams (classified and aggregated IP traffics) on multiple wavelengths (classified with QoS-based) simultaneously. So, DWDM-based optical networks have been a favorable approach for the next generation optical backbone networks. Finding a qualified path meeting the multiple constraints is a multi-constraint optimization problem, which has been proven to be NP-complete and cannot be solved by a simple algorithm. The majority of previous works in DWDM networks has viewed heuristic QoS routing algorithms (as an extension of the current Internet routing paradigm) which are very complex and cause the operational and implementation overheads. This aspect will be more pronounced when the network is unstable or when the size of network is large. In this paper, we propose a flooding-based unicast and multicast QoS routing methodologies(YS-QUR and YS-QMR) which incur much lower message overhead yet yields a good connection establishment success rate. The simulation results demonstrate that the YS-QUR and YS-QMR algorithms are superior to the previous routing algorithms.

• Korean Journal of Agricultural and Forest Meteorology
• /
• v.13 no.2
• /
• pp.101-108
• /
• 2011

Climate change could have a pronounced impact on natural and agricultural ecosystems. To assess the impact of climate change, projected climate data have been used as inputs to models. Because such studies are conducted occasionally, it would be useful to employ Cloud computing, which provides multiple instances of operating systems in a virtual environment to do processing on demand without building or maintaining physical computing resources. Furthermore, it would be advantageous to use open source geospatial applications in order to avoid the limitations of proprietary software when Cloud computing is used. As a pilot study, Amazon Web Service ? Elastic Compute Cloud (EC2) was used to calculate the number of days with rain in a given month. Daily sets of climate projection data, which were about 70 gigabytes in total, were processed using virtual machines with a customized database transaction application. The application was linked against open source libraries for the climate data and database access. In this approach, it took about 32 hours to process 17 billion rows of record in order to calculate the rain day on a global scale over the next 100 years using ten clients and one server instances. Here I demonstrate that Cloud computing could provide the high level of performance for impact assessment studies of climate change that require considerable amount of data.