966 resultados para SOLVABLE LIE-ALGEBRAS
Resumo:
The paper considers the single machine due date assignment and scheduling problems with n jobs in which the due dates are to be obtained from the processing times by adding a positive slack q. A schedule is feasible if there are no tardy jobs and the job sequence respects given precedence constraints. The value of q is chosen so as to minimize a function ϕ(F,q) which is non-decreasing in each of its arguments, where F is a certain non-decreasing earliness penalty function. Once q is chosen or fixed, the corresponding scheduling problem is to find a feasible schedule with the minimum value of function F. In the case of arbitrary precedence constraints the problems under consideration are shown to be NP-hard in the strong sense even for F being total earliness. If the precedence constraints are defined by a series-parallel graph, both scheduling and due date assignment problems are proved solvable in time, provided that F is either the sum of linear functions or the sum of exponential functions. The running time of the algorithms can be reduced to if the jobs are independent. Scope and purpose We consider the single machine due date assignment and scheduling problems and design fast algorithms for their solution under a wide range of assumptions. The problems under consideration arise in production planning when the management is faced with a problem of setting the realistic due dates for a number of orders. The due dates of the orders are determined by increasing the time needed for their fulfillment by a common positive slack. If the slack is set to be large enough, the due dates can be easily maintained, thereby producing a good image of the firm. This, however, may result in the substantial holding cost of the finished products before they are brought to the customer. The objective is to explore the trade-off between the size of the slack and the arising holding costs for the early orders.
Resumo:
This paper examines scheduling problems in which the setup phase of each operation needs to be attended by a single server, common for all jobs and different from the processing machines. The objective in each situation is to minimize the makespan. For the processing system consisting of two parallel dedicated machines we prove that the problem of finding an optimal schedule is NP-hard in the strong sense even if all setup times are equal or if all processing times are equal. For the case of m parallel dedicated machines, a simple greedy algorithm is shown to create a schedule with the makespan that is at most twice the optimum value. For the two machine case, an improved heuristic guarantees a tight worst-case ratio of 3/2. We also describe several polynomially solvable cases of the later problem. The two-machine flow shop and the open shop problems with a single server are also shown to be NP-hard in the strong sense. However, we reduce the two-machine flow shop no-wait problem with a single server to the Gilmore-Gomory traveling salesman problem and solve it in polynomial time. (c) 2000 John Wiley & Sons, Inc.
Resumo:
This paper considers the problem of processing n jobs in a two-machine non-preemptive open shop to minimize the makespan, i.e., the maximum completion time. One of the machines is assumed to be non-bottleneck. It is shown that, unlike its flow shop counterpart, the problem is NP-hard in the ordinary sense. On the other hand, the problem is shown to be solvable by a dynamic programming algorithm that requires pseudopolynomial time. The latter algorithm can be converted into a fully polynomial approximation scheme that runs in time. An O(n log n) approximation algorithm is also designed whi finds a schedule with makespan at most 5/4 times the optimal value, and this bound is tight.
Resumo:
We study the special case of the m machine flow shop problem in which the processing time of each operation of job j is equal to pj; this variant of the flow shop problem is known as the proportionate flow shop problem. We show that for any number of machines and for any regular performance criterion we can restrict our search for an optimal schedule to permutation schedules. Moreover, we show that the problem of minimizing total weighted completion time is solvable in O(n2) time. © 1998 John Wiley & Sons, Ltd.
Resumo:
We survey recent results on the computational complexity of mixed shop scheduling problems. In a mixed shop, 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). The main attention is devoted to establishing the boundary between polynomially solvable and NP-hard problems. When the number of operations per job is unlimited, we focus on problems with a fixed number of jobs.
Resumo:
We consider various single machine scheduling problems in which the processing time of a job depends either on its position in a processing sequence or on its start time. We focus on problems of minimizing the makespan or the sum of (weighted) completion times of the jobs. In many situations we show that the objective function is priority-generating, and therefore the corresponding scheduling problem under series-parallel precedence constraints is polynomially solvable. In other situations we provide counter-examples that show that the objective function is not priority-generating.
Resumo:
The reactions to the 9/11 terror attacks were immense in the western population. In the current review, the impact of terror attacks is presented with surveys, clinical interviews, and scientific polls, which were identified in a comprehensive literature search. Results show that the fear of further terror attacks is comparatively overestimated in the population and is associated with numerous psychological consequences and reactions. The overestimation of the probability of further terror attacks is related among other reasons to its unique features and its strong representation in the media. Several independent studies proved that the number of stress symptoms and psychiatric diagnoses is associated with a high risk perception in relation to terror attacks. This was not only the case for victims of terror attacks, but also for people indirectly exposed to the terror attacks. In addition, there is evidence that the number of the stress symptoms correlate with the duration of TV consumption of new findings about terror attempts. Methodologically, there is a critical lack of more in-depth analyses to explain the development of risk perceptions and its influence on mental and physical health. Because of the international importance and cross-cultural differences, an international standardization of research is desirable. [In German] Die Reaktionen auf die Terrorattentate vom 9. September 2001 in New York waren in der westlichen Bevölkerung immens. In der vorliegenden Übersichtsarbeit werden die Auswirkungen von Terrorattentaten durch Einbeziehung bevölkerungsrepräsentativer Untersuchungen, Surveys, klinischer Interviews und Einstellungsbefragungen dargestellt, die über eine deskriptive Literaturrecherche ermittelt wurden. Als Ergebnis des Reviews zeigt sich, dass die Angst vor weiteren Terrorattentaten in der Bevölkerung vergleichsweise hoch und mit zahlreichen psychologischen Folgen und Reaktionen assoziiert ist. Die Einschätzung der Auftretenswahrscheinlichkeit eines Terrorattentats hängt unter anderem mit den besonderen Charakteristika und der hohen medialen Präsenz des Themas zusammen. Die Anzahl der Stresssymptome bis hin zu psychiatrischen Diagnosen erwies sich in mehreren unabhängigen Untersuchungen mit einer hohen Risikowahrnehmung assoziiert. Dies ließ sich nicht nur bei den Opfern von Terrorattentaten, sondern auch bei indirekt Betroffenen zeigen. Darüber hinaus gibt es mehrfache Belege dafür, dass die Anzahl der Stresssymptome mit der Dauer des TV-Konsums über Neuigkeiten zu Terrorattentaten zusammenhing. Als methodische Kritik ist an den gegenwärtigen Untersuchungsszenarien einzuwenden, dass es derzeit keine tiefer gehenden Analysen zur Entwicklung der Risikowahrnehmung und zu ihrem Einfluss auf die Gesundheit gibt. Aufgrund der internationalen Bedeutung des Themas und der interkulturellen Unterschiede im Umgang mit Krisensituationen ist eine internationale Standardisierung von Untersuchungszugängen wünschenswert.
Resumo:
The relatively new recreational pursuit of coasteering, which has developed in the St David's area of Pembrokeshire, appears to be expanding rapidly. The majority of local commercial recreation providers (outdoor pursuit centers etc.) now appear to offer this pursuit. The majority of the rocky coastlines where it takes place lie within Pembrokeshire Marine Special Area of Conservation (SAC), and are also Sites of Special Scientific Interest (SSSI). No assessment has yet been undertaken of coasteering's potential impact on the intertidal habitats. Therefore the Countryside Council for Wales (CCW) commissioned the Marine Life Information Network (MarLIN) to undertake a desk study of the likely environmental effects of coasteering on rocky intertidal habitats within the Pembrokeshire marine SAC. The desk study was based on a review of the available literature, and in particular the effects of trampling on rocky intertidal communities. Communities (as biotopes) within the Pembrokeshire marine SAC likely to be exposed to coasteering activities were identified from Phase I biotope data for the area, provided by CCW. Where possible, existing research by MarLIN into the intolerance, recoverability and sensitivity of the biotopes identified, was used to identify their potential vulnerability to trampling. The literature review revealed that: - foliose canopy forming algae (e.g. fucoids) were particularly intolerant and sensitive to trampling impacts; - trampling damaged erect coralline turfs, barnacles, and resulted in an increase in bare space; in some cases paths across the shore were visible; - on brown algae dominated shores, understorey algae could suffer due to increased desiccation but algal turf species, opportunists and gastropod grazers (e.g. limpets) could increase in abundance as an indirect effect of trampling, and that - trampling impacts resulted from physical contact and wear and were dependant on the intensity, duration, and frequency of trampling, and even the type of footwear used. A total of 19 intolerant rocky intertidal biotopes were identified as potentially vulnerable to trampling and hence coasteering within the Pembrokeshire marine SAC, of which six are of Welsh importance and eight are nationally rare or scarce. Trampling is a highly localized impact and it was not possible to identify biotopes, and hence communities, actually impacted by coasteering activities in the Pembrokeshire marine SAC. In addition, the majority of the literature addresses the impacts of trampling on wave sheltered or moderately exposed brown algal dominated shores, while coasteering occurs on more wave exposed, steeply inclined shores. Therefore, direct survey of the routes used by coasteering groups within the Pembrokeshire marine SAC is required to identify the intensity, duration and frequency of trampling impact, together with the communities impacted. Given the paucity of data concerning trampling effects in the rocky intertidal in the UK, a survey of the impacts of coasteering would provide an opportunity to examine the effects of trampling and visitor use in steep rocky, wave exposed shores. The report recognizes the potential to engage coasteerers in contributing to the development of strategies for minimizing adverse impacts, recording impacts and collecting information of use in identifying climate change and the occurrence of non-native species.
Resumo:
J.W. Binns, Modern Language Review 101.2 (2006), 504-5:
‘This book is an important contribution to the study of Anglo-Latin poetry in the late seventeenth and early eighteenth centuries … ’Haan provides an able and authoritative account …, setting the poems in their contexts, and providing for each a very clear and penetrating analysis which traces the classical well-springs that lie behind much of Addison’s Latin writing, and also calls attention to non-traditional elements’.
Resumo:
BACKGROUND: Sialorrhoea, the symptom of apparent excessive secretion of saliva is a relatively uncommon complaint. Some authors consider that in the absence of clinical findings, then these patients have a psychiatric disorder masquerading as a physical illness. However, there is little evidence in the literature to support this conclusion and a detailed psychological assessment of this population has not previously been reported. METHODS: In total, 18 patients and 18 age- and sex-matched controls were studied. All had a history of a complaint of excess salivation in the absence of any oral mucosal or systemic abnormality. All patients completed an Eysenck Personality Questionnaire. RESULTS: There were no differences in the extroversion of psychoticism scores between the study and control group. However, the result showed significant increases in the neuroticism and Lie Scale score in the patient group. CONCLUSIONS: The overall results of this study indicate that the complaint of sialorrhoea in otherwise healthy individuals does not have an organic basis and suggest that sialorrhoea is associated with high levels of neuroticism and a tendency to dissimulate. © Blackwell Munksgaard 2006. All rights reserved.
Resumo:
Employing Bak’s dimension theory, we investigate the nonstable quadratic K-group K1,2n(A, ) = G2n(A, )/E2n(A, ), n 3, where G2n(A, ) denotes the general quadratic group of rank n over a form ring (A, ) and E2n(A, ) its elementary subgroup. Considering form rings as a category with dimension in the sense of Bak, we obtain a dimension filtration G2n(A, ) G2n0(A, ) G2n1(A, ) E2n(A, ) of the general quadratic group G2n(A, ) such that G2n(A, )/G2n0(A, ) is Abelian, G2n0(A, ) G2n1(A, ) is a descending central series, and G2nd(A)(A, ) = E2n(A, ) whenever d(A) = (Bass–Serre dimension of A) is finite. In particular K1,2n(A, ) is solvable when d(A) <.
Resumo:
We study the continuity of the map Lat sending an ultraweakly closed operator algebra to its invariant subspace lattice. We provide an example showing that Lat is in general discontinuous and give sufficient conditions for the restricted continuity of this map. As consequences we obtain that Lat is continuous on the classes of von Neumann and Arveson algebras and give a general approximative criterion for reflexivity, which extends Arvesonâ??s theorem on the reflexivity of commutative subspace lattices.
Resumo:
We study properties of subspace lattices related to the continuity of the map Lat and the notion of reflexivity. We characterize various “closedness” properties in different ways and give the hierarchy between them. We investigate several properties related to tensor products of subspace lattices and show that the tensor product of the projection lattices of two von Neumann algebras, one of which is injective, is reflexive.
Resumo:
The authors are concerned with the development of computer systems that are capable of using information from faces and voices to recognise people's emotions in real-life situations. The paper addresses the nature of the challenges that lie ahead, and provides an assessment of the progress that has been made in the areas of signal processing and analysis techniques (with regard to speech and face), and the psychological and linguistic analyses of emotion. Ongoing developmental work by the authors in each of these areas is described.