• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.9
• /
• pp.897-900
• /
• 2008

EPCglobal TDT specifies standards on RFID tag representations and conversion rules among them. According to the rule, more than 200 combinations of code conversions are possible. In this paper, we propose a code generation scheme for developing TDT code conversion program, that imports TDT XML specification and generates conversion codes. The proposed scheme makes it easy to develop and to maintain the conversion codes.

• Journal of the Korea Computer Industry Society
• /
• v.3 no.8
• /
• pp.963-980
• /
• 2002

Software reengineering is making various research for solutions against problem of maintain existing systems. Reengineering has a meaning of development of software on exizting systems through the reverse engineering auf forward engineering. Most of the important concepts used in reengineering is composition that is restructuring of the existing objects. Is there a compiler that can compile a program written in a traditional procedural language (like C or Pascal) and generate a Java bytecode, rather than an executable code that runs oかy on the machine it was compiled (such as an a.out file on a Unix machine)\ulcorner This type of compiler may be very handy for today's computing environment of heterogeneous networks. In this paper we present a software system that does this job at the binary-to-binary level. It takes the compiled binary code of a procedural language and translates it into Java bytecode. To do this, we first translate into an assembler code called Jasmin [7] that is a human-readable representation of Java bytecode. Then the Jasmin assembler converts it into real Java bytecode. The system is not a compiler because it does not start at the source level. We believe this kind of translator is even more useful than a compiler because most of the executable code that is available for sharing does not come with source programs. Of course, it works only if the format of the executable binary code is known. This translation process consists of three major stages: (1) analysis stage that identifies the language constructs in the given binary code, (2) initialization stage where variables and objects are located, classified, and initialized, and (3) mapping stage that maps the given binary code into a Jasmin assembler code that is then converted to Java bytecode.

• The KIPS Transactions:PartC
• /
• v.8C no.6
• /
• pp.783-792
• /
• 2001

It is well known that, in the near future, the lifetime of the IPv4 address space will be limited and available 32-bit IP network addresses will not be left any more. In order to solve such IPv4 address space problem in an effective way, the transition to the new version using IPv6 architecture is inevitably required. At present, it is impossible to convert IPv4 into IPv6 at a time, since the coverage and the size of today's Internet is too huge. Therefore, the coexistence of both IPv4 and IPv6 must be arranged in a special and practical fashion for rapid conversion on the whole. IP protocol translation has been proposed to ease the translation of the Internet from IPv4 to IPv6. This paper presents the design and implementation of a transparent transition service that translates packet header as they cross between IPv4 and IPv6 networks. IPv4/IPv6 Translation Protocol is written in c source code and is tested by the local test recommended by ISO, which has the most excellent error detection function. The test was processed with a test scenario and it was found that the results were successful.

• Journal of computational fluids engineering
• /
• v.12 no.1
• /
• pp.1-8
• /
• 2007

A code is developed using the hybrid Cartesian/immersed boundary method and it is applied to simulate flows around a three-dimensional deforming body. A new criterion is suggested to distribute the immersed boundary nodes based on edges crossing a body boundary. Velocities are reconstructed at the immersed boundary nodes using the interpolation along a local normal line to the boundary. Reconstruction of the pressure at the immersed boundary node is avoided using the hybrid staggered/non-staggered grid method. The developed code is validated through comparisons with other experimental and numerical results for the velocity profiles around a circular cylinder under the forced in-line oscillation and the pressure coefficient distribution on a sphere. The code is applied to simulate the flow fields around a plate whose tail is periodically flapping under a translation. The effects of the velocity and acceleration due to the deformation on the periodic shedding of pairs of tip vortices are investigated.

• 한국전산유체공학회:학술대회논문집
• /
• 2000.05a
• /
• pp.60-65
• /
• 2000

An aerodynamic design method has been developed by using a three-dimensional unstructured Euler code and an adjoint code with a discrete approach. The resulting adjoint code is applied to a wing design problem of super-sonic transport with a wing-body-nacelle configuration. Hicks-Henne shape functions are adopted far the surface geometry perturbation, and the elliptic equation method is employed fer the interior grid modification during the design process. Interior grid sensitivities are neglected except those for design parameters associated with nacelle translation. The Sequential Quadratic Programming method is used to minimize the drag with constraints on the lift and airfoil thickness. Successful design results confirm validity and efficiency of the present design method.

• Journal of Electrical Engineering and information Science
• /
• v.3 no.1
• /
• pp.1-7
• /
• 1998

High-Level synthesis of digital circuits calls for automatic translation of a behavioral description to a structural design entity represented in terms of components and connection. One of the critical steps in high-level synthesis is to determine a particular scheduling algorithm that will assign behavioral operations to control states. A new scheduling algorithm called Data Availability Scheduling (DAS) for high-level synthesis is presented. It can determine an appropriate scheduling algorithm and minimize the number of states required using data availability and dependency conditions extracted from the behavioral code, taking into account of states required using data availability and dependency conditions extracted from the behavioral code, taking into account resource constraint in each control state. The DAS algorithm is efficient because data availability conditions, and conditional and wait statements break the behavioral code into manageable pieces which are analyzed independently. The output is the number of states in a finite state machine and shows better results than those of previous algorithms.

• Proceedings of the Korea Contents Association Conference
• /
• 2007.11a
• /
• pp.842-845
• /
• 2007

The field of automatic identification using RF is the one of the emerging ubiquitous computing areas. Early RFID techniques was focused on hardware areas, but RFID middleware has recently gained a lot of attention, which collects and filters tag data, and provides it to enterprise applications. The RFID middleware proposed by EPCglobal only can process EPC tag data, and cannot handle the KKR code which is defined by korean organization. So in this paper, we propose a method which can process the KKR code in RFID middleware systems. Using our approach, the RFID middleware can be extended as general ubiquitous middleware systems which process not only EPC code but also KKR code.

• Korean Journal of Computational Design and Engineering
• /
• v.21 no.3
• /
• pp.325-333
• /
• 2016

This paper aims to classify objects and their properties represented in Korea Building Act sentences for applying to BIM-enabled automated code compliance checking task. In order to conduct automated code compliance checking, it is necessary to develop translation process of converting the building act sentences into computer-executable forms. However, since Korea building act sentences are written in natural language, some of requirements are ambiguous to translate explicitly. In this regard, the building act sentences regarding building permit requirements are analyzed focusing on the regulation-specific objects and related properties representation from noun phrases within the scope of this paper. From 1977 building act sentences and attached reference regulations, 1200 regulation-specific objects and about 220 related properties are extracted and classified. In the application for the classification, object-property database is implemented and some of application using the database and the regulation-specific classification is suggested to support to generate rule set written in computable codes.

• International Journal of Naval Architecture and Ocean Engineering
• /
• v.6 no.4
• /
• pp.1024-1040
• /
• 2014

The theoretical background and a numerical solution procedure for a time domain hydroelastic code are presented in this paper. The code combines a VOF-based free surface flow solver with a flexible body motion solver where the body linear elastic deformation is described by a modal superposition of dry mode shapes expressed in a local floating frame of reference. These mode shapes can be obtained from any finite element code. The floating frame undergoes a pseudo rigid-body motion which allows for a large rigid body translation and rotation and fully preserves the coupling with the local structural deformation. The formulation relies on the ability of the flow solver to provide the total fluid action on the body including e.g. the viscous forces, hydrostatic and hydrodynamic forces, slamming forces and the fluid damping. A numerical simulation of a flexible barge is provided and compared to experiments to show that the VOF-based flow solver has this ability and the code has the potential to predict the global hydroelastic responses accurately.

• BMB Reports
• /
• v.43 no.5
• /
• pp.344-348
• /
• 2010

Messenger ribonucleoprotein particles (mRNPs) are used to transport mRNAs along neuronal dendrites to their site of translation. Staufen2 is an mRNA-binding protein expressed in the cell bodies and cellular processes of different brain cells. It is notably involved in the transport of dendritic mRNAs along microtubules. Its knockdown expression was shown to change spine morphology and impair synaptic functions. However, the identity of Staufen2-bound mRNAs in brain cells is still completely unknown. As a mean to identify these mRNAs, we immunoprecipitated Staufen2-containing mRNPs from embryonic rat brains and used a genome wide approach to identify Staufen2-associated mRNAs. The genome wide approach identified 1780 mRNAs in Staufen2-containing mRNPs that code for proteins involved in cellular processes such as post-translational protein modifications, RNA metabolism, intracellular transport and translation. These results represent an additional and important step in the characterization of Staufen2- mediated neuronal functions in rat brains.