The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
A novel approach is anticipated in this paper for optimal feeder reconfiguration and placement of DG units in distribution system with an objective of reduction of real power losses while satisfying operating constraints. Selective Particle Swarm Optimization algorithm (SPSO), modified version of Binary Particle Swarm Optimization algorithm, is used to obtain reconfigured distribution network. A novel...
The significance of optimal distributed generations (DG) placement is to offer the appropriate locations and sizes of DG units. A novel technique is proposed in this paper for optimal placement of DG units in radial distribution system to reduce real power losses while satisfying operating constraints. The proposed method for optimal placement of DG units is developed based on a new mathematical formulation...
Researchers have proposed several mechanisms to secure data from unauthorized use but there is very less work in the field of detecting and managing an authorized or trustworthy agent that has caused a data leak to some third party advertently or unknowingly. In this paper, we implement methods aimed at improving the odds of detecting such leakages when a distributer's sensitive data has been leaked...
Complex automotive networked embedded systems require novel algorithms for exploring different design decisions at early stages of the design flow. The problem of allocating the software components on electronic control units lies at the core of these design decisions. This paper formalizes this allocation problem using graph theory. The proposed formalism allows the designer to use a wide variety...
Nonlinear Resource Allocation Problems are concerned with the optimal allocation of N continuous resources to M missions/tasks with nonlinear utilities. Numerous problems from diverse fields such as search theory, statistics, finance, economics, logistics, sensor and wireless networks fit this formulation. Several centralized/synchronous algorithms are available for solving this problem including...
We study the problem of optimally assigning N divisible resources to M competing tasks. This is called the Nonlinear Resource Allocation Problem (RAP). Recently, we proposed a new algorithm, RAP Auction [1], which finds a near optimal solution in finite time. It works for monotonic convex cost functions and has a simple computation structure. In this paper, we propose an elegant extension which enables...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.