• Smart Media Journal
• /
• v.3 no.1
• /
• pp.33-38
• /
• 2014

Even though the performance of microprocessor is improved continuously, the performance improvement of computing system becomes hard to increase, in order to some drawbacks including increased power consumption. To solve the problem, general-purpose computing on graphics processing units(GPGPUs), which execute general-purpose applications by using specialized parallel-processing device representing graphics processing units(GPUs), have been focused. However, the characteristics of applications related with graphics is substantially different from the characteristics of general-purpose applications. Therefore, GPUs cannot exploit the outstanding computational resources sufficiently due to various constraints, when they execute general-purpose applications. When designing GPUs for GPGPU, memory system is important to effectively exploit the GPUs since typically general-purpose applications requires more memory accesses than graphics applications. Especially, external memory access requiring long latency impose a big overhead on the performance of GPUs. Therefore, the GPU performance must be improved if hierarchical memory architecture which can reduce the number of external memory access is applied. For this reason, we will investigate the analysis of GPU performance according to hierarchical cache architectures in executing various benchmarks.

• Journal of Digital Convergence
• /
• v.14 no.7
• /
• pp.185-191
• /
• 2016

Recently, various medical services are provided with the advance of IT. However, there is a problem that a third party would exploit medical information when the information is sent and received through wired or wireless connection. In this paper, a patient information management scheme using group index information for the third party not to illegally exploit a patient's medical information without his consent is proposed. This proposed scheme creates index information in each hierarchical level to be used with access information so that not only medical staff can have access to patient's medical information hierarchically but also it can manage access level in groups. The scheme aims to enable the medical staff to minimize the time spent to analyze the type of disease and to prescribe for it so that they can improve patients' satisfaction. Plus, the scheme aims to improve work efficiency by minimizing the medical staff's workload according to the authority to access patients' medical information.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.46 no.5
• /
• pp.14-28
• /
• 2009

The PageRank algorithm is an important component for ranking Web pages in Google and other search engines. While many improvements for the original PageRank algorithm have been proposed, it is unclear which variations (and their combinations) provide the "best" ranked results. In this paper, we evaluate the ranking quality of the well-known variations of the original PageRank algorithm and their combinations. In order to do this, we first classify the variations into link-based approaches, which exploit the link structure of the Web, and knowledge-based approaches, which exploit the semantics of the Web. We then propose algorithms that combine the ranking algorithms in these two approaches and implement both the variations and their combinations. For our evaluation, we perform extensive experiments using a real data set of one million Web pages. Through the experiments, we find the algorithms that provide the best ranked results from either the variations or their combinations.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.45 no.3
• /
• pp.93-102
• /
• 2008

In this paper, we propose a rate control algorithm for constant quality real time video coding. To achieve constant quality, previous algorithm exploit mean absolute of difference(MAD) as measure of frame complexity. However, if scene is abruptly changed or if quantization parameter is not constant, encoder produces various output bits with same MAD. Therefore we know that MAD does not appropriately reflect characteristic of frame. To solve this problem, we exploit model parameter as measure of frame complexity. Because model parameter means slope between output bits and MAD, it reflects correctly complexity of frame. And because previous model, R-MAD model, is not considered quantization parameter, as quantization parameter increases or decreases, model parameter of frame also vary. So model parameter obtained using previous model cannot reflect internal characteristic of video. We solve this problem using proposed model, which is considered quantization parameter. Experiment results show that our algorithm provide better performance, in terms of quality smoothness than previous algorithm. Especially, when scene is abruptly changed, our algorithm alleviates quality drop.

• Advances in nano research
• /
• v.7 no.1
• /
• pp.39-49
• /
• 2019

This paper focuses on two main objectives. The first one is to exploit an energy equivalent model and finite element method to evaluate the equivalent Young's modulus of single walled carbon nanotubes (SWCNTs) at any orientation angle by using tensile test. The calculated Young's modulus is validated with published experimental results. The second target is to exploit the finite element simulation to investigate mechanical buckling and natural frequencies of SWCNTs. Energy equivalent model is presented to describe the atomic bonding interactions and their chemical energy with mechanical structural energies. A Program of Nanotube modeler is used to generate a geometry of SWCNTs structure by defining its chirality angle, overall length of nanotube and bond length between two adjacent nodes. SWCNTs are simulated as a frame like structure; the bonds between each two neighboring atoms are treated as isotropic beam members with a uniform circular cross section. Carbon bonds is simulated as a beam and the atoms as nodes. A finite element model using 3D beam elements is built under the environment of ANSYS MAPDL environment to simulate a tensile test and characterize equivalent Young's modulus of whole CNT structure. Numerical results are presented to show critical buckling loads, axial and transverse natural frequencies of SWCNTs with different orientation angles and lengths. The understanding of mechanical behaviors of CNTs are essential in developing such structures due to their great potential in wide range of engineering applications.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.22 no.4
• /
• pp.869-882
• /
• 2012

With the growth of Web services and the development of web exploit toolkits, web-based malware has increased dramatically. Using Javascript Obfuscation, recent web-based malware hide a malicious URL and the exploit code. Thus, pattern matching for network intrusion detection systems has difficulty of detecting malware. Though various methods have proposed to detect Javascript malware on a users' web browser, the overall detection is needed to counter advanced attacks such as APTs(Advanced Persistent Treats), aimed at penetration into a certain an organization's intranet. To overcome the limitation of previous pattern matching for network intrusion detection systems, a novel deobfuscating method to handle obfuscated Javascript is needed. In this paper, we propose a framework for effective hidden malware detection through an automated deobfuscation regardless of advanced obfuscation techniques with overriding JavaScript functions and a separate JavaScript interpreter through to improve jsunpack-n.

• Journal of the Korea Society of Computer and Information
• /
• v.26 no.2
• /
• pp.1-9
• /
• 2021

In this paper, we extend a generic library framework based on the state monad to exploit deterministic parallelism in a purely functional language Haskell and provide benchmarks for the extended features on a multicore machine. Although purely functional programs are known to be well-suited to exploit parallelism, unintended squential data dependencies could prohibit effective parallelism. Symbolic execution programs usually implement fresh name generation in order to prevent confusion between variables in different scope with the same name. Such implementations are often based on squential state management, working against parallelism. We provide reusable primitives to help developing parallel symbolic execution programs with unbound-genercis, a generic name-binding library for Haskell, avoiding sequential dependencies in fresh name generation. Our parallel extension does not modify the internal implementation of the unbound-generics library, having zero possibility of degrading existing serial implementations of symbolic execution based on unbound-genecrics. Therefore, our extension can be applied only to the parts of source code that need parallel speedup.

• International Journal of Computer Science & Network Security
• /
• v.24 no.2
• /
• pp.178-188
• /
• 2024

In the near future, it is expected that there will be billions of connected devices using fifth generation (5G) network services. The recently available base stations (BSs) need to mitigate their loads without changing and at the least monetary cost. The available spectrum resources are limited and need to be exploited in an efficient way to meet the ever-increasing demand for services. Device to Device communication (D2D) technology will likely help satisfy the rapidly increasing capacity and also effectively offload traffic from the BS by distributing the transmission between D2D users from one side and the cellular users and the BS from the other side. In this paper, we propose to apply D2D overlay communication with cognitive radio capability in 5G networks to exploit unused spectrum resources taking into account the dynamic spectrum access. The performance metrics; throughput and delay are formulated and analyzed for CSMA-based medium access control (MAC) protocol that utilizes a common control channel for device users to negotiate the data channel and address the contention between those users. Device users can exploit the cognitive radio to access the data channels concurrently in the common interference area. Estimating the achievable throughput and delay in D2D communication in 5G networks is not exploited in previous studies using cognitive radio with CSMA-based MAC protocol to address the contention. From performance analysis, applying cognitive radio capability in D2D communication and allocating a common control channel for device users effectively improve the total aggregated network throughput by more than 60% compared to the individual D2D throughput without adding harmful interference to cellular network users. This approach can also reduce the delay.

• International Journal of Control, Automation, and Systems
• /
• v.1 no.3
• /
• pp.289-300
• /
• 2003

In this paper, we introduce an identification method in Fuzzy Relation-based Fuzzy Neural Networks (FRFNN) through a hybrid identification algorithm. The proposed FRFNN modeling implement system structure and parameter identification in the efficient form of "If...., then... " statements, and exploit the theory of system optimization and fuzzy rules. The FRFNN modeling and identification environment realizes parameter identification through a synergistic usage of genetic optimization and complex search method. The hybrid identification algorithm is carried out by combining both genetic optimization and the improved complex method in order to guarantee both global optimization and local convergence. An aggregate objective function with a weighting factor is introduced to achieve a sound balance between approximation and generalization of the model. The proposed model is experimented with using two nonlinear data. The obtained experimental results reveal that the proposed networks exhibit high accuracy and generalization capabilities in comparison to other models.er models.

• Journal of Information Processing Systems
• /
• v.2 no.1
• /
• pp.6-12
• /
• 2006

Peer-to-Peer (P2P) networks are attracting considerable research interest because of their scalability and high performance relative to cost. One of the important services on a P2P network is the streaming service. However, because each node in the P2P network is autonomous, it is difficult to provide a stable streaming service on the network. Therefore, for a stable streaming service on the P2P network, a fault-tolerant scheme must be provided. In this paper, we propose two new node selection schemes, Playback Node First (PNF) and Playback Node first with Prefetching (PNF-P) that can be used for a service migration-based fault-tolerant streaming service. The proposed schemes exploit the fact that the failure probability of a node currently being served is lower than that of a node not being served. Simulation results show that the proposed schemes outperform traditional node selection schemes.