Virtual Path (VP) assignment is an important resource management activity in ATM networks. By using the VP concept, the logical layout of the network can be administered to minimize the total network cost to the provi...
详细信息
Virtual Path (VP) assignment is an important resource management activity in ATM networks. By using the VP concept, the logical layout of the network can be administered to minimize the total network cost to the provider. We formulate the VP assignment problem as a constrained optimization problem;the objective function to be minimized reflects processing/control costs at nodes and transmission costs between nodes. The blocking probability quality of service (QoS) requirements and overall throughput of the network are taken into consideration in the solution process as constraints. Since the solution space is complex, we develop a deterministic, iterative heuristic algorithm to reach a 'near-optimal' VP configuration for a given physical network and traffic demand. The Multi-Rate Loss Network model is used in the calculation of connection-level blocking probabilities. Results for static connection-routing are presented, for various forms of the objective function and constraints.
Cloud storage suffers from security. It is more prone to security breaches due to multitenant architecture and data remanence. Cloud storage is robust as well as promising platform from economic point of view as no ex...
详细信息
The paper carried out a methodology to design stationary energy storage system (ESS) employing a deterministic algorithm. The primary scope is to maximizing economic benefits arriving to define an optimal siting and s...
详细信息
ISBN:
(纸本)9798350387032;9798350387025
The paper carried out a methodology to design stationary energy storage system (ESS) employing a deterministic algorithm. The primary scope is to maximizing economic benefits arriving to define an optimal siting and sizing of the ESS utilizing deterministic algorithm. The objective function of the algorithm is set on the net present value (NPV) calculation. Numerical simulation of a d.c. railway line with new high-speed trains has been presented to assess power flow between trains, leading to the identification of suitable locations and sizes for electrical substations and storage systems within the railway network. The main scope of the proposed approach lies in using an optimization algorithm to maximize the economic advantage of installing an energy storage system in a railway line also minimizing the energy purchase from the grid with low computational effort, versatility and easy implementation features. The methodology proposed has been applied to a case study.
We study the problem of maximizing a monotone submodular function subject to a matroid constraint, and present for it a deterministic non-oblivious local search algorithm that has an approximation guarantee of 1 - 1/e...
详细信息
ISBN:
(纸本)9798331516758;9798331516741
We study the problem of maximizing a monotone submodular function subject to a matroid constraint, and present for it a deterministic non-oblivious local search algorithm that has an approximation guarantee of 1 - 1/e - epsilon (for any epsilon > 0) and query complexity of (O) over tilde (epsilon)(nr), where n is the size of the ground set and r is the rank of the matroid. Our algorithm vastly improves over the previous state-of-the-art 0.5008-approximation deterministic algorithm, and in fact, shows that there is no separation between the approximation guarantees that can be obtained by deterministic and randomized algorithms for the problem considered. The query complexity of our algorithm can be improved to (O) over tilde (epsilon)(n + r root n) using randomization, which is nearly-linear for r = O(root n), and is always at least as good as the previous state-of-the-art algorithms.
We give a deterministic algorithm for computing the diameter of an n-point set in three dimensions with O(n log(c)n) running time, where c is a constant.
We give a deterministic algorithm for computing the diameter of an n-point set in three dimensions with O(n log(c)n) running time, where c is a constant.
Protection devices are designed to provide high sensitivity to transients produced by undesirable conditions like lightning stroke, avoiding their operation under all tolerable events like switching operations. The pr...
详细信息
Protection devices are designed to provide high sensitivity to transients produced by undesirable conditions like lightning stroke, avoiding their operation under all tolerable events like switching operations. The problem of incorrect operation due to transient phenomena can be handled by two means, one is to allow the transients and provide additional logics in the relay, other means is to damp the oscillation from source side. Protection relays' not always must trip or send a trip signal and sometimes, only an alarm is necessary. In this context, this research presents a fast and reliable formulation for transmission lines (TLs) switching operations and lightning strokes detection and identification. The proposed methodology is based on Principal Component Analysis (PCA) and Euclidean Norm (EN);by using PCA it is possible to determine that normal operation signals describe a very well defined Ellipsoidal Pattern (EP). In this manner, by calculating the Euclidean Norm (EN) among Principal Components (PCs) for each sample and the origin of the reference Ellipsoidal Pattern, switching operations and lightning strokes are detected and identified. Test results show that the proposed algorithm presents high success on phenomena detection and identification, presenting a high potential for online applications. (c) 2016 Elsevier Ltd. All rights reserved.
This paper presents a general mathematical optimization model and the related deterministic algorithm for synthesizing heat-exchanger networks (HEN). The methodologies commonly used to solve a HEN problem are based on...
详细信息
This paper presents a general mathematical optimization model and the related deterministic algorithm for synthesizing heat-exchanger networks (HEN). The methodologies commonly used to solve a HEN problem are based on heuristic methods. These algorithms reach a presumed best solution with respect to the investigated set of process streams, whereas our approach determines the optimal configuration. In this paper the proposed method is applied to the solution of a few simple HEN synthesis problems and the results are compared with those obtained utilizing heuristic or meta-heuristic methods. HEN's problem is represented by a general mathematical model that can be applied to small and medium sized problems and is solved by using a deterministic method with a reasonably brief computation time. Notably, this approach can represent a unique general model of a wide class of heat-exchanger networks, independently of their specific physical configuration. (C) 2006 Elsevier Ltd. All rights reserved.
A novel methodology to provide effective fault protection featuring high speed and excellent selectivity is presented. Principal component analysis made up of a set of travelling wave current signals, measured at one ...
详细信息
A novel methodology to provide effective fault protection featuring high speed and excellent selectivity is presented. Principal component analysis made up of a set of travelling wave current signals, measured at one end of the transmission line, exhibits a well-defined pattern for faults of the same type. This work discloses that the fault current signal projected on the principal component coordinates can define the position, the insertion angle and the fault type (single-phase to ground, isolated two-phase, two-phase to ground and three-phase faults) on transmission lines. In this manner, it is possible to effectively categorise internal faults as well as distinguish when the fault is outside the line. Time windows less than a quarter of cycle of the power frequency are used to measure the current signals, thus the methodology is applicable for high-speed protection systems.
This paper presents a new deterministic method and a polynomial-time algorithm for solving general huge-sized sensor network localization problems. The problem is first formulated as a nonconvex minimization, which wa...
详细信息
This paper presents a new deterministic method and a polynomial-time algorithm for solving general huge-sized sensor network localization problems. The problem is first formulated as a nonconvex minimization, which was considered as an NP-hard based on conventional theories. However, by the canonical duality theory, this challenging problem can be equivalently converted into a convex dual problem. By introducing a new optimality measure, a powerful canonical primal-dual interior (CPDI) point algorithm is developed which can solve efficiently huge-sized problems with hundreds of thousands of sensors. The new method is compared with the popular methods in the literature. Results show that the CPDI algorithm is not only faster than the benchmarks but also much more accurate on networks affected by noise on the distances.
Improved cost estimates are given for the problem of computing the inverse of an n x n matrix of univariate polynomials over a field. A deterministic algorithm is demonstrated that has worst case complexity (n(3)s)(1+...
详细信息
Improved cost estimates are given for the problem of computing the inverse of an n x n matrix of univariate polynomials over a field. A deterministic algorithm is demonstrated that has worst case complexity (n(3)s)(1+o(1)) field operations, where s >= 1 is an upper bound for the average column degree of the input matrix. Here, the "+o(1)" in the exponent indicates a missing factor c(1) (log ns)(c2) for positive real constants c(1) and c(2). As an application we show how to compute the largest invariant factor of the input matrix in (n(omega)s)(1+o(1)) field operations, where omega is the exponent of matrix multiplication. (C) 2014 Elsevier Inc. All rights reserved.
暂无评论