• Title/Summary/Keyword: Resource Block

Search Result 225, Processing Time 0.024 seconds

Automation of block assignment planning using a diagram-based scenario modeling method

  • Hwang, In Hyuck;Kim, Youngmin;Lee, Dong Kun;Shin, Jong Gye
    • International Journal of Naval Architecture and Ocean Engineering
    • /
    • v.6 no.1
    • /
    • pp.162-174
    • /
    • 2014
  • Most shipbuilding scheduling research so far has focused on the load level on the dock plan. This is because the dock is the least extendable resource in shipyards, and its overloading is difficult to resolve. However, once dock scheduling is completed, making a plan that makes the best use of the rest of the resources in the shipyard to minimize any additional cost is also important. Block assignment planning is one of the midterm planning tasks; it assigns a block to the facility (factory/shop or surface plate) that will actually manufacture the block according to the block characteristics and current situation of the facility. It is one of the most heavily loaded midterm planning tasks and is carried out manually by experienced workers. In this study, a method of representing the block assignment rules using a diagram was suggested through analysis of the existing manual process. A block allocation program was developed which automated the block assignment process according to the rules represented by the diagram. The planning scenario was validated through a case study that compared the manual assignment and two automated block assignment results.

GNUnet improvement for anonymity supporting in large multimedia file (대형 멀티미디어 파일의 익명성 지원을 위한 수정 GNUnet)

  • Lee, Yoon-Jin;Lee, Myoung-Hoon;Jo, In-June
    • Journal of Internet Computing and Services
    • /
    • v.7 no.5
    • /
    • pp.71-79
    • /
    • 2006
  • The GNUnet proposed a file encoding method by lKB block size to support anonymity of files and decentralizes encoded block to peers through unstructured model. but, the encoding and block decentralizing method with 600$\sim$700MB large multimedia file appeared two problems. First problem. it need addition R block and I block, which make about 4% of storage resource. Second problem, unstructured model added network load by broadcasting decentralizing method. This paper suggest variable encoding block size and structured model by block decentralizing solution. Suggested encoding method reduced block request supplementary block generation to 1% and network load by proposal structured model sending answer through dedicated peer to decentralize block.

  • PDF

Adaptive Partitioning based Downlink Call Admission Control in 3G LTE (3G LTE의 Adaptive Partitioning 기반 다운링크 호 수락제어 방식)

  • Jun, Kyung-Koo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.6A
    • /
    • pp.565-572
    • /
    • 2007
  • 3G Long Term Evolution (3G LTE) is a next generation cellular networks system capable or providing various mobile multimedia services by using OFDMA and MIMO based radio access technology. Among many differences from existing WCDMA based systems, the facts that 3G LTE uses Physical Resource Block (PRB) as its radio resources and provides all services through the PS domain make the development of new resource management schemes necessary. This paper proposes an adaptive partitioning based downlink call admission control scheme. It separates realtime call requests from non-realtime ones, specifies maximum allowable resource amounts for each type, but if the maximum is exceeded, call requests are accepted with probability proportional to remaining resource amounts. Despite the fact that such adaptive concept has been already adopted by other call admission schemes, the contributions of our paper, which are that we are able to find an efficient way to apply the proposed scheme exploiting PRB characteristics and measure the resource usage of base stations by PRB utilization and payload ratio, are still valid. When judging from simulation results in comparison with others, our scheme is able to prioritize realtime call requests over non-realtime ones, and at the same time, overall system performance is superior.

An Automatic Block Allocation Methodology at Shipbuilding Midterm Scheduling (조선 중일정 블록 배량 계획 자동화 연구)

  • Hwang, InHyuck;Nam, SeungHoon;Shin, JongGye
    • Korean Journal of Computational Design and Engineering
    • /
    • v.17 no.6
    • /
    • pp.409-416
    • /
    • 2012
  • Most of the shipbuilding scheduling researches so far have been conducted with stress on the dock plan. That is due to the fact that the dock is the least extendable resource in shipyards and its overloading is difficult to resolve. However, once the dock scheduling is completed, it is also important to make a plan that make the best use of the rest of the resources in the shipyard, so that any additional cost is minimized. This study automates block allocation process by analyzing the existing manual process that designates production bays for the blocks during the midterm planning. Also, a planning scenario validation method is suggested, where block allocation scenarios based on diagrams are edited and simulated.

A Network Load Sensitive Block Placement Strategy of HDFS

  • Meng, Lingjun;Zhao, Wentao;Zhao, Haohao;Ding, Yang
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.9
    • /
    • pp.3539-3558
    • /
    • 2015
  • This paper investigates and analyzes the default block placement strategy of HDFS. HDFS is a typical representative distributed file system to stream vast amount of data effectively at high bandwidth to user applications. However, the default HDFS block placement policy assumes that all nodes in the cluster are homogeneous, and places blocks with a simple RoundRobin strategy without considering any nodes' resource characteristics, which decreases self-adaptability of the system. The primary contribution of this paper is the proposition of a network load sensitive block placement strategy. We have implemented our algorithm and justify it through extensive simulations and comparison with similar existing studies. The results indicate that our work not only performs much better in the data distribution but also improves write performance more significantly than the others.

Multi-block Analysis of Genomic Data Using Generalized Canonical Correlation Analysis

  • Jun, Inyoung;Choi, Wooree;Park, Mira
    • Genomics & Informatics
    • /
    • v.16 no.4
    • /
    • pp.33.1-33.9
    • /
    • 2018
  • Recently, there have been many studies in medicine related to genetic analysis. Many genetic studies have been performed to find genes associated with complex diseases. To find out how genes are related to disease, we need to understand not only the simple relationship of genotypes but also the way they are related to phenotype. Multi-block data, which is a summation form of variable sets, is used for enhancing the analysis of the relationships of different blocks. By identifying relationships through a multi-block data form, we can understand the association between the blocks in comprehending the correlation between them. Several statistical analysis methods have been developed to understand the relationship between multi-block data. In this paper, we will use generalized canonical correlation methodology to analyze multi-block data from the Korean Association Resource project, which has a combination of single nucleotide polymorphism blocks, phenotype blocks, and disease blocks.

Development of a Block Assembly Scheduling System for Shipbuilding Company (고정정반 블록조립 작업장의 일정계획 시스템 개발)

  • Koh, Shie-Gheun;Park, Ju-Chull;Choi, Yong-Sun;Joo, Chul-Min
    • IE interfaces
    • /
    • v.12 no.4
    • /
    • pp.586-594
    • /
    • 1999
  • This paper introduces a production scheduling system for the block assembly shop in a shipbuilding company. We are to make a schedule for the assembly shop and related subassembly production shop. The objectives of the scheduling system are balancing of the workload of the subassembly shops as well as the assembly shop. There are a number of technological and resource constraints including assembly space restriction which is most important and critical resource in the shop. It is very hard and time consuming to consider the two problems, the workload balancing and the spatial allocation problem, simultaneously, and hence, we analyze the two problems independently. The first problem has already been introduced(고시근, 1996), and the overall appearance of the system and the spatial allocation algorithm are presented in this paper.

  • PDF

Design and Implementation of Unified Hardware for 128-Bit Block Ciphers ARIA and AES

  • Koo, Bon-Seok;Ryu, Gwon-Ho;Chang, Tae-Joo;Lee, Sang-Jin
    • ETRI Journal
    • /
    • v.29 no.6
    • /
    • pp.820-822
    • /
    • 2007
  • ARIA and the Advanced Encryption Standard (AES) are next generation standard block cipher algorithms of Korea and the US, respectively. This letter presents an area-efficient unified hardware architecture of ARIA and AES. Both algorithms have 128-bit substitution permutation network (SPN) structures, and their substitution and permutation layers could be efficiently merged. Therefore, we propose a 128-bit processor architecture with resource sharing, which is capable of processing ARIA and AES. This is the first architecture which supports both algorithms. Furthermore, it requires only 19,056 logic gates and encrypts data at 720 Mbps and 1,047 Mbps for ARIA and AES, respectively.

  • PDF

Analysis of the shear failure process of masonry by means of a meso-scopic mechanical modeling approach

  • Wang, Shuhong;Tang, Chun'an;Jia, Peng
    • Structural Engineering and Mechanics
    • /
    • v.24 no.2
    • /
    • pp.181-194
    • /
    • 2006
  • The masonry is a complex heterogeneous material and its shear deformation and fracture is associated with very complicated progressive failures in masonry structure, and is investigated in this paper using a mesoscopic mechanical modelling, Considering the heterogeneity of masonry material, based on the damage mechanics and elastic-brittle theory, the newly developed Material Failure Process Analysis (MFPA) system was brought out to simulate the cracking process of masonry, which was considered as a three-phase composite of the block phase, the mortar phase and the block-mortar interfaces. The crack propagation processes simulated with this model shows good agreement with those of experimental observations by other researchers. This finding indicates that the shear fracture of masonry observed at the macroscopic level is predominantly caused by tensile damage at the mesoscopic level. Some brittle materials are so weak in tension relative to shear that tensile rather than shear fractures are generated in pure shear loading.

Resource-Efficient Object Detector for Low-Power Devices (저전력 장치를 위한 자원 효율적 객체 검출기)

  • Akshay Kumar Sharma;Kyung Ki Kim
    • Transactions on Semiconductor Engineering
    • /
    • v.2 no.1
    • /
    • pp.17-20
    • /
    • 2024
  • This paper presents a novel lightweight object detection model tailored for low-powered edge devices, addressing the limitations of traditional resource-intensive computer vision models. Our proposed detector, inspired by the Single Shot Detector (SSD), employs a compact yet robust network design. Crucially, it integrates an 'enhancer block' that significantly boosts its efficiency in detecting smaller objects. The model comprises two primary components: the Light_Block for efficient feature extraction using Depth-wise and Pointwise Convolution layers, and the Enhancer_Block for enhanced detection of tiny objects. Trained from scratch on the Udacity Annotated Dataset with image dimensions of 300x480, our model eschews the need for pre-trained classification weights. Weighing only 5.5MB with approximately 0.43M parameters, our detector achieved a mean average precision (mAP) of 27.7% and processed at 140 FPS, outperforming conventional models in both precision and efficiency. This research underscores the potential of lightweight designs in advancing object detection for edge devices without compromising accuracy.