• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.10
• /
• pp.1840-1848
• /
• 2017

Linear wireless sensor networks typically construct a network topology with a high reliability through sequential 1:1 mapping among sensor nodes, so that they are used in various surveillance applications of major national infrastructures. Most existing techniques for identifying sensor nodes in those networks are using GPS, AOA, and RSSI mechanisms. However, GPS or AOA based node identification techniques affect the size or production cost of the nodes so that it is not easy to construct practical sensor networks. RSSI based techniques may have a high deviation regrading location identification according to propagation environments and equipment quality so that complexity of error correction algorithm may increase. We propose a timestamps based sequential localization algorithm that uses transmit and receive timestamps in a message between sensor nodes without using GPS, AOA, and RSSI techniques. The algorithms for distance measurement between each node are expected to measure distance within up to 1 meter in case of an crystal oscillator of 300MHz or more.

• Journal of Sericultural and Entomological Science
• /
• v.42 no.1
• /
• pp.14-23
• /
• 2000

The mitochondrial genome of domesticated silkworm (Bombyx mori) was mapped with five restriction endonucleases (BamHI, EcoRI, HindIII, PstI and XbaI), the entire genome was cloned with HindIII and EcoRI. From the end sequencing results of 5$^1$and 3$^1$region for full genome set of eleven mitochondrial clones, the seven mitochondrial genes (NADH dehydrogenase 6, ATPase 6, ATPase 8, tRN $A^{Lys}$, tRN $A^{Asp}$, tRN $A^{Thr}$ and tRN $A^{Phe}$ of mori were identified on the basis of their nucleotide sequence homology. The nucleotide composition of NADH dehydrogenase 6 was heavily biased towards adenine and thymine, which accounted for 87.76%. On basis of the sequence similarity with published tRNA genes from six insect species, the tRN $A^{Lys}$, tRN $A^{Asp}$ and tRN $A^{Thr}$ were showed stable canonical clover-leaf tRNA structures with acceptible anticodons. However, both the DHU and T$\psi$C arms of tRN $A^{Phe}$ could not form any stable stem-loop structure. The two overlapping gene pairs (tRN $A^{Lys}$ -tRN $A^{ASP}$ and ATPase8-ATPase6) were found from our sequencing results. The genes are encoded on the same strad. ATPase8 and ATPase6 overlaps (ATGATAA) which are a single example of overlapping events between abutted protein-coding genes are common, and there is evidence that the two proteins are transcribed from a single bicistronic message by initiation at 5$^1$terminal start site for ATPase8 and at an internal start site for ATPase6. Ultimately, this result will provide assistance in designing oligo-nucleotides for PCR amplification, and sequencing the specific mitochondrial genes for phylogenetics of geographic races, genetically improved silkworm strains and wild silkworm (mandarina) which is estimated as ancestal of domesticated silkworm.sticated silkworm.

• The Journal of the Korea Contents Association
• /
• v.11 no.12
• /
• pp.560-569
• /
• 2011

In this paper, we propose a text processing method for Hindi characters, Devanagari scripts, in the Android. The key points of the text processing are to device automata, which define the combining rules of alphabets into a set of syllables, and to implement a font rendering engine, which retrieves and displays the glyph images corresponding to specific characters. In general, an automaton depends on the type and the number of characters. For the soft-keyboard, we designed the automata with 14 consonants and 34 vowels based on Unicode. Finally, a combined syllable is converted into a glyph index using the mapping table, used as a handle to load its glyph image. According to the multi-lingual framework of Freetype font engine, Dvanagari scripts can be supported in the system level by appending the implementation of our method to the font engine as the Hindi module. The proposed method is verified through a simple message system.

• Journal of Internet Computing and Services
• /
• v.3 no.1
• /
• pp.29-40
• /
• 2002

The information exchange on the using of XML such as B2B electronic is common. So the efficient method to store XML message in database is needed. Because the ORDBMS is extended to ORDBMS for supporting multimedia application such as Oracle8i, 9i, Informix and SQL2000 server, SQL2, the standard RDB is extended to SQL3 for ORDB, And the XML application based on java such as J2EE is extended. Therefor it is necessary for the efficient connection methods based on JDBC between XML application and database system. In this paper, the methodology a transformation XML DTD to SQL3 schema is proposed. For the transformation, first the methods of transformation XML DTD to object model in UML class diagram are proposed. And then the methods of mapping transferred object models to SQL3 schema are proposed. This approach for transform::1lion XML. DTD to SQL3 schema such as Oracle8i, 9i, Informix and SQL2000 server based on java is proposed in this paper, can be used in database design to build XML applications based on ORDB.

• Journal of the Korea Convergence Society
• /
• v.8 no.3
• /
• pp.23-30
• /
• 2017

OpenADR is a national standard communication protocol of demand response service. OpenADR uses XML message, called a payload, to support logical transaction of demand response service. For this purpose, OpenADR defines a XML element as transaction identifier which is called requestID. Unfortunately, OpenADR 2.0b profile specification describes some information about requestID but, it is not enough for understanding properly. Ambiguous definition of payload transaction makes vulnerabilities of implementing VEN & VTN and confuses mapping OpenADR 2.0b protocol into other smart grid protocols. Therefore, this paper redefines payload transaction to solve an ambiguous information of OpenADR 2.0b profile specification, proposes a model of analyzing payload transaction, and shows how to detect a payload transaction vulnerability in real-world.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2017.05a
• /
• pp.93-96
• /
• 2017

DDS (Data Distribution Serivce) communication middleware is spreading to various private sector as well as the defense sector because it can obtain a very high application effect in a complex system environment in which a plurality of data producers and data consumers are connected by a network. However, application development using DDS middleware is an inefficient structure with a lot of repetitive codes because most users perform 1: 1 mapping with the message they want to exchange. Accordingly, the user has to perform unnecessary repetitive tasks as the topic increases. Therefore, a development support tool that identifies a series of processes required for using DDS middleware and automatically generates the classes that are repeated by Topic is required. In this paper, we propose a method for DDS communication by automatically generating a common class for efficient use of DDS middleware.

• Journal of KIISE:Software and Applications
• /
• v.27 no.1
• /
• pp.1-12
• /
• 2000

Model checking is a formal verification technique which checks the consistency between a requirement specification and a behavior model of the system by explorating the state space of the model. We apply model checking to the formal verification of the concurrent object-oriented system, using an existing model checker SPIN which has been successful in verifying concurrent systems. First, we propose an Actor-based modeling language, called APromela, by extending the modeling language Promela which is a modeling language supported in SPIN. APromela supports not only all the primitives of Promela, but additional primitives needed to model concurrent object-oriented systems, such as class definition, object instantiation, message send, and synchronization.Second, we provide translation rules for mapping APromela's such modeling primitives to Promela's. As an application of APromela, we suggest a verification method for UML models. By giving an example of specification, translation, and verification, we also demonstrate the applicability of our proposed approach, and discuss the limitations and further research issues.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.8A
• /
• pp.763-770
• /
• 2002

Recognition of CW Morse signals can be divided into several phases such as detection of tones and spaces, signal processing for removing noise from detected signals, decision of tones/spaces, mapping a sequence of tones and spaces into characters, error correction of a character message with textual repetition. In this paper, in order to cope with signal fading effectively we propose a signal detection method of identifying peaks in the frequency domain and present techniques for combining multiple frequency peaks and for removing residual signal components and noise. LMS adaptive method is applied for decision of tones/spaces, and initial value setting and malfunctioning conditions are analyzed. In recognition experiments, we used CW Morse signals collected by radio receivers and found that the proposed method achieves good recognition performance even in severe fading conditions.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.18 no.1
• /
• pp.170-191
• /
• 2024

The transmission of confidential data using cover media is called steganography. The three requirements of any effective steganography system are high embedding capacity, security, and imperceptibility. The text file's structure, which makes syntax and grammar more visually obvious than in other media, contributes to its poor imperceptibility. Text steganography is regarded as the most challenging carrier to hide secret data because of its insufficient redundant data compared to other digital objects. Unicode characters, especially non-printing or invisible, are employed for hiding data by mapping a specific amount of secret data bits in each character and inserting the character into cover text spaces. These characters are known with limited spaces to embed secret data. Current studies that used Unicode characters in text steganography focused on increasing the data hiding capacity with insufficient redundant data in a text file. A sequential embedding pattern is often selected and included in all available positions in the cover text. This embedding pattern negatively affects the text steganography system's imperceptibility and security. Thus, this study attempts to solve these limitations using the Part-of-speech (POS) tagging technique combined with the randomization concept in data hiding. Combining these two techniques allows inserting the Unicode characters in randomized patterns with specific positions in the cover text to increase data hiding capacity with minimum effects on imperceptibility and security. Format-preserving encryption (FPE) is also used to encrypt a secret message without changing its size before the embedding processes. By comparing the proposed technique to already existing ones, the results demonstrate that it fulfils the cover file's capacity, imperceptibility, and security requirements.

• Journal of KIISE:Databases
• /
• v.34 no.6
• /
• pp.528-545
• /
• 2007

Recently ontology has been an attractive technology along with the business strategy of providing a plenty of more intelligent services. The essential problem in application domains using ontology is that all members, agents, and application programs in the domains must share the same ontology concepts. However, a variety of mobile devices, sensing devices, and network components manufactured by various companies, a variety of common carriers, and a variety of contents providers make multiple heterogeneous ontologies more likely to coexist. We can see many past researches fallen into resolving this semantic interoperability. Such methods can be broadly classified into by-mapping, by-merging, and by-translation. In this research, we focus on by-translation among them which uses a translation rule directly made between two heterogeneous ontology data like OntoMorph. However, the manual composition of the direct translation rule is not convenient by itself and if there are N ontologies, the direct method has the rule composition complexity of $O(N^2)$ in the worst case. Therefore, in this paper we introduce the cascade composition of translation rules based on web openness in order to improve the complexity. The research result made us recognize some important factors in an ontology translation system, that is speediness of translation, and conveniency of translation rule composition, and some experiments and comparing analysis with existing methods showed that our cascade method has more conveniency with insuring the speediness and the correctness.