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

According to development of Information Technology and generalization of internet, practical use field of geography information became various. Therefor various Geographic Information System (GIS) constructed to manage geography information efficiently. However, geography information data of various form is depending on graphic authorizing tool of various form being not normalized each other. So, OGC (Open Geospatial Consortium) proposed GML (Geography Markup Language) that describe normalized geography information data that can apply mutually and W3C proposed SVG (Scalable Vector Graphics) of vector base. In this paper creates GML data of XML base for geography information data processing to vector graphic object. and design and implementation of GML document editing and translation system that define code converter that create GML document through created graphic objects and change vector graphic to logic structure of XML base.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.1
• /
• pp.191-203
• /
• 2009

To provide dynamic services for users in ubiquitous computing environments by considering context in real-time, in our previous work we proposed Metaservice concept, the description specification and the process for building a Metaservice library. However, our previous process generates separated models - UML, OWL, OWL-S based models - from each step, so it did not provide the established method for translation between models. Moreover, it premises aid of experts in various ontology languages, ontology editing tools and the proposed Metaservice specification. In this paper, we design the translation process from domain ontology in OWL to Metaservice Library in OWL-S and develop a visual tool in order to enable non-experts to generate consistent models and to construct a Metaservice library. The purpose of the Metaservice Library translation process is to maintain consistency in all models and to automatically generate OWL-S code for Metaservice library by integrating existing OWL model and Metaservice model.

• Journal of KIISE:Software and Applications
• /
• v.29 no.5
• /
• pp.326-335
• /
• 2002

Recently there have been a number of researches to provide code mobility to lazy functional language (LFL) programs by translating LFL programs to Java programs. These approaches are basically baled on architectural similarities between abstract machines of LFLs and Java. The abstract machines of LFLs and Java programming language, Spineless Tagless G-Machine(STGM) and Java Virtual Machine(JVM) respectively, share important common features such as built- in garbage collector and stack machine architecture. Thus, we can provide code mobility to LFLs by translating LFLs to Java utilizing these common features. In this paper, we propose a new translation scheme which fully utilizes architectural common features between STGM and JVM. By redefining STGM as an eval-apply evaluation model, we have defined a new translation scheme which utilizes Java Virtual Machine Stack for function evaluation and totally eliminates stack simulation which causes array manipulation overhead in Java. Benchmark program translated to Java programs by our translation scheme run faster on JDK 1.3 than those translated by the previous schemes.

• The KIPS Transactions:PartD
• /
• v.13D no.4 s.107
• /
• pp.549-556
• /
• 2006

In this paper, we propose a system for generating skeleton programs for directly transforming an XML document to another document, whose structure is defined in the target DTD with GUI environment. With the generated code, the users can easily update or insert their own codes into the program so that they can convert the document as the way that they want and can be connected with other classes or library files. Since most of the currently available code generation systems or methods for transforming XML documents use XSLT or XQuery, it is very difficult or impossible for users to manipulate the source code for further updates or refinements. As the generated code in this paper reveals the code along the XPaths of the target DTD, the result code is quite readable. The code generating procedure is simple; once the user maps the related elements represented as trees in the GUI interface, the source document is transformed into the target document and its corresponding Java source program is generated, where DTD is given or extracted from XML documents automatically by parsing it. The mapping is classified 1:1, 1:N, and N:1, according to the structure and semantics of elements of the DTD. The functions for changing the structure of elements designated by the user are amalgamated into the metadata interface. A real world example of transforming articles written in XML file into a bibliographical XML document is shown with the transformed result and its code.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2003.05b
• /
• pp.983-986
• /
• 2003

마이크로소프트사는 .NET 플랫폼을 개발하면서 C/C++의 강력함과 자바나 비주얼 베이직의 높은 생산성을 매우 효과적으로 결합한 프로피래밍 언어인 C#을 만들었다. C#은 컴파일 과정을 거치며 자바의 바이트 코드와 같은 중간 언어인 MSIL 코드를 갖는 파일을 출력하게 되는데, C# 이외에도 모든 .NET 언어들은 컴파일과정을 거치면서 MSIL 코드를 얻기 때문에 여러 .NET 언어들을 이용해서 하나의 응용 프로그램을 만들 수 있다. 썬 마이크로시스템즈사의 자바는 현재 가장 널리 사용되는 프로그래밍 언어 중 하나이며, 컴파일러에 의해 플랫폼에 독립적인 바이트 코드를 바이너리 형태로 가지고 있는 클래스 파일을 생성하면 JVM에 의해 운영체제와 하드웨어에 독립적으로 수행이 가능한 차세대 언어이다. 본 논문에서는 임베디드 시스템에서의 적용을 위해 C#을 컴파일 하여 나오는 중간 언어 형태인 MSIL 코드를 자바의 중간언어의 한 종류인 Oolong 코드로 변환해 줌으로서 C#으로 구현된 프로그램이 자바 플랫폼에서 JVM에 의해 실행되도록 하는 MSIL-to-Oolong 번역기 시스템 구현하였다.

• The Transactions of the Korea Information Processing Society
• /
• v.1 no.1
• /
• pp.38-49
• /
• 1994

One of the most common problems encountered in the automatic translation of FORTRAN source code to VECTRAN is the occurrence of conditional transfer of control within loops. Transfers of control create control dependencies, in which the execution of a statement is dependent on the value of a variable in another statement. In this paper I propose algorithms involve an attempt to convert statements in the loop into conditional assignment statements that can be easily analyzed for data dependency, and this paper presents a simplification method for conditional assignment statement. Especially, I propose not only a method for simplifying boolean functions but extended method for n-state functions.

• Structural Engineering and Mechanics
• /
• v.83 no.1
• /
• pp.45-51
• /
• 2022

The need to account for accidental torsion in seismic design is no longer debatable, however, the seismic codes' requirement for accidental eccentricity has recently faced criticism. In order to get as close to real conditions as possible, this study investigated the impact of accidental torsion in symmetric RC multistory buildings caused by one of its many sources, the torsional earthquake component, and compared the results to those obtained by using the accidental eccentricity recommended by the codes (shifting the center of mass). To cover a wide range of frequencies and site conditions, two types of torsion seismic components were used: a recorded torsion accelerogram and five others generated using translation accelerograms. The main parameters that govern seismic responses, such as the number of stories (to account for the influence of all modes of vibration) and the frequency ratio (Ω) variation, were studied in terms of inter-story drift and displacement responses, as well as torsional moment. The results show that the eccentricity ratio of 5% required by most codes for accidental torsion should be reexamined and that it is prudent for computer analysis to use the static moment approach to implement the accidental eccentricity while waiting for new seismic code recommendations on the subject.

• Proceedings of the Korean Society for Applied Microbiology Conference
• /
• 2001.06a
• /
• pp.83-89
• /
• 2001

Recent advances in the structural and molecular biology uncovered that a set of translation factors resembles a tRNA shape and, in one case, even mimics a tRNA function for deciphering the genetic ：ode. Nature must have evolved this 'art' of molecular mimicry between protein and ribonucleic acid using different protein architectures to fulfill the requirement of a ribosome 'machine'. Termination of protein synthesis takes place on the ribosomes as a response to a stop, rather than a sense, codon in the 'decoding' site (A site). Translation termination requires two classes of polypeptide release factors (RFs)： a class-I factor, codon-specific RFs (RFI and RF2 in prokaryotes; eRFI in eukaryotes), and a class-IT factor, non-specific RFs (RF3 in prokaryotes; eRF3 in eukaryotes) that bind guanine nucleotides and stimulate class-I RF activity. The underlying mechanism for translation termination represents a long-standing coding problem of considerable interest since it entails protein-RNA recognition instead of the well-understood codon-anticodon pairing during the mRNA-tRNA interaction. Molecular mimicry between protein and nucleic acid is a novel concept in biology, proposed in 1995 from three crystallographic discoveries, one, on protein-RNA mimicry, and the other two, on protein-DNA mimicry. Nyborg, Clark and colleagues have first described this concept when they solved the crystal structure of elongation factor EF- Tu：GTP：aminoacyl-tRNA ternary complex and found its overall structural similarity with another elongation factor EF-G including the resemblance of part of EF-G to the anticodon stem of tRNA (Nissen et al. 1995). Protein mimicry of DNA has been shown in the crystal structure of the uracil-DNA glycosylase-uracil glycosylase inhibitor protein complex (Mol et al. 1995; Savva and Pear 1995) as well as in the NMR structure of transcription factor TBP-TA $F_{II}$ 230 complex (Liu et al. 1998). Consistent with this discovery, functional mimicry of a major autoantigenic epitope of the human insulin receptor by RNA has been suggested (Doudna et al. 1995) but its nature of mimic is. still largely unknown. The milestone of functional mimicry between protein and nucleic acid has been achieved by the discovery of 'peptide anticodon' that deciphers stop codons in mRNA (Ito et al. 2000). It is surprising that it took 4 decades since the discovery of the genetic code to figure out the basic mechanisms behind the deciphering of its 64 codons.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.11
• /
• pp.2874-2890
• /
• 1997

This paper describes a methodology for translation of concurrent software expressed in operating system (OS) calls to Ada. Concurrency is expressed in some legacy software by OS calls that perform concurrent process/task control. Examples considered in this paper are calls in programs in C to Unix and calls in programs in CMS-2 to the Executive Service Routines of ATES or SDEX-20 other software re/reverse engineering research has focused on translating the OS calls in a legacy software to calls to another OS. In this approach, the understanding of software has required knowledge of the underlying OS, which is usually very complicated and informally documented. The research in this paper has focused on translating the OS calls in a legacy software into the equivalent protocols using the Ada facilities. In translation to Ada, these calls are represented by Ada equivalent code that follow the scheme of a message-based kernel oriented architecture. To facilitate translation, it utilizes templates placed in library for data structures, tasks, procedures, and messages. This methodology is a new approach to modeling OS in Ada in software re/reverse engineering. There is no need of knowledge of the underlying OS for software understanding in this approach, since the dependency on the OS in the legacy software is removed. It is portable and interoperable on Ada run-time environments. This approach can handle the OS calls in different legacy software systems.

• IEIE Transactions on Smart Processing and Computing
• /
• v.4 no.3
• /
• pp.169-172
• /
• 2015

Dalvik is a virtual machine (VM) that is designed to run Java-based Android applications. A trace-based just-in-time (JIT) compilation technique is currently employed to improve performance of the Dalvik VM. However, due to runtime compilation overhead, the trace-based JIT compiler provides only a few simple optimizations. Moreover, because each trace contains only a few instructions, the trace-based JIT compiler inherently exploits fewer optimization and parallelization opportunities than a method-based JIT compiler that compiles method-by-method. So we propose a new method-based JIT compiler, named DEX2C, in order to improve performance by finding more opportunities for both optimization and parallelization in Android applications. We employ C code as an intermediate product in order to find more optimization opportunities by using the GNU C Compiler (GCC), and we will detect parallelism by using the Intel C/C++ parallel compiler and the AESOP compiler in our future work. In this paper, we introduce our DEX2C compiler, which dynamically translates Dalvik bytecodes (DEX) into C code with method granularity. We also describe a new method-based JIT interface in the Dalvik VM for the DEX2C compiler. Our experiment results show that our compiler and its interface achieve significant performance improvement by up to 15.2 times and 3.7 times on average, in Element Benchmark, and up to 2.8 times for FFT in Smartbench.