83 resultados para Mixed integer linear programming (MILP) model
Resumo:
In order to demonstrate the feasibility of Active Fiber Composites (AFC) as sensors for detecting damage, a pretwisted strip made of AFC with symmetric free-edge delamination is considered in this paper. The strain developed on the top/bottom of the strip is measured to detect and assess delamination. Variational Asymptotic Method (VAM) is used in the development of a non-classical non-linear cross sectional model of the strip. The original three dimensional (3D) problem is simplified by the decomposition into two simpler problems: a two-dimensional (2D) problem, which provides in a compact form the cross-sectional properties using VAM, and a non-linear one-dimensional (1D) problem along the length of the beam. This procedure gives the non-linear stiffnesses, which are very sensitive to damage, at any given cross-section of the strip. The developed model is used to study a special case of cantilevered laminated strip with antisymmetric layup, loaded only by an axial force at the tip. The charge generated in the AFC lamina is derived in closed form in terms of the 1D strain measures. It is observed that delamination length and location have a definite influence on the charge developed in the AFC lamina. Also, sensor voltage output distribution along the length of the beam is obtained using evenly distributed electrode strip. These data could in turn be used to detect the presence of damage.
Resumo:
The Radius of Direct attraction of a discrete neural network is a measure of stability of the network. it is known that Hopfield networks designed using Hebb's Rule have a radius of direct attraction of Omega(n/p) where n is the size of the input patterns and p is the number of them. This lower bound is tight if p is no larger than 4. We construct a family of such networks with radius of direct attraction Omega(n/root plog p), for any p greater than or equal to 5. The techniques used to prove the result led us to the first polynomial-time algorithm for designing a neural network with maximum radius of direct attraction around arbitrary input patterns. The optimal synaptic matrix is computed using the ellipsoid method of linear programming in conjunction with an efficient separation oracle. Restrictions of symmetry and non-negative diagonal entries in the synaptic matrix can be accommodated within this scheme.
Resumo:
An improvised algorithm is presented for optimal VAr allocation in a large power system using a linear programming technique. The proposed method requires less computer memory than those algorithms currently available.
Resumo:
This paper presents a method for minimizing the sum of the square of voltage deviations by a least-square minimization technique, and thus improving the voltage profile in a given system by adjusting control variables, such as tap position of transformers, reactive power injection of VAR sources and generator excitations. The control variables and dependent variables are related by a matrix J whose elements are computed as the sensitivity matrix. Linear programming is used to calculate voltage increments that minimize transmission losses. The active and reactive power optimization sub-problems are solved separately taking advantage of the loose coupling between the two problems. The proposed algorithm is applied to IEEE 14-and 30-bus systems and numerical results are presented. The method is computationally fast and promises to be suitable for implementation in real-time dispatch centres.
Resumo:
Three algorithms for reactive power optimization are proposed in this paper with three different objective functions. The objectives in the proposed algorithm are to minimize the sum of the squares of the voltage deviations of the load buses, minimization of sum of squares of voltage stability L-indices of load buses (:3L2) algorithm, and also the objective of system real power loss (Ploss) minimization. The approach adopted is an iterative scheme with successive power flow analysis using decoupled technique and solution of the linear programming problem using upper bound optimization technique. Results obtained with all these objectives are compared. The analysis of these objective functions are presented to illustrate their advantages. It is observed comparing different objective functions it is possible to identify critical On Load Tap Changers (OLTCs) that should be made manual to avoid possible voltage instability due to their operation based on voltage improvement criteria under heavy load conditions. These algorithms have been tested under simulated conditions on few test systems. The results obtained on practical systems of 24-node equivalent EHV Indian power network, and for a 205 bus EHV system are presented for illustration purposes.
Resumo:
This paper proposes a new approach for solving the state estimation problem. The approach is aimed at producing a robust estimator that rejects bad data, even if they are associated with leverage-point measurements. This is achieved by solving a sequence of Linear Programming (LP) problems. Optimization is carried via a new algorithm which is a combination of “upper bound optimization technique" and “an improved algorithm for discrete linear approximation". In this formulation of the LP problem, in addition to the constraints corresponding to the measurement set, constraints corresponding to bounds of state variables are also involved, which enables the LP problem more efficient in rejecting bad data, even if they are associated with leverage-point measurements. Results of the proposed estimator on IEEE 39-bus system and a 24-bus EHV equivalent system of the southern Indian grid are presented for illustrative purpose.
Resumo:
In this paper, sliding-mode-control-based guidance laws to intercept stationary, constant-velocity, and maneuvering targets at a desired impact angle are proposed. The desired impact angle, which is defined in terms of a desired line-of-sight angle, is achieved in finite time by selecting the missile's lateral acceleration to enforce terminal sliding mode on a switching surface designed using nonlinear engagement dynamics. The conditions for capturability are also presented. In addition, by considering a three-degree-of-freedom linear-interceptor dynamic model and by following the procedure used to design a dynamic sliding-mode controller, the interceptor autopilot is designed as a simple static controller to track the lateral acceleration generated by the guidance law. Numerical simulation results are presented to validate the proposed guidance laws and the autopilot design for different initial engagement geometries and impact angles.
Resumo:
We investigate the impact of the Indian Ocean Dipole (IOD) and El Nino and the Southern Oscillation (ENSO) on sea level variations in the North Indian Ocean during 1957-2008. Using tide-gauge and altimeter data, we show that IOD and ENSO leave characteristic signatures in the sea level anomalies (SLAs) in the Bay of Bengal. During a positive IOD event, negative SLAs are observed during April-December, with the SLAs decreasing continuously to a peak during September-November. During El Nino, negative SLAs are observed twice (April-December and November-July), with a relaxation between the two peaks. SLA signatures during negative IOD and La Nina events are much weaker. We use a linear, continuously stratified model of the Indian Ocean to simulate their sea level patterns of IOD and ENSO events. We then separate solutions into parts that correspond to specific processes: coastal alongshore winds, remote forcing from the equator via reflected Rossby waves, and direct forcing by interior winds within the bay. During pure IOD events, the SLAs are forced both from the equator and by direct wind forcing. During ENSO events, they are primarily equatorially forced, with only a minor contribution from direct wind forcing. Using a lead/lag covariance analysis between the Nino-3.4 SST index and Indian Ocean wind stress, we derive a composite wind field for a typical El Nino event: the resulting solution has two negative SLA peaks. The IOD and ENSO signatures are not evident off the west coast of India.
Resumo:
Critical applications like cyclone tracking and earthquake modeling require simultaneous high-performance simulations and online visualization for timely analysis. Faster simulations and simultaneous visualization enable scientists provide real-time guidance to decision makers. In this work, we have developed an integrated user-driven and automated steering framework that simultaneously performs numerical simulations and efficient online remote visualization of critical weather applications in resource-constrained environments. It considers application dynamics like the criticality of the application and resource dynamics like the storage space, network bandwidth and available number of processors to adapt various application and resource parameters like simulation resolution, simulation rate and the frequency of visualization. We formulate the problem of finding an optimal set of simulation parameters as a linear programming problem. This leads to 30% higher simulation rate and 25-50% lesser storage consumption than a naive greedy approach. The framework also provides the user control over various application parameters like region of interest and simulation resolution. We have also devised an adaptive algorithm to reduce the lag between the simulation and visualization times. Using experiments with different network bandwidths, we find that our adaptive algorithm is able to reduce lag as well as visualize the most representative frames.
Resumo:
This paper presents the advanced analytical methodologies such as Double- G and Double - K models for fracture analysis of concrete specimens made up of high strength concrete (HSC, HSC1) and ultra high strength concrete. Brief details about characterization and experimentation of HSC, HSC1 and UHSC have been provided. Double-G model is based on energy concept and couples the Griffith's brittle fracture theory with the bridging softening property of concrete. The double-K fracture model is based on stress intensity factor approach. Various fracture parameters such as cohesive fracture toughness (4), unstable fracture toughness (K-Ic(c)), unstable fracture toughness (K-Ic(un)) and initiation fracture toughness (K-Ic(ini)) have been evaluated based on linear elastic fracture mechanics and nonlinear fracture mechanics principles. Double-G and double-K method uses the secant compliance at the peak point of measured P-CMOD curves for determining the effective crack length. Bi-linear tension softening model has been employed to account for cohesive stresses ahead of the crack tip. From the studies, it is observed that the fracture parameters obtained by using double - G and double - K models are in good agreement with each other. Crack extension resistance has been estimated by using the fracture parameters obtained through double - K model. It is observed that the values of the crack extension resistance at the critical unstable point are almost equal to the values of the unstable fracture toughness K-Ic(un) of the materials. The computed fracture parameters will be useful for crack growth study, remaining life and residual strength evaluation of concrete structural components.
Resumo:
In this paper, we develop a game theoretic approach for clustering features in a learning problem. Feature clustering can serve as an important preprocessing step in many problems such as feature selection, dimensionality reduction, etc. In this approach, we view features as rational players of a coalitional game where they form coalitions (or clusters) among themselves in order to maximize their individual payoffs. We show how Nash Stable Partition (NSP), a well known concept in the coalitional game theory, provides a natural way of clustering features. Through this approach, one can obtain some desirable properties of the clusters by choosing appropriate payoff functions. For a small number of features, the NSP based clustering can be found by solving an integer linear program (ILP). However, for large number of features, the ILP based approach does not scale well and hence we propose a hierarchical approach. Interestingly, a key result that we prove on the equivalence between a k-size NSP of a coalitional game and minimum k-cut of an appropriately constructed graph comes in handy for large scale problems. In this paper, we use feature selection problem (in a classification setting) as a running example to illustrate our approach. We conduct experiments to illustrate the efficacy of our approach.
Resumo:
Observations and models have shown the presence of intraseasonal fluctuations in 20-30-day and 10-20-day bands in the equatorial Indian Ocean west of 60 degrees E (WEIO). Their spatial and temporal structures characterize them as Yanai waves, which we label low-frequency (LFYW) and high-frequency (HFYW) Yanai waves, respectively. We explore the dynamics of these intraseasonal signals, using an ocean general circulation model (Modular Ocean Model) and a linear, continuously stratified model. Yanai waves are forced by the meridional wind tau(y) everywhere in the WEIO most strongly during the monsoon seasons. They are forced both directly in the interior ocean and by reflection of the interior response from the western boundary; interference between the interior and boundary responses results in a complex surface pattern that propagates eastward and has nodes. Yanai waves are also forced by instabilities primarily during June/July in a region offshore from the western boundary (52-55 degrees E). At that time, eddies, generated by barotropic instability of the Southern Gyre, are advected southward to the equator. There, they generate a westward-propagating, cross-equatorial flow field, v(eq), with a wave number/frequency spectrum that fits the dispersion relation of a number of Yanai waves, and these waves are efficiently excited. Typically, Yanai waves associated with several baroclinic modes are excited by both wind and eddy forcing; and typically, they superpose to create beams that carry energy vertically and eastward along ray paths. The same processes generate LFYWs and HFYWs, and hence, their responses are similar; differences are traceable to the property that HFYWs have longer wavelengths than LFYWs for each baroclinic mode.
Resumo:
Transductive SVM (TSVM) is a well known semi-supervised large margin learning method for binary text classification. In this paper we extend this method to multi-class and hierarchical classification problems. We point out that the determination of labels of unlabeled examples with fixed classifier weights is a linear programming problem. We devise an efficient technique for solving it. The method is applicable to general loss functions. We demonstrate the value of the new method using large margin loss on a number of multi-class and hierarchical classification datasets. For maxent loss we show empirically that our method is better than expectation regularization/constraint and posterior regularization methods, and competitive with the version of entropy regularization method which uses label constraints.
Resumo:
In this paper we propose a linear time-varying model for diphthong synthesis based on linear interpolation of formant frequencies. We, thence, determine the timbre just-noticeable difference (JND) for diphthong /a I/ (as in ‘buy’) with a constant pitch excitation through perception experiment involving four listeners and explore the phonetic JND of the diphthong. Their JND responses are determined using 1-up-3-down procedure. Using the experimental data, we map the timbre JND and phonetic JND onto a 2-D region of percentage change of formant glides. The timbre and phonetic JND contours for constant pitch show that the phonetic JND region encloses timbre JND region and also varies across listeners. The JND is observed to be more sensitive to ending vowel /I/ than starting vowel /a/ in some listeners and dependent on the direction of perturbation of starting and ending vowels.
Resumo:
Invasive species, local plant communities and invaded ecosystems change over space and time. Quantifying this change may lead to a better understanding of the ecology and the effective management of invasive species. We used data on density of the highly invasive shrub Lantana camara (lantana) for the period 1990-2008 from a 50 ha permanent plot in a seasonally dry tropical forest of Mudumalai in southern India. We used a cumulative link mixed-effects regression approach to model the transition of lantana from one qualitative density state to another as a function of biotic factors such as indicators of competition from local species (lantana itself, perennial grasses, invasive Chromolaena odorata, the native shrub Helicteres isora and basal area of native trees) and abiotic factors such as fire frequency, inter-annual variability of rainfall and relative soil moisture. The density of lantana increased substantially during the study period. Lantana density was negatively associated with the density of H. isora, positively associated with basal area of native trees, but not affected by the presence of grasses or other invasive species. In the absence of fire, lantana density increased with increasing rainfall. When fires occurred, transitions to higher densities occurred at low rainfall values. In drier regions, lantana changed from low to high density as rainfall increased while in wetter regions of the plot, lantana persisted in the dense category irrespective of rainfall. Lantana seems to effectively utilize resources distributed in space and time to its advantage, thus outcompeting local species and maintaining a population that is not yet self-limiting. High-risk areas and years could potentially be identified based on inferences from this study for facilitating management of lantana in tropical dry forests.