• Title/Summary/Keyword: attribute

Search Result 3,332, Processing Time 0.034 seconds

Indexing Techniques or Nested Attributes of OODB Using a Multidimensional Index Structure (다차원 파일구조를 이용한 객체지향 데이터베이스의 중포속성 색인기법)

  • Lee, Jong-Hak
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.8
    • /
    • pp.2298-2309
    • /
    • 2000
  • This paper proposes the multidimensioa! nested attribute indexing techniques (MD- NAI) in object-oriented databases using a multidimensional index structure. Since most conventional indexing techniques for object oriented databases use a one-dimensional index stnlcture such as the B-tree, they do not often handle complex qUlTies involving both nested attributes and class hierarchies. We extend a tunable two dimensional class hierachy indexing technique(2D-CHI) for nested attributes. The 2D-CHI is an indexing scheme that deals with the problem of clustering ohjects in a two dimensional domain space that consists of a kev attribute dOI11'lin and a class idmtifier domain for a simple attribute in a class hierachy. In our extended scheme, we construct indexes using multidimensional file organizations that include one class identifier domain per class hierarchy on a path expression that defines the indexed nested attribute. This scheme efficiently suppoI1s queries that involve search conditions on the nested attribute represcnted by an extcnded path expression. An extended path expression is a one in which a class hierarchy can be substituted by an indivisual class or a subclass hierarchy in the class hierarchy.

  • PDF

Improved STGAN for Facial Attribute Editing by Utilizing Mask Information

  • Yang, Hyeon Seok;Han, Jeong Hoon;Moon, Young Shik
    • Journal of the Korea Society of Computer and Information
    • /
    • v.25 no.5
    • /
    • pp.1-9
    • /
    • 2020
  • In this paper, we propose a model that performs more natural facial attribute editing by utilizing mask information in the hair and hat region. STGAN, one of state-of-the-art research of facial attribute editing, has shown results of naturally editing multiple facial attributes. However, editing hair-related attributes can produce unnatural results. The key idea of the proposed method is to additionally utilize information on the face regions that was lacking in the existing model. To do this, we apply three ideas. First, hair information is supplemented by adding hair ratio attributes through masks. Second, unnecessary changes in the image are suppressed by adding cycle consistency loss. Third, a hat segmentation network is added to prevent hat region distortion. Through qualitative evaluation, the effectiveness of the proposed method is evaluated and analyzed. The method proposed in the experimental results generated hair and face regions more naturally and successfully prevented the distortion of the hat region.

An Evaluation of Planning Factors for Theme Park by means of Importance-Performance Analysis -Focused on the Case of Everland- (중요도-성취도 분석에 의한 주제공원 계획요소 평가 -에버랜드를 사례로-)

  • 오정학;김유일
    • Journal of the Korean Institute of Landscape Architecture
    • /
    • v.29 no.4
    • /
    • pp.34-43
    • /
    • 2001
  • Unlike ordinary recreational facilities, an amusement park consists of various entertainment facilities, attractions, food services, souvenir shops and other attribute. The purpose of this study is to survey users´ responses to such attributes and analyze the importance and performance of each attribute, and thereby, ultimately help improve the efficiency of management and operation of the amusement parks. For this purpose, a survey was conducted of Everland users in August, 1999. 420 users were chosen by means of he systematic sampling. All the suers were asked to rate the importance of 14 attributes of Everland at the entrance and all of them were asked to do the same at the exit. As a result, it was found that the attribute rated highest by the users was ´attraction´, followed by ´service´, ´accessibility´ and ´cost´ in that order. On the other hand, it was found that the total average of importance rated for 14 attributes was 3.31, while that of performance was 3.10. As a consequence of analyzing the action grids, it was found that ´appropriateness of the circulation system´ should be improved most urgently. 7 attributes were categorized as ´keeping up good work´, and 6 ones were rated ´low priority´ in terms of improvement. There was no attribute considered to be ´possible overkill´. Meanwhile, as a result of analyzing the difference among groups in order to determine users´ response depending on their demographic and socio-economic variables, it was found that only the ´age´ variable was significant. It is expected that the results that the results of this study would be useful in determining priorities when improving amusement park facilities or their programs.

  • PDF

Genetic Algorithm Based Attribute Value Taxonomy Generation for Learning Classifiers with Missing Data (유전자 알고리즘 기반의 불완전 데이터 학습을 위한 속성값계층구조의 생성)

  • Joo Jin-U;Yang Ji-Hoon
    • The KIPS Transactions:PartB
    • /
    • v.13B no.2 s.105
    • /
    • pp.133-138
    • /
    • 2006
  • Learning with Attribute Value Taxonomies (AVT) has shown that it is possible to construct accurate, compact and robust classifiers from a partially missing dataset (dataset that contains attribute values specified with different level of precision). Yet, in many cases AVTs are generated from experts or people with specialized knowledge in their domain. Unfortunately these user-provided AVTs can be time-consuming to construct and misguided during the AVT building process. Moreover experts are occasionally unavailable to provide an AVT for a particular domain. Against these backgrounds, this paper introduces an AVT generating method called GA-AVT-Learner, which finds a near optimal AVT with a given training dataset using a genetic algorithm. This paper conducted experiments generating AVTs through GA-AVT-Learner with a variety of real world datasets. We compared these AVTs with other types of AVTs such as HAC-AVTs and user-provided AVTs. Through the experiments we have proved that GA-AVT-Learner provides AVTs that yield more accurate and compact classifiers and improve performance in learning missing data.

The Effect Analysis on the Container Terminal Productivity according to Combination of YT Pooling and Dispatching Rules (이송장비 풀링(Pooling)과 우선순위 규칙(Dispatching rule) 조합에 따른 컨테이너 터미널 생산성 효과분석)

  • Chun, Seoyoung;Yoon, SungWook;Jeong, Sukjae
    • Journal of the Korea Society for Simulation
    • /
    • v.28 no.3
    • /
    • pp.25-40
    • /
    • 2019
  • Today, container terminals are fiercely competing to attract an increasing number of containers. As a way to improve terminal productivity, this study proposes two dispatching rules for yard truck allocation priorities. First, Multi-Attribute Dispatching Rule(MADR) is an allocation method to calculate the weighted sum of multiple factors affecting container terminal productivity and priority them. Especially, the workload of the quay crane was considered one of the factors to reduce the residence time of the ship. Second, Cycling Dispatching Rule(CDR) is the effective way to increase the number of double cycles that directly affect terminal productivity. To identify the effects of combinations of pooling and dispatching, a comparative experiments was performed on 8 scenarios that combined them. A simulation environment has been developed for experiments and the results have demonstrated that the combination of terminal level pooling and Multi-attribute Dispatching could be an excellent combination in KPIs consisting of GCR and delayed departure of ships, etc.

Deep Learning Model for Incomplete Data (불완전한 데이터를 위한 딥러닝 모델)

  • Lee, Jong Chan
    • Journal of the Korea Convergence Society
    • /
    • v.10 no.2
    • /
    • pp.1-6
    • /
    • 2019
  • The proposed model is developed to minimize the loss of information in incomplete data including missing data. The first step is to transform the learning data to compensate for the loss information using the data extension technique. In this conversion process, the attribute values of the data are filled with binary or probability values in one-hot encoding. Next, this conversion data is input to the deep learning model, where the number of entries is not constant depending on the cardinality of each attribute. Then, the entry values of each attribute are assigned to the respective input nodes, and learning proceeds. This is different from existing learning models, and has an unusual structure in which arbitrary attribute values are distributedly input to multiple nodes in the input layer. In order to evaluate the learning performance of the proposed model, various experiments are performed on the missing data and it shows that it is superior in terms of performance. The proposed model will be useful as an algorithm to minimize the loss in the ubiquitous environment.

Fine-Grained and Traceable Key Delegation for Ciphertext-Policy Attribute-Based Encryption

  • Du, Jiajie;HelIl, Nurmamat
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.9
    • /
    • pp.3274-3297
    • /
    • 2021
  • Permission delegation is an important research issue in access control. It allows a user to delegate some of his permissions to others to reduce his workload, or enables others to complete some tasks on his behalf when he is unavailable to do so. As an ideal solution for controlling read access on outsourced data objects on the cloud, Ciphertext-Policy Attribute-Based Encryption (CP-ABE) has attracted much attention. Some existing CP-ABE schemes handle the read permission delegation through the delegation of the user's private key to others. Still, these schemes lack the further consideration of granularity and traceability of the permission delegation. To this end, this article proposes a flexible and fine-grained CP-ABE key delegation approach that supports white-box traceability. In this approach, the key delegator first examines the relations between the data objects, read permission thereof that he intends to delegate, and the attributes associated with the access policies of these data objects. Then he chooses a minimal attribute set from his attributes according to the principle of least privilege. He constructs the delegation key with the minimal attribute set. Thus, we can achieve the shortest delegation key and minimize the time of key delegation under the premise of guaranteeing the delegator's access control requirement. The Key Generation Center (KGC) then embeds the delegatee's identity into the key to trace the route of the delegation key. Our approach prevents the delegatee from combining his existing key with the new delegation key to access unauthorized data objects. Theoretical analysis and test results show that our approach helps the KGC transfer some of its burdensome key generation tasks to regular users (delegators) to accommodate more users.

구조방정식 모형을 이용한 벤처기업 평가요소 검증

  • 손소영;권형인
    • Journal of Technology Innovation
    • /
    • v.9 no.1
    • /
    • pp.1-19
    • /
    • 2001
  • Importance of technology evaluation cannot be overemphasized to support the effective investment policy. Most of the technology evaluation relies on either quantitative analysis for the value or qualitative comparison due to some attribute. When qualitative comparison is made, typically not only individual attribute. but also overall score is evaluated by the committee of experts. In this paper, we consider the qualitative evaluation procedure used in a venture incubating center and validate if the relationship between the average score of individual attribute and the overall score is significant. Additionally, we identify if the initially evaluated scores are good indicators for the realized future value of technology. Structural equation modeling approach is used and we expect that our approach can make important contributions on improving the currently used technology evaluation method.

  • PDF

A Study of Database Security and Efficient Service with Public Key Certificate and Attribute Certificate (PKC와 AC를 이용한 데이터베이스 보안 및 효율적인 서비스 제공 연구)

  • 안민호;송오영;박세현
    • Proceedings of the Korea Institutes of Information Security and Cryptology Conference
    • /
    • 2002.11a
    • /
    • pp.385-388
    • /
    • 2002
  • 본 논문에서는 기본 데이터베이스의 보안적인 취약점에 대해서 알아보고 보안적인 취약점을 해결할 수 있는 방법으로써 Public Key Certificate와 Attribute Certificate를 이용한 서비스 모델을 제시한다. 즉 Public Key Certificate를 이용해서 인증 강도를 높이고 Attribute Certificate를 이용해서 데이터베이스를 사용하는 사용자들에게 Role 기반 권한을 제공해서 사용자들이 데이터베이스를 사용할 수 있는 권한을 손쉽게 세분화 할 수 있는 방법을 제안한다. 또한 공개키 기반 암호화를 사용해서 사용자가 특정 자료를 암호화해서 데이터베이스에 저장함으로써 비도덕적인 데이터베이스 관리자나 혹은 데이터베이스 시스템 내부의 침입자에 의해서 사용자의 데이터가 유출되는 것을 방지하는 방법을 제안한다.

  • PDF

A Study of Improvement Schemes for MPKI of National Defense Digital Network (국방전산통신망을 위한 국방인증체계(MPKI) 개선 방안에 관한 연구)

  • Han, Kwang-Taek;Lee, Su-Youn;Park, Chang-Seop
    • Convergence Security Journal
    • /
    • v.14 no.6_1
    • /
    • pp.147-155
    • /
    • 2014
  • Encryption and authentication system in National Defense is divided into three system; KMI, MPKI, and GPKI. In this paper, we report inherent problem and security threaten in MPKI and propose an attribute-based authentication scheme using attribute-based signature in order to improve user authentication. In our scheme, access structure is used by Monotone Span Program, and system server provides service after user authentication.