11 resultados para Non-autonomous semilinear parabolic problems
em Greenwich Academic Literature Archive - UK
Resumo:
Sufficient conditions for the exponential stability of a class ofnonlinear, non-autonomous stochastic differential equations in infinitedimensions are studied. The analysis consists of introducing a suitableapproximating solution systems and using a limiting argument to pass onstability of strong solutions to mild ones. As a consequence, the classicalcriteriaof stability in A. Ichikawa [8] are improved and extended to cover a class ofnon-autonomous stochastic evolution equations.Two examples are investigated to illustrate our theory.
Resumo:
In the scheduling literature, the notion of machine non availability periods is well known, for instance for maintenance. In our case of planning chemical experiments, we have special periods (the week-ends, holidays, vacations) where the chemists are not available. However, human intervention by the chemists is required to handle the starting and termination of the experiments. This gives rise to a new type of scheduling problems, namely problems of finding schedules that respect the operator non availability periods. These problems are analyzed on a single machine with the makespan as criterion. Properties are described and performance ratios are given for list scheduling and other polynomial-time algorithms.
Resumo:
The paper deals with the determination of an optimal schedule for the so-called mixed shop problem when the makespan has to be minimized. In such a problem, some jobs have fixed machine orders (as in the job-shop), while the operations of the other jobs may be processed in arbitrary order (as in the open-shop). We prove binary NP-hardness of the preemptive problem with three machines and three jobs (two jobs have fixed machine orders and one may have an arbitrary machine order). We answer all other remaining open questions on the complexity status of mixed-shop problems with the makespan criterion by presenting different polynomial and pseudopolynomial algorithms.
Resumo:
A vertex-based finite volume (FV) method is presented for the computational solution of quasi-static solid mechanics problems involving material non-linearity and infinitesimal strains. The problems are analysed numerically with fully unstructured meshes that consist of a variety of two- and threedimensional element types. A detailed comparison between the vertex-based FV and the standard Galerkin FE methods is provided with regard to discretization, solution accuracy and computational efficiency. For some problem classes a direct equivalence of the two methods is demonstrated, both theoretically and numerically. However, for other problems some interesting advantages and disadvantages of the FV formulation over the Galerkin FE method are highlighted.
Resumo:
Inverse heat conduction problems (IHCPs) appear in many important scientific and technological fields. Hence analysis, design, implementation and testing of inverse algorithms are also of great scientific and technological interest. The numerical simulation of 2-D and –D inverse (or even direct) problems involves a considerable amount of computation. Therefore, the investigation and exploitation of parallel properties of such algorithms are equally becoming very important. Domain decomposition (DD) methods are widely used to solve large scale engineering problems and to exploit their inherent ability for the solution of such problems.
Resumo:
The paper considers a scheduling model that generalizes the well-known open shop, flow shop, and job shop models. For that model, called the super shop, we study the complexity of finding a time-optimal schedule in both preemptive and non-preemptive cases assuming that precedence constraints are imposed over the set of jobs. Two types of precedence rela-tions are considered. Most of the arising problems are proved to be NP-hard, while for some of them polynomial-time algorithms are presented.
Resumo:
In this past decade finite volume (FV) methods have increasingly been used for the solution of solid mechanics problems. This contribution describes a cell vertex finite volume discretisation approach to the solution of geometrically nonlinear (GNL) problems. These problems, which may well have linear material properties, are subject to large deformation. This requires a distinct formulation, which is described in this paper together with the solution strategy for GNL problem. The competitive performance for this procedure against the conventional finite element (FE) formulation is illustrated for a three dimensional axially loaded column.
Resumo:
This paper, a 2-D non-linear electric arc-welding problem is considered. It is assumed that the moving arc generates an unknown quantity of energy which makes the problem an inverse problem with an unknown source. Robust algorithms to solve such problems e#ciently, and in certain circumstances in real-time, are of great technological and industrial interest. There are other types of inverse problems which involve inverse determination of heat conductivity or material properties [CDJ63][TE98], inverse problems in material cutting [ILPP98], and retrieval of parameters containing discontinuities [IK90]. As in the metal cutting problem, the temperature of a very hot surface is required and it relies on the use of thermocouples. Here, the solution scheme requires temperature measurements lied in the neighbourhood of the weld line in order to retrieve the unknown heat source. The size of this neighbourhood is not considered in this paper, but rather a domain decomposition concept is presented and an examination of the accuracy of the retrieved source are presented. This paper is organised as follows. The inverse problem is formulated and a method for the source retrieval is presented in the second section. The source retrieval method is based on an extension of the 1-D source retrieval method as proposed in [ILP].
Resumo:
This paper considers two-machine flow shop scheduling problems with machine availability constraints. When the processing of a job is interrupted by an unavailability period of a machine, we consider both the resumable scenario in which the processing can be resumed when the machine next becomes available, and the semi-resumable scenario in which some portion of the processing is repeated but the job is otherwise resumable. For the problem with several non-availability intervals on the first machine under the resumable scenario, we present a fast (3/2)-approximation algorithm. For the problem with one non-availability interval under the semi-resumable scenario, a polynomial-time approximation scheme is developed.
Resumo:
Research has established that individuals who tend to vary their personality depending on who they are with, show a variety of signs of psychological maladjustment in comparison to those who do not; they show more negative affect (Baird, Le and Lucas, 2006), lower life satisfaction (Suh, 2002), lower self-esteem (Sheldon et al., 1997), lower role-satisfaction (Donahue et al., 1993), higher rates of depression (Lutz and Ross, 2003), more anxiety (Diehl, Hastings and Stanton, 2001) and poorer physical health (Cross, Gore and Morris, 2003). It has also been shown that personality variability is positively related to the experience of inauthenticity and falsity (Sheldon et al., 1997). Donahue, Roberts, Robins and John (1993) found that personality inconsistency of this type is related to tension within the family. Psychoanalytic theory has also linked the operation of an adult false self to experiences with parents, particularly in early life (Winnicott, 1960). It was hypothesized that personality variability and the adult experience of falsity in social situations would be related to an emotionally unstable relationship with parents. The method to test this comprised a questionnaire-based survey given to a non-clinical population. The final sample comprised 305, with 193 women and 112 men, aged from 19 to 55. The first questionnaire asked participants to rate personality traits, including emotional stability, in three social contexts - with parents, with friends and with work colleagues. The second part involved 3 questions; participants were asked to select in which of the aforementioned three social contexts they felt “most themselves”; in which they were “most authentic” and in which they “put on a front”. It was found, consistent with predictions, that an index of overall personality variability calculated from the personality questionnaire correlated strongly with emotional instability around parents (r = 0.46, p<0.001), while not correlating with emotional instability in either of the other two contexts measured. This suggests a specific link between a person’s relationship with their parents and their overall personality integration. Furthermore, it was found that participants who cited one of the three social contexts (parents, friends, work colleagues) as being one in which they were “more themselves” or “more authentic” had significantly higher ratings of emotional instability with parents than those participants who found that they were equally authentic across settings (F = 9.8, p<0.005). The results suggest a clear link between a person’s relationships with their parents and their adult personality integration. An explanation is that individuals who experience an anxious or ambiguous attachment with their parents in childhood may fear rejection or abandonment in later life, and so habitually adapt their personality to fit in to social contexts as adults, in order to be accepted by others and to minimize the possibility of social rejection. These individuals meanwhile retain an emotionally unstable relationship with their parents in adulthood. This interpretation is speculative but is open to empirical testing. Clinicians should be aware that attachment problems with parents may underlie poor personality integration in adulthood.