Search for: worst-case-analysis
0.006 seconds

    Statistical Analysis of Parameter Fluctuation on Performance of Giga Scale Integration

    , M.Sc. Thesis Sharif University of Technology Asghari Shirvani, Rouzbeh (Author) ; Sarvari, Reza (Supervisor)
    Developing to the sub-micron dimentions reduces the size of integrated circuits, so interconnects and a variations in their characteristics has more effects on circuit performance. Worst case study is the most common method in these systems, but in many cases interconnect lines are independent from eachother. Analysis state that worst case is out of the distribution in many cases (with zero possibility) and result in a pessimistic design. Statistical analysis should replace worst case analysis in multi varient systems. In this titile, statistical analysis will be used to investigate performance of interconnects in new technology. Maximum variation in interconnect parameters are considered... 

    Designing Online Algorithm for Admission Control in Payment Channel Networks

    , M.Sc. Thesis Sharif University of Technology Bastankhah, Mahsa (Author) ; Maddah Ali, Mohammad Ali (Supervisor)
    Payment channel networks (PCNs) are a promising technology to improve the scalability of cryptocurrencies. Users can send instant and almost free transactions via payment channel networks and, at the same time, enjoy the security guarantees of Blockchains. In order to open a mutual payment channel, two users should send a ``channel creation" transaction to the underlying Blockchain. Through this transaction, two parties deposit some money on the Blockchain. This money, which we call the channel's capacity, can be used to send off-chain transactions between the two users. After the channel creation, the channel-holders can send each other off-chain transactions by forwarding the money back... 

    A risk-based decision making approach to determine fireproofing requirements against jet fires

    , Article Journal of Loss Prevention in the Process Industries ; Volume 26, Issue 4 , 2013 , Pages 771-781 ; 09504230 (ISSN) Badri, N ; Rad, A ; Kareshki, H ; Abdolhamidzadeh, B ; Parvizsedghy, R ; Rashtchian, D ; Sharif University of Technology
    API Publication 2218 is one of the most referred practices for fireproofing of onshore structural supports. Despite the extensive citation, it solely considers the effects of pool fire and rarely addresses jet fire outcomes. This absence of an explicit approach is common among all the other major references. Therefore, the basic objective of this paper is to introduce a new approach for determination of the necessity for fireproofing of structural supports against jet fires. For this purpose, the flame geometry and duration of jet fires are simulated for different leak sizes in identified fire potential sources. Then, following a worst-case analysis, those structures that may be impinged by... 

    Worst case dimensioning and modeling of reliable real-time multihop wireless sensor network

    , Article Performance Evaluation ; Volume 66, Issue 12 , 2009 , Pages 685-700 ; 01665316 (ISSN) Mizanian, K ; Yousefi, H ; Jahangir, A. H ; Sharif University of Technology
    Wireless Sensor Network (WSN) should be capable of fulfilling its mission, in a timely manner and without loss of important information. In this paper, we propose a new analytical model for calculating RRT (Reliable Real-Time) degree in multihop WSNs, where RRT degree describes the percentage of real-time data that the network can reliably deliver on time from any source to its destination. Also, packet loss probability is modeled as a function of the probability of link failure when the buffer is full and the probability of node failure when node's energy is depleted. Most of the network properties are considered as random variables and a queuing theory based model is derived. In this... 

    Semantic partitioning of peer-to-peer search space

    , Article Computer Communications ; Volume 32, Issue 4 , 2009 , Pages 619-633 ; 01403664 (ISSN) Rostami, H ; Habibi, J ; Livani, E ; Sharif University of Technology
    Peer-to-peer (P2P) networks are beginning to form the infrastructure of future applications. Computers are organized in P2P overlay networks to facilitate search queries with reasonable cost. So, scalability is a major aim in design of P2P networks. In this paper, to obtain a high factor of scalability, we partition network search space using a consistent static shared upper ontology. We name our approach semantic partition tree (SPT). All resources and queries are annotated using the upper ontology and queries are semantically routed in the overlay network. Also, each node indexes addresses of other nodes that possess contents expressible by the concept it maintains. So, our approach can be...