• English & American cultural studies
• /
• v.9 no.1
• /
• pp.297-321
• /
• 2009

The purpose of this study is to re-read the film of Dead Poets Society, specially focused on a feminist view. The film hides the strategy of recovering the traditional Patriarchal Society. At the beginning, the film resists the values of traditional society through John Keating. His unorthodox methods of teaching literature smack against the traditions of Welton Academy. Furthermore, he stresses on "Carpe Diem"—Seize the Day, the romantic values of free thinking, creativity, and individuality. The forces opposing Keating's philosophy are personified by Welton's rigid, old headmaster, Mr. Nolan, and the cruel, stubborn parent, Mr. Perry. Keating's romantic values are failed by their powerful, dominating attitudes. Effected by Keating's philosophy, Neil decides to pursue acting rather than medicine. He conflicts with his strict father. Finally frustrated by his authority, Neil commits suicide. And Keating is accused of inciting the boys to restart the Dead Poets Society, and at last he is fired. Keating and Neil are victimized by the Patriarchal society. Even though the film concentrates male characters at the all boys' school, it reveals the male angle of binary oppositions between men and women, subject and object, activity and passivity, presence and absence. In the film's dramatic conclusion, English class is now being temporarily taught by Nolan, who has the boys read from the very Pritchard essay they had ripped out at the start of the film. It symbolizes the triumph of the traditional logocentric society. However, influenced by Keating's unconventional attitudes, ultimately Welton Academy will be changed as it is embodied in its closing scene.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.16 no.2
• /
• pp.113-119
• /
• 2006

Image steganography is a secret communication method used to transmit secret messages that have been embedded into an image. To accommodate a secret message in a digital image, the original cover image is modified by the embedding algorithm. As a result, a stego image is obtained. The sender hides the secret message in a cover image that has no meaning, and then transmits the stego image to the receiver. In this paper, we propose a steganographic method based on spatial domain to embed a secret message using a difference value of two consecutive pixels and a secret quantization range. Especially, we use the modular operation for increasing of insertion information. Through experiments, we have shown that the proposed method has much mon payload capacity, average 60 percent, than some existing methods by using modular operation.

• International journal of advanced smart convergence
• /
• v.11 no.4
• /
• pp.163-169
• /
• 2022

In this paper, we propose a data hiding technique that effectively hides confidential data in the LSB of an image pixel by using the characteristics of the neighboring pixels of the image and the encryption techniques. In the proposed technique, the boundary surface of the image and the flat surface with little change in pixel values are investigated. At the boundary surface of the image, 1 bit of confidential data is encrypted and hidden in the LSB of the boundary pixel to preserve the characteristics of the boundary surface. In the pixels of the plane where the change in pixel value is small, 2 bits secret data is encrypted and hidden in the lower 2 bits of the corresponding pixel. In this way, when confidential data is hidden in an image, the amount of confidential data hidden in the image is greatly increased while maintaining excellent image quality. In addition, the security of hidden confidential data is strongly maintained. When confidential data is hidden by applying the proposed technique, the amount of confidential data concealed increases by up to 92.2% compared to the existing LSB method. The proposed technique can be effectively used to hide copyright information in commercial images.

• Journal of English Language & Literature
• /
• v.56 no.5
• /
• pp.907-930
• /
• 2010

Most previous studies on A Gesture Life focused on illuminating the role and significance of Kkutaeh, the Korean comfort woman, whom Hata runs across at a military camp in the Burmese jungle. For instance, Carroll Hamilton argues that the return of Kkutaeh as a traumatic subject disrupts Hata's nationalist narrative, causing the protagonist's eventual failure at national enfranchisement. However, this paper focuses on Hata's relationship with Bedley Run, the sleepy suburban white town, in which the protagonist settles down right after immigration to the US. The racial/racist nature of Bedley Run has not received due critical attention, although a few studies on the novel saw Hata's gestures as a survival tactic deployed against the hostile environment of his new host society. This paper, resorting to Pierre Macherey's thesis on symptomatic reading, exposes what Hata, the narrator/protagonist, hides from his readers concerning his status in his muchbeloved town; and it also explores the subversive significance of Hata's ethnic memories. The aim of this study is, after all, to map both the subversive possibilities and the limitations of Hata's immigrant narrative as a bildungsroman.

• Structural Monitoring and Maintenance
• /
• v.11 no.3
• /
• pp.203-217
• /
• 2024

Electro-mechanical impedance (EMI) technique is a low-cost structural damage detection method. It reflects structural damage through the change in admittance signal which contains the structural mechanical impedance information. The ambient temperature greatly affects the admittance signal, which hides the changes caused by structural damage and reduces the accuracy of damage identification. This study introduces a convolutional neural network to compensate for the temperature effect. The proposed method uses a framework that consists of a feature extraction network and a decoding network, and the original admittance signal with temperature information is used as the input. The output admittance signal is eliminated from the temperature effect, improving damage identification robustness. The admittance data simulated by the finite element model of the spatial grid structure is used to verify the effectiveness of the proposed method. The results show that the proposed method has advantages in identification accuracy compared with the damage index minimization method and the principal component analysis method.

• Spatial Information Research
• /
• v.20 no.4
• /
• pp.83-92
• /
• 2012

Location-based services (LBS) are increasingly popular due to the improvement of geo-positioning capabilities and wireless communication technology. However, in order to enjoy LBS services, a user requesting a query must send his/her exact location to the LBS provider. Therefore, it is a key challenge to preserve user's privacy while providing LBS. To solve this problem, the existing method employs a 2PASS cloaking framework that not only hides the actual user location but also reduces bandwidth consumption. However, 2PASS does not fully guarantee the actual user privacy because it does not take the real user distribution into account. Hence, in this paper, we propose a nearest neighbor query processing algorithm that supports K-anonymity property based on the weighted adjacency graph(WAG). Our algorithm not only preserves the location of a user by guaranteeing k-anonymity in a query region, but also improves a bandwidth usage by reducing unnecessary search for a query result. We demonstrate from experimental results that our algorithm outperforms the existing one in terms of query processing time and bandwidth usage.

• Archives of Craniofacial Surgery
• /
• v.17 no.1
• /
• pp.39-42
• /
• 2016

Forehead osteomas are benign but can pose aesthetic and functional problems. These osteomas are resected via bicoronal or endoscopic approach. However, large osteomas cannot be removed via endoscopic approach, and bicoronal approach can result in damage to the supraorbital nerve with resultant numbness in the forehead. We present a new approach to resection of forehead osteomas, with access provided by an anterior hairline incision and subcutaneous dissection. Three patients underwent resection of the forehead osteoma through an anterior hairline incision. The dissection was carried in the subcutaneous plane, and the frontalis muscle and periosteum were divided parallel to the course of supraorbital nerve. The resulting bony defect was re-contoured using $Medpor^{(R)}$. All three patients recovered without any postoperative infection or complication and symptoms. Scalp sensory was preserved. Aesthetic outcomes were satisfactory. Patients remain free of recurrence for 12 months of follow up. The anterior hair line approach with subcutaneous dissection is an effective method for removal of forehead osteoma, since it offers broad visualization and hides the scar in the hairline. In addition, the dissection in the subcutaneous plane avoids inadvertent injury to the deep nerve branches and helps to maintains scalp sensation.

• The KIPS Transactions:PartC
• /
• v.18C no.2
• /
• pp.89-96
• /
• 2011

ASR is an excellent program security technique that protects various data memory areas without run-time overhead. ASR hides the addresses of variables from attackers by reordering variables within a data memory area; however, it can be broken by brute force attacks because of a limited data memory space. In this paper, we propose Multiple ASR to overcome the limitation of previous ASR approaches. Multiple ASR separates a data memory area into original and duplicated areas, and compares variables in each memory area to detect an attack. In original and duplicated data memory areas variables are arranged in the opposite order. This makes it impossible to overwrite the same variables in the different data areas in a single attack. Although programs with Multiple ASR show a relatively high run-time overhead due to duplicated execution, programs with many I/O operations such as web servers, a favorite attack target, show 40~50% overhead. In this paper we develop and test a tool that transforms a program into one with Multiple ASR applied.

• Journal of Advanced Navigation Technology
• /
• v.16 no.3
• /
• pp.488-494
• /
• 2012

This paper classifies the self-defense techniques used by the malicious software based on their approaches, introduces the packing technique as one of the code protection methods and proposes a way to quickly analyze the packed malicious codes. Packing technique hides a malicious code and restore it at runtime. To analyze a packed code, it is initially required to find the entry point after restoration. To find the entry point, it has been used reversing the packing routine in which a jump instruction branches to the entry point. However, the reversing takes too much time because the packing routine is usually obfuscated. Instead of reversing the routine, this paper proposes an idea to search some features of the startup code in the standard library used to generate the malicious code. Through an implementation and a consequent empirical study, it is proved that the proposed approach is able to analyze malicious codes faster.

• The Journal of Korean Association of Computer Education
• /
• v.7 no.3
• /
• pp.45-56
• /
• 2004

Java provides support for Web, concurrent programming, safety, portability, and GUI, so there is a steady increase in the number of Java users. Java is based on the object-oriented concepts such as classes, instances, encapsulation, inheritance, and polymorphism. However the JVM(Java Virtual Machine) hides most of the phenomena related to the concepts. This is why most of Java users have much difficulty in learning and using Java. As a solution to the problem, I have developed a tool Alpha that visualizes the phenomena occurred in the JVM from the standpoint of the concepts and will describe the design and features of the tool in this paper. For practicality and extendability Alpha has an MVC(Model-View-Controller) architecture and visualizes the phenomena such as object instantiations, method invocations, field accesses, cross-references among objects, and execution flows of threads in the various ways according to the levels and purposes of the users.