The objective of fuel scheduling is to minimize the operating cost over a given time period while satisfying several constraints including fuel supply, fuel inventory, total power requirement, and generating unit powe...
详细信息
The objective of fuel scheduling is to minimize the operating cost over a given time period while satisfying several constraints including fuel supply, fuel inventory, total power requirement, and generating unit power limits. This paper presents a comparison of network flow programming (NFP) the out-of-kilter method, the linear programming (LP) revised simplex method, and the nonlinear programming (NLP) generalized reduced gradient method in order to solve the fuel scheduling problem. For application in NFP and LP, a separable programming technique is used to linearize the objective function and the constraints. Results based on sample data obtained from Omaha Public Power District are presented to demonstrate the differences between NFP, LP, and NLP application to this problem.
[Auto Generated] Chapter 1 . Selecting a PL/M-86 Size Control 1.1 Introduction ............................................................................................................................. 1-1 1.2 Maki...
详细信息
[Auto Generated] Chapter 1 . Selecting a PL/M-86 Size Control 1.1 Introduction ............................................................................................................................. 1-1 1.2 Making the Selection .............................................................................................................. 1-2 1.2.1 Ramifications of Your Selection ................................................................................ 1-2 Restrictions Associated with
Components can be used to implement coarse-grained parallelism on large parallel systems. A parallel component is a piece of parallel code that can be executed in parallel on a set of processors or cores and has a pre...
详细信息
ISBN:
(纸本)9781617828409
Components can be used to implement coarse-grained parallelism on large parallel systems. A parallel component is a piece of parallel code that can be executed in parallel on a set of processors or cores and has a predefined interface to be coupled with other components. Depending on the internal programming and memory model, a component may consist of computation and communication phases or, alternatively, of shared memory code. The interfaces are used for data exchange. More complex parallel programs are built up using parallel components and a flexible component interaction structure. In this article, the programming with parallel components for designing efficient programs for parallel execution platforms with a distributed address space is discussed and a mechanism for the specification of parallel components with communication interfaces is presented. The execution of these components can be adapted to the architectural characteristics of multicore clusters with their specific communication structure. The approach is applied to application programs for the solution of large systems of ordinary differential equations.
IntroductionUnity is a powerful and versatile tool for creating real-time experiments. It includes a built-in compute shader language, a C-like programming language designed for massively parallel General-Purpose GPU ...
详细信息
IntroductionUnity is a powerful and versatile tool for creating real-time experiments. It includes a built-in compute shader language, a C-like programming language designed for massively parallel General-Purpose GPU (GPGPU) computing. However, as Unity is primarily developed for multi-platform game creation, its compute shader language has several limitations, including the lack of multi-GPU computation support and incomplete mathematical *** address these limitations, GPU manufacturers have developed specialized programming models, such as CUDA and HIP, which enable developers to leverage the full computational power of modern GPUs. This article introduces an open-source tool designed to bridge the gap between Unity and CUDA, allowing developers to integrate CUDA's capabilities within Unity-based *** proposed solution establishes an interoperability framework that facilitates communication between Unity and CUDA. The tool is designed to efficiently transfer data, execute CUDA kernels, and retrieve results, ensuring seamless integration into Unity's rendering and computation *** tool extends Unity's capabilities by enabling CUDA-based computations, overcoming the inherent limitations of Unity's compute shader language. This integration allows developers to exploit multi-GPU architectures, leverage advanced mathematical functions, and enhance computational performance for real-time applications.
A new approach using fuzzy dynamic programming to decide the optimal location and size of compensation shunt capacitors for distribution systems with harmonic distortion is proposed. To decide the optimal capacitor pl...
详细信息
A new approach using fuzzy dynamic programming to decide the optimal location and size of compensation shunt capacitors for distribution systems with harmonic distortion is proposed. To decide the optimal capacitor placement, a fuzzy dynamic programming model in which the real power loss, voltage deviation, and harmonic distortion are all expressed in fuzzy set notation is developed. The problem is formulated as a fuzzy dynamic programming of the minimization of real power loss and capacitor cost under the constraints of voltage limits and total harmonic distortion. A simple algorithm that is based on the fuzzy set is proposed to determine an optimal solution. This algorithm greatly reduces the effort of finding the optimal location via an exhaustive search. A practical distribution system is selected for computer simulation to test the efficiency of the proposed fuzzy dynamic programming method. It is found that the system loss and harmonic distortion can be reduced very effectively by this proposed algorithm.
The termination-indicator technique is presented, which can be used to solve the class of multi-exit loop problems. A multi-exit loop problem is a programming problem that has several terminating conditions for a loop...
详细信息
The termination-indicator technique is presented, which can be used to solve the class of multi-exit loop problems. A multi-exit loop problem is a programming problem that has several terminating conditions for a loop: either a loop will run through a full cycle or be terminated prematurely when some condition is met. The class of multi-exit loop problems has generated a great deal of controversy on the goto statement in the literature from time to time. The paper illustrates the generality and efficiency of the termination-indicator technique by applying it to the class of multi-exit loop problems and thus puts the goto controversy to rest.
A new algorithm, discrete ascent optimal programming, for optimal power flow in distribution systems is presented. The new algorithm will converge to the same solution as the Lagrange multiplier approach, as demonstra...
详细信息
A new algorithm, discrete ascent optimal programming, for optimal power flow in distribution systems is presented. The new algorithm will converge to the same solution as the Lagrange multiplier approach, as demonstrated by example. An intuitive discussion illustrating the path of convergence is presented along with a theorem concerning convergence. The algorithm is explained with two DC examples which illustrate both unconstrained and constrained solutions. A switch placement design problem is also solved. Advantages of the new algorithm include its simplicity, ease of incorporating inequality constraints, and the ability to predict the number of steps required for convergence.
The acceptance of a software product depends to a considerable extent on the user interface. The class of graphic-oriented user interfaces that are called Intuitive User Interfaces (IUI) is described. These interfaces...
详细信息
The acceptance of a software product depends to a considerable extent on the user interface. The class of graphic-oriented user interfaces that are called Intuitive User Interfaces (IUI) is described. These interfaces allow the user to learn to operate software programs quickly. In the following the graphical layout put to use in an IUI is elaborated. All images the layout consists of are created with the aid of a paint program. Using these images, a procedure for creating, programming and linking an IUI to software applications is discussed and recommendations are made concerning software and hardware demands for easily creating IUIs. Practical experience of the authors with this procedure, mainly in the medical area, is described.
暂无评论