• Proceedings of the Korea Information Processing Society Conference
• /
• 2012.11a
• /
• pp.750-751
• /
• 2012

스마트폰의 급속한 확산과 함께 스마트폰 애플리케이션 시장이 빠르게 성장하고 있다. 이러한 성장세에 따라 많은 애플리케이션 개발자들이 생겨났으며, 다양한 콘텐츠와 수많은 애플리케이션이 개발되어지고 있다. 여기서 우리는 모바일 기기들의 제한적인 요소를 간과해서는 안 된다. 제한적인 모바일기기에서 유저가 만족할 만할 애플리케이션을 개발하기 위해서는 효율적인 자원 활용과 함께 효율적인 프로그래밍을 해야 할 필요가 있다. 본 논문은 안드로이드 NDK 및 SDK를 기반으로 Native C와 Java를 이용해 애플리케이션을 설계하고, 각 애플리케이션간의 알고리즘 수행속도, 프로세서 점유율측면에서 성능측정 실험을 수행했다. 실험 결과를 통해 보다 우수한 성능의 안드로이드 애플리케이션 개발 방법에 관해 연구했다. 성능측정 항목으로는 JNI delay, Integer, Floating point, Memory access algorithm, String이며, 실험은 삼성 갤럭시 S1에서 수행하였다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2004.05a
• /
• pp.157-160
• /
• 2004

본 논문은 미국 차세대 디지털 케이블 방송 표준 규격인 오픈케이블($OpenCable^{TM}$)의 수신제한 모듈인 CableCard의 Physical Layer를 SystemC의 TLM(Transaction Level Modeling)과 RTL(Register-Transfer Level) 모델링 기법으로 설계하였다. 본 논문에서 설계한 CableCard의 Physical Layer는 PCMCIA Interface, Command Inteface 그리고 MPEG-2 TS Interface 로 구성된다. CableCard가 전원이 인가될 때, 카드 초기화를 위하여 동작하는 PCMCIA 인터페이스는 16 비트 PC 카드 SRAM 타입으로 2MByte Memory와 100ns access time으로 동작할 수 있게 설계하였다. PCMCIA 카드 초기화 동작이 완료된 후, CableCard의 기능을 수행하기 위하여 두 개의 논리적 인터페이스가 정의되는데 하나는 MPEG-2 TS 인터페이스이고, 다른 하나는 호스트(셋톱박스)와 모듈 사이의 명령어들을 전달하는 명령어 인터페이스(Command Interface)이다. 명령어 인터페이스(Command Interface)는 셋톱박스의 CPU와 통신하기 위한 1KByte의 Data Channel과 OOB(Out-Of-Band) 통신을 위한 4KByte의 Extended Channel 로 구성되고, 최대 20Mbits/s까지 동작한다. 그리고 MPEG-2 TS는 100Mbits/s까지 동작을 수행할 수 있게 설계하였다. 설계한 코드를 실행한 후, Cadence사의 SimVision을 통해서 타이밍 시뮬레이션을 검증하였다.

• ETRI Journal
• /
• v.43 no.3
• /
• pp.483-510
• /
• 2021

In computational biology, desired patterns are searched in large text databases, and an exact match is preferable. Classical benchmark algorithms obtain competent solutions for pattern matching in O (N) time, whereas quantum algorithm design is based on Grover's method, which completes the search in $O(\sqrt{N})$ time. This paper briefly explains existing quantum algorithms and defines their processing limitations. Our initial work overcomes existing algorithmic constraints by proposing the quantum-based combined exact (QBCE) algorithm for the pattern-matching problem to process exact patterns. Next, quantum random access memory (QRAM) processing is discussed, and based on it, we propose the QRAM processing-based exact (QPBE) pattern-matching algorithm. We show that to find all t occurrences of a pattern, the best case time complexities of the QBCE and QPBE algorithms are $O(\sqrt{t})$ and $O(\sqrt{N})$, and the exceptional worst case is bounded by O (t) and O (N). Thus, the proposed quantum algorithms achieve computational speedup. Our work is proved mathematically and validated with simulation, and complexity analysis demonstrates that our quantum algorithms are better than existing pattern-matching methods.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.16 no.4
• /
• pp.153-161
• /
• 2021

Real-time access is required to handle continuous and unstructured data and should be flexible in management under dynamic state. Platform can be built to allow data collection, storage, and processing from local-server or multi-server. Although the former centralize method is easy to control, it creates an overload problem because it proceeds all the processing in one unit, and the latter distributed method performs parallel processing, so it is fast to respond and can easily scale system capacity, but the design is complex. This paper provides data collection and processing on one platform to derive significant insights from various data held by an enterprise or agency in the latter manner, which is intuitively available on dashboards and utilizes Spark to improve distributed processing performance. All service utilize dockers to distribute and management. The data used in this study was 100% collected from Kafka, showing that when the file size is 4.4 gigabytes, the data processing speed in spark cluster mode is 2 minute 15 seconds, about 3 minutes 19 seconds faster than the local mode.

• Journal of Information Processing Systems
• /
• v.17 no.1
• /
• pp.51-62
• /
• 2021

On-chip caches of graphics processing units (GPUs) have contributed to improved GPU performance by reducing long memory access latency. However, cache efficiency remains low despite the facts that recent GPUs have considerably mitigated the bottleneck problem of L1 data cache. Although the cache miss rate is a reasonable metric for cache efficiency, it is not necessarily proportional to GPU performance. In this study, we introduce a second key determinant to overcome the problem of predicting the performance gains from L1 data cache based on the assumption that miss rate only is not accurate. The proposed technique estimates the benefits of the cache by measuring the balance between cache efficiency and throughput. The throughput of the cache is predicted based on the warp occupancy information in the warp pool. Then, the warp occupancy is used for a second bypass phase when workloads show an ambiguous miss rate. In our proposed architecture, the L1 data cache is turned off for a long period when the warp occupancy is not high. Our two-level bypassing technique can be applied to recent GPU models and improves the performance by 6% on average compared to the architecture without bypassing. Moreover, it outperforms the conventional bottleneck-based bypassing techniques.

• International Journal of Advanced Culture Technology
• /
• v.11 no.3
• /
• pp.302-309
• /
• 2023

This study aimed to develop a VR-based digital therapeutic intervention for the diagnosis and treatment of ADHD. The research combined medical data with virtual reality technology to develop an algorithm for ADHD diagnostic scales and implemented a VR-based digital therapeutic platform using a head-mounted display (HMD). This platform can be used for the diagnosis and treatment of ADHD in children and adolescents. Additionally, we four VR games were developed, including archery timing, Antarctic exploration, grocery shopping, and rhythm-based drumming(RBD), incorporating various psychiatric treatment techniques based on cognitive-behavioral therapy(CBT). To evaluate the usability of this digital therapeutic intervention, a group of experts specialized in counseling psychology participated in the study. The evaluations received highly positive feedback regarding the ability to access the system menu while wearing the HMD, the consistency of terminology used in menus and icons, the usage of actual size for 3D graphic elements, and the support for shortcut key functionality. The assessments also indicated that the games could improve attention, working memory, and impulse control, suggesting potential therapeutic effects for ADHD. This intervention could provide a daily treatment method for families experiencing financial constraints that limit hospital-based therapies, thereby reducing the burden.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.39 no.1
• /
• pp.1-10
• /
• 2002

A space-time concatenated convolutional and differential coding scheme is employed in a multiuser direct-sequence code-division multiple-access(DS-CDMA) system. The system consists of single-user detectors (SUD), which are used to suppress multiple-access interference(MAI) with no requirement of other users' spreading codes, timing, or phase information. The space-time differential code, treated as a convolutional code of code rate 1 and memory 1, does not sacrifice the coding efficiency and has the least number of states. In addition, it brings a diversity gain through the space-time processing with a simple decoding process. The iterative process exchanges information between the differential decoder and the convolutional decoder. Numerical results show that this space-time concatenated coding scheme provides better performance and more flexibility than conventional convolutional codes in DS-CDMA systems, even in the sense of similar complexity Further study shows that the performance of this coding scheme applying to DS-CDMA systems with SUDs improves by increasing the processing gain or the number of taps of the interference suppression filter, and degrades for higher near-far interfering power or additional near-far interfering users.

• Journal of KIISE:Information Networking
• /
• v.30 no.1
• /
• pp.75-81
• /
• 2003

User authentication, including confidentiality, integrity over untrusted networks, is an important part of security for systems that allow remote access. Using human-memorable Password for remote user authentication is not easy due to the low entropy of the password, which constrained by the memory of the user. This paper presents a new password authentication and key agreement protocol suitable for authenticating users and exchanging keys over an insecure channel. The new protocol resists the dictionary attack and offers perfect forward secrecy, which means that revealing the password to an attacher does not help him obtain the session keys of past sessions against future compromises. Additionally user passwords are stored in a form that is not plaintext-equivalent to the password itself, so an attacker who captures the password database cannot use it directly to compromise security and gain immediate access to the server. It does not have to resort to a PKI or trusted third party such as a key server or arbitrator So no keys and certificates stored on the users computer. Further desirable properties are to minimize setup time by keeping the number of flows and the computation time. This is very useful in application which secure password authentication is required such as home banking through web, SSL, SET, IPSEC, telnet, ftp, and user mobile situation.

• The Sea:JOURNAL OF THE KOREAN SOCIETY OF OCEANOGRAPHY
• /
• v.27 no.3
• /
• pp.127-143
• /
• 2022

Recently, many attempts to run numerical ocean models in cloud computing environments have been tried actively. A cloud computing environment can be an effective means to implement numerical ocean models requiring a large-scale resource or quickly preparing modeling environment for global or large-scale grids. Many commercial and private cloud computing systems provide technologies such as virtualization, high-performance CPUs and instances, ether-net based high-performance-networking, and remote direct memory access for High Performance Computing (HPC). These new features facilitate ocean modeling experimentation on commercial cloud computing systems. Many scientists and engineers expect cloud computing to become mainstream in the near future. Analysis of the performance and features of commercial cloud services for numerical modeling is essential in order to select appropriate systems as this can help to minimize execution time and the amount of resources utilized. The effect of cache memory is large in the processing structure of the ocean numerical model, which processes input/output of data in a multidimensional array structure, and the speed of the network is important due to the communication characteristics through which a large amount of data moves. In this study, the performance of the Regional Ocean Modeling System (ROMS), the High Performance Linpack (HPL) benchmarking software package, and STREAM, the memory benchmark were evaluated and compared on commercial cloud systems to provide information for the transition of other ocean models into cloud computing. Through analysis of actual performance data and configuration settings obtained from virtualization-based commercial clouds, we evaluated the efficiency of the computer resources for the various model grid sizes in the virtualization-based cloud systems. We found that cache hierarchy and capacity are crucial in the performance of ROMS using huge memory. The memory latency time is also important in the performance. Increasing the number of cores to reduce the running time for numerical modeling is more effective with large grid sizes than with small grid sizes. Our analysis results will be helpful as a reference for constructing the best computing system in the cloud to minimize time and cost for numerical ocean modeling.

• Proceedings of the Korean Society of Medical Physics Conference
• /
• 2003.09a
• /
• pp.78-78
• /
• 2003

Purpose: This event related fMRI study was to further our understanding about how different brain regions could contribute to effective access of specific information stored in long term memory. This experiment has allowed us to determine the brain regions involved in recognition of familiar faces among non familiar faces. Materials and Methods: Twelve right handed normal, healthy volunteer adults participated in face recognition experiment. The paradigm consists of two 40 familiar faces, 40 unfamiliar faces and control base with scrambled faces in a randomized order, with null events. Volunteers were instructed to press on one of two possible buttons of a response box to indicate whether a face was familiar or not. Incorrect answers were ignored. A 1.5T MRI system(GMENS) was employed to evaluate brain activity by using blood oxygen level dependent (BOLD) contrast. Gradient Echo EPI sequence with TR/TE= 2250/40 msec was used for 17 contiguous axial slices of 7mm thickness, covering the whole brain volume (240mm Field of view, 64 ${\times}$ 64 in plane resolution). The acquired data were applied to SPM99 for the processing such as realignment, normalization, smoothing, statistical ANOVA and statistical preference. Results/Disscusion: The comparison of familiar faces vs unfamiliar faces yielded significant activations in the medial temporal regions, the occipito temporal regions and in frontal regions. These results suggest that when volunteers are asked to recognize familiar faces among unfamiliar faces they tend to activate several regions frequently involved in face perception. The medial temporal regions are also activated for familiar and unfamiliar faces. This interesting result suggests a contribution of this structure in the attempt to match perceived faces with pre existing semantic representations stored in long term memory.