PRISM :: Browsing by Author "Behjat, Laleh"

Browsing by Author "Behjat, Laleh"

Now showing 1 - 20 of 59

Open Access
A Comprehensive Capacity Expansion Planning Model for Highly Renewable Integrated Power Systems
(2023-05-12) Parvini, Zohreh; Behjat, Laleh; Fapojuwo, Abraham; Moshirpour, Mohammad
Due to the depletion of conventional energy and environmental concerns, the trend toward increasing integration of renewable energy resources brings new challenges to power system planning and operation. The fluctuation of renewable energy resources is the main concern of system planners for their efficient deployment. Incorporating a more precise and detailed model of system constraints is inevitable to deal with these resources' intermittent and volatile nature. However, due to the various aspects and computation complexity of the capacity expansion problem, it is vital to have a thorough understanding of the most affecting constraints on the system planning. The unique characteristics of power systems, along with the integration of renewable energy resources and modern technologies such as energy storage, require developing a profound model for planning future infrastructure based on the available data. The primary objective of this research is to investigate and evaluate various aspects of power systems and develop a comprehensive capacity expansion model utilizing linear optimization techniques. The thesis includes the development of a data set for long-term planning purposes, a co-optimization expansion planning (CEP) model for identifying optimal transmission and generation expansion, modeling of storage technology and reserves, and reducing the network size to ensure model tractability. The framework was designed to facilitate the seamless integration of renewable energy sources and improve the performance of the whole power system, ensuring a smooth transition towards a high-renewable energy future. This tool intends to provide system planners and stakeholders in the generation and transmission sectors insights into future realizations of high-renewable power systems. The model can also be used as a benchmark for future planning studies and adjusted for any possible future assumptions.
Open Access
A Computer-Aided Design Assistant Tool for Elementary Linear Circuit Topologies
(2012-12-06) Shahhosseini, Delaram; Belostotski, Leonid; Behjat, Laleh
In this thesis, a CAD tool called analog design assistant (ADA), is developed to help analog circuit designers find new circuit topologies. First, a methodology to automatically generate all analog circuit topologies containing two or three transistors is developed. For each topology, circuit characteristics, such as DC voltage gain, are calculated. The DC voltage gain of each generated circuit is maximized by formulating and solving an optimization problem. After solving the optimization problem, it is shown that over 5,000 out of 56,000 circuits can achieve a DC voltage gain higher than 1. All generated circuit topologies and corresponding characteristics are stored in a database. A GUI is developed to help analog circuit designers search the database and find new topologies. In order to demonstrate the capability of ADA in generating new topologies, a previously unknown high-gain amplifier is selected, and designed in a 0.13-um standard CMOS technology.
Open Access
A fast, congestion based concurrent global routing technique
(2006) Chiang, Andy; Behjat, Laleh
Open Access
A Machine Learning Predictor and Corrector Framework to Identify and Resolve VLSI Routing Short Violations
(2018-10-24) Fakheri Tabrizi, Aysa; Behjat, Laleh; Rakai, Logan M.; Yanushkevich, Svetlana N.; Dimitrov, Vassil
The growth of Very Large Scale Integration (VLSI) technology provokes new challenges in design automation of Integrated Circuits (ICs). Routability is one of the most challenging aspects in Electronic Design Automation (EDA) that is faced in two consecutive phases of physical design: placement and routing. During placement, the exact locations of circuit components are determined. During routing the paths for all of the wires are specified. Routing is performed in two stages: global routing and detailed routing. Many of the violations that occur during the detailed routing stage stem from ignoring the routing rules during placement. Therefore, detecting and preventing routing violations in the placement stage has become critical in reducing the design time and the possibility of failure. In this thesis, Eh?Predictor, a deep learning framework to predict detailed routing short violations during placement is proposed. In the development of this predictor, relevant features, contributing to routing violations, were identified, extracted, and analyzed. A neural network model that can handle imbalanced data was customized to detect these violations using the defined features. The proposed predictor can be integrated into a placement tool and be used as a guide during the placement process to reduce the number of shorts happening in the detailed routing stage. One of the advantages of this technique is that by using the proposed deep learning-based predictor, global routing is no longer required as frequently. Hence the total runtime for place and route can be significantly reduced. In addition to Eh?Predictor, a detailed routing-aware detailed placement algorithm is developed to improve detailed routability in a relatively short runtime. The proposed technique is referred to as Detailed Routing-aware Detailed Placer (DrDp). DrDp is a heuristic that aims to reduce the local congestion and mitigate routing failure by aligning the connected cells where possible at the final stage of detailed placement process. Experimental results show that Eh?Predictor is able to predict on average 90% of the short violations of previously unseen data with only 5% false alarm rate and considerably reduce computational time, and DrDp can effectively improve the detailed routing quality in a short runtime with no significant change in detailed placement score or total wirelength.
Open Access
A Multilevel Congestion-Based Global Router
(2009-11-17) Rakai, Logan; Behjat, Laleh; Areibi, Shawki; Terlaky, Tamas
Routing in nanometer nodes creates an elevated level of importance for low-congestion routing. At the same time, advances in mathematical programming have increased the power to solve complex problems, such as the routing problem. Hence, new routing methods need to be developed that can combine advanced mathematical programming and modeling techniques to provide low-congestion solutions. In this paper, a hierarchical mathematical programming-based global routing technique that considers congestion is proposed. The main contributions presented in this paper include (i) implementation of congestion estimation based on actual routing solutions versus purely probabilistic techniques, (ii) development of a congestion-based hierarchy for solving the global routing problem, and (iii) generation of a robust framework for solving the routing problem using mathematical programming techniques. Experimental results illustrate that the proposed global router is capable of reducing congestion and overflow by as much as 36% compared to the state-of-the-art mathematical programming models.
Open Access
A Net Present Cost Minimization Framework for Wireless Sensor Networks
(2016) Dorling, Kevin; Messier, Geoffrey; Magierowski, Sebastian; Messier, Geoffrey; Magierowski, Sebastian; Karl, Holger; Ghaderi, Majid; Sesay, Abu-Bakarr; Behjat, Laleh
Minimizing the cost of deploying and operating a wireless sensor network (WSN) involves deciding how to partition a budget between competing expenses such as node hardware, energy, and labour. To determine if funds are given to a specific project or invested elsewhere, companies often use interest rates to sum the project's cash flows in terms of present-day dollars. This provides an incentive to defer expenditures when possible and use the returns to reduce future costs. In this thesis, a framework is proposed for minimizing the net present cost (NPC) of a WSN by optimizing the number of, cost of, and time between expenditures. The proposed framework balances competing expenses and defers expenditures when possible. A similar strategy does not appear to be available in the literature, and has likely not been developed in industry as no commercial WSN operators currently exist. In general, NPC minimization is a non-linear, non-convex optimization problem. However, if the time until the next expenditure is linearly proportional to the cost of the current expenditure, and the number of maintenance cycles is known in advance, the problem becomes convex and can be solved to global optimality. If non-deferrable recurring costs are low, then evenly spacing the expenditures can provide near-optimal results. The NPC minimization framework is most effective when non-deferrable recurring costs, such as labour, are low. High labour costs limit the number of times that a WSN operator can use the returns from investing deferrable costs to decrease future expenditures. This thesis therefore proposes vehicle routing problems (VRPs) to reduce labour costs by delivering nodes with drones. Unlike similar VRPs, drone costs are reduced by reusing vehicles, and low-cost, feasible routes are ensured by modelling energy consumption as a function of drone battery and payload weight. The problems are modelled as mixed integer linear programs (MILPs). As these MILPs are NP-hard, simulated annealing algorithms are proposed for finding sub-optimal solutions to large instances of the problems.
Open Access
A Pre-Placement Individual Net Length Estimation Model and an Application for Modern Circuits
(2011) Farshidi, Amin; Behjat, Laleh; Westwick, David
Open Access
A pre-placement net length estimation technique for mixed-size circuits and a feedback framework for clustering
(2009) Fathi, Bahareh; Behjat, Laleh
Open Access
A Visual Tool for Comparing the Life Cycles of Major Energy Sources in Alberta
(2017) Karbalaei, Amir Hassan; Behjat, Laleh; Gates, Ian; Nowicki, Edwin; Moshirpour, Mohammad; Bergerson, Joule
Air pollution has become one of the major challenges, with which humanity continues to struggle in modern times. The never-ending demand for energy has increased the production and consumption of different types of energy resources. A major part of the energy demand is met through the use of fossil fuels, which is one of the main sources of air pollution. In this thesis, a simple Life Cycle Assessment (LCA) model was created to represent the Greenhouse Gas (GHG) pollution of coal, natural gas and oil sands in Alberta. The model was complemented by developing a user-friendly and interactive visualization tool: The Greener Alberta, using recent software development techniques. The visualization tool enables the general public, especially younger generations, to learn about the industry procedures and to compare GHG emission rates of each energy resource. Finally, research surveys were conducted to verify the effectiveness of the Greener Alberta.
Open Access
Advanced Methods for Efficient Digital Signal Processing and Matrix-Based Computations
(2018-04-12) Gomes Coelho, Diego Felipe; Dimitrov, Vassil S.; Behjat, Laleh; Walus, Konrad; Yanushkevich, Svetlana N.; Jacobson, Michael J.
Modern engineering and scientific problems demand a great amount of data processing power. The type of data that needs to be processed varies from application to application. Image processing, genome matching, physics phenomena simulation, and cryptography are a few examples of processing-power demanding applications. In a wide range of those computationally intensive applications, the arithmetic complexity plays an important role, having direct impact on the implementation performance. In this thesis, we present several methods that are novel contributions of the author to some computationally intensive problems. The introduced methods reduce the overall computing time or other relevant hardware’ and software implementation metrics by decreasing the arithmetic complexity associated with each task. Verified results are shown with peer-reviewed journal papers in reputable journals. In particular, problems on signal processing, eigenvalue computation, and matrix inversion for radar image classification are considered.
Open Access
Approaches to the Calibration of Single-Cell Cardiac Models Based on Determinants of Multi-Cellular Electrical Interactions
(2021-03-17) Pouranbarani, Elnaz; Nygren, Anders; Rose, Robert; Behjat, Laleh; Di Martino, Elena; Dubljevic, Stevan
Cardiac single-cell models are often used as building blocks for tissue simulation. Cellular models can successfully reproduce the expected behaviour at the tissue scale, providing that a single cell is accurately modeled. One of the imprecisions of conventional cellular modeling, evident mainly when the models are used at the tissue level, stems from only considering some cellular properties (e.g., action potential (AP) shape) and ignoring properties that reflect interconnections of the cells in the calibration/optimization process. This can result in inaccurate modeling of intercellular electrical communications. Computational models are used in a well-known Safety Pharmacology paradigm (i.e., the Comprehensive in Vitro Proarrhythmia Assay), the goal of which is to evaluate drug effects on the occurrence of proarrhythmia. So, accurate characterization of cellular models’ properties is of great importance. In this thesis, a cellular multi-objective optimization framework is proposed to consider the fitness of membrane resistance (Rm) (i.e., an indicator of cellular interconnection) in addition to AP as an additional optimization objective. As Rm depends on the transmembrane voltage (Vm) and exhibits singularities for some specific values of Vm, analyses are conducted to carefully select the regions of interest for the proper characterization of Rm. To verify the efficacy of the proposed problem formulation, case studies and comparisons are carried out using human cardiac ventricular models. Afterward, the performance of the framework proposed in the previous step is analyzed at the tissue-level using various tissue configurations: source-sink configuration, Purkinje-myocardium configuration, and transmural APD heterogeneity configuration. The comprehensive statistical analyses suggest that considering Rm in the calibration procedure results in a significant reduction of errors in cardiac tissue simulations. In the subsequent step, due to the variations among tissue simulations, it is proposed to include more essential properties to constrain the calibration problem. To achieve this, a machine learning-based approach is presented. The numerical results show that the proposed method efficiently estimates the base model’s parameters. Therefore, using a calibrated model as building blocks of tissue simulation yields accurate replication of reference behaviour at the tissue scale.
Open Access
Automated Software Testing of Deep Neural Network Programs
(2020-09-23) Vahdat Pour, Maryam; Hemmati, Hadi; Behjat, Laleh; Far, Behrouz Homayoun
Machine Learning (ML) models play an essential role in various applications. Specifically, in recent years, Deep neural networks (DNN) are leveraged in a wide range of application domains. Given such growing applications, DNN models' faults can raise concerns about its trustworthiness and may cause substantial losses. Therefore, detecting erroneous behaviours in any machine learning system, specially DNNs is critical. Software testing is a widely used mechanism to detect faults. However, since the exact output of most DNN models is not known for a given input data, traditional software testing techniques cannot be directly applied. In the last few years, several papers have proposed testing techniques and adequacy criteria for testing DNNs. This thesis studies three types of DNN testing techniques, using text and image input data. In the first technique, I use Multi Implementation Testing (MIT) to generate a test oracle for finding faulty DNN models. In the second experiment, I compare the best adequacy metrics from the coverage-based criteria (Surprise Adequacy) and the best example from mutation-based criteria (DeepMutation) in terms of their effectiveness for detecting adversarial examples. Finally, in the last experiment, I applied three different test generation techniques (including a novel technique) to the DNN models and compared their performance if the generated test data are used to re-train the models. The first experiment results indicate that using MIT as a test oracle can successfully detect the faulty programs. In the second study, the results indicate that although the mutation-based metric can show better performance in some experiments, it is sensitive to its parameters and requires hyper-parameter tuning. Finally, the last experiment shows a 17% improvement in terms of F1-score, when using the proposed approach in this thesis compared to the original models from the literature.
Open Access
Behavioral Mapping by Using NLP to Predict Individual Behaviors
(2022-11-16) Jafari, Reyhaneh; H. Far, Behrouz; Behjat, Laleh; Moussavi, Mahmood
"What candidates or team members will do in specific circumstances" has always been an important piece of information for most employees or team leaders to consider when making a decision. It takes a significant amount of time to determine who is the best candidate for a particular job position. Companies are looking for the most efficient method for making this decision. Most of the time, personality assessments are used to identify an individual’s character traits. Regardless of personality type, individuals will behave differently in a positive atmosphere than in a stressful one. Hence, characteristics alone can not predict behavior. Thus, text analysis and the identification of candidate behaviors (behaviorism) now enable companies to understand how people think, feel, and act in a given situation and then choose from a vast pool of candidates the best candidate for the job. By leveraging the existing intellectual property data associated with the behavioral mapping in AccuMatch Behavior Intelligence as well as expert data and using tools such as Amazon Comprehend Service (ACS), IBM Watson Natural Language Understanding (NLU), and Machine Learning (ML) techniques, various methods have been developed and analyzed in order to predict how individuals in a team become motivated, what their individual decision reference is, and what their execution style is. Therefore, this dissertation presents multiple proposed methods to predict Towards/Away, Internal/External, and Option/Procedure behavior and discusses the rationale behind the selection of these methods along with the results obtained.
Open Access
Clustering techniques for circuit partitioning and placement problems
(2007) Li, Jianhua; Behjat, Laleh; Jullien, Graham
Open Access
Decoupling Methods for the Identification of Polynomial Nonlinear Autoregressive Exogenous Input Models
(2020-08) Karami, Kiana; Westwick, David T.; Behjat, Laleh; Nielsen, Jorgen; Norwicki, Edwin Peter; Bai, Erwei
Developing a mathematical model of the system to be controlled is a significant part of a control design process, the more accurate the model, the more precise the control design can be. Since most of the systems around us behave nonlinearly, linear models are not always adequate. Therefore, nonlinear models should be considered. Many different model structures have been used in the literature such as the Volterra series, block-structured models, state-space representations, or nonlinear input-output models. Each of these structures has the ability to represent a large class of nonlinear systems but with its own drawbacks. Many are black-box modeling approaches and do not provide any intuition regarding the system. Many also suffer from the curse of dimensionality, becoming overly complex as the severity of the nonlinearity increases. It would be more practical if a nonlinear system can be approximated by a simpler model that is more accessible and understandable. During this research, the focus was on one of the widely used nonlinear input-output models known as the polynomial Nonlinear Autoregressive eXogenous input (NARX) model, as it represents a large class of nonlinear systems. A decoupling approach is proposed for polynomial NARX models. This technique replaces the multivariate polynomial that characterizes the NARX model with a decoupled model comprising a mixing matrix followed by a bank of univariate polynomials and a summation. While the proposed decoupling algorithm reduces the number of parameters significantly, performing the decoupling involves solving a non-convex optimization, which must be solved iteratively. Different initialization techniques are proposed for this optimization. In addition, identification algorithms are developed in both prediction error and simulation error minimization frameworks. The results of the decoupling approach are verified on two nonlinear identification benchmark problems and show promising outcomes since the number of parameters decreases significantly while the model accuracy remains high. Also, the decoupled model is capable of providing some insight into the identified model, as it is no longer a black-box.
Open Access
Degree-based clustering for placement in vlsi physical design
(2008) Huang, Jie; Behjat, Laleh
Open Access
Development and Evaluation of a Framework for Mentor-Based Engineering Outreach
(2022-07-25) Dornian, Katherine; Behjat, Laleh; Moshirpour, Mohammad; Sengupta, Pratim; Jazayeri, Pouyan
Diversity in engineering teams and organizations is needed to solve the complex challenges the world is facing. However, the number of people from historically underrepresented groups—such as women, Indigenous, Black, and Hispanic engineers—falls short of parity with the population [1-4].Mentoring programs successfully improve interest in engineering and perceptions of the field for people in the groups mentioned above [5-8]. Mentor-based outreach is a growing practice that attracts these historically excluded people to study engineering. While frameworks exist for implementing outreach and mentoring programs, there is not yet a framework that informs mentor-based engineering outreach. A solid framework is needed to improve practices and outcomes. In this thesis, I use in-depth analysis of a local mentor-based engineering outreach initiative and review twenty-four external programs to develop a framework for mentor-based engineering outreach. The final framework includes six critical dimensions and eight components to inform design, implementation, and evaluation of programs. This research also shows how structuring mentor-based outreach around technical skill development and relationships encourages positive social and personal development outcomes, such as increasing student interest in engineering. Ultimately, this work provides practitioners and organizations with direction for improving diversity within outreach programs.
Open Access
Development of a CDIO Framework for Teacher Training in Computational Thinking
(2017) Hladik, Stephanie; Behjat, Laleh; Nygren, Anders; Moshirpour, Mohammad; Hugo, Ron; Haque, Anis
Studies have shown that though there is a recent push to include computational thinking and coding in elementary schools, many elementary school teachers have no background in the subject and would require training to effectively teach computational thinking to their students. In this thesis, the development of a framework to train elementary school teachers and students in computational thinking is presented. It is based on a framework for engineering education, and modifies that framework to design and implement creative, cross-curricular activities to teach computational thinking and engineering concepts for students in grades K-6. The activities are also used in a professional development workshop to train teachers in these skills. These activities have positive impacts on perceptions of computational thinking for both elementary school teachers and their students, as evaluated by surveys and interview responses. As well, teachers felt more confident in their ability to implement similar activities in their classrooms.
Open Access
Development of a CDIO-Based Creative Cross-Disciplinary Curriculum and Associated Projects for Elementary Engineering Education
(2013-09-23) Marasco, Emily Ann; Behjat, Laleh
This thesis presents the development of a creative, cross-curricular project series using the CDIO framework for engineering education to integrate engineering concepts and the Canadian Engineering Accreditation Board graduate attributes. The work in this thesis was targeted towards fifth grade students and their teachers, adapting the CDIO process to create an electrical engineering curriculum appropriate for elementary school, called Exploring Electrical Engineering. As studies show that students begin to lose interest in the domains of science, technology, mathematics and engineering during grades 4/5/6, this work also demonstrates how creative, hands-on projects and positive role models improve the perceptions that grade five students have towards engineering, and towards their consideration of engineering as a future career path. Through these contributions, the creative, cross-curricular CDIO-based Exploring Electrical Engineering program is demonstrated to have positive effects on young students while introducing them to engineering concepts and attributes.
Open Access
Development of an Accurate Clock Delay Model with Application in Clock Network Buffer Sizing
(2019-08-09) Farshidi, Ali; Behjat, Laleh; Rakai, Logan M.; Dimitrov, Vassil; Yanushkevich, Svetlana N.
Clock network synthesis is an important stage of the Integrated Circuit (IC) design cycle. The performance of the IC highly depends on the clock network synthesis which makes this stage critical where accuracy is very important. In this thesis, a new delay model is proposed for clock networks that is capable of estimating clock signal delay with significantly improved accuracy in a relatively low runtime. This model is developed using Least square fitting by employing data oriented training. The developed model is formulated in the form of posynomials which makes it a suitable option for application in geometric programming gate and clock network sizing optimization frameworks. The experimental results demonstrate the effectiveness of the proposed delay model in predicting the delay at the timing critical clock sinks in the clock network, i.e. sinks with minimum and maximum delays, and the estimated values are, on average, 20 ps closer than the Elmore values to the reference circuit simulator tool, ngspice. This is while the runtime of the proposed delay model is negligible compared to the ngspice simulations. This helps designers obtain accurate delay estimations in low runtime for quick optimization iterations. In addition, a clock network buffer sizing approach is developed which includes an objective function with geometric programming format considering two competing objectives, power consumption and clock skew. The clock slew and technology constraints are also integrated into this optimization problem. The clock network buffer sizing experiments show significant improvements compared to the initial clock networks in terms of clock skew, up to 183 ps, while the power consumption improves for all test cases, on average by 54%.