David Raz
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
David Raz has a total of 20 co-authors. Here are the top co-authors by number of shared publications:
Benjamin Avi-Itzhak
Rutgers University
8 shared publicationsHanoch Levy
Tel-Aviv University
6 shared publications- Benjamin Avi-Itzhak
RUTCOR, Rutgers University, New Brunswick, NJ, USA
4 shared publications - Yuval Beck
Department of Physical Electronics, School of Electrical Engineering, Faculty of Engineering, Tel Aviv University, Tel-Aviv 69978, Israel
4 shared publications - Hanoch Levy
Computer Engineering and Networks Lab, ETH Zurich, Switzerland
3 shared publications - Hanoch Levy
School of Computer Science, Tel-Aviv University, Tel-Aviv, Israel
2 shared publications
Latest Publications
- 21 January 2022
- Published by Elsevier in International Journal of Electrical Power & Energy Systems
- Vol. 138
Fairness algorithm for emergency demand response operation in distribution networks
- 21 January 2022
- Published by Elsevier in International Journal of Electrical Power & Energy Systems
- Vol. 138
Fairness algorithm for emergency demand response operation in distribution networks
- Open Access
- 14 October 2021
- Published by Institution of Engineering and Technology (IET) in IET Generation, Transmission & Distribution
- Vol. 16 (1) , 71-83
State solutions for distribution systems and switching event using a neural network
Power flow calculations are an essential stage in many planning and control applications for distribution systems.To use these in control applications, however, the calculation time needs to be improved, and this can be done by the use of a trained ANN. This paper presents the considerations for constructing ANNs for DSs, and describes a method for training the system in order to support switching events representing a change in topology. The solutions for three DSs, balanced as well as unbalanced, are presented and the various considerations affecting the most appropriate ANN construction are discussed. The results are compared to the solution from the classical complex Newton‐Raphson and the fixed‐point iterative methods. The solutions have very high precision and good results are found for switched laterals. The computational performance is also compared and an improvement of two orders of magnitude is observed.
- 14 October 2021
- Published by Institution of Engineering and Technology (IET) in IET Generation, Transmission & Distribution
- Vol. 16 (1) , 71-83
Open AccessState solutions for distribution systems and switching event using a neural network
Power flow calculations are an essential stage in many planning and control applications for distribution systems.To use these in control applications, however, the calculation time needs to be improved, and this can be done by the use of a trained ANN. This paper presents the considerations for constructing ANNs for DSs, and describes a method for training the system in order to support switching events representing a change in topology. The solutions for three DSs, balanced as well as unbalanced, are presented and the various considerations affecting the most appropriate ANN construction are discussed. The results are compared to the solution from the classical complex Newton‐Raphson and the fixed‐point iterative methods. The solutions have very high precision and good results are found for switched laterals. The computational performance is also compared and an improvement of two orders of magnitude is observed.
- Open Access
- 26 May 2021
- Published by Association for Computing Machinery (ACM)
- p. 1-4
Success Factors of Distributed Software Development Projects in Israel
Geographically Distributed Development (GDD) has now become a prominent software development paradigm. Software companies are increasingly adopting geographically distributed development approaches to produce high quality software [1]. geographically distributed development ’s popularity has attracted some research, but research work related to global distributed software development performed in Israel is limited. This contrasts with the relatively large-scale distributed software development conducted in Israel or by Israeli companies. Therefore, this work aims at better understanding the success factors of geographically distributed development in Israel. The research is done using triangulation and comparison of success factors identified by the literature and the opinions of software development practitioners, experts, and managers in Israel. Our findings show that in addition to worldwide common geographically distributed development success factors, some success factors are unique to Israel.
- 26 May 2021
- Published by Association for Computing Machinery (ACM)
- p. 1-4
Open AccessSuccess Factors of Distributed Software Development Projects in Israel
Geographically Distributed Development (GDD) has now become a prominent software development paradigm. Software companies are increasingly adopting geographically distributed development approaches to produce high quality software [1]. geographically distributed development ’s popularity has attracted some research, but research work related to global distributed software development performed in Israel is limited. This contrasts with the relatively large-scale distributed software development conducted in Israel or by Israeli companies. Therefore, this work aims at better understanding the success factors of geographically distributed development in Israel. The research is done using triangulation and comparison of success factors identified by the literature and the opinions of software development practitioners, experts, and managers in Israel. Our findings show that in addition to worldwide common geographically distributed development success factors, some success factors are unique to Israel.
- Open Access
An Operational Approach to Multi-Objective Optimization for Volt-VAr Control
Recent research has enabled the integration of traditional Volt-VAr Control (VVC) resources, such as capacitor banks and transformer tap changers, with Distributed Energy Resources (DERs), such as photo-voltaic sources and energy storage, in order to achieve various Volt-VAr Optimization (VVO) targets, such as Conservation Voltage Reduction (CVR), minimizing VAr flow at the transformer, minimizing grid losses, minimizing asset operations and more. When more than one target function can be optimized, the question of multi-objective optimization is raised. In this work, a general formulation of the multi-objective Volt-VAr Optimization problem is proposed. The applicability of various multi-optimization techniques is considered and the operational interpretation of these solutions is discussed. The methods are demonstrated using a simulation on a test feeder.
Open AccessAn Operational Approach to Multi-Objective Optimization for Volt-VAr Control
Recent research has enabled the integration of traditional Volt-VAr Control (VVC) resources, such as capacitor banks and transformer tap changers, with Distributed Energy Resources (DERs), such as photo-voltaic sources and energy storage, in order to achieve various Volt-VAr Optimization (VVO) targets, such as Conservation Voltage Reduction (CVR), minimizing VAr flow at the transformer, minimizing grid losses, minimizing asset operations and more. When more than one target function can be optimized, the question of multi-objective optimization is raised. In this work, a general formulation of the multi-objective Volt-VAr Optimization problem is proposed. The applicability of various multi-optimization techniques is considered and the operational interpretation of these solutions is discussed. The methods are demonstrated using a simulation on a test feeder.
- Open Access
- 20 August 2020
- Published by MDPI AG in Preprints.org
An Operational Approach to Multi-Objective Optimization of Volt-VAr Control
Recent research has enabled the integration of traditional Volt-VAr Control (VVC) resources, such as capacitors banks and transformer tap changers, with Distributed Energy Resources (DERs), such as photo-voltaic sources and energy storage, in order to achieve various Volt-VAr Optimization (VVO) targets, such as Conservation Voltage Reduction (CVR), minimizing VAr flow at the transformer, minimizing grid losses, minimizing asset operations and more. When more than one target function can be optimized, the question of multi-objective optimization is raised. In this work, we propose a general formulation of the multi-objective Volt-VAr optimization problem. We consider the applicability of various multi-optimization techniques and discuss the operational interpretation of these solutions. We demonstrate the methods using simulation on a test feeder.
- 20 August 2020
- Published by MDPI AG in Preprints.org
Open AccessAn Operational Approach to Multi-Objective Optimization of Volt-VAr Control
Recent research has enabled the integration of traditional Volt-VAr Control (VVC) resources, such as capacitors banks and transformer tap changers, with Distributed Energy Resources (DERs), such as photo-voltaic sources and energy storage, in order to achieve various Volt-VAr Optimization (VVO) targets, such as Conservation Voltage Reduction (CVR), minimizing VAr flow at the transformer, minimizing grid losses, minimizing asset operations and more. When more than one target function can be optimized, the question of multi-objective optimization is raised. In this work, we propose a general formulation of the multi-objective Volt-VAr optimization problem. We consider the applicability of various multi-optimization techniques and discuss the operational interpretation of these solutions. We demonstrate the methods using simulation on a test feeder.
- 1 December 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
ARPM: Additive, Retentive Penalty Method for Multidimensional NILM Algorithms
Nonintrusive load monitoring (NILM) algorithms may suggest different approaches for solving the NILM problem: the disintegrating of total power consumption to the discrete appliances comprising it. All of these algorithms incorporate some cost function to discriminate between the possible options at each sample time. For the estimation process of such algorithms, and the selection of the most likely possibility, we propose a new formulation of a family of cost functions, on the set of the possible assertions per each appliance. The proposed design, abbreviated ARPM (Additive, Retentive Penalty Method), emphasizes two major properties that were discovered to be significant when performing real-time estimation in a NILM system. The first is a granular calculation of Hamming distances between possibilities, and the second is the processing of the changes in the measured power consumption, rather than the consumption value itself. This design consists of a low number of free parameters, and can be integrated additively and seamlessly with existing cost functions already embedded in NILM systems. It had been evaluated with a series of experiments and proven to enhance the success rate by all measured criteria and on various datasets, with no parameter adjustments.
- 1 December 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
ARPM: Additive, Retentive Penalty Method for Multidimensional NILM Algorithms
Nonintrusive load monitoring (NILM) algorithms may suggest different approaches for solving the NILM problem: the disintegrating of total power consumption to the discrete appliances comprising it. All of these algorithms incorporate some cost function to discriminate between the possible options at each sample time. For the estimation process of such algorithms, and the selection of the most likely possibility, we propose a new formulation of a family of cost functions, on the set of the possible assertions per each appliance. The proposed design, abbreviated ARPM (Additive, Retentive Penalty Method), emphasizes two major properties that were discovered to be significant when performing real-time estimation in a NILM system. The first is a granular calculation of Hamming distances between possibilities, and the second is the processing of the changes in the measured power consumption, rather than the consumption value itself. This design consists of a low number of free parameters, and can be integrated additively and seamlessly with existing cost functions already embedded in NILM systems. It had been evaluated with a series of experiments and proven to enhance the success rate by all measured criteria and on various datasets, with no parameter adjustments.
- 10 June 2013
- Published by Elsevier in Electronic Notes in Discrete Mathematics
- Vol. 41, 101-108
A Study of the Connectivity Over Time Behavior of On-Demand Ad Hoc Path Selection Schemes
- 10 June 2013
- Published by Elsevier in Electronic Notes in Discrete Mathematics
- Vol. 41, 101-108
A Study of the Connectivity Over Time Behavior of On-Demand Ad Hoc Path Selection Schemes
- 1 December 2011
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 181-184
A pseudo-efficient frontier method for solving two-phase packing problems
Packing problems are very common and popular but typical solution procedures involve computation of numerous feasible solutions even for a small scale problem. These types of problems are commonly categorized as knapsack problem or bin packing problems and many of them are NP complete. An efficient mechanism for finding an exact solution for a two phase packing problem is proposed. The mechanism reduces the number of feasible solutions considered by conducting a naïve search for a pseudo efficient frontier of solutions for the first phase. Furthermore, by conduction the first phase in such a way, evaluating the second phase is made more efficient. An algorithm for the two dimensional case is presented along with proofs of correctness and complexity.
- 1 December 2011
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 181-184
A pseudo-efficient frontier method for solving two-phase packing problems
Packing problems are very common and popular but typical solution procedures involve computation of numerous feasible solutions even for a small scale problem. These types of problems are commonly categorized as knapsack problem or bin packing problems and many of them are NP complete. An efficient mechanism for finding an exact solution for a two phase packing problem is proposed. The mechanism reduces the number of feasible solutions considered by conducting a naïve search for a pseudo efficient frontier of solutions for the first phase. Furthermore, by conduction the first phase in such a way, evaluating the second phase is made more efficient. An algorithm for the two dimensional case is presented along with proofs of correctness and complexity.
- 1 January 2011
- Published by Springer Nature
- p. 284-300
Principles of Fairness Quantification in Queueing Systems
- 1 January 2011
- Published by Springer Nature
- p. 284-300
Principles of Fairness Quantification in Queueing Systems
- 14 August 2009
- Published by Elsevier in Performance Evaluation
- Vol. 67 (4) , 235-247
Class prioritization and server dedication in queueing systems: Discrimination and fairness aspects
- 14 August 2009
- Published by Elsevier in Performance Evaluation
- Vol. 67 (4) , 235-247
Class prioritization and server dedication in queueing systems: Discrimination and fairness aspects