• Title/Summary/Keyword: costs-sharing

Search Result 142, Processing Time 0.026 seconds

Construction Cost Segregation Process using Building Information Modeling

  • Zhou, Rong;Li, Huimin;Zhang, Chengyi;Lv, Lelin;Tian, Junrui;Cakir, Sevilay Demirkesen
    • International conference on construction engineering and project management
    • /
    • 2022.06a
    • /
    • pp.1106-1113
    • /
    • 2022
  • Cost segregation helps reduce tax liabilities by reclassifying real property to personal property and accelerates tax depreciation of a property. A typical cost segregation study requires much time and high costs. This study proposed a BIM integrated cost segregation process that can be applied to any commercial building project. The proposed BIM-based cost segregation process was verified in a new commercial construction project. It approved that this approach can: (1) increase the cash flow for the owner and provide assistance to tax-paying enterprises; (2) enable the contractor to use it as an added value in the bidding process; (3) realize data sharing in a common platform to improve the cost segregation study efficiency and reduce costs and errors; (4) contribute to the asset management in the life cycle of buildings while filling in the blank of cost segregation process. Future studies will focus on the automation of cost segregation and asset management in building construction's life cycle.

  • PDF

A Transmission-Efficient Broadcast Encryption System Based on Secret Sharing Method (비밀분산 기반의 효율적인 전송량을 갖는 브로드캐스트 암호시스템)

  • Lee, Jae Hwan;Park, Jong Hwan
    • Journal of Broadcast Engineering
    • /
    • v.21 no.3
    • /
    • pp.412-424
    • /
    • 2016
  • Broadcast encryption (BE) is a cryptographic primitive that enables a sender to broadcast a message to a set of receivers in a secure channel. The efficiency of BE is measured by three factors: ciphertext transmission cost, user storage cost, and computational cost for decryption. In general, BE is applied to the environments where a large number of receivers should be accommodated, so that the transmission cost is considered as being the most important factor. In this paper, we suggest a new BE system, using Shamir's secret sharing method, which considerable reduces the transmission cost. In comparison to the previous Subset Difference (SD) system, the transmission size of our BE is longer until $r{\leq}\sqrt{n}$, but get shorter when $r{\geq}\sqrt{n}$ for number of revoked users and n number of total users. We show that the advantage can be achieved at the slight expense of both the storage and computational costs.

Verification Control Algorithm of Data Integrity Verification in Remote Data sharing

  • Xu, Guangwei;Li, Shan;Lai, Miaolin;Gan, Yanglan;Feng, Xiangyang;Huang, Qiubo;Li, Li;Li, Wei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.2
    • /
    • pp.565-586
    • /
    • 2022
  • Cloud storage's elastic expansibility not only provides flexible services for data owners to store their data remotely, but also reduces storage operation and management costs of their data sharing. The data outsourced remotely in the storage space of cloud service provider also brings data security concerns about data integrity. Data integrity verification has become an important technology for detecting the integrity of remote shared data. However, users without data access rights to verify the data integrity will cause unnecessary overhead to data owner and cloud service provider. Especially malicious users who constantly launch data integrity verification will greatly waste service resources. Since data owner is a consumer purchasing cloud services, he needs to bear both the cost of data storage and that of data verification. This paper proposes a verification control algorithm in data integrity verification for remotely outsourced data. It designs an attribute-based encryption verification control algorithm for multiple verifiers. Moreover, data owner and cloud service provider construct a common access structure together and generate a verification sentinel to verify the authority of verifiers according to the access structure. Finally, since cloud service provider cannot know the access structure and the sentry generation operation, it can only authenticate verifiers with satisfying access policy to verify the data integrity for the corresponding outsourced data. Theoretical analysis and experimental results show that the proposed algorithm achieves fine-grained access control to multiple verifiers for the data integrity verification.

Design and Analysis of Tech-Economic for Optimized Access Network over Information Super Highway (초고속정보통신망에서의 최적 가입자망을 위한 경제성 분석 및 설계)

  • Jang, Jong-Wook;Lee, Kae-Sang;Lee, Jung-Tae
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.6
    • /
    • pp.1589-1600
    • /
    • 1997
  • The construction of optical access network costs upper 40% in total installation cost of total optical network. Optimization of access network therefore is core in optical network. Advanced countries include EU, Japan and USA already have researched access network. This paper presents analysis of three broad-band fiber-optics subscriber loop architectures(HFC, ATM-PON, Super PON). The analyses focus on the specific demonstrated architectures and use component cost projections to estimate future network costs on a per-subscriber basis. We use TITAN(Tool for Introduction Scenarios and Techno-Economic Evaluation of The Access Network) model. We find that ATM-PON can deliver voice and ISDN data at installed first costs than the other architectures. This is due to the sharing bandwidth among a cluster of subscribers within Curb. This work intends to support establishing guidelines for strategic decisions regarding the development of the access network alternatives of different operators.

  • PDF

Parameter-Efficient Neural Networks Using Template Reuse (템플릿 재사용을 통한 패러미터 효율적 신경망 네트워크)

  • Kim, Daeyeon;Kang, Woochul
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.9 no.5
    • /
    • pp.169-176
    • /
    • 2020
  • Recently, deep neural networks (DNNs) have brought revolutions to many mobile and embedded devices by providing human-level machine intelligence for various applications. However, high inference accuracy of such DNNs comes at high computational costs, and, hence, there have been significant efforts to reduce computational overheads of DNNs either by compressing off-the-shelf models or by designing a new small footprint DNN architecture tailored to resource constrained devices. One notable recent paradigm in designing small footprint DNN models is sharing parameters in several layers. However, in previous approaches, the parameter-sharing techniques have been applied to large deep networks, such as ResNet, that are known to have high redundancy. In this paper, we propose a parameter-sharing method for already parameter-efficient small networks such as ShuffleNetV2. In our approach, small templates are combined with small layer-specific parameters to generate weights. Our experiment results on ImageNet and CIFAR100 datasets show that our approach can reduce the size of parameters by 15%-35% of ShuffleNetV2 while achieving smaller drops in accuracies compared to previous parameter-sharing and pruning approaches. We further show that the proposed approach is efficient in terms of latency and energy consumption on modern embedded devices.

Strengthening Authentication Through Content Centric Networking

  • Kim, Sung-Jin;Park, Jae-Kyung
    • Journal of the Korea Society of Computer and Information
    • /
    • v.22 no.4
    • /
    • pp.75-82
    • /
    • 2017
  • While the internet has evolved in terms of information sharing and efficiency, it is still prone to security attacks and remains vulnerable even when equipped with a security mechanism. Repeated patching against hacks involves excessive wear of system equipment and high costs. Methods of improving network security include the introduction of security equipment and network partitions, but they have not been fully effective. A fundamental solution is the Operation Content Network (OCN), which enables the strengthening of authentication. In this paper, Instead of following the existing TCP/IP system, OCN establishes an immunity-based security system through content-centric communications. Data transmission occurs over a Content Centric Network (CCN), which is provided with a protocol verified by the CCNx group. Areas protected by OCN rely only on CCN for communication without using any IP. As such, it defends the system against unknown attacks, including zero-day attacks.

A Study on Efficient Integrated Kitchen Management of Restaurant (외식업체 통합주방의 효율적인 운영관리에 관한 연구 -통합주방의 중앙공급에 따른 효율화 사례중심으로-)

  • 박종훈;조용범
    • Culinary science and hospitality research
    • /
    • v.9 no.4
    • /
    • pp.54-68
    • /
    • 2003
  • This study aims at efficiency of kitchen management by adoption of a systematic central kitchen and conversion of conventional kitchen to convenience kitchen at ' H ' restaurant. First, integrated menu control of banquet buffet functions became more competitive with quality menu and eventually brought about guests satisfaction. Second, systematic central kitchen made possible standardization and mass production through simplified production line. Efficiency through quick service and shortened preparation time was realized, and food materials were recycled effectively at the same time. Integrated ordering lowered purchasing price and built an efficient cost control system. Third, conversion of conventional kitchen to convenience kitchen and strengthened central kitchen system facilitated agreeable work conditions and optimal work flow with butcher's and even sauce making utensils. Fourth, integrated supply system of buffet menu and sauce from western restaurants saved about 520 million won of labor costs. Last, one integrated kitchen out of two was easier in sanitation control with pleasant restaurant space. Sharing kitchen facilities and equipments also saved about 30% of maintenance fee. Power, water, and gas were also saved and eventually curtailed overall expenses.

  • PDF

Dynamic Supplier-Managed Inventory Control and the Beneficial Effect of Information Sharing (공급자 주도의 동적 재고 통제와 정보 공유의 수혜적 효과 분석에 대한 연구)

  • Kim Eun-gab;Park Chan-kwon;Shin Ki-tae
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.29 no.3
    • /
    • pp.63-78
    • /
    • 2004
  • This paper deals with a supplier-managed inventory(SMI) control for a two-echelon supply chain model with a service facility and a single supplier. The service facility is allocated to customers and provides a service using items of inventory that are purchased from the supplier, Assuming that the supplier knows the information of customer queue length as well as inventory position in the service facility at the time when it makes a replenishment decision, we identify an optimal replenishment policy which minimizes the total supply chain costs by reflecting these information into the replenishment decision. Numerical analysis demonstrates that the SMI strategy can be more cost-effective when the information of both customer queue length and inventory position is shared than when the information of inventory position only is shared.

Offsetting Inventory Cycle of Items Sharing Storage using Mixed Integer Programming & Genetic Algorithm (혼합정수계획법 및 유전자 알고리즘을 이용한 다품목 재고 시스템의 주문 주기 상쇄에 관한 연구)

  • 문일경;차병철;김선권
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2003.11a
    • /
    • pp.81-84
    • /
    • 2003
  • The ability to determine the optimal frequencies and offsets for independent and unrestricted ordering cycles for multiple items can be very valuable for managing storage capacity constrained facilities in a supply chain. The complexity of this problem has resulted in researchers focusing on more tractable surrogate problems that are special cases of the base problem. Murthy et al. (European Journal of Operation Research 2003) developed insights leading to solution of the original problem and present a heuristic for offsetting independent and unrestricted ordering cycles for items to minimize their joint storage requirements. However, their study cannot find optimal solution due to the Greedy Heuristic solution procedure. In this paper, we present a complete procedure to find the optimal solution for the model with a integer programming optimization approach and genetic algorithm. Numerical examples are included to compare each model with that of Murthy et at. Research of this type may prove useful in solving the more general problem of selecting order policies to minimize combined holding, ordering, and storage costs.

  • PDF

Proper Incentives to Promote Information Exchange

  • Obayashi, Atsuomi
    • Industrial Engineering and Management Systems
    • /
    • v.6 no.1
    • /
    • pp.55-63
    • /
    • 2007
  • Exchange of information is essential to the process of innovation such as product development. However, in many cases innovation fails because of a lack of knowledge sharing among parties concerned, even if parties individually have pieces of useful knowledge and skills. Besides physical factors like communication costs, the possibility of opportunistic behavior by parties like stealing ideas can discourage information exchange. This paper introduces a model to analyze incentives of information exchange. The model is a game by two players who alternately opt to offer information to the partner. It is suggested that information exchange can stop before reaching the efficient level. In order to attain the efficient information exchange, expectation of mutual benefit and absence of opportunistic motives in both players are needed. Methods for promoting information exchange include modifying payoff structure to meet the condition of information exchange. The fluidity of partnership may increase a variety of information exchange partners, but discourage building trust between partners which promotes information exchange.