• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.28 no.3
• /
• pp.643-653
• /
• 2018

Xamarin is a representative cross-platform development framework that allows developers to write mobile apps in C# for multiple mobile platforms, such as Android, iOS, or Windows Phone. Using Xamarin, mobile app developers can reuse existing C# code and share significant code across multiple platforms, reducing development time and maintenance costs. Meanwhile, malware authors can also use Xamarin to spread malicious apps on more platforms, minimizing the time and cost of malicious app creation. In order to cope with this problem, it is necessary to analyze and detect malware written with Xamarin. However, little studies have been conducted on static analysis methods of the apps written in Xamarin. In this paper, we examine the structure of Android apps written with Xamarin and propose a static analysis technique for the apps. We also demonstrate how to statically reverse-engineer apps that have been transformed using code obfuscation. Because the Android apps written with Xamarin consists of Java bytecode, C# based DLL libraries, and C/C++ based native libraries, we have studied static reverse engineering techniques for these different types of code.

• The KIPS Transactions:PartD
• /
• v.14D no.1 s.111
• /
• pp.21-34
• /
• 2007

According to recent rapid price drop and capacity growth of main memory, the number of applications on main memory databases is dramatically increasing. Cache miss, which means a phenomenon that the data required by CPU is not resident in cache and is accessed from main memory, is one of the major causes of performance degradation of main memory databases. Several cache-conscious trees have been proposed for reducing cache miss and making the most use of cache in main memory databases. Since each cache-conscious tree has its own unique features, more than one cache-conscious tree can be used in a single application depending on the application's requirement. Moreover, if there is no existing cache-conscious tree that satisfies the application's requirement, we should implement a new cache-conscious tree only for the application's sake. In this paper, we propose the cache-conscious generalized search tree (CC-GiST). The CC-GiST is an extension of the disk-based generalized search tree (GiST) [HNP95] to be tache-conscious, and provides the entire common features and algorithms in the existing cache-conscious trees including pointer compression and key compression techniques. For implementing a cache-conscious tree based on the CC-GiST proposed in this paper, one should implement only a few functions specific to the cache-conscious tree. We show how to implement the most representative cache-conscious trees such as the CSB+-tree, the pkB-tree, and the CR-tree based on the CC-GiST. The CC-GiST eliminates the troublesomeness caused by managing mire than one cache-conscious tree in an application, and provides a framework for efficiently implementing arbitrary cache-conscious trees with new features.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.21 no.11
• /
• pp.884-891
• /
• 2020

The collapse of bridges can cause massive casualties and economic losses. Therefore, it is thus essential to evaluate the structural safety of bridges. For this task, structural reliability analysis, considering various bridge-related uncertainty factors, is often used. This paper proposes a new computational platform to perform structural reliability analysis for bridges and evaluate their structural safety under various loading conditions. For this purpose, a software package of reliability analysis, Finite Element Reliability Using MATLAB (FERUM), was integrated with MIDAS/CIVIL, which is a widely-used commercial software package specialized for bridges. Furthermore, a graphical user interface (GUI) control module has been added to FERUM to overcome the limitations of software operation. In this study, the proposed platform was applied to a simple frame structure, and the analysis results of the FORM (First-Order Reliability Method) and MCS (Monte Carlo simulation), which are representative reliability analysis methods, were compared. The proposed platform was verified by confirming that the calculated failure probability difference was less than 5%. In addition, the structural safety of a pre-stressed concrete (PSC) bridge was evaluated considering the KL-510 vehicle model. The proposed new structural reliability analysis platform is expected to enable an effective reliability-based safety evaluation of bridges.

• Journal of KIISE
• /
• v.42 no.3
• /
• pp.307-319
• /
• 2015

Current ontology studies use the Hadoop distributed storage framework to perform map-reduce algorithm-based reasoning for scalable ontologies. In this paper, however, we propose a novel approach for scalable Web Ontology Language (OWL) Horst Lite ontology reasoning, based on distributed cluster memories. Rule-based reasoning, which is frequently used for scalable ontologies, iteratively executes triple-format ontology rules, until the inferred data no longer exists. Therefore, when the scalable ontology reasoning is performed on computer hard drives, the ontology reasoner suffers from performance limitations. In order to overcome this drawback, we propose an approach that loads the ontologies into distributed cluster memories, using Spark (a memory-based distributed computing framework), which executes the ontology reasoning. In order to implement an appropriate OWL Horst Lite ontology reasoning system on Spark, our method divides the scalable ontologies into blocks, loads each block into the cluster nodes, and subsequently handles the data in the distributed memories. We used the Lehigh University Benchmark, which is used to evaluate ontology inference and search speed, to experimentally evaluate the methods suggested in this paper, which we applied to LUBM8000 (1.1 billion triples, 155 gigabytes). When compared with WebPIE, a representative mapreduce algorithm-based scalable ontology reasoner, the proposed approach showed a throughput improvement of 320% (62k/s) over WebPIE (19k/s).

• Journal of Korean Society of Steel Construction
• /
• v.16 no.4 s.71
• /
• pp.397-406
• /
• 2004

This paper presents the test and evaluation results on the shear strength and stiffness of a light steel stud wall from a lightweight foamed mortar (lightweight hybrid wall). The use of a lightweight foamed mortar was aimed at improving structural performance, thermal performance, and finish. Studiesshowed that it did not affect thermal performance, but it contributed to structural performance and finish when the unit weight was more than 0.8 (Editor's note: Please indicate the unit of measurement.). In this study, 14 specimens-whose parameters included the specific gravity of the lightweight foamed mortar (0.6, 0.8, 1.0, 1.2), the spacing of the stud (450 mm, 600 mm, or 900 mm), finishing materials (such as lightweight foamed mortar, OSB, and gypsum board), and bracing-were manufactured. Three typical, steel house-framing specimens were added to compare the test results with the 14 specimens. The results of in-plane shear tests show that the use of lightweight foamed mortar (1.15~5.38 times stronger, 1.45~13.7 times stiffer) results in ultimate strength and initial stiffness. In addition, it was possible to widen the stud spacing to up to 900 mm without decreasing shear strength. It was very important to prevent the lightweight foamed mortar from shrinking and to secure the adhesion between the steel stud and the lightweight foamed mortar to improve structural performance.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.17 no.7
• /
• pp.49-53
• /
• 2016

Recently, the use of signal compression methods to improve the efficiency of wireless networks have increased. In particular, the MPC system was used in the pitch extraction method and the excitation source of voiced and unvoiced to reduce the bit rate. In general, the MPC system using an excitation source of voiced and unvoiced would result in a distortion of the synthesis speech waveform in the case of voiced and unvoiced consonants in a frame. This is caused by normalization of the synthesis speech waveform in the process of restoring the multi-pulses of the representation segment. This paper presents an ACFBD-MPC (Amplitude Compensation Frequency Band Division-Multi Pulse Coding) using amplitude compensation in a multi-pulses each pitch interval and specific frequency to reduce the distortion of the synthesis speech waveform. The experiments were performed with 16 sentences of male and female voices. The voice signal was A/D converted to 10kHz 12bit. In addition, the ACFBD-MPC system was realized and the SNR of the ACFBD-MPC estimated in the coding condition of 8kbps. As a result, the SNR of ACFBD-MPC was 13.6dB for the female voice and 14.2dB for the male voice. The ACFBD-MPC improved the male and female voice by 1 dB and 0.9 dB, respectively, compared to the traditional MPC. This method is expected to be used for cellular telephones and smartphones using the excitation source with a low bit rate.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.23 no.3
• /
• pp.445-457
• /
• 2013

This paper is about the study to build a quantitative methodology to assess cyber threats and vulnerabilities on control systems. The SCADA system in power industry is one of the most representative and biggest control systems. The SCADA system was originally a local system but it has been extended to wide area as both ICT and power system technologies evolve. Smart Grid is a concept to integrate energy and IT systems, and therefore the existing cyber threats might be infectious to the power system in the integration process. Power system is operated on a real time basis and this could make the power system more vulnerable to the cyber threats. It is a unique characteristic of power systems different from ICT systems. For example, availability is the most critical factor while confidentiality is the one from the CIA triad of IT security. In this context, it is needed to reflect the different characteristics to assess cyber security risks in power systems. Generally, the risk(R) is defined as the multiplication of threat(T), vulnerability(V), and asset(A). This formula is also used for the quantification of the risk, and a conceptual methodology is proposed for the objective in this study.

• The Journal of the Korea Contents Association
• /
• v.14 no.3
• /
• pp.103-112
• /
• 2014

Oh, hein-kuhn is a representative portrait photographer in Korea. His works, , , , which treated portraits of women are a bit different from those of the past that described the appearance of characters. The artist expressed the figure of inner side that conflicts and feels uneasy between 'family and society' and 'child and woman' along with the look of character. That is, he included specific aura which the whole of aunts and girls' group radiates by showing similar photos repeatedly, that we can be aware of 'aunt' and 'girl' by seeing them. The important technique of Oh, hein-kuhn's Portrait Photograph is 'repetition' of image. The artist delivers the meaning of the photo by looking at the character upright in the front and showing photos with similar frame repeatedly. Such form and content of the work as this might feel a bit boring, since it's very simple just like identification picture. However, the photos in the frames which do not move in the fixed position can deliver the meaning of work more clearly rather than the image which expresses flowing time and moving space, we can grasp the message that the artist intends to deliver rather quickly. In the environment of photograph production mainly with image transformation, Oh, hein-kuhn's works of authentic original work method definitely stand forth. Through the portraits of aunts and girls, the artist tells an aspect of our society and we reconfirm the reality through the portraits made by him.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.4
• /
• pp.173-180
• /
• 2014

Compressive sensing is a new signal acquisition paradigm that enables sparse/compressible signal to be sampled under the Nyquist-rate. To fully benefit from its much simplified acquisition process, huge efforts have been made on improving the performance of compressive sensing recovery. However, concerning color images, compressive sensing recovery lacks in addressing image characteristics like energy distribution or human visual system. In order to overcome the problem, this paper proposes a new group-sparsity hard thresholding process by preserving some RGB-grouped coefficients important in both terms of energy and perceptual sensitivity. Moreover, a smoothed group-sparsity iterative hard thresholding algorithm for compressive sensing of color images is proposed by incorporating a frame-based filter with group-sparsity hard thresholding process. In this way, our proposed method not only pursues sparsity of image in transform domain but also pursues smoothness of image in spatial domain. Experimental results show average PSNR gains up to 2.7dB over the state-of-the-art group-sparsity smoothed recovery method.

• Journal of the Institute of Convergence Signal Processing
• /
• v.12 no.4
• /
• pp.274-280
• /
• 2011

Due to their rapid growth and new paradigm applications, wireless sensor networks(WSNs) are morphing into low power personal area networks(LoWPANs), which are envisioned to grow radically. The fragmentation and reassembly of IP data packet is one of the most important function in the 6LoWPAN based communication between Internet and wireless sensor network. However, since the 6LoWPAN data unit size is 102 byte for IPv6 MTU size is 1200 byte, it increases the number of fragmentation and reassembly. In order to reduce the number of fragmentation and reassembly, this paper presents a new scheme that can be applicable to 6LoWPAN. When a fragmented packet header is constructed, we can have more space for data. This is because we use 8-bits routing table ill instead of 16-bits or 54-bits MAC address to decide the destination node. Analysis shows that our design has roughly 7% or 22% less transmission number of fragmented packets, depending on MAC address size(16-bits or 54-bits), compared with the previously proposed scheme in RFC4944. The reduced fragmented packet transmission means a low power consumption since the packet transmission is the very high power function in wireless sensor networks. Therefore the presented fragmented transmission scheme is well suited for low-power wireless sensor networks.