• Title/Summary/Keyword: size hierarchy

Search Result 146, Processing Time 0.026 seconds

Hierarchical Identity-Based Encryption with Constant-Size Private Keys

  • Zhang, Leyou;Wu, Qing;Hu, Yupu
    • ETRI Journal
    • /
    • v.34 no.1
    • /
    • pp.142-145
    • /
    • 2012
  • The main challenge at present in constructing hierarchical identity-based encryption (HIBE) is to solve the trade-off between private-key size and ciphertext size. At least one private-key size or ciphertext size in the existing schemes must rely on the hierarchy depth. In this letter, a new hierarchical computing technique is introduced to HIBE. Unlike others, the proposed scheme, which consists of only two group elements, achieves constant-size private keys. In addition, the ciphertext consists of just three group elements, regardless of the hierarchy depth. To the best of our knowledge, it is the first efficient scheme where both ciphertexts and private keys achieve O(1)-size, which is the best trade-off between private-key size and ciphertext size at present. We also give the security proof in the selective-identity model.

A Study on the Priority of Residential Choice Element by Middle-size City Residents (중도시 거주자의 주거선택요소 중요도)

  • Cho Hyun-Ju;Park Kyoung-ok
    • Journal of the Korean housing association
    • /
    • v.16 no.6
    • /
    • pp.55-63
    • /
    • 2005
  • The purpose of study is to suggest the data on what residential choice elements have to be considered to be important when the apartments are planed in middle size cities. This study analyzed the environmental characteristics of Cheong-Ju city and compared the priority of residential choice elements by using AHP(Analytic Hierarchy Process). The results of analysis are as follows. 1) The rate of housing supply in Cheong-Ju city is low at $80.2\%$ and concentrated on small sized apartments. Furthermore, the educational and traffic facilities are very insufficient. 2) While residential choice in Cheong-Ju is heavily characterized by educational surroundings, it is less affected by economic aspects such as housing prices and the value of investments and accessibility to public transportations, distance to working places. 3) It is affected by residents' general characteristics like as sex, age, life cycle, education level, properties, home ownership, number of room and type of house they want. In conclusion, the middle size cities like Cheong-Ju need the large scale residential plans connected with educational considerations, focused on improvement in quality and outdoor space. In addition, it is recommended to make plans to satisfy the diverse needs of consumers.

Group Key Management Scheme for Access Control with Reactive Approach (접근 제어를 위한 반응적 방식의 그룹키 관리 기법)

  • Kim, Hee-Youl;Lee, Youn-Ho;Park, Yong-Su;Yoon, Hyun-Soo
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.34 no.11
    • /
    • pp.589-598
    • /
    • 2007
  • In the group communication which has multiple data streams and various access privileges, it is necessary to provide group access control. The group members having the same access privilege are classified into one class, and the classes form a hierarchy based on the access relations. Then each class is assigned to a secret key. In the previous schemes, a single logical key graph is constructed from the hierarchy and each member always holds all secret keys of the classes he can access in the proactive manner. Thus, higher-privileged members hold more keys then lower-privileged members. However, if the hierarchy is large, each member manages too many keys and the size of multicast message in rekeying increases in proportion to the size of the hierarchy. Moreover, most of the members access a small portion of multiple data streams simultaneously. Therefore, it is redundant to receive rekeying message and update the keys in which he is not currently interested. In this paper, we present a new key management scheme that takes a reactive approach in which each member obtains the key of a data stream only when he wants to access the stream. Each member holds and updates only the key of the class he belongs. If he wants to get the key of other class, he derives it from his key and the public parameter. Proposed scheme considerable reduces the costs for rekeying, especially in the group where access relations are very complex and the hierarchy is large. Moreover, the scheme has another advantage that it easily reflects the change of access relations.

Application of AHP to Select for Priority of Permanent Traffic Volume Survey Site (AHP를 적용한 상시 교통량 조사 지점 선정 우선순위 결정에 관한 연구)

  • Oh, Ju-Sam;Lim, Sung-Han;Cho, Yoon-Ho
    • International Journal of Highway Engineering
    • /
    • v.7 no.4 s.26
    • /
    • pp.21-30
    • /
    • 2005
  • Traffic volume data have been used for the plan, the design, and the operation of highway. Since 1955, traffic survey has been nation- widely carried out at national highway and the regular survey in national highway has been conducted at the intersections of highways. However, it is critical issue to select the priority of the regular survey because it is almost impossible to conduct regular survey at all intersections of national highways. In this study, MCDM(Multiple Criteria Decision Making) using AHP(Analytic Hierarchy Process) was applied to decide the priority of the regular survey. The following standard variables for determining the priority was selected the highway plan variables[AADT, VKT, Peak Hourly Volume, Location of highway from Urban], the highway design variables[Volume(pcu), Directional Traffic Volume, Heavy Vehicle Rate], and the highway operation variables[Speed, Density, V/C]. The standard variables were quantified and normalized. Using the Eigen vector method, the weighted values of each hierarchy based on the pair-wise comparison values from the questionnaire survey were calculated. The selection of the priority of regular survey was dependent on the size of the product of the weighted values for each hierarchy and the normalized values for the standard variables. Finally, the priority of regular survey of the intersections of national highways was determined according to the order in the size of the product of two values.

  • PDF

A Block Replacement Scheme using Analytic Hierarchy Process in Hybrid HDD (하이브리드 하드디스크에서 AHP를 적용한 블록 교체 기법)

  • Kim, Jeong-Won
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.20 no.5
    • /
    • pp.45-52
    • /
    • 2015
  • The read performance of hybrid hard disk is better than the legacy hard disk and power consumption is also considerably low. As blocks with enough localities may be located in the non-volatile cache whose size is generally limited, an effective block replacement scheme is required. As this replacement is inevitably affected by various parameters, we define this issue as a kind of multiple criteria decision model. To solve this problem, this paper suggests a new block replacement algorithm based on the analytic hierarchy process. Through simulation for our model, we confirmed that the proposed model could be used as a replacement algorithm of the hybrid hard disk as it may improve boot time as well as response time of general applications.

An Application of Fuzzy Data Envelopment Analytical Hierarchy Process for Reducing Defects in the Production of Liquid Medicine

  • Ketsarapong, Suphattra;Punyangarm, Varathorn
    • Industrial Engineering and Management Systems
    • /
    • v.9 no.3
    • /
    • pp.251-261
    • /
    • 2010
  • This article demonstrated the application of the Fuzzy Data Envelopment Analytical Hierarchy Process (FDEAHP) to evaluate the root causes of critical defect problems occurring in the production of liquid medicine. The methodology of the research began by collecting the defect data by using Check Sheets, and ranking the significant problems by using a Pareto Diagram. Two types of major problems were found to occur, including glass fragments in the medicine and damaged lid threads. The causes of each problem were then analyzed by using Cause and Effect Diagrams. The significant causes were ranked by FDEAHP under three criteria, Severity (S), Occurrence (O) and Detection (D), followed by the framework of the FMEA Technique. Two causes with the highest Final Weight (FW) of each problem were selected to be improved, such as installing auxiliary equipment, using the Poka-Yoke system, setting the scale of the shaft and lathing the bushes of each bottle size. The results demonstrated a reduction in defects from 3.209% to 1.669% and showed that improving a few significant root causes, identified by an experienced decision maker, was sufficient to reduce the defect rate.

Construction of Product Information Hierarchy for Mobile Clients (모바일 클라이언트를 위한 상품정보 객체계층구조 구성)

  • Ha Sangho
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.11 no.2
    • /
    • pp.157-164
    • /
    • 2005
  • With the advances of wireless technologies and mobile computing, m-commerce is being realized on many kinds of mobile devices. Service contents for m-commerce are usually newly written to meet specific characteristics of user's mobile devices, thus requiring formidable efforts. So, it is very important to effectively exploit the Internet product information currently being provided for e-commerce. However, bringing those Internet contents to mobile devices is far from straightforward due to the limitations of mobile devices such as little memory, small displays, low processing speeds, and so forth. In this paper, assuming that the Internet products are represented in XML, we suggest four methods to construct the object hierarchy for effectively viewing the documents on the mobile devices. We then compare and analyze them by experiments in terms of response times and required memory size.

The Primitive Representation in Speech Perception: Phoneme or Distinctive Features (말지각의 기초표상: 음소 또는 변별자질)

  • Bae, Moon-Jung
    • Phonetics and Speech Sciences
    • /
    • v.5 no.4
    • /
    • pp.157-169
    • /
    • 2013
  • Using a target detection task, this study compared the processing automaticity of phonemes and features in spoken syllable stimuli to determine the primitive representation in speech perception, phoneme or distinctive feature. For this, we modified the visual search task(Treisman et al., 1992) developed to investigate the processing of visual features(ex. color, shape or their conjunction) for auditory stimuli. In our task, the distinctive features(ex. aspiration or coronal) corresponded to visual primitive features(ex. color and shape), and the phonemes(ex. /$t^h$/) to visual conjunctive features(ex. colored shapes). The automaticity is measured by the set size effect that was the increasing amount of reaction time when the number of distracters increased. Three experiments were conducted. The laryngeal features(experiment 1), the manner features(experiment 2), and the place features(experiment 3) were compared with phonemes. The results showed that the distinctive features are consistently processed faster and automatically than the phonemes. Additionally there were differences in the processing automaticity among the classes of distinctive features. The laryngeal features are the most automatic, the manner features are moderately automatic and the place features are the least automatic. These results are consistent with the previous studies(Bae et al., 2002; Bae, 2010) that showed the perceptual hierarchy of distinctive features.

A Hierarchical Context Dissemination Framework for Managing Federated Clouds

  • Famaey, Jeroen;Latre, Steven;Strassner, John;Turck, Filip De
    • Journal of Communications and Networks
    • /
    • v.13 no.6
    • /
    • pp.567-582
    • /
    • 2011
  • The growing popularity of the Internet has caused the size and complexity of communications and computing systems to greatly increase in recent years. To alleviate this increased management complexity, novel autonomic management architectures have emerged, in which many automated components manage the network's resources in a distributed fashion. However, in order to achieve effective collaboration between these management components, they need to be able to efficiently exchange information in a timely fashion. In this article, we propose a context dissemination framework that addresses this problem. To achieve scalability, the management components are structured in a hierarchy. The framework facilitates the aggregation and translation of information as it is propagated through the hierarchy. Additionally, by way of semantics, context is filtered based on meaning and is disseminated intelligently according to dynamically changing context requirements. This significantly reduces the exchange of superfluous context and thus further increases scalability. The large size of modern federated cloud computing infrastructures, makes the presented context dissemination framework ideally suited to improve their management efficiency and scalability. The specific context requirements for the management of a cloud data center are identified, and our context dissemination approach is applied to it. Additionally, an extensive evaluation of the framework in a large-scale cloud data center scenario was performed in order to characterize the benefits of our approach, in terms of scalability and reasoning time.

Pre-aggregation Index Method Based on the Spatial Hierarchy in the Spatial Data Warehouse (공간 데이터 웨어하우스에서 공간 데이터의 개념계층기반 사전집계 색인 기법)

  • Jeon, Byung-Yun;Lee, Dong-Wook;You, Byeong-Seob;Kim, Gyoung-Bae;Bae, Hae-Young
    • Journal of Korea Multimedia Society
    • /
    • v.9 no.11
    • /
    • pp.1421-1434
    • /
    • 2006
  • Spatial data warehouses provide analytical information for decision supports using SOLAP (Spatial On-Line Analytical Processing) operations. Many researches have been studied to reduce analysis cost of SOLAP operations using pre-aggregation methods. These methods use the index composed of fixed size nodes for supporting the concept hierarchy. Therefore, these methods have many unused entries in sparse data area. Also, it is impossible to support the concept hierarchy in dense data area. In this paper, we propose a dynamic pre-aggregation index method based on the spatial hierarchy. The proposed method uses the level of the index for supporting the concept hierarchy. In sparse data area, if sibling nodes have a few used entries, those entries are integrated in a node and the parent entries share the node. In dense data area, if a node has many objects, the node is connected with linked list of several nodes and data is stored in linked nodes. Therefore, the proposed method saves the space of unused entries by integrating nodes. Moreover it can support the concept hierarchy because a node is not divided by linked nodes. Experimental result shows that the proposed method saves both space and aggregation search cost with the similar building cost of other methods.

  • PDF