Loading...
Search for: poursoltani-zarandi--milad
0.073 seconds

    Edge Ideals and the Cohen-Macaulay Property

    , M.Sc. Thesis Sharif University of Technology Poursoltani Zarandi, Milad (Author) ; Pournaki, Mohammad Reza (Supervisor)
    Abstract
    set V = {1; : : : ; n}. Let K be a field and let S be the polynomial ring K[x1; : : : ; xn].The edge ideal I(G), associated to G, is the ideal of S generated by the set of squarefree monomials xi xj so that i is adjacent to j. The graph G is Cohen–Macaulay over K if S=I(G) is a Cohen–Macaulay ring. In this project we will explain Herzog-Hibi’s classification of all Cohen–Macaulay bipartite graphs  

    Commutative Algebra in Action: Betti Numbers and Combinatorics

    , Ph.D. Dissertation Sharif University of Technology Poursoltani Zarandi, Milad (Author) ; Pournaki, Mohammad Reza (Supervisor) ; Maimani, Hamid Reza (Supervisor) ; Parsaei Majd, Leila (Co-Supervisor)
    Abstract
    In this thesis, we give necessary and sufficient conditions for a simplicial com- plex with small codimension to satisfy the Serre’s condition (Sr) as well as the CMt property. We also give a connection between being (Sr) and being CMt. Also, we focus on the dimension of dual modules of local cohomology of Stanley– Reisner rings to obtain a new vector which contains important information on the Serre’s condition (Sr) and the CMt property as well as the depth of Stanley–Reisner rings. We prove some results in this regard including lower bounds for the depth of Stanley–Reisner rings. Further, we give a characterization of (d − 1)-dimensional simplicial complexes with codimension two which are... 

    Does the short-term boost of renewable energies guarantee their stable long-term growth? Assessment of the dynamics of feed-in tariff policy

    , Article Renewable Energy ; Volume 159 , October , 2020 , Pages 1252-1268 Milad Mousavian, H ; Hamed Shakouri, G ; Mashayekhi, A. N ; Kazemi, A ; Sharif University of Technology
    Elsevier Ltd  2020
    Abstract
    Feed-in tariff (FiT) is one of the most efficient ways that many governments throughout the world use to stimulate investment in renewable energies (REs) technology. For governments, financial management of the policy could be challenging as it needs a considerable amount of budget to support RE producers during the long remuneration period. In this paper, it has been illuminated that the early growth of REs capacity could be a temporary boost. And the socio-economic structure of the system will backlash the policy if some social mechanisms are not considered. Social tolerance for paying REs tax and potential investors’ trust emanated from budget-related mechanisms -which have rarely been... 

    On the structure of matroids arising from the gain graphs

    , Article Discrete Mathematics ; Volume 346, Issue 12 , 2023 ; 0012365X (ISSN) Maimani, H. R ; Parsaei Majd, L ; Pournaki, M. R ; Poursoltani, M ; Sharif University of Technology
    Elsevier B.V  2023
    Abstract
    The gain graphs are essential generalizations of the signed graphs. They are indeed directed graphs whose edges are labeled by the elements of a group rather than just ±1. In this paper, we prove the existence of matroids arising from these graphs. Further, we study the structure of the obtained matroids as well as their relation with the generalized Hamming weights, the regularity of the ideal of circuits, and the codes. © 2023 Elsevier B.V  

    Hierarchical set-associate cache for high-performance and low-energy architecture

    , Article Journal of Circuits, Systems and Computers ; Volume 15, Issue 6 , 2006 , Pages 861-880 ; 02181266 (ISSN) Zarandi, H. R ; Miremadi, G ; Sharif University of Technology
    2006
    Abstract
    This paper presents a new cache scheme based on varying the size of sets in the set-associative cache hierarchically. In this scheme, all sets at a hierarchical level have same size but are fc times more than the size of sets in the next level of hierarchy where k is called division factor. Therefore the size of tag fields associated to each set is variable and it depends on the hierarchy level of the set it is in. This scheme is proposed to achieve higher hit ratios with respect to the two conventional schemes namely set-associative and direct mapping. The proposed scheme has been simulated with several standard trace files SPEC 2000 and statistics are gathered and analyzed for different... 

    Synthesis and characterization of novel 2,4,6,8,10,12-hexanitro-2,4,6,8,10,12-hexaazaisowurtzitane (2,4,6,8,10,12-hexanitro-2,4,6,8,10,12-hexaazatetracyclo dodecane based nanopolymer-bonded explosives by microemulsion

    , Article Journal of Molecular Liquids ; Volume 206 , June , 2015 , Pages 190-194 ; 01677322 (ISSN) Bayat, Y ; Soleyman, R ; Zarandi, M ; Sharif University of Technology
    Elsevier  2015
    Abstract
    2,4,6,8,10,12-Hexanitro-2,4,6,8,10,12-hexaazaisowurtzitane (2,4,6,8,10,12-hexanitro-2,4,6,8,10,12-hexaazatetracyclo dodecane (CL-20)-based polymer/plastic bonded explosives are used in propellant formulation. It can be predicted that CL-20-based nano-polymer/plastic bonded explosives are able to have reduced composite sensitivity and superior mechanical strength. In the current study, we have prepared two kinds of CL-20-based nano-polymer/plastic bonded explosives with ethylene-vinyl acetate copolymer and glycidyl azide polymer via the microemulsion method. Several visual techniques such as SEM/AFM/TEM techniques have been utilized for complete characterization of CL-20-based... 

    Dependability evaluation of Altera FPGA-based embedded systems subjected to SEUs

    , Article Microelectronics Reliability ; Volume 47, Issue 2-3 , 2007 , Pages 461-470 ; 00262714 (ISSN) Zarandi, H. R ; Miremadi, S. G ; Sharif University of Technology
    2007
    Abstract
    Dependability evaluation of embedded systems due to the integration of hardware and software parts is difficult to analyze. In this paper, we have proposed an experimental method to determine sensitivity to soft errors in an embedded system exploiting Altera SRAM-based FPGAs. The evaluation is performed using both the hardware and software parts of the embedded system in a single framework. To do this, the HDL hardware model of the target system as well as the C-written software codes of the target system, are required. Both permanent and transient faults are injected into the partially- or fully-synthesizable hardware of the target system and this can be performed during the design cycle of... 

    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... 

    A SEU-protected cache memory-based on variable associativity of sets

    , Article Reliability Engineering and System Safety ; Volume 92, Issue 11 , 2007 , Pages 1584-1596 ; 09518320 (ISSN) Zarandi, H. R ; Miremadi, S. G ; Sharif University of Technology
    2007
    Abstract
    SRAM cache memories suffer from single event upset (SEU) faults induced by energetic particles such as neutron and alpha particles. To protect these caches, designers often use error detection and correction codes, which typically provide single-bit error detection and even correction. However, these codes have low error detection capability or incur significant performance penalties. In this paper, a protected cache scheme based on the variable associativity of sets is presented. In this scheme, cache space is divided into sets of different sizes with variable tag field lengths. The other remained bits of tags are used for protecting the tag using a new protection code. This leads to... 

    Hierarchical binary set partitioning in cache memories

    , Article Journal of Supercomputing ; Volume 31, Issue 2 , 2005 , Pages 185-202 ; 09208542 (ISSN) Zarandi, H. R ; Sarbazi Azad, H ; Sharif University of Technology
    2005
    Abstract
    In this paper, a new cache placement scheme is proposed to achieve higher hit ratios with respect to the two conventional schemes namely set-associative and direct mapping. Similar to set-associative, in this scheme, cache space is divided into sets of different sizes. Hence, the length of tag fields associated to each set is also variable and depends on the partition it is in. The proposed mapping function has been simulated with some standard trace files and statistics are gathered and analyzed for different cache configurations. The results reveal that the proposed scheme exhibits a higher hit ratio compared to the two well-known mapping schemes, namely set-associative and direct mapping,... 

    Soft error mitigation in cache memories of embedded systems by means of a protected scheme

    , Article 2nd Latin-American Symposium on Dependable Computing, LADC 2005, Salvador, 25 October 2005 through 28 October 2005 ; Volume 3747 LNCS , 2005 , Pages 121-130 ; 03029743 (ISSN); 3540295720 (ISBN); 9783540295723 (ISBN) Zarandi, H. R ; Miremadi, S. G ; Sharif University of Technology
    2005
    Abstract
    The size and speed of SRAM caches of embedded systems are increasing in response to demands for higher performance. However, the SRAM caches are vulnerable to soft errors originated from energetic nuclear particles or electrical sources. This paper proposes a new protected cache scheme, which provides high performance as well as high fault detection coverage. In this scheme, the cache space is divided into sets of different sizes. Here, the length of tag fields associated to each set is unique and is different from the other sets. The other remained bits of tags are used for protecting the tag using a fault detection scheme e.g., generalized parity. This leads to protect the cache without... 

    Fault tree analysis of embedded systems using SystemC

    , Article Annual Reliability and Maintainability Symposium, 2005 Proceedings: The International Symposium on Product Quality and Integrity, Alexandria, VA, 24 January 2005 through 27 January 2005 ; 2005 , Pages 77-81 ; 0149144X (ISSN) Zarandi, H. R ; Miremadi, S. G ; Sharif University of Technology
    2005
    Abstract
    System fault-tree analysis is a technique for modeling dependability that is in widespread use. For systems such as embedded systems that include both hardware and software, the integration of hardware and software fault trees has proved problematic. In this paper, we present a method for reliability and safety analysis of embedded systems modeled by SystemC language. The evaluation is based on the fault trees generated from both hardware and software parts of the embedded systems described in the unified language. The unified modeling of both hardware and software of embedded systems using SystemC enables designers to be early aware from the safety and reliability of their designs more... 

    A highly fault detectable cache architecture for dependable computing

    , Article Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) ; Volume 3219 , 2004 , Pages 45-59 ; 03029743 (ISSN); 3540231765 (ISBN); 9783540231769 (ISBN) Zarandi, H. R ; Miremadi, S. G ; Sharif University of Technology
    Springer Verlag  2004
    Abstract
    Information integrity in cache memories is a fundamental requirement for dependable computing. As caches comprise much of a CPU chip area and transistor counts, they are reasonable targets for single and multiple transient faults. This paper presents: 1) a fault detection scheme for tag arrays of cache memories and 2) an architectural cache to improve dependability as well as performance. In this architecture, cache space is divided into sets of different sizes and different tag lengths. The error detection scheme and the cache architecture have been evaluated using a trace driven simulation with soft error injection and SPEC 2000 applications. The results show that error detection... 

    Weighted TINs Smplification and Design of Some Algorithms on it

    , M.Sc. Thesis Sharif University of Technology Dabaghi Zarandi, Fahimeh (Author) ; Ghodsi, Mohammad (Supervisor)
    Abstract
    Due to increasing quality of satellite images, volume of stored data significantly increased, so speed of statistical and computational processing decreased. For solving this problem, simplification
    problem has been suggested. Surface simplification problem is a fundamental problem in computational geometry and it has many applications in other fields such as GIS, computer graphics, and image processing. Major goal of simplification problems is reducing stored information in any surface, Because it improves speed of processes. One of common types in this field is 3D terrain simplification while error of simplified surface be acceptable. Simplification is NP-Hard problem. In this project,... 

    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
    2017
    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... 

    Scaling of counter-current imbibition recovery curves using artificial neural networks

    , Article Journal of Geophysics and Engineering ; Volume 15, Issue 3 , 2018 , Pages 1062-1070 ; 17422132 (ISSN) Jafari, I ; Masihi, M ; Nasiri Zarandi, M ; Sharif University of Technology
    Institute of Physics Publishing  2018
    Abstract
    Scaling imbibition curves are of great importance in the characterization and simulation of oil production from naturally fractured reservoirs. Different parameters such as matrix porosity and permeability, oil and water viscosities, matrix dimensions, and oil/water interfacial tensions have an effective on the imbibition process. Studies on the scaling imbibition curves along with the consideration of different assumptions have resulted in various scaling equations. In this work, using an artificial neural network (ANN) method, a novel technique is presented for scaling imbibition recovery curves, which can be used for scaling the experimental and field-scale imbibition cases. The... 

    On Comparison of Architecture-level Dependability Approaches for Multicore Processors in Mixed-critical Embedded Applications

    , M.Sc. Thesis Sharif University of Technology Dabaghi Zarandi, Arezoo (Author) ; Miremadi, Ghasem (Supervisor)
    Abstract
    Nowdays, embedded systems need high dependability and performance and low cost. Use of multicore processors cause increase performance, and can lead to increase dependability with its inherent redundancy. Also mixed critical leads to decrease cost and increase dependability, because designer just considers dependability techniques for high critical tasks. A lot of work to increase dependability of real-time multicore systems with mixed-criticality has been done. In this study, a comprehensive classification of the approaches that has been done in this area is provided. One of the issues that is expressed in muticore, is shared resources. In multicore platforms some resources like memory and... 

    Power-aware branch target prediction using a new BTB architecture

    , Article Proceedings - 17th IFIP International Conference on Very Large Scale Integration, VLSI-SoC 2009 ; 2011 , p. 53-58 ; ISBN: 9781457702365 Sadeghi, H ; Sarbazi-Azad, H ; Zarandi, H. R ; Sharif University of Technology
    2011
    Abstract
    This paper presents two effective methods to reduce power consumption of branch target buffer (BTB): 1) the first method is based on storing distance to next branch address in tag array instead of storing whole branch address, 2) the second method is to use a new field in data array of BTB namely Next Branch Distance (NBD) which holds distance of next branch address from current branch address. When a new hit is performed in BTB, based on NBD field, there would be no access through NBD number of instructions, so BTB can be shutdown not to consume power. The new architecture does not impose extra delay and reduction in prediction accuracy. Both methods were implemented and simulated using... 

    Power-aware branch target prediction using a new BTB architecture

    , Article Proceedings - 17th IFIP International Conference on Very Large Scale Integration, VLSI-SoC 2009, 12 October 2009 through 14 October 2009 ; October , 2011 , Pages 53-58 ; 9781457702365 (ISBN) Sadeghi, H ; Sarbazi Azad, H ; Zarandi, H. R ; Sharif University of Technology
    2011
    Abstract
    This paper presents two effective methods to reduce power consumption of branch target buffer (BTB): 1) the first method is based on storing distance to next branch address in tag array instead of storing whole branch address, 2) the second method is to use a new field in data array of BTB namely Next Branch Distance (NBD) which holds distance of next branch address from current branch address. When a new hit is performed in BTB, based on NBD field, there would be no access through NBD number of instructions, so BTB can be shutdown not to consume power. The new architecture does not impose extra delay and reduction in prediction accuracy. Both methods were implemented and simulated using... 

    Fault injection into verilog models for dependability evaluation of digital systems

    , Article Proceedings - 2nd International Symposium on Parallel and Distributed Computing, ISPDC 2003, 13 October 2003 through 14 October 2003 ; October , 2015 , Pages 281-287 ; 0769520693 (ISBN) ; 9780769520698 (ISBN) Zarandi, H. R ; Miremadi, S. G ; Ejlali, A ; Sharif University of Technology
    Institute of Electrical and Electronics Engineers Inc  2015
    Abstract
    This paper presents transient and permanent fault injection into Verilog models of digital systems during the design phase by a developed simulation-based fault injection tool called INJECT. With this fault injection tool, it is possible to inject crucial fault models in all abstraction levels (such as swith-level) supported by Verilog HDL. Several fault models for injecting into Verilog models are specified and described. Analyzing the results obtained from the fault injections, using INJECT enables system designers to inform from dependable parameters, such as fault latency, propagation and coverage. As a case study, a 32-bit processor, namely DP32, has been evaluated and effects of faults...