193 research outputs found

    Simultaneous fault detection and sensor selection for condition monitoring of wind turbines

    Get PDF
    Data collected from the supervisory control and data acquisition (SCADA) system are used widely in wind farms to obtain operation and performance information about wind turbines. The paper presents a three-way model by means of parallel factor analysis (PARAFAC) for wind turbine fault detection and sensor selection, and evaluates the method with SCADA data obtained from an operational farm. The main characteristic of this new approach is that it can be used to simultaneously explore measurement sample profiles and sensors profiles to avoid discarding potentially relevant information for feature extraction. With K-means clustering method, the measurement data indicating normal, fault and alarm conditions of the wind turbines can be identified, and the sensor array can be optimised for effective condition monitoring

    Tactical fixed job scheduling with spread-time constraints

    Get PDF
    We address the tactical fixed job scheduling problem with spread-time constraints. In such a problem, there are a fixed number of classes of machines and a fixed number of groups of jobs. Jobs of the same group can only be processed by machines of a given set of classes. All jobs have their fixed start and end times. Each machine is associated with a cost according to its machine class. Machines have spread-time constraints, with which each machine is only available for L consecutive time units from the start time of the earliest job assigned to it. The objective is to minimize the total cost of the machines used to process all the jobs. For this strongly NP-hard problem, we develop a branch-and-price algorithm, which solves instances with up to 300 jobs, as compared with CPLEX, which cannot solve instances of 100 jobs. We further investigate the influence of machine flexibility by computational experiments. Our results show that limited machine flexibility is sufficient in most situations

    Scheduling with Time Lags

    Get PDF
    Scheduling is essential when activities need to be allocated to scarce resources over time. Motivated by the problem of scheduling barges along container terminals in the Port of Rotterdam, this thesis designs and analyzes algorithms for various on-line and off-line scheduling problems with time lags. A time lag specifies a minimum time delay required between the execution of two consecutive operations of the same job. Time lags may be the result of transportation delays (like the time required for barges to sail from one terminal to the next), the duration of activities that do not require resources (like drying or cooling down), or intermediate processes on non-bottleneck machines between two bottleneck machines. For the on-line flow shop, job shop and open shop problems of minimizing the makespan, we analyze the competitive ratio of a class of greedy algorithms. For the off-line parallel flow shop scheduling problem with time lags of minimizing the makespan, we design algorithms with fixed worst-case performance guarantees. For two special subsets of scheduling problems with time lags, we show that Polynomial-Time Approximation Schemes (PTAS) can be constructed under certain mild conditions. For the fixed interval scheduling problem, we show that the flow shop problem is solvable in polynomial time in the case of equal time lags but that it is NP-hard in the strong sense for general time lags. The fixed interval two-machine job shop and open shop problems are shown to be solvable in polynomial time if the time lags are smaller than the processing time of any operation

    Approximation algorithms for the parallel flow shop problem

    Get PDF
    We consider the NP-hard problem of scheduling n jobs in m two-stage parallel flow shops so as to minimize the makespan. This problem decomposes into two subproblems: assigning the jobs to parallel flow shops; and scheduling the jobs assigned to the same flow shop by use of Johnson's rule. For m = 2, we present a 32-approximation algorithm, and for m = 3, we present a 127-approximation algorithm. Both these algorithms run in O(n log n) time. These are the first approximation algorithms with fixed worst-case performance guarantees for the parallel flow shop problem

    Scheduling of coupled tasks with exact delays for minimum total job completion time

    Get PDF
    In this paper, we fill in a conspicuous gap in research on scheduling coupled tasks. We draw a full complexity picture for single-machine scheduling of coupled tasks of exact time delays in between with the objective of minimizing the total of job completion times

    Scheduling with time-of-use costs

    Get PDF
    We address a class of problems of scheduling a set of independent jobs onto a single machine that charges each job for its processing under variable time-of-use tariffs. Our scheduling objective is to minimize the total cost of processing all the jobs subject to a minimum level of performance in one of the regular scheduling criteria. For each of the problems in the class, we establish its computational tractability. For those that are tractable we provide an efficient algorithm, while for those that are intractable we provide a pseudo-polynomial-time algorithm or a polynomial-time approximation scheme

    An atmospheric origin of the multi-decadal bipolar seesaw

    Get PDF
    A prominent feature of recent climatic change is the strong Arctic surface warming that is contemporaneous with broad cooling over much of Antarctica and the Southern Ocean. Longer global surface temperature observations suggest that this contrasting pole-to-pole change could be a manifestation of a multi-decadal interhemispheric or bipolar seesaw pattern, which is well correlated with the North Atlantic sea surface temperature variability, and thus generally hypothesized to originate from Atlantic meridional overturning circulation oscillations. Here, we show that there is an atmospheric origin for this seesaw pattern. The results indicate that the Southern Ocean surface cooling (warming) associated with the seesaw pattern is attributable to the strengthening (weakening) of the Southern Hemisphere westerlies, which can be traced to Northern Hemisphere and tropical tropospheric warming (cooling). Antarctic ozone depletion has been suggested to be an important driving force behind the recently observed increase in the Southern Hemisphere's summer westerly winds; our results imply that Northern Hemisphere and tropical warming may have played a triggering role at an stage earlier than the first detectable Antarctic ozone depletion, and enhanced Antarctic ozone depletion through decreasing the lower stratospheric temperature

    Neural Video Fields Editing

    Full text link
    Diffusion models have revolutionized text-driven video editing. However, applying these methods to real-world editing encounters two significant challenges: (1) the rapid increase in GPU memory demand as the number of frames grows, and (2) the inter-frame inconsistency in edited videos. To this end, we propose NVEdit, a novel text-driven video editing framework designed to mitigate memory overhead and improve consistent editing for real-world long videos. Specifically, we construct a neural video field, powered by tri-plane and sparse grid, to enable encoding long videos with hundreds of frames in a memory-efficient manner. Next, we update the video field through off-the-shelf Text-to-Image (T2I) models to impart text-driven editing effects. A progressive optimization strategy is developed to preserve original temporal priors. Importantly, both the neural video field and T2I model are adaptable and replaceable, thus inspiring future research. Experiments demonstrate the ability of our approach to edit hundreds of frames with impressive inter-frame consistency. Our project is available at: https://nvedit.github.io/

    Effect of doubly fed induction generatortidal current turbines on stability of a distribution grid under unbalanced voltage conditions

    Get PDF
    This paper analyses the effects of doubly fed induction generator (DFIG) tidal current turbines on a distribution grid under unbalanced voltage conditions of the grid. A dynamic model of an electrical power system under the unbalanced network is described in the paper, aiming to compare the system performance when connected with and without DFIG at the same location in a distribution grid. Extensive simulations of investigating the effect of DFIG tidal current turbine on stability of the distribution grid are performed, taking into account factors such as the power rating, the connection distance of the turbine and the grid voltage dip. The dynamic responses of the distribution system are examined, especially its ability to ride through fault events under unbalanced grid voltage conditions. The research has shown that DFIG tidal current turbines can provide a good damping performance and that modern DFIG tidal current power plants, equipped with power electronics and low-voltage ride-through capability, can stay connected to weak electrical grids even under the unbalanced voltage conditions, whilst not reducing system stability
    corecore