• Proceedings of the Materials Research Society of Korea Conference
• /
• 1998.08a
• /
• pp.144.4-144
• /
• 1998

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2001.04a
• /
• pp.833-836
• /
• 2001

The thermomechanical behaviors of the shape memory alloy were conducted through the finite element analysis of ABAQUS with UMAT user subroutine. The unified thermomechanical constitutive equation suggested by Lagoudas was adapted into the UMAT user subroutine to investigate the characteristics of the shape memory alloy. The three cases were solved to investigate the thermomechanical characteristics of the shape memory alloy. The material properties for the analysis were obtained by DSC and DMA techniques. According to the results, the thermomechanical characteristics, such as a shape memory effect and a pseudoelastic effect, could be obtained through the finite element analysis and the analysis results were revealed to agree well with the experimental results. Therefore, the finite element analysis using UMAT user subroutine is one of prominent analysis techniques to investigate the thermomechnical behaviors of the shape memory alloy quantitatively.

• KIPS Transactions on Computer and Communication Systems
• /
• v.2 no.11
• /
• pp.461-470
• /
• 2013

This paper proposes high speed kernel data collection method for analysis of memory workload, using technique of direct access to process's memory management structure. The conventional analysis tools have a slower data collection speed and they are lack of scalability due to collection only formalized memory information. The proposed method collects kernel data much faster than the conventional methods using technique of direct collect to process's memory information, page table, page structure in the memory management structure, and it can collect data which user wanted. We collect memory management data of the running process, and analyze its memory workload.

• Journal of Korea Multimedia Society
• /
• v.25 no.5
• /
• pp.730-738
• /
• 2022

Based on visual Thinking theory, VR(virtual reality) game changes the traditional form of memory and maps the content into game elements to realize the immersive spatial memory mode. This paper analyzes the influencing factors of game design and system function construction. This paper proposes a hypothesis: with the help of visual thinking theory, VR game is helpful to improve learners' visual memory, and carries out research. The experiment sets different levels of game through empirical research and case analysis of memory flip game. For example, when judging two random cards. If the pictures are the same, it will be judged as the correct combination; if they are different, the two cards will be restored to the original state. The results are analyzed by descriptive statistical analysis and AMOS data analysis. The results show that game content using the concept of "Memory Palace", which can improve the accuracy of memory. We conclude that the use of spatial localization characteristics in flip games combining visual thinking can improve users' memory by helping users memorize and organize information in a Virtual environment, which means VR games have strong feasibility and effectiveness in improving memory.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.34 no.2
• /
• pp.179-192
• /
• 2024

macOS presents challenges for memory data acquisition due to its proprietary system architecture, closed-source kernel, and security features such as System Integrity Protection (SIP), which are exclusive to Apple's product line. Consequently, conventional memory acquisition tools are often ineffective or require system rebooting. This paper analyzes the status and limitations of existing memory forensics research and tools related to macOS. We investigate methods for memory acquisition and analysis across various macOS versions. Our findings include the development of a practical memory acquisition and analysis process for digital forensic investigations utilizing OSXPmem and dd tools for memory acquisition without system rebooting, and Volatility 2, 3 for memory data analysis.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.21 no.4
• /
• pp.89-100
• /
• 2011

Physical memory analysis has been an issue on a field of live forensic analysis in digital forensics until now. It is very useful to make the result of analysis more reliable, because record of user behavior and data can be founded on physical memory although process is hided. But most memory analysis focuses on windows based system. Because the diversity of target system to be analyzed rises up, it is very important to analyze physical memory based on other OS, not Windows. Mac OS X, has second market share in Operating System, is operated by loading kernel image to physical memory area. In this paper, We propose a methodology for physical memory analysis on Mac OS X using symbol information in kernel image, and acquire a process information, mounted device information, kernel information, kernel extensions(eg. KEXT) and system call entry for detecting system call hooking. In additional to the methodology, we prove that physical memory analysis is very useful though experimental study.

• ETRI Journal
• /
• v.35 no.3
• /
• pp.439-447
• /
• 2013

To increase device memory yield, many manufacturers use incorporated redundancy to replace faulty cells. In this redundancy technology, the implementation of an effective redundancy analysis (RA) algorithm is essential. Various RA algorithms have been developed to repair faults in memory. However, nearly all of these RA algorithms have low analysis speeds. The more densely compacted the memory is, the more testing and repair time is needed. Even if the analysis speed is very high, the RA algorithm would be useless if it did not have a normalized repair rate of 100%. In addition, when the number of added spares is increased in the memory, then the memory space that must be searched with the RA algorithms can exceed the memory space within the automatic test equipment. A very efficient RA algorithm using simple calculations is proposed in this work so as to minimize both the repair time and memory consumption. In addition, the proposed algorithm generates an optimal solution using a tree-based algorithm in each fault group. Our experiment results show that the proposed RA algorithm is very efficient in terms of speed and repair.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2009.05a
• /
• pp.801-804
• /
• 2009

In this paper, the Linux kernel memory map was analyzed as the approach to Improving performance for Embedded Linux system. Since the Linux kernel memory map supporting a stability and various H/W platforms and in which it becomes to the general purpose system with optimization manages the role of being important in the booting time and the efficient system utilization of resources, the analysis of the kernel memory map is required for the performance improvement of the Embedded Linux system in which it is restrictive the resources. According to the analysis result, and of the Linux kernel memory, the booting speed of and improvement of the memory efficiency were confirmed. It is therefore considered that the proposed in this paper and kernel memory allocation method are suitable to the memory availability improvement of the Embedded Linux system.

• Journal of recreation and landscape
• /
• v.12 no.4
• /
• pp.45-58
• /
• 2018

Place memory is a new way of seeing as a new concept of cultural landscape research. Various research works and discussions have recently spread in landscape studies. In particular, the, which is visible and material, is a medium in which collective memory is embedded in place memory. The purpose of this study is to extract places of memory from the collective memory of residents of Janghang, Korea, and to visualize it through semantic relations. For this purpose, semi-standardized interviews (34 persons) were conducted with residents, and frequency analysis and semantic network analysis were used. As a result, the interviewees recalled only 127 places in Janghang that existed between 1920 and 2010. Locals remember the city based on places of memory. This means that the city could be illustrated according to specific places that are frequently mentioned. For instance, the top 25 places (top 20%) explain 65.6% of all the places in the city, and the top 39 places (top 30.8%) could describe 78.7% of the places. Some places are referred to more frequently when they are in the city's symbolic landscape, and the city's identity is projected on them. Some places were mentioned only infrequently but were nevertheless very important places by which to understand Janghang. These places of memory have not appeared in the documentary records before, which shows the value of the collective memory of the locals and the effectiveness of the interviewing method. In the clustering of the semantic network, six groups of places appeared. The local residents remembered the modern industrial city and recalled it in connection with the sites of daily life. This shows the possibility of looking not only at public memory and famous heritage as a macro history but also at daily life and meaningful places as a micro history about locals. This study has significance as an initial research that identified and visualized places of memory from the perspective of local residents. Such an approach could be useful in the study of everyday life and the conservation of modern heritage.

• ETRI Journal
• /
• v.34 no.3
• /
• pp.478-481
• /
• 2012

Testing memory and repairing faults have become increasingly important for improving yield. Redundancy analysis (RA) algorithms have been developed to repair memory faults. However, many RA algorithms have low analysis speeds and occupy memory space within automatic test equipment. A fast RA algorithm using simple calculations is proposed in this letter to minimize both the test and repair time. This analysis uses the grouped addresses in the faulty bitmap. Since the fault groups are independent of each other, the time needed to find solutions can be greatly reduced using these fault groups. Also, the proposed algorithm does not need to store searching trees, thereby minimizing the required memory space. Our experiments show that the proposed RA algorithm is very efficient in terms of speed and memory requirements.