• 제목/요약/키워드: attribute data

검색결과 1,252건 처리시간 0.022초

구조실험정보를 위한 데이터 모델의 구성 및 사용성 평가 (Evaluation of Organization and Use of Data Model for Structural Experiment Information)

  • 이창호
    • 한국전산구조공학회논문집
    • /
    • 제28권6호
    • /
    • pp.579-588
    • /
    • 2015
  • 구조실험을 위한 데이터 모델은 구조실험에 관련된 실험정보를 정형화하여 표현하므로 데이터 저장소를 개발하는데 이용할 수 있다. 데이터 모델은 특히 대규모의 구조실험정보 또는 일반적인 다양한 실험정보를 위한 데이터 저장소에 효과적인데 예를 들면 NEES에서 개발한 NEEShub Project Warehouse가 있다. 본 논문은 데이터 모델의 구성과 사용을 평가하기 위한 평가요소를 제안하고 있다. 클래스의 속성이 값을 갖는지를 의미하는 AVE(attribute value existence)란 용어를 도입하여 속성의 사용성에 대한 Attribute AVE, 클래스의 사용성에 대한 Class AVE, 하위레벨에 있는 클래스를 포함하는 Class Level AVE, 하나의 프로젝트의 모든 클래스를 포함하는 Project AVE, 모든 프로젝트를 포함하는 데이터 모델에 대한 Data Model AVE를 정의하였다. 이러한 평가요소들을 NEES 데이터 모델의 프로젝트들에 적용하였는데 데이터 모델내의 클래스와 객체에 대한 사용성을 수치적으로 기술하여 평가하는 것이 가능하였다.

Provably secure attribute based signcryption with delegated computation and efficient key updating

  • Hong, Hanshu;Xia, Yunhao;Sun, Zhixin;Liu, Ximeng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제11권5호
    • /
    • pp.2646-2659
    • /
    • 2017
  • Equipped with the advantages of flexible access control and fine-grained authentication, attribute based signcryption is diffusely designed for security preservation in many scenarios. However, realizing efficient key evolution and reducing the calculation costs are two challenges which should be given full consideration in attribute based cryptosystem. In this paper, we present a key-policy attribute based signcryption scheme (KP-ABSC) with delegated computation and efficient key updating. In our scheme, an access structure is embedded into user's private key, while ciphertexts corresponds a target attribute set. Only the two are matched can a user decrypt and verify the ciphertexts. When the access privileges have to be altered or key exposure happens, the system will evolve into the next time slice to preserve the forward security. What's more, data receivers can delegate most of the de-signcryption task to data server, which can reduce the calculation on client's side. By performance analysis, our scheme is shown to be secure and more efficient, which makes it a promising method for data protection in data outsourcing systems.

인터넷 쇼핑몰 사이트 설계 속성들의 사용성 관점에서의 요인분석적 분류 (Factor Analytic Classification of Design Attributes of Shopping-Mall Sites under the View of Usability)

  • 고석하;김주성;경원현
    • Journal of Information Technology Applications and Management
    • /
    • 제10권4호
    • /
    • pp.29-50
    • /
    • 2003
  • This research provide the basic information to enhance the user-orientedness of usability design guidelines for software products and an effective empirical guidance to classify design attributes of internet shopping mall sites. The results of analysis show that design attributes can be classified into the procedural attribute group, the shopping tool attribute group, the visual attribute group, linguistic attribute group, and others. The results show that shopping tool attribute group can be divided further into the search tool attribute group and purchase tool attribute group and that the visual attribute group can be divided further into the screen condition attribute group and the character legibility attribute group. The research reveals that when designers design software interfaces and features they should take the compound effect of a group of design attributes into consideration to enhance the usability of the system.

  • PDF

퍼지객체지향자료모형에서 구간값 퍼지집합을 이용한 속성값 계산 (Calculating Attribute Values using Interval-valued Fuzzy Sets in Fuzzy Object-oriented Data Models)

  • 조상엽;이종찬
    • 인터넷정보학회논문지
    • /
    • 제4권4호
    • /
    • pp.45-51
    • /
    • 2003
  • 일반적으로 퍼지객체지향자료모형에서 속성값은 퍼지집합을 표현한다. 만일 퍼지객체지향자료모형에서 속성값을 구간값 퍼지집합으로 표현할 수 있다면, 퍼지객체지향자료모형에서 사용하는 속성값을 더 유연하게 표현하는 것이 가능하다. 퍼지객체지향자료모형의 상속구조에 나타나는 프레임내에 있는 속성값을 구하기 위해 구간값 퍼지집합을 사용하는 우선순위 논리곱연산을 이용하여 계산한다. 이 방법은 속성값의 소속정도가 기존의 퍼지집합이 아닌 구간값 퍼지집합으로 표현하는 지식정보처리분야에서 사용할 수 있다.

  • PDF

속성유사도에 따른 사회연결망 서브그룹의 군집유효성 (Clustering Validity of Social Network Subgroup Using Attribute Similarity)

  • 윤한성
    • 디지털산업정보학회논문지
    • /
    • 제17권1호
    • /
    • pp.75-84
    • /
    • 2021
  • For analyzing big data, the social network is increasingly being utilized through relational data, which means the connection characteristics between entities such as people and objects. When the relational data does not exist directly, a social network can be configured by calculating relational data such as attribute similarity from attribute data of entities and using it as links. In this paper, the composition method of the social network using the attribute similarity between entities as a connection relationship, and the clustering method using subgroups for the configured social network are suggested, and the clustering effectiveness of the clustering results is evaluated. The analysis results can vary depending on the type and characteristics of the data to be analyzed, the type of attribute similarity selected, and the criterion value. In addition, the clustering effectiveness may not be consistent depending on the its evaluation method. Therefore, selections and experiments are necessary for better analysis results. Since the analysis results may be different depending on the type and characteristics of the analysis target, options for clustering, etc., there is a limitation. In addition, for performance evaluation of clustering, a study is needed to compare the method of this paper with the conventional method such as k-means.

Multi-Attribute Data Fusion for Energy Equilibrium Routing in Wireless Sensor Networks

  • Lin, Kai;Wang, Lei;Li, Keqiu;Shu, Lei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제4권1호
    • /
    • pp.5-24
    • /
    • 2010
  • Data fusion is an attractive technology because it allows various trade-offs related to performance metrics, e.g., energy, latency, accuracy, fault-tolerance and security in wireless sensor networks (WSNs). Under a complicated environment, each sensor node must be equipped with more than one type of sensor module to monitor multi-targets, so that the complexity for the fusion process is increased due to the existence of various physical attributes. In this paper, we first investigate the process and performance of multi-attribute fusion in data gathering of WSNs, and then propose a self-adaptive threshold method to balance the different change rates of each attributive data. Furthermore, we present a method to measure the energy-conservation efficiency of multi-attribute fusion. Based on our proposed methods, we design a novel energy equilibrium routing method for WSNs, viz., multi-attribute fusion tree (MAFT). Simulation results demonstrate that MAFT achieves very good performance in terms of the network lifetime.

Enabling Fine-grained Access Control with Efficient Attribute Revocation and Policy Updating in Smart Grid

  • Li, Hongwei;Liu, Dongxiao;Alharbi, Khalid;Zhang, Shenmin;Lin, Xiaodong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제9권4호
    • /
    • pp.1404-1423
    • /
    • 2015
  • In smart grid, electricity consumption data may be handed over to a third party for various purposes. While government regulations and industry compliance prevent utility companies from improper or illegal sharing of their customers' electricity consumption data, there are some scenarios where it can be very useful. For example, it allows the consumers' data to be shared among various energy resources so the energy resources are able to analyze the data and adjust their operation to the actual power demand. However, it is crucial to protect sensitive electricity consumption data during the sharing process. In this paper, we propose a fine-grained access control scheme (FAC) with efficient attribute revocation and policy updating in smart grid. Specifically, by introducing the concept of Third-party Auditor (TPA), the proposed FAC achieves efficient attribute revocation. Also, we design an efficient policy updating algorithm by outsourcing the computational task to a cloud server. Moreover, we give security analysis and conduct experiments to demonstrate that the FAC is both secure and efficient compared with existing ABE-based approaches.

Randomized Response Model with Discrete Quantitative Attribute by Three-Stage Cluster Sampling

  • Lee, Gi-Sung;Hong, Ki-Hak
    • Journal of the Korean Data and Information Science Society
    • /
    • 제14권4호
    • /
    • pp.1067-1082
    • /
    • 2003
  • In this paper, we propose a randomized response model with discrete quantitative attribute by three-stage cluster sampling for obtaining discrete quantitative data by using the Liu & Chow model(1976), when the population was made up of sensitive discrete quantitative clusters. We obtain the minimum variance by calculating the optimum number of fsu, ssu, tsu under the some given constant cost. And we obtain the minimum cost under the some given accuracy.

  • PDF

Optimal Designs for Attribute Control Charts

  • Chung, Sung-Hee;Park, Sung-Hyun;Park, Jun-Oh
    • 한국통계학회:학술대회논문집
    • /
    • 한국통계학회 2003년도 추계 학술발표회 논문집
    • /
    • pp.97-103
    • /
    • 2003
  • Shewhart-type control charts have historically been used for attribute data, though they have ARL biased property and even are unable to detect the improvement of a process with some process parameters. So far most efforts have been made to improve the performance of attribute control charts in terms of faster detection of special causes without increasing the rates of false alarm. In this paper, control limits are proposed that yield an ARL (nearly) unbiased chart for attributes. Optimal design is also proposed for attribute control charts under a natural sense of criterion.

  • PDF

데이터 스트림 상에서 다중 연속 질의 처리를 위한 속성기반 접근 기법 (Attribute-based Approach for Multiple Continuous Queries over Data Streams)

  • 이현호;이원석
    • 정보처리학회논문지D
    • /
    • 제14D권5호
    • /
    • pp.459-470
    • /
    • 2007
  • 데이터 스트림은 빠르게 연속적으로 발생하는 무제한의 데이터 튜플의 집합이다. 이러한 데이터 스트림에 대한 질의 처리 또한 연속적이고 신속해야 하며 엄격한 시공간적 제약이 요구된다. 대부분의 데이터 스트림 관리시스템(DSMS)에서는 시공간적 제약사항을 효과적으로 지키기 위해서 등록된 연속 질의들의 선택 조건(selection predicate)들을 그룹화하거나 색인처리 한다. 본 논문에서는 연속 질의들의 선택 조건들을 속성별로 그룹화한 새로운 구조체인 속성 선택체(Attribute Selection Construct)를 제안한다. 속성 선택체에는 해당 속성이 특정 질의조건에 사용되는지 여부, 부분적으로 미리 계산된 질의결과 정보, 그리고 해당 속성의 선택률 통계 등 효율적인 질의 처리를 위한 유용한 정보들이 포함된다. 또한, 대상 질의집합을 구현한 속성 선택체들 간의 처리 순서는 전체적인 질의성능에 많은 영향을 미칠 수 있기 때문에 효과적으로 속성 선택체 처리 순서를 결정할 수 있는 전략도 함께 제안된다. 마지막으로, 기존의 방법들이 포함된 다양한 실험을 통하여 제안된 방법론의 성능을 여러 각도에서 비교 검증한다.