• Journal of KIISE:Databases
• /
• v.30 no.2
• /
• pp.145-156
• /
• 2003

Most of the content-based image retrieval systems focuses on similarity-based retrieval of natural picture images by utilizing color. shape, and texture features. For the neuroscience image databases, we found that retrieving similar images based on global average features is meaningless to pathological researchers. To realize the practical content-based retrieval on images in neuroscience databases, it is essential to represent internal contents or semantics of images in detail. In this paper, we present how to represent image contents and their related concepts to support more useful retrieval on such images. We also describe the operational semantics to support these advanced retrievals by using object-oriented message path expressions. Our schemes are flexible and extensible, enabling users to incrementally add more semantics on image contents for more enhanced content searching.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.2
• /
• pp.227-233
• /
• 2000

In this paper, we present a new high-level data path synthesis algorithm which solves the two design problems, namely, scheduling and allocation, with power minimization as a key design parameter. From the observations in previous works on data path synthesis for low power, we derive an integer programming (IP) formulation for the problem, from which we then develop an efficient heuristic to carry out the scheduling and allocation simultaneously. Our experimental results demonstrate that the proposed algorithm is very effective in saving power consumption of circuits significantly.

• Journal of Korea Multimedia Society
• /
• v.7 no.7
• /
• pp.859-876
• /
• 2004

This paper presents optimal configurations of multidimensional path indexes (MPIs) for the efficient execution of object-oriented queries in object databases. MPI uses a multidimensional index structure for efficiently supporting nested predicates that involve both nested attribute and class hierarchies, which are not supported by the nested attribute index using one-dimensional index structure such as $B^+$-tree. In this paper, we have analyzed the MPIs in the framework of complex queries, containing conjunctions of nested predicates, each one involving a path expression having target classes and domain classes substitution. First of all, we have considered MPI operations caused by updating of object databases, and the use of the MPI in the case of a query containing a single nested predicate. And then, we have considered the use of the MPIs in the framework of more general queries containing nested predicates over both overlapping and non-overlapping paths. The former are paths having common subpaths, while the latter have no common subpaths.

• Journal of KIISE:Databases
• /
• v.30 no.2
• /
• pp.109-124
• /
• 2003

Although most commercial relational DBMSs Provide a graphical query language for the user friendly interfaces of the databases, few research has been done for graphical query languages in object databases. Expressing complex query conditions in a concise and intuitive way has been an important issue in the design of graphical query languages. Since the object data model and object query languages are more complex than those of the relational ones, the graphical object query language should have a concise and intuitive representation method. We propose a graphical object query language called GOQL (Graphical Object Query Language) for object databases. By employing simple graphical notations, advanced features of the object queries such as path expressions including set attributes, quantifiers, and/or methods can be represented in a simple graphical notation. GOQL has an excellent expressive power compared with previous graphical object query languages. We show that path expressions in XSQL(1,2) can be represented by the simple graphical notations in GOQL. We also propose an algorithm that translates a graphical query in GOQL into the textual object query with the same semantics. We finally describe implementation results of GOQL in the Internet environments.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.13 no.1
• /
• pp.161-171
• /
• 1993

The aim of this study is to provide the stress-strain behavior of hardening geological materials such as rock or concrete on three dimensional spaces by using Desai model based on plastic theory. To validate proposed model, truly triaxial tests with high pressure under variety of stress paths in which three principal stresses were controlled independently using concrete materials were performed. The main results are summerized as follows: 1. Various stress paths for hardening materials used are satisfactorily explained by performing the truly triaxial test with high pressure. This is very important to investigate constitutive equations for materials like rock or concrete. 2. Since the proposed yield function is continuous, it avoids the singularity point at the intersection of two function in the previous models, thus, reducing the difficulties for computer implementation. 3. Analytic predictions for yielding behavior on $J_1-{\sqrt{J_{2D}}}$ octahedral and triaxial plane, as well as volumetric strain and stress-strain behavior agree well with experimental results.

• Journal of KIISE
• /
• v.43 no.4
• /
• pp.489-496
• /
• 2016

XML can effectively express structured or semi-structured data as well as relational databases. XQuery is a query language for retrieving information for such an XML document. In this paper, an XQuery composer is designed and implemented, with an API provided for XQuery processors, and a proper processor is registered. This composer shows query results immediately processed by the processor. As this composer contains a parser for XQuery, it can compose XQuery effectively using a diverse dialog box designed for XQuery grammar. A dialog box is affiliated with a clause region, which is a region that algebra operates from the parsing tree. It can compose path expressions for an XML document easily as it shows an element tree from DTD graphically. Path expressions are composed automatically by marking elements in the structural hierarchy and by specifying the predicate of an element partially.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.7
• /
• pp.959-969
• /
• 1993

In this paper, the performance of DS/SS DPSK communications is analysed over fading dispersive channels considering the spreads of the channel in time and in frequency. The two spreads mentioned above are represented with multipath spread and Doppler spread, respectively. The bit error probabilities of DS/SS DPSK systems are derived in terms of channel and system parameters, and an approximation method is presented for computational efficiency. And the numerical results are given for various chip numbers in Rayleigh and Rician fading channels using the approximation method.

• Journal of the Korean Ceramic Society
• /
• v.12 no.3
• /
• pp.18-23
• /
• 1975

본 연구는 다결정질 바리움 페라이트의 고상간의 반응에 있어서 입자성장기구의 규명 및 기타 유용한 자료를 얻고저 수행되었으며 아울러 첨가물의 첨가효과도 관찰하였다. 실험은 115$0^{\circ}C$부터 130$0^{\circ}C$까지 25도의 간격으로 행해졌으며 입자성장현상은 전자현미경으로 관찰되었다. 실험결과, 115$0^{\circ}C$부터 120$0^{\circ}C$까지는 식 D2-D20=Kt(D: 반응이 진행된 ttlrksgn의 입자경, D0: t=0때의 입자경, K: 반응속도)로 표현되었으며 비교적 고온에서는 증발-응축기구가 관여됨을 관찰하였다. 한편 실험적으로 구한 활성에너지는 130$\pm$20 Kcal/mole이었으며 소량의 첨가물 SiO2는 반응속도를 저하시키나 활성화 에너지에 대해서는 큰 영향을 미치지 못하였다.

• The KIPS Transactions:PartD
• /
• v.11D no.2
• /
• pp.293-304
• /
• 2004

Recently, caching for the database-backed web applications has received much attention. The results of frequent queries could be cached for repeated reuse or for efficient processing of the relevant queries. Since the emergence of XML as a standard for data exchange on the web, today's web applications are to retrieve information from the remote XML sources across the network, and thus it is desirable to maintain the XML query results in the cache for the web applications. In this paper, we describe implementation of an XML query processing system that supports cache-answerability of XML queries, and evaluate its performance. XML path expression, which is one of the core features of XML query languages including XQuery, XPath, and XQL was considered as the XML query. Their result is maintained as an XML materialized view in the XML cache. The algorithms to rewrite the given XML path expression using its relevant materialized view proposed in [13] were implemented with RDBMS as XML store. The major issues of implementation are described in detail. The results of performance experiments conducted with the implemented system showed effectiveness of cache-answerability of XML queries. Comparison with previous research in terms of performance is also Provided.

• Journal of KIISE:Databases
• /
• v.31 no.3
• /
• pp.320-330
• /
• 2004

Query languages for XML use paths in a data graph to represent queries. Actually, paths in a data graph are used as a basic constructor of an XML query. User can write more expressive Queries by using Patterns (e.g. regular expressions) for paths. There are many identical paths in a data graph because of the feature of semi-structured data. Current researches for indexing XML utilize identical paths in a data graph, but such an index can grow larger than source data graph and cannot guarantee efficient access path. In this paper we propose a partitioning technique that can partition all the paths in a data graph. We develop an index graph that can find appropriate partitions for a path query efficiently. The size of our index graph can be adjusted regardless of the source data. So, we can significantly improve the cost for index graph traversals. In the performance study, we show our index much faster than other graph based indexes.