Loading...
Search for: computer-system-recovery
0.009 seconds
Total 39 records

    Observations on failure in blogs

    , Article 2007 International Conference on Weblogs and Social Media, ICWSM 2007, Boulder, CO, 26 March 2007 through 28 March 2007 ; 2007 Qazvinian, V ; Rassoulian, A ; Adibi, J ; Sharif University of Technology
    2007
    Abstract
    The capability of placing "comments" on the posts makes the blogspaces rather a complex environment. One of the interesting phenomena in blogspace is "blogger failure" when a blogger stops writing after a certain amount of time and will not return to blogspace for a long time, or when a blogger does not get any comment from her audience. In this paper we illustrate our observation on bloggers failure in a unique blogspace. First, we introduce PersianBlog blogspace briefly along with our observations of behaviors of bloggers on placing comments. Next, we will provide our definition of failure, and give a broad future research path to model failure in blogspace  

    Performance comparison of deadlock recovery and deadlock avoidance routing algorithms in wormhole-switched networks

    , Article IEE Proceedings: Computers and Digital Techniques ; Volume 150, Issue 2 , 2003 , Pages 97-106 ; 13502387 (ISSN) Khonsari, A ; Shahrabi, A ; Ould Khaoua, M ; Sarbazi Azad, H ; Sharif University of Technology
    2003
    Abstract
    Dealing with deadlock has always been a crucial issue for any routing algorithms proposed for wormhole-switched networks. Adaptive routing algorithms, based on deadlock avoidance strategies, usually dedicate resources specifically to ensure deadlock freedom. However, a number of recent studies have demonstrated that deadlocks are quite rare in the network. This fact has motivated researchers to introduce adaptive routing algorithms based on deadlock recovery strategies. In an effort to gain a deep understanding of the factors that affect routing performance, a comparison of the performance merits of deadlock recovery against deadlock avoidance routing algorithms is performed. While most... 

    A deadlock free shortest path routing algorithm for WK-recursive meshes

    , Article 9th International Conference on Distributed Computing and Networking, ICDCN 2008, Kolkata, 5 January 2008 through 8 January 2008 ; Volume 4904 LNCS , 2008 , Pages 280-285 ; 03029743 (ISSN); 3540774432 (ISBN); 9783540774433 (ISBN) Rezazad, M ; Hoseiny Farahabady, M ; Sarbazi Azad, H ; Sharif University of Technology
    Springer Verlag  2008
    Abstract
    In this paper, we investigate an efficient deadlock-free shortest path routing algorithm for WK-recursive mesh networks which has been shown that possess several advantages like suitable to be manufactured by VLSI technology and easy to be expanded. It will be shown that the proposed algorithm requires O(√n) routing steps (where N is the network size) to route the entire network by exploiting either the self-routing or second order routing scheme. © Springer-Verlag Berlin Heidelberg 2008  

    A fault-tolerant cache architecture based on binary set partitioning

    , Article Microelectronics Reliability ; Volume 46, Issue 1 , 2006 , Pages 86-99 ; 00262714 (ISSN) Zarandi, H. R ; Miremadi, S. G ; Sharif University of Technology
    2006
    Abstract
    Caches, which are comprised much of a CPU chip area and transistor counts, are reasonable targets for transient single and multiple faults induced from energetic particles. This paper presents: (1) a new fault detection scheme for tag arrays of cache memories and (2) an architectural cache to improve performance as well as dependability. In this architecture, cache space is divided into sets of different sizes and different tag lengths. Using the proposed fault detection scheme, i.e., GParity, when single and multiple errors are detected in a word, the word is rewritten by its correct data from memory and its GParity code is recomputed. The error detection scheme and the cache architecture... 

    UCS-NT: An unbiased compressive sensing framework for Network Tomography

    , Article ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings ; 2013 , Pages 4534-4538 ; 15206149 (ISSN) ; 9781479903566 (ISBN) Mahyar, H ; Rabiee, H. R ; Hashemifar, Z. S ; Sharif University of Technology
    2013
    Abstract
    This paper addresses the problem of recovering sparse link vectors with network topological constraints that is motivated by network inference and tomography applications. We propose a novel framework called UCS-NT in the context of compressive sensing for sparse recovery in networks. In order to efficiently recover sparse specification of link vectors, we construct a feasible measurement matrix using this framework through connected paths. It is theoretically shown that, only O(k log(n)) path measurements are sufficient for uniquely recovering any k-sparse link vector. Moreover, extensive simulations demonstrate that this framework would converge to an accurate solution for a wide class of... 

    Recovery of sensors in wireless sensor networks

    , Article NCM 2009 - 5th International Joint Conference on INC, IMS, and IDC, 25 August 2009 through 27 August 2009, Seoul ; 2009 , Pages 393-396 ; 9780769537696 (ISBN) Barati, A ; Kholghi, M. A. K ; Movaghar, A ; Sharif University of Technology
    Abstract
    the failure in cluster at a high level can bring up great damages to the system in wireless sensor networks where clustering techniques are used. Certain methods have been reported in the literature in recovering the sensors from a failure cluster. One of the most important methods is to recover the sensors in run-time and without clustering. But it is so much ideal to suppose that all the sensors will be recovered. In this paper, we proposed a method that can operate on the remained sensors that are not recovered. © 2009 IEEE  

    Hysteresis of economic networks in an XY model

    , Article Physica A: Statistical Mechanics and its Applications ; Volume 513 , 2019 , Pages 644-652 ; 03784371 (ISSN) Hosseiny, A ; Absalan, M ; Sherafati, M ; Gallegati, M ; Sharif University of Technology
    Elsevier B.V  2019
    Abstract
    Many-body systems can have multiple equilibria. Though the energy of equilibria might be the same, still systems may resist to switch from an unfavored equilibrium to a favored one. In this paper we investigate occurrence of such phenomenon in economic networks. In times of crisis when governments intend to stimulate economy, a relevant question is on the proper size of stimulus bill. To address the answer, we emphasize the role of hysteresis in economic networks. In times of crises, firms and corporations cut their productions; now since their level of activity is correlated, metastable features in the network become prominent. This means that economic networks resist against the recovery... 

    2D-Bert: Two dimensional burst error recovery technique

    , Article 2007 15th International Conference on Software, Telecommunications and Computer Networks, SoftCOM 2007, Split - Dubrovnik, 27 September 2007 through 29 September 2007 ; 2007 , Pages 411-415 ; 9789536114931 (ISBN) Ajorloo, H ; Kialashaki, H ; Lakdashti, A ; Sharif University of Technology
    2007
    Abstract
    Compressed images such as JPEG when transmitted over communication channels are susceptible to channel noise and/or erasure, which causes losses of blocks of pixels or macroblocks. Recovery of a large block in an image is a difficult task. In this paper we propose a novel method that addresses this problem and can exactly recover a lost block. Moreover, the proposed algorithm is fast enough to be implemented in real time. Simulation results show that our method is faster than previous methods proposed in the literature with less distortion  

    An equivalence based method for compositional verification of the linear temporal logic of constraint automata

    , Article Electronic Notes in Theoretical Computer Science ; Volume 159, Issue 1 , 2006 , Pages 171-186 ; 15710661 (ISSN) Izadi, M ; Movaghar Rahimabadi, A ; Sharif University of Technology
    2006
    Abstract
    Constraint automaton is a formalism to capture the operational semantics of the channel based coordination language Reo. In general constraint automaton can be used as a formalism for modeling coordination of some components. In this paper we introduce a standard linear temporal logic and two fragments of it for expressing the properties of the systems modeled by constraint automata and show that the equivalence relation defined by Valmari et al. is the minimal compositional equivalence preserving that fragment of linear time temporal logic which has no next-time operator and has an extra operator distinguishing deadlocks and a slight modification of this equivalence is the minimal... 

    Experimental evaluation of transient effects on SRAM-based FPGA chips

    , Article 17th 2005 International Conference on Microelectronics, ICM 2005, Islamabad, 13 December 2005 through 15 December 2005 ; Volume 2005 , 2005 , Pages 251-255 ; 0780392620 (ISBN); 9780780392625 (ISBN) Bakhoda, A ; Miremadi, S. G ; Zarandi, H. R ; Sharif University of Technology
    2005
    Abstract
    This paper presents an experimental evaluation of transient effects on SRAM-based FPGAs. A total of 9000 transient faults were injected into the target FPGA using Power Supply Disturbances (PSD). The results show that nearly 60 percent of faults cause system failures and about 58 percent of the faults lead to corruption of the configuration data of the FPGA chip. © 2005 IEEE  

    A performance model of software-based deadlock recovery routing algorithm in hypercubes

    , Article Parallel Processing Letters ; Volume 15, Issue 1-2 , 2005 , Pages 153-168 ; 01296264 (ISSN) Khonsari, A ; Sarbazi Azad, H ; Ould Khaoua, M ; Sharif University of Technology
    2005
    Abstract
    Recent studies have revealed that deadlocks are generally infrequent in the network. Thus the hardware resources, e.g. virtual channels, dedicated for deadlock avoidance are not utilised most of the time. This consideration has motivated the development of novel adaptive routing algorithms with deadlock recovery. This paper describes a new analytical model to predict message latency in hypercubes with a true fully adaptive routing algorithm with progressive deadlock recovery. One of the main features of the proposed model is the use of results from queueing systems with impatient customers to capture the effects of the timeout mechanism used in this routing algorithm for deadlock detection.... 

    The simulation of microbial enhanced oil recovery by using a two-layer perceptron neural network

    , Article Petroleum Science and Technology ; Vol. 32, Issue. 22 , 2014 , pp. 2700-2707 ; ISSN: 10916466 Morshedi, S ; Torkaman, M ; Sedaghat, M. H ; Ghazanfari M.H ; Sharif University of Technology
    Abstract
    The authors simulated a reservoir by using two-layer perceptron. Indeed a model was developed to simulate the increase in oil recovery caused by bacteria injection into an oil reservoir. This model was affected by reservoir temperature and amount of water injected into the reservoir for enhancing oil recovery. Comparing experimental and simulation results and also the erratic trend of data show that the neural networks have modeled this system properly. Considering the effects of nonlinear factors and their erratic and unknown impacts on recovered oil, the perceptron neural network can develop a proper model for oil recovery factor in various conditions. The neural networks have not been... 

    Performance analysis of packet loss recovery policies in P2P video streaming

    , Article International Journal of Internet Protocol Technology ; Vol. 8, issue. 1 , 2014 , p. 44-53 Akbari, B ; Rabiee, H. R ; Ghanbari, M ; Sharif University of Technology
    Abstract
    Packet loss recovery is an important part of P2P video streaming networks due to inevitable packet loss in today's internet and interdependency of data units in compressed video streams. In addition, the architecture of P2P streaming networks, in which the data delivered to the receivers through chain of peers, can intensify the impact of the internet packet loss on the quality of perceived video at the receivers. FEC and ARQ are the two most important techniques that can be used to overcome the side effect of the internet packet loss in P2P video streaming networks. Based on these two techniques, different packet loss recovery strategies can be applied in different overlay hops of a given... 

    Identification of critical components in power systems: A game theory application

    , Article 52nd Annual Meeting on IEEE Industry Application Society, 2 October 2016 through 6 October 2016 ; 2016 ; 9781467386715 (ISBN) Pourahmadi, F ; Fotuhi Firuzabad, M ; Dehghanian, P ; Sharif University of Technology
    Institute of Electrical and Electronics Engineers Inc 
    Abstract
    As the electricity market undergoes continuous evolutions, along with the outdated nature of the grid, system operators would have to be able to more effectively manage the operation costs since waves of maintenance costs and equipment investments would be anticipated in the years to come. Strategic implementation of cost-effective reliability centered maintenance (RCM) approaches seems to be a key solution. This paper proposes an efficient method to assess the component criticality for the system overall reliability and further maintenance focuses. A solution concept of game theory, called Shapely Value, that is able to fairly identify the contribution of each single equipment to the system... 

    Experimental study on imbibition displacement mechanisms of two-phase fluid using micromodel: fracture network, distribution of pore size, and matrix construction

    , Article Physics of Fluids ; Volume 29, Issue 12 , 2017 ; 10706631 (ISSN) Jafari, I ; Masihi, M ; Nasiri Zarandi, M ; Sharif University of Technology
    Abstract
    In this study, the effect of different parameters on the fluid transport in a fractured micromodel has been investigated. All experiments in this study have been conducted in a glass micromodel. Since the state of wetting is important in the micromodel, the wetting experiments have been conducted to determine the state of wetting in the micromodel. The used micromodel was wet by water and non-wet regarding normal decane. The fracture network, distribution of pore size, matrix construction, and injection rate are the most important parameters affecting the process. Therefore, the influence of these parameters was studied using five different patterns (A to E). The obtained results from... 

    Distributed estimation recovery under sensor failure

    , Article IEEE Signal Processing Letters ; Volume 24, Issue 10 , 2017 , Pages 1532-1536 ; 10709908 (ISSN) Doostmohammadian, M ; Rabiee, H. R ; Zarrabi, H ; Khan, U. A ; Sharif University of Technology
    Abstract
    Single-time-scale distributed estimation of dynamic systems via a network of sensors/estimators is addressed in this letter. In single-time-scale distributed estimation, the two fusion steps, consensus and measurement exchange, are implemented only once, in contrast to, e.g., a large number of consensus iterations at every step of the system dynamics. We particularly discuss the problem of failure in the sensor/estimator network and how to recover for distributed estimation by adding new sensor measurements from equivalent states. We separately discuss the recovery for two types of sensors, namely α and β sensors. We propose polynomial-order algorithms to find equivalent state nodes in graph... 

    Observational equivalence in system estimation: contractions in complex networks

    , Article IEEE Transactions on Network Science and Engineering ; 2017 ; 23274697 (ISSN) Doostmohammadian, M ; Rabiee, H. R ; Zarrabi, H ; Khan, U ; Sharif University of Technology
    Abstract
    Observability of complex systems/networks is the focus of this paper, which is shown to be closely related to the concept of contraction. Indeed, for observable network tracking it is necessary/sufficient to have one node in each contraction measured. Therefore, nodes in a contraction are equivalent to recover for loss of observability, implying that contraction size is a key factor for observability recovery. Here, developing a polynomial order contraction detection algorithm, we analyze the distribution of contractions, studying its relation with key network properties. Our results show that contraction size is related to network clustering coefficient and degree heterogeneity.... 

    Application of game theory in reliability-centered maintenance of electric power systems

    , Article IEEE Transactions on Industry Applications ; Volume 53, Issue 2 , 2017 , Pages 936-946 ; 00939994 (ISSN) Pourahmadi, F ; Fotuhi Firuzabad, M ; Dehghanian, P ; Sharif University of Technology
    Abstract
    As the electricity market undergoes continuous evolutions, along with the widely-recognized outdated nature of the grid, system operators would have to be able to more effectively manage the system operation expenses since waves of maintenance costs and equipment investments would be anticipated in a few years to come. Strategic implementation of cost-effective reliability-centered maintenance (RCM) approaches seems to be a key solution. This paper proposes an efficient method to assess the component criticality for system overall reliability and further maintenance focuses. A solution concept of game theory, called shapely value, is proposed that is able to fairly identify the contribution... 

    Observational equivalence in system estimation: contractions in complex networks

    , Article IEEE Transactions on Network Science and Engineering ; Volume 5, Issue 3 , 2018 , Pages 212-224 ; 23274697 (ISSN) Doostmohammadian, M ; Rabiee, H. R ; Zarrabi, H ; Khan, U ; Sharif University of Technology
    IEEE Computer Society  2018
    Abstract
    Observability of complex systems/networks is the focus of this paper, which is shown to be closely related to the concept of contraction. Indeed, for observable network tracking it is necessary/sufficient to have one node in each contraction measured. Therefore, nodes in a contraction are equivalent to recover for loss of observability, implying that contraction size is a key factor for observability recovery. Here, using a polynomial order contraction detection algorithm, we analyze the distribution of contractions, studying its relation with key network properties. Our results show that contraction size is related to network clustering coefficient and degree heterogeneity. Particularly, in... 

    Improving the behavior of buckling restrained braces through obtaining optimum steel core length

    , Article Structural Engineering and Mechanics ; Volume 65, Issue 4 , February , 2018 , Pages 401-408 ; 12254568 (ISSN) Mirtaheri, M ; Sehat, S ; Nazeryan, M ; Sharif University of Technology
    Techno Press  2018
    Abstract
    Concentric braced frames are commonly used in steel structures to withstand lateral forces. One of the drawbacks of these systems is the possibility that the braces are buckled under compressive loads, which leads to sudden reduction of the bearing capacity of the structure. To overcome this deficiency, the idea of the Buckling Restrained Brace (BRB) has been proposed in recent years. The length of a BRB steel core can have a significant effect on its overall behavior, since it directly influences the energy dissipation capability of the member. In this study, numerical methods have been utilized for investigation of the optimum length of BRB steel cores. For this purpose, BRBs with...