Loading...
Search for:
mirmohammadi--hamid
0.126 seconds
Total 911 records
A polynomial time branch and bound algorithm for the single item economic lot sizing problem with all units discount and resale [electronic resource]
, Article International Journal of Optimization in Civil Engineering ; 2012, 2(2): 183-202 ; Shadrokh, Sh ; Eshghi, Kourosh ; Sharif University of Technology
Abstract
The purpose of this paper is to present a polynomial time algorithm which determines the lot sizes for purchase component in Material Requirement Planning (MRP) environments with deterministic time-phased demand with zero lead time. In this model, backlog is not permitted, the unit purchasing price is based on the all-units discount system and resale of the excess units is possible at the ordering time. The properties of an optimal order policy are argued and on the basis of them, a branch and bound algorithm is presented to construct an optimal sequence of order policies. In the proposed B&B algorithm, some useful fathoming rules have been proven to make the algorithm very efficient. By...
Material Ordering in a Deterministic Time-Phased Demand Environment with All-Units Discount in Purchasing
, Ph.D. Dissertation Sharif University of Technology ; Shadrokh, Shahram (Supervisor)
Abstract
More than 60% of sales account for materials, and so the roles and responsibilities of the material managers have been recognized as more important within a firm or in a large scale project than before. However, in many purchasing situations, different considerations conflict with one another. In these situations material planning plays an essential role in the total cost minimization process. Here, the optimal material ordering policy for an item in a deterministic time-phased demand environment with all-units discount in purchasing is considered. Based on proven properties of the optimal order policy, a tree search procedure is designed to construct sequences of orders in the optimal...
A hybrid polynomial-time algorithm for the dynamic quantity discount lot size model with resale
, Article Computers and Operations Research ; Volume 39, Issue 7 , 2012 , Pages 1771-1778 ; 03050548 (ISSN) ; Eshghi, K ; Sharif University of Technology
2012
Abstract
We propose an efficient optimal algorithm for determining the lot sizes for purchase component in Material Requirement Planning (MRP) environments with deterministic time-phased demand and zero lead time. In this model, backlog is not permitted, the unit purchasing price is based on the all-units discount system with single price break point and resale of the excess units is acceptable at the ordering time. The problem is divided into the sub-plans with specific properties by the dynamic programming (DP) method already presented. By modifying the main structure of the DP method, we present a branch-and-bound algorithm to obtain the optimal ordering policy for each sub-plans. Furthermore, we...
A branch and bound algorithm for the dynamic quantity discount lot size problem with resale
, Article 38th International Conference on Computers and Industrial Engineering 2008, Beijing, 31 October 2008 through 2 November 2008 ; Volume 1 , 2008 , Pages 3-11 ; 9781627486828 (ISBN) ; Shadrokh, S ; Sharif University of Technology
2008
Abstract
This paper presents an optimal algorithm based on Branch and Bound approach for determining lot sizes for purchased component in Material Requirement Planning (MRP) environments with deterministic time-phased demand and constant ordering cost with zero lead time. Backlog is not permitted and the unit purchasing price depends on the quantity of an order and resale of the excess is possible at the ordering time. We assume an all-units discount system with single price break point. Based on proven properties of an optimal order policy, a tree search procedure is designed to construct the sequences of orders and resales amount in optimal order policy. Some useful fathom rules have been proven to...
A branch and bound algorithm for the dynamic quantity discount lot sizing
, Article 38th International Conference on Computers and Industrial Engineering 2008 ; Volume 3 , 2008 , Pages 2996-3005 ; 9781627486828 (ISBN) ; Shadrokh, S ; Sharif University of Technology
2008
Abstract
This paper presents an optimal algorithm based on Branch and Bound approach for determining lot sizes for purchased component in Material Requirement Planning (MRP) environments with deterministic dynamic demand pattern and constant ordering cost with zero lead time, where all units discounts are available from vendors and shortage is not allowed. Based on the properties of an optimal order policy proven in the literature, a tree search procedure is designed to construct sequences of orders in the optimal policy. Some useful fathom rules have been proven to make the algorithm very efficient. Copyright©(2008) by Computers & Industrial Engineering
An efficient optimal algorithm for the quantity discount problem in material requirement planning
, Article Computers and Operations Research ; Volume 36, Issue 6 , 2009 , Pages 1780-1788 ; 03050548 (ISSN) ; Shadrokh, S ; Kianfar, F ; Sharif University of Technology
2009
Abstract
An optimal algorithm based on branch-and-bound approach is presented in this paper to determine lot sizes for a single item in material requirement planning environments with deterministic time-phased demand and constant ordering cost with zero lead time, where all-units discounts are available from vendors and backlog is not permitted. On the basis of the proven properties of optimal order policy, a tree-search procedure is presented to construct the sequence of optimal orders. Some useful fathom rules have been proven, which make the algorithm very efficient. To compare the performance of this algorithm with the other existing optimal algorithms, an experimental design with various...
Triethylamine removal using biotrickling filter (BTF): effect of height and recirculation liquid rate on BTFs performance
, Article International Journal of Environmental Science and Technology ; Volume 14, Issue 8 , 2017 , Pages 1615-1624 ; 17351472 (ISSN) ; Sotoudeheian, S ; Bayat, R ; Sharif University of Technology
Center for Environmental and Energy Research and Studies
2017
Abstract
This study investigated the removal of triethylamine using a biotrickling filter. The influence of affecting parameters, such as height and recirculation liquid rate (VL) on contaminant removal efficiency, was examined in detail. The results demonstrated that in the constant empty bed residence time (EBRT), when VL was increased, the removal efficiency (RE) increased. Also, for a specific VL, increasing EBRT could also increase RE values. However, it seems that an increasing VL is a more cost-effective way to enhance RE as compared to an increasing EBRT. The obtained outcomes represented that for a constant EBRT, an increase in inlet loading (IL) could decrease RE. For lower ILs, the removal...
Effect of empty bed residence time on biotrickling filter performance: Case study-triethylamine
, Article International Journal of Environmental Science and Technology ; Vol. 11, issue. 1 , 2014 , pp. 183-190 ; ISSN: 17351472 ; Bayat, R ; Keshavarzi Shirazi, H ; Sotoudeheian, S ; Sharif University of Technology
2014
Abstract
In this study, a laboratory-scale biotrickling filter (BTF) is used to remove Triethylamine (TEA) from gaseous wastes. The BTF is made of stainless steel with a height of 210 cm and an internal diameter of 21 cm packed with lava rocks. TEA elimination pattern was evaluated by changing empty bed residence times (EBRTs). The maximum elimination capacity (EC) has been determined to be 87 g/m3/h. At all EBRTs 52, 31, 20, and 10 s, contaminant transferring from gas phase to liquid was more than the EC. Also, the removal efficiency was 100 % for a mass loading of 100 g/m3/h. While the liquid recirculation velocity of 3.466 m3/m2/h was maintained, the flow rate was adjusted to 60, 100, 156, and 312...
Reconstruction of 3D interaction models from images using shape prior
, Article Proceedings - 2023 IEEE/CVF International Conference on Computer Vision Workshops, ICCVW 2023 ; 2023 , Pages 2133-2139 ; 979-835030744-3 (ISBN) ; Saremi, P ; Kuo, Y. -L ; Wang, X ; Sharif University of Technology
Institute of Electrical and Electronics Engineers Inc
2023
Abstract
We investigate the reconstruction of 3D human-object interactions from images, encompassing 3D human shape and pose estimation as well as object shape and pose estimation. To address this task, we introduce an autoregressive transformer-based variational autoencoder capable of learning a robust shape prior from extensive 3D shape datasets. Additionally, we leverage the reconstructed 3D human body as supplementary features for object shape and pose estimation. In contrast, prior methods only predict object pose and rely on shape templates for shape prediction. Experimental findings on the BEHAVE dataset underscore the effectiveness of our proposed approach, achieving a 40.7cm Chamfer distance...
Optimizing Transmisson from Distant Wind Farms
, M.Sc. Thesis Sharif University of Technology ; Hosseini, Hamid (Supervisor)
Abstract
Wind power is site dependent and is by nature partially dispatchable. Furthermore, good wind sites are far from grid. Due to these problems, and along with the existing limitations in the transmission networks, a comprehensive analysis over an extended time is needed to properly explore all potential wind sites for wind capacity allocation. This problem is computationally expensive and decomposition methods are required to break down this problem. Here Benders decomposition approach is used, which is a popular technique for solving large-scale problems, to decompose the original problem into a master and a subproblem. The master problem is a linear problem, which allocates wind capacity to...
Identification of the Set of Single Nucleotide Variants in Genome Responsible for the Differentiation of Expression of Genes
, M.Sc. Thesis Sharif University of Technology ; Rabiee, Hamid Reza (Supervisor) ; Beigi, Hamid (Supervisor)
Abstract
Single nucleotide polymorphs, There are changes caused by a mutation in a nucleotide in the Dena sequence. Mononucleotide polymorphisms are the most common type of genetic variation. Some of these changes have little or no effect on cells, while others cause significant changes in the expression of cell genes that can lead to disease or resistance to certain diseases. Because of the importance of these changes and their effect on cell function, the relationships between these changes are also important. Over the past decade, thousands of single disease-related mononucleotide polymorphisms have been identified in genome-related studies. Studies in this field have shown that the expression of...
Synthesis & Characterization of Au-HKUST-1 Nanocomposite and Evaluation of Plasmonic Properties of Gold Nanoparticles in this Nanocomposite
, M.Sc. Thesis Sharif University of Technology ; Madaah Hosseini, Hamid Reza (Supervisor)
Abstract
In the past few years, many research works on the controllable integration of metal nanoparticles and metal-organic frameworks were done, since the obtained composite material shows a synergism effect in catalysis and photocatalysis, drug delivery applications, gas, and energy storage, as well as sensing. For the first time, in this study, we employed template-assisted growth to synthesize Au-HKUST-1 Nanocomposite. XRD analysis entirely confirms that employing this strategy in synthesizing Au-HKUST-1 was wholly successful, and the plasmonic properties of this nanostructure were studied via UV-visible spectroscopy. In the course of synthesis, gold nanoparticles with 70nm diameter were...
Synthesis of Magnetite (Fe3O4)-Avastin Nanocomposite as a Potential Drug for AMD Treatment
, M.Sc. Thesis Sharif University of Technology ; Maddah Hosseini, Hamid Reza (Supervisor) ; Delavary, Hamid (Co-Advisor)
Abstract
Age-related macular degeneration (AMD) is the most common cause of vision loss in those aged over 50. There are two main types of AMD, Wet and Dry form. Wet AMD is more severe though more treatable. There are three conventional treatments for AMD including laser therapy, surgery and intravitreal injection of anti-VEGF into the eye. Delivery of drugs to the posterior segment of the eye is still challenging and several implants and devices are currently under investigation for their ability to stimulate the retina, producing visual percepts. The application of intravitreal bevacizumab (Avastin) has expanded tremendously from the time of its introduction into ophthalmic care since 3 years ago....
Detection of Central Nodes in Social Networks
, Ph.D. Dissertation Sharif University of Technology ; Movaghar, Ali (Supervisor) ; Rabiee, Hamid Reza (Supervisor)
Abstract
In analyzing the structural organization of many real-world networks, identifying important nodes has been a fundamental problem. The network centrality concept deals with the assessment of the relative importance of network nodes based on specific criteria. Central nodes can play significant roles on the spread of influence and idea in social networks, the user activity in mobile phone networks, the contagion process in biological networks, and the bottlenecks in communication networks. High computational cost and the requirement of full knowledge about the network topology are the most significant obstacles for applying the general concept of network centrality to large real-world social...
Cost-Sensitive Classifiers and Their Applications
, M.Sc. Thesis Sharif University of Technology ; Beigy, Hamid (Supervisor)
Abstract
Decision making often has different effects and results with unequal importance. Most of classifiers try to minimize the rate of misclassified instances. These classifiers assume equal costs for different misclassification types. However, this assumption is not true in many real world problems and different misclassification types have different costs. These differences can be applied by introducing the cost in the process of learning. In this manner, total cost of misclassification will be the evaluation metric of classification. In order to apply this metric to the problems, new learning algorithms are needed. Cost-sensitive learning is the related area of machine learning which deals with...
Data Stream Classification in Presence of Concept Drift Using Ensemble Learning
, M.Sc. Thesis Sharif University of Technology ; Beigy, Hamid (Supervisor)
Abstract
Traditional classification techniques of machine learning assume that data have stationary distributions. This assumption for recent challenges where tremendous amount of data are generated at unprecedented rates with evolving patterns, is not true anymore. Classification of data streams has become an important area of machine learning, as the number of applications facing these challenges increases. Examples of such data streams applications include text streams, surveillance video streams, credit card fraud detection, market basket analysis, information filtering, computer security, etc. An appropriate method for such problems should adapt to drifting concepts by revising and refining the...
Using Transductive Learning Classification in Bioinformatics
, M.Sc. Thesis Sharif University of Technology ; Beigy, Hamid (Supervisor)
Abstract
Classification is one of the most important problems in machine learning area. Reliable and successful classification is essential for diagnosing patients for further treatment. In many applications such as bioinformatics unlabeled data is abundant and available. However labeling data is much more difficult and expensive to obtain. This dissertation presents a novel transductive approach for the development of robust microarray data classification. The transduction problem is to estimate the value of classification function at the given points in the working set. This contrasts with the standard inductive learning problem of estimating the classification method at all possible values and...
Concept Drift Detection in Data Streams Using Ensemble Classifiers
, M.Sc. Thesis Sharif University of Technology ; Beigy, Hamid (Supervisor)
Abstract
Concept drift is a challenging problem in the context of data stream processing. As a result of increasing applications of data streams, including network intrusion detection, weather forecasting, and detection of unconventional behavior in financial transactions; numerous studies have been conducted in the field of concept drift detection. In order to solve the problem of concept drift detection, an ideal method should be able to quickly and correctly identify a variety of changes, adapt quickly to new concepts, in the presence of limitations of memory and processing power. In this thesis, a new explicit concept drift detection method based on ensemble classifiers has been proposed for data...
Call Admission Control Schemes in WiMAX Networks
, M.Sc. Thesis Sharif University of Technology ; Beigy, Hamid (Supervisor)
Abstract
The rapid growth of broadband wireless access (BWA) has increased the demand of new application such as VoIP, video conferencing, online gaming each of which has different requirement for quality of service. Due to limited bandwidth provided for these networks, one of the most important issues is how effective we manage bandwidth in order to support requests. The quality of service is an important indicator of the effective management of bandwidth. Using mechanisms of call admission control is a commonly accepted method for balance between quality of service and increase of utilization resource in cellular mobile networks. In fact, ...
Multi-Label Text Classification
, M.Sc. Thesis Sharif University of Technology ; Beigy, Hamid (Supervisor)
Abstract
Nowadays, with the increasing size of data,it’s impossible to collect data and fast classification by human, and needs for an automated classification and data analysis, is more interested. Data classification is a process of giving the training data along with their class labels to the learning agent, which learns the relation between the instances and the labels. Then make a prediction to the label of the training data.In this thesis we will observe the classification of the multi-label data. Multi-label data have more than one label. In other words, each instance appears with a vector of labels.In this thesis, a method based on nearest neighbor is proposed to classify the multi-label...