• Title/Summary/Keyword: 베이스

Search Result 4,382, Processing Time 0.039 seconds

Efficient Similarity Search in Multi-attribute Time Series Databases (다중속성 시계열 데이타베이스의 효율적인 유사 검색)

  • Lee, Sang-Jun
    • The KIPS Transactions:PartD
    • /
    • v.14D no.7
    • /
    • pp.727-732
    • /
    • 2007
  • Most of previous work on indexing and searching time series focused on the similarity matching and retrieval of one-attribute time series. However, multimedia databases such as music, video need to handle the similarity search in multi-attribute time series. The limitation of the current similarity models for multi-attribute sequences is that there is no consideration for attributes' sequences. The multi-attribute sequences are composed of several attributes' sequences. Since the users may want to find the similar patterns considering attributes's sequences, it is more appropriate to consider the similarity between two multi-attribute sequences in the viewpoint of attributes' sequences. In this paper, we propose the similarity search method based on attributes's sequences in multi-attribute time series databases. The proposed method can efficiently reduce the search space and guarantees no false dismissals. In addition, we give preliminary experimental results to show the effectiveness of the proposed method.

A firmware base address search technique based on MIPS architecture using $gp register address value and page granularity

  • Seok-Joo, Mun;Young-Ho, Sohn
    • Journal of the Korea Society of Computer and Information
    • /
    • v.28 no.2
    • /
    • pp.1-7
    • /
    • 2023
  • In this paper, we propose a base address candidate selection method using the $gp register and page granularity as a way to build a static analysis environment for firmware based on MIPS architecture. As a way to shorten the base address search time, which is a disadvantage of the base address candidate selection method through inductive reasoning in existing studies, this study proposes a method to perform page-level search based on the $gp register in the existing base address candidate selection method as a reference point for search. Then, based on the proposed method, a base address search tool is implemented and a static analysis environment is constructed to prove the validity of the target tool. The results show that the proposed method is faster than the existing candidate selection method through inductive reasoning.

Quality Characteristics of Soy Ice Cream Prepared with Fermented Soybean Powder Base and Oligosaccharide and Its Blood Glucose Lowering Effect (대두분말 발효 베이스와 올리고당으로 제조한 콩아이스크림의 품질특성과 혈당개선능)

  • Park, In-Kyung;Yang, Sun-Hee;Choi, Young-Sun
    • Korean Journal of Food Science and Technology
    • /
    • v.40 no.1
    • /
    • pp.88-95
    • /
    • 2008
  • The purpose of this study was to improve the quality characteristics of soy ice cream supplemented with oligosaccharide, and to test its blood glucose lowering effect. Boiled soybean powder was compared to parched soybean powder and to milk, as an ingredient. The soybean powder base was prepared by incubating with fructooligosaccharide (FOS) and apple juice, along with Lactobacillus acidophilus and L. bulgaricus at $30-40^{circ}C$ for 24 hr. With the fermentation process, the fishy smell of the soybean was removed and the taste improved. The overrun and melt-down values of the boiled soybean ice cream were significantly higher than those of the parched soybean ice cream, although they were significantly lower than those of the milk ice cream. The sensory characteristics of the soy ice cream prepared with the fermented base of boiled soybeans were significantly improved, as compared to those of the ice cream made using parched soybeans, but they were not significantly different from those of the milk ice cream. The blood glucose level at 120 min after ingestion of the ice cream prepared with FOS and the fermented base of boiled soybean powder was significantly lower than that occurring with the milk ice cream made with sugar.

A Study on the Design of H-Section Steel Column Baseplate under Concentric Loadings (중심 축하중을 받는 H형강 기둥 베이스플레이트의 설계에 대한 연구)

  • Lee, Seung Joon;Lee, Jae Han
    • Journal of Korean Society of Steel Construction
    • /
    • v.17 no.6 s.79
    • /
    • pp.717-726
    • /
    • 2005
  • This study investigates the bearing pressure distribution and design of an H-section steel column baseplate under concentric loading. In general, the size and thickness of the baseplate are determined with the assumption that the bearing pressure of the column baseplate is distributed uniformly. When the column is loaded lightly, however, the baseplate becomes smaller andthinner and the bearing pressure of the baseplate is distributed non-uniformly. In this study, the distribution of the bearing pressure is investigated using the experimental method and the analytical method. Seven specimens of the H-section steel column baseplate were fabricated and tested. The analysis of the specimens was performed using the finite element analysis program, ANSYS. It is not appropriate to use the Limit State Design,which assumes that the bearing pressure of the baseplate is distributed uniformly,because the bearing pressure is distributed non-uniformly and is concentrated under the column sectio.

An Extended Evaluation Algorithm in Parallel Deductive Database (병렬 연역 데이타베이스에서 확장된 평가 알고리즘)

  • Jo, U-Hyeon;Kim, Hang-Jun
    • The Transactions of the Korea Information Processing Society
    • /
    • v.3 no.7
    • /
    • pp.1680-1686
    • /
    • 1996
  • The deterministic update method of intensional predicates in a parallel deductive database that deductive database is distributed in a parallel computer architecture in needed. Using updated data from the deterministic update method, a strategy for parallel evaluation of intensional predicates is required. The paper is concerned with an approach to updating parallel deductive database in which very insertion or deletion can be performed in a deterministic way, and an extended parallel semi-naive evaluation algorithm in a parallel computer architecture. After presenting an approach to updating intensional predicates and strategy for parallel evaluation, its implementation is discussed. A parallel deductive database consists of the set of facts being the extensional database and the set of rules being the intensional database. We assume that these sets are distributed in each processor, research how to update intensional predicates and evaluate using the update method. The parallel architecture for the deductive database consists of a set of processors and a message passing network to interconnect these processors.

  • PDF

Development of Traditional Inlaying Base Using Rapid Prototyping Technique (쾌속조형기술을 이용한 전통상감 베이스 개발)

  • Jang, Woongeun
    • The Journal of the Korea Contents Association
    • /
    • v.14 no.1
    • /
    • pp.1-13
    • /
    • 2014
  • RP(Rapid prototyping) technology is widely used to reduce the cost and cycle time of new prototypes in industries as new product development cycle time currently shortened and the voice of customers also become to be diversified. In this study, RP skill used in making jewelry products was adapted to develop the metallic inlaying base of traditional handicraft products as the significance of CAD/CAM technologies was increased. The RP technology showed that it helped the handicraftsman to cut the groove for inlaying metalic wire more easily, uniformly and diversely than conventional handicraft technique in making the groove with undercut shape. Therefore this study showed that RP technology applied for the metalic inlaying base achieved more elaborate, intricate and uniform patterns, not depending on craftsmanship, compared with conventional handicraft skill in terms of quality, cost and delivery.

Design and Implementation of a Spatial Sensor Database System for the USN Environment (USN 환경을 위한 공간 센서 데이타베이스 시스템의 설계 및 구현)

  • Shin, In-Su;Liu, Lei;Kim, Joung-Joon;Chang, Tae-Soo;Han, Ki-Joon
    • Spatial Information Research
    • /
    • v.20 no.1
    • /
    • pp.59-69
    • /
    • 2012
  • For the USN(Ubiquitous Sensor Network) environment which generally uses spatial sensor data as well as aspatial sensor data, a sensor database system to manage these sensor data is essential. In this reason, some sensor database systems such as TinyDB, Cougar are being developed by many researchers. However, since most of them do not support spatial data types and spatial operators to manage spatial sensor data, they have difficulty in processing spatial sensor data. Therefore, this paper developed a spatial sensor database system by extending TinyDB. Especially, the system supports spatial data types and spatial operators to TinyDB in order to manage spatial sensor data efficiently and provides the memory management function and the filtering function to reduce the system overload caused by sensor data streams. Lastly, we compared the processing time, accuracy, and memory usage of the spatial sensor database system with those of TinyDB and proved its superiority through the performance evaluation.

Linking Korean Predicates to Knowledge Base Properties (한국어 서술어와 지식베이스 프로퍼티 연결)

  • Won, Yousung;Woo, Jongseong;Kim, Jiseong;Hahm, YoungGyun;Choi, Key-Sun
    • Journal of KIISE
    • /
    • v.42 no.12
    • /
    • pp.1568-1574
    • /
    • 2015
  • Relation extraction plays a role in for the process of transforming a sentence into a form of knowledge base. In this paper, we focus on predicates in a sentence and aim to identify the relevant knowledge base properties required to elucidate the relationship between entities, which enables a computer to understand the meaning of a sentence more clearly. Distant Supervision is a well-known approach for relation extraction, and it performs lexicalization tasks for knowledge base properties by generating a large amount of labeled data automatically. In other words, the predicate in a sentence will be linked or mapped to the possible properties which are defined by some ontologies in the knowledge base. This lexical and ontological linking of information provides us with a way of generating structured information and a basis for enrichment of the knowledge base.

Immediate and Partial Validation Mechanism for Update Operations in XML Databases (XML 데이타베이스 변경 연산의 즉시 부분 검증 메카니즘)

  • 김상균;이규철
    • Journal of KIISE:Databases
    • /
    • v.30 no.5
    • /
    • pp.540-551
    • /
    • 2003
  • Recently, several works have been proposed for updating XML documents[l-3] stored in databases. These researches defined update operations and resolved some semantic problems. Because the update operations are usually validated after execution, several conflicts nay occur. For solving these conflicts, XML database systems must be able to validate an update operation immediately according to DTD before the update operation is executed. Furthermore, in many studies for updating, they just validate whole XML documents and can't validate parts of them. If updates are very frequent, validating whole XML documents will cause performance degradation. In this paper, we propose solutions for these two problems. We extract and store DTD information. Then, when an XML document stored in the database is updated, we verifies whether the update is valid or not by using the information. Consequently, XML database systems can always maintain valid XML documents. The validity of update operations is checked immediately before the actual update operation is applied to the database and the validation is performed on only updated parts of an XML document in the database.

An Efficient Knowledge Base Management Using Hybrid SOM (하이브리드 SOM을 이용한 효율적인 지식 베이스 관리)

  • Yoon, Kyung-Bae;Choi, Jun-Hyeog;Wang, Chang-Jong
    • The KIPS Transactions:PartB
    • /
    • v.9B no.5
    • /
    • pp.635-642
    • /
    • 2002
  • There is a rapidly growing demand for the intellectualization of information technology. Especially, in the area of KDD (Knowledge Discovery in Database) which should make an optimal decision of finding knowledge from a large amount of data, the demand is enormous. A large volume of Knowledge Base should be efficiently managed for a more intellectual choice. This study is proposing a Hybrid SOM for an efficient search and renewal of knowledge base, which combines a self-study nerve network, Self-Organization Map with a probable distribution theory in order to get knowledge needed for decision-making management from the Knowledge Base. The efficient knowledge base management through this proposed method is carried out by a stimulation test. This test confirmed that the proposed Hybrid SOM can manage with efficiency Knowledge Base.